/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-acceleration/array_1-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 02:47:30,542 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 02:47:30,544 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 02:47:30,577 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 02:47:30,578 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 02:47:30,579 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 02:47:30,585 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 02:47:30,590 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 02:47:30,591 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 02:47:30,596 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 02:47:30,597 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 02:47:30,598 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 02:47:30,598 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 02:47:30,599 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 02:47:30,600 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 02:47:30,600 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 02:47:30,601 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 02:47:30,601 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 02:47:30,603 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 02:47:30,604 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 02:47:30,605 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 02:47:30,608 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 02:47:30,610 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 02:47:30,611 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 02:47:30,612 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 02:47:30,620 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 02:47:30,620 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 02:47:30,621 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 02:47:30,621 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 02:47:30,622 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 02:47:30,622 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 02:47:30,623 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 02:47:30,623 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 02:47:30,624 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 02:47:30,624 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 02:47:30,625 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 02:47:30,625 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 02:47:30,625 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 02:47:30,625 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 02:47:30,625 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 02:47:30,626 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 02:47:30,626 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 02:47:30,627 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 02:47:30,634 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 02:47:30,634 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 02:47:30,642 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 02:47:30,642 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 02:47:30,642 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 02:47:30,643 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 02:47:30,643 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 02:47:30,643 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 02:47:30,643 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 02:47:30,644 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 02:47:30,644 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 02:47:30,644 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 02:47:30,644 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 02:47:30,645 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 02:47:30,645 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 02:47:30,645 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 02:47:30,645 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 02:47:30,645 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 02:47:30,645 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 02:47:30,645 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 02:47:30,646 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 02:47:30,646 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 02:47:30,646 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 02:47:30,646 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 02:47:30,646 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 02:47:30,646 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 02:47:30,864 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 02:47:30,898 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 02:47:30,900 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 02:47:30,901 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 02:47:30,901 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 02:47:30,902 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/array_1-1.c [2022-04-28 02:47:30,960 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f80c36006/e9fec0ca553143e9903698658e1963c7/FLAG333b20c67 [2022-04-28 02:47:31,301 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 02:47:31,302 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/array_1-1.c [2022-04-28 02:47:31,306 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f80c36006/e9fec0ca553143e9903698658e1963c7/FLAG333b20c67 [2022-04-28 02:47:31,316 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f80c36006/e9fec0ca553143e9903698658e1963c7 [2022-04-28 02:47:31,317 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 02:47:31,319 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 02:47:31,323 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 02:47:31,323 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 02:47:31,327 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 02:47:31,332 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:47:31" (1/1) ... [2022-04-28 02:47:31,333 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5110a21c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:47:31, skipping insertion in model container [2022-04-28 02:47:31,333 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:47:31" (1/1) ... [2022-04-28 02:47:31,339 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 02:47:31,349 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 02:47:31,496 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_1-1.c[321,334] [2022-04-28 02:47:31,506 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 02:47:31,522 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 02:47:31,530 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_1-1.c[321,334] [2022-04-28 02:47:31,535 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 02:47:31,544 INFO L208 MainTranslator]: Completed translation [2022-04-28 02:47:31,544 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:47:31 WrapperNode [2022-04-28 02:47:31,544 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 02:47:31,545 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 02:47:31,545 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 02:47:31,545 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 02:47:31,554 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:47:31" (1/1) ... [2022-04-28 02:47:31,555 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:47:31" (1/1) ... [2022-04-28 02:47:31,559 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:47:31" (1/1) ... [2022-04-28 02:47:31,559 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:47:31" (1/1) ... [2022-04-28 02:47:31,564 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:47:31" (1/1) ... [2022-04-28 02:47:31,567 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:47:31" (1/1) ... [2022-04-28 02:47:31,567 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:47:31" (1/1) ... [2022-04-28 02:47:31,568 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 02:47:31,569 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 02:47:31,569 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 02:47:31,569 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 02:47:31,571 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:47:31" (1/1) ... [2022-04-28 02:47:31,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 02:47:31,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:47:31,595 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 02:47:31,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 02:47:31,635 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 02:47:31,635 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 02:47:31,636 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 02:47:31,636 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 02:47:31,636 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 02:47:31,636 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 02:47:31,636 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 02:47:31,636 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 02:47:31,636 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 02:47:31,637 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 02:47:31,637 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 02:47:31,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-28 02:47:31,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 02:47:31,638 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 02:47:31,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 02:47:31,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 02:47:31,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 02:47:31,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 02:47:31,687 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 02:47:31,688 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 02:47:31,763 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 02:47:31,769 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 02:47:31,769 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 02:47:31,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:47:31 BoogieIcfgContainer [2022-04-28 02:47:31,770 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 02:47:31,772 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 02:47:31,772 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 02:47:31,775 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 02:47:31,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 02:47:31" (1/3) ... [2022-04-28 02:47:31,776 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b0200cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:47:31, skipping insertion in model container [2022-04-28 02:47:31,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:47:31" (2/3) ... [2022-04-28 02:47:31,776 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b0200cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:47:31, skipping insertion in model container [2022-04-28 02:47:31,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:47:31" (3/3) ... [2022-04-28 02:47:31,777 INFO L111 eAbstractionObserver]: Analyzing ICFG array_1-1.c [2022-04-28 02:47:31,789 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 02:47:31,789 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 02:47:31,824 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 02:47:31,830 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6de98c2c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6eed7670 [2022-04-28 02:47:31,830 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 02:47:31,837 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 02:47:31,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 02:47:31,843 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:47:31,844 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:47:31,844 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:47:31,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:47:31,849 INFO L85 PathProgramCache]: Analyzing trace with hash 147271546, now seen corresponding path program 1 times [2022-04-28 02:47:31,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:47:31,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [486838326] [2022-04-28 02:47:31,865 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 02:47:31,865 INFO L85 PathProgramCache]: Analyzing trace with hash 147271546, now seen corresponding path program 2 times [2022-04-28 02:47:31,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:47:31,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019673347] [2022-04-28 02:47:31,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:47:31,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:47:31,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:47:32,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:47:32,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:47:32,080 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {24#true} is VALID [2022-04-28 02:47:32,081 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-28 02:47:32,081 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #39#return; {24#true} is VALID [2022-04-28 02:47:32,083 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:47:32,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {24#true} is VALID [2022-04-28 02:47:32,083 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-28 02:47:32,083 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #39#return; {24#true} is VALID [2022-04-28 02:47:32,084 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret6 := main(); {24#true} is VALID [2022-04-28 02:47:32,084 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {29#(= main_~i~0 0)} is VALID [2022-04-28 02:47:32,085 INFO L290 TraceCheckUtils]: 6: Hoare triple {29#(= main_~i~0 0)} assume !(~i~0 < 1024); {25#false} is VALID [2022-04-28 02:47:32,085 INFO L290 TraceCheckUtils]: 7: Hoare triple {25#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {25#false} is VALID [2022-04-28 02:47:32,085 INFO L272 TraceCheckUtils]: 8: Hoare triple {25#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {25#false} is VALID [2022-04-28 02:47:32,086 INFO L290 TraceCheckUtils]: 9: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2022-04-28 02:47:32,086 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#false} assume 0 == ~cond; {25#false} is VALID [2022-04-28 02:47:32,086 INFO L290 TraceCheckUtils]: 11: Hoare triple {25#false} assume !false; {25#false} is VALID [2022-04-28 02:47:32,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:47:32,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:47:32,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019673347] [2022-04-28 02:47:32,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019673347] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:47:32,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:47:32,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:47:32,090 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:47:32,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [486838326] [2022-04-28 02:47:32,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [486838326] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:47:32,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:47:32,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:47:32,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7214129] [2022-04-28 02:47:32,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:47:32,095 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 02:47:32,097 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:47:32,099 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:32,127 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:47:32,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:47:32,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:47:32,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:47:32,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:47:32,155 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 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 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:32,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:47:32,317 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-28 02:47:32,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:47:32,317 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 02:47:32,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:47:32,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:32,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-04-28 02:47:32,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:32,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-04-28 02:47:32,333 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 41 transitions. [2022-04-28 02:47:32,377 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:47:32,383 INFO L225 Difference]: With dead ends: 36 [2022-04-28 02:47:32,384 INFO L226 Difference]: Without dead ends: 16 [2022-04-28 02:47:32,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:47:32,394 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 14 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:47:32,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 27 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:47:32,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-28 02:47:32,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2022-04-28 02:47:32,421 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:47:32,422 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:32,422 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:32,422 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:32,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:47:32,424 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-28 02:47:32,425 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-28 02:47:32,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:47:32,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:47:32,425 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-28 02:47:32,426 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-28 02:47:32,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:47:32,427 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-28 02:47:32,428 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-28 02:47:32,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:47:32,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:47:32,428 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:47:32,428 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:47:32,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:32,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-28 02:47:32,431 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2022-04-28 02:47:32,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:47:32,431 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-28 02:47:32,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:32,432 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 15 transitions. [2022-04-28 02:47:32,447 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:47:32,447 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-28 02:47:32,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 02:47:32,448 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:47:32,448 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:47:32,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 02:47:32,448 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:47:32,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:47:32,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1080052612, now seen corresponding path program 1 times [2022-04-28 02:47:32,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:47:32,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1409081071] [2022-04-28 02:47:32,464 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:47:32,464 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:47:32,464 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:47:32,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1080052612, now seen corresponding path program 2 times [2022-04-28 02:47:32,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:47:32,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22965393] [2022-04-28 02:47:32,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:47:32,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:47:32,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:47:32,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:47:32,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:47:32,518 INFO L290 TraceCheckUtils]: 0: Hoare triple {176#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {169#true} is VALID [2022-04-28 02:47:32,518 INFO L290 TraceCheckUtils]: 1: Hoare triple {169#true} assume true; {169#true} is VALID [2022-04-28 02:47:32,519 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {169#true} {169#true} #39#return; {169#true} is VALID [2022-04-28 02:47:32,519 INFO L272 TraceCheckUtils]: 0: Hoare triple {169#true} call ULTIMATE.init(); {176#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:47:32,520 INFO L290 TraceCheckUtils]: 1: Hoare triple {176#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {169#true} is VALID [2022-04-28 02:47:32,520 INFO L290 TraceCheckUtils]: 2: Hoare triple {169#true} assume true; {169#true} is VALID [2022-04-28 02:47:32,520 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {169#true} {169#true} #39#return; {169#true} is VALID [2022-04-28 02:47:32,520 INFO L272 TraceCheckUtils]: 4: Hoare triple {169#true} call #t~ret6 := main(); {169#true} is VALID [2022-04-28 02:47:32,521 INFO L290 TraceCheckUtils]: 5: Hoare triple {169#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {174#(= main_~i~0 0)} is VALID [2022-04-28 02:47:32,521 INFO L290 TraceCheckUtils]: 6: Hoare triple {174#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {174#(= main_~i~0 0)} is VALID [2022-04-28 02:47:32,522 INFO L290 TraceCheckUtils]: 7: Hoare triple {174#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {175#(<= main_~i~0 1)} is VALID [2022-04-28 02:47:32,522 INFO L290 TraceCheckUtils]: 8: Hoare triple {175#(<= main_~i~0 1)} assume !(~i~0 < 1024); {170#false} is VALID [2022-04-28 02:47:32,523 INFO L290 TraceCheckUtils]: 9: Hoare triple {170#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {170#false} is VALID [2022-04-28 02:47:32,523 INFO L272 TraceCheckUtils]: 10: Hoare triple {170#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {170#false} is VALID [2022-04-28 02:47:32,523 INFO L290 TraceCheckUtils]: 11: Hoare triple {170#false} ~cond := #in~cond; {170#false} is VALID [2022-04-28 02:47:32,523 INFO L290 TraceCheckUtils]: 12: Hoare triple {170#false} assume 0 == ~cond; {170#false} is VALID [2022-04-28 02:47:32,524 INFO L290 TraceCheckUtils]: 13: Hoare triple {170#false} assume !false; {170#false} is VALID [2022-04-28 02:47:32,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:47:32,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:47:32,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22965393] [2022-04-28 02:47:32,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22965393] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:47:32,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559100763] [2022-04-28 02:47:32,525 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:47:32,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:47:32,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:47:32,527 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:47:32,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 02:47:32,588 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:47:32,588 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:47:32,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-28 02:47:32,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:47:32,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:47:32,700 INFO L272 TraceCheckUtils]: 0: Hoare triple {169#true} call ULTIMATE.init(); {169#true} is VALID [2022-04-28 02:47:32,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {169#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {169#true} is VALID [2022-04-28 02:47:32,701 INFO L290 TraceCheckUtils]: 2: Hoare triple {169#true} assume true; {169#true} is VALID [2022-04-28 02:47:32,701 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {169#true} {169#true} #39#return; {169#true} is VALID [2022-04-28 02:47:32,701 INFO L272 TraceCheckUtils]: 4: Hoare triple {169#true} call #t~ret6 := main(); {169#true} is VALID [2022-04-28 02:47:32,702 INFO L290 TraceCheckUtils]: 5: Hoare triple {169#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {195#(<= main_~i~0 0)} is VALID [2022-04-28 02:47:32,703 INFO L290 TraceCheckUtils]: 6: Hoare triple {195#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {195#(<= main_~i~0 0)} is VALID [2022-04-28 02:47:32,703 INFO L290 TraceCheckUtils]: 7: Hoare triple {195#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {175#(<= main_~i~0 1)} is VALID [2022-04-28 02:47:32,704 INFO L290 TraceCheckUtils]: 8: Hoare triple {175#(<= main_~i~0 1)} assume !(~i~0 < 1024); {170#false} is VALID [2022-04-28 02:47:32,704 INFO L290 TraceCheckUtils]: 9: Hoare triple {170#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {170#false} is VALID [2022-04-28 02:47:32,704 INFO L272 TraceCheckUtils]: 10: Hoare triple {170#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {170#false} is VALID [2022-04-28 02:47:32,704 INFO L290 TraceCheckUtils]: 11: Hoare triple {170#false} ~cond := #in~cond; {170#false} is VALID [2022-04-28 02:47:32,705 INFO L290 TraceCheckUtils]: 12: Hoare triple {170#false} assume 0 == ~cond; {170#false} is VALID [2022-04-28 02:47:32,705 INFO L290 TraceCheckUtils]: 13: Hoare triple {170#false} assume !false; {170#false} is VALID [2022-04-28 02:47:32,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:47:32,707 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:47:32,799 INFO L290 TraceCheckUtils]: 13: Hoare triple {170#false} assume !false; {170#false} is VALID [2022-04-28 02:47:32,801 INFO L290 TraceCheckUtils]: 12: Hoare triple {170#false} assume 0 == ~cond; {170#false} is VALID [2022-04-28 02:47:32,805 INFO L290 TraceCheckUtils]: 11: Hoare triple {170#false} ~cond := #in~cond; {170#false} is VALID [2022-04-28 02:47:32,805 INFO L272 TraceCheckUtils]: 10: Hoare triple {170#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {170#false} is VALID [2022-04-28 02:47:32,806 INFO L290 TraceCheckUtils]: 9: Hoare triple {170#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {170#false} is VALID [2022-04-28 02:47:32,806 INFO L290 TraceCheckUtils]: 8: Hoare triple {235#(< main_~i~0 1024)} assume !(~i~0 < 1024); {170#false} is VALID [2022-04-28 02:47:32,808 INFO L290 TraceCheckUtils]: 7: Hoare triple {239#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {235#(< main_~i~0 1024)} is VALID [2022-04-28 02:47:32,809 INFO L290 TraceCheckUtils]: 6: Hoare triple {239#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {239#(< main_~i~0 1023)} is VALID [2022-04-28 02:47:32,810 INFO L290 TraceCheckUtils]: 5: Hoare triple {169#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {239#(< main_~i~0 1023)} is VALID [2022-04-28 02:47:32,811 INFO L272 TraceCheckUtils]: 4: Hoare triple {169#true} call #t~ret6 := main(); {169#true} is VALID [2022-04-28 02:47:32,811 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {169#true} {169#true} #39#return; {169#true} is VALID [2022-04-28 02:47:32,811 INFO L290 TraceCheckUtils]: 2: Hoare triple {169#true} assume true; {169#true} is VALID [2022-04-28 02:47:32,811 INFO L290 TraceCheckUtils]: 1: Hoare triple {169#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {169#true} is VALID [2022-04-28 02:47:32,812 INFO L272 TraceCheckUtils]: 0: Hoare triple {169#true} call ULTIMATE.init(); {169#true} is VALID [2022-04-28 02:47:32,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:47:32,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [559100763] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:47:32,812 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:47:32,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-28 02:47:32,814 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:47:32,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1409081071] [2022-04-28 02:47:32,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1409081071] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:47:32,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:47:32,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 02:47:32,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472047998] [2022-04-28 02:47:32,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:47:32,816 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 02:47:32,816 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:47:32,817 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:32,830 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:47:32,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 02:47:32,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:47:32,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 02:47:32,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-28 02:47:32,831 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:32,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:47:32,899 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-28 02:47:32,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 02:47:32,899 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 02:47:32,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:47:32,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:32,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2022-04-28 02:47:32,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:32,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2022-04-28 02:47:32,904 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 24 transitions. [2022-04-28 02:47:32,926 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:47:32,928 INFO L225 Difference]: With dead ends: 24 [2022-04-28 02:47:32,928 INFO L226 Difference]: Without dead ends: 18 [2022-04-28 02:47:32,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-04-28 02:47:32,931 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 12 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:47:32,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 19 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:47:32,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-28 02:47:32,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2022-04-28 02:47:32,943 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:47:32,944 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:32,944 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:32,945 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:32,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:47:32,951 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-28 02:47:32,951 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-28 02:47:32,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:47:32,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:47:32,956 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-28 02:47:32,956 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-28 02:47:32,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:47:32,957 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-28 02:47:32,957 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-28 02:47:32,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:47:32,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:47:32,958 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:47:32,958 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:47:32,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:32,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2022-04-28 02:47:32,959 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2022-04-28 02:47:32,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:47:32,959 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2022-04-28 02:47:32,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:32,960 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 17 transitions. [2022-04-28 02:47:32,977 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:47:32,978 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-28 02:47:32,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 02:47:32,978 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:47:32,978 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:47:32,996 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 02:47:33,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:47:33,184 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:47:33,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:47:33,184 INFO L85 PathProgramCache]: Analyzing trace with hash 577437950, now seen corresponding path program 3 times [2022-04-28 02:47:33,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:47:33,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [145029202] [2022-04-28 02:47:33,187 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:47:33,188 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:47:33,188 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:47:33,188 INFO L85 PathProgramCache]: Analyzing trace with hash 577437950, now seen corresponding path program 4 times [2022-04-28 02:47:33,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:47:33,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718916847] [2022-04-28 02:47:33,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:47:33,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:47:33,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:47:33,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:47:33,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:47:33,276 INFO L290 TraceCheckUtils]: 0: Hoare triple {393#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {385#true} is VALID [2022-04-28 02:47:33,276 INFO L290 TraceCheckUtils]: 1: Hoare triple {385#true} assume true; {385#true} is VALID [2022-04-28 02:47:33,276 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {385#true} {385#true} #39#return; {385#true} is VALID [2022-04-28 02:47:33,278 INFO L272 TraceCheckUtils]: 0: Hoare triple {385#true} call ULTIMATE.init(); {393#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:47:33,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {393#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {385#true} is VALID [2022-04-28 02:47:33,278 INFO L290 TraceCheckUtils]: 2: Hoare triple {385#true} assume true; {385#true} is VALID [2022-04-28 02:47:33,279 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {385#true} {385#true} #39#return; {385#true} is VALID [2022-04-28 02:47:33,279 INFO L272 TraceCheckUtils]: 4: Hoare triple {385#true} call #t~ret6 := main(); {385#true} is VALID [2022-04-28 02:47:33,279 INFO L290 TraceCheckUtils]: 5: Hoare triple {385#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {390#(= main_~i~0 0)} is VALID [2022-04-28 02:47:33,280 INFO L290 TraceCheckUtils]: 6: Hoare triple {390#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {390#(= main_~i~0 0)} is VALID [2022-04-28 02:47:33,280 INFO L290 TraceCheckUtils]: 7: Hoare triple {390#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {391#(<= main_~i~0 1)} is VALID [2022-04-28 02:47:33,281 INFO L290 TraceCheckUtils]: 8: Hoare triple {391#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {391#(<= main_~i~0 1)} is VALID [2022-04-28 02:47:33,281 INFO L290 TraceCheckUtils]: 9: Hoare triple {391#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {392#(<= main_~i~0 2)} is VALID [2022-04-28 02:47:33,282 INFO L290 TraceCheckUtils]: 10: Hoare triple {392#(<= main_~i~0 2)} assume !(~i~0 < 1024); {386#false} is VALID [2022-04-28 02:47:33,282 INFO L290 TraceCheckUtils]: 11: Hoare triple {386#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {386#false} is VALID [2022-04-28 02:47:33,282 INFO L272 TraceCheckUtils]: 12: Hoare triple {386#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {386#false} is VALID [2022-04-28 02:47:33,282 INFO L290 TraceCheckUtils]: 13: Hoare triple {386#false} ~cond := #in~cond; {386#false} is VALID [2022-04-28 02:47:33,283 INFO L290 TraceCheckUtils]: 14: Hoare triple {386#false} assume 0 == ~cond; {386#false} is VALID [2022-04-28 02:47:33,283 INFO L290 TraceCheckUtils]: 15: Hoare triple {386#false} assume !false; {386#false} is VALID [2022-04-28 02:47:33,283 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:47:33,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:47:33,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718916847] [2022-04-28 02:47:33,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718916847] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:47:33,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1168001181] [2022-04-28 02:47:33,284 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 02:47:33,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:47:33,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:47:33,285 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:47:33,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 02:47:33,331 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 02:47:33,332 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:47:33,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-28 02:47:33,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:47:33,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:47:33,454 INFO L272 TraceCheckUtils]: 0: Hoare triple {385#true} call ULTIMATE.init(); {385#true} is VALID [2022-04-28 02:47:33,455 INFO L290 TraceCheckUtils]: 1: Hoare triple {385#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {385#true} is VALID [2022-04-28 02:47:33,455 INFO L290 TraceCheckUtils]: 2: Hoare triple {385#true} assume true; {385#true} is VALID [2022-04-28 02:47:33,455 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {385#true} {385#true} #39#return; {385#true} is VALID [2022-04-28 02:47:33,455 INFO L272 TraceCheckUtils]: 4: Hoare triple {385#true} call #t~ret6 := main(); {385#true} is VALID [2022-04-28 02:47:33,462 INFO L290 TraceCheckUtils]: 5: Hoare triple {385#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {412#(<= main_~i~0 0)} is VALID [2022-04-28 02:47:33,462 INFO L290 TraceCheckUtils]: 6: Hoare triple {412#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {412#(<= main_~i~0 0)} is VALID [2022-04-28 02:47:33,463 INFO L290 TraceCheckUtils]: 7: Hoare triple {412#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {391#(<= main_~i~0 1)} is VALID [2022-04-28 02:47:33,463 INFO L290 TraceCheckUtils]: 8: Hoare triple {391#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {391#(<= main_~i~0 1)} is VALID [2022-04-28 02:47:33,464 INFO L290 TraceCheckUtils]: 9: Hoare triple {391#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {392#(<= main_~i~0 2)} is VALID [2022-04-28 02:47:33,464 INFO L290 TraceCheckUtils]: 10: Hoare triple {392#(<= main_~i~0 2)} assume !(~i~0 < 1024); {386#false} is VALID [2022-04-28 02:47:33,464 INFO L290 TraceCheckUtils]: 11: Hoare triple {386#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {386#false} is VALID [2022-04-28 02:47:33,465 INFO L272 TraceCheckUtils]: 12: Hoare triple {386#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {386#false} is VALID [2022-04-28 02:47:33,465 INFO L290 TraceCheckUtils]: 13: Hoare triple {386#false} ~cond := #in~cond; {386#false} is VALID [2022-04-28 02:47:33,465 INFO L290 TraceCheckUtils]: 14: Hoare triple {386#false} assume 0 == ~cond; {386#false} is VALID [2022-04-28 02:47:33,465 INFO L290 TraceCheckUtils]: 15: Hoare triple {386#false} assume !false; {386#false} is VALID [2022-04-28 02:47:33,465 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:47:33,465 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:47:33,556 INFO L290 TraceCheckUtils]: 15: Hoare triple {386#false} assume !false; {386#false} is VALID [2022-04-28 02:47:33,557 INFO L290 TraceCheckUtils]: 14: Hoare triple {386#false} assume 0 == ~cond; {386#false} is VALID [2022-04-28 02:47:33,557 INFO L290 TraceCheckUtils]: 13: Hoare triple {386#false} ~cond := #in~cond; {386#false} is VALID [2022-04-28 02:47:33,557 INFO L272 TraceCheckUtils]: 12: Hoare triple {386#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {386#false} is VALID [2022-04-28 02:47:33,557 INFO L290 TraceCheckUtils]: 11: Hoare triple {386#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {386#false} is VALID [2022-04-28 02:47:33,557 INFO L290 TraceCheckUtils]: 10: Hoare triple {458#(< main_~i~0 1024)} assume !(~i~0 < 1024); {386#false} is VALID [2022-04-28 02:47:33,562 INFO L290 TraceCheckUtils]: 9: Hoare triple {462#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {458#(< main_~i~0 1024)} is VALID [2022-04-28 02:47:33,564 INFO L290 TraceCheckUtils]: 8: Hoare triple {462#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {462#(< main_~i~0 1023)} is VALID [2022-04-28 02:47:33,565 INFO L290 TraceCheckUtils]: 7: Hoare triple {469#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {462#(< main_~i~0 1023)} is VALID [2022-04-28 02:47:33,565 INFO L290 TraceCheckUtils]: 6: Hoare triple {469#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {469#(< main_~i~0 1022)} is VALID [2022-04-28 02:47:33,566 INFO L290 TraceCheckUtils]: 5: Hoare triple {385#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {469#(< main_~i~0 1022)} is VALID [2022-04-28 02:47:33,566 INFO L272 TraceCheckUtils]: 4: Hoare triple {385#true} call #t~ret6 := main(); {385#true} is VALID [2022-04-28 02:47:33,566 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {385#true} {385#true} #39#return; {385#true} is VALID [2022-04-28 02:47:33,566 INFO L290 TraceCheckUtils]: 2: Hoare triple {385#true} assume true; {385#true} is VALID [2022-04-28 02:47:33,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {385#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {385#true} is VALID [2022-04-28 02:47:33,567 INFO L272 TraceCheckUtils]: 0: Hoare triple {385#true} call ULTIMATE.init(); {385#true} is VALID [2022-04-28 02:47:33,567 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:47:33,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1168001181] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:47:33,567 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:47:33,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-04-28 02:47:33,568 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:47:33,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [145029202] [2022-04-28 02:47:33,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [145029202] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:47:33,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:47:33,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 02:47:33,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781336675] [2022-04-28 02:47:33,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:47:33,569 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 02:47:33,569 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:47:33,569 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:33,584 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:47:33,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 02:47:33,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:47:33,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 02:47:33,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-04-28 02:47:33,588 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:33,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:47:33,691 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-28 02:47:33,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 02:47:33,691 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 02:47:33,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:47:33,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:33,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2022-04-28 02:47:33,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:33,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2022-04-28 02:47:33,698 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 26 transitions. [2022-04-28 02:47:33,719 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:47:33,721 INFO L225 Difference]: With dead ends: 26 [2022-04-28 02:47:33,721 INFO L226 Difference]: Without dead ends: 20 [2022-04-28 02:47:33,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=90, Unknown=0, NotChecked=0, Total=156 [2022-04-28 02:47:33,730 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 14 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:47:33,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 29 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:47:33,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-28 02:47:33,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2022-04-28 02:47:33,738 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:47:33,738 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:33,738 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:33,738 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:33,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:47:33,740 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-28 02:47:33,740 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-28 02:47:33,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:47:33,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:47:33,741 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-28 02:47:33,741 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-28 02:47:33,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:47:33,742 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-28 02:47:33,742 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-28 02:47:33,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:47:33,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:47:33,743 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:47:33,743 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:47:33,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:33,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2022-04-28 02:47:33,744 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2022-04-28 02:47:33,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:47:33,744 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2022-04-28 02:47:33,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:33,744 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 19 transitions. [2022-04-28 02:47:33,770 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:47:33,771 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-28 02:47:33,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 02:47:33,771 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:47:33,771 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:47:33,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 02:47:33,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-28 02:47:33,972 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:47:33,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:47:33,972 INFO L85 PathProgramCache]: Analyzing trace with hash -6998784, now seen corresponding path program 5 times [2022-04-28 02:47:33,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:47:33,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1140150765] [2022-04-28 02:47:33,977 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:47:33,977 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:47:33,977 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:47:33,977 INFO L85 PathProgramCache]: Analyzing trace with hash -6998784, now seen corresponding path program 6 times [2022-04-28 02:47:33,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:47:33,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378605938] [2022-04-28 02:47:33,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:47:33,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:47:34,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:47:34,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:47:34,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:47:34,095 INFO L290 TraceCheckUtils]: 0: Hoare triple {638#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {629#true} is VALID [2022-04-28 02:47:34,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {629#true} assume true; {629#true} is VALID [2022-04-28 02:47:34,095 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {629#true} {629#true} #39#return; {629#true} is VALID [2022-04-28 02:47:34,097 INFO L272 TraceCheckUtils]: 0: Hoare triple {629#true} call ULTIMATE.init(); {638#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:47:34,097 INFO L290 TraceCheckUtils]: 1: Hoare triple {638#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {629#true} is VALID [2022-04-28 02:47:34,097 INFO L290 TraceCheckUtils]: 2: Hoare triple {629#true} assume true; {629#true} is VALID [2022-04-28 02:47:34,097 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {629#true} {629#true} #39#return; {629#true} is VALID [2022-04-28 02:47:34,097 INFO L272 TraceCheckUtils]: 4: Hoare triple {629#true} call #t~ret6 := main(); {629#true} is VALID [2022-04-28 02:47:34,111 INFO L290 TraceCheckUtils]: 5: Hoare triple {629#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {634#(= main_~i~0 0)} is VALID [2022-04-28 02:47:34,111 INFO L290 TraceCheckUtils]: 6: Hoare triple {634#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {634#(= main_~i~0 0)} is VALID [2022-04-28 02:47:34,112 INFO L290 TraceCheckUtils]: 7: Hoare triple {634#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {635#(<= main_~i~0 1)} is VALID [2022-04-28 02:47:34,112 INFO L290 TraceCheckUtils]: 8: Hoare triple {635#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {635#(<= main_~i~0 1)} is VALID [2022-04-28 02:47:34,113 INFO L290 TraceCheckUtils]: 9: Hoare triple {635#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {636#(<= main_~i~0 2)} is VALID [2022-04-28 02:47:34,113 INFO L290 TraceCheckUtils]: 10: Hoare triple {636#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {636#(<= main_~i~0 2)} is VALID [2022-04-28 02:47:34,114 INFO L290 TraceCheckUtils]: 11: Hoare triple {636#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {637#(<= main_~i~0 3)} is VALID [2022-04-28 02:47:34,114 INFO L290 TraceCheckUtils]: 12: Hoare triple {637#(<= main_~i~0 3)} assume !(~i~0 < 1024); {630#false} is VALID [2022-04-28 02:47:34,114 INFO L290 TraceCheckUtils]: 13: Hoare triple {630#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {630#false} is VALID [2022-04-28 02:47:34,114 INFO L272 TraceCheckUtils]: 14: Hoare triple {630#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {630#false} is VALID [2022-04-28 02:47:34,115 INFO L290 TraceCheckUtils]: 15: Hoare triple {630#false} ~cond := #in~cond; {630#false} is VALID [2022-04-28 02:47:34,115 INFO L290 TraceCheckUtils]: 16: Hoare triple {630#false} assume 0 == ~cond; {630#false} is VALID [2022-04-28 02:47:34,115 INFO L290 TraceCheckUtils]: 17: Hoare triple {630#false} assume !false; {630#false} is VALID [2022-04-28 02:47:34,115 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:47:34,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:47:34,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378605938] [2022-04-28 02:47:34,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378605938] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:47:34,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039590070] [2022-04-28 02:47:34,116 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 02:47:34,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:47:34,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:47:34,120 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:47:34,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 02:47:34,167 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 02:47:34,167 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:47:34,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 02:47:34,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:47:34,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:47:34,257 INFO L272 TraceCheckUtils]: 0: Hoare triple {629#true} call ULTIMATE.init(); {629#true} is VALID [2022-04-28 02:47:34,257 INFO L290 TraceCheckUtils]: 1: Hoare triple {629#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {629#true} is VALID [2022-04-28 02:47:34,257 INFO L290 TraceCheckUtils]: 2: Hoare triple {629#true} assume true; {629#true} is VALID [2022-04-28 02:47:34,257 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {629#true} {629#true} #39#return; {629#true} is VALID [2022-04-28 02:47:34,258 INFO L272 TraceCheckUtils]: 4: Hoare triple {629#true} call #t~ret6 := main(); {629#true} is VALID [2022-04-28 02:47:34,258 INFO L290 TraceCheckUtils]: 5: Hoare triple {629#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {657#(<= main_~i~0 0)} is VALID [2022-04-28 02:47:34,258 INFO L290 TraceCheckUtils]: 6: Hoare triple {657#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {657#(<= main_~i~0 0)} is VALID [2022-04-28 02:47:34,259 INFO L290 TraceCheckUtils]: 7: Hoare triple {657#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {635#(<= main_~i~0 1)} is VALID [2022-04-28 02:47:34,259 INFO L290 TraceCheckUtils]: 8: Hoare triple {635#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {635#(<= main_~i~0 1)} is VALID [2022-04-28 02:47:34,260 INFO L290 TraceCheckUtils]: 9: Hoare triple {635#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {636#(<= main_~i~0 2)} is VALID [2022-04-28 02:47:34,260 INFO L290 TraceCheckUtils]: 10: Hoare triple {636#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {636#(<= main_~i~0 2)} is VALID [2022-04-28 02:47:34,261 INFO L290 TraceCheckUtils]: 11: Hoare triple {636#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {637#(<= main_~i~0 3)} is VALID [2022-04-28 02:47:34,261 INFO L290 TraceCheckUtils]: 12: Hoare triple {637#(<= main_~i~0 3)} assume !(~i~0 < 1024); {630#false} is VALID [2022-04-28 02:47:34,261 INFO L290 TraceCheckUtils]: 13: Hoare triple {630#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {630#false} is VALID [2022-04-28 02:47:34,261 INFO L272 TraceCheckUtils]: 14: Hoare triple {630#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {630#false} is VALID [2022-04-28 02:47:34,262 INFO L290 TraceCheckUtils]: 15: Hoare triple {630#false} ~cond := #in~cond; {630#false} is VALID [2022-04-28 02:47:34,262 INFO L290 TraceCheckUtils]: 16: Hoare triple {630#false} assume 0 == ~cond; {630#false} is VALID [2022-04-28 02:47:34,262 INFO L290 TraceCheckUtils]: 17: Hoare triple {630#false} assume !false; {630#false} is VALID [2022-04-28 02:47:34,262 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:47:34,263 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:47:34,378 INFO L290 TraceCheckUtils]: 17: Hoare triple {630#false} assume !false; {630#false} is VALID [2022-04-28 02:47:34,378 INFO L290 TraceCheckUtils]: 16: Hoare triple {630#false} assume 0 == ~cond; {630#false} is VALID [2022-04-28 02:47:34,379 INFO L290 TraceCheckUtils]: 15: Hoare triple {630#false} ~cond := #in~cond; {630#false} is VALID [2022-04-28 02:47:34,379 INFO L272 TraceCheckUtils]: 14: Hoare triple {630#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {630#false} is VALID [2022-04-28 02:47:34,379 INFO L290 TraceCheckUtils]: 13: Hoare triple {630#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {630#false} is VALID [2022-04-28 02:47:34,380 INFO L290 TraceCheckUtils]: 12: Hoare triple {709#(< main_~i~0 1024)} assume !(~i~0 < 1024); {630#false} is VALID [2022-04-28 02:47:34,381 INFO L290 TraceCheckUtils]: 11: Hoare triple {713#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {709#(< main_~i~0 1024)} is VALID [2022-04-28 02:47:34,381 INFO L290 TraceCheckUtils]: 10: Hoare triple {713#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {713#(< main_~i~0 1023)} is VALID [2022-04-28 02:47:34,382 INFO L290 TraceCheckUtils]: 9: Hoare triple {720#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {713#(< main_~i~0 1023)} is VALID [2022-04-28 02:47:34,382 INFO L290 TraceCheckUtils]: 8: Hoare triple {720#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {720#(< main_~i~0 1022)} is VALID [2022-04-28 02:47:34,383 INFO L290 TraceCheckUtils]: 7: Hoare triple {727#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {720#(< main_~i~0 1022)} is VALID [2022-04-28 02:47:34,383 INFO L290 TraceCheckUtils]: 6: Hoare triple {727#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {727#(< main_~i~0 1021)} is VALID [2022-04-28 02:47:34,384 INFO L290 TraceCheckUtils]: 5: Hoare triple {629#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {727#(< main_~i~0 1021)} is VALID [2022-04-28 02:47:34,384 INFO L272 TraceCheckUtils]: 4: Hoare triple {629#true} call #t~ret6 := main(); {629#true} is VALID [2022-04-28 02:47:34,384 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {629#true} {629#true} #39#return; {629#true} is VALID [2022-04-28 02:47:34,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {629#true} assume true; {629#true} is VALID [2022-04-28 02:47:34,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {629#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {629#true} is VALID [2022-04-28 02:47:34,384 INFO L272 TraceCheckUtils]: 0: Hoare triple {629#true} call ULTIMATE.init(); {629#true} is VALID [2022-04-28 02:47:34,385 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:47:34,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039590070] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:47:34,385 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:47:34,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2022-04-28 02:47:34,385 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:47:34,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1140150765] [2022-04-28 02:47:34,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1140150765] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:47:34,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:47:34,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 02:47:34,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93284194] [2022-04-28 02:47:34,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:47:34,386 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-28 02:47:34,386 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:47:34,387 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:34,400 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:47:34,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 02:47:34,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:47:34,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 02:47:34,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2022-04-28 02:47:34,401 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:34,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:47:34,503 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-28 02:47:34,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 02:47:34,503 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-28 02:47:34,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:47:34,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:34,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2022-04-28 02:47:34,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:34,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2022-04-28 02:47:34,506 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 28 transitions. [2022-04-28 02:47:34,529 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:47:34,530 INFO L225 Difference]: With dead ends: 28 [2022-04-28 02:47:34,530 INFO L226 Difference]: Without dead ends: 22 [2022-04-28 02:47:34,530 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=138, Unknown=0, NotChecked=0, Total=240 [2022-04-28 02:47:34,531 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 16 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:47:34,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 24 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:47:34,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-28 02:47:34,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-04-28 02:47:34,538 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:47:34,538 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:34,539 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:34,539 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:34,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:47:34,540 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-28 02:47:34,540 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-28 02:47:34,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:47:34,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:47:34,541 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-28 02:47:34,541 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-28 02:47:34,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:47:34,542 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-28 02:47:34,542 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-28 02:47:34,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:47:34,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:47:34,542 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:47:34,543 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:47:34,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:34,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2022-04-28 02:47:34,544 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2022-04-28 02:47:34,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:47:34,544 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2022-04-28 02:47:34,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:34,544 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 21 transitions. [2022-04-28 02:47:34,562 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:47:34,562 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-28 02:47:34,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 02:47:34,563 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:47:34,563 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:47:34,586 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 02:47:34,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:47:34,772 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:47:34,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:47:34,772 INFO L85 PathProgramCache]: Analyzing trace with hash 990015618, now seen corresponding path program 7 times [2022-04-28 02:47:34,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:47:34,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [491998560] [2022-04-28 02:47:34,785 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:47:34,785 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:47:34,786 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:47:34,786 INFO L85 PathProgramCache]: Analyzing trace with hash 990015618, now seen corresponding path program 8 times [2022-04-28 02:47:34,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:47:34,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137476245] [2022-04-28 02:47:34,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:47:34,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:47:34,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:47:34,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:47:34,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:47:34,896 INFO L290 TraceCheckUtils]: 0: Hoare triple {911#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {901#true} is VALID [2022-04-28 02:47:34,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {901#true} assume true; {901#true} is VALID [2022-04-28 02:47:34,896 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {901#true} {901#true} #39#return; {901#true} is VALID [2022-04-28 02:47:34,897 INFO L272 TraceCheckUtils]: 0: Hoare triple {901#true} call ULTIMATE.init(); {911#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:47:34,897 INFO L290 TraceCheckUtils]: 1: Hoare triple {911#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {901#true} is VALID [2022-04-28 02:47:34,897 INFO L290 TraceCheckUtils]: 2: Hoare triple {901#true} assume true; {901#true} is VALID [2022-04-28 02:47:34,897 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {901#true} {901#true} #39#return; {901#true} is VALID [2022-04-28 02:47:34,897 INFO L272 TraceCheckUtils]: 4: Hoare triple {901#true} call #t~ret6 := main(); {901#true} is VALID [2022-04-28 02:47:34,898 INFO L290 TraceCheckUtils]: 5: Hoare triple {901#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {906#(= main_~i~0 0)} is VALID [2022-04-28 02:47:34,898 INFO L290 TraceCheckUtils]: 6: Hoare triple {906#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {906#(= main_~i~0 0)} is VALID [2022-04-28 02:47:34,899 INFO L290 TraceCheckUtils]: 7: Hoare triple {906#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {907#(<= main_~i~0 1)} is VALID [2022-04-28 02:47:34,899 INFO L290 TraceCheckUtils]: 8: Hoare triple {907#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {907#(<= main_~i~0 1)} is VALID [2022-04-28 02:47:34,900 INFO L290 TraceCheckUtils]: 9: Hoare triple {907#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {908#(<= main_~i~0 2)} is VALID [2022-04-28 02:47:34,900 INFO L290 TraceCheckUtils]: 10: Hoare triple {908#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {908#(<= main_~i~0 2)} is VALID [2022-04-28 02:47:34,901 INFO L290 TraceCheckUtils]: 11: Hoare triple {908#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {909#(<= main_~i~0 3)} is VALID [2022-04-28 02:47:34,901 INFO L290 TraceCheckUtils]: 12: Hoare triple {909#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {909#(<= main_~i~0 3)} is VALID [2022-04-28 02:47:34,902 INFO L290 TraceCheckUtils]: 13: Hoare triple {909#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {910#(<= main_~i~0 4)} is VALID [2022-04-28 02:47:34,902 INFO L290 TraceCheckUtils]: 14: Hoare triple {910#(<= main_~i~0 4)} assume !(~i~0 < 1024); {902#false} is VALID [2022-04-28 02:47:34,902 INFO L290 TraceCheckUtils]: 15: Hoare triple {902#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {902#false} is VALID [2022-04-28 02:47:34,902 INFO L272 TraceCheckUtils]: 16: Hoare triple {902#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {902#false} is VALID [2022-04-28 02:47:34,902 INFO L290 TraceCheckUtils]: 17: Hoare triple {902#false} ~cond := #in~cond; {902#false} is VALID [2022-04-28 02:47:34,903 INFO L290 TraceCheckUtils]: 18: Hoare triple {902#false} assume 0 == ~cond; {902#false} is VALID [2022-04-28 02:47:34,903 INFO L290 TraceCheckUtils]: 19: Hoare triple {902#false} assume !false; {902#false} is VALID [2022-04-28 02:47:34,903 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:47:34,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:47:34,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137476245] [2022-04-28 02:47:34,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137476245] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:47:34,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [429216924] [2022-04-28 02:47:34,903 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:47:34,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:47:34,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:47:34,905 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:47:34,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-28 02:47:34,957 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:47:34,957 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:47:34,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 02:47:34,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:47:34,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:47:35,081 INFO L272 TraceCheckUtils]: 0: Hoare triple {901#true} call ULTIMATE.init(); {901#true} is VALID [2022-04-28 02:47:35,082 INFO L290 TraceCheckUtils]: 1: Hoare triple {901#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {901#true} is VALID [2022-04-28 02:47:35,082 INFO L290 TraceCheckUtils]: 2: Hoare triple {901#true} assume true; {901#true} is VALID [2022-04-28 02:47:35,082 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {901#true} {901#true} #39#return; {901#true} is VALID [2022-04-28 02:47:35,082 INFO L272 TraceCheckUtils]: 4: Hoare triple {901#true} call #t~ret6 := main(); {901#true} is VALID [2022-04-28 02:47:35,083 INFO L290 TraceCheckUtils]: 5: Hoare triple {901#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {930#(<= main_~i~0 0)} is VALID [2022-04-28 02:47:35,083 INFO L290 TraceCheckUtils]: 6: Hoare triple {930#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {930#(<= main_~i~0 0)} is VALID [2022-04-28 02:47:35,084 INFO L290 TraceCheckUtils]: 7: Hoare triple {930#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {907#(<= main_~i~0 1)} is VALID [2022-04-28 02:47:35,084 INFO L290 TraceCheckUtils]: 8: Hoare triple {907#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {907#(<= main_~i~0 1)} is VALID [2022-04-28 02:47:35,088 INFO L290 TraceCheckUtils]: 9: Hoare triple {907#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {908#(<= main_~i~0 2)} is VALID [2022-04-28 02:47:35,089 INFO L290 TraceCheckUtils]: 10: Hoare triple {908#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {908#(<= main_~i~0 2)} is VALID [2022-04-28 02:47:35,089 INFO L290 TraceCheckUtils]: 11: Hoare triple {908#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {909#(<= main_~i~0 3)} is VALID [2022-04-28 02:47:35,089 INFO L290 TraceCheckUtils]: 12: Hoare triple {909#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {909#(<= main_~i~0 3)} is VALID [2022-04-28 02:47:35,090 INFO L290 TraceCheckUtils]: 13: Hoare triple {909#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {910#(<= main_~i~0 4)} is VALID [2022-04-28 02:47:35,090 INFO L290 TraceCheckUtils]: 14: Hoare triple {910#(<= main_~i~0 4)} assume !(~i~0 < 1024); {902#false} is VALID [2022-04-28 02:47:35,090 INFO L290 TraceCheckUtils]: 15: Hoare triple {902#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {902#false} is VALID [2022-04-28 02:47:35,090 INFO L272 TraceCheckUtils]: 16: Hoare triple {902#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {902#false} is VALID [2022-04-28 02:47:35,090 INFO L290 TraceCheckUtils]: 17: Hoare triple {902#false} ~cond := #in~cond; {902#false} is VALID [2022-04-28 02:47:35,091 INFO L290 TraceCheckUtils]: 18: Hoare triple {902#false} assume 0 == ~cond; {902#false} is VALID [2022-04-28 02:47:35,091 INFO L290 TraceCheckUtils]: 19: Hoare triple {902#false} assume !false; {902#false} is VALID [2022-04-28 02:47:35,091 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:47:35,091 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:47:35,232 INFO L290 TraceCheckUtils]: 19: Hoare triple {902#false} assume !false; {902#false} is VALID [2022-04-28 02:47:35,232 INFO L290 TraceCheckUtils]: 18: Hoare triple {902#false} assume 0 == ~cond; {902#false} is VALID [2022-04-28 02:47:35,232 INFO L290 TraceCheckUtils]: 17: Hoare triple {902#false} ~cond := #in~cond; {902#false} is VALID [2022-04-28 02:47:35,232 INFO L272 TraceCheckUtils]: 16: Hoare triple {902#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {902#false} is VALID [2022-04-28 02:47:35,232 INFO L290 TraceCheckUtils]: 15: Hoare triple {902#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {902#false} is VALID [2022-04-28 02:47:35,233 INFO L290 TraceCheckUtils]: 14: Hoare triple {988#(< main_~i~0 1024)} assume !(~i~0 < 1024); {902#false} is VALID [2022-04-28 02:47:35,233 INFO L290 TraceCheckUtils]: 13: Hoare triple {992#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {988#(< main_~i~0 1024)} is VALID [2022-04-28 02:47:35,234 INFO L290 TraceCheckUtils]: 12: Hoare triple {992#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {992#(< main_~i~0 1023)} is VALID [2022-04-28 02:47:35,234 INFO L290 TraceCheckUtils]: 11: Hoare triple {999#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {992#(< main_~i~0 1023)} is VALID [2022-04-28 02:47:35,235 INFO L290 TraceCheckUtils]: 10: Hoare triple {999#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {999#(< main_~i~0 1022)} is VALID [2022-04-28 02:47:35,235 INFO L290 TraceCheckUtils]: 9: Hoare triple {1006#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {999#(< main_~i~0 1022)} is VALID [2022-04-28 02:47:35,236 INFO L290 TraceCheckUtils]: 8: Hoare triple {1006#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1006#(< main_~i~0 1021)} is VALID [2022-04-28 02:47:35,236 INFO L290 TraceCheckUtils]: 7: Hoare triple {1013#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1006#(< main_~i~0 1021)} is VALID [2022-04-28 02:47:35,237 INFO L290 TraceCheckUtils]: 6: Hoare triple {1013#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1013#(< main_~i~0 1020)} is VALID [2022-04-28 02:47:35,237 INFO L290 TraceCheckUtils]: 5: Hoare triple {901#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {1013#(< main_~i~0 1020)} is VALID [2022-04-28 02:47:35,237 INFO L272 TraceCheckUtils]: 4: Hoare triple {901#true} call #t~ret6 := main(); {901#true} is VALID [2022-04-28 02:47:35,237 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {901#true} {901#true} #39#return; {901#true} is VALID [2022-04-28 02:47:35,238 INFO L290 TraceCheckUtils]: 2: Hoare triple {901#true} assume true; {901#true} is VALID [2022-04-28 02:47:35,238 INFO L290 TraceCheckUtils]: 1: Hoare triple {901#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {901#true} is VALID [2022-04-28 02:47:35,238 INFO L272 TraceCheckUtils]: 0: Hoare triple {901#true} call ULTIMATE.init(); {901#true} is VALID [2022-04-28 02:47:35,238 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:47:35,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [429216924] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:47:35,238 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:47:35,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-28 02:47:35,239 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:47:35,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [491998560] [2022-04-28 02:47:35,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [491998560] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:47:35,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:47:35,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 02:47:35,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333487134] [2022-04-28 02:47:35,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:47:35,240 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-28 02:47:35,240 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:47:35,240 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:35,255 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:47:35,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 02:47:35,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:47:35,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 02:47:35,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2022-04-28 02:47:35,256 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:35,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:47:35,392 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-28 02:47:35,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 02:47:35,393 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-28 02:47:35,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:47:35,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:35,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 30 transitions. [2022-04-28 02:47:35,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:35,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 30 transitions. [2022-04-28 02:47:35,396 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 30 transitions. [2022-04-28 02:47:35,424 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:47:35,425 INFO L225 Difference]: With dead ends: 30 [2022-04-28 02:47:35,425 INFO L226 Difference]: Without dead ends: 24 [2022-04-28 02:47:35,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=146, Invalid=196, Unknown=0, NotChecked=0, Total=342 [2022-04-28 02:47:35,426 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 18 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:47:35,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 24 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:47:35,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-28 02:47:35,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2022-04-28 02:47:35,439 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:47:35,440 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:35,440 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:35,440 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:35,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:47:35,441 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-28 02:47:35,441 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-28 02:47:35,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:47:35,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:47:35,442 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-28 02:47:35,442 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-28 02:47:35,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:47:35,443 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-28 02:47:35,443 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-28 02:47:35,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:47:35,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:47:35,444 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:47:35,444 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:47:35,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:35,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2022-04-28 02:47:35,445 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2022-04-28 02:47:35,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:47:35,445 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2022-04-28 02:47:35,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:35,445 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 23 transitions. [2022-04-28 02:47:35,464 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:47:35,464 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-28 02:47:35,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 02:47:35,464 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:47:35,464 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:47:35,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-28 02:47:35,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:47:35,679 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:47:35,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:47:35,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1343148932, now seen corresponding path program 9 times [2022-04-28 02:47:35,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:47:35,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1264751945] [2022-04-28 02:47:35,683 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:47:35,683 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:47:35,683 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:47:35,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1343148932, now seen corresponding path program 10 times [2022-04-28 02:47:35,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:47:35,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951231975] [2022-04-28 02:47:35,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:47:35,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:47:35,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:47:35,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:47:35,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:47:35,796 INFO L290 TraceCheckUtils]: 0: Hoare triple {1212#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1201#true} is VALID [2022-04-28 02:47:35,796 INFO L290 TraceCheckUtils]: 1: Hoare triple {1201#true} assume true; {1201#true} is VALID [2022-04-28 02:47:35,796 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1201#true} {1201#true} #39#return; {1201#true} is VALID [2022-04-28 02:47:35,797 INFO L272 TraceCheckUtils]: 0: Hoare triple {1201#true} call ULTIMATE.init(); {1212#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:47:35,797 INFO L290 TraceCheckUtils]: 1: Hoare triple {1212#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1201#true} is VALID [2022-04-28 02:47:35,797 INFO L290 TraceCheckUtils]: 2: Hoare triple {1201#true} assume true; {1201#true} is VALID [2022-04-28 02:47:35,797 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1201#true} {1201#true} #39#return; {1201#true} is VALID [2022-04-28 02:47:35,797 INFO L272 TraceCheckUtils]: 4: Hoare triple {1201#true} call #t~ret6 := main(); {1201#true} is VALID [2022-04-28 02:47:35,797 INFO L290 TraceCheckUtils]: 5: Hoare triple {1201#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {1206#(= main_~i~0 0)} is VALID [2022-04-28 02:47:35,798 INFO L290 TraceCheckUtils]: 6: Hoare triple {1206#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1206#(= main_~i~0 0)} is VALID [2022-04-28 02:47:35,798 INFO L290 TraceCheckUtils]: 7: Hoare triple {1206#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1207#(<= main_~i~0 1)} is VALID [2022-04-28 02:47:35,799 INFO L290 TraceCheckUtils]: 8: Hoare triple {1207#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1207#(<= main_~i~0 1)} is VALID [2022-04-28 02:47:35,799 INFO L290 TraceCheckUtils]: 9: Hoare triple {1207#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1208#(<= main_~i~0 2)} is VALID [2022-04-28 02:47:35,800 INFO L290 TraceCheckUtils]: 10: Hoare triple {1208#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1208#(<= main_~i~0 2)} is VALID [2022-04-28 02:47:35,801 INFO L290 TraceCheckUtils]: 11: Hoare triple {1208#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1209#(<= main_~i~0 3)} is VALID [2022-04-28 02:47:35,801 INFO L290 TraceCheckUtils]: 12: Hoare triple {1209#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1209#(<= main_~i~0 3)} is VALID [2022-04-28 02:47:35,801 INFO L290 TraceCheckUtils]: 13: Hoare triple {1209#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1210#(<= main_~i~0 4)} is VALID [2022-04-28 02:47:35,802 INFO L290 TraceCheckUtils]: 14: Hoare triple {1210#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1210#(<= main_~i~0 4)} is VALID [2022-04-28 02:47:35,802 INFO L290 TraceCheckUtils]: 15: Hoare triple {1210#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1211#(<= main_~i~0 5)} is VALID [2022-04-28 02:47:35,803 INFO L290 TraceCheckUtils]: 16: Hoare triple {1211#(<= main_~i~0 5)} assume !(~i~0 < 1024); {1202#false} is VALID [2022-04-28 02:47:35,803 INFO L290 TraceCheckUtils]: 17: Hoare triple {1202#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {1202#false} is VALID [2022-04-28 02:47:35,803 INFO L272 TraceCheckUtils]: 18: Hoare triple {1202#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {1202#false} is VALID [2022-04-28 02:47:35,803 INFO L290 TraceCheckUtils]: 19: Hoare triple {1202#false} ~cond := #in~cond; {1202#false} is VALID [2022-04-28 02:47:35,803 INFO L290 TraceCheckUtils]: 20: Hoare triple {1202#false} assume 0 == ~cond; {1202#false} is VALID [2022-04-28 02:47:35,803 INFO L290 TraceCheckUtils]: 21: Hoare triple {1202#false} assume !false; {1202#false} is VALID [2022-04-28 02:47:35,804 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:47:35,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:47:35,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951231975] [2022-04-28 02:47:35,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951231975] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:47:35,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876641216] [2022-04-28 02:47:35,807 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 02:47:35,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:47:35,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:47:35,808 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:47:35,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-28 02:47:35,871 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 02:47:35,871 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:47:35,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 02:47:35,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:47:35,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:47:35,987 INFO L272 TraceCheckUtils]: 0: Hoare triple {1201#true} call ULTIMATE.init(); {1201#true} is VALID [2022-04-28 02:47:35,987 INFO L290 TraceCheckUtils]: 1: Hoare triple {1201#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1201#true} is VALID [2022-04-28 02:47:35,987 INFO L290 TraceCheckUtils]: 2: Hoare triple {1201#true} assume true; {1201#true} is VALID [2022-04-28 02:47:35,987 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1201#true} {1201#true} #39#return; {1201#true} is VALID [2022-04-28 02:47:35,987 INFO L272 TraceCheckUtils]: 4: Hoare triple {1201#true} call #t~ret6 := main(); {1201#true} is VALID [2022-04-28 02:47:35,988 INFO L290 TraceCheckUtils]: 5: Hoare triple {1201#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {1231#(<= main_~i~0 0)} is VALID [2022-04-28 02:47:35,988 INFO L290 TraceCheckUtils]: 6: Hoare triple {1231#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1231#(<= main_~i~0 0)} is VALID [2022-04-28 02:47:35,989 INFO L290 TraceCheckUtils]: 7: Hoare triple {1231#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1207#(<= main_~i~0 1)} is VALID [2022-04-28 02:47:35,989 INFO L290 TraceCheckUtils]: 8: Hoare triple {1207#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1207#(<= main_~i~0 1)} is VALID [2022-04-28 02:47:35,990 INFO L290 TraceCheckUtils]: 9: Hoare triple {1207#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1208#(<= main_~i~0 2)} is VALID [2022-04-28 02:47:35,990 INFO L290 TraceCheckUtils]: 10: Hoare triple {1208#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1208#(<= main_~i~0 2)} is VALID [2022-04-28 02:47:35,990 INFO L290 TraceCheckUtils]: 11: Hoare triple {1208#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1209#(<= main_~i~0 3)} is VALID [2022-04-28 02:47:35,991 INFO L290 TraceCheckUtils]: 12: Hoare triple {1209#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1209#(<= main_~i~0 3)} is VALID [2022-04-28 02:47:35,991 INFO L290 TraceCheckUtils]: 13: Hoare triple {1209#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1210#(<= main_~i~0 4)} is VALID [2022-04-28 02:47:35,991 INFO L290 TraceCheckUtils]: 14: Hoare triple {1210#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1210#(<= main_~i~0 4)} is VALID [2022-04-28 02:47:35,992 INFO L290 TraceCheckUtils]: 15: Hoare triple {1210#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1211#(<= main_~i~0 5)} is VALID [2022-04-28 02:47:35,992 INFO L290 TraceCheckUtils]: 16: Hoare triple {1211#(<= main_~i~0 5)} assume !(~i~0 < 1024); {1202#false} is VALID [2022-04-28 02:47:35,992 INFO L290 TraceCheckUtils]: 17: Hoare triple {1202#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {1202#false} is VALID [2022-04-28 02:47:35,992 INFO L272 TraceCheckUtils]: 18: Hoare triple {1202#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {1202#false} is VALID [2022-04-28 02:47:35,992 INFO L290 TraceCheckUtils]: 19: Hoare triple {1202#false} ~cond := #in~cond; {1202#false} is VALID [2022-04-28 02:47:35,992 INFO L290 TraceCheckUtils]: 20: Hoare triple {1202#false} assume 0 == ~cond; {1202#false} is VALID [2022-04-28 02:47:35,992 INFO L290 TraceCheckUtils]: 21: Hoare triple {1202#false} assume !false; {1202#false} is VALID [2022-04-28 02:47:35,993 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:47:35,993 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:47:36,173 INFO L290 TraceCheckUtils]: 21: Hoare triple {1202#false} assume !false; {1202#false} is VALID [2022-04-28 02:47:36,173 INFO L290 TraceCheckUtils]: 20: Hoare triple {1202#false} assume 0 == ~cond; {1202#false} is VALID [2022-04-28 02:47:36,173 INFO L290 TraceCheckUtils]: 19: Hoare triple {1202#false} ~cond := #in~cond; {1202#false} is VALID [2022-04-28 02:47:36,173 INFO L272 TraceCheckUtils]: 18: Hoare triple {1202#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {1202#false} is VALID [2022-04-28 02:47:36,174 INFO L290 TraceCheckUtils]: 17: Hoare triple {1202#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {1202#false} is VALID [2022-04-28 02:47:36,174 INFO L290 TraceCheckUtils]: 16: Hoare triple {1295#(< main_~i~0 1024)} assume !(~i~0 < 1024); {1202#false} is VALID [2022-04-28 02:47:36,174 INFO L290 TraceCheckUtils]: 15: Hoare triple {1299#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1295#(< main_~i~0 1024)} is VALID [2022-04-28 02:47:36,175 INFO L290 TraceCheckUtils]: 14: Hoare triple {1299#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1299#(< main_~i~0 1023)} is VALID [2022-04-28 02:47:36,175 INFO L290 TraceCheckUtils]: 13: Hoare triple {1306#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1299#(< main_~i~0 1023)} is VALID [2022-04-28 02:47:36,176 INFO L290 TraceCheckUtils]: 12: Hoare triple {1306#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1306#(< main_~i~0 1022)} is VALID [2022-04-28 02:47:36,176 INFO L290 TraceCheckUtils]: 11: Hoare triple {1313#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1306#(< main_~i~0 1022)} is VALID [2022-04-28 02:47:36,176 INFO L290 TraceCheckUtils]: 10: Hoare triple {1313#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1313#(< main_~i~0 1021)} is VALID [2022-04-28 02:47:36,177 INFO L290 TraceCheckUtils]: 9: Hoare triple {1320#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1313#(< main_~i~0 1021)} is VALID [2022-04-28 02:47:36,177 INFO L290 TraceCheckUtils]: 8: Hoare triple {1320#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1320#(< main_~i~0 1020)} is VALID [2022-04-28 02:47:36,178 INFO L290 TraceCheckUtils]: 7: Hoare triple {1327#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1320#(< main_~i~0 1020)} is VALID [2022-04-28 02:47:36,178 INFO L290 TraceCheckUtils]: 6: Hoare triple {1327#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1327#(< main_~i~0 1019)} is VALID [2022-04-28 02:47:36,179 INFO L290 TraceCheckUtils]: 5: Hoare triple {1201#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {1327#(< main_~i~0 1019)} is VALID [2022-04-28 02:47:36,179 INFO L272 TraceCheckUtils]: 4: Hoare triple {1201#true} call #t~ret6 := main(); {1201#true} is VALID [2022-04-28 02:47:36,179 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1201#true} {1201#true} #39#return; {1201#true} is VALID [2022-04-28 02:47:36,180 INFO L290 TraceCheckUtils]: 2: Hoare triple {1201#true} assume true; {1201#true} is VALID [2022-04-28 02:47:36,180 INFO L290 TraceCheckUtils]: 1: Hoare triple {1201#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1201#true} is VALID [2022-04-28 02:47:36,180 INFO L272 TraceCheckUtils]: 0: Hoare triple {1201#true} call ULTIMATE.init(); {1201#true} is VALID [2022-04-28 02:47:36,180 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:47:36,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1876641216] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:47:36,181 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:47:36,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2022-04-28 02:47:36,181 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:47:36,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1264751945] [2022-04-28 02:47:36,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1264751945] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:47:36,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:47:36,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 02:47:36,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600071345] [2022-04-28 02:47:36,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:47:36,182 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 02:47:36,182 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:47:36,182 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:36,198 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:47:36,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 02:47:36,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:47:36,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 02:47:36,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2022-04-28 02:47:36,199 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:36,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:47:36,339 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-28 02:47:36,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 02:47:36,339 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 02:47:36,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:47:36,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:36,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 32 transitions. [2022-04-28 02:47:36,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:36,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 32 transitions. [2022-04-28 02:47:36,342 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 32 transitions. [2022-04-28 02:47:36,370 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:47:36,371 INFO L225 Difference]: With dead ends: 32 [2022-04-28 02:47:36,371 INFO L226 Difference]: Without dead ends: 26 [2022-04-28 02:47:36,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=198, Invalid=264, Unknown=0, NotChecked=0, Total=462 [2022-04-28 02:47:36,372 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 20 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:47:36,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 24 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:47:36,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-28 02:47:36,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-04-28 02:47:36,391 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:47:36,392 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:36,392 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:36,392 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:36,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:47:36,395 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-28 02:47:36,395 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-28 02:47:36,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:47:36,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:47:36,395 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 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 26 states. [2022-04-28 02:47:36,396 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 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 26 states. [2022-04-28 02:47:36,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:47:36,399 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-28 02:47:36,399 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-28 02:47:36,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:47:36,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:47:36,400 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:47:36,400 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:47:36,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:36,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2022-04-28 02:47:36,402 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2022-04-28 02:47:36,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:47:36,403 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2022-04-28 02:47:36,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:36,403 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 25 transitions. [2022-04-28 02:47:36,425 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:47:36,425 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-28 02:47:36,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 02:47:36,425 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:47:36,425 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:47:36,445 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-28 02:47:36,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:47:36,631 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:47:36,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:47:36,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1401847302, now seen corresponding path program 11 times [2022-04-28 02:47:36,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:47:36,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1017977321] [2022-04-28 02:47:36,634 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:47:36,634 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:47:36,634 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:47:36,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1401847302, now seen corresponding path program 12 times [2022-04-28 02:47:36,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:47:36,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114962087] [2022-04-28 02:47:36,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:47:36,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:47:36,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:47:36,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:47:36,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:47:36,742 INFO L290 TraceCheckUtils]: 0: Hoare triple {1541#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1529#true} is VALID [2022-04-28 02:47:36,742 INFO L290 TraceCheckUtils]: 1: Hoare triple {1529#true} assume true; {1529#true} is VALID [2022-04-28 02:47:36,742 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1529#true} {1529#true} #39#return; {1529#true} is VALID [2022-04-28 02:47:36,743 INFO L272 TraceCheckUtils]: 0: Hoare triple {1529#true} call ULTIMATE.init(); {1541#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:47:36,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {1541#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1529#true} is VALID [2022-04-28 02:47:36,743 INFO L290 TraceCheckUtils]: 2: Hoare triple {1529#true} assume true; {1529#true} is VALID [2022-04-28 02:47:36,743 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1529#true} {1529#true} #39#return; {1529#true} is VALID [2022-04-28 02:47:36,744 INFO L272 TraceCheckUtils]: 4: Hoare triple {1529#true} call #t~ret6 := main(); {1529#true} is VALID [2022-04-28 02:47:36,744 INFO L290 TraceCheckUtils]: 5: Hoare triple {1529#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {1534#(= main_~i~0 0)} is VALID [2022-04-28 02:47:36,744 INFO L290 TraceCheckUtils]: 6: Hoare triple {1534#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1534#(= main_~i~0 0)} is VALID [2022-04-28 02:47:36,745 INFO L290 TraceCheckUtils]: 7: Hoare triple {1534#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1535#(<= main_~i~0 1)} is VALID [2022-04-28 02:47:36,745 INFO L290 TraceCheckUtils]: 8: Hoare triple {1535#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1535#(<= main_~i~0 1)} is VALID [2022-04-28 02:47:36,746 INFO L290 TraceCheckUtils]: 9: Hoare triple {1535#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1536#(<= main_~i~0 2)} is VALID [2022-04-28 02:47:36,746 INFO L290 TraceCheckUtils]: 10: Hoare triple {1536#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1536#(<= main_~i~0 2)} is VALID [2022-04-28 02:47:36,747 INFO L290 TraceCheckUtils]: 11: Hoare triple {1536#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1537#(<= main_~i~0 3)} is VALID [2022-04-28 02:47:36,747 INFO L290 TraceCheckUtils]: 12: Hoare triple {1537#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1537#(<= main_~i~0 3)} is VALID [2022-04-28 02:47:36,748 INFO L290 TraceCheckUtils]: 13: Hoare triple {1537#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1538#(<= main_~i~0 4)} is VALID [2022-04-28 02:47:36,748 INFO L290 TraceCheckUtils]: 14: Hoare triple {1538#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1538#(<= main_~i~0 4)} is VALID [2022-04-28 02:47:36,748 INFO L290 TraceCheckUtils]: 15: Hoare triple {1538#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1539#(<= main_~i~0 5)} is VALID [2022-04-28 02:47:36,749 INFO L290 TraceCheckUtils]: 16: Hoare triple {1539#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1539#(<= main_~i~0 5)} is VALID [2022-04-28 02:47:36,749 INFO L290 TraceCheckUtils]: 17: Hoare triple {1539#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1540#(<= main_~i~0 6)} is VALID [2022-04-28 02:47:36,750 INFO L290 TraceCheckUtils]: 18: Hoare triple {1540#(<= main_~i~0 6)} assume !(~i~0 < 1024); {1530#false} is VALID [2022-04-28 02:47:36,750 INFO L290 TraceCheckUtils]: 19: Hoare triple {1530#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {1530#false} is VALID [2022-04-28 02:47:36,750 INFO L272 TraceCheckUtils]: 20: Hoare triple {1530#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {1530#false} is VALID [2022-04-28 02:47:36,750 INFO L290 TraceCheckUtils]: 21: Hoare triple {1530#false} ~cond := #in~cond; {1530#false} is VALID [2022-04-28 02:47:36,750 INFO L290 TraceCheckUtils]: 22: Hoare triple {1530#false} assume 0 == ~cond; {1530#false} is VALID [2022-04-28 02:47:36,750 INFO L290 TraceCheckUtils]: 23: Hoare triple {1530#false} assume !false; {1530#false} is VALID [2022-04-28 02:47:36,750 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:47:36,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:47:36,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114962087] [2022-04-28 02:47:36,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114962087] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:47:36,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96093665] [2022-04-28 02:47:36,751 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 02:47:36,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:47:36,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:47:36,752 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:47:36,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-28 02:47:36,819 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 02:47:36,819 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:47:36,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 02:47:36,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:47:36,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:47:36,972 INFO L272 TraceCheckUtils]: 0: Hoare triple {1529#true} call ULTIMATE.init(); {1529#true} is VALID [2022-04-28 02:47:36,972 INFO L290 TraceCheckUtils]: 1: Hoare triple {1529#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1529#true} is VALID [2022-04-28 02:47:36,972 INFO L290 TraceCheckUtils]: 2: Hoare triple {1529#true} assume true; {1529#true} is VALID [2022-04-28 02:47:36,972 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1529#true} {1529#true} #39#return; {1529#true} is VALID [2022-04-28 02:47:36,972 INFO L272 TraceCheckUtils]: 4: Hoare triple {1529#true} call #t~ret6 := main(); {1529#true} is VALID [2022-04-28 02:47:36,973 INFO L290 TraceCheckUtils]: 5: Hoare triple {1529#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {1560#(<= main_~i~0 0)} is VALID [2022-04-28 02:47:36,973 INFO L290 TraceCheckUtils]: 6: Hoare triple {1560#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1560#(<= main_~i~0 0)} is VALID [2022-04-28 02:47:36,974 INFO L290 TraceCheckUtils]: 7: Hoare triple {1560#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1535#(<= main_~i~0 1)} is VALID [2022-04-28 02:47:36,975 INFO L290 TraceCheckUtils]: 8: Hoare triple {1535#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1535#(<= main_~i~0 1)} is VALID [2022-04-28 02:47:36,975 INFO L290 TraceCheckUtils]: 9: Hoare triple {1535#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1536#(<= main_~i~0 2)} is VALID [2022-04-28 02:47:36,975 INFO L290 TraceCheckUtils]: 10: Hoare triple {1536#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1536#(<= main_~i~0 2)} is VALID [2022-04-28 02:47:36,976 INFO L290 TraceCheckUtils]: 11: Hoare triple {1536#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1537#(<= main_~i~0 3)} is VALID [2022-04-28 02:47:36,976 INFO L290 TraceCheckUtils]: 12: Hoare triple {1537#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1537#(<= main_~i~0 3)} is VALID [2022-04-28 02:47:36,977 INFO L290 TraceCheckUtils]: 13: Hoare triple {1537#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1538#(<= main_~i~0 4)} is VALID [2022-04-28 02:47:36,977 INFO L290 TraceCheckUtils]: 14: Hoare triple {1538#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1538#(<= main_~i~0 4)} is VALID [2022-04-28 02:47:36,978 INFO L290 TraceCheckUtils]: 15: Hoare triple {1538#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1539#(<= main_~i~0 5)} is VALID [2022-04-28 02:47:36,978 INFO L290 TraceCheckUtils]: 16: Hoare triple {1539#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1539#(<= main_~i~0 5)} is VALID [2022-04-28 02:47:36,978 INFO L290 TraceCheckUtils]: 17: Hoare triple {1539#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1540#(<= main_~i~0 6)} is VALID [2022-04-28 02:47:36,979 INFO L290 TraceCheckUtils]: 18: Hoare triple {1540#(<= main_~i~0 6)} assume !(~i~0 < 1024); {1530#false} is VALID [2022-04-28 02:47:36,979 INFO L290 TraceCheckUtils]: 19: Hoare triple {1530#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {1530#false} is VALID [2022-04-28 02:47:36,979 INFO L272 TraceCheckUtils]: 20: Hoare triple {1530#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {1530#false} is VALID [2022-04-28 02:47:36,979 INFO L290 TraceCheckUtils]: 21: Hoare triple {1530#false} ~cond := #in~cond; {1530#false} is VALID [2022-04-28 02:47:36,979 INFO L290 TraceCheckUtils]: 22: Hoare triple {1530#false} assume 0 == ~cond; {1530#false} is VALID [2022-04-28 02:47:36,979 INFO L290 TraceCheckUtils]: 23: Hoare triple {1530#false} assume !false; {1530#false} is VALID [2022-04-28 02:47:36,980 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:47:36,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:47:37,184 INFO L290 TraceCheckUtils]: 23: Hoare triple {1530#false} assume !false; {1530#false} is VALID [2022-04-28 02:47:37,184 INFO L290 TraceCheckUtils]: 22: Hoare triple {1530#false} assume 0 == ~cond; {1530#false} is VALID [2022-04-28 02:47:37,184 INFO L290 TraceCheckUtils]: 21: Hoare triple {1530#false} ~cond := #in~cond; {1530#false} is VALID [2022-04-28 02:47:37,184 INFO L272 TraceCheckUtils]: 20: Hoare triple {1530#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {1530#false} is VALID [2022-04-28 02:47:37,184 INFO L290 TraceCheckUtils]: 19: Hoare triple {1530#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {1530#false} is VALID [2022-04-28 02:47:37,185 INFO L290 TraceCheckUtils]: 18: Hoare triple {1630#(< main_~i~0 1024)} assume !(~i~0 < 1024); {1530#false} is VALID [2022-04-28 02:47:37,185 INFO L290 TraceCheckUtils]: 17: Hoare triple {1634#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1630#(< main_~i~0 1024)} is VALID [2022-04-28 02:47:37,186 INFO L290 TraceCheckUtils]: 16: Hoare triple {1634#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1634#(< main_~i~0 1023)} is VALID [2022-04-28 02:47:37,186 INFO L290 TraceCheckUtils]: 15: Hoare triple {1641#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1634#(< main_~i~0 1023)} is VALID [2022-04-28 02:47:37,187 INFO L290 TraceCheckUtils]: 14: Hoare triple {1641#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1641#(< main_~i~0 1022)} is VALID [2022-04-28 02:47:37,187 INFO L290 TraceCheckUtils]: 13: Hoare triple {1648#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1641#(< main_~i~0 1022)} is VALID [2022-04-28 02:47:37,187 INFO L290 TraceCheckUtils]: 12: Hoare triple {1648#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1648#(< main_~i~0 1021)} is VALID [2022-04-28 02:47:37,188 INFO L290 TraceCheckUtils]: 11: Hoare triple {1655#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1648#(< main_~i~0 1021)} is VALID [2022-04-28 02:47:37,188 INFO L290 TraceCheckUtils]: 10: Hoare triple {1655#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1655#(< main_~i~0 1020)} is VALID [2022-04-28 02:47:37,189 INFO L290 TraceCheckUtils]: 9: Hoare triple {1662#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1655#(< main_~i~0 1020)} is VALID [2022-04-28 02:47:37,189 INFO L290 TraceCheckUtils]: 8: Hoare triple {1662#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1662#(< main_~i~0 1019)} is VALID [2022-04-28 02:47:37,190 INFO L290 TraceCheckUtils]: 7: Hoare triple {1669#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1662#(< main_~i~0 1019)} is VALID [2022-04-28 02:47:37,190 INFO L290 TraceCheckUtils]: 6: Hoare triple {1669#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1669#(< main_~i~0 1018)} is VALID [2022-04-28 02:47:37,191 INFO L290 TraceCheckUtils]: 5: Hoare triple {1529#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {1669#(< main_~i~0 1018)} is VALID [2022-04-28 02:47:37,191 INFO L272 TraceCheckUtils]: 4: Hoare triple {1529#true} call #t~ret6 := main(); {1529#true} is VALID [2022-04-28 02:47:37,191 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1529#true} {1529#true} #39#return; {1529#true} is VALID [2022-04-28 02:47:37,191 INFO L290 TraceCheckUtils]: 2: Hoare triple {1529#true} assume true; {1529#true} is VALID [2022-04-28 02:47:37,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {1529#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1529#true} is VALID [2022-04-28 02:47:37,191 INFO L272 TraceCheckUtils]: 0: Hoare triple {1529#true} call ULTIMATE.init(); {1529#true} is VALID [2022-04-28 02:47:37,192 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:47:37,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [96093665] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:47:37,192 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:47:37,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2022-04-28 02:47:37,192 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:47:37,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1017977321] [2022-04-28 02:47:37,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1017977321] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:47:37,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:47:37,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 02:47:37,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090653122] [2022-04-28 02:47:37,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:47:37,193 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-28 02:47:37,193 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:47:37,193 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:37,215 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:47:37,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 02:47:37,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:47:37,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 02:47:37,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2022-04-28 02:47:37,216 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:37,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:47:37,373 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-28 02:47:37,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 02:47:37,373 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-28 02:47:37,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:47:37,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:37,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 34 transitions. [2022-04-28 02:47:37,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:37,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 34 transitions. [2022-04-28 02:47:37,375 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 34 transitions. [2022-04-28 02:47:37,404 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:47:37,405 INFO L225 Difference]: With dead ends: 34 [2022-04-28 02:47:37,405 INFO L226 Difference]: Without dead ends: 28 [2022-04-28 02:47:37,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=258, Invalid=342, Unknown=0, NotChecked=0, Total=600 [2022-04-28 02:47:37,406 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 22 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:47:37,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 29 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:47:37,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-28 02:47:37,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2022-04-28 02:47:37,423 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:47:37,423 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:37,423 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:37,423 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:37,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:47:37,424 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-28 02:47:37,424 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-28 02:47:37,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:47:37,424 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:47:37,425 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 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 28 states. [2022-04-28 02:47:37,425 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 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 28 states. [2022-04-28 02:47:37,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:47:37,426 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-28 02:47:37,426 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-28 02:47:37,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:47:37,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:47:37,426 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:47:37,426 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:47:37,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:37,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2022-04-28 02:47:37,427 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2022-04-28 02:47:37,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:47:37,427 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2022-04-28 02:47:37,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:37,428 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 27 transitions. [2022-04-28 02:47:37,450 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:47:37,450 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-28 02:47:37,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 02:47:37,450 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:47:37,451 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:47:37,468 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-28 02:47:37,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:47:37,660 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:47:37,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:47:37,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1976406024, now seen corresponding path program 13 times [2022-04-28 02:47:37,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:47:37,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [883491345] [2022-04-28 02:47:37,662 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:47:37,662 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:47:37,663 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:47:37,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1976406024, now seen corresponding path program 14 times [2022-04-28 02:47:37,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:47:37,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429987980] [2022-04-28 02:47:37,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:47:37,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:47:37,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:47:37,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:47:37,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:47:37,779 INFO L290 TraceCheckUtils]: 0: Hoare triple {1898#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1885#true} is VALID [2022-04-28 02:47:37,779 INFO L290 TraceCheckUtils]: 1: Hoare triple {1885#true} assume true; {1885#true} is VALID [2022-04-28 02:47:37,780 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1885#true} {1885#true} #39#return; {1885#true} is VALID [2022-04-28 02:47:37,781 INFO L272 TraceCheckUtils]: 0: Hoare triple {1885#true} call ULTIMATE.init(); {1898#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:47:37,781 INFO L290 TraceCheckUtils]: 1: Hoare triple {1898#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1885#true} is VALID [2022-04-28 02:47:37,781 INFO L290 TraceCheckUtils]: 2: Hoare triple {1885#true} assume true; {1885#true} is VALID [2022-04-28 02:47:37,781 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1885#true} {1885#true} #39#return; {1885#true} is VALID [2022-04-28 02:47:37,781 INFO L272 TraceCheckUtils]: 4: Hoare triple {1885#true} call #t~ret6 := main(); {1885#true} is VALID [2022-04-28 02:47:37,784 INFO L290 TraceCheckUtils]: 5: Hoare triple {1885#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {1890#(= main_~i~0 0)} is VALID [2022-04-28 02:47:37,785 INFO L290 TraceCheckUtils]: 6: Hoare triple {1890#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1890#(= main_~i~0 0)} is VALID [2022-04-28 02:47:37,785 INFO L290 TraceCheckUtils]: 7: Hoare triple {1890#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1891#(<= main_~i~0 1)} is VALID [2022-04-28 02:47:37,785 INFO L290 TraceCheckUtils]: 8: Hoare triple {1891#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1891#(<= main_~i~0 1)} is VALID [2022-04-28 02:47:37,786 INFO L290 TraceCheckUtils]: 9: Hoare triple {1891#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1892#(<= main_~i~0 2)} is VALID [2022-04-28 02:47:37,786 INFO L290 TraceCheckUtils]: 10: Hoare triple {1892#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1892#(<= main_~i~0 2)} is VALID [2022-04-28 02:47:37,787 INFO L290 TraceCheckUtils]: 11: Hoare triple {1892#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1893#(<= main_~i~0 3)} is VALID [2022-04-28 02:47:37,787 INFO L290 TraceCheckUtils]: 12: Hoare triple {1893#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1893#(<= main_~i~0 3)} is VALID [2022-04-28 02:47:37,787 INFO L290 TraceCheckUtils]: 13: Hoare triple {1893#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1894#(<= main_~i~0 4)} is VALID [2022-04-28 02:47:37,788 INFO L290 TraceCheckUtils]: 14: Hoare triple {1894#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1894#(<= main_~i~0 4)} is VALID [2022-04-28 02:47:37,788 INFO L290 TraceCheckUtils]: 15: Hoare triple {1894#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1895#(<= main_~i~0 5)} is VALID [2022-04-28 02:47:37,788 INFO L290 TraceCheckUtils]: 16: Hoare triple {1895#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1895#(<= main_~i~0 5)} is VALID [2022-04-28 02:47:37,789 INFO L290 TraceCheckUtils]: 17: Hoare triple {1895#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1896#(<= main_~i~0 6)} is VALID [2022-04-28 02:47:37,789 INFO L290 TraceCheckUtils]: 18: Hoare triple {1896#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1896#(<= main_~i~0 6)} is VALID [2022-04-28 02:47:37,789 INFO L290 TraceCheckUtils]: 19: Hoare triple {1896#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1897#(<= main_~i~0 7)} is VALID [2022-04-28 02:47:37,790 INFO L290 TraceCheckUtils]: 20: Hoare triple {1897#(<= main_~i~0 7)} assume !(~i~0 < 1024); {1886#false} is VALID [2022-04-28 02:47:37,790 INFO L290 TraceCheckUtils]: 21: Hoare triple {1886#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {1886#false} is VALID [2022-04-28 02:47:37,790 INFO L272 TraceCheckUtils]: 22: Hoare triple {1886#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {1886#false} is VALID [2022-04-28 02:47:37,790 INFO L290 TraceCheckUtils]: 23: Hoare triple {1886#false} ~cond := #in~cond; {1886#false} is VALID [2022-04-28 02:47:37,790 INFO L290 TraceCheckUtils]: 24: Hoare triple {1886#false} assume 0 == ~cond; {1886#false} is VALID [2022-04-28 02:47:37,790 INFO L290 TraceCheckUtils]: 25: Hoare triple {1886#false} assume !false; {1886#false} is VALID [2022-04-28 02:47:37,791 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:47:37,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:47:37,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429987980] [2022-04-28 02:47:37,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429987980] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:47:37,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742095731] [2022-04-28 02:47:37,791 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:47:37,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:47:37,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:47:37,796 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:47:37,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-28 02:47:37,864 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:47:37,864 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:47:37,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 02:47:37,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:47:37,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:47:38,002 INFO L272 TraceCheckUtils]: 0: Hoare triple {1885#true} call ULTIMATE.init(); {1885#true} is VALID [2022-04-28 02:47:38,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {1885#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1885#true} is VALID [2022-04-28 02:47:38,003 INFO L290 TraceCheckUtils]: 2: Hoare triple {1885#true} assume true; {1885#true} is VALID [2022-04-28 02:47:38,003 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1885#true} {1885#true} #39#return; {1885#true} is VALID [2022-04-28 02:47:38,003 INFO L272 TraceCheckUtils]: 4: Hoare triple {1885#true} call #t~ret6 := main(); {1885#true} is VALID [2022-04-28 02:47:38,004 INFO L290 TraceCheckUtils]: 5: Hoare triple {1885#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {1917#(<= main_~i~0 0)} is VALID [2022-04-28 02:47:38,004 INFO L290 TraceCheckUtils]: 6: Hoare triple {1917#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1917#(<= main_~i~0 0)} is VALID [2022-04-28 02:47:38,004 INFO L290 TraceCheckUtils]: 7: Hoare triple {1917#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1891#(<= main_~i~0 1)} is VALID [2022-04-28 02:47:38,005 INFO L290 TraceCheckUtils]: 8: Hoare triple {1891#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1891#(<= main_~i~0 1)} is VALID [2022-04-28 02:47:38,005 INFO L290 TraceCheckUtils]: 9: Hoare triple {1891#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1892#(<= main_~i~0 2)} is VALID [2022-04-28 02:47:38,005 INFO L290 TraceCheckUtils]: 10: Hoare triple {1892#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1892#(<= main_~i~0 2)} is VALID [2022-04-28 02:47:38,006 INFO L290 TraceCheckUtils]: 11: Hoare triple {1892#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1893#(<= main_~i~0 3)} is VALID [2022-04-28 02:47:38,006 INFO L290 TraceCheckUtils]: 12: Hoare triple {1893#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1893#(<= main_~i~0 3)} is VALID [2022-04-28 02:47:38,007 INFO L290 TraceCheckUtils]: 13: Hoare triple {1893#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1894#(<= main_~i~0 4)} is VALID [2022-04-28 02:47:38,007 INFO L290 TraceCheckUtils]: 14: Hoare triple {1894#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1894#(<= main_~i~0 4)} is VALID [2022-04-28 02:47:38,007 INFO L290 TraceCheckUtils]: 15: Hoare triple {1894#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1895#(<= main_~i~0 5)} is VALID [2022-04-28 02:47:38,008 INFO L290 TraceCheckUtils]: 16: Hoare triple {1895#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1895#(<= main_~i~0 5)} is VALID [2022-04-28 02:47:38,008 INFO L290 TraceCheckUtils]: 17: Hoare triple {1895#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1896#(<= main_~i~0 6)} is VALID [2022-04-28 02:47:38,009 INFO L290 TraceCheckUtils]: 18: Hoare triple {1896#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1896#(<= main_~i~0 6)} is VALID [2022-04-28 02:47:38,009 INFO L290 TraceCheckUtils]: 19: Hoare triple {1896#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1897#(<= main_~i~0 7)} is VALID [2022-04-28 02:47:38,009 INFO L290 TraceCheckUtils]: 20: Hoare triple {1897#(<= main_~i~0 7)} assume !(~i~0 < 1024); {1886#false} is VALID [2022-04-28 02:47:38,010 INFO L290 TraceCheckUtils]: 21: Hoare triple {1886#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {1886#false} is VALID [2022-04-28 02:47:38,010 INFO L272 TraceCheckUtils]: 22: Hoare triple {1886#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {1886#false} is VALID [2022-04-28 02:47:38,010 INFO L290 TraceCheckUtils]: 23: Hoare triple {1886#false} ~cond := #in~cond; {1886#false} is VALID [2022-04-28 02:47:38,010 INFO L290 TraceCheckUtils]: 24: Hoare triple {1886#false} assume 0 == ~cond; {1886#false} is VALID [2022-04-28 02:47:38,010 INFO L290 TraceCheckUtils]: 25: Hoare triple {1886#false} assume !false; {1886#false} is VALID [2022-04-28 02:47:38,010 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:47:38,010 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:47:38,223 INFO L290 TraceCheckUtils]: 25: Hoare triple {1886#false} assume !false; {1886#false} is VALID [2022-04-28 02:47:38,223 INFO L290 TraceCheckUtils]: 24: Hoare triple {1886#false} assume 0 == ~cond; {1886#false} is VALID [2022-04-28 02:47:38,223 INFO L290 TraceCheckUtils]: 23: Hoare triple {1886#false} ~cond := #in~cond; {1886#false} is VALID [2022-04-28 02:47:38,223 INFO L272 TraceCheckUtils]: 22: Hoare triple {1886#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {1886#false} is VALID [2022-04-28 02:47:38,224 INFO L290 TraceCheckUtils]: 21: Hoare triple {1886#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {1886#false} is VALID [2022-04-28 02:47:38,224 INFO L290 TraceCheckUtils]: 20: Hoare triple {1993#(< main_~i~0 1024)} assume !(~i~0 < 1024); {1886#false} is VALID [2022-04-28 02:47:38,224 INFO L290 TraceCheckUtils]: 19: Hoare triple {1997#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1993#(< main_~i~0 1024)} is VALID [2022-04-28 02:47:38,225 INFO L290 TraceCheckUtils]: 18: Hoare triple {1997#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1997#(< main_~i~0 1023)} is VALID [2022-04-28 02:47:38,225 INFO L290 TraceCheckUtils]: 17: Hoare triple {2004#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1997#(< main_~i~0 1023)} is VALID [2022-04-28 02:47:38,225 INFO L290 TraceCheckUtils]: 16: Hoare triple {2004#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2004#(< main_~i~0 1022)} is VALID [2022-04-28 02:47:38,226 INFO L290 TraceCheckUtils]: 15: Hoare triple {2011#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2004#(< main_~i~0 1022)} is VALID [2022-04-28 02:47:38,226 INFO L290 TraceCheckUtils]: 14: Hoare triple {2011#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2011#(< main_~i~0 1021)} is VALID [2022-04-28 02:47:38,227 INFO L290 TraceCheckUtils]: 13: Hoare triple {2018#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2011#(< main_~i~0 1021)} is VALID [2022-04-28 02:47:38,227 INFO L290 TraceCheckUtils]: 12: Hoare triple {2018#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2018#(< main_~i~0 1020)} is VALID [2022-04-28 02:47:38,227 INFO L290 TraceCheckUtils]: 11: Hoare triple {2025#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2018#(< main_~i~0 1020)} is VALID [2022-04-28 02:47:38,228 INFO L290 TraceCheckUtils]: 10: Hoare triple {2025#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2025#(< main_~i~0 1019)} is VALID [2022-04-28 02:47:38,228 INFO L290 TraceCheckUtils]: 9: Hoare triple {2032#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2025#(< main_~i~0 1019)} is VALID [2022-04-28 02:47:38,228 INFO L290 TraceCheckUtils]: 8: Hoare triple {2032#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2032#(< main_~i~0 1018)} is VALID [2022-04-28 02:47:38,229 INFO L290 TraceCheckUtils]: 7: Hoare triple {2039#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2032#(< main_~i~0 1018)} is VALID [2022-04-28 02:47:38,229 INFO L290 TraceCheckUtils]: 6: Hoare triple {2039#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2039#(< main_~i~0 1017)} is VALID [2022-04-28 02:47:38,230 INFO L290 TraceCheckUtils]: 5: Hoare triple {1885#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {2039#(< main_~i~0 1017)} is VALID [2022-04-28 02:47:38,230 INFO L272 TraceCheckUtils]: 4: Hoare triple {1885#true} call #t~ret6 := main(); {1885#true} is VALID [2022-04-28 02:47:38,230 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1885#true} {1885#true} #39#return; {1885#true} is VALID [2022-04-28 02:47:38,230 INFO L290 TraceCheckUtils]: 2: Hoare triple {1885#true} assume true; {1885#true} is VALID [2022-04-28 02:47:38,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {1885#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1885#true} is VALID [2022-04-28 02:47:38,230 INFO L272 TraceCheckUtils]: 0: Hoare triple {1885#true} call ULTIMATE.init(); {1885#true} is VALID [2022-04-28 02:47:38,231 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:47:38,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1742095731] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:47:38,231 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:47:38,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 20 [2022-04-28 02:47:38,232 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:47:38,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [883491345] [2022-04-28 02:47:38,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [883491345] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:47:38,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:47:38,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 02:47:38,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954262730] [2022-04-28 02:47:38,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:47:38,233 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-28 02:47:38,233 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:47:38,233 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:38,250 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:47:38,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 02:47:38,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:47:38,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 02:47:38,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=207, Unknown=0, NotChecked=0, Total=380 [2022-04-28 02:47:38,252 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:38,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:47:38,433 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-28 02:47:38,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 02:47:38,434 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-28 02:47:38,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:47:38,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:38,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 36 transitions. [2022-04-28 02:47:38,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:38,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 36 transitions. [2022-04-28 02:47:38,448 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 36 transitions. [2022-04-28 02:47:38,480 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:47:38,480 INFO L225 Difference]: With dead ends: 36 [2022-04-28 02:47:38,480 INFO L226 Difference]: Without dead ends: 30 [2022-04-28 02:47:38,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=326, Invalid=430, Unknown=0, NotChecked=0, Total=756 [2022-04-28 02:47:38,482 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 24 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:47:38,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 29 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:47:38,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-28 02:47:38,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2022-04-28 02:47:38,505 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:47:38,505 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:38,505 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:38,506 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:38,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:47:38,507 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-28 02:47:38,507 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-28 02:47:38,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:47:38,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:47:38,508 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states. [2022-04-28 02:47:38,508 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states. [2022-04-28 02:47:38,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:47:38,509 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-28 02:47:38,509 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-28 02:47:38,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:47:38,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:47:38,509 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:47:38,509 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:47:38,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:38,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2022-04-28 02:47:38,517 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2022-04-28 02:47:38,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:47:38,517 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2022-04-28 02:47:38,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:38,518 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 29 transitions. [2022-04-28 02:47:38,546 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:47:38,546 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-28 02:47:38,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 02:47:38,546 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:47:38,547 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:47:38,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-28 02:47:38,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:47:38,759 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:47:38,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:47:38,760 INFO L85 PathProgramCache]: Analyzing trace with hash 76556682, now seen corresponding path program 15 times [2022-04-28 02:47:38,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:47:38,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [482241141] [2022-04-28 02:47:38,762 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:47:38,762 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:47:38,762 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:47:38,762 INFO L85 PathProgramCache]: Analyzing trace with hash 76556682, now seen corresponding path program 16 times [2022-04-28 02:47:38,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:47:38,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353303700] [2022-04-28 02:47:38,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:47:38,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:47:38,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:47:38,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:47:38,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:47:38,866 INFO L290 TraceCheckUtils]: 0: Hoare triple {2283#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {2269#true} is VALID [2022-04-28 02:47:38,866 INFO L290 TraceCheckUtils]: 1: Hoare triple {2269#true} assume true; {2269#true} is VALID [2022-04-28 02:47:38,866 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2269#true} {2269#true} #39#return; {2269#true} is VALID [2022-04-28 02:47:38,867 INFO L272 TraceCheckUtils]: 0: Hoare triple {2269#true} call ULTIMATE.init(); {2283#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:47:38,867 INFO L290 TraceCheckUtils]: 1: Hoare triple {2283#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {2269#true} is VALID [2022-04-28 02:47:38,867 INFO L290 TraceCheckUtils]: 2: Hoare triple {2269#true} assume true; {2269#true} is VALID [2022-04-28 02:47:38,867 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2269#true} {2269#true} #39#return; {2269#true} is VALID [2022-04-28 02:47:38,868 INFO L272 TraceCheckUtils]: 4: Hoare triple {2269#true} call #t~ret6 := main(); {2269#true} is VALID [2022-04-28 02:47:38,868 INFO L290 TraceCheckUtils]: 5: Hoare triple {2269#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {2274#(= main_~i~0 0)} is VALID [2022-04-28 02:47:38,868 INFO L290 TraceCheckUtils]: 6: Hoare triple {2274#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2274#(= main_~i~0 0)} is VALID [2022-04-28 02:47:38,869 INFO L290 TraceCheckUtils]: 7: Hoare triple {2274#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2275#(<= main_~i~0 1)} is VALID [2022-04-28 02:47:38,869 INFO L290 TraceCheckUtils]: 8: Hoare triple {2275#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2275#(<= main_~i~0 1)} is VALID [2022-04-28 02:47:38,870 INFO L290 TraceCheckUtils]: 9: Hoare triple {2275#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2276#(<= main_~i~0 2)} is VALID [2022-04-28 02:47:38,870 INFO L290 TraceCheckUtils]: 10: Hoare triple {2276#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2276#(<= main_~i~0 2)} is VALID [2022-04-28 02:47:38,870 INFO L290 TraceCheckUtils]: 11: Hoare triple {2276#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2277#(<= main_~i~0 3)} is VALID [2022-04-28 02:47:38,871 INFO L290 TraceCheckUtils]: 12: Hoare triple {2277#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2277#(<= main_~i~0 3)} is VALID [2022-04-28 02:47:38,871 INFO L290 TraceCheckUtils]: 13: Hoare triple {2277#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2278#(<= main_~i~0 4)} is VALID [2022-04-28 02:47:38,872 INFO L290 TraceCheckUtils]: 14: Hoare triple {2278#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2278#(<= main_~i~0 4)} is VALID [2022-04-28 02:47:38,872 INFO L290 TraceCheckUtils]: 15: Hoare triple {2278#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2279#(<= main_~i~0 5)} is VALID [2022-04-28 02:47:38,872 INFO L290 TraceCheckUtils]: 16: Hoare triple {2279#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2279#(<= main_~i~0 5)} is VALID [2022-04-28 02:47:38,873 INFO L290 TraceCheckUtils]: 17: Hoare triple {2279#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2280#(<= main_~i~0 6)} is VALID [2022-04-28 02:47:38,873 INFO L290 TraceCheckUtils]: 18: Hoare triple {2280#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2280#(<= main_~i~0 6)} is VALID [2022-04-28 02:47:38,874 INFO L290 TraceCheckUtils]: 19: Hoare triple {2280#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2281#(<= main_~i~0 7)} is VALID [2022-04-28 02:47:38,874 INFO L290 TraceCheckUtils]: 20: Hoare triple {2281#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2281#(<= main_~i~0 7)} is VALID [2022-04-28 02:47:38,875 INFO L290 TraceCheckUtils]: 21: Hoare triple {2281#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2282#(<= main_~i~0 8)} is VALID [2022-04-28 02:47:38,875 INFO L290 TraceCheckUtils]: 22: Hoare triple {2282#(<= main_~i~0 8)} assume !(~i~0 < 1024); {2270#false} is VALID [2022-04-28 02:47:38,875 INFO L290 TraceCheckUtils]: 23: Hoare triple {2270#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {2270#false} is VALID [2022-04-28 02:47:38,875 INFO L272 TraceCheckUtils]: 24: Hoare triple {2270#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {2270#false} is VALID [2022-04-28 02:47:38,875 INFO L290 TraceCheckUtils]: 25: Hoare triple {2270#false} ~cond := #in~cond; {2270#false} is VALID [2022-04-28 02:47:38,875 INFO L290 TraceCheckUtils]: 26: Hoare triple {2270#false} assume 0 == ~cond; {2270#false} is VALID [2022-04-28 02:47:38,875 INFO L290 TraceCheckUtils]: 27: Hoare triple {2270#false} assume !false; {2270#false} is VALID [2022-04-28 02:47:38,876 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:47:38,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:47:38,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353303700] [2022-04-28 02:47:38,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353303700] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:47:38,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726902441] [2022-04-28 02:47:38,876 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 02:47:38,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:47:38,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:47:38,877 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:47:38,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-28 02:47:38,927 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 02:47:38,927 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:47:38,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 02:47:38,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:47:38,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:47:39,080 INFO L272 TraceCheckUtils]: 0: Hoare triple {2269#true} call ULTIMATE.init(); {2269#true} is VALID [2022-04-28 02:47:39,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {2269#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {2269#true} is VALID [2022-04-28 02:47:39,080 INFO L290 TraceCheckUtils]: 2: Hoare triple {2269#true} assume true; {2269#true} is VALID [2022-04-28 02:47:39,080 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2269#true} {2269#true} #39#return; {2269#true} is VALID [2022-04-28 02:47:39,080 INFO L272 TraceCheckUtils]: 4: Hoare triple {2269#true} call #t~ret6 := main(); {2269#true} is VALID [2022-04-28 02:47:39,087 INFO L290 TraceCheckUtils]: 5: Hoare triple {2269#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {2302#(<= main_~i~0 0)} is VALID [2022-04-28 02:47:39,088 INFO L290 TraceCheckUtils]: 6: Hoare triple {2302#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2302#(<= main_~i~0 0)} is VALID [2022-04-28 02:47:39,088 INFO L290 TraceCheckUtils]: 7: Hoare triple {2302#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2275#(<= main_~i~0 1)} is VALID [2022-04-28 02:47:39,089 INFO L290 TraceCheckUtils]: 8: Hoare triple {2275#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2275#(<= main_~i~0 1)} is VALID [2022-04-28 02:47:39,089 INFO L290 TraceCheckUtils]: 9: Hoare triple {2275#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2276#(<= main_~i~0 2)} is VALID [2022-04-28 02:47:39,089 INFO L290 TraceCheckUtils]: 10: Hoare triple {2276#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2276#(<= main_~i~0 2)} is VALID [2022-04-28 02:47:39,090 INFO L290 TraceCheckUtils]: 11: Hoare triple {2276#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2277#(<= main_~i~0 3)} is VALID [2022-04-28 02:47:39,090 INFO L290 TraceCheckUtils]: 12: Hoare triple {2277#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2277#(<= main_~i~0 3)} is VALID [2022-04-28 02:47:39,094 INFO L290 TraceCheckUtils]: 13: Hoare triple {2277#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2278#(<= main_~i~0 4)} is VALID [2022-04-28 02:47:39,095 INFO L290 TraceCheckUtils]: 14: Hoare triple {2278#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2278#(<= main_~i~0 4)} is VALID [2022-04-28 02:47:39,096 INFO L290 TraceCheckUtils]: 15: Hoare triple {2278#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2279#(<= main_~i~0 5)} is VALID [2022-04-28 02:47:39,098 INFO L290 TraceCheckUtils]: 16: Hoare triple {2279#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2279#(<= main_~i~0 5)} is VALID [2022-04-28 02:47:39,098 INFO L290 TraceCheckUtils]: 17: Hoare triple {2279#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2280#(<= main_~i~0 6)} is VALID [2022-04-28 02:47:39,098 INFO L290 TraceCheckUtils]: 18: Hoare triple {2280#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2280#(<= main_~i~0 6)} is VALID [2022-04-28 02:47:39,099 INFO L290 TraceCheckUtils]: 19: Hoare triple {2280#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2281#(<= main_~i~0 7)} is VALID [2022-04-28 02:47:39,099 INFO L290 TraceCheckUtils]: 20: Hoare triple {2281#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2281#(<= main_~i~0 7)} is VALID [2022-04-28 02:47:39,099 INFO L290 TraceCheckUtils]: 21: Hoare triple {2281#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2282#(<= main_~i~0 8)} is VALID [2022-04-28 02:47:39,100 INFO L290 TraceCheckUtils]: 22: Hoare triple {2282#(<= main_~i~0 8)} assume !(~i~0 < 1024); {2270#false} is VALID [2022-04-28 02:47:39,100 INFO L290 TraceCheckUtils]: 23: Hoare triple {2270#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {2270#false} is VALID [2022-04-28 02:47:39,100 INFO L272 TraceCheckUtils]: 24: Hoare triple {2270#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {2270#false} is VALID [2022-04-28 02:47:39,100 INFO L290 TraceCheckUtils]: 25: Hoare triple {2270#false} ~cond := #in~cond; {2270#false} is VALID [2022-04-28 02:47:39,100 INFO L290 TraceCheckUtils]: 26: Hoare triple {2270#false} assume 0 == ~cond; {2270#false} is VALID [2022-04-28 02:47:39,100 INFO L290 TraceCheckUtils]: 27: Hoare triple {2270#false} assume !false; {2270#false} is VALID [2022-04-28 02:47:39,100 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:47:39,100 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:47:39,360 INFO L290 TraceCheckUtils]: 27: Hoare triple {2270#false} assume !false; {2270#false} is VALID [2022-04-28 02:47:39,361 INFO L290 TraceCheckUtils]: 26: Hoare triple {2270#false} assume 0 == ~cond; {2270#false} is VALID [2022-04-28 02:47:39,361 INFO L290 TraceCheckUtils]: 25: Hoare triple {2270#false} ~cond := #in~cond; {2270#false} is VALID [2022-04-28 02:47:39,361 INFO L272 TraceCheckUtils]: 24: Hoare triple {2270#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {2270#false} is VALID [2022-04-28 02:47:39,361 INFO L290 TraceCheckUtils]: 23: Hoare triple {2270#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {2270#false} is VALID [2022-04-28 02:47:39,361 INFO L290 TraceCheckUtils]: 22: Hoare triple {2384#(< main_~i~0 1024)} assume !(~i~0 < 1024); {2270#false} is VALID [2022-04-28 02:47:39,361 INFO L290 TraceCheckUtils]: 21: Hoare triple {2388#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2384#(< main_~i~0 1024)} is VALID [2022-04-28 02:47:39,362 INFO L290 TraceCheckUtils]: 20: Hoare triple {2388#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2388#(< main_~i~0 1023)} is VALID [2022-04-28 02:47:39,362 INFO L290 TraceCheckUtils]: 19: Hoare triple {2395#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2388#(< main_~i~0 1023)} is VALID [2022-04-28 02:47:39,362 INFO L290 TraceCheckUtils]: 18: Hoare triple {2395#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2395#(< main_~i~0 1022)} is VALID [2022-04-28 02:47:39,363 INFO L290 TraceCheckUtils]: 17: Hoare triple {2402#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2395#(< main_~i~0 1022)} is VALID [2022-04-28 02:47:39,363 INFO L290 TraceCheckUtils]: 16: Hoare triple {2402#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2402#(< main_~i~0 1021)} is VALID [2022-04-28 02:47:39,363 INFO L290 TraceCheckUtils]: 15: Hoare triple {2409#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2402#(< main_~i~0 1021)} is VALID [2022-04-28 02:47:39,364 INFO L290 TraceCheckUtils]: 14: Hoare triple {2409#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2409#(< main_~i~0 1020)} is VALID [2022-04-28 02:47:39,364 INFO L290 TraceCheckUtils]: 13: Hoare triple {2416#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2409#(< main_~i~0 1020)} is VALID [2022-04-28 02:47:39,364 INFO L290 TraceCheckUtils]: 12: Hoare triple {2416#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2416#(< main_~i~0 1019)} is VALID [2022-04-28 02:47:39,365 INFO L290 TraceCheckUtils]: 11: Hoare triple {2423#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2416#(< main_~i~0 1019)} is VALID [2022-04-28 02:47:39,365 INFO L290 TraceCheckUtils]: 10: Hoare triple {2423#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2423#(< main_~i~0 1018)} is VALID [2022-04-28 02:47:39,365 INFO L290 TraceCheckUtils]: 9: Hoare triple {2430#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2423#(< main_~i~0 1018)} is VALID [2022-04-28 02:47:39,366 INFO L290 TraceCheckUtils]: 8: Hoare triple {2430#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2430#(< main_~i~0 1017)} is VALID [2022-04-28 02:47:39,366 INFO L290 TraceCheckUtils]: 7: Hoare triple {2437#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2430#(< main_~i~0 1017)} is VALID [2022-04-28 02:47:39,366 INFO L290 TraceCheckUtils]: 6: Hoare triple {2437#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2437#(< main_~i~0 1016)} is VALID [2022-04-28 02:47:39,367 INFO L290 TraceCheckUtils]: 5: Hoare triple {2269#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {2437#(< main_~i~0 1016)} is VALID [2022-04-28 02:47:39,367 INFO L272 TraceCheckUtils]: 4: Hoare triple {2269#true} call #t~ret6 := main(); {2269#true} is VALID [2022-04-28 02:47:39,367 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2269#true} {2269#true} #39#return; {2269#true} is VALID [2022-04-28 02:47:39,367 INFO L290 TraceCheckUtils]: 2: Hoare triple {2269#true} assume true; {2269#true} is VALID [2022-04-28 02:47:39,367 INFO L290 TraceCheckUtils]: 1: Hoare triple {2269#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {2269#true} is VALID [2022-04-28 02:47:39,367 INFO L272 TraceCheckUtils]: 0: Hoare triple {2269#true} call ULTIMATE.init(); {2269#true} is VALID [2022-04-28 02:47:39,367 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:47:39,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726902441] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:47:39,367 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:47:39,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 22 [2022-04-28 02:47:39,368 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:47:39,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [482241141] [2022-04-28 02:47:39,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [482241141] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:47:39,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:47:39,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 02:47:39,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879188509] [2022-04-28 02:47:39,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:47:39,368 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-28 02:47:39,369 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:47:39,369 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:39,401 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:47:39,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 02:47:39,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:47:39,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 02:47:39,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=250, Unknown=0, NotChecked=0, Total=462 [2022-04-28 02:47:39,402 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:39,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:47:39,604 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-04-28 02:47:39,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 02:47:39,605 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-28 02:47:39,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:47:39,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:39,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 38 transitions. [2022-04-28 02:47:39,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:39,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 38 transitions. [2022-04-28 02:47:39,607 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 38 transitions. [2022-04-28 02:47:39,648 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:47:39,649 INFO L225 Difference]: With dead ends: 38 [2022-04-28 02:47:39,649 INFO L226 Difference]: Without dead ends: 32 [2022-04-28 02:47:39,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=402, Invalid=528, Unknown=0, NotChecked=0, Total=930 [2022-04-28 02:47:39,650 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 26 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:47:39,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 29 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:47:39,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-28 02:47:39,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2022-04-28 02:47:39,679 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:47:39,680 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:39,680 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:39,680 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:39,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:47:39,681 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-28 02:47:39,681 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-04-28 02:47:39,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:47:39,681 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:47:39,682 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 32 states. [2022-04-28 02:47:39,682 INFO L87 Difference]: Start difference. First operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 32 states. [2022-04-28 02:47:39,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:47:39,683 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-28 02:47:39,683 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-04-28 02:47:39,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:47:39,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:47:39,683 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:47:39,683 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:47:39,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:39,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2022-04-28 02:47:39,684 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2022-04-28 02:47:39,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:47:39,684 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2022-04-28 02:47:39,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:39,685 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 31 transitions. [2022-04-28 02:47:39,713 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:47:39,714 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-28 02:47:39,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 02:47:39,714 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:47:39,714 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:47:39,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-28 02:47:39,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-28 02:47:39,928 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:47:39,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:47:39,928 INFO L85 PathProgramCache]: Analyzing trace with hash -317560180, now seen corresponding path program 17 times [2022-04-28 02:47:39,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:47:39,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2063771077] [2022-04-28 02:47:39,931 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:47:39,931 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:47:39,931 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:47:39,931 INFO L85 PathProgramCache]: Analyzing trace with hash -317560180, now seen corresponding path program 18 times [2022-04-28 02:47:39,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:47:39,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619809967] [2022-04-28 02:47:39,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:47:39,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:47:39,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:47:40,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:47:40,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:47:40,040 INFO L290 TraceCheckUtils]: 0: Hoare triple {2696#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {2681#true} is VALID [2022-04-28 02:47:40,040 INFO L290 TraceCheckUtils]: 1: Hoare triple {2681#true} assume true; {2681#true} is VALID [2022-04-28 02:47:40,040 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2681#true} {2681#true} #39#return; {2681#true} is VALID [2022-04-28 02:47:40,041 INFO L272 TraceCheckUtils]: 0: Hoare triple {2681#true} call ULTIMATE.init(); {2696#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:47:40,041 INFO L290 TraceCheckUtils]: 1: Hoare triple {2696#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {2681#true} is VALID [2022-04-28 02:47:40,041 INFO L290 TraceCheckUtils]: 2: Hoare triple {2681#true} assume true; {2681#true} is VALID [2022-04-28 02:47:40,041 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2681#true} {2681#true} #39#return; {2681#true} is VALID [2022-04-28 02:47:40,041 INFO L272 TraceCheckUtils]: 4: Hoare triple {2681#true} call #t~ret6 := main(); {2681#true} is VALID [2022-04-28 02:47:40,042 INFO L290 TraceCheckUtils]: 5: Hoare triple {2681#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {2686#(= main_~i~0 0)} is VALID [2022-04-28 02:47:40,042 INFO L290 TraceCheckUtils]: 6: Hoare triple {2686#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2686#(= main_~i~0 0)} is VALID [2022-04-28 02:47:40,043 INFO L290 TraceCheckUtils]: 7: Hoare triple {2686#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2687#(<= main_~i~0 1)} is VALID [2022-04-28 02:47:40,043 INFO L290 TraceCheckUtils]: 8: Hoare triple {2687#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2687#(<= main_~i~0 1)} is VALID [2022-04-28 02:47:40,044 INFO L290 TraceCheckUtils]: 9: Hoare triple {2687#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2688#(<= main_~i~0 2)} is VALID [2022-04-28 02:47:40,044 INFO L290 TraceCheckUtils]: 10: Hoare triple {2688#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2688#(<= main_~i~0 2)} is VALID [2022-04-28 02:47:40,044 INFO L290 TraceCheckUtils]: 11: Hoare triple {2688#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2689#(<= main_~i~0 3)} is VALID [2022-04-28 02:47:40,045 INFO L290 TraceCheckUtils]: 12: Hoare triple {2689#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2689#(<= main_~i~0 3)} is VALID [2022-04-28 02:47:40,045 INFO L290 TraceCheckUtils]: 13: Hoare triple {2689#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2690#(<= main_~i~0 4)} is VALID [2022-04-28 02:47:40,046 INFO L290 TraceCheckUtils]: 14: Hoare triple {2690#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2690#(<= main_~i~0 4)} is VALID [2022-04-28 02:47:40,046 INFO L290 TraceCheckUtils]: 15: Hoare triple {2690#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2691#(<= main_~i~0 5)} is VALID [2022-04-28 02:47:40,047 INFO L290 TraceCheckUtils]: 16: Hoare triple {2691#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2691#(<= main_~i~0 5)} is VALID [2022-04-28 02:47:40,047 INFO L290 TraceCheckUtils]: 17: Hoare triple {2691#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2692#(<= main_~i~0 6)} is VALID [2022-04-28 02:47:40,048 INFO L290 TraceCheckUtils]: 18: Hoare triple {2692#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2692#(<= main_~i~0 6)} is VALID [2022-04-28 02:47:40,048 INFO L290 TraceCheckUtils]: 19: Hoare triple {2692#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2693#(<= main_~i~0 7)} is VALID [2022-04-28 02:47:40,048 INFO L290 TraceCheckUtils]: 20: Hoare triple {2693#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2693#(<= main_~i~0 7)} is VALID [2022-04-28 02:47:40,049 INFO L290 TraceCheckUtils]: 21: Hoare triple {2693#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2694#(<= main_~i~0 8)} is VALID [2022-04-28 02:47:40,049 INFO L290 TraceCheckUtils]: 22: Hoare triple {2694#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2694#(<= main_~i~0 8)} is VALID [2022-04-28 02:47:40,050 INFO L290 TraceCheckUtils]: 23: Hoare triple {2694#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2695#(<= main_~i~0 9)} is VALID [2022-04-28 02:47:40,050 INFO L290 TraceCheckUtils]: 24: Hoare triple {2695#(<= main_~i~0 9)} assume !(~i~0 < 1024); {2682#false} is VALID [2022-04-28 02:47:40,050 INFO L290 TraceCheckUtils]: 25: Hoare triple {2682#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {2682#false} is VALID [2022-04-28 02:47:40,051 INFO L272 TraceCheckUtils]: 26: Hoare triple {2682#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {2682#false} is VALID [2022-04-28 02:47:40,051 INFO L290 TraceCheckUtils]: 27: Hoare triple {2682#false} ~cond := #in~cond; {2682#false} is VALID [2022-04-28 02:47:40,051 INFO L290 TraceCheckUtils]: 28: Hoare triple {2682#false} assume 0 == ~cond; {2682#false} is VALID [2022-04-28 02:47:40,051 INFO L290 TraceCheckUtils]: 29: Hoare triple {2682#false} assume !false; {2682#false} is VALID [2022-04-28 02:47:40,051 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:47:40,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:47:40,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619809967] [2022-04-28 02:47:40,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619809967] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:47:40,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772670343] [2022-04-28 02:47:40,052 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 02:47:40,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:47:40,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:47:40,056 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:47:40,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-28 02:47:40,148 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-28 02:47:40,148 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:47:40,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 02:47:40,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:47:40,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:47:40,332 INFO L272 TraceCheckUtils]: 0: Hoare triple {2681#true} call ULTIMATE.init(); {2681#true} is VALID [2022-04-28 02:47:40,333 INFO L290 TraceCheckUtils]: 1: Hoare triple {2681#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {2681#true} is VALID [2022-04-28 02:47:40,333 INFO L290 TraceCheckUtils]: 2: Hoare triple {2681#true} assume true; {2681#true} is VALID [2022-04-28 02:47:40,333 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2681#true} {2681#true} #39#return; {2681#true} is VALID [2022-04-28 02:47:40,333 INFO L272 TraceCheckUtils]: 4: Hoare triple {2681#true} call #t~ret6 := main(); {2681#true} is VALID [2022-04-28 02:47:40,333 INFO L290 TraceCheckUtils]: 5: Hoare triple {2681#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {2715#(<= main_~i~0 0)} is VALID [2022-04-28 02:47:40,334 INFO L290 TraceCheckUtils]: 6: Hoare triple {2715#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2715#(<= main_~i~0 0)} is VALID [2022-04-28 02:47:40,334 INFO L290 TraceCheckUtils]: 7: Hoare triple {2715#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2687#(<= main_~i~0 1)} is VALID [2022-04-28 02:47:40,334 INFO L290 TraceCheckUtils]: 8: Hoare triple {2687#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2687#(<= main_~i~0 1)} is VALID [2022-04-28 02:47:40,335 INFO L290 TraceCheckUtils]: 9: Hoare triple {2687#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2688#(<= main_~i~0 2)} is VALID [2022-04-28 02:47:40,335 INFO L290 TraceCheckUtils]: 10: Hoare triple {2688#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2688#(<= main_~i~0 2)} is VALID [2022-04-28 02:47:40,336 INFO L290 TraceCheckUtils]: 11: Hoare triple {2688#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2689#(<= main_~i~0 3)} is VALID [2022-04-28 02:47:40,336 INFO L290 TraceCheckUtils]: 12: Hoare triple {2689#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2689#(<= main_~i~0 3)} is VALID [2022-04-28 02:47:40,336 INFO L290 TraceCheckUtils]: 13: Hoare triple {2689#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2690#(<= main_~i~0 4)} is VALID [2022-04-28 02:47:40,337 INFO L290 TraceCheckUtils]: 14: Hoare triple {2690#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2690#(<= main_~i~0 4)} is VALID [2022-04-28 02:47:40,337 INFO L290 TraceCheckUtils]: 15: Hoare triple {2690#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2691#(<= main_~i~0 5)} is VALID [2022-04-28 02:47:40,337 INFO L290 TraceCheckUtils]: 16: Hoare triple {2691#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2691#(<= main_~i~0 5)} is VALID [2022-04-28 02:47:40,338 INFO L290 TraceCheckUtils]: 17: Hoare triple {2691#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2692#(<= main_~i~0 6)} is VALID [2022-04-28 02:47:40,338 INFO L290 TraceCheckUtils]: 18: Hoare triple {2692#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2692#(<= main_~i~0 6)} is VALID [2022-04-28 02:47:40,339 INFO L290 TraceCheckUtils]: 19: Hoare triple {2692#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2693#(<= main_~i~0 7)} is VALID [2022-04-28 02:47:40,339 INFO L290 TraceCheckUtils]: 20: Hoare triple {2693#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2693#(<= main_~i~0 7)} is VALID [2022-04-28 02:47:40,339 INFO L290 TraceCheckUtils]: 21: Hoare triple {2693#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2694#(<= main_~i~0 8)} is VALID [2022-04-28 02:47:40,340 INFO L290 TraceCheckUtils]: 22: Hoare triple {2694#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2694#(<= main_~i~0 8)} is VALID [2022-04-28 02:47:40,340 INFO L290 TraceCheckUtils]: 23: Hoare triple {2694#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2695#(<= main_~i~0 9)} is VALID [2022-04-28 02:47:40,340 INFO L290 TraceCheckUtils]: 24: Hoare triple {2695#(<= main_~i~0 9)} assume !(~i~0 < 1024); {2682#false} is VALID [2022-04-28 02:47:40,340 INFO L290 TraceCheckUtils]: 25: Hoare triple {2682#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {2682#false} is VALID [2022-04-28 02:47:40,341 INFO L272 TraceCheckUtils]: 26: Hoare triple {2682#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {2682#false} is VALID [2022-04-28 02:47:40,341 INFO L290 TraceCheckUtils]: 27: Hoare triple {2682#false} ~cond := #in~cond; {2682#false} is VALID [2022-04-28 02:47:40,341 INFO L290 TraceCheckUtils]: 28: Hoare triple {2682#false} assume 0 == ~cond; {2682#false} is VALID [2022-04-28 02:47:40,341 INFO L290 TraceCheckUtils]: 29: Hoare triple {2682#false} assume !false; {2682#false} is VALID [2022-04-28 02:47:40,341 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:47:40,341 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:47:40,625 INFO L290 TraceCheckUtils]: 29: Hoare triple {2682#false} assume !false; {2682#false} is VALID [2022-04-28 02:47:40,625 INFO L290 TraceCheckUtils]: 28: Hoare triple {2682#false} assume 0 == ~cond; {2682#false} is VALID [2022-04-28 02:47:40,625 INFO L290 TraceCheckUtils]: 27: Hoare triple {2682#false} ~cond := #in~cond; {2682#false} is VALID [2022-04-28 02:47:40,625 INFO L272 TraceCheckUtils]: 26: Hoare triple {2682#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {2682#false} is VALID [2022-04-28 02:47:40,626 INFO L290 TraceCheckUtils]: 25: Hoare triple {2682#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {2682#false} is VALID [2022-04-28 02:47:40,626 INFO L290 TraceCheckUtils]: 24: Hoare triple {2803#(< main_~i~0 1024)} assume !(~i~0 < 1024); {2682#false} is VALID [2022-04-28 02:47:40,626 INFO L290 TraceCheckUtils]: 23: Hoare triple {2807#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2803#(< main_~i~0 1024)} is VALID [2022-04-28 02:47:40,627 INFO L290 TraceCheckUtils]: 22: Hoare triple {2807#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2807#(< main_~i~0 1023)} is VALID [2022-04-28 02:47:40,627 INFO L290 TraceCheckUtils]: 21: Hoare triple {2814#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2807#(< main_~i~0 1023)} is VALID [2022-04-28 02:47:40,628 INFO L290 TraceCheckUtils]: 20: Hoare triple {2814#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2814#(< main_~i~0 1022)} is VALID [2022-04-28 02:47:40,628 INFO L290 TraceCheckUtils]: 19: Hoare triple {2821#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2814#(< main_~i~0 1022)} is VALID [2022-04-28 02:47:40,628 INFO L290 TraceCheckUtils]: 18: Hoare triple {2821#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2821#(< main_~i~0 1021)} is VALID [2022-04-28 02:47:40,629 INFO L290 TraceCheckUtils]: 17: Hoare triple {2828#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2821#(< main_~i~0 1021)} is VALID [2022-04-28 02:47:40,629 INFO L290 TraceCheckUtils]: 16: Hoare triple {2828#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2828#(< main_~i~0 1020)} is VALID [2022-04-28 02:47:40,630 INFO L290 TraceCheckUtils]: 15: Hoare triple {2835#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2828#(< main_~i~0 1020)} is VALID [2022-04-28 02:47:40,630 INFO L290 TraceCheckUtils]: 14: Hoare triple {2835#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2835#(< main_~i~0 1019)} is VALID [2022-04-28 02:47:40,630 INFO L290 TraceCheckUtils]: 13: Hoare triple {2842#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2835#(< main_~i~0 1019)} is VALID [2022-04-28 02:47:40,631 INFO L290 TraceCheckUtils]: 12: Hoare triple {2842#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2842#(< main_~i~0 1018)} is VALID [2022-04-28 02:47:40,631 INFO L290 TraceCheckUtils]: 11: Hoare triple {2849#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2842#(< main_~i~0 1018)} is VALID [2022-04-28 02:47:40,632 INFO L290 TraceCheckUtils]: 10: Hoare triple {2849#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2849#(< main_~i~0 1017)} is VALID [2022-04-28 02:47:40,632 INFO L290 TraceCheckUtils]: 9: Hoare triple {2856#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2849#(< main_~i~0 1017)} is VALID [2022-04-28 02:47:40,632 INFO L290 TraceCheckUtils]: 8: Hoare triple {2856#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2856#(< main_~i~0 1016)} is VALID [2022-04-28 02:47:40,633 INFO L290 TraceCheckUtils]: 7: Hoare triple {2863#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2856#(< main_~i~0 1016)} is VALID [2022-04-28 02:47:40,633 INFO L290 TraceCheckUtils]: 6: Hoare triple {2863#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2863#(< main_~i~0 1015)} is VALID [2022-04-28 02:47:40,634 INFO L290 TraceCheckUtils]: 5: Hoare triple {2681#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {2863#(< main_~i~0 1015)} is VALID [2022-04-28 02:47:40,634 INFO L272 TraceCheckUtils]: 4: Hoare triple {2681#true} call #t~ret6 := main(); {2681#true} is VALID [2022-04-28 02:47:40,634 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2681#true} {2681#true} #39#return; {2681#true} is VALID [2022-04-28 02:47:40,634 INFO L290 TraceCheckUtils]: 2: Hoare triple {2681#true} assume true; {2681#true} is VALID [2022-04-28 02:47:40,634 INFO L290 TraceCheckUtils]: 1: Hoare triple {2681#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {2681#true} is VALID [2022-04-28 02:47:40,634 INFO L272 TraceCheckUtils]: 0: Hoare triple {2681#true} call ULTIMATE.init(); {2681#true} is VALID [2022-04-28 02:47:40,634 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:47:40,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772670343] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:47:40,635 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:47:40,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 24 [2022-04-28 02:47:40,635 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:47:40,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2063771077] [2022-04-28 02:47:40,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2063771077] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:47:40,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:47:40,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 02:47:40,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824431883] [2022-04-28 02:47:40,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:47:40,636 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-28 02:47:40,636 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:47:40,636 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:40,659 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:47:40,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 02:47:40,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:47:40,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 02:47:40,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=297, Unknown=0, NotChecked=0, Total=552 [2022-04-28 02:47:40,660 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:40,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:47:40,883 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-04-28 02:47:40,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 02:47:40,883 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-28 02:47:40,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:47:40,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:40,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 40 transitions. [2022-04-28 02:47:40,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:40,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 40 transitions. [2022-04-28 02:47:40,886 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 40 transitions. [2022-04-28 02:47:40,916 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:47:40,916 INFO L225 Difference]: With dead ends: 40 [2022-04-28 02:47:40,916 INFO L226 Difference]: Without dead ends: 34 [2022-04-28 02:47:40,917 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=486, Invalid=636, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 02:47:40,917 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 28 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:47:40,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 24 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:47:40,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-28 02:47:40,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2022-04-28 02:47:40,948 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:47:40,948 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:40,948 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:40,948 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:40,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:47:40,949 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-28 02:47:40,949 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-28 02:47:40,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:47:40,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:47:40,950 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-28 02:47:40,950 INFO L87 Difference]: Start difference. First operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-28 02:47:40,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:47:40,951 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-28 02:47:40,951 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-28 02:47:40,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:47:40,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:47:40,951 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:47:40,951 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:47:40,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:40,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2022-04-28 02:47:40,952 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2022-04-28 02:47:40,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:47:40,952 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2022-04-28 02:47:40,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:40,953 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 33 transitions. [2022-04-28 02:47:40,985 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:47:40,985 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-04-28 02:47:40,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 02:47:40,986 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:47:40,986 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:47:41,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-28 02:47:41,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-28 02:47:41,186 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:47:41,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:47:41,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1106742514, now seen corresponding path program 19 times [2022-04-28 02:47:41,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:47:41,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [956022248] [2022-04-28 02:47:41,189 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:47:41,189 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:47:41,189 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:47:41,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1106742514, now seen corresponding path program 20 times [2022-04-28 02:47:41,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:47:41,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694337903] [2022-04-28 02:47:41,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:47:41,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:47:41,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:47:41,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:47:41,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:47:41,335 INFO L290 TraceCheckUtils]: 0: Hoare triple {3137#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {3121#true} is VALID [2022-04-28 02:47:41,335 INFO L290 TraceCheckUtils]: 1: Hoare triple {3121#true} assume true; {3121#true} is VALID [2022-04-28 02:47:41,335 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3121#true} {3121#true} #39#return; {3121#true} is VALID [2022-04-28 02:47:41,336 INFO L272 TraceCheckUtils]: 0: Hoare triple {3121#true} call ULTIMATE.init(); {3137#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:47:41,336 INFO L290 TraceCheckUtils]: 1: Hoare triple {3137#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {3121#true} is VALID [2022-04-28 02:47:41,336 INFO L290 TraceCheckUtils]: 2: Hoare triple {3121#true} assume true; {3121#true} is VALID [2022-04-28 02:47:41,336 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3121#true} {3121#true} #39#return; {3121#true} is VALID [2022-04-28 02:47:41,336 INFO L272 TraceCheckUtils]: 4: Hoare triple {3121#true} call #t~ret6 := main(); {3121#true} is VALID [2022-04-28 02:47:41,336 INFO L290 TraceCheckUtils]: 5: Hoare triple {3121#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {3126#(= main_~i~0 0)} is VALID [2022-04-28 02:47:41,337 INFO L290 TraceCheckUtils]: 6: Hoare triple {3126#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3126#(= main_~i~0 0)} is VALID [2022-04-28 02:47:41,337 INFO L290 TraceCheckUtils]: 7: Hoare triple {3126#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3127#(<= main_~i~0 1)} is VALID [2022-04-28 02:47:41,338 INFO L290 TraceCheckUtils]: 8: Hoare triple {3127#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3127#(<= main_~i~0 1)} is VALID [2022-04-28 02:47:41,338 INFO L290 TraceCheckUtils]: 9: Hoare triple {3127#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3128#(<= main_~i~0 2)} is VALID [2022-04-28 02:47:41,339 INFO L290 TraceCheckUtils]: 10: Hoare triple {3128#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3128#(<= main_~i~0 2)} is VALID [2022-04-28 02:47:41,339 INFO L290 TraceCheckUtils]: 11: Hoare triple {3128#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3129#(<= main_~i~0 3)} is VALID [2022-04-28 02:47:41,339 INFO L290 TraceCheckUtils]: 12: Hoare triple {3129#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3129#(<= main_~i~0 3)} is VALID [2022-04-28 02:47:41,340 INFO L290 TraceCheckUtils]: 13: Hoare triple {3129#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3130#(<= main_~i~0 4)} is VALID [2022-04-28 02:47:41,340 INFO L290 TraceCheckUtils]: 14: Hoare triple {3130#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3130#(<= main_~i~0 4)} is VALID [2022-04-28 02:47:41,341 INFO L290 TraceCheckUtils]: 15: Hoare triple {3130#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3131#(<= main_~i~0 5)} is VALID [2022-04-28 02:47:41,341 INFO L290 TraceCheckUtils]: 16: Hoare triple {3131#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3131#(<= main_~i~0 5)} is VALID [2022-04-28 02:47:41,342 INFO L290 TraceCheckUtils]: 17: Hoare triple {3131#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3132#(<= main_~i~0 6)} is VALID [2022-04-28 02:47:41,342 INFO L290 TraceCheckUtils]: 18: Hoare triple {3132#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3132#(<= main_~i~0 6)} is VALID [2022-04-28 02:47:41,343 INFO L290 TraceCheckUtils]: 19: Hoare triple {3132#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3133#(<= main_~i~0 7)} is VALID [2022-04-28 02:47:41,343 INFO L290 TraceCheckUtils]: 20: Hoare triple {3133#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3133#(<= main_~i~0 7)} is VALID [2022-04-28 02:47:41,343 INFO L290 TraceCheckUtils]: 21: Hoare triple {3133#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3134#(<= main_~i~0 8)} is VALID [2022-04-28 02:47:41,344 INFO L290 TraceCheckUtils]: 22: Hoare triple {3134#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3134#(<= main_~i~0 8)} is VALID [2022-04-28 02:47:41,344 INFO L290 TraceCheckUtils]: 23: Hoare triple {3134#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3135#(<= main_~i~0 9)} is VALID [2022-04-28 02:47:41,345 INFO L290 TraceCheckUtils]: 24: Hoare triple {3135#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3135#(<= main_~i~0 9)} is VALID [2022-04-28 02:47:41,345 INFO L290 TraceCheckUtils]: 25: Hoare triple {3135#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3136#(<= main_~i~0 10)} is VALID [2022-04-28 02:47:41,346 INFO L290 TraceCheckUtils]: 26: Hoare triple {3136#(<= main_~i~0 10)} assume !(~i~0 < 1024); {3122#false} is VALID [2022-04-28 02:47:41,346 INFO L290 TraceCheckUtils]: 27: Hoare triple {3122#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {3122#false} is VALID [2022-04-28 02:47:41,346 INFO L272 TraceCheckUtils]: 28: Hoare triple {3122#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {3122#false} is VALID [2022-04-28 02:47:41,346 INFO L290 TraceCheckUtils]: 29: Hoare triple {3122#false} ~cond := #in~cond; {3122#false} is VALID [2022-04-28 02:47:41,346 INFO L290 TraceCheckUtils]: 30: Hoare triple {3122#false} assume 0 == ~cond; {3122#false} is VALID [2022-04-28 02:47:41,346 INFO L290 TraceCheckUtils]: 31: Hoare triple {3122#false} assume !false; {3122#false} is VALID [2022-04-28 02:47:41,346 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:47:41,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:47:41,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694337903] [2022-04-28 02:47:41,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694337903] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:47:41,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [81867384] [2022-04-28 02:47:41,347 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:47:41,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:47:41,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:47:41,348 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:47:41,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-28 02:47:41,410 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:47:41,411 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:47:41,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 02:47:41,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:47:41,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:47:41,607 INFO L272 TraceCheckUtils]: 0: Hoare triple {3121#true} call ULTIMATE.init(); {3121#true} is VALID [2022-04-28 02:47:41,608 INFO L290 TraceCheckUtils]: 1: Hoare triple {3121#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {3121#true} is VALID [2022-04-28 02:47:41,608 INFO L290 TraceCheckUtils]: 2: Hoare triple {3121#true} assume true; {3121#true} is VALID [2022-04-28 02:47:41,608 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3121#true} {3121#true} #39#return; {3121#true} is VALID [2022-04-28 02:47:41,608 INFO L272 TraceCheckUtils]: 4: Hoare triple {3121#true} call #t~ret6 := main(); {3121#true} is VALID [2022-04-28 02:47:41,609 INFO L290 TraceCheckUtils]: 5: Hoare triple {3121#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {3156#(<= main_~i~0 0)} is VALID [2022-04-28 02:47:41,609 INFO L290 TraceCheckUtils]: 6: Hoare triple {3156#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3156#(<= main_~i~0 0)} is VALID [2022-04-28 02:47:41,610 INFO L290 TraceCheckUtils]: 7: Hoare triple {3156#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3127#(<= main_~i~0 1)} is VALID [2022-04-28 02:47:41,610 INFO L290 TraceCheckUtils]: 8: Hoare triple {3127#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3127#(<= main_~i~0 1)} is VALID [2022-04-28 02:47:41,610 INFO L290 TraceCheckUtils]: 9: Hoare triple {3127#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3128#(<= main_~i~0 2)} is VALID [2022-04-28 02:47:41,611 INFO L290 TraceCheckUtils]: 10: Hoare triple {3128#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3128#(<= main_~i~0 2)} is VALID [2022-04-28 02:47:41,611 INFO L290 TraceCheckUtils]: 11: Hoare triple {3128#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3129#(<= main_~i~0 3)} is VALID [2022-04-28 02:47:41,612 INFO L290 TraceCheckUtils]: 12: Hoare triple {3129#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3129#(<= main_~i~0 3)} is VALID [2022-04-28 02:47:41,612 INFO L290 TraceCheckUtils]: 13: Hoare triple {3129#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3130#(<= main_~i~0 4)} is VALID [2022-04-28 02:47:41,613 INFO L290 TraceCheckUtils]: 14: Hoare triple {3130#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3130#(<= main_~i~0 4)} is VALID [2022-04-28 02:47:41,613 INFO L290 TraceCheckUtils]: 15: Hoare triple {3130#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3131#(<= main_~i~0 5)} is VALID [2022-04-28 02:47:41,614 INFO L290 TraceCheckUtils]: 16: Hoare triple {3131#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3131#(<= main_~i~0 5)} is VALID [2022-04-28 02:47:41,614 INFO L290 TraceCheckUtils]: 17: Hoare triple {3131#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3132#(<= main_~i~0 6)} is VALID [2022-04-28 02:47:41,614 INFO L290 TraceCheckUtils]: 18: Hoare triple {3132#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3132#(<= main_~i~0 6)} is VALID [2022-04-28 02:47:41,615 INFO L290 TraceCheckUtils]: 19: Hoare triple {3132#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3133#(<= main_~i~0 7)} is VALID [2022-04-28 02:47:41,615 INFO L290 TraceCheckUtils]: 20: Hoare triple {3133#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3133#(<= main_~i~0 7)} is VALID [2022-04-28 02:47:41,616 INFO L290 TraceCheckUtils]: 21: Hoare triple {3133#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3134#(<= main_~i~0 8)} is VALID [2022-04-28 02:47:41,616 INFO L290 TraceCheckUtils]: 22: Hoare triple {3134#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3134#(<= main_~i~0 8)} is VALID [2022-04-28 02:47:41,617 INFO L290 TraceCheckUtils]: 23: Hoare triple {3134#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3135#(<= main_~i~0 9)} is VALID [2022-04-28 02:47:41,617 INFO L290 TraceCheckUtils]: 24: Hoare triple {3135#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3135#(<= main_~i~0 9)} is VALID [2022-04-28 02:47:41,618 INFO L290 TraceCheckUtils]: 25: Hoare triple {3135#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3136#(<= main_~i~0 10)} is VALID [2022-04-28 02:47:41,618 INFO L290 TraceCheckUtils]: 26: Hoare triple {3136#(<= main_~i~0 10)} assume !(~i~0 < 1024); {3122#false} is VALID [2022-04-28 02:47:41,618 INFO L290 TraceCheckUtils]: 27: Hoare triple {3122#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {3122#false} is VALID [2022-04-28 02:47:41,618 INFO L272 TraceCheckUtils]: 28: Hoare triple {3122#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {3122#false} is VALID [2022-04-28 02:47:41,619 INFO L290 TraceCheckUtils]: 29: Hoare triple {3122#false} ~cond := #in~cond; {3122#false} is VALID [2022-04-28 02:47:41,619 INFO L290 TraceCheckUtils]: 30: Hoare triple {3122#false} assume 0 == ~cond; {3122#false} is VALID [2022-04-28 02:47:41,619 INFO L290 TraceCheckUtils]: 31: Hoare triple {3122#false} assume !false; {3122#false} is VALID [2022-04-28 02:47:41,619 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:47:41,619 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:47:41,978 INFO L290 TraceCheckUtils]: 31: Hoare triple {3122#false} assume !false; {3122#false} is VALID [2022-04-28 02:47:41,978 INFO L290 TraceCheckUtils]: 30: Hoare triple {3122#false} assume 0 == ~cond; {3122#false} is VALID [2022-04-28 02:47:41,978 INFO L290 TraceCheckUtils]: 29: Hoare triple {3122#false} ~cond := #in~cond; {3122#false} is VALID [2022-04-28 02:47:41,978 INFO L272 TraceCheckUtils]: 28: Hoare triple {3122#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {3122#false} is VALID [2022-04-28 02:47:41,978 INFO L290 TraceCheckUtils]: 27: Hoare triple {3122#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {3122#false} is VALID [2022-04-28 02:47:41,979 INFO L290 TraceCheckUtils]: 26: Hoare triple {3250#(< main_~i~0 1024)} assume !(~i~0 < 1024); {3122#false} is VALID [2022-04-28 02:47:41,979 INFO L290 TraceCheckUtils]: 25: Hoare triple {3254#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3250#(< main_~i~0 1024)} is VALID [2022-04-28 02:47:41,979 INFO L290 TraceCheckUtils]: 24: Hoare triple {3254#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3254#(< main_~i~0 1023)} is VALID [2022-04-28 02:47:41,980 INFO L290 TraceCheckUtils]: 23: Hoare triple {3261#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3254#(< main_~i~0 1023)} is VALID [2022-04-28 02:47:41,980 INFO L290 TraceCheckUtils]: 22: Hoare triple {3261#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3261#(< main_~i~0 1022)} is VALID [2022-04-28 02:47:41,980 INFO L290 TraceCheckUtils]: 21: Hoare triple {3268#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3261#(< main_~i~0 1022)} is VALID [2022-04-28 02:47:41,981 INFO L290 TraceCheckUtils]: 20: Hoare triple {3268#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3268#(< main_~i~0 1021)} is VALID [2022-04-28 02:47:41,981 INFO L290 TraceCheckUtils]: 19: Hoare triple {3275#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3268#(< main_~i~0 1021)} is VALID [2022-04-28 02:47:41,981 INFO L290 TraceCheckUtils]: 18: Hoare triple {3275#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3275#(< main_~i~0 1020)} is VALID [2022-04-28 02:47:41,982 INFO L290 TraceCheckUtils]: 17: Hoare triple {3282#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3275#(< main_~i~0 1020)} is VALID [2022-04-28 02:47:41,982 INFO L290 TraceCheckUtils]: 16: Hoare triple {3282#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3282#(< main_~i~0 1019)} is VALID [2022-04-28 02:47:41,982 INFO L290 TraceCheckUtils]: 15: Hoare triple {3289#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3282#(< main_~i~0 1019)} is VALID [2022-04-28 02:47:41,983 INFO L290 TraceCheckUtils]: 14: Hoare triple {3289#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3289#(< main_~i~0 1018)} is VALID [2022-04-28 02:47:41,983 INFO L290 TraceCheckUtils]: 13: Hoare triple {3296#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3289#(< main_~i~0 1018)} is VALID [2022-04-28 02:47:41,983 INFO L290 TraceCheckUtils]: 12: Hoare triple {3296#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3296#(< main_~i~0 1017)} is VALID [2022-04-28 02:47:41,984 INFO L290 TraceCheckUtils]: 11: Hoare triple {3303#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3296#(< main_~i~0 1017)} is VALID [2022-04-28 02:47:41,984 INFO L290 TraceCheckUtils]: 10: Hoare triple {3303#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3303#(< main_~i~0 1016)} is VALID [2022-04-28 02:47:41,985 INFO L290 TraceCheckUtils]: 9: Hoare triple {3310#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3303#(< main_~i~0 1016)} is VALID [2022-04-28 02:47:41,985 INFO L290 TraceCheckUtils]: 8: Hoare triple {3310#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3310#(< main_~i~0 1015)} is VALID [2022-04-28 02:47:41,985 INFO L290 TraceCheckUtils]: 7: Hoare triple {3317#(< main_~i~0 1014)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3310#(< main_~i~0 1015)} is VALID [2022-04-28 02:47:41,986 INFO L290 TraceCheckUtils]: 6: Hoare triple {3317#(< main_~i~0 1014)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3317#(< main_~i~0 1014)} is VALID [2022-04-28 02:47:41,986 INFO L290 TraceCheckUtils]: 5: Hoare triple {3121#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {3317#(< main_~i~0 1014)} is VALID [2022-04-28 02:47:41,986 INFO L272 TraceCheckUtils]: 4: Hoare triple {3121#true} call #t~ret6 := main(); {3121#true} is VALID [2022-04-28 02:47:41,986 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3121#true} {3121#true} #39#return; {3121#true} is VALID [2022-04-28 02:47:41,986 INFO L290 TraceCheckUtils]: 2: Hoare triple {3121#true} assume true; {3121#true} is VALID [2022-04-28 02:47:41,986 INFO L290 TraceCheckUtils]: 1: Hoare triple {3121#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {3121#true} is VALID [2022-04-28 02:47:41,986 INFO L272 TraceCheckUtils]: 0: Hoare triple {3121#true} call ULTIMATE.init(); {3121#true} is VALID [2022-04-28 02:47:41,987 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:47:41,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [81867384] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:47:41,987 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:47:41,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-04-28 02:47:41,987 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:47:41,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [956022248] [2022-04-28 02:47:41,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [956022248] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:47:41,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:47:41,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 02:47:41,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382448399] [2022-04-28 02:47:41,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:47:41,988 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-28 02:47:41,988 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:47:41,988 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:42,009 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:47:42,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 02:47:42,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:47:42,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 02:47:42,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=348, Unknown=0, NotChecked=0, Total=650 [2022-04-28 02:47:42,010 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:42,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:47:42,311 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2022-04-28 02:47:42,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 02:47:42,312 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-28 02:47:42,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:47:42,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:42,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 42 transitions. [2022-04-28 02:47:42,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:42,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 42 transitions. [2022-04-28 02:47:42,314 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 42 transitions. [2022-04-28 02:47:42,344 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:47:42,344 INFO L225 Difference]: With dead ends: 42 [2022-04-28 02:47:42,344 INFO L226 Difference]: Without dead ends: 36 [2022-04-28 02:47:42,345 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=578, Invalid=754, Unknown=0, NotChecked=0, Total=1332 [2022-04-28 02:47:42,346 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 30 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:47:42,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 54 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:47:42,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-28 02:47:42,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2022-04-28 02:47:42,399 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:47:42,399 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:42,399 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:42,399 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:42,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:47:42,401 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-28 02:47:42,401 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-04-28 02:47:42,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:47:42,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:47:42,402 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 36 states. [2022-04-28 02:47:42,402 INFO L87 Difference]: Start difference. First operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 36 states. [2022-04-28 02:47:42,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:47:42,403 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-28 02:47:42,403 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-04-28 02:47:42,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:47:42,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:47:42,403 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:47:42,403 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:47:42,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:42,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2022-04-28 02:47:42,404 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2022-04-28 02:47:42,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:47:42,404 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2022-04-28 02:47:42,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:42,404 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 35 transitions. [2022-04-28 02:47:42,439 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:47:42,439 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2022-04-28 02:47:42,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 02:47:42,440 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:47:42,440 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:47:42,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-28 02:47:42,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-28 02:47:42,655 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:47:42,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:47:42,656 INFO L85 PathProgramCache]: Analyzing trace with hash 698245904, now seen corresponding path program 21 times [2022-04-28 02:47:42,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:47:42,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1787228966] [2022-04-28 02:47:42,658 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:47:42,658 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:47:42,658 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:47:42,658 INFO L85 PathProgramCache]: Analyzing trace with hash 698245904, now seen corresponding path program 22 times [2022-04-28 02:47:42,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:47:42,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768056167] [2022-04-28 02:47:42,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:47:42,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:47:42,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:47:42,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:47:42,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:47:42,784 INFO L290 TraceCheckUtils]: 0: Hoare triple {3606#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {3589#true} is VALID [2022-04-28 02:47:42,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {3589#true} assume true; {3589#true} is VALID [2022-04-28 02:47:42,784 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3589#true} {3589#true} #39#return; {3589#true} is VALID [2022-04-28 02:47:42,785 INFO L272 TraceCheckUtils]: 0: Hoare triple {3589#true} call ULTIMATE.init(); {3606#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:47:42,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {3606#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {3589#true} is VALID [2022-04-28 02:47:42,785 INFO L290 TraceCheckUtils]: 2: Hoare triple {3589#true} assume true; {3589#true} is VALID [2022-04-28 02:47:42,785 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3589#true} {3589#true} #39#return; {3589#true} is VALID [2022-04-28 02:47:42,785 INFO L272 TraceCheckUtils]: 4: Hoare triple {3589#true} call #t~ret6 := main(); {3589#true} is VALID [2022-04-28 02:47:42,785 INFO L290 TraceCheckUtils]: 5: Hoare triple {3589#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {3594#(= main_~i~0 0)} is VALID [2022-04-28 02:47:42,786 INFO L290 TraceCheckUtils]: 6: Hoare triple {3594#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3594#(= main_~i~0 0)} is VALID [2022-04-28 02:47:42,786 INFO L290 TraceCheckUtils]: 7: Hoare triple {3594#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3595#(<= main_~i~0 1)} is VALID [2022-04-28 02:47:42,786 INFO L290 TraceCheckUtils]: 8: Hoare triple {3595#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3595#(<= main_~i~0 1)} is VALID [2022-04-28 02:47:42,787 INFO L290 TraceCheckUtils]: 9: Hoare triple {3595#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3596#(<= main_~i~0 2)} is VALID [2022-04-28 02:47:42,787 INFO L290 TraceCheckUtils]: 10: Hoare triple {3596#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3596#(<= main_~i~0 2)} is VALID [2022-04-28 02:47:42,787 INFO L290 TraceCheckUtils]: 11: Hoare triple {3596#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3597#(<= main_~i~0 3)} is VALID [2022-04-28 02:47:42,788 INFO L290 TraceCheckUtils]: 12: Hoare triple {3597#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3597#(<= main_~i~0 3)} is VALID [2022-04-28 02:47:42,788 INFO L290 TraceCheckUtils]: 13: Hoare triple {3597#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3598#(<= main_~i~0 4)} is VALID [2022-04-28 02:47:42,788 INFO L290 TraceCheckUtils]: 14: Hoare triple {3598#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3598#(<= main_~i~0 4)} is VALID [2022-04-28 02:47:42,789 INFO L290 TraceCheckUtils]: 15: Hoare triple {3598#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3599#(<= main_~i~0 5)} is VALID [2022-04-28 02:47:42,789 INFO L290 TraceCheckUtils]: 16: Hoare triple {3599#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3599#(<= main_~i~0 5)} is VALID [2022-04-28 02:47:42,790 INFO L290 TraceCheckUtils]: 17: Hoare triple {3599#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3600#(<= main_~i~0 6)} is VALID [2022-04-28 02:47:42,791 INFO L290 TraceCheckUtils]: 18: Hoare triple {3600#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3600#(<= main_~i~0 6)} is VALID [2022-04-28 02:47:42,792 INFO L290 TraceCheckUtils]: 19: Hoare triple {3600#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3601#(<= main_~i~0 7)} is VALID [2022-04-28 02:47:42,794 INFO L290 TraceCheckUtils]: 20: Hoare triple {3601#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3601#(<= main_~i~0 7)} is VALID [2022-04-28 02:47:42,795 INFO L290 TraceCheckUtils]: 21: Hoare triple {3601#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3602#(<= main_~i~0 8)} is VALID [2022-04-28 02:47:42,795 INFO L290 TraceCheckUtils]: 22: Hoare triple {3602#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3602#(<= main_~i~0 8)} is VALID [2022-04-28 02:47:42,796 INFO L290 TraceCheckUtils]: 23: Hoare triple {3602#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3603#(<= main_~i~0 9)} is VALID [2022-04-28 02:47:42,796 INFO L290 TraceCheckUtils]: 24: Hoare triple {3603#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3603#(<= main_~i~0 9)} is VALID [2022-04-28 02:47:42,797 INFO L290 TraceCheckUtils]: 25: Hoare triple {3603#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3604#(<= main_~i~0 10)} is VALID [2022-04-28 02:47:42,797 INFO L290 TraceCheckUtils]: 26: Hoare triple {3604#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3604#(<= main_~i~0 10)} is VALID [2022-04-28 02:47:42,797 INFO L290 TraceCheckUtils]: 27: Hoare triple {3604#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3605#(<= main_~i~0 11)} is VALID [2022-04-28 02:47:42,798 INFO L290 TraceCheckUtils]: 28: Hoare triple {3605#(<= main_~i~0 11)} assume !(~i~0 < 1024); {3590#false} is VALID [2022-04-28 02:47:42,798 INFO L290 TraceCheckUtils]: 29: Hoare triple {3590#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {3590#false} is VALID [2022-04-28 02:47:42,798 INFO L272 TraceCheckUtils]: 30: Hoare triple {3590#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {3590#false} is VALID [2022-04-28 02:47:42,798 INFO L290 TraceCheckUtils]: 31: Hoare triple {3590#false} ~cond := #in~cond; {3590#false} is VALID [2022-04-28 02:47:42,798 INFO L290 TraceCheckUtils]: 32: Hoare triple {3590#false} assume 0 == ~cond; {3590#false} is VALID [2022-04-28 02:47:42,798 INFO L290 TraceCheckUtils]: 33: Hoare triple {3590#false} assume !false; {3590#false} is VALID [2022-04-28 02:47:42,798 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:47:42,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:47:42,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768056167] [2022-04-28 02:47:42,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768056167] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:47:42,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077633483] [2022-04-28 02:47:42,799 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 02:47:42,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:47:42,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:47:42,800 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:47:42,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-28 02:47:42,867 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 02:47:42,867 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:47:42,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 02:47:42,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:47:42,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:47:43,044 INFO L272 TraceCheckUtils]: 0: Hoare triple {3589#true} call ULTIMATE.init(); {3589#true} is VALID [2022-04-28 02:47:43,045 INFO L290 TraceCheckUtils]: 1: Hoare triple {3589#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {3589#true} is VALID [2022-04-28 02:47:43,045 INFO L290 TraceCheckUtils]: 2: Hoare triple {3589#true} assume true; {3589#true} is VALID [2022-04-28 02:47:43,045 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3589#true} {3589#true} #39#return; {3589#true} is VALID [2022-04-28 02:47:43,045 INFO L272 TraceCheckUtils]: 4: Hoare triple {3589#true} call #t~ret6 := main(); {3589#true} is VALID [2022-04-28 02:47:43,046 INFO L290 TraceCheckUtils]: 5: Hoare triple {3589#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {3625#(<= main_~i~0 0)} is VALID [2022-04-28 02:47:43,046 INFO L290 TraceCheckUtils]: 6: Hoare triple {3625#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3625#(<= main_~i~0 0)} is VALID [2022-04-28 02:47:43,046 INFO L290 TraceCheckUtils]: 7: Hoare triple {3625#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3595#(<= main_~i~0 1)} is VALID [2022-04-28 02:47:43,047 INFO L290 TraceCheckUtils]: 8: Hoare triple {3595#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3595#(<= main_~i~0 1)} is VALID [2022-04-28 02:47:43,047 INFO L290 TraceCheckUtils]: 9: Hoare triple {3595#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3596#(<= main_~i~0 2)} is VALID [2022-04-28 02:47:43,047 INFO L290 TraceCheckUtils]: 10: Hoare triple {3596#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3596#(<= main_~i~0 2)} is VALID [2022-04-28 02:47:43,048 INFO L290 TraceCheckUtils]: 11: Hoare triple {3596#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3597#(<= main_~i~0 3)} is VALID [2022-04-28 02:47:43,048 INFO L290 TraceCheckUtils]: 12: Hoare triple {3597#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3597#(<= main_~i~0 3)} is VALID [2022-04-28 02:47:43,049 INFO L290 TraceCheckUtils]: 13: Hoare triple {3597#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3598#(<= main_~i~0 4)} is VALID [2022-04-28 02:47:43,049 INFO L290 TraceCheckUtils]: 14: Hoare triple {3598#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3598#(<= main_~i~0 4)} is VALID [2022-04-28 02:47:43,049 INFO L290 TraceCheckUtils]: 15: Hoare triple {3598#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3599#(<= main_~i~0 5)} is VALID [2022-04-28 02:47:43,050 INFO L290 TraceCheckUtils]: 16: Hoare triple {3599#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3599#(<= main_~i~0 5)} is VALID [2022-04-28 02:47:43,050 INFO L290 TraceCheckUtils]: 17: Hoare triple {3599#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3600#(<= main_~i~0 6)} is VALID [2022-04-28 02:47:43,050 INFO L290 TraceCheckUtils]: 18: Hoare triple {3600#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3600#(<= main_~i~0 6)} is VALID [2022-04-28 02:47:43,051 INFO L290 TraceCheckUtils]: 19: Hoare triple {3600#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3601#(<= main_~i~0 7)} is VALID [2022-04-28 02:47:43,051 INFO L290 TraceCheckUtils]: 20: Hoare triple {3601#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3601#(<= main_~i~0 7)} is VALID [2022-04-28 02:47:43,052 INFO L290 TraceCheckUtils]: 21: Hoare triple {3601#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3602#(<= main_~i~0 8)} is VALID [2022-04-28 02:47:43,052 INFO L290 TraceCheckUtils]: 22: Hoare triple {3602#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3602#(<= main_~i~0 8)} is VALID [2022-04-28 02:47:43,052 INFO L290 TraceCheckUtils]: 23: Hoare triple {3602#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3603#(<= main_~i~0 9)} is VALID [2022-04-28 02:47:43,053 INFO L290 TraceCheckUtils]: 24: Hoare triple {3603#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3603#(<= main_~i~0 9)} is VALID [2022-04-28 02:47:43,053 INFO L290 TraceCheckUtils]: 25: Hoare triple {3603#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3604#(<= main_~i~0 10)} is VALID [2022-04-28 02:47:43,053 INFO L290 TraceCheckUtils]: 26: Hoare triple {3604#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3604#(<= main_~i~0 10)} is VALID [2022-04-28 02:47:43,054 INFO L290 TraceCheckUtils]: 27: Hoare triple {3604#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3605#(<= main_~i~0 11)} is VALID [2022-04-28 02:47:43,054 INFO L290 TraceCheckUtils]: 28: Hoare triple {3605#(<= main_~i~0 11)} assume !(~i~0 < 1024); {3590#false} is VALID [2022-04-28 02:47:43,054 INFO L290 TraceCheckUtils]: 29: Hoare triple {3590#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {3590#false} is VALID [2022-04-28 02:47:43,054 INFO L272 TraceCheckUtils]: 30: Hoare triple {3590#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {3590#false} is VALID [2022-04-28 02:47:43,054 INFO L290 TraceCheckUtils]: 31: Hoare triple {3590#false} ~cond := #in~cond; {3590#false} is VALID [2022-04-28 02:47:43,054 INFO L290 TraceCheckUtils]: 32: Hoare triple {3590#false} assume 0 == ~cond; {3590#false} is VALID [2022-04-28 02:47:43,055 INFO L290 TraceCheckUtils]: 33: Hoare triple {3590#false} assume !false; {3590#false} is VALID [2022-04-28 02:47:43,055 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:47:43,055 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:47:43,413 INFO L290 TraceCheckUtils]: 33: Hoare triple {3590#false} assume !false; {3590#false} is VALID [2022-04-28 02:47:43,413 INFO L290 TraceCheckUtils]: 32: Hoare triple {3590#false} assume 0 == ~cond; {3590#false} is VALID [2022-04-28 02:47:43,413 INFO L290 TraceCheckUtils]: 31: Hoare triple {3590#false} ~cond := #in~cond; {3590#false} is VALID [2022-04-28 02:47:43,413 INFO L272 TraceCheckUtils]: 30: Hoare triple {3590#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {3590#false} is VALID [2022-04-28 02:47:43,413 INFO L290 TraceCheckUtils]: 29: Hoare triple {3590#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {3590#false} is VALID [2022-04-28 02:47:43,414 INFO L290 TraceCheckUtils]: 28: Hoare triple {3725#(< main_~i~0 1024)} assume !(~i~0 < 1024); {3590#false} is VALID [2022-04-28 02:47:43,414 INFO L290 TraceCheckUtils]: 27: Hoare triple {3729#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3725#(< main_~i~0 1024)} is VALID [2022-04-28 02:47:43,414 INFO L290 TraceCheckUtils]: 26: Hoare triple {3729#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3729#(< main_~i~0 1023)} is VALID [2022-04-28 02:47:43,415 INFO L290 TraceCheckUtils]: 25: Hoare triple {3736#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3729#(< main_~i~0 1023)} is VALID [2022-04-28 02:47:43,415 INFO L290 TraceCheckUtils]: 24: Hoare triple {3736#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3736#(< main_~i~0 1022)} is VALID [2022-04-28 02:47:43,415 INFO L290 TraceCheckUtils]: 23: Hoare triple {3743#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3736#(< main_~i~0 1022)} is VALID [2022-04-28 02:47:43,416 INFO L290 TraceCheckUtils]: 22: Hoare triple {3743#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3743#(< main_~i~0 1021)} is VALID [2022-04-28 02:47:43,416 INFO L290 TraceCheckUtils]: 21: Hoare triple {3750#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3743#(< main_~i~0 1021)} is VALID [2022-04-28 02:47:43,416 INFO L290 TraceCheckUtils]: 20: Hoare triple {3750#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3750#(< main_~i~0 1020)} is VALID [2022-04-28 02:47:43,417 INFO L290 TraceCheckUtils]: 19: Hoare triple {3757#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3750#(< main_~i~0 1020)} is VALID [2022-04-28 02:47:43,417 INFO L290 TraceCheckUtils]: 18: Hoare triple {3757#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3757#(< main_~i~0 1019)} is VALID [2022-04-28 02:47:43,417 INFO L290 TraceCheckUtils]: 17: Hoare triple {3764#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3757#(< main_~i~0 1019)} is VALID [2022-04-28 02:47:43,417 INFO L290 TraceCheckUtils]: 16: Hoare triple {3764#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3764#(< main_~i~0 1018)} is VALID [2022-04-28 02:47:43,418 INFO L290 TraceCheckUtils]: 15: Hoare triple {3771#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3764#(< main_~i~0 1018)} is VALID [2022-04-28 02:47:43,418 INFO L290 TraceCheckUtils]: 14: Hoare triple {3771#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3771#(< main_~i~0 1017)} is VALID [2022-04-28 02:47:43,418 INFO L290 TraceCheckUtils]: 13: Hoare triple {3778#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3771#(< main_~i~0 1017)} is VALID [2022-04-28 02:47:43,419 INFO L290 TraceCheckUtils]: 12: Hoare triple {3778#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3778#(< main_~i~0 1016)} is VALID [2022-04-28 02:47:43,419 INFO L290 TraceCheckUtils]: 11: Hoare triple {3785#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3778#(< main_~i~0 1016)} is VALID [2022-04-28 02:47:43,419 INFO L290 TraceCheckUtils]: 10: Hoare triple {3785#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3785#(< main_~i~0 1015)} is VALID [2022-04-28 02:47:43,420 INFO L290 TraceCheckUtils]: 9: Hoare triple {3792#(< main_~i~0 1014)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3785#(< main_~i~0 1015)} is VALID [2022-04-28 02:47:43,420 INFO L290 TraceCheckUtils]: 8: Hoare triple {3792#(< main_~i~0 1014)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3792#(< main_~i~0 1014)} is VALID [2022-04-28 02:47:43,423 INFO L290 TraceCheckUtils]: 7: Hoare triple {3799#(< main_~i~0 1013)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3792#(< main_~i~0 1014)} is VALID [2022-04-28 02:47:43,424 INFO L290 TraceCheckUtils]: 6: Hoare triple {3799#(< main_~i~0 1013)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3799#(< main_~i~0 1013)} is VALID [2022-04-28 02:47:43,424 INFO L290 TraceCheckUtils]: 5: Hoare triple {3589#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {3799#(< main_~i~0 1013)} is VALID [2022-04-28 02:47:43,424 INFO L272 TraceCheckUtils]: 4: Hoare triple {3589#true} call #t~ret6 := main(); {3589#true} is VALID [2022-04-28 02:47:43,424 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3589#true} {3589#true} #39#return; {3589#true} is VALID [2022-04-28 02:47:43,425 INFO L290 TraceCheckUtils]: 2: Hoare triple {3589#true} assume true; {3589#true} is VALID [2022-04-28 02:47:43,425 INFO L290 TraceCheckUtils]: 1: Hoare triple {3589#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {3589#true} is VALID [2022-04-28 02:47:43,425 INFO L272 TraceCheckUtils]: 0: Hoare triple {3589#true} call ULTIMATE.init(); {3589#true} is VALID [2022-04-28 02:47:43,425 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:47:43,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2077633483] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:47:43,426 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:47:43,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2022-04-28 02:47:43,426 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:47:43,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1787228966] [2022-04-28 02:47:43,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1787228966] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:47:43,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:47:43,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 02:47:43,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316025668] [2022-04-28 02:47:43,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:47:43,427 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-28 02:47:43,428 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:47:43,428 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:43,457 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:47:43,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 02:47:43,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:47:43,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 02:47:43,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=353, Invalid=403, Unknown=0, NotChecked=0, Total=756 [2022-04-28 02:47:43,459 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:43,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:47:43,728 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-04-28 02:47:43,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 02:47:43,728 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-28 02:47:43,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:47:43,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:43,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 44 transitions. [2022-04-28 02:47:43,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:43,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 44 transitions. [2022-04-28 02:47:43,730 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 44 transitions. [2022-04-28 02:47:43,765 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:47:43,766 INFO L225 Difference]: With dead ends: 44 [2022-04-28 02:47:43,766 INFO L226 Difference]: Without dead ends: 38 [2022-04-28 02:47:43,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=678, Invalid=882, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 02:47:43,767 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 32 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:47:43,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 29 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:47:43,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-28 02:47:43,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2022-04-28 02:47:43,805 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:47:43,805 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:43,805 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:43,805 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:43,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:47:43,806 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-04-28 02:47:43,806 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2022-04-28 02:47:43,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:47:43,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:47:43,806 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 38 states. [2022-04-28 02:47:43,807 INFO L87 Difference]: Start difference. First operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 38 states. [2022-04-28 02:47:43,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:47:43,807 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-04-28 02:47:43,807 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2022-04-28 02:47:43,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:47:43,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:47:43,807 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:47:43,808 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:47:43,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:43,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2022-04-28 02:47:43,808 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2022-04-28 02:47:43,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:47:43,808 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2022-04-28 02:47:43,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:43,808 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 37 transitions. [2022-04-28 02:47:43,842 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:47:43,842 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-04-28 02:47:43,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 02:47:43,842 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:47:43,842 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:47:43,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-28 02:47:44,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-28 02:47:44,043 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:47:44,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:47:44,043 INFO L85 PathProgramCache]: Analyzing trace with hash 125328018, now seen corresponding path program 23 times [2022-04-28 02:47:44,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:47:44,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [509605128] [2022-04-28 02:47:44,045 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:47:44,046 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:47:44,046 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:47:44,046 INFO L85 PathProgramCache]: Analyzing trace with hash 125328018, now seen corresponding path program 24 times [2022-04-28 02:47:44,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:47:44,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095391804] [2022-04-28 02:47:44,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:47:44,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:47:44,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:47:44,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:47:44,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:47:44,176 INFO L290 TraceCheckUtils]: 0: Hoare triple {4103#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {4085#true} is VALID [2022-04-28 02:47:44,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {4085#true} assume true; {4085#true} is VALID [2022-04-28 02:47:44,176 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4085#true} {4085#true} #39#return; {4085#true} is VALID [2022-04-28 02:47:44,177 INFO L272 TraceCheckUtils]: 0: Hoare triple {4085#true} call ULTIMATE.init(); {4103#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:47:44,177 INFO L290 TraceCheckUtils]: 1: Hoare triple {4103#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {4085#true} is VALID [2022-04-28 02:47:44,177 INFO L290 TraceCheckUtils]: 2: Hoare triple {4085#true} assume true; {4085#true} is VALID [2022-04-28 02:47:44,177 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4085#true} {4085#true} #39#return; {4085#true} is VALID [2022-04-28 02:47:44,177 INFO L272 TraceCheckUtils]: 4: Hoare triple {4085#true} call #t~ret6 := main(); {4085#true} is VALID [2022-04-28 02:47:44,177 INFO L290 TraceCheckUtils]: 5: Hoare triple {4085#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {4090#(= main_~i~0 0)} is VALID [2022-04-28 02:47:44,178 INFO L290 TraceCheckUtils]: 6: Hoare triple {4090#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4090#(= main_~i~0 0)} is VALID [2022-04-28 02:47:44,178 INFO L290 TraceCheckUtils]: 7: Hoare triple {4090#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4091#(<= main_~i~0 1)} is VALID [2022-04-28 02:47:44,178 INFO L290 TraceCheckUtils]: 8: Hoare triple {4091#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4091#(<= main_~i~0 1)} is VALID [2022-04-28 02:47:44,179 INFO L290 TraceCheckUtils]: 9: Hoare triple {4091#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4092#(<= main_~i~0 2)} is VALID [2022-04-28 02:47:44,179 INFO L290 TraceCheckUtils]: 10: Hoare triple {4092#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4092#(<= main_~i~0 2)} is VALID [2022-04-28 02:47:44,179 INFO L290 TraceCheckUtils]: 11: Hoare triple {4092#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4093#(<= main_~i~0 3)} is VALID [2022-04-28 02:47:44,180 INFO L290 TraceCheckUtils]: 12: Hoare triple {4093#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4093#(<= main_~i~0 3)} is VALID [2022-04-28 02:47:44,180 INFO L290 TraceCheckUtils]: 13: Hoare triple {4093#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4094#(<= main_~i~0 4)} is VALID [2022-04-28 02:47:44,180 INFO L290 TraceCheckUtils]: 14: Hoare triple {4094#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4094#(<= main_~i~0 4)} is VALID [2022-04-28 02:47:44,181 INFO L290 TraceCheckUtils]: 15: Hoare triple {4094#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4095#(<= main_~i~0 5)} is VALID [2022-04-28 02:47:44,181 INFO L290 TraceCheckUtils]: 16: Hoare triple {4095#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4095#(<= main_~i~0 5)} is VALID [2022-04-28 02:47:44,193 INFO L290 TraceCheckUtils]: 17: Hoare triple {4095#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4096#(<= main_~i~0 6)} is VALID [2022-04-28 02:47:44,193 INFO L290 TraceCheckUtils]: 18: Hoare triple {4096#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4096#(<= main_~i~0 6)} is VALID [2022-04-28 02:47:44,194 INFO L290 TraceCheckUtils]: 19: Hoare triple {4096#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4097#(<= main_~i~0 7)} is VALID [2022-04-28 02:47:44,194 INFO L290 TraceCheckUtils]: 20: Hoare triple {4097#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4097#(<= main_~i~0 7)} is VALID [2022-04-28 02:47:44,195 INFO L290 TraceCheckUtils]: 21: Hoare triple {4097#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4098#(<= main_~i~0 8)} is VALID [2022-04-28 02:47:44,195 INFO L290 TraceCheckUtils]: 22: Hoare triple {4098#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4098#(<= main_~i~0 8)} is VALID [2022-04-28 02:47:44,195 INFO L290 TraceCheckUtils]: 23: Hoare triple {4098#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4099#(<= main_~i~0 9)} is VALID [2022-04-28 02:47:44,196 INFO L290 TraceCheckUtils]: 24: Hoare triple {4099#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4099#(<= main_~i~0 9)} is VALID [2022-04-28 02:47:44,196 INFO L290 TraceCheckUtils]: 25: Hoare triple {4099#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4100#(<= main_~i~0 10)} is VALID [2022-04-28 02:47:44,197 INFO L290 TraceCheckUtils]: 26: Hoare triple {4100#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4100#(<= main_~i~0 10)} is VALID [2022-04-28 02:47:44,197 INFO L290 TraceCheckUtils]: 27: Hoare triple {4100#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4101#(<= main_~i~0 11)} is VALID [2022-04-28 02:47:44,197 INFO L290 TraceCheckUtils]: 28: Hoare triple {4101#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4101#(<= main_~i~0 11)} is VALID [2022-04-28 02:47:44,198 INFO L290 TraceCheckUtils]: 29: Hoare triple {4101#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4102#(<= main_~i~0 12)} is VALID [2022-04-28 02:47:44,198 INFO L290 TraceCheckUtils]: 30: Hoare triple {4102#(<= main_~i~0 12)} assume !(~i~0 < 1024); {4086#false} is VALID [2022-04-28 02:47:44,198 INFO L290 TraceCheckUtils]: 31: Hoare triple {4086#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {4086#false} is VALID [2022-04-28 02:47:44,198 INFO L272 TraceCheckUtils]: 32: Hoare triple {4086#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {4086#false} is VALID [2022-04-28 02:47:44,199 INFO L290 TraceCheckUtils]: 33: Hoare triple {4086#false} ~cond := #in~cond; {4086#false} is VALID [2022-04-28 02:47:44,199 INFO L290 TraceCheckUtils]: 34: Hoare triple {4086#false} assume 0 == ~cond; {4086#false} is VALID [2022-04-28 02:47:44,199 INFO L290 TraceCheckUtils]: 35: Hoare triple {4086#false} assume !false; {4086#false} is VALID [2022-04-28 02:47:44,199 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:47:44,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:47:44,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095391804] [2022-04-28 02:47:44,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095391804] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:47:44,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768258666] [2022-04-28 02:47:44,199 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 02:47:44,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:47:44,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:47:44,204 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:47:44,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-28 02:47:44,349 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-04-28 02:47:44,350 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:47:44,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 02:47:44,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:47:44,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:47:44,577 INFO L272 TraceCheckUtils]: 0: Hoare triple {4085#true} call ULTIMATE.init(); {4085#true} is VALID [2022-04-28 02:47:44,577 INFO L290 TraceCheckUtils]: 1: Hoare triple {4085#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {4085#true} is VALID [2022-04-28 02:47:44,577 INFO L290 TraceCheckUtils]: 2: Hoare triple {4085#true} assume true; {4085#true} is VALID [2022-04-28 02:47:44,577 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4085#true} {4085#true} #39#return; {4085#true} is VALID [2022-04-28 02:47:44,577 INFO L272 TraceCheckUtils]: 4: Hoare triple {4085#true} call #t~ret6 := main(); {4085#true} is VALID [2022-04-28 02:47:44,578 INFO L290 TraceCheckUtils]: 5: Hoare triple {4085#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {4122#(<= main_~i~0 0)} is VALID [2022-04-28 02:47:44,578 INFO L290 TraceCheckUtils]: 6: Hoare triple {4122#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4122#(<= main_~i~0 0)} is VALID [2022-04-28 02:47:44,578 INFO L290 TraceCheckUtils]: 7: Hoare triple {4122#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4091#(<= main_~i~0 1)} is VALID [2022-04-28 02:47:44,579 INFO L290 TraceCheckUtils]: 8: Hoare triple {4091#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4091#(<= main_~i~0 1)} is VALID [2022-04-28 02:47:44,579 INFO L290 TraceCheckUtils]: 9: Hoare triple {4091#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4092#(<= main_~i~0 2)} is VALID [2022-04-28 02:47:44,579 INFO L290 TraceCheckUtils]: 10: Hoare triple {4092#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4092#(<= main_~i~0 2)} is VALID [2022-04-28 02:47:44,580 INFO L290 TraceCheckUtils]: 11: Hoare triple {4092#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4093#(<= main_~i~0 3)} is VALID [2022-04-28 02:47:44,580 INFO L290 TraceCheckUtils]: 12: Hoare triple {4093#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4093#(<= main_~i~0 3)} is VALID [2022-04-28 02:47:44,580 INFO L290 TraceCheckUtils]: 13: Hoare triple {4093#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4094#(<= main_~i~0 4)} is VALID [2022-04-28 02:47:44,581 INFO L290 TraceCheckUtils]: 14: Hoare triple {4094#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4094#(<= main_~i~0 4)} is VALID [2022-04-28 02:47:44,581 INFO L290 TraceCheckUtils]: 15: Hoare triple {4094#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4095#(<= main_~i~0 5)} is VALID [2022-04-28 02:47:44,582 INFO L290 TraceCheckUtils]: 16: Hoare triple {4095#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4095#(<= main_~i~0 5)} is VALID [2022-04-28 02:47:44,582 INFO L290 TraceCheckUtils]: 17: Hoare triple {4095#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4096#(<= main_~i~0 6)} is VALID [2022-04-28 02:47:44,582 INFO L290 TraceCheckUtils]: 18: Hoare triple {4096#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4096#(<= main_~i~0 6)} is VALID [2022-04-28 02:47:44,583 INFO L290 TraceCheckUtils]: 19: Hoare triple {4096#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4097#(<= main_~i~0 7)} is VALID [2022-04-28 02:47:44,583 INFO L290 TraceCheckUtils]: 20: Hoare triple {4097#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4097#(<= main_~i~0 7)} is VALID [2022-04-28 02:47:44,583 INFO L290 TraceCheckUtils]: 21: Hoare triple {4097#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4098#(<= main_~i~0 8)} is VALID [2022-04-28 02:47:44,584 INFO L290 TraceCheckUtils]: 22: Hoare triple {4098#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4098#(<= main_~i~0 8)} is VALID [2022-04-28 02:47:44,584 INFO L290 TraceCheckUtils]: 23: Hoare triple {4098#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4099#(<= main_~i~0 9)} is VALID [2022-04-28 02:47:44,584 INFO L290 TraceCheckUtils]: 24: Hoare triple {4099#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4099#(<= main_~i~0 9)} is VALID [2022-04-28 02:47:44,585 INFO L290 TraceCheckUtils]: 25: Hoare triple {4099#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4100#(<= main_~i~0 10)} is VALID [2022-04-28 02:47:44,585 INFO L290 TraceCheckUtils]: 26: Hoare triple {4100#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4100#(<= main_~i~0 10)} is VALID [2022-04-28 02:47:44,585 INFO L290 TraceCheckUtils]: 27: Hoare triple {4100#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4101#(<= main_~i~0 11)} is VALID [2022-04-28 02:47:44,586 INFO L290 TraceCheckUtils]: 28: Hoare triple {4101#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4101#(<= main_~i~0 11)} is VALID [2022-04-28 02:47:44,586 INFO L290 TraceCheckUtils]: 29: Hoare triple {4101#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4102#(<= main_~i~0 12)} is VALID [2022-04-28 02:47:44,586 INFO L290 TraceCheckUtils]: 30: Hoare triple {4102#(<= main_~i~0 12)} assume !(~i~0 < 1024); {4086#false} is VALID [2022-04-28 02:47:44,586 INFO L290 TraceCheckUtils]: 31: Hoare triple {4086#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {4086#false} is VALID [2022-04-28 02:47:44,586 INFO L272 TraceCheckUtils]: 32: Hoare triple {4086#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {4086#false} is VALID [2022-04-28 02:47:44,586 INFO L290 TraceCheckUtils]: 33: Hoare triple {4086#false} ~cond := #in~cond; {4086#false} is VALID [2022-04-28 02:47:44,587 INFO L290 TraceCheckUtils]: 34: Hoare triple {4086#false} assume 0 == ~cond; {4086#false} is VALID [2022-04-28 02:47:44,587 INFO L290 TraceCheckUtils]: 35: Hoare triple {4086#false} assume !false; {4086#false} is VALID [2022-04-28 02:47:44,587 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:47:44,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:47:44,973 INFO L290 TraceCheckUtils]: 35: Hoare triple {4086#false} assume !false; {4086#false} is VALID [2022-04-28 02:47:44,973 INFO L290 TraceCheckUtils]: 34: Hoare triple {4086#false} assume 0 == ~cond; {4086#false} is VALID [2022-04-28 02:47:44,973 INFO L290 TraceCheckUtils]: 33: Hoare triple {4086#false} ~cond := #in~cond; {4086#false} is VALID [2022-04-28 02:47:44,974 INFO L272 TraceCheckUtils]: 32: Hoare triple {4086#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {4086#false} is VALID [2022-04-28 02:47:44,974 INFO L290 TraceCheckUtils]: 31: Hoare triple {4086#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {4086#false} is VALID [2022-04-28 02:47:44,974 INFO L290 TraceCheckUtils]: 30: Hoare triple {4228#(< main_~i~0 1024)} assume !(~i~0 < 1024); {4086#false} is VALID [2022-04-28 02:47:44,975 INFO L290 TraceCheckUtils]: 29: Hoare triple {4232#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4228#(< main_~i~0 1024)} is VALID [2022-04-28 02:47:44,975 INFO L290 TraceCheckUtils]: 28: Hoare triple {4232#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4232#(< main_~i~0 1023)} is VALID [2022-04-28 02:47:44,976 INFO L290 TraceCheckUtils]: 27: Hoare triple {4239#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4232#(< main_~i~0 1023)} is VALID [2022-04-28 02:47:44,976 INFO L290 TraceCheckUtils]: 26: Hoare triple {4239#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4239#(< main_~i~0 1022)} is VALID [2022-04-28 02:47:44,976 INFO L290 TraceCheckUtils]: 25: Hoare triple {4246#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4239#(< main_~i~0 1022)} is VALID [2022-04-28 02:47:44,977 INFO L290 TraceCheckUtils]: 24: Hoare triple {4246#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4246#(< main_~i~0 1021)} is VALID [2022-04-28 02:47:44,978 INFO L290 TraceCheckUtils]: 23: Hoare triple {4253#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4246#(< main_~i~0 1021)} is VALID [2022-04-28 02:47:44,978 INFO L290 TraceCheckUtils]: 22: Hoare triple {4253#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4253#(< main_~i~0 1020)} is VALID [2022-04-28 02:47:44,978 INFO L290 TraceCheckUtils]: 21: Hoare triple {4260#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4253#(< main_~i~0 1020)} is VALID [2022-04-28 02:47:44,979 INFO L290 TraceCheckUtils]: 20: Hoare triple {4260#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4260#(< main_~i~0 1019)} is VALID [2022-04-28 02:47:44,979 INFO L290 TraceCheckUtils]: 19: Hoare triple {4267#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4260#(< main_~i~0 1019)} is VALID [2022-04-28 02:47:44,980 INFO L290 TraceCheckUtils]: 18: Hoare triple {4267#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4267#(< main_~i~0 1018)} is VALID [2022-04-28 02:47:44,980 INFO L290 TraceCheckUtils]: 17: Hoare triple {4274#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4267#(< main_~i~0 1018)} is VALID [2022-04-28 02:47:44,980 INFO L290 TraceCheckUtils]: 16: Hoare triple {4274#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4274#(< main_~i~0 1017)} is VALID [2022-04-28 02:47:44,981 INFO L290 TraceCheckUtils]: 15: Hoare triple {4281#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4274#(< main_~i~0 1017)} is VALID [2022-04-28 02:47:44,981 INFO L290 TraceCheckUtils]: 14: Hoare triple {4281#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4281#(< main_~i~0 1016)} is VALID [2022-04-28 02:47:44,982 INFO L290 TraceCheckUtils]: 13: Hoare triple {4288#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4281#(< main_~i~0 1016)} is VALID [2022-04-28 02:47:44,982 INFO L290 TraceCheckUtils]: 12: Hoare triple {4288#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4288#(< main_~i~0 1015)} is VALID [2022-04-28 02:47:44,983 INFO L290 TraceCheckUtils]: 11: Hoare triple {4295#(< main_~i~0 1014)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4288#(< main_~i~0 1015)} is VALID [2022-04-28 02:47:44,983 INFO L290 TraceCheckUtils]: 10: Hoare triple {4295#(< main_~i~0 1014)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4295#(< main_~i~0 1014)} is VALID [2022-04-28 02:47:44,983 INFO L290 TraceCheckUtils]: 9: Hoare triple {4302#(< main_~i~0 1013)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4295#(< main_~i~0 1014)} is VALID [2022-04-28 02:47:44,984 INFO L290 TraceCheckUtils]: 8: Hoare triple {4302#(< main_~i~0 1013)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4302#(< main_~i~0 1013)} is VALID [2022-04-28 02:47:44,984 INFO L290 TraceCheckUtils]: 7: Hoare triple {4309#(< main_~i~0 1012)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4302#(< main_~i~0 1013)} is VALID [2022-04-28 02:47:44,985 INFO L290 TraceCheckUtils]: 6: Hoare triple {4309#(< main_~i~0 1012)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4309#(< main_~i~0 1012)} is VALID [2022-04-28 02:47:44,985 INFO L290 TraceCheckUtils]: 5: Hoare triple {4085#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {4309#(< main_~i~0 1012)} is VALID [2022-04-28 02:47:44,985 INFO L272 TraceCheckUtils]: 4: Hoare triple {4085#true} call #t~ret6 := main(); {4085#true} is VALID [2022-04-28 02:47:44,985 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4085#true} {4085#true} #39#return; {4085#true} is VALID [2022-04-28 02:47:44,985 INFO L290 TraceCheckUtils]: 2: Hoare triple {4085#true} assume true; {4085#true} is VALID [2022-04-28 02:47:44,985 INFO L290 TraceCheckUtils]: 1: Hoare triple {4085#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {4085#true} is VALID [2022-04-28 02:47:44,986 INFO L272 TraceCheckUtils]: 0: Hoare triple {4085#true} call ULTIMATE.init(); {4085#true} is VALID [2022-04-28 02:47:44,986 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:47:44,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1768258666] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:47:44,986 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:47:44,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 30 [2022-04-28 02:47:44,986 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:47:44,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [509605128] [2022-04-28 02:47:44,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [509605128] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:47:44,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:47:44,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 02:47:44,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114213789] [2022-04-28 02:47:44,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:47:44,988 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-04-28 02:47:44,988 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:47:44,988 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:45,016 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:47:45,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 02:47:45,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:47:45,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 02:47:45,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=408, Invalid=462, Unknown=0, NotChecked=0, Total=870 [2022-04-28 02:47:45,017 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:45,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:47:45,331 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2022-04-28 02:47:45,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 02:47:45,331 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-04-28 02:47:45,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:47:45,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:45,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 46 transitions. [2022-04-28 02:47:45,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:45,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 46 transitions. [2022-04-28 02:47:45,333 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 46 transitions. [2022-04-28 02:47:45,368 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:47:45,369 INFO L225 Difference]: With dead ends: 46 [2022-04-28 02:47:45,369 INFO L226 Difference]: Without dead ends: 40 [2022-04-28 02:47:45,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=786, Invalid=1020, Unknown=0, NotChecked=0, Total=1806 [2022-04-28 02:47:45,370 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 34 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:47:45,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 39 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:47:45,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-28 02:47:45,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2022-04-28 02:47:45,413 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:47:45,413 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:45,413 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:45,413 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:45,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:47:45,414 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-04-28 02:47:45,414 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2022-04-28 02:47:45,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:47:45,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:47:45,414 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 40 states. [2022-04-28 02:47:45,414 INFO L87 Difference]: Start difference. First operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 40 states. [2022-04-28 02:47:45,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:47:45,419 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-04-28 02:47:45,419 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2022-04-28 02:47:45,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:47:45,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:47:45,419 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:47:45,419 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:47:45,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:45,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2022-04-28 02:47:45,420 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 36 [2022-04-28 02:47:45,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:47:45,420 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2022-04-28 02:47:45,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:45,421 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 39 transitions. [2022-04-28 02:47:45,470 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:47:45,471 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2022-04-28 02:47:45,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-28 02:47:45,471 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:47:45,471 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:47:45,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-04-28 02:47:45,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-28 02:47:45,672 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:47:45,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:47:45,672 INFO L85 PathProgramCache]: Analyzing trace with hash -692946540, now seen corresponding path program 25 times [2022-04-28 02:47:45,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:47:45,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [755019457] [2022-04-28 02:47:45,674 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:47:45,674 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:47:45,674 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:47:45,674 INFO L85 PathProgramCache]: Analyzing trace with hash -692946540, now seen corresponding path program 26 times [2022-04-28 02:47:45,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:47:45,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495957479] [2022-04-28 02:47:45,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:47:45,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:47:45,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:47:45,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:47:45,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:47:45,856 INFO L290 TraceCheckUtils]: 0: Hoare triple {4628#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {4609#true} is VALID [2022-04-28 02:47:45,856 INFO L290 TraceCheckUtils]: 1: Hoare triple {4609#true} assume true; {4609#true} is VALID [2022-04-28 02:47:45,856 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4609#true} {4609#true} #39#return; {4609#true} is VALID [2022-04-28 02:47:45,856 INFO L272 TraceCheckUtils]: 0: Hoare triple {4609#true} call ULTIMATE.init(); {4628#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:47:45,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {4628#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {4609#true} is VALID [2022-04-28 02:47:45,857 INFO L290 TraceCheckUtils]: 2: Hoare triple {4609#true} assume true; {4609#true} is VALID [2022-04-28 02:47:45,857 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4609#true} {4609#true} #39#return; {4609#true} is VALID [2022-04-28 02:47:45,857 INFO L272 TraceCheckUtils]: 4: Hoare triple {4609#true} call #t~ret6 := main(); {4609#true} is VALID [2022-04-28 02:47:45,857 INFO L290 TraceCheckUtils]: 5: Hoare triple {4609#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {4614#(= main_~i~0 0)} is VALID [2022-04-28 02:47:45,857 INFO L290 TraceCheckUtils]: 6: Hoare triple {4614#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4614#(= main_~i~0 0)} is VALID [2022-04-28 02:47:45,858 INFO L290 TraceCheckUtils]: 7: Hoare triple {4614#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4615#(<= main_~i~0 1)} is VALID [2022-04-28 02:47:45,858 INFO L290 TraceCheckUtils]: 8: Hoare triple {4615#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4615#(<= main_~i~0 1)} is VALID [2022-04-28 02:47:45,859 INFO L290 TraceCheckUtils]: 9: Hoare triple {4615#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4616#(<= main_~i~0 2)} is VALID [2022-04-28 02:47:45,859 INFO L290 TraceCheckUtils]: 10: Hoare triple {4616#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4616#(<= main_~i~0 2)} is VALID [2022-04-28 02:47:45,859 INFO L290 TraceCheckUtils]: 11: Hoare triple {4616#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4617#(<= main_~i~0 3)} is VALID [2022-04-28 02:47:45,860 INFO L290 TraceCheckUtils]: 12: Hoare triple {4617#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4617#(<= main_~i~0 3)} is VALID [2022-04-28 02:47:45,860 INFO L290 TraceCheckUtils]: 13: Hoare triple {4617#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4618#(<= main_~i~0 4)} is VALID [2022-04-28 02:47:45,861 INFO L290 TraceCheckUtils]: 14: Hoare triple {4618#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4618#(<= main_~i~0 4)} is VALID [2022-04-28 02:47:45,861 INFO L290 TraceCheckUtils]: 15: Hoare triple {4618#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4619#(<= main_~i~0 5)} is VALID [2022-04-28 02:47:45,861 INFO L290 TraceCheckUtils]: 16: Hoare triple {4619#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4619#(<= main_~i~0 5)} is VALID [2022-04-28 02:47:45,862 INFO L290 TraceCheckUtils]: 17: Hoare triple {4619#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4620#(<= main_~i~0 6)} is VALID [2022-04-28 02:47:45,862 INFO L290 TraceCheckUtils]: 18: Hoare triple {4620#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4620#(<= main_~i~0 6)} is VALID [2022-04-28 02:47:45,862 INFO L290 TraceCheckUtils]: 19: Hoare triple {4620#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4621#(<= main_~i~0 7)} is VALID [2022-04-28 02:47:45,863 INFO L290 TraceCheckUtils]: 20: Hoare triple {4621#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4621#(<= main_~i~0 7)} is VALID [2022-04-28 02:47:45,863 INFO L290 TraceCheckUtils]: 21: Hoare triple {4621#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4622#(<= main_~i~0 8)} is VALID [2022-04-28 02:47:45,863 INFO L290 TraceCheckUtils]: 22: Hoare triple {4622#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4622#(<= main_~i~0 8)} is VALID [2022-04-28 02:47:45,864 INFO L290 TraceCheckUtils]: 23: Hoare triple {4622#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4623#(<= main_~i~0 9)} is VALID [2022-04-28 02:47:45,864 INFO L290 TraceCheckUtils]: 24: Hoare triple {4623#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4623#(<= main_~i~0 9)} is VALID [2022-04-28 02:47:45,864 INFO L290 TraceCheckUtils]: 25: Hoare triple {4623#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4624#(<= main_~i~0 10)} is VALID [2022-04-28 02:47:45,865 INFO L290 TraceCheckUtils]: 26: Hoare triple {4624#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4624#(<= main_~i~0 10)} is VALID [2022-04-28 02:47:45,865 INFO L290 TraceCheckUtils]: 27: Hoare triple {4624#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4625#(<= main_~i~0 11)} is VALID [2022-04-28 02:47:45,865 INFO L290 TraceCheckUtils]: 28: Hoare triple {4625#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4625#(<= main_~i~0 11)} is VALID [2022-04-28 02:47:45,865 INFO L290 TraceCheckUtils]: 29: Hoare triple {4625#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4626#(<= main_~i~0 12)} is VALID [2022-04-28 02:47:45,866 INFO L290 TraceCheckUtils]: 30: Hoare triple {4626#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4626#(<= main_~i~0 12)} is VALID [2022-04-28 02:47:45,866 INFO L290 TraceCheckUtils]: 31: Hoare triple {4626#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4627#(<= main_~i~0 13)} is VALID [2022-04-28 02:47:45,867 INFO L290 TraceCheckUtils]: 32: Hoare triple {4627#(<= main_~i~0 13)} assume !(~i~0 < 1024); {4610#false} is VALID [2022-04-28 02:47:45,867 INFO L290 TraceCheckUtils]: 33: Hoare triple {4610#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {4610#false} is VALID [2022-04-28 02:47:45,867 INFO L272 TraceCheckUtils]: 34: Hoare triple {4610#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {4610#false} is VALID [2022-04-28 02:47:45,867 INFO L290 TraceCheckUtils]: 35: Hoare triple {4610#false} ~cond := #in~cond; {4610#false} is VALID [2022-04-28 02:47:45,867 INFO L290 TraceCheckUtils]: 36: Hoare triple {4610#false} assume 0 == ~cond; {4610#false} is VALID [2022-04-28 02:47:45,867 INFO L290 TraceCheckUtils]: 37: Hoare triple {4610#false} assume !false; {4610#false} is VALID [2022-04-28 02:47:45,868 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:47:45,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:47:45,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495957479] [2022-04-28 02:47:45,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495957479] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:47:45,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [336337112] [2022-04-28 02:47:45,868 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:47:45,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:47:45,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:47:45,869 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:47:45,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-28 02:47:45,926 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:47:45,926 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:47:45,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 02:47:45,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:47:45,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:47:46,132 INFO L272 TraceCheckUtils]: 0: Hoare triple {4609#true} call ULTIMATE.init(); {4609#true} is VALID [2022-04-28 02:47:46,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {4609#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {4609#true} is VALID [2022-04-28 02:47:46,132 INFO L290 TraceCheckUtils]: 2: Hoare triple {4609#true} assume true; {4609#true} is VALID [2022-04-28 02:47:46,133 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4609#true} {4609#true} #39#return; {4609#true} is VALID [2022-04-28 02:47:46,133 INFO L272 TraceCheckUtils]: 4: Hoare triple {4609#true} call #t~ret6 := main(); {4609#true} is VALID [2022-04-28 02:47:46,133 INFO L290 TraceCheckUtils]: 5: Hoare triple {4609#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {4647#(<= main_~i~0 0)} is VALID [2022-04-28 02:47:46,133 INFO L290 TraceCheckUtils]: 6: Hoare triple {4647#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4647#(<= main_~i~0 0)} is VALID [2022-04-28 02:47:46,134 INFO L290 TraceCheckUtils]: 7: Hoare triple {4647#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4615#(<= main_~i~0 1)} is VALID [2022-04-28 02:47:46,134 INFO L290 TraceCheckUtils]: 8: Hoare triple {4615#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4615#(<= main_~i~0 1)} is VALID [2022-04-28 02:47:46,134 INFO L290 TraceCheckUtils]: 9: Hoare triple {4615#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4616#(<= main_~i~0 2)} is VALID [2022-04-28 02:47:46,135 INFO L290 TraceCheckUtils]: 10: Hoare triple {4616#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4616#(<= main_~i~0 2)} is VALID [2022-04-28 02:47:46,135 INFO L290 TraceCheckUtils]: 11: Hoare triple {4616#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4617#(<= main_~i~0 3)} is VALID [2022-04-28 02:47:46,135 INFO L290 TraceCheckUtils]: 12: Hoare triple {4617#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4617#(<= main_~i~0 3)} is VALID [2022-04-28 02:47:46,136 INFO L290 TraceCheckUtils]: 13: Hoare triple {4617#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4618#(<= main_~i~0 4)} is VALID [2022-04-28 02:47:46,136 INFO L290 TraceCheckUtils]: 14: Hoare triple {4618#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4618#(<= main_~i~0 4)} is VALID [2022-04-28 02:47:46,136 INFO L290 TraceCheckUtils]: 15: Hoare triple {4618#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4619#(<= main_~i~0 5)} is VALID [2022-04-28 02:47:46,137 INFO L290 TraceCheckUtils]: 16: Hoare triple {4619#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4619#(<= main_~i~0 5)} is VALID [2022-04-28 02:47:46,137 INFO L290 TraceCheckUtils]: 17: Hoare triple {4619#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4620#(<= main_~i~0 6)} is VALID [2022-04-28 02:47:46,137 INFO L290 TraceCheckUtils]: 18: Hoare triple {4620#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4620#(<= main_~i~0 6)} is VALID [2022-04-28 02:47:46,138 INFO L290 TraceCheckUtils]: 19: Hoare triple {4620#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4621#(<= main_~i~0 7)} is VALID [2022-04-28 02:47:46,138 INFO L290 TraceCheckUtils]: 20: Hoare triple {4621#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4621#(<= main_~i~0 7)} is VALID [2022-04-28 02:47:46,138 INFO L290 TraceCheckUtils]: 21: Hoare triple {4621#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4622#(<= main_~i~0 8)} is VALID [2022-04-28 02:47:46,138 INFO L290 TraceCheckUtils]: 22: Hoare triple {4622#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4622#(<= main_~i~0 8)} is VALID [2022-04-28 02:47:46,139 INFO L290 TraceCheckUtils]: 23: Hoare triple {4622#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4623#(<= main_~i~0 9)} is VALID [2022-04-28 02:47:46,139 INFO L290 TraceCheckUtils]: 24: Hoare triple {4623#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4623#(<= main_~i~0 9)} is VALID [2022-04-28 02:47:46,139 INFO L290 TraceCheckUtils]: 25: Hoare triple {4623#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4624#(<= main_~i~0 10)} is VALID [2022-04-28 02:47:46,140 INFO L290 TraceCheckUtils]: 26: Hoare triple {4624#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4624#(<= main_~i~0 10)} is VALID [2022-04-28 02:47:46,140 INFO L290 TraceCheckUtils]: 27: Hoare triple {4624#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4625#(<= main_~i~0 11)} is VALID [2022-04-28 02:47:46,140 INFO L290 TraceCheckUtils]: 28: Hoare triple {4625#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4625#(<= main_~i~0 11)} is VALID [2022-04-28 02:47:46,141 INFO L290 TraceCheckUtils]: 29: Hoare triple {4625#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4626#(<= main_~i~0 12)} is VALID [2022-04-28 02:47:46,141 INFO L290 TraceCheckUtils]: 30: Hoare triple {4626#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4626#(<= main_~i~0 12)} is VALID [2022-04-28 02:47:46,141 INFO L290 TraceCheckUtils]: 31: Hoare triple {4626#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4627#(<= main_~i~0 13)} is VALID [2022-04-28 02:47:46,142 INFO L290 TraceCheckUtils]: 32: Hoare triple {4627#(<= main_~i~0 13)} assume !(~i~0 < 1024); {4610#false} is VALID [2022-04-28 02:47:46,142 INFO L290 TraceCheckUtils]: 33: Hoare triple {4610#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {4610#false} is VALID [2022-04-28 02:47:46,142 INFO L272 TraceCheckUtils]: 34: Hoare triple {4610#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {4610#false} is VALID [2022-04-28 02:47:46,142 INFO L290 TraceCheckUtils]: 35: Hoare triple {4610#false} ~cond := #in~cond; {4610#false} is VALID [2022-04-28 02:47:46,142 INFO L290 TraceCheckUtils]: 36: Hoare triple {4610#false} assume 0 == ~cond; {4610#false} is VALID [2022-04-28 02:47:46,142 INFO L290 TraceCheckUtils]: 37: Hoare triple {4610#false} assume !false; {4610#false} is VALID [2022-04-28 02:47:46,142 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:47:46,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:47:46,586 INFO L290 TraceCheckUtils]: 37: Hoare triple {4610#false} assume !false; {4610#false} is VALID [2022-04-28 02:47:46,586 INFO L290 TraceCheckUtils]: 36: Hoare triple {4610#false} assume 0 == ~cond; {4610#false} is VALID [2022-04-28 02:47:46,586 INFO L290 TraceCheckUtils]: 35: Hoare triple {4610#false} ~cond := #in~cond; {4610#false} is VALID [2022-04-28 02:47:46,586 INFO L272 TraceCheckUtils]: 34: Hoare triple {4610#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {4610#false} is VALID [2022-04-28 02:47:46,587 INFO L290 TraceCheckUtils]: 33: Hoare triple {4610#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {4610#false} is VALID [2022-04-28 02:47:46,587 INFO L290 TraceCheckUtils]: 32: Hoare triple {4759#(< main_~i~0 1024)} assume !(~i~0 < 1024); {4610#false} is VALID [2022-04-28 02:47:46,587 INFO L290 TraceCheckUtils]: 31: Hoare triple {4763#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4759#(< main_~i~0 1024)} is VALID [2022-04-28 02:47:46,588 INFO L290 TraceCheckUtils]: 30: Hoare triple {4763#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4763#(< main_~i~0 1023)} is VALID [2022-04-28 02:47:46,588 INFO L290 TraceCheckUtils]: 29: Hoare triple {4770#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4763#(< main_~i~0 1023)} is VALID [2022-04-28 02:47:46,589 INFO L290 TraceCheckUtils]: 28: Hoare triple {4770#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4770#(< main_~i~0 1022)} is VALID [2022-04-28 02:47:46,589 INFO L290 TraceCheckUtils]: 27: Hoare triple {4777#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4770#(< main_~i~0 1022)} is VALID [2022-04-28 02:47:46,589 INFO L290 TraceCheckUtils]: 26: Hoare triple {4777#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4777#(< main_~i~0 1021)} is VALID [2022-04-28 02:47:46,590 INFO L290 TraceCheckUtils]: 25: Hoare triple {4784#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4777#(< main_~i~0 1021)} is VALID [2022-04-28 02:47:46,590 INFO L290 TraceCheckUtils]: 24: Hoare triple {4784#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4784#(< main_~i~0 1020)} is VALID [2022-04-28 02:47:46,591 INFO L290 TraceCheckUtils]: 23: Hoare triple {4791#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4784#(< main_~i~0 1020)} is VALID [2022-04-28 02:47:46,591 INFO L290 TraceCheckUtils]: 22: Hoare triple {4791#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4791#(< main_~i~0 1019)} is VALID [2022-04-28 02:47:46,592 INFO L290 TraceCheckUtils]: 21: Hoare triple {4798#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4791#(< main_~i~0 1019)} is VALID [2022-04-28 02:47:46,592 INFO L290 TraceCheckUtils]: 20: Hoare triple {4798#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4798#(< main_~i~0 1018)} is VALID [2022-04-28 02:47:46,592 INFO L290 TraceCheckUtils]: 19: Hoare triple {4805#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4798#(< main_~i~0 1018)} is VALID [2022-04-28 02:47:46,593 INFO L290 TraceCheckUtils]: 18: Hoare triple {4805#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4805#(< main_~i~0 1017)} is VALID [2022-04-28 02:47:46,593 INFO L290 TraceCheckUtils]: 17: Hoare triple {4812#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4805#(< main_~i~0 1017)} is VALID [2022-04-28 02:47:46,594 INFO L290 TraceCheckUtils]: 16: Hoare triple {4812#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4812#(< main_~i~0 1016)} is VALID [2022-04-28 02:47:46,594 INFO L290 TraceCheckUtils]: 15: Hoare triple {4819#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4812#(< main_~i~0 1016)} is VALID [2022-04-28 02:47:46,594 INFO L290 TraceCheckUtils]: 14: Hoare triple {4819#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4819#(< main_~i~0 1015)} is VALID [2022-04-28 02:47:46,595 INFO L290 TraceCheckUtils]: 13: Hoare triple {4826#(< main_~i~0 1014)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4819#(< main_~i~0 1015)} is VALID [2022-04-28 02:47:46,595 INFO L290 TraceCheckUtils]: 12: Hoare triple {4826#(< main_~i~0 1014)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4826#(< main_~i~0 1014)} is VALID [2022-04-28 02:47:46,596 INFO L290 TraceCheckUtils]: 11: Hoare triple {4833#(< main_~i~0 1013)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4826#(< main_~i~0 1014)} is VALID [2022-04-28 02:47:46,596 INFO L290 TraceCheckUtils]: 10: Hoare triple {4833#(< main_~i~0 1013)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4833#(< main_~i~0 1013)} is VALID [2022-04-28 02:47:46,597 INFO L290 TraceCheckUtils]: 9: Hoare triple {4840#(< main_~i~0 1012)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4833#(< main_~i~0 1013)} is VALID [2022-04-28 02:47:46,597 INFO L290 TraceCheckUtils]: 8: Hoare triple {4840#(< main_~i~0 1012)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4840#(< main_~i~0 1012)} is VALID [2022-04-28 02:47:46,598 INFO L290 TraceCheckUtils]: 7: Hoare triple {4847#(< main_~i~0 1011)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4840#(< main_~i~0 1012)} is VALID [2022-04-28 02:47:46,598 INFO L290 TraceCheckUtils]: 6: Hoare triple {4847#(< main_~i~0 1011)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4847#(< main_~i~0 1011)} is VALID [2022-04-28 02:47:46,598 INFO L290 TraceCheckUtils]: 5: Hoare triple {4609#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {4847#(< main_~i~0 1011)} is VALID [2022-04-28 02:47:46,598 INFO L272 TraceCheckUtils]: 4: Hoare triple {4609#true} call #t~ret6 := main(); {4609#true} is VALID [2022-04-28 02:47:46,599 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4609#true} {4609#true} #39#return; {4609#true} is VALID [2022-04-28 02:47:46,599 INFO L290 TraceCheckUtils]: 2: Hoare triple {4609#true} assume true; {4609#true} is VALID [2022-04-28 02:47:46,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {4609#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {4609#true} is VALID [2022-04-28 02:47:46,599 INFO L272 TraceCheckUtils]: 0: Hoare triple {4609#true} call ULTIMATE.init(); {4609#true} is VALID [2022-04-28 02:47:46,599 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:47:46,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [336337112] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:47:46,599 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:47:46,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32 [2022-04-28 02:47:46,600 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:47:46,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [755019457] [2022-04-28 02:47:46,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [755019457] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:47:46,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:47:46,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 02:47:46,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7936890] [2022-04-28 02:47:46,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:47:46,600 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-28 02:47:46,601 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:47:46,601 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:46,627 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:47:46,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 02:47:46,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:47:46,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 02:47:46,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=467, Invalid=525, Unknown=0, NotChecked=0, Total=992 [2022-04-28 02:47:46,628 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:46,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:47:46,910 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2022-04-28 02:47:46,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 02:47:46,910 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-28 02:47:46,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:47:46,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:46,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 48 transitions. [2022-04-28 02:47:46,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:46,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 48 transitions. [2022-04-28 02:47:46,912 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 48 transitions. [2022-04-28 02:47:46,951 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:47:46,952 INFO L225 Difference]: With dead ends: 48 [2022-04-28 02:47:46,952 INFO L226 Difference]: Without dead ends: 42 [2022-04-28 02:47:46,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 63 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-28 02:47:46,954 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 36 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:47:46,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 34 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:47:46,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-28 02:47:47,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2022-04-28 02:47:47,027 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:47:47,028 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:47,028 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:47,028 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:47,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:47:47,029 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2022-04-28 02:47:47,029 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2022-04-28 02:47:47,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:47:47,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:47:47,029 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 42 states. [2022-04-28 02:47:47,029 INFO L87 Difference]: Start difference. First operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 42 states. [2022-04-28 02:47:47,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:47:47,030 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2022-04-28 02:47:47,030 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2022-04-28 02:47:47,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:47:47,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:47:47,031 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:47:47,031 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:47:47,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:47,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2022-04-28 02:47:47,032 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 38 [2022-04-28 02:47:47,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:47:47,032 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2022-04-28 02:47:47,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:47,032 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 41 transitions. [2022-04-28 02:47:47,068 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:47:47,068 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-04-28 02:47:47,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-28 02:47:47,069 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:47:47,069 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:47:47,085 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-28 02:47:47,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-28 02:47:47,275 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:47:47,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:47:47,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1075781610, now seen corresponding path program 27 times [2022-04-28 02:47:47,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:47:47,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1521219607] [2022-04-28 02:47:47,279 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:47:47,279 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:47:47,279 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:47:47,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1075781610, now seen corresponding path program 28 times [2022-04-28 02:47:47,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:47:47,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783688555] [2022-04-28 02:47:47,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:47:47,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:47:47,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:47:47,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:47:47,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:47:47,454 INFO L290 TraceCheckUtils]: 0: Hoare triple {5181#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {5161#true} is VALID [2022-04-28 02:47:47,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {5161#true} assume true; {5161#true} is VALID [2022-04-28 02:47:47,454 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5161#true} {5161#true} #39#return; {5161#true} is VALID [2022-04-28 02:47:47,454 INFO L272 TraceCheckUtils]: 0: Hoare triple {5161#true} call ULTIMATE.init(); {5181#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:47:47,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {5181#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {5161#true} is VALID [2022-04-28 02:47:47,454 INFO L290 TraceCheckUtils]: 2: Hoare triple {5161#true} assume true; {5161#true} is VALID [2022-04-28 02:47:47,454 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5161#true} {5161#true} #39#return; {5161#true} is VALID [2022-04-28 02:47:47,454 INFO L272 TraceCheckUtils]: 4: Hoare triple {5161#true} call #t~ret6 := main(); {5161#true} is VALID [2022-04-28 02:47:47,458 INFO L290 TraceCheckUtils]: 5: Hoare triple {5161#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {5166#(= main_~i~0 0)} is VALID [2022-04-28 02:47:47,458 INFO L290 TraceCheckUtils]: 6: Hoare triple {5166#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5166#(= main_~i~0 0)} is VALID [2022-04-28 02:47:47,459 INFO L290 TraceCheckUtils]: 7: Hoare triple {5166#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5167#(<= main_~i~0 1)} is VALID [2022-04-28 02:47:47,459 INFO L290 TraceCheckUtils]: 8: Hoare triple {5167#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5167#(<= main_~i~0 1)} is VALID [2022-04-28 02:47:47,459 INFO L290 TraceCheckUtils]: 9: Hoare triple {5167#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5168#(<= main_~i~0 2)} is VALID [2022-04-28 02:47:47,460 INFO L290 TraceCheckUtils]: 10: Hoare triple {5168#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5168#(<= main_~i~0 2)} is VALID [2022-04-28 02:47:47,460 INFO L290 TraceCheckUtils]: 11: Hoare triple {5168#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5169#(<= main_~i~0 3)} is VALID [2022-04-28 02:47:47,460 INFO L290 TraceCheckUtils]: 12: Hoare triple {5169#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5169#(<= main_~i~0 3)} is VALID [2022-04-28 02:47:47,461 INFO L290 TraceCheckUtils]: 13: Hoare triple {5169#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5170#(<= main_~i~0 4)} is VALID [2022-04-28 02:47:47,461 INFO L290 TraceCheckUtils]: 14: Hoare triple {5170#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5170#(<= main_~i~0 4)} is VALID [2022-04-28 02:47:47,461 INFO L290 TraceCheckUtils]: 15: Hoare triple {5170#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5171#(<= main_~i~0 5)} is VALID [2022-04-28 02:47:47,462 INFO L290 TraceCheckUtils]: 16: Hoare triple {5171#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5171#(<= main_~i~0 5)} is VALID [2022-04-28 02:47:47,462 INFO L290 TraceCheckUtils]: 17: Hoare triple {5171#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5172#(<= main_~i~0 6)} is VALID [2022-04-28 02:47:47,462 INFO L290 TraceCheckUtils]: 18: Hoare triple {5172#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5172#(<= main_~i~0 6)} is VALID [2022-04-28 02:47:47,463 INFO L290 TraceCheckUtils]: 19: Hoare triple {5172#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5173#(<= main_~i~0 7)} is VALID [2022-04-28 02:47:47,463 INFO L290 TraceCheckUtils]: 20: Hoare triple {5173#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5173#(<= main_~i~0 7)} is VALID [2022-04-28 02:47:47,464 INFO L290 TraceCheckUtils]: 21: Hoare triple {5173#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5174#(<= main_~i~0 8)} is VALID [2022-04-28 02:47:47,464 INFO L290 TraceCheckUtils]: 22: Hoare triple {5174#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5174#(<= main_~i~0 8)} is VALID [2022-04-28 02:47:47,465 INFO L290 TraceCheckUtils]: 23: Hoare triple {5174#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5175#(<= main_~i~0 9)} is VALID [2022-04-28 02:47:47,465 INFO L290 TraceCheckUtils]: 24: Hoare triple {5175#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5175#(<= main_~i~0 9)} is VALID [2022-04-28 02:47:47,465 INFO L290 TraceCheckUtils]: 25: Hoare triple {5175#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5176#(<= main_~i~0 10)} is VALID [2022-04-28 02:47:47,466 INFO L290 TraceCheckUtils]: 26: Hoare triple {5176#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5176#(<= main_~i~0 10)} is VALID [2022-04-28 02:47:47,466 INFO L290 TraceCheckUtils]: 27: Hoare triple {5176#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5177#(<= main_~i~0 11)} is VALID [2022-04-28 02:47:47,467 INFO L290 TraceCheckUtils]: 28: Hoare triple {5177#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5177#(<= main_~i~0 11)} is VALID [2022-04-28 02:47:47,467 INFO L290 TraceCheckUtils]: 29: Hoare triple {5177#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5178#(<= main_~i~0 12)} is VALID [2022-04-28 02:47:47,467 INFO L290 TraceCheckUtils]: 30: Hoare triple {5178#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5178#(<= main_~i~0 12)} is VALID [2022-04-28 02:47:47,468 INFO L290 TraceCheckUtils]: 31: Hoare triple {5178#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5179#(<= main_~i~0 13)} is VALID [2022-04-28 02:47:47,468 INFO L290 TraceCheckUtils]: 32: Hoare triple {5179#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5179#(<= main_~i~0 13)} is VALID [2022-04-28 02:47:47,468 INFO L290 TraceCheckUtils]: 33: Hoare triple {5179#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5180#(<= main_~i~0 14)} is VALID [2022-04-28 02:47:47,469 INFO L290 TraceCheckUtils]: 34: Hoare triple {5180#(<= main_~i~0 14)} assume !(~i~0 < 1024); {5162#false} is VALID [2022-04-28 02:47:47,469 INFO L290 TraceCheckUtils]: 35: Hoare triple {5162#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {5162#false} is VALID [2022-04-28 02:47:47,469 INFO L272 TraceCheckUtils]: 36: Hoare triple {5162#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {5162#false} is VALID [2022-04-28 02:47:47,469 INFO L290 TraceCheckUtils]: 37: Hoare triple {5162#false} ~cond := #in~cond; {5162#false} is VALID [2022-04-28 02:47:47,469 INFO L290 TraceCheckUtils]: 38: Hoare triple {5162#false} assume 0 == ~cond; {5162#false} is VALID [2022-04-28 02:47:47,469 INFO L290 TraceCheckUtils]: 39: Hoare triple {5162#false} assume !false; {5162#false} is VALID [2022-04-28 02:47:47,469 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:47:47,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:47:47,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783688555] [2022-04-28 02:47:47,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783688555] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:47:47,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1286253914] [2022-04-28 02:47:47,469 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 02:47:47,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:47:47,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:47:47,470 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:47:47,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-28 02:47:47,528 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 02:47:47,528 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:47:47,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 02:47:47,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:47:47,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:47:47,760 INFO L272 TraceCheckUtils]: 0: Hoare triple {5161#true} call ULTIMATE.init(); {5161#true} is VALID [2022-04-28 02:47:47,760 INFO L290 TraceCheckUtils]: 1: Hoare triple {5161#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {5161#true} is VALID [2022-04-28 02:47:47,760 INFO L290 TraceCheckUtils]: 2: Hoare triple {5161#true} assume true; {5161#true} is VALID [2022-04-28 02:47:47,761 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5161#true} {5161#true} #39#return; {5161#true} is VALID [2022-04-28 02:47:47,761 INFO L272 TraceCheckUtils]: 4: Hoare triple {5161#true} call #t~ret6 := main(); {5161#true} is VALID [2022-04-28 02:47:47,779 INFO L290 TraceCheckUtils]: 5: Hoare triple {5161#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {5200#(<= main_~i~0 0)} is VALID [2022-04-28 02:47:47,780 INFO L290 TraceCheckUtils]: 6: Hoare triple {5200#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5200#(<= main_~i~0 0)} is VALID [2022-04-28 02:47:47,781 INFO L290 TraceCheckUtils]: 7: Hoare triple {5200#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5167#(<= main_~i~0 1)} is VALID [2022-04-28 02:47:47,781 INFO L290 TraceCheckUtils]: 8: Hoare triple {5167#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5167#(<= main_~i~0 1)} is VALID [2022-04-28 02:47:47,782 INFO L290 TraceCheckUtils]: 9: Hoare triple {5167#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5168#(<= main_~i~0 2)} is VALID [2022-04-28 02:47:47,782 INFO L290 TraceCheckUtils]: 10: Hoare triple {5168#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5168#(<= main_~i~0 2)} is VALID [2022-04-28 02:47:47,783 INFO L290 TraceCheckUtils]: 11: Hoare triple {5168#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5169#(<= main_~i~0 3)} is VALID [2022-04-28 02:47:47,783 INFO L290 TraceCheckUtils]: 12: Hoare triple {5169#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5169#(<= main_~i~0 3)} is VALID [2022-04-28 02:47:47,784 INFO L290 TraceCheckUtils]: 13: Hoare triple {5169#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5170#(<= main_~i~0 4)} is VALID [2022-04-28 02:47:47,785 INFO L290 TraceCheckUtils]: 14: Hoare triple {5170#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5170#(<= main_~i~0 4)} is VALID [2022-04-28 02:47:47,785 INFO L290 TraceCheckUtils]: 15: Hoare triple {5170#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5171#(<= main_~i~0 5)} is VALID [2022-04-28 02:47:47,786 INFO L290 TraceCheckUtils]: 16: Hoare triple {5171#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5171#(<= main_~i~0 5)} is VALID [2022-04-28 02:47:47,786 INFO L290 TraceCheckUtils]: 17: Hoare triple {5171#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5172#(<= main_~i~0 6)} is VALID [2022-04-28 02:47:47,787 INFO L290 TraceCheckUtils]: 18: Hoare triple {5172#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5172#(<= main_~i~0 6)} is VALID [2022-04-28 02:47:47,787 INFO L290 TraceCheckUtils]: 19: Hoare triple {5172#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5173#(<= main_~i~0 7)} is VALID [2022-04-28 02:47:47,788 INFO L290 TraceCheckUtils]: 20: Hoare triple {5173#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5173#(<= main_~i~0 7)} is VALID [2022-04-28 02:47:47,788 INFO L290 TraceCheckUtils]: 21: Hoare triple {5173#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5174#(<= main_~i~0 8)} is VALID [2022-04-28 02:47:47,789 INFO L290 TraceCheckUtils]: 22: Hoare triple {5174#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5174#(<= main_~i~0 8)} is VALID [2022-04-28 02:47:47,790 INFO L290 TraceCheckUtils]: 23: Hoare triple {5174#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5175#(<= main_~i~0 9)} is VALID [2022-04-28 02:47:47,790 INFO L290 TraceCheckUtils]: 24: Hoare triple {5175#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5175#(<= main_~i~0 9)} is VALID [2022-04-28 02:47:47,791 INFO L290 TraceCheckUtils]: 25: Hoare triple {5175#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5176#(<= main_~i~0 10)} is VALID [2022-04-28 02:47:47,791 INFO L290 TraceCheckUtils]: 26: Hoare triple {5176#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5176#(<= main_~i~0 10)} is VALID [2022-04-28 02:47:47,792 INFO L290 TraceCheckUtils]: 27: Hoare triple {5176#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5177#(<= main_~i~0 11)} is VALID [2022-04-28 02:47:47,792 INFO L290 TraceCheckUtils]: 28: Hoare triple {5177#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5177#(<= main_~i~0 11)} is VALID [2022-04-28 02:47:47,792 INFO L290 TraceCheckUtils]: 29: Hoare triple {5177#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5178#(<= main_~i~0 12)} is VALID [2022-04-28 02:47:47,793 INFO L290 TraceCheckUtils]: 30: Hoare triple {5178#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5178#(<= main_~i~0 12)} is VALID [2022-04-28 02:47:47,793 INFO L290 TraceCheckUtils]: 31: Hoare triple {5178#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5179#(<= main_~i~0 13)} is VALID [2022-04-28 02:47:47,793 INFO L290 TraceCheckUtils]: 32: Hoare triple {5179#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5179#(<= main_~i~0 13)} is VALID [2022-04-28 02:47:47,794 INFO L290 TraceCheckUtils]: 33: Hoare triple {5179#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5180#(<= main_~i~0 14)} is VALID [2022-04-28 02:47:47,794 INFO L290 TraceCheckUtils]: 34: Hoare triple {5180#(<= main_~i~0 14)} assume !(~i~0 < 1024); {5162#false} is VALID [2022-04-28 02:47:47,794 INFO L290 TraceCheckUtils]: 35: Hoare triple {5162#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {5162#false} is VALID [2022-04-28 02:47:47,794 INFO L272 TraceCheckUtils]: 36: Hoare triple {5162#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {5162#false} is VALID [2022-04-28 02:47:47,794 INFO L290 TraceCheckUtils]: 37: Hoare triple {5162#false} ~cond := #in~cond; {5162#false} is VALID [2022-04-28 02:47:47,794 INFO L290 TraceCheckUtils]: 38: Hoare triple {5162#false} assume 0 == ~cond; {5162#false} is VALID [2022-04-28 02:47:47,794 INFO L290 TraceCheckUtils]: 39: Hoare triple {5162#false} assume !false; {5162#false} is VALID [2022-04-28 02:47:47,794 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:47:47,794 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:47:48,237 INFO L290 TraceCheckUtils]: 39: Hoare triple {5162#false} assume !false; {5162#false} is VALID [2022-04-28 02:47:48,238 INFO L290 TraceCheckUtils]: 38: Hoare triple {5162#false} assume 0 == ~cond; {5162#false} is VALID [2022-04-28 02:47:48,238 INFO L290 TraceCheckUtils]: 37: Hoare triple {5162#false} ~cond := #in~cond; {5162#false} is VALID [2022-04-28 02:47:48,238 INFO L272 TraceCheckUtils]: 36: Hoare triple {5162#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {5162#false} is VALID [2022-04-28 02:47:48,238 INFO L290 TraceCheckUtils]: 35: Hoare triple {5162#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {5162#false} is VALID [2022-04-28 02:47:48,238 INFO L290 TraceCheckUtils]: 34: Hoare triple {5318#(< main_~i~0 1024)} assume !(~i~0 < 1024); {5162#false} is VALID [2022-04-28 02:47:48,238 INFO L290 TraceCheckUtils]: 33: Hoare triple {5322#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5318#(< main_~i~0 1024)} is VALID [2022-04-28 02:47:48,239 INFO L290 TraceCheckUtils]: 32: Hoare triple {5322#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5322#(< main_~i~0 1023)} is VALID [2022-04-28 02:47:48,239 INFO L290 TraceCheckUtils]: 31: Hoare triple {5329#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5322#(< main_~i~0 1023)} is VALID [2022-04-28 02:47:48,239 INFO L290 TraceCheckUtils]: 30: Hoare triple {5329#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5329#(< main_~i~0 1022)} is VALID [2022-04-28 02:47:48,240 INFO L290 TraceCheckUtils]: 29: Hoare triple {5336#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5329#(< main_~i~0 1022)} is VALID [2022-04-28 02:47:48,240 INFO L290 TraceCheckUtils]: 28: Hoare triple {5336#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5336#(< main_~i~0 1021)} is VALID [2022-04-28 02:47:48,240 INFO L290 TraceCheckUtils]: 27: Hoare triple {5343#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5336#(< main_~i~0 1021)} is VALID [2022-04-28 02:47:48,241 INFO L290 TraceCheckUtils]: 26: Hoare triple {5343#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5343#(< main_~i~0 1020)} is VALID [2022-04-28 02:47:48,241 INFO L290 TraceCheckUtils]: 25: Hoare triple {5350#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5343#(< main_~i~0 1020)} is VALID [2022-04-28 02:47:48,241 INFO L290 TraceCheckUtils]: 24: Hoare triple {5350#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5350#(< main_~i~0 1019)} is VALID [2022-04-28 02:47:48,242 INFO L290 TraceCheckUtils]: 23: Hoare triple {5357#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5350#(< main_~i~0 1019)} is VALID [2022-04-28 02:47:48,242 INFO L290 TraceCheckUtils]: 22: Hoare triple {5357#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5357#(< main_~i~0 1018)} is VALID [2022-04-28 02:47:48,242 INFO L290 TraceCheckUtils]: 21: Hoare triple {5364#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5357#(< main_~i~0 1018)} is VALID [2022-04-28 02:47:48,242 INFO L290 TraceCheckUtils]: 20: Hoare triple {5364#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5364#(< main_~i~0 1017)} is VALID [2022-04-28 02:47:48,243 INFO L290 TraceCheckUtils]: 19: Hoare triple {5371#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5364#(< main_~i~0 1017)} is VALID [2022-04-28 02:47:48,243 INFO L290 TraceCheckUtils]: 18: Hoare triple {5371#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5371#(< main_~i~0 1016)} is VALID [2022-04-28 02:47:48,243 INFO L290 TraceCheckUtils]: 17: Hoare triple {5378#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5371#(< main_~i~0 1016)} is VALID [2022-04-28 02:47:48,244 INFO L290 TraceCheckUtils]: 16: Hoare triple {5378#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5378#(< main_~i~0 1015)} is VALID [2022-04-28 02:47:48,244 INFO L290 TraceCheckUtils]: 15: Hoare triple {5385#(< main_~i~0 1014)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5378#(< main_~i~0 1015)} is VALID [2022-04-28 02:47:48,244 INFO L290 TraceCheckUtils]: 14: Hoare triple {5385#(< main_~i~0 1014)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5385#(< main_~i~0 1014)} is VALID [2022-04-28 02:47:48,245 INFO L290 TraceCheckUtils]: 13: Hoare triple {5392#(< main_~i~0 1013)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5385#(< main_~i~0 1014)} is VALID [2022-04-28 02:47:48,245 INFO L290 TraceCheckUtils]: 12: Hoare triple {5392#(< main_~i~0 1013)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5392#(< main_~i~0 1013)} is VALID [2022-04-28 02:47:48,245 INFO L290 TraceCheckUtils]: 11: Hoare triple {5399#(< main_~i~0 1012)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5392#(< main_~i~0 1013)} is VALID [2022-04-28 02:47:48,246 INFO L290 TraceCheckUtils]: 10: Hoare triple {5399#(< main_~i~0 1012)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5399#(< main_~i~0 1012)} is VALID [2022-04-28 02:47:48,246 INFO L290 TraceCheckUtils]: 9: Hoare triple {5406#(< main_~i~0 1011)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5399#(< main_~i~0 1012)} is VALID [2022-04-28 02:47:48,246 INFO L290 TraceCheckUtils]: 8: Hoare triple {5406#(< main_~i~0 1011)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5406#(< main_~i~0 1011)} is VALID [2022-04-28 02:47:48,247 INFO L290 TraceCheckUtils]: 7: Hoare triple {5413#(< main_~i~0 1010)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5406#(< main_~i~0 1011)} is VALID [2022-04-28 02:47:48,247 INFO L290 TraceCheckUtils]: 6: Hoare triple {5413#(< main_~i~0 1010)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5413#(< main_~i~0 1010)} is VALID [2022-04-28 02:47:48,247 INFO L290 TraceCheckUtils]: 5: Hoare triple {5161#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {5413#(< main_~i~0 1010)} is VALID [2022-04-28 02:47:48,247 INFO L272 TraceCheckUtils]: 4: Hoare triple {5161#true} call #t~ret6 := main(); {5161#true} is VALID [2022-04-28 02:47:48,247 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5161#true} {5161#true} #39#return; {5161#true} is VALID [2022-04-28 02:47:48,248 INFO L290 TraceCheckUtils]: 2: Hoare triple {5161#true} assume true; {5161#true} is VALID [2022-04-28 02:47:48,248 INFO L290 TraceCheckUtils]: 1: Hoare triple {5161#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {5161#true} is VALID [2022-04-28 02:47:48,248 INFO L272 TraceCheckUtils]: 0: Hoare triple {5161#true} call ULTIMATE.init(); {5161#true} is VALID [2022-04-28 02:47:48,248 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:47:48,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1286253914] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:47:48,248 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:47:48,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34 [2022-04-28 02:47:48,248 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:47:48,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1521219607] [2022-04-28 02:47:48,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1521219607] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:47:48,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:47:48,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 02:47:48,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888843563] [2022-04-28 02:47:48,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:47:48,249 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 17 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-04-28 02:47:48,249 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:47:48,249 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 2.0) internal successors, (36), 17 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:48,274 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:47:48,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 02:47:48,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:47:48,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 02:47:48,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=530, Invalid=592, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 02:47:48,275 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 17 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:48,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:47:48,569 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2022-04-28 02:47:48,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 02:47:48,570 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 17 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-04-28 02:47:48,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:47:48,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 17 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:48,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 50 transitions. [2022-04-28 02:47:48,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 17 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:48,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 50 transitions. [2022-04-28 02:47:48,572 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 50 transitions. [2022-04-28 02:47:48,620 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:47:48,620 INFO L225 Difference]: With dead ends: 50 [2022-04-28 02:47:48,620 INFO L226 Difference]: Without dead ends: 44 [2022-04-28 02:47:48,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1026, Invalid=1326, Unknown=0, NotChecked=0, Total=2352 [2022-04-28 02:47:48,621 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 38 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:47:48,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 29 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:47:48,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-28 02:47:48,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2022-04-28 02:47:48,696 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:47:48,696 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:48,696 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:48,696 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:48,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:47:48,697 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-04-28 02:47:48,698 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2022-04-28 02:47:48,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:47:48,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:47:48,698 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 44 states. [2022-04-28 02:47:48,698 INFO L87 Difference]: Start difference. First operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 44 states. [2022-04-28 02:47:48,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:47:48,699 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-04-28 02:47:48,699 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2022-04-28 02:47:48,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:47:48,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:47:48,699 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:47:48,699 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:47:48,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:48,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2022-04-28 02:47:48,700 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 40 [2022-04-28 02:47:48,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:47:48,700 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2022-04-28 02:47:48,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 17 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:48,701 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 43 transitions. [2022-04-28 02:47:48,744 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:47:48,745 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2022-04-28 02:47:48,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-28 02:47:48,745 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:47:48,745 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:47:48,768 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-04-28 02:47:48,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:47:48,955 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:47:48,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:47:48,956 INFO L85 PathProgramCache]: Analyzing trace with hash 386903576, now seen corresponding path program 29 times [2022-04-28 02:47:48,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:47:48,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1552534942] [2022-04-28 02:47:48,958 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:47:48,958 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:47:48,958 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:47:48,958 INFO L85 PathProgramCache]: Analyzing trace with hash 386903576, now seen corresponding path program 30 times [2022-04-28 02:47:48,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:47:48,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178384357] [2022-04-28 02:47:48,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:47:48,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:47:48,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:47:49,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:47:49,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:47:49,171 INFO L290 TraceCheckUtils]: 0: Hoare triple {5762#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {5741#true} is VALID [2022-04-28 02:47:49,171 INFO L290 TraceCheckUtils]: 1: Hoare triple {5741#true} assume true; {5741#true} is VALID [2022-04-28 02:47:49,171 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5741#true} {5741#true} #39#return; {5741#true} is VALID [2022-04-28 02:47:49,172 INFO L272 TraceCheckUtils]: 0: Hoare triple {5741#true} call ULTIMATE.init(); {5762#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:47:49,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {5762#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {5741#true} is VALID [2022-04-28 02:47:49,172 INFO L290 TraceCheckUtils]: 2: Hoare triple {5741#true} assume true; {5741#true} is VALID [2022-04-28 02:47:49,172 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5741#true} {5741#true} #39#return; {5741#true} is VALID [2022-04-28 02:47:49,172 INFO L272 TraceCheckUtils]: 4: Hoare triple {5741#true} call #t~ret6 := main(); {5741#true} is VALID [2022-04-28 02:47:49,173 INFO L290 TraceCheckUtils]: 5: Hoare triple {5741#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {5746#(= main_~i~0 0)} is VALID [2022-04-28 02:47:49,173 INFO L290 TraceCheckUtils]: 6: Hoare triple {5746#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5746#(= main_~i~0 0)} is VALID [2022-04-28 02:47:49,173 INFO L290 TraceCheckUtils]: 7: Hoare triple {5746#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5747#(<= main_~i~0 1)} is VALID [2022-04-28 02:47:49,174 INFO L290 TraceCheckUtils]: 8: Hoare triple {5747#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5747#(<= main_~i~0 1)} is VALID [2022-04-28 02:47:49,174 INFO L290 TraceCheckUtils]: 9: Hoare triple {5747#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5748#(<= main_~i~0 2)} is VALID [2022-04-28 02:47:49,174 INFO L290 TraceCheckUtils]: 10: Hoare triple {5748#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5748#(<= main_~i~0 2)} is VALID [2022-04-28 02:47:49,175 INFO L290 TraceCheckUtils]: 11: Hoare triple {5748#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5749#(<= main_~i~0 3)} is VALID [2022-04-28 02:47:49,175 INFO L290 TraceCheckUtils]: 12: Hoare triple {5749#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5749#(<= main_~i~0 3)} is VALID [2022-04-28 02:47:49,176 INFO L290 TraceCheckUtils]: 13: Hoare triple {5749#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5750#(<= main_~i~0 4)} is VALID [2022-04-28 02:47:49,176 INFO L290 TraceCheckUtils]: 14: Hoare triple {5750#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5750#(<= main_~i~0 4)} is VALID [2022-04-28 02:47:49,176 INFO L290 TraceCheckUtils]: 15: Hoare triple {5750#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5751#(<= main_~i~0 5)} is VALID [2022-04-28 02:47:49,177 INFO L290 TraceCheckUtils]: 16: Hoare triple {5751#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5751#(<= main_~i~0 5)} is VALID [2022-04-28 02:47:49,177 INFO L290 TraceCheckUtils]: 17: Hoare triple {5751#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5752#(<= main_~i~0 6)} is VALID [2022-04-28 02:47:49,177 INFO L290 TraceCheckUtils]: 18: Hoare triple {5752#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5752#(<= main_~i~0 6)} is VALID [2022-04-28 02:47:49,178 INFO L290 TraceCheckUtils]: 19: Hoare triple {5752#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5753#(<= main_~i~0 7)} is VALID [2022-04-28 02:47:49,178 INFO L290 TraceCheckUtils]: 20: Hoare triple {5753#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5753#(<= main_~i~0 7)} is VALID [2022-04-28 02:47:49,178 INFO L290 TraceCheckUtils]: 21: Hoare triple {5753#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5754#(<= main_~i~0 8)} is VALID [2022-04-28 02:47:49,179 INFO L290 TraceCheckUtils]: 22: Hoare triple {5754#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5754#(<= main_~i~0 8)} is VALID [2022-04-28 02:47:49,179 INFO L290 TraceCheckUtils]: 23: Hoare triple {5754#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5755#(<= main_~i~0 9)} is VALID [2022-04-28 02:47:49,179 INFO L290 TraceCheckUtils]: 24: Hoare triple {5755#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5755#(<= main_~i~0 9)} is VALID [2022-04-28 02:47:49,180 INFO L290 TraceCheckUtils]: 25: Hoare triple {5755#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5756#(<= main_~i~0 10)} is VALID [2022-04-28 02:47:49,180 INFO L290 TraceCheckUtils]: 26: Hoare triple {5756#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5756#(<= main_~i~0 10)} is VALID [2022-04-28 02:47:49,181 INFO L290 TraceCheckUtils]: 27: Hoare triple {5756#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5757#(<= main_~i~0 11)} is VALID [2022-04-28 02:47:49,181 INFO L290 TraceCheckUtils]: 28: Hoare triple {5757#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5757#(<= main_~i~0 11)} is VALID [2022-04-28 02:47:49,181 INFO L290 TraceCheckUtils]: 29: Hoare triple {5757#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5758#(<= main_~i~0 12)} is VALID [2022-04-28 02:47:49,182 INFO L290 TraceCheckUtils]: 30: Hoare triple {5758#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5758#(<= main_~i~0 12)} is VALID [2022-04-28 02:47:49,182 INFO L290 TraceCheckUtils]: 31: Hoare triple {5758#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5759#(<= main_~i~0 13)} is VALID [2022-04-28 02:47:49,182 INFO L290 TraceCheckUtils]: 32: Hoare triple {5759#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5759#(<= main_~i~0 13)} is VALID [2022-04-28 02:47:49,183 INFO L290 TraceCheckUtils]: 33: Hoare triple {5759#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5760#(<= main_~i~0 14)} is VALID [2022-04-28 02:47:49,183 INFO L290 TraceCheckUtils]: 34: Hoare triple {5760#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5760#(<= main_~i~0 14)} is VALID [2022-04-28 02:47:49,183 INFO L290 TraceCheckUtils]: 35: Hoare triple {5760#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5761#(<= main_~i~0 15)} is VALID [2022-04-28 02:47:49,184 INFO L290 TraceCheckUtils]: 36: Hoare triple {5761#(<= main_~i~0 15)} assume !(~i~0 < 1024); {5742#false} is VALID [2022-04-28 02:47:49,184 INFO L290 TraceCheckUtils]: 37: Hoare triple {5742#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {5742#false} is VALID [2022-04-28 02:47:49,184 INFO L272 TraceCheckUtils]: 38: Hoare triple {5742#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {5742#false} is VALID [2022-04-28 02:47:49,184 INFO L290 TraceCheckUtils]: 39: Hoare triple {5742#false} ~cond := #in~cond; {5742#false} is VALID [2022-04-28 02:47:49,184 INFO L290 TraceCheckUtils]: 40: Hoare triple {5742#false} assume 0 == ~cond; {5742#false} is VALID [2022-04-28 02:47:49,184 INFO L290 TraceCheckUtils]: 41: Hoare triple {5742#false} assume !false; {5742#false} is VALID [2022-04-28 02:47:49,184 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:47:49,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:47:49,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178384357] [2022-04-28 02:47:49,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178384357] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:47:49,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179793732] [2022-04-28 02:47:49,185 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 02:47:49,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:47:49,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:47:49,188 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:47:49,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-28 02:47:49,402 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2022-04-28 02:47:49,402 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:47:49,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 02:47:49,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:47:49,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:47:49,623 INFO L272 TraceCheckUtils]: 0: Hoare triple {5741#true} call ULTIMATE.init(); {5741#true} is VALID [2022-04-28 02:47:49,623 INFO L290 TraceCheckUtils]: 1: Hoare triple {5741#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {5741#true} is VALID [2022-04-28 02:47:49,623 INFO L290 TraceCheckUtils]: 2: Hoare triple {5741#true} assume true; {5741#true} is VALID [2022-04-28 02:47:49,623 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5741#true} {5741#true} #39#return; {5741#true} is VALID [2022-04-28 02:47:49,623 INFO L272 TraceCheckUtils]: 4: Hoare triple {5741#true} call #t~ret6 := main(); {5741#true} is VALID [2022-04-28 02:47:49,624 INFO L290 TraceCheckUtils]: 5: Hoare triple {5741#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {5781#(<= main_~i~0 0)} is VALID [2022-04-28 02:47:49,624 INFO L290 TraceCheckUtils]: 6: Hoare triple {5781#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5781#(<= main_~i~0 0)} is VALID [2022-04-28 02:47:49,624 INFO L290 TraceCheckUtils]: 7: Hoare triple {5781#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5747#(<= main_~i~0 1)} is VALID [2022-04-28 02:47:49,625 INFO L290 TraceCheckUtils]: 8: Hoare triple {5747#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5747#(<= main_~i~0 1)} is VALID [2022-04-28 02:47:49,625 INFO L290 TraceCheckUtils]: 9: Hoare triple {5747#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5748#(<= main_~i~0 2)} is VALID [2022-04-28 02:47:49,625 INFO L290 TraceCheckUtils]: 10: Hoare triple {5748#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5748#(<= main_~i~0 2)} is VALID [2022-04-28 02:47:49,626 INFO L290 TraceCheckUtils]: 11: Hoare triple {5748#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5749#(<= main_~i~0 3)} is VALID [2022-04-28 02:47:49,626 INFO L290 TraceCheckUtils]: 12: Hoare triple {5749#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5749#(<= main_~i~0 3)} is VALID [2022-04-28 02:47:49,626 INFO L290 TraceCheckUtils]: 13: Hoare triple {5749#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5750#(<= main_~i~0 4)} is VALID [2022-04-28 02:47:49,627 INFO L290 TraceCheckUtils]: 14: Hoare triple {5750#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5750#(<= main_~i~0 4)} is VALID [2022-04-28 02:47:49,627 INFO L290 TraceCheckUtils]: 15: Hoare triple {5750#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5751#(<= main_~i~0 5)} is VALID [2022-04-28 02:47:49,627 INFO L290 TraceCheckUtils]: 16: Hoare triple {5751#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5751#(<= main_~i~0 5)} is VALID [2022-04-28 02:47:49,628 INFO L290 TraceCheckUtils]: 17: Hoare triple {5751#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5752#(<= main_~i~0 6)} is VALID [2022-04-28 02:47:49,628 INFO L290 TraceCheckUtils]: 18: Hoare triple {5752#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5752#(<= main_~i~0 6)} is VALID [2022-04-28 02:47:49,628 INFO L290 TraceCheckUtils]: 19: Hoare triple {5752#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5753#(<= main_~i~0 7)} is VALID [2022-04-28 02:47:49,628 INFO L290 TraceCheckUtils]: 20: Hoare triple {5753#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5753#(<= main_~i~0 7)} is VALID [2022-04-28 02:47:49,629 INFO L290 TraceCheckUtils]: 21: Hoare triple {5753#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5754#(<= main_~i~0 8)} is VALID [2022-04-28 02:47:49,629 INFO L290 TraceCheckUtils]: 22: Hoare triple {5754#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5754#(<= main_~i~0 8)} is VALID [2022-04-28 02:47:49,629 INFO L290 TraceCheckUtils]: 23: Hoare triple {5754#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5755#(<= main_~i~0 9)} is VALID [2022-04-28 02:47:49,630 INFO L290 TraceCheckUtils]: 24: Hoare triple {5755#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5755#(<= main_~i~0 9)} is VALID [2022-04-28 02:47:49,630 INFO L290 TraceCheckUtils]: 25: Hoare triple {5755#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5756#(<= main_~i~0 10)} is VALID [2022-04-28 02:47:49,630 INFO L290 TraceCheckUtils]: 26: Hoare triple {5756#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5756#(<= main_~i~0 10)} is VALID [2022-04-28 02:47:49,631 INFO L290 TraceCheckUtils]: 27: Hoare triple {5756#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5757#(<= main_~i~0 11)} is VALID [2022-04-28 02:47:49,631 INFO L290 TraceCheckUtils]: 28: Hoare triple {5757#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5757#(<= main_~i~0 11)} is VALID [2022-04-28 02:47:49,631 INFO L290 TraceCheckUtils]: 29: Hoare triple {5757#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5758#(<= main_~i~0 12)} is VALID [2022-04-28 02:47:49,632 INFO L290 TraceCheckUtils]: 30: Hoare triple {5758#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5758#(<= main_~i~0 12)} is VALID [2022-04-28 02:47:49,632 INFO L290 TraceCheckUtils]: 31: Hoare triple {5758#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5759#(<= main_~i~0 13)} is VALID [2022-04-28 02:47:49,632 INFO L290 TraceCheckUtils]: 32: Hoare triple {5759#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5759#(<= main_~i~0 13)} is VALID [2022-04-28 02:47:49,633 INFO L290 TraceCheckUtils]: 33: Hoare triple {5759#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5760#(<= main_~i~0 14)} is VALID [2022-04-28 02:47:49,633 INFO L290 TraceCheckUtils]: 34: Hoare triple {5760#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5760#(<= main_~i~0 14)} is VALID [2022-04-28 02:47:49,633 INFO L290 TraceCheckUtils]: 35: Hoare triple {5760#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5761#(<= main_~i~0 15)} is VALID [2022-04-28 02:47:49,634 INFO L290 TraceCheckUtils]: 36: Hoare triple {5761#(<= main_~i~0 15)} assume !(~i~0 < 1024); {5742#false} is VALID [2022-04-28 02:47:49,634 INFO L290 TraceCheckUtils]: 37: Hoare triple {5742#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {5742#false} is VALID [2022-04-28 02:47:49,634 INFO L272 TraceCheckUtils]: 38: Hoare triple {5742#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {5742#false} is VALID [2022-04-28 02:47:49,634 INFO L290 TraceCheckUtils]: 39: Hoare triple {5742#false} ~cond := #in~cond; {5742#false} is VALID [2022-04-28 02:47:49,634 INFO L290 TraceCheckUtils]: 40: Hoare triple {5742#false} assume 0 == ~cond; {5742#false} is VALID [2022-04-28 02:47:49,634 INFO L290 TraceCheckUtils]: 41: Hoare triple {5742#false} assume !false; {5742#false} is VALID [2022-04-28 02:47:49,634 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:47:49,634 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:47:50,147 INFO L290 TraceCheckUtils]: 41: Hoare triple {5742#false} assume !false; {5742#false} is VALID [2022-04-28 02:47:50,147 INFO L290 TraceCheckUtils]: 40: Hoare triple {5742#false} assume 0 == ~cond; {5742#false} is VALID [2022-04-28 02:47:50,147 INFO L290 TraceCheckUtils]: 39: Hoare triple {5742#false} ~cond := #in~cond; {5742#false} is VALID [2022-04-28 02:47:50,147 INFO L272 TraceCheckUtils]: 38: Hoare triple {5742#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {5742#false} is VALID [2022-04-28 02:47:50,147 INFO L290 TraceCheckUtils]: 37: Hoare triple {5742#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {5742#false} is VALID [2022-04-28 02:47:50,148 INFO L290 TraceCheckUtils]: 36: Hoare triple {5905#(< main_~i~0 1024)} assume !(~i~0 < 1024); {5742#false} is VALID [2022-04-28 02:47:50,148 INFO L290 TraceCheckUtils]: 35: Hoare triple {5909#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5905#(< main_~i~0 1024)} is VALID [2022-04-28 02:47:50,148 INFO L290 TraceCheckUtils]: 34: Hoare triple {5909#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5909#(< main_~i~0 1023)} is VALID [2022-04-28 02:47:50,149 INFO L290 TraceCheckUtils]: 33: Hoare triple {5916#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5909#(< main_~i~0 1023)} is VALID [2022-04-28 02:47:50,149 INFO L290 TraceCheckUtils]: 32: Hoare triple {5916#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5916#(< main_~i~0 1022)} is VALID [2022-04-28 02:47:50,150 INFO L290 TraceCheckUtils]: 31: Hoare triple {5923#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5916#(< main_~i~0 1022)} is VALID [2022-04-28 02:47:50,150 INFO L290 TraceCheckUtils]: 30: Hoare triple {5923#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5923#(< main_~i~0 1021)} is VALID [2022-04-28 02:47:50,151 INFO L290 TraceCheckUtils]: 29: Hoare triple {5930#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5923#(< main_~i~0 1021)} is VALID [2022-04-28 02:47:50,151 INFO L290 TraceCheckUtils]: 28: Hoare triple {5930#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5930#(< main_~i~0 1020)} is VALID [2022-04-28 02:47:50,151 INFO L290 TraceCheckUtils]: 27: Hoare triple {5937#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5930#(< main_~i~0 1020)} is VALID [2022-04-28 02:47:50,152 INFO L290 TraceCheckUtils]: 26: Hoare triple {5937#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5937#(< main_~i~0 1019)} is VALID [2022-04-28 02:47:50,152 INFO L290 TraceCheckUtils]: 25: Hoare triple {5944#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5937#(< main_~i~0 1019)} is VALID [2022-04-28 02:47:50,153 INFO L290 TraceCheckUtils]: 24: Hoare triple {5944#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5944#(< main_~i~0 1018)} is VALID [2022-04-28 02:47:50,153 INFO L290 TraceCheckUtils]: 23: Hoare triple {5951#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5944#(< main_~i~0 1018)} is VALID [2022-04-28 02:47:50,153 INFO L290 TraceCheckUtils]: 22: Hoare triple {5951#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5951#(< main_~i~0 1017)} is VALID [2022-04-28 02:47:50,154 INFO L290 TraceCheckUtils]: 21: Hoare triple {5958#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5951#(< main_~i~0 1017)} is VALID [2022-04-28 02:47:50,154 INFO L290 TraceCheckUtils]: 20: Hoare triple {5958#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5958#(< main_~i~0 1016)} is VALID [2022-04-28 02:47:50,155 INFO L290 TraceCheckUtils]: 19: Hoare triple {5965#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5958#(< main_~i~0 1016)} is VALID [2022-04-28 02:47:50,155 INFO L290 TraceCheckUtils]: 18: Hoare triple {5965#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5965#(< main_~i~0 1015)} is VALID [2022-04-28 02:47:50,155 INFO L290 TraceCheckUtils]: 17: Hoare triple {5972#(< main_~i~0 1014)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5965#(< main_~i~0 1015)} is VALID [2022-04-28 02:47:50,156 INFO L290 TraceCheckUtils]: 16: Hoare triple {5972#(< main_~i~0 1014)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5972#(< main_~i~0 1014)} is VALID [2022-04-28 02:47:50,156 INFO L290 TraceCheckUtils]: 15: Hoare triple {5979#(< main_~i~0 1013)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5972#(< main_~i~0 1014)} is VALID [2022-04-28 02:47:50,157 INFO L290 TraceCheckUtils]: 14: Hoare triple {5979#(< main_~i~0 1013)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5979#(< main_~i~0 1013)} is VALID [2022-04-28 02:47:50,157 INFO L290 TraceCheckUtils]: 13: Hoare triple {5986#(< main_~i~0 1012)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5979#(< main_~i~0 1013)} is VALID [2022-04-28 02:47:50,157 INFO L290 TraceCheckUtils]: 12: Hoare triple {5986#(< main_~i~0 1012)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5986#(< main_~i~0 1012)} is VALID [2022-04-28 02:47:50,158 INFO L290 TraceCheckUtils]: 11: Hoare triple {5993#(< main_~i~0 1011)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5986#(< main_~i~0 1012)} is VALID [2022-04-28 02:47:50,158 INFO L290 TraceCheckUtils]: 10: Hoare triple {5993#(< main_~i~0 1011)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5993#(< main_~i~0 1011)} is VALID [2022-04-28 02:47:50,159 INFO L290 TraceCheckUtils]: 9: Hoare triple {6000#(< main_~i~0 1010)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5993#(< main_~i~0 1011)} is VALID [2022-04-28 02:47:50,159 INFO L290 TraceCheckUtils]: 8: Hoare triple {6000#(< main_~i~0 1010)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6000#(< main_~i~0 1010)} is VALID [2022-04-28 02:47:50,160 INFO L290 TraceCheckUtils]: 7: Hoare triple {6007#(< main_~i~0 1009)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6000#(< main_~i~0 1010)} is VALID [2022-04-28 02:47:50,160 INFO L290 TraceCheckUtils]: 6: Hoare triple {6007#(< main_~i~0 1009)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6007#(< main_~i~0 1009)} is VALID [2022-04-28 02:47:50,160 INFO L290 TraceCheckUtils]: 5: Hoare triple {5741#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {6007#(< main_~i~0 1009)} is VALID [2022-04-28 02:47:50,161 INFO L272 TraceCheckUtils]: 4: Hoare triple {5741#true} call #t~ret6 := main(); {5741#true} is VALID [2022-04-28 02:47:50,161 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5741#true} {5741#true} #39#return; {5741#true} is VALID [2022-04-28 02:47:50,161 INFO L290 TraceCheckUtils]: 2: Hoare triple {5741#true} assume true; {5741#true} is VALID [2022-04-28 02:47:50,161 INFO L290 TraceCheckUtils]: 1: Hoare triple {5741#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {5741#true} is VALID [2022-04-28 02:47:50,161 INFO L272 TraceCheckUtils]: 0: Hoare triple {5741#true} call ULTIMATE.init(); {5741#true} is VALID [2022-04-28 02:47:50,161 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:47:50,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [179793732] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:47:50,161 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:47:50,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 36 [2022-04-28 02:47:50,162 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:47:50,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1552534942] [2022-04-28 02:47:50,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1552534942] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:47:50,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:47:50,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 02:47:50,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73638535] [2022-04-28 02:47:50,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:47:50,163 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-28 02:47:50,163 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:47:50,163 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:50,195 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:47:50,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 02:47:50,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:47:50,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 02:47:50,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=597, Invalid=663, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 02:47:50,196 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand has 19 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:50,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:47:50,532 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2022-04-28 02:47:50,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 02:47:50,532 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-28 02:47:50,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:47:50,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:50,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 52 transitions. [2022-04-28 02:47:50,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:50,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 52 transitions. [2022-04-28 02:47:50,534 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 52 transitions. [2022-04-28 02:47:50,571 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:47:50,572 INFO L225 Difference]: With dead ends: 52 [2022-04-28 02:47:50,572 INFO L226 Difference]: Without dead ends: 46 [2022-04-28 02:47:50,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 69 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-28 02:47:50,573 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 40 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:47:50,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 39 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:47:50,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-28 02:47:50,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2022-04-28 02:47:50,632 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:47:50,633 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:50,633 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:50,633 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:50,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:47:50,634 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2022-04-28 02:47:50,634 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2022-04-28 02:47:50,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:47:50,634 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:47:50,634 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 46 states. [2022-04-28 02:47:50,634 INFO L87 Difference]: Start difference. First operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 46 states. [2022-04-28 02:47:50,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:47:50,635 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2022-04-28 02:47:50,635 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2022-04-28 02:47:50,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:47:50,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:47:50,635 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:47:50,635 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:47:50,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:50,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2022-04-28 02:47:50,636 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 42 [2022-04-28 02:47:50,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:47:50,636 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2022-04-28 02:47:50,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:50,636 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 45 transitions. [2022-04-28 02:47:50,675 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:47:50,675 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2022-04-28 02:47:50,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-28 02:47:50,675 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:47:50,675 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:47:50,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-28 02:47:50,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-28 02:47:50,877 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:47:50,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:47:50,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1573061530, now seen corresponding path program 31 times [2022-04-28 02:47:50,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:47:50,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1624344666] [2022-04-28 02:47:50,887 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:47:50,887 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:47:50,887 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:47:50,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1573061530, now seen corresponding path program 32 times [2022-04-28 02:47:50,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:47:50,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071527697] [2022-04-28 02:47:50,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:47:50,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:47:50,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:47:51,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:47:51,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:47:51,109 INFO L290 TraceCheckUtils]: 0: Hoare triple {6371#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {6349#true} is VALID [2022-04-28 02:47:51,109 INFO L290 TraceCheckUtils]: 1: Hoare triple {6349#true} assume true; {6349#true} is VALID [2022-04-28 02:47:51,109 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6349#true} {6349#true} #39#return; {6349#true} is VALID [2022-04-28 02:47:51,110 INFO L272 TraceCheckUtils]: 0: Hoare triple {6349#true} call ULTIMATE.init(); {6371#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:47:51,110 INFO L290 TraceCheckUtils]: 1: Hoare triple {6371#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {6349#true} is VALID [2022-04-28 02:47:51,110 INFO L290 TraceCheckUtils]: 2: Hoare triple {6349#true} assume true; {6349#true} is VALID [2022-04-28 02:47:51,110 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6349#true} {6349#true} #39#return; {6349#true} is VALID [2022-04-28 02:47:51,110 INFO L272 TraceCheckUtils]: 4: Hoare triple {6349#true} call #t~ret6 := main(); {6349#true} is VALID [2022-04-28 02:47:51,111 INFO L290 TraceCheckUtils]: 5: Hoare triple {6349#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {6354#(= main_~i~0 0)} is VALID [2022-04-28 02:47:51,111 INFO L290 TraceCheckUtils]: 6: Hoare triple {6354#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6354#(= main_~i~0 0)} is VALID [2022-04-28 02:47:51,111 INFO L290 TraceCheckUtils]: 7: Hoare triple {6354#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6355#(<= main_~i~0 1)} is VALID [2022-04-28 02:47:51,112 INFO L290 TraceCheckUtils]: 8: Hoare triple {6355#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6355#(<= main_~i~0 1)} is VALID [2022-04-28 02:47:51,112 INFO L290 TraceCheckUtils]: 9: Hoare triple {6355#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6356#(<= main_~i~0 2)} is VALID [2022-04-28 02:47:51,113 INFO L290 TraceCheckUtils]: 10: Hoare triple {6356#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6356#(<= main_~i~0 2)} is VALID [2022-04-28 02:47:51,113 INFO L290 TraceCheckUtils]: 11: Hoare triple {6356#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6357#(<= main_~i~0 3)} is VALID [2022-04-28 02:47:51,113 INFO L290 TraceCheckUtils]: 12: Hoare triple {6357#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6357#(<= main_~i~0 3)} is VALID [2022-04-28 02:47:51,114 INFO L290 TraceCheckUtils]: 13: Hoare triple {6357#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6358#(<= main_~i~0 4)} is VALID [2022-04-28 02:47:51,114 INFO L290 TraceCheckUtils]: 14: Hoare triple {6358#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6358#(<= main_~i~0 4)} is VALID [2022-04-28 02:47:51,115 INFO L290 TraceCheckUtils]: 15: Hoare triple {6358#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6359#(<= main_~i~0 5)} is VALID [2022-04-28 02:47:51,115 INFO L290 TraceCheckUtils]: 16: Hoare triple {6359#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6359#(<= main_~i~0 5)} is VALID [2022-04-28 02:47:51,115 INFO L290 TraceCheckUtils]: 17: Hoare triple {6359#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6360#(<= main_~i~0 6)} is VALID [2022-04-28 02:47:51,116 INFO L290 TraceCheckUtils]: 18: Hoare triple {6360#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6360#(<= main_~i~0 6)} is VALID [2022-04-28 02:47:51,116 INFO L290 TraceCheckUtils]: 19: Hoare triple {6360#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6361#(<= main_~i~0 7)} is VALID [2022-04-28 02:47:51,117 INFO L290 TraceCheckUtils]: 20: Hoare triple {6361#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6361#(<= main_~i~0 7)} is VALID [2022-04-28 02:47:51,117 INFO L290 TraceCheckUtils]: 21: Hoare triple {6361#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6362#(<= main_~i~0 8)} is VALID [2022-04-28 02:47:51,117 INFO L290 TraceCheckUtils]: 22: Hoare triple {6362#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6362#(<= main_~i~0 8)} is VALID [2022-04-28 02:47:51,118 INFO L290 TraceCheckUtils]: 23: Hoare triple {6362#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6363#(<= main_~i~0 9)} is VALID [2022-04-28 02:47:51,118 INFO L290 TraceCheckUtils]: 24: Hoare triple {6363#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6363#(<= main_~i~0 9)} is VALID [2022-04-28 02:47:51,119 INFO L290 TraceCheckUtils]: 25: Hoare triple {6363#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6364#(<= main_~i~0 10)} is VALID [2022-04-28 02:47:51,119 INFO L290 TraceCheckUtils]: 26: Hoare triple {6364#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6364#(<= main_~i~0 10)} is VALID [2022-04-28 02:47:51,119 INFO L290 TraceCheckUtils]: 27: Hoare triple {6364#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6365#(<= main_~i~0 11)} is VALID [2022-04-28 02:47:51,120 INFO L290 TraceCheckUtils]: 28: Hoare triple {6365#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6365#(<= main_~i~0 11)} is VALID [2022-04-28 02:47:51,120 INFO L290 TraceCheckUtils]: 29: Hoare triple {6365#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6366#(<= main_~i~0 12)} is VALID [2022-04-28 02:47:51,121 INFO L290 TraceCheckUtils]: 30: Hoare triple {6366#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6366#(<= main_~i~0 12)} is VALID [2022-04-28 02:47:51,121 INFO L290 TraceCheckUtils]: 31: Hoare triple {6366#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6367#(<= main_~i~0 13)} is VALID [2022-04-28 02:47:51,121 INFO L290 TraceCheckUtils]: 32: Hoare triple {6367#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6367#(<= main_~i~0 13)} is VALID [2022-04-28 02:47:51,122 INFO L290 TraceCheckUtils]: 33: Hoare triple {6367#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6368#(<= main_~i~0 14)} is VALID [2022-04-28 02:47:51,122 INFO L290 TraceCheckUtils]: 34: Hoare triple {6368#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6368#(<= main_~i~0 14)} is VALID [2022-04-28 02:47:51,123 INFO L290 TraceCheckUtils]: 35: Hoare triple {6368#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6369#(<= main_~i~0 15)} is VALID [2022-04-28 02:47:51,123 INFO L290 TraceCheckUtils]: 36: Hoare triple {6369#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6369#(<= main_~i~0 15)} is VALID [2022-04-28 02:47:51,123 INFO L290 TraceCheckUtils]: 37: Hoare triple {6369#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6370#(<= main_~i~0 16)} is VALID [2022-04-28 02:47:51,124 INFO L290 TraceCheckUtils]: 38: Hoare triple {6370#(<= main_~i~0 16)} assume !(~i~0 < 1024); {6350#false} is VALID [2022-04-28 02:47:51,124 INFO L290 TraceCheckUtils]: 39: Hoare triple {6350#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {6350#false} is VALID [2022-04-28 02:47:51,124 INFO L272 TraceCheckUtils]: 40: Hoare triple {6350#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {6350#false} is VALID [2022-04-28 02:47:51,124 INFO L290 TraceCheckUtils]: 41: Hoare triple {6350#false} ~cond := #in~cond; {6350#false} is VALID [2022-04-28 02:47:51,124 INFO L290 TraceCheckUtils]: 42: Hoare triple {6350#false} assume 0 == ~cond; {6350#false} is VALID [2022-04-28 02:47:51,124 INFO L290 TraceCheckUtils]: 43: Hoare triple {6350#false} assume !false; {6350#false} is VALID [2022-04-28 02:47:51,125 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:47:51,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:47:51,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071527697] [2022-04-28 02:47:51,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071527697] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:47:51,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [713953879] [2022-04-28 02:47:51,125 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:47:51,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:47:51,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:47:51,128 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:47:51,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-28 02:47:51,207 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:47:51,207 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:47:51,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-28 02:47:51,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:47:51,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:47:51,451 INFO L272 TraceCheckUtils]: 0: Hoare triple {6349#true} call ULTIMATE.init(); {6349#true} is VALID [2022-04-28 02:47:51,452 INFO L290 TraceCheckUtils]: 1: Hoare triple {6349#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {6349#true} is VALID [2022-04-28 02:47:51,452 INFO L290 TraceCheckUtils]: 2: Hoare triple {6349#true} assume true; {6349#true} is VALID [2022-04-28 02:47:51,452 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6349#true} {6349#true} #39#return; {6349#true} is VALID [2022-04-28 02:47:51,452 INFO L272 TraceCheckUtils]: 4: Hoare triple {6349#true} call #t~ret6 := main(); {6349#true} is VALID [2022-04-28 02:47:51,452 INFO L290 TraceCheckUtils]: 5: Hoare triple {6349#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {6390#(<= main_~i~0 0)} is VALID [2022-04-28 02:47:51,452 INFO L290 TraceCheckUtils]: 6: Hoare triple {6390#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6390#(<= main_~i~0 0)} is VALID [2022-04-28 02:47:51,453 INFO L290 TraceCheckUtils]: 7: Hoare triple {6390#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6355#(<= main_~i~0 1)} is VALID [2022-04-28 02:47:51,453 INFO L290 TraceCheckUtils]: 8: Hoare triple {6355#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6355#(<= main_~i~0 1)} is VALID [2022-04-28 02:47:51,453 INFO L290 TraceCheckUtils]: 9: Hoare triple {6355#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6356#(<= main_~i~0 2)} is VALID [2022-04-28 02:47:51,454 INFO L290 TraceCheckUtils]: 10: Hoare triple {6356#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6356#(<= main_~i~0 2)} is VALID [2022-04-28 02:47:51,454 INFO L290 TraceCheckUtils]: 11: Hoare triple {6356#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6357#(<= main_~i~0 3)} is VALID [2022-04-28 02:47:51,454 INFO L290 TraceCheckUtils]: 12: Hoare triple {6357#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6357#(<= main_~i~0 3)} is VALID [2022-04-28 02:47:51,455 INFO L290 TraceCheckUtils]: 13: Hoare triple {6357#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6358#(<= main_~i~0 4)} is VALID [2022-04-28 02:47:51,455 INFO L290 TraceCheckUtils]: 14: Hoare triple {6358#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6358#(<= main_~i~0 4)} is VALID [2022-04-28 02:47:51,455 INFO L290 TraceCheckUtils]: 15: Hoare triple {6358#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6359#(<= main_~i~0 5)} is VALID [2022-04-28 02:47:51,456 INFO L290 TraceCheckUtils]: 16: Hoare triple {6359#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6359#(<= main_~i~0 5)} is VALID [2022-04-28 02:47:51,456 INFO L290 TraceCheckUtils]: 17: Hoare triple {6359#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6360#(<= main_~i~0 6)} is VALID [2022-04-28 02:47:51,456 INFO L290 TraceCheckUtils]: 18: Hoare triple {6360#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6360#(<= main_~i~0 6)} is VALID [2022-04-28 02:47:51,457 INFO L290 TraceCheckUtils]: 19: Hoare triple {6360#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6361#(<= main_~i~0 7)} is VALID [2022-04-28 02:47:51,457 INFO L290 TraceCheckUtils]: 20: Hoare triple {6361#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6361#(<= main_~i~0 7)} is VALID [2022-04-28 02:47:51,457 INFO L290 TraceCheckUtils]: 21: Hoare triple {6361#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6362#(<= main_~i~0 8)} is VALID [2022-04-28 02:47:51,457 INFO L290 TraceCheckUtils]: 22: Hoare triple {6362#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6362#(<= main_~i~0 8)} is VALID [2022-04-28 02:47:51,458 INFO L290 TraceCheckUtils]: 23: Hoare triple {6362#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6363#(<= main_~i~0 9)} is VALID [2022-04-28 02:47:51,458 INFO L290 TraceCheckUtils]: 24: Hoare triple {6363#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6363#(<= main_~i~0 9)} is VALID [2022-04-28 02:47:51,458 INFO L290 TraceCheckUtils]: 25: Hoare triple {6363#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6364#(<= main_~i~0 10)} is VALID [2022-04-28 02:47:51,459 INFO L290 TraceCheckUtils]: 26: Hoare triple {6364#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6364#(<= main_~i~0 10)} is VALID [2022-04-28 02:47:51,459 INFO L290 TraceCheckUtils]: 27: Hoare triple {6364#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6365#(<= main_~i~0 11)} is VALID [2022-04-28 02:47:51,459 INFO L290 TraceCheckUtils]: 28: Hoare triple {6365#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6365#(<= main_~i~0 11)} is VALID [2022-04-28 02:47:51,460 INFO L290 TraceCheckUtils]: 29: Hoare triple {6365#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6366#(<= main_~i~0 12)} is VALID [2022-04-28 02:47:51,460 INFO L290 TraceCheckUtils]: 30: Hoare triple {6366#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6366#(<= main_~i~0 12)} is VALID [2022-04-28 02:47:51,460 INFO L290 TraceCheckUtils]: 31: Hoare triple {6366#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6367#(<= main_~i~0 13)} is VALID [2022-04-28 02:47:51,461 INFO L290 TraceCheckUtils]: 32: Hoare triple {6367#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6367#(<= main_~i~0 13)} is VALID [2022-04-28 02:47:51,461 INFO L290 TraceCheckUtils]: 33: Hoare triple {6367#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6368#(<= main_~i~0 14)} is VALID [2022-04-28 02:47:51,461 INFO L290 TraceCheckUtils]: 34: Hoare triple {6368#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6368#(<= main_~i~0 14)} is VALID [2022-04-28 02:47:51,462 INFO L290 TraceCheckUtils]: 35: Hoare triple {6368#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6369#(<= main_~i~0 15)} is VALID [2022-04-28 02:47:51,462 INFO L290 TraceCheckUtils]: 36: Hoare triple {6369#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6369#(<= main_~i~0 15)} is VALID [2022-04-28 02:47:51,463 INFO L290 TraceCheckUtils]: 37: Hoare triple {6369#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6370#(<= main_~i~0 16)} is VALID [2022-04-28 02:47:51,463 INFO L290 TraceCheckUtils]: 38: Hoare triple {6370#(<= main_~i~0 16)} assume !(~i~0 < 1024); {6350#false} is VALID [2022-04-28 02:47:51,463 INFO L290 TraceCheckUtils]: 39: Hoare triple {6350#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {6350#false} is VALID [2022-04-28 02:47:51,463 INFO L272 TraceCheckUtils]: 40: Hoare triple {6350#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {6350#false} is VALID [2022-04-28 02:47:51,463 INFO L290 TraceCheckUtils]: 41: Hoare triple {6350#false} ~cond := #in~cond; {6350#false} is VALID [2022-04-28 02:47:51,463 INFO L290 TraceCheckUtils]: 42: Hoare triple {6350#false} assume 0 == ~cond; {6350#false} is VALID [2022-04-28 02:47:51,463 INFO L290 TraceCheckUtils]: 43: Hoare triple {6350#false} assume !false; {6350#false} is VALID [2022-04-28 02:47:51,464 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:47:51,464 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:47:52,027 INFO L290 TraceCheckUtils]: 43: Hoare triple {6350#false} assume !false; {6350#false} is VALID [2022-04-28 02:47:52,027 INFO L290 TraceCheckUtils]: 42: Hoare triple {6350#false} assume 0 == ~cond; {6350#false} is VALID [2022-04-28 02:47:52,027 INFO L290 TraceCheckUtils]: 41: Hoare triple {6350#false} ~cond := #in~cond; {6350#false} is VALID [2022-04-28 02:47:52,027 INFO L272 TraceCheckUtils]: 40: Hoare triple {6350#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {6350#false} is VALID [2022-04-28 02:47:52,027 INFO L290 TraceCheckUtils]: 39: Hoare triple {6350#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {6350#false} is VALID [2022-04-28 02:47:52,027 INFO L290 TraceCheckUtils]: 38: Hoare triple {6520#(< main_~i~0 1024)} assume !(~i~0 < 1024); {6350#false} is VALID [2022-04-28 02:47:52,028 INFO L290 TraceCheckUtils]: 37: Hoare triple {6524#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6520#(< main_~i~0 1024)} is VALID [2022-04-28 02:47:52,028 INFO L290 TraceCheckUtils]: 36: Hoare triple {6524#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6524#(< main_~i~0 1023)} is VALID [2022-04-28 02:47:52,028 INFO L290 TraceCheckUtils]: 35: Hoare triple {6531#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6524#(< main_~i~0 1023)} is VALID [2022-04-28 02:47:52,029 INFO L290 TraceCheckUtils]: 34: Hoare triple {6531#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6531#(< main_~i~0 1022)} is VALID [2022-04-28 02:47:52,029 INFO L290 TraceCheckUtils]: 33: Hoare triple {6538#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6531#(< main_~i~0 1022)} is VALID [2022-04-28 02:47:52,029 INFO L290 TraceCheckUtils]: 32: Hoare triple {6538#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6538#(< main_~i~0 1021)} is VALID [2022-04-28 02:47:52,030 INFO L290 TraceCheckUtils]: 31: Hoare triple {6545#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6538#(< main_~i~0 1021)} is VALID [2022-04-28 02:47:52,030 INFO L290 TraceCheckUtils]: 30: Hoare triple {6545#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6545#(< main_~i~0 1020)} is VALID [2022-04-28 02:47:52,030 INFO L290 TraceCheckUtils]: 29: Hoare triple {6552#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6545#(< main_~i~0 1020)} is VALID [2022-04-28 02:47:52,031 INFO L290 TraceCheckUtils]: 28: Hoare triple {6552#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6552#(< main_~i~0 1019)} is VALID [2022-04-28 02:47:52,031 INFO L290 TraceCheckUtils]: 27: Hoare triple {6559#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6552#(< main_~i~0 1019)} is VALID [2022-04-28 02:47:52,031 INFO L290 TraceCheckUtils]: 26: Hoare triple {6559#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6559#(< main_~i~0 1018)} is VALID [2022-04-28 02:47:52,032 INFO L290 TraceCheckUtils]: 25: Hoare triple {6566#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6559#(< main_~i~0 1018)} is VALID [2022-04-28 02:47:52,032 INFO L290 TraceCheckUtils]: 24: Hoare triple {6566#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6566#(< main_~i~0 1017)} is VALID [2022-04-28 02:47:52,032 INFO L290 TraceCheckUtils]: 23: Hoare triple {6573#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6566#(< main_~i~0 1017)} is VALID [2022-04-28 02:47:52,033 INFO L290 TraceCheckUtils]: 22: Hoare triple {6573#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6573#(< main_~i~0 1016)} is VALID [2022-04-28 02:47:52,033 INFO L290 TraceCheckUtils]: 21: Hoare triple {6580#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6573#(< main_~i~0 1016)} is VALID [2022-04-28 02:47:52,033 INFO L290 TraceCheckUtils]: 20: Hoare triple {6580#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6580#(< main_~i~0 1015)} is VALID [2022-04-28 02:47:52,034 INFO L290 TraceCheckUtils]: 19: Hoare triple {6587#(< main_~i~0 1014)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6580#(< main_~i~0 1015)} is VALID [2022-04-28 02:47:52,047 INFO L290 TraceCheckUtils]: 18: Hoare triple {6587#(< main_~i~0 1014)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6587#(< main_~i~0 1014)} is VALID [2022-04-28 02:47:52,048 INFO L290 TraceCheckUtils]: 17: Hoare triple {6594#(< main_~i~0 1013)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6587#(< main_~i~0 1014)} is VALID [2022-04-28 02:47:52,048 INFO L290 TraceCheckUtils]: 16: Hoare triple {6594#(< main_~i~0 1013)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6594#(< main_~i~0 1013)} is VALID [2022-04-28 02:47:52,048 INFO L290 TraceCheckUtils]: 15: Hoare triple {6601#(< main_~i~0 1012)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6594#(< main_~i~0 1013)} is VALID [2022-04-28 02:47:52,049 INFO L290 TraceCheckUtils]: 14: Hoare triple {6601#(< main_~i~0 1012)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6601#(< main_~i~0 1012)} is VALID [2022-04-28 02:47:52,049 INFO L290 TraceCheckUtils]: 13: Hoare triple {6608#(< main_~i~0 1011)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6601#(< main_~i~0 1012)} is VALID [2022-04-28 02:47:52,050 INFO L290 TraceCheckUtils]: 12: Hoare triple {6608#(< main_~i~0 1011)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6608#(< main_~i~0 1011)} is VALID [2022-04-28 02:47:52,050 INFO L290 TraceCheckUtils]: 11: Hoare triple {6615#(< main_~i~0 1010)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6608#(< main_~i~0 1011)} is VALID [2022-04-28 02:47:52,050 INFO L290 TraceCheckUtils]: 10: Hoare triple {6615#(< main_~i~0 1010)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6615#(< main_~i~0 1010)} is VALID [2022-04-28 02:47:52,051 INFO L290 TraceCheckUtils]: 9: Hoare triple {6622#(< main_~i~0 1009)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6615#(< main_~i~0 1010)} is VALID [2022-04-28 02:47:52,051 INFO L290 TraceCheckUtils]: 8: Hoare triple {6622#(< main_~i~0 1009)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6622#(< main_~i~0 1009)} is VALID [2022-04-28 02:47:52,052 INFO L290 TraceCheckUtils]: 7: Hoare triple {6629#(< main_~i~0 1008)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6622#(< main_~i~0 1009)} is VALID [2022-04-28 02:47:52,052 INFO L290 TraceCheckUtils]: 6: Hoare triple {6629#(< main_~i~0 1008)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6629#(< main_~i~0 1008)} is VALID [2022-04-28 02:47:52,053 INFO L290 TraceCheckUtils]: 5: Hoare triple {6349#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {6629#(< main_~i~0 1008)} is VALID [2022-04-28 02:47:52,053 INFO L272 TraceCheckUtils]: 4: Hoare triple {6349#true} call #t~ret6 := main(); {6349#true} is VALID [2022-04-28 02:47:52,053 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6349#true} {6349#true} #39#return; {6349#true} is VALID [2022-04-28 02:47:52,053 INFO L290 TraceCheckUtils]: 2: Hoare triple {6349#true} assume true; {6349#true} is VALID [2022-04-28 02:47:52,053 INFO L290 TraceCheckUtils]: 1: Hoare triple {6349#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {6349#true} is VALID [2022-04-28 02:47:52,053 INFO L272 TraceCheckUtils]: 0: Hoare triple {6349#true} call ULTIMATE.init(); {6349#true} is VALID [2022-04-28 02:47:52,053 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:47:52,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [713953879] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:47:52,054 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:47:52,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 38 [2022-04-28 02:47:52,054 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:47:52,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1624344666] [2022-04-28 02:47:52,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1624344666] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:47:52,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:47:52,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 02:47:52,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093506559] [2022-04-28 02:47:52,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:47:52,055 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.0) internal successors, (40), 19 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-28 02:47:52,055 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:47:52,055 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 2.0) internal successors, (40), 19 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:52,102 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:47:52,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 02:47:52,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:47:52,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 02:47:52,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=668, Invalid=738, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 02:47:52,103 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand has 20 states, 20 states have (on average 2.0) internal successors, (40), 19 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:52,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:47:52,445 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2022-04-28 02:47:52,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 02:47:52,445 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.0) internal successors, (40), 19 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-28 02:47:52,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:47:52,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 2.0) internal successors, (40), 19 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:52,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 54 transitions. [2022-04-28 02:47:52,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 2.0) internal successors, (40), 19 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:52,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 54 transitions. [2022-04-28 02:47:52,447 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 54 transitions. [2022-04-28 02:47:52,487 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:47:52,488 INFO L225 Difference]: With dead ends: 54 [2022-04-28 02:47:52,488 INFO L226 Difference]: Without dead ends: 48 [2022-04-28 02:47:52,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 72 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-28 02:47:52,489 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 42 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:47:52,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 19 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:47:52,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-28 02:47:52,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2022-04-28 02:47:52,559 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:47:52,559 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:52,560 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:52,560 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:52,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:47:52,560 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2022-04-28 02:47:52,560 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2022-04-28 02:47:52,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:47:52,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:47:52,561 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 48 states. [2022-04-28 02:47:52,561 INFO L87 Difference]: Start difference. First operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 48 states. [2022-04-28 02:47:52,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:47:52,562 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2022-04-28 02:47:52,562 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2022-04-28 02:47:52,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:47:52,562 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:47:52,562 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:47:52,562 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:47:52,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:52,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2022-04-28 02:47:52,563 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 44 [2022-04-28 02:47:52,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:47:52,563 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2022-04-28 02:47:52,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.0) internal successors, (40), 19 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:52,563 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 47 transitions. [2022-04-28 02:47:52,614 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:47:52,614 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2022-04-28 02:47:52,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-28 02:47:52,614 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:47:52,614 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:47:52,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-28 02:47:52,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-28 02:47:52,815 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:47:52,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:47:52,815 INFO L85 PathProgramCache]: Analyzing trace with hash -990445412, now seen corresponding path program 33 times [2022-04-28 02:47:52,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:47:52,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1391839089] [2022-04-28 02:47:52,817 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:47:52,817 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:47:52,818 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:47:52,818 INFO L85 PathProgramCache]: Analyzing trace with hash -990445412, now seen corresponding path program 34 times [2022-04-28 02:47:52,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:47:52,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92329300] [2022-04-28 02:47:52,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:47:52,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:47:52,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:47:53,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:47:53,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:47:53,060 INFO L290 TraceCheckUtils]: 0: Hoare triple {7008#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {6985#true} is VALID [2022-04-28 02:47:53,060 INFO L290 TraceCheckUtils]: 1: Hoare triple {6985#true} assume true; {6985#true} is VALID [2022-04-28 02:47:53,060 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6985#true} {6985#true} #39#return; {6985#true} is VALID [2022-04-28 02:47:53,061 INFO L272 TraceCheckUtils]: 0: Hoare triple {6985#true} call ULTIMATE.init(); {7008#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:47:53,061 INFO L290 TraceCheckUtils]: 1: Hoare triple {7008#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {6985#true} is VALID [2022-04-28 02:47:53,061 INFO L290 TraceCheckUtils]: 2: Hoare triple {6985#true} assume true; {6985#true} is VALID [2022-04-28 02:47:53,061 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6985#true} {6985#true} #39#return; {6985#true} is VALID [2022-04-28 02:47:53,061 INFO L272 TraceCheckUtils]: 4: Hoare triple {6985#true} call #t~ret6 := main(); {6985#true} is VALID [2022-04-28 02:47:53,062 INFO L290 TraceCheckUtils]: 5: Hoare triple {6985#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {6990#(= main_~i~0 0)} is VALID [2022-04-28 02:47:53,062 INFO L290 TraceCheckUtils]: 6: Hoare triple {6990#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6990#(= main_~i~0 0)} is VALID [2022-04-28 02:47:53,062 INFO L290 TraceCheckUtils]: 7: Hoare triple {6990#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6991#(<= main_~i~0 1)} is VALID [2022-04-28 02:47:53,063 INFO L290 TraceCheckUtils]: 8: Hoare triple {6991#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6991#(<= main_~i~0 1)} is VALID [2022-04-28 02:47:53,063 INFO L290 TraceCheckUtils]: 9: Hoare triple {6991#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6992#(<= main_~i~0 2)} is VALID [2022-04-28 02:47:53,064 INFO L290 TraceCheckUtils]: 10: Hoare triple {6992#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6992#(<= main_~i~0 2)} is VALID [2022-04-28 02:47:53,064 INFO L290 TraceCheckUtils]: 11: Hoare triple {6992#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6993#(<= main_~i~0 3)} is VALID [2022-04-28 02:47:53,065 INFO L290 TraceCheckUtils]: 12: Hoare triple {6993#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6993#(<= main_~i~0 3)} is VALID [2022-04-28 02:47:53,065 INFO L290 TraceCheckUtils]: 13: Hoare triple {6993#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6994#(<= main_~i~0 4)} is VALID [2022-04-28 02:47:53,066 INFO L290 TraceCheckUtils]: 14: Hoare triple {6994#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6994#(<= main_~i~0 4)} is VALID [2022-04-28 02:47:53,066 INFO L290 TraceCheckUtils]: 15: Hoare triple {6994#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6995#(<= main_~i~0 5)} is VALID [2022-04-28 02:47:53,066 INFO L290 TraceCheckUtils]: 16: Hoare triple {6995#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6995#(<= main_~i~0 5)} is VALID [2022-04-28 02:47:53,067 INFO L290 TraceCheckUtils]: 17: Hoare triple {6995#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6996#(<= main_~i~0 6)} is VALID [2022-04-28 02:47:53,067 INFO L290 TraceCheckUtils]: 18: Hoare triple {6996#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6996#(<= main_~i~0 6)} is VALID [2022-04-28 02:47:53,068 INFO L290 TraceCheckUtils]: 19: Hoare triple {6996#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6997#(<= main_~i~0 7)} is VALID [2022-04-28 02:47:53,068 INFO L290 TraceCheckUtils]: 20: Hoare triple {6997#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6997#(<= main_~i~0 7)} is VALID [2022-04-28 02:47:53,068 INFO L290 TraceCheckUtils]: 21: Hoare triple {6997#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6998#(<= main_~i~0 8)} is VALID [2022-04-28 02:47:53,068 INFO L290 TraceCheckUtils]: 22: Hoare triple {6998#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6998#(<= main_~i~0 8)} is VALID [2022-04-28 02:47:53,069 INFO L290 TraceCheckUtils]: 23: Hoare triple {6998#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6999#(<= main_~i~0 9)} is VALID [2022-04-28 02:47:53,069 INFO L290 TraceCheckUtils]: 24: Hoare triple {6999#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6999#(<= main_~i~0 9)} is VALID [2022-04-28 02:47:53,069 INFO L290 TraceCheckUtils]: 25: Hoare triple {6999#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7000#(<= main_~i~0 10)} is VALID [2022-04-28 02:47:53,070 INFO L290 TraceCheckUtils]: 26: Hoare triple {7000#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7000#(<= main_~i~0 10)} is VALID [2022-04-28 02:47:53,070 INFO L290 TraceCheckUtils]: 27: Hoare triple {7000#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7001#(<= main_~i~0 11)} is VALID [2022-04-28 02:47:53,070 INFO L290 TraceCheckUtils]: 28: Hoare triple {7001#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7001#(<= main_~i~0 11)} is VALID [2022-04-28 02:47:53,071 INFO L290 TraceCheckUtils]: 29: Hoare triple {7001#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7002#(<= main_~i~0 12)} is VALID [2022-04-28 02:47:53,071 INFO L290 TraceCheckUtils]: 30: Hoare triple {7002#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7002#(<= main_~i~0 12)} is VALID [2022-04-28 02:47:53,071 INFO L290 TraceCheckUtils]: 31: Hoare triple {7002#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7003#(<= main_~i~0 13)} is VALID [2022-04-28 02:47:53,072 INFO L290 TraceCheckUtils]: 32: Hoare triple {7003#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7003#(<= main_~i~0 13)} is VALID [2022-04-28 02:47:53,072 INFO L290 TraceCheckUtils]: 33: Hoare triple {7003#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7004#(<= main_~i~0 14)} is VALID [2022-04-28 02:47:53,072 INFO L290 TraceCheckUtils]: 34: Hoare triple {7004#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7004#(<= main_~i~0 14)} is VALID [2022-04-28 02:47:53,073 INFO L290 TraceCheckUtils]: 35: Hoare triple {7004#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7005#(<= main_~i~0 15)} is VALID [2022-04-28 02:47:53,073 INFO L290 TraceCheckUtils]: 36: Hoare triple {7005#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7005#(<= main_~i~0 15)} is VALID [2022-04-28 02:47:53,073 INFO L290 TraceCheckUtils]: 37: Hoare triple {7005#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7006#(<= main_~i~0 16)} is VALID [2022-04-28 02:47:53,073 INFO L290 TraceCheckUtils]: 38: Hoare triple {7006#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7006#(<= main_~i~0 16)} is VALID [2022-04-28 02:47:53,074 INFO L290 TraceCheckUtils]: 39: Hoare triple {7006#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7007#(<= main_~i~0 17)} is VALID [2022-04-28 02:47:53,074 INFO L290 TraceCheckUtils]: 40: Hoare triple {7007#(<= main_~i~0 17)} assume !(~i~0 < 1024); {6986#false} is VALID [2022-04-28 02:47:53,074 INFO L290 TraceCheckUtils]: 41: Hoare triple {6986#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {6986#false} is VALID [2022-04-28 02:47:53,074 INFO L272 TraceCheckUtils]: 42: Hoare triple {6986#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {6986#false} is VALID [2022-04-28 02:47:53,074 INFO L290 TraceCheckUtils]: 43: Hoare triple {6986#false} ~cond := #in~cond; {6986#false} is VALID [2022-04-28 02:47:53,074 INFO L290 TraceCheckUtils]: 44: Hoare triple {6986#false} assume 0 == ~cond; {6986#false} is VALID [2022-04-28 02:47:53,074 INFO L290 TraceCheckUtils]: 45: Hoare triple {6986#false} assume !false; {6986#false} is VALID [2022-04-28 02:47:53,075 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:47:53,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:47:53,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92329300] [2022-04-28 02:47:53,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92329300] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:47:53,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075686920] [2022-04-28 02:47:53,075 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 02:47:53,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:47:53,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:47:53,076 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:47:53,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-28 02:47:53,144 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 02:47:53,144 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:47:53,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 02:47:53,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:47:53,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:47:53,386 INFO L272 TraceCheckUtils]: 0: Hoare triple {6985#true} call ULTIMATE.init(); {6985#true} is VALID [2022-04-28 02:47:53,386 INFO L290 TraceCheckUtils]: 1: Hoare triple {6985#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {6985#true} is VALID [2022-04-28 02:47:53,386 INFO L290 TraceCheckUtils]: 2: Hoare triple {6985#true} assume true; {6985#true} is VALID [2022-04-28 02:47:53,386 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6985#true} {6985#true} #39#return; {6985#true} is VALID [2022-04-28 02:47:53,386 INFO L272 TraceCheckUtils]: 4: Hoare triple {6985#true} call #t~ret6 := main(); {6985#true} is VALID [2022-04-28 02:47:53,387 INFO L290 TraceCheckUtils]: 5: Hoare triple {6985#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {7027#(<= main_~i~0 0)} is VALID [2022-04-28 02:47:53,387 INFO L290 TraceCheckUtils]: 6: Hoare triple {7027#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7027#(<= main_~i~0 0)} is VALID [2022-04-28 02:47:53,387 INFO L290 TraceCheckUtils]: 7: Hoare triple {7027#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6991#(<= main_~i~0 1)} is VALID [2022-04-28 02:47:53,388 INFO L290 TraceCheckUtils]: 8: Hoare triple {6991#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6991#(<= main_~i~0 1)} is VALID [2022-04-28 02:47:53,388 INFO L290 TraceCheckUtils]: 9: Hoare triple {6991#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6992#(<= main_~i~0 2)} is VALID [2022-04-28 02:47:53,388 INFO L290 TraceCheckUtils]: 10: Hoare triple {6992#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6992#(<= main_~i~0 2)} is VALID [2022-04-28 02:47:53,389 INFO L290 TraceCheckUtils]: 11: Hoare triple {6992#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6993#(<= main_~i~0 3)} is VALID [2022-04-28 02:47:53,389 INFO L290 TraceCheckUtils]: 12: Hoare triple {6993#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6993#(<= main_~i~0 3)} is VALID [2022-04-28 02:47:53,389 INFO L290 TraceCheckUtils]: 13: Hoare triple {6993#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6994#(<= main_~i~0 4)} is VALID [2022-04-28 02:47:53,389 INFO L290 TraceCheckUtils]: 14: Hoare triple {6994#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6994#(<= main_~i~0 4)} is VALID [2022-04-28 02:47:53,390 INFO L290 TraceCheckUtils]: 15: Hoare triple {6994#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6995#(<= main_~i~0 5)} is VALID [2022-04-28 02:47:53,390 INFO L290 TraceCheckUtils]: 16: Hoare triple {6995#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6995#(<= main_~i~0 5)} is VALID [2022-04-28 02:47:53,390 INFO L290 TraceCheckUtils]: 17: Hoare triple {6995#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6996#(<= main_~i~0 6)} is VALID [2022-04-28 02:47:53,391 INFO L290 TraceCheckUtils]: 18: Hoare triple {6996#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6996#(<= main_~i~0 6)} is VALID [2022-04-28 02:47:53,391 INFO L290 TraceCheckUtils]: 19: Hoare triple {6996#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6997#(<= main_~i~0 7)} is VALID [2022-04-28 02:47:53,391 INFO L290 TraceCheckUtils]: 20: Hoare triple {6997#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6997#(<= main_~i~0 7)} is VALID [2022-04-28 02:47:53,392 INFO L290 TraceCheckUtils]: 21: Hoare triple {6997#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6998#(<= main_~i~0 8)} is VALID [2022-04-28 02:47:53,392 INFO L290 TraceCheckUtils]: 22: Hoare triple {6998#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6998#(<= main_~i~0 8)} is VALID [2022-04-28 02:47:53,392 INFO L290 TraceCheckUtils]: 23: Hoare triple {6998#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6999#(<= main_~i~0 9)} is VALID [2022-04-28 02:47:53,393 INFO L290 TraceCheckUtils]: 24: Hoare triple {6999#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6999#(<= main_~i~0 9)} is VALID [2022-04-28 02:47:53,393 INFO L290 TraceCheckUtils]: 25: Hoare triple {6999#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7000#(<= main_~i~0 10)} is VALID [2022-04-28 02:47:53,393 INFO L290 TraceCheckUtils]: 26: Hoare triple {7000#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7000#(<= main_~i~0 10)} is VALID [2022-04-28 02:47:53,394 INFO L290 TraceCheckUtils]: 27: Hoare triple {7000#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7001#(<= main_~i~0 11)} is VALID [2022-04-28 02:47:53,394 INFO L290 TraceCheckUtils]: 28: Hoare triple {7001#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7001#(<= main_~i~0 11)} is VALID [2022-04-28 02:47:53,394 INFO L290 TraceCheckUtils]: 29: Hoare triple {7001#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7002#(<= main_~i~0 12)} is VALID [2022-04-28 02:47:53,394 INFO L290 TraceCheckUtils]: 30: Hoare triple {7002#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7002#(<= main_~i~0 12)} is VALID [2022-04-28 02:47:53,395 INFO L290 TraceCheckUtils]: 31: Hoare triple {7002#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7003#(<= main_~i~0 13)} is VALID [2022-04-28 02:47:53,395 INFO L290 TraceCheckUtils]: 32: Hoare triple {7003#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7003#(<= main_~i~0 13)} is VALID [2022-04-28 02:47:53,395 INFO L290 TraceCheckUtils]: 33: Hoare triple {7003#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7004#(<= main_~i~0 14)} is VALID [2022-04-28 02:47:53,396 INFO L290 TraceCheckUtils]: 34: Hoare triple {7004#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7004#(<= main_~i~0 14)} is VALID [2022-04-28 02:47:53,396 INFO L290 TraceCheckUtils]: 35: Hoare triple {7004#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7005#(<= main_~i~0 15)} is VALID [2022-04-28 02:47:53,396 INFO L290 TraceCheckUtils]: 36: Hoare triple {7005#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7005#(<= main_~i~0 15)} is VALID [2022-04-28 02:47:53,397 INFO L290 TraceCheckUtils]: 37: Hoare triple {7005#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7006#(<= main_~i~0 16)} is VALID [2022-04-28 02:47:53,397 INFO L290 TraceCheckUtils]: 38: Hoare triple {7006#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7006#(<= main_~i~0 16)} is VALID [2022-04-28 02:47:53,397 INFO L290 TraceCheckUtils]: 39: Hoare triple {7006#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7007#(<= main_~i~0 17)} is VALID [2022-04-28 02:47:53,398 INFO L290 TraceCheckUtils]: 40: Hoare triple {7007#(<= main_~i~0 17)} assume !(~i~0 < 1024); {6986#false} is VALID [2022-04-28 02:47:53,398 INFO L290 TraceCheckUtils]: 41: Hoare triple {6986#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {6986#false} is VALID [2022-04-28 02:47:53,398 INFO L272 TraceCheckUtils]: 42: Hoare triple {6986#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {6986#false} is VALID [2022-04-28 02:47:53,398 INFO L290 TraceCheckUtils]: 43: Hoare triple {6986#false} ~cond := #in~cond; {6986#false} is VALID [2022-04-28 02:47:53,398 INFO L290 TraceCheckUtils]: 44: Hoare triple {6986#false} assume 0 == ~cond; {6986#false} is VALID [2022-04-28 02:47:53,398 INFO L290 TraceCheckUtils]: 45: Hoare triple {6986#false} assume !false; {6986#false} is VALID [2022-04-28 02:47:53,398 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:47:53,398 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:47:53,970 INFO L290 TraceCheckUtils]: 45: Hoare triple {6986#false} assume !false; {6986#false} is VALID [2022-04-28 02:47:53,970 INFO L290 TraceCheckUtils]: 44: Hoare triple {6986#false} assume 0 == ~cond; {6986#false} is VALID [2022-04-28 02:47:53,970 INFO L290 TraceCheckUtils]: 43: Hoare triple {6986#false} ~cond := #in~cond; {6986#false} is VALID [2022-04-28 02:47:53,970 INFO L272 TraceCheckUtils]: 42: Hoare triple {6986#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {6986#false} is VALID [2022-04-28 02:47:53,970 INFO L290 TraceCheckUtils]: 41: Hoare triple {6986#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {6986#false} is VALID [2022-04-28 02:47:53,970 INFO L290 TraceCheckUtils]: 40: Hoare triple {7163#(< main_~i~0 1024)} assume !(~i~0 < 1024); {6986#false} is VALID [2022-04-28 02:47:53,971 INFO L290 TraceCheckUtils]: 39: Hoare triple {7167#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7163#(< main_~i~0 1024)} is VALID [2022-04-28 02:47:53,971 INFO L290 TraceCheckUtils]: 38: Hoare triple {7167#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7167#(< main_~i~0 1023)} is VALID [2022-04-28 02:47:53,971 INFO L290 TraceCheckUtils]: 37: Hoare triple {7174#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7167#(< main_~i~0 1023)} is VALID [2022-04-28 02:47:53,971 INFO L290 TraceCheckUtils]: 36: Hoare triple {7174#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7174#(< main_~i~0 1022)} is VALID [2022-04-28 02:47:53,972 INFO L290 TraceCheckUtils]: 35: Hoare triple {7181#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7174#(< main_~i~0 1022)} is VALID [2022-04-28 02:47:53,972 INFO L290 TraceCheckUtils]: 34: Hoare triple {7181#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7181#(< main_~i~0 1021)} is VALID [2022-04-28 02:47:53,972 INFO L290 TraceCheckUtils]: 33: Hoare triple {7188#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7181#(< main_~i~0 1021)} is VALID [2022-04-28 02:47:53,973 INFO L290 TraceCheckUtils]: 32: Hoare triple {7188#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7188#(< main_~i~0 1020)} is VALID [2022-04-28 02:47:53,973 INFO L290 TraceCheckUtils]: 31: Hoare triple {7195#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7188#(< main_~i~0 1020)} is VALID [2022-04-28 02:47:53,973 INFO L290 TraceCheckUtils]: 30: Hoare triple {7195#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7195#(< main_~i~0 1019)} is VALID [2022-04-28 02:47:53,974 INFO L290 TraceCheckUtils]: 29: Hoare triple {7202#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7195#(< main_~i~0 1019)} is VALID [2022-04-28 02:47:53,974 INFO L290 TraceCheckUtils]: 28: Hoare triple {7202#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7202#(< main_~i~0 1018)} is VALID [2022-04-28 02:47:53,974 INFO L290 TraceCheckUtils]: 27: Hoare triple {7209#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7202#(< main_~i~0 1018)} is VALID [2022-04-28 02:47:53,975 INFO L290 TraceCheckUtils]: 26: Hoare triple {7209#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7209#(< main_~i~0 1017)} is VALID [2022-04-28 02:47:53,975 INFO L290 TraceCheckUtils]: 25: Hoare triple {7216#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7209#(< main_~i~0 1017)} is VALID [2022-04-28 02:47:53,975 INFO L290 TraceCheckUtils]: 24: Hoare triple {7216#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7216#(< main_~i~0 1016)} is VALID [2022-04-28 02:47:53,976 INFO L290 TraceCheckUtils]: 23: Hoare triple {7223#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7216#(< main_~i~0 1016)} is VALID [2022-04-28 02:47:53,976 INFO L290 TraceCheckUtils]: 22: Hoare triple {7223#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7223#(< main_~i~0 1015)} is VALID [2022-04-28 02:47:53,976 INFO L290 TraceCheckUtils]: 21: Hoare triple {7230#(< main_~i~0 1014)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7223#(< main_~i~0 1015)} is VALID [2022-04-28 02:47:53,977 INFO L290 TraceCheckUtils]: 20: Hoare triple {7230#(< main_~i~0 1014)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7230#(< main_~i~0 1014)} is VALID [2022-04-28 02:47:53,977 INFO L290 TraceCheckUtils]: 19: Hoare triple {7237#(< main_~i~0 1013)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7230#(< main_~i~0 1014)} is VALID [2022-04-28 02:47:53,977 INFO L290 TraceCheckUtils]: 18: Hoare triple {7237#(< main_~i~0 1013)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7237#(< main_~i~0 1013)} is VALID [2022-04-28 02:47:53,977 INFO L290 TraceCheckUtils]: 17: Hoare triple {7244#(< main_~i~0 1012)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7237#(< main_~i~0 1013)} is VALID [2022-04-28 02:47:53,978 INFO L290 TraceCheckUtils]: 16: Hoare triple {7244#(< main_~i~0 1012)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7244#(< main_~i~0 1012)} is VALID [2022-04-28 02:47:53,978 INFO L290 TraceCheckUtils]: 15: Hoare triple {7251#(< main_~i~0 1011)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7244#(< main_~i~0 1012)} is VALID [2022-04-28 02:47:53,978 INFO L290 TraceCheckUtils]: 14: Hoare triple {7251#(< main_~i~0 1011)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7251#(< main_~i~0 1011)} is VALID [2022-04-28 02:47:53,979 INFO L290 TraceCheckUtils]: 13: Hoare triple {7258#(< main_~i~0 1010)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7251#(< main_~i~0 1011)} is VALID [2022-04-28 02:47:53,979 INFO L290 TraceCheckUtils]: 12: Hoare triple {7258#(< main_~i~0 1010)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7258#(< main_~i~0 1010)} is VALID [2022-04-28 02:47:53,982 INFO L290 TraceCheckUtils]: 11: Hoare triple {7265#(< main_~i~0 1009)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7258#(< main_~i~0 1010)} is VALID [2022-04-28 02:47:53,982 INFO L290 TraceCheckUtils]: 10: Hoare triple {7265#(< main_~i~0 1009)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7265#(< main_~i~0 1009)} is VALID [2022-04-28 02:47:53,983 INFO L290 TraceCheckUtils]: 9: Hoare triple {7272#(< main_~i~0 1008)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7265#(< main_~i~0 1009)} is VALID [2022-04-28 02:47:53,983 INFO L290 TraceCheckUtils]: 8: Hoare triple {7272#(< main_~i~0 1008)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7272#(< main_~i~0 1008)} is VALID [2022-04-28 02:47:53,983 INFO L290 TraceCheckUtils]: 7: Hoare triple {7279#(< main_~i~0 1007)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7272#(< main_~i~0 1008)} is VALID [2022-04-28 02:47:53,987 INFO L290 TraceCheckUtils]: 6: Hoare triple {7279#(< main_~i~0 1007)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7279#(< main_~i~0 1007)} is VALID [2022-04-28 02:47:53,988 INFO L290 TraceCheckUtils]: 5: Hoare triple {6985#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {7279#(< main_~i~0 1007)} is VALID [2022-04-28 02:47:53,988 INFO L272 TraceCheckUtils]: 4: Hoare triple {6985#true} call #t~ret6 := main(); {6985#true} is VALID [2022-04-28 02:47:53,988 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6985#true} {6985#true} #39#return; {6985#true} is VALID [2022-04-28 02:47:53,988 INFO L290 TraceCheckUtils]: 2: Hoare triple {6985#true} assume true; {6985#true} is VALID [2022-04-28 02:47:53,988 INFO L290 TraceCheckUtils]: 1: Hoare triple {6985#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {6985#true} is VALID [2022-04-28 02:47:53,988 INFO L272 TraceCheckUtils]: 0: Hoare triple {6985#true} call ULTIMATE.init(); {6985#true} is VALID [2022-04-28 02:47:53,988 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:47:53,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1075686920] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:47:53,989 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:47:53,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 40 [2022-04-28 02:47:53,989 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:47:53,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1391839089] [2022-04-28 02:47:53,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1391839089] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:47:53,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:47:53,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 02:47:53,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340801671] [2022-04-28 02:47:53,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:47:53,990 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.0) internal successors, (42), 20 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2022-04-28 02:47:53,990 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:47:53,990 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 2.0) internal successors, (42), 20 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:54,024 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:47:54,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 02:47:54,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:47:54,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 02:47:54,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=743, Invalid=817, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 02:47:54,026 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand has 21 states, 21 states have (on average 2.0) internal successors, (42), 20 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:54,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:47:54,440 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2022-04-28 02:47:54,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 02:47:54,441 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.0) internal successors, (42), 20 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2022-04-28 02:47:54,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:47:54,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 2.0) internal successors, (42), 20 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:54,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 56 transitions. [2022-04-28 02:47:54,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 2.0) internal successors, (42), 20 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:54,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 56 transitions. [2022-04-28 02:47:54,443 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 56 transitions. [2022-04-28 02:47:54,486 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:47:54,487 INFO L225 Difference]: With dead ends: 56 [2022-04-28 02:47:54,487 INFO L226 Difference]: Without dead ends: 50 [2022-04-28 02:47:54,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1446, Invalid=1860, Unknown=0, NotChecked=0, Total=3306 [2022-04-28 02:47:54,488 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 44 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:47:54,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 39 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:47:54,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-28 02:47:54,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2022-04-28 02:47:54,560 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:47:54,560 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:54,560 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:54,560 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:54,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:47:54,561 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2022-04-28 02:47:54,561 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2022-04-28 02:47:54,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:47:54,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:47:54,561 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 50 states. [2022-04-28 02:47:54,562 INFO L87 Difference]: Start difference. First operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 50 states. [2022-04-28 02:47:54,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:47:54,562 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2022-04-28 02:47:54,562 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2022-04-28 02:47:54,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:47:54,562 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:47:54,562 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:47:54,562 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:47:54,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:54,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2022-04-28 02:47:54,563 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 46 [2022-04-28 02:47:54,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:47:54,563 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2022-04-28 02:47:54,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.0) internal successors, (42), 20 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:54,563 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 49 transitions. [2022-04-28 02:47:54,603 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:47:54,603 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2022-04-28 02:47:54,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-28 02:47:54,603 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:47:54,603 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:47:54,619 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-28 02:47:54,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-28 02:47:54,804 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:47:54,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:47:54,804 INFO L85 PathProgramCache]: Analyzing trace with hash 790611230, now seen corresponding path program 35 times [2022-04-28 02:47:54,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:47:54,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1696391687] [2022-04-28 02:47:54,806 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:47:54,806 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:47:54,806 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:47:54,806 INFO L85 PathProgramCache]: Analyzing trace with hash 790611230, now seen corresponding path program 36 times [2022-04-28 02:47:54,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:47:54,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13516092] [2022-04-28 02:47:54,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:47:54,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:47:54,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:47:55,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:47:55,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:47:55,032 INFO L290 TraceCheckUtils]: 0: Hoare triple {7673#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {7649#true} is VALID [2022-04-28 02:47:55,032 INFO L290 TraceCheckUtils]: 1: Hoare triple {7649#true} assume true; {7649#true} is VALID [2022-04-28 02:47:55,032 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7649#true} {7649#true} #39#return; {7649#true} is VALID [2022-04-28 02:47:55,033 INFO L272 TraceCheckUtils]: 0: Hoare triple {7649#true} call ULTIMATE.init(); {7673#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:47:55,033 INFO L290 TraceCheckUtils]: 1: Hoare triple {7673#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {7649#true} is VALID [2022-04-28 02:47:55,033 INFO L290 TraceCheckUtils]: 2: Hoare triple {7649#true} assume true; {7649#true} is VALID [2022-04-28 02:47:55,033 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7649#true} {7649#true} #39#return; {7649#true} is VALID [2022-04-28 02:47:55,033 INFO L272 TraceCheckUtils]: 4: Hoare triple {7649#true} call #t~ret6 := main(); {7649#true} is VALID [2022-04-28 02:47:55,033 INFO L290 TraceCheckUtils]: 5: Hoare triple {7649#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {7654#(= main_~i~0 0)} is VALID [2022-04-28 02:47:55,034 INFO L290 TraceCheckUtils]: 6: Hoare triple {7654#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7654#(= main_~i~0 0)} is VALID [2022-04-28 02:47:55,034 INFO L290 TraceCheckUtils]: 7: Hoare triple {7654#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7655#(<= main_~i~0 1)} is VALID [2022-04-28 02:47:55,034 INFO L290 TraceCheckUtils]: 8: Hoare triple {7655#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7655#(<= main_~i~0 1)} is VALID [2022-04-28 02:47:55,035 INFO L290 TraceCheckUtils]: 9: Hoare triple {7655#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7656#(<= main_~i~0 2)} is VALID [2022-04-28 02:47:55,035 INFO L290 TraceCheckUtils]: 10: Hoare triple {7656#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7656#(<= main_~i~0 2)} is VALID [2022-04-28 02:47:55,036 INFO L290 TraceCheckUtils]: 11: Hoare triple {7656#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7657#(<= main_~i~0 3)} is VALID [2022-04-28 02:47:55,036 INFO L290 TraceCheckUtils]: 12: Hoare triple {7657#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7657#(<= main_~i~0 3)} is VALID [2022-04-28 02:47:55,037 INFO L290 TraceCheckUtils]: 13: Hoare triple {7657#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7658#(<= main_~i~0 4)} is VALID [2022-04-28 02:47:55,037 INFO L290 TraceCheckUtils]: 14: Hoare triple {7658#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7658#(<= main_~i~0 4)} is VALID [2022-04-28 02:47:55,037 INFO L290 TraceCheckUtils]: 15: Hoare triple {7658#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7659#(<= main_~i~0 5)} is VALID [2022-04-28 02:47:55,038 INFO L290 TraceCheckUtils]: 16: Hoare triple {7659#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7659#(<= main_~i~0 5)} is VALID [2022-04-28 02:47:55,038 INFO L290 TraceCheckUtils]: 17: Hoare triple {7659#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7660#(<= main_~i~0 6)} is VALID [2022-04-28 02:47:55,038 INFO L290 TraceCheckUtils]: 18: Hoare triple {7660#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7660#(<= main_~i~0 6)} is VALID [2022-04-28 02:47:55,039 INFO L290 TraceCheckUtils]: 19: Hoare triple {7660#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7661#(<= main_~i~0 7)} is VALID [2022-04-28 02:47:55,039 INFO L290 TraceCheckUtils]: 20: Hoare triple {7661#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7661#(<= main_~i~0 7)} is VALID [2022-04-28 02:47:55,040 INFO L290 TraceCheckUtils]: 21: Hoare triple {7661#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7662#(<= main_~i~0 8)} is VALID [2022-04-28 02:47:55,040 INFO L290 TraceCheckUtils]: 22: Hoare triple {7662#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7662#(<= main_~i~0 8)} is VALID [2022-04-28 02:47:55,040 INFO L290 TraceCheckUtils]: 23: Hoare triple {7662#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7663#(<= main_~i~0 9)} is VALID [2022-04-28 02:47:55,041 INFO L290 TraceCheckUtils]: 24: Hoare triple {7663#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7663#(<= main_~i~0 9)} is VALID [2022-04-28 02:47:55,041 INFO L290 TraceCheckUtils]: 25: Hoare triple {7663#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7664#(<= main_~i~0 10)} is VALID [2022-04-28 02:47:55,042 INFO L290 TraceCheckUtils]: 26: Hoare triple {7664#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7664#(<= main_~i~0 10)} is VALID [2022-04-28 02:47:55,042 INFO L290 TraceCheckUtils]: 27: Hoare triple {7664#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7665#(<= main_~i~0 11)} is VALID [2022-04-28 02:47:55,042 INFO L290 TraceCheckUtils]: 28: Hoare triple {7665#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7665#(<= main_~i~0 11)} is VALID [2022-04-28 02:47:55,043 INFO L290 TraceCheckUtils]: 29: Hoare triple {7665#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7666#(<= main_~i~0 12)} is VALID [2022-04-28 02:47:55,043 INFO L290 TraceCheckUtils]: 30: Hoare triple {7666#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7666#(<= main_~i~0 12)} is VALID [2022-04-28 02:47:55,044 INFO L290 TraceCheckUtils]: 31: Hoare triple {7666#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7667#(<= main_~i~0 13)} is VALID [2022-04-28 02:47:55,044 INFO L290 TraceCheckUtils]: 32: Hoare triple {7667#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7667#(<= main_~i~0 13)} is VALID [2022-04-28 02:47:55,044 INFO L290 TraceCheckUtils]: 33: Hoare triple {7667#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7668#(<= main_~i~0 14)} is VALID [2022-04-28 02:47:55,045 INFO L290 TraceCheckUtils]: 34: Hoare triple {7668#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7668#(<= main_~i~0 14)} is VALID [2022-04-28 02:47:55,045 INFO L290 TraceCheckUtils]: 35: Hoare triple {7668#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7669#(<= main_~i~0 15)} is VALID [2022-04-28 02:47:55,045 INFO L290 TraceCheckUtils]: 36: Hoare triple {7669#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7669#(<= main_~i~0 15)} is VALID [2022-04-28 02:47:55,046 INFO L290 TraceCheckUtils]: 37: Hoare triple {7669#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7670#(<= main_~i~0 16)} is VALID [2022-04-28 02:47:55,046 INFO L290 TraceCheckUtils]: 38: Hoare triple {7670#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7670#(<= main_~i~0 16)} is VALID [2022-04-28 02:47:55,047 INFO L290 TraceCheckUtils]: 39: Hoare triple {7670#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7671#(<= main_~i~0 17)} is VALID [2022-04-28 02:47:55,047 INFO L290 TraceCheckUtils]: 40: Hoare triple {7671#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7671#(<= main_~i~0 17)} is VALID [2022-04-28 02:47:55,048 INFO L290 TraceCheckUtils]: 41: Hoare triple {7671#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7672#(<= main_~i~0 18)} is VALID [2022-04-28 02:47:55,048 INFO L290 TraceCheckUtils]: 42: Hoare triple {7672#(<= main_~i~0 18)} assume !(~i~0 < 1024); {7650#false} is VALID [2022-04-28 02:47:55,048 INFO L290 TraceCheckUtils]: 43: Hoare triple {7650#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {7650#false} is VALID [2022-04-28 02:47:55,048 INFO L272 TraceCheckUtils]: 44: Hoare triple {7650#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {7650#false} is VALID [2022-04-28 02:47:55,048 INFO L290 TraceCheckUtils]: 45: Hoare triple {7650#false} ~cond := #in~cond; {7650#false} is VALID [2022-04-28 02:47:55,048 INFO L290 TraceCheckUtils]: 46: Hoare triple {7650#false} assume 0 == ~cond; {7650#false} is VALID [2022-04-28 02:47:55,048 INFO L290 TraceCheckUtils]: 47: Hoare triple {7650#false} assume !false; {7650#false} is VALID [2022-04-28 02:47:55,049 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:47:55,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:47:55,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13516092] [2022-04-28 02:47:55,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13516092] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:47:55,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767599705] [2022-04-28 02:47:55,049 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 02:47:55,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:47:55,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:47:55,052 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:47:55,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-28 02:47:55,400 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2022-04-28 02:47:55,400 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:47:55,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 02:47:55,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:47:55,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:47:55,670 INFO L272 TraceCheckUtils]: 0: Hoare triple {7649#true} call ULTIMATE.init(); {7649#true} is VALID [2022-04-28 02:47:55,670 INFO L290 TraceCheckUtils]: 1: Hoare triple {7649#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {7649#true} is VALID [2022-04-28 02:47:55,670 INFO L290 TraceCheckUtils]: 2: Hoare triple {7649#true} assume true; {7649#true} is VALID [2022-04-28 02:47:55,670 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7649#true} {7649#true} #39#return; {7649#true} is VALID [2022-04-28 02:47:55,671 INFO L272 TraceCheckUtils]: 4: Hoare triple {7649#true} call #t~ret6 := main(); {7649#true} is VALID [2022-04-28 02:47:55,671 INFO L290 TraceCheckUtils]: 5: Hoare triple {7649#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {7692#(<= main_~i~0 0)} is VALID [2022-04-28 02:47:55,671 INFO L290 TraceCheckUtils]: 6: Hoare triple {7692#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7692#(<= main_~i~0 0)} is VALID [2022-04-28 02:47:55,672 INFO L290 TraceCheckUtils]: 7: Hoare triple {7692#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7655#(<= main_~i~0 1)} is VALID [2022-04-28 02:47:55,672 INFO L290 TraceCheckUtils]: 8: Hoare triple {7655#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7655#(<= main_~i~0 1)} is VALID [2022-04-28 02:47:55,672 INFO L290 TraceCheckUtils]: 9: Hoare triple {7655#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7656#(<= main_~i~0 2)} is VALID [2022-04-28 02:47:55,672 INFO L290 TraceCheckUtils]: 10: Hoare triple {7656#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7656#(<= main_~i~0 2)} is VALID [2022-04-28 02:47:55,673 INFO L290 TraceCheckUtils]: 11: Hoare triple {7656#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7657#(<= main_~i~0 3)} is VALID [2022-04-28 02:47:55,673 INFO L290 TraceCheckUtils]: 12: Hoare triple {7657#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7657#(<= main_~i~0 3)} is VALID [2022-04-28 02:47:55,673 INFO L290 TraceCheckUtils]: 13: Hoare triple {7657#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7658#(<= main_~i~0 4)} is VALID [2022-04-28 02:47:55,674 INFO L290 TraceCheckUtils]: 14: Hoare triple {7658#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7658#(<= main_~i~0 4)} is VALID [2022-04-28 02:47:55,674 INFO L290 TraceCheckUtils]: 15: Hoare triple {7658#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7659#(<= main_~i~0 5)} is VALID [2022-04-28 02:47:55,674 INFO L290 TraceCheckUtils]: 16: Hoare triple {7659#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7659#(<= main_~i~0 5)} is VALID [2022-04-28 02:47:55,675 INFO L290 TraceCheckUtils]: 17: Hoare triple {7659#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7660#(<= main_~i~0 6)} is VALID [2022-04-28 02:47:55,675 INFO L290 TraceCheckUtils]: 18: Hoare triple {7660#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7660#(<= main_~i~0 6)} is VALID [2022-04-28 02:47:55,675 INFO L290 TraceCheckUtils]: 19: Hoare triple {7660#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7661#(<= main_~i~0 7)} is VALID [2022-04-28 02:47:55,676 INFO L290 TraceCheckUtils]: 20: Hoare triple {7661#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7661#(<= main_~i~0 7)} is VALID [2022-04-28 02:47:55,676 INFO L290 TraceCheckUtils]: 21: Hoare triple {7661#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7662#(<= main_~i~0 8)} is VALID [2022-04-28 02:47:55,676 INFO L290 TraceCheckUtils]: 22: Hoare triple {7662#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7662#(<= main_~i~0 8)} is VALID [2022-04-28 02:47:55,677 INFO L290 TraceCheckUtils]: 23: Hoare triple {7662#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7663#(<= main_~i~0 9)} is VALID [2022-04-28 02:47:55,677 INFO L290 TraceCheckUtils]: 24: Hoare triple {7663#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7663#(<= main_~i~0 9)} is VALID [2022-04-28 02:47:55,677 INFO L290 TraceCheckUtils]: 25: Hoare triple {7663#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7664#(<= main_~i~0 10)} is VALID [2022-04-28 02:47:55,678 INFO L290 TraceCheckUtils]: 26: Hoare triple {7664#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7664#(<= main_~i~0 10)} is VALID [2022-04-28 02:47:55,678 INFO L290 TraceCheckUtils]: 27: Hoare triple {7664#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7665#(<= main_~i~0 11)} is VALID [2022-04-28 02:47:55,678 INFO L290 TraceCheckUtils]: 28: Hoare triple {7665#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7665#(<= main_~i~0 11)} is VALID [2022-04-28 02:47:55,679 INFO L290 TraceCheckUtils]: 29: Hoare triple {7665#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7666#(<= main_~i~0 12)} is VALID [2022-04-28 02:47:55,679 INFO L290 TraceCheckUtils]: 30: Hoare triple {7666#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7666#(<= main_~i~0 12)} is VALID [2022-04-28 02:47:55,679 INFO L290 TraceCheckUtils]: 31: Hoare triple {7666#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7667#(<= main_~i~0 13)} is VALID [2022-04-28 02:47:55,679 INFO L290 TraceCheckUtils]: 32: Hoare triple {7667#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7667#(<= main_~i~0 13)} is VALID [2022-04-28 02:47:55,680 INFO L290 TraceCheckUtils]: 33: Hoare triple {7667#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7668#(<= main_~i~0 14)} is VALID [2022-04-28 02:47:55,680 INFO L290 TraceCheckUtils]: 34: Hoare triple {7668#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7668#(<= main_~i~0 14)} is VALID [2022-04-28 02:47:55,680 INFO L290 TraceCheckUtils]: 35: Hoare triple {7668#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7669#(<= main_~i~0 15)} is VALID [2022-04-28 02:47:55,681 INFO L290 TraceCheckUtils]: 36: Hoare triple {7669#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7669#(<= main_~i~0 15)} is VALID [2022-04-28 02:47:55,681 INFO L290 TraceCheckUtils]: 37: Hoare triple {7669#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7670#(<= main_~i~0 16)} is VALID [2022-04-28 02:47:55,681 INFO L290 TraceCheckUtils]: 38: Hoare triple {7670#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7670#(<= main_~i~0 16)} is VALID [2022-04-28 02:47:55,682 INFO L290 TraceCheckUtils]: 39: Hoare triple {7670#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7671#(<= main_~i~0 17)} is VALID [2022-04-28 02:47:55,682 INFO L290 TraceCheckUtils]: 40: Hoare triple {7671#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7671#(<= main_~i~0 17)} is VALID [2022-04-28 02:47:55,682 INFO L290 TraceCheckUtils]: 41: Hoare triple {7671#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7672#(<= main_~i~0 18)} is VALID [2022-04-28 02:47:55,683 INFO L290 TraceCheckUtils]: 42: Hoare triple {7672#(<= main_~i~0 18)} assume !(~i~0 < 1024); {7650#false} is VALID [2022-04-28 02:47:55,683 INFO L290 TraceCheckUtils]: 43: Hoare triple {7650#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {7650#false} is VALID [2022-04-28 02:47:55,683 INFO L272 TraceCheckUtils]: 44: Hoare triple {7650#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {7650#false} is VALID [2022-04-28 02:47:55,683 INFO L290 TraceCheckUtils]: 45: Hoare triple {7650#false} ~cond := #in~cond; {7650#false} is VALID [2022-04-28 02:47:55,683 INFO L290 TraceCheckUtils]: 46: Hoare triple {7650#false} assume 0 == ~cond; {7650#false} is VALID [2022-04-28 02:47:55,683 INFO L290 TraceCheckUtils]: 47: Hoare triple {7650#false} assume !false; {7650#false} is VALID [2022-04-28 02:47:55,683 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:47:55,683 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:47:56,286 INFO L290 TraceCheckUtils]: 47: Hoare triple {7650#false} assume !false; {7650#false} is VALID [2022-04-28 02:47:56,286 INFO L290 TraceCheckUtils]: 46: Hoare triple {7650#false} assume 0 == ~cond; {7650#false} is VALID [2022-04-28 02:47:56,286 INFO L290 TraceCheckUtils]: 45: Hoare triple {7650#false} ~cond := #in~cond; {7650#false} is VALID [2022-04-28 02:47:56,286 INFO L272 TraceCheckUtils]: 44: Hoare triple {7650#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {7650#false} is VALID [2022-04-28 02:47:56,286 INFO L290 TraceCheckUtils]: 43: Hoare triple {7650#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {7650#false} is VALID [2022-04-28 02:47:56,287 INFO L290 TraceCheckUtils]: 42: Hoare triple {7834#(< main_~i~0 1024)} assume !(~i~0 < 1024); {7650#false} is VALID [2022-04-28 02:47:56,287 INFO L290 TraceCheckUtils]: 41: Hoare triple {7838#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7834#(< main_~i~0 1024)} is VALID [2022-04-28 02:47:56,287 INFO L290 TraceCheckUtils]: 40: Hoare triple {7838#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7838#(< main_~i~0 1023)} is VALID [2022-04-28 02:47:56,288 INFO L290 TraceCheckUtils]: 39: Hoare triple {7845#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7838#(< main_~i~0 1023)} is VALID [2022-04-28 02:47:56,288 INFO L290 TraceCheckUtils]: 38: Hoare triple {7845#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7845#(< main_~i~0 1022)} is VALID [2022-04-28 02:47:56,288 INFO L290 TraceCheckUtils]: 37: Hoare triple {7852#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7845#(< main_~i~0 1022)} is VALID [2022-04-28 02:47:56,289 INFO L290 TraceCheckUtils]: 36: Hoare triple {7852#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7852#(< main_~i~0 1021)} is VALID [2022-04-28 02:47:56,289 INFO L290 TraceCheckUtils]: 35: Hoare triple {7859#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7852#(< main_~i~0 1021)} is VALID [2022-04-28 02:47:56,289 INFO L290 TraceCheckUtils]: 34: Hoare triple {7859#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7859#(< main_~i~0 1020)} is VALID [2022-04-28 02:47:56,289 INFO L290 TraceCheckUtils]: 33: Hoare triple {7866#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7859#(< main_~i~0 1020)} is VALID [2022-04-28 02:47:56,290 INFO L290 TraceCheckUtils]: 32: Hoare triple {7866#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7866#(< main_~i~0 1019)} is VALID [2022-04-28 02:47:56,290 INFO L290 TraceCheckUtils]: 31: Hoare triple {7873#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7866#(< main_~i~0 1019)} is VALID [2022-04-28 02:47:56,290 INFO L290 TraceCheckUtils]: 30: Hoare triple {7873#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7873#(< main_~i~0 1018)} is VALID [2022-04-28 02:47:56,291 INFO L290 TraceCheckUtils]: 29: Hoare triple {7880#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7873#(< main_~i~0 1018)} is VALID [2022-04-28 02:47:56,291 INFO L290 TraceCheckUtils]: 28: Hoare triple {7880#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7880#(< main_~i~0 1017)} is VALID [2022-04-28 02:47:56,291 INFO L290 TraceCheckUtils]: 27: Hoare triple {7887#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7880#(< main_~i~0 1017)} is VALID [2022-04-28 02:47:56,292 INFO L290 TraceCheckUtils]: 26: Hoare triple {7887#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7887#(< main_~i~0 1016)} is VALID [2022-04-28 02:47:56,292 INFO L290 TraceCheckUtils]: 25: Hoare triple {7894#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7887#(< main_~i~0 1016)} is VALID [2022-04-28 02:47:56,292 INFO L290 TraceCheckUtils]: 24: Hoare triple {7894#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7894#(< main_~i~0 1015)} is VALID [2022-04-28 02:47:56,293 INFO L290 TraceCheckUtils]: 23: Hoare triple {7901#(< main_~i~0 1014)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7894#(< main_~i~0 1015)} is VALID [2022-04-28 02:47:56,293 INFO L290 TraceCheckUtils]: 22: Hoare triple {7901#(< main_~i~0 1014)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7901#(< main_~i~0 1014)} is VALID [2022-04-28 02:47:56,293 INFO L290 TraceCheckUtils]: 21: Hoare triple {7908#(< main_~i~0 1013)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7901#(< main_~i~0 1014)} is VALID [2022-04-28 02:47:56,294 INFO L290 TraceCheckUtils]: 20: Hoare triple {7908#(< main_~i~0 1013)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7908#(< main_~i~0 1013)} is VALID [2022-04-28 02:47:56,294 INFO L290 TraceCheckUtils]: 19: Hoare triple {7915#(< main_~i~0 1012)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7908#(< main_~i~0 1013)} is VALID [2022-04-28 02:47:56,294 INFO L290 TraceCheckUtils]: 18: Hoare triple {7915#(< main_~i~0 1012)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7915#(< main_~i~0 1012)} is VALID [2022-04-28 02:47:56,295 INFO L290 TraceCheckUtils]: 17: Hoare triple {7922#(< main_~i~0 1011)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7915#(< main_~i~0 1012)} is VALID [2022-04-28 02:47:56,295 INFO L290 TraceCheckUtils]: 16: Hoare triple {7922#(< main_~i~0 1011)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7922#(< main_~i~0 1011)} is VALID [2022-04-28 02:47:56,295 INFO L290 TraceCheckUtils]: 15: Hoare triple {7929#(< main_~i~0 1010)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7922#(< main_~i~0 1011)} is VALID [2022-04-28 02:47:56,295 INFO L290 TraceCheckUtils]: 14: Hoare triple {7929#(< main_~i~0 1010)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7929#(< main_~i~0 1010)} is VALID [2022-04-28 02:47:56,296 INFO L290 TraceCheckUtils]: 13: Hoare triple {7936#(< main_~i~0 1009)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7929#(< main_~i~0 1010)} is VALID [2022-04-28 02:47:56,296 INFO L290 TraceCheckUtils]: 12: Hoare triple {7936#(< main_~i~0 1009)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7936#(< main_~i~0 1009)} is VALID [2022-04-28 02:47:56,296 INFO L290 TraceCheckUtils]: 11: Hoare triple {7943#(< main_~i~0 1008)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7936#(< main_~i~0 1009)} is VALID [2022-04-28 02:47:56,297 INFO L290 TraceCheckUtils]: 10: Hoare triple {7943#(< main_~i~0 1008)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7943#(< main_~i~0 1008)} is VALID [2022-04-28 02:47:56,297 INFO L290 TraceCheckUtils]: 9: Hoare triple {7950#(< main_~i~0 1007)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7943#(< main_~i~0 1008)} is VALID [2022-04-28 02:47:56,297 INFO L290 TraceCheckUtils]: 8: Hoare triple {7950#(< main_~i~0 1007)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7950#(< main_~i~0 1007)} is VALID [2022-04-28 02:47:56,298 INFO L290 TraceCheckUtils]: 7: Hoare triple {7957#(< main_~i~0 1006)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7950#(< main_~i~0 1007)} is VALID [2022-04-28 02:47:56,298 INFO L290 TraceCheckUtils]: 6: Hoare triple {7957#(< main_~i~0 1006)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7957#(< main_~i~0 1006)} is VALID [2022-04-28 02:47:56,298 INFO L290 TraceCheckUtils]: 5: Hoare triple {7649#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {7957#(< main_~i~0 1006)} is VALID [2022-04-28 02:47:56,298 INFO L272 TraceCheckUtils]: 4: Hoare triple {7649#true} call #t~ret6 := main(); {7649#true} is VALID [2022-04-28 02:47:56,298 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7649#true} {7649#true} #39#return; {7649#true} is VALID [2022-04-28 02:47:56,299 INFO L290 TraceCheckUtils]: 2: Hoare triple {7649#true} assume true; {7649#true} is VALID [2022-04-28 02:47:56,299 INFO L290 TraceCheckUtils]: 1: Hoare triple {7649#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {7649#true} is VALID [2022-04-28 02:47:56,299 INFO L272 TraceCheckUtils]: 0: Hoare triple {7649#true} call ULTIMATE.init(); {7649#true} is VALID [2022-04-28 02:47:56,299 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:47:56,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [767599705] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:47:56,299 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:47:56,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 42 [2022-04-28 02:47:56,299 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:47:56,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1696391687] [2022-04-28 02:47:56,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1696391687] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:47:56,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:47:56,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-28 02:47:56,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653586902] [2022-04-28 02:47:56,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:47:56,300 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.0) internal successors, (44), 21 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-04-28 02:47:56,300 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:47:56,300 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 2.0) internal successors, (44), 21 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:56,331 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:47:56,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-28 02:47:56,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:47:56,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-28 02:47:56,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=822, Invalid=900, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 02:47:56,332 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand has 22 states, 22 states have (on average 2.0) internal successors, (44), 21 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:56,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:47:56,832 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2022-04-28 02:47:56,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-28 02:47:56,833 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.0) internal successors, (44), 21 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-04-28 02:47:56,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:47:56,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.0) internal successors, (44), 21 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:56,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 58 transitions. [2022-04-28 02:47:56,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.0) internal successors, (44), 21 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:56,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 58 transitions. [2022-04-28 02:47:56,835 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 58 transitions. [2022-04-28 02:47:56,886 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:47:56,886 INFO L225 Difference]: With dead ends: 58 [2022-04-28 02:47:56,886 INFO L226 Difference]: Without dead ends: 52 [2022-04-28 02:47:56,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 78 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-28 02:47:56,888 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 46 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:47:56,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 39 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:47:56,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-28 02:47:57,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2022-04-28 02:47:57,001 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:47:57,001 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:57,001 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:57,001 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:57,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:47:57,002 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2022-04-28 02:47:57,002 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2022-04-28 02:47:57,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:47:57,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:47:57,002 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 52 states. [2022-04-28 02:47:57,003 INFO L87 Difference]: Start difference. First operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 52 states. [2022-04-28 02:47:57,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:47:57,003 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2022-04-28 02:47:57,003 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2022-04-28 02:47:57,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:47:57,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:47:57,004 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:47:57,004 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:47:57,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:57,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2022-04-28 02:47:57,005 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 48 [2022-04-28 02:47:57,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:47:57,005 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2022-04-28 02:47:57,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.0) internal successors, (44), 21 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:57,005 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 51 transitions. [2022-04-28 02:47:57,055 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:47:57,055 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2022-04-28 02:47:57,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-28 02:47:57,055 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:47:57,055 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:47:57,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-28 02:47:57,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:47:57,256 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:47:57,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:47:57,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1305906912, now seen corresponding path program 37 times [2022-04-28 02:47:57,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:47:57,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [677895513] [2022-04-28 02:47:57,258 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:47:57,258 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:47:57,258 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:47:57,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1305906912, now seen corresponding path program 38 times [2022-04-28 02:47:57,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:47:57,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607991302] [2022-04-28 02:47:57,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:47:57,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:47:57,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:47:57,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:47:57,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:47:57,532 INFO L290 TraceCheckUtils]: 0: Hoare triple {8366#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {8341#true} is VALID [2022-04-28 02:47:57,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {8341#true} assume true; {8341#true} is VALID [2022-04-28 02:47:57,532 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8341#true} {8341#true} #39#return; {8341#true} is VALID [2022-04-28 02:47:57,533 INFO L272 TraceCheckUtils]: 0: Hoare triple {8341#true} call ULTIMATE.init(); {8366#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:47:57,533 INFO L290 TraceCheckUtils]: 1: Hoare triple {8366#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {8341#true} is VALID [2022-04-28 02:47:57,533 INFO L290 TraceCheckUtils]: 2: Hoare triple {8341#true} assume true; {8341#true} is VALID [2022-04-28 02:47:57,533 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8341#true} {8341#true} #39#return; {8341#true} is VALID [2022-04-28 02:47:57,533 INFO L272 TraceCheckUtils]: 4: Hoare triple {8341#true} call #t~ret6 := main(); {8341#true} is VALID [2022-04-28 02:47:57,534 INFO L290 TraceCheckUtils]: 5: Hoare triple {8341#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {8346#(= main_~i~0 0)} is VALID [2022-04-28 02:47:57,534 INFO L290 TraceCheckUtils]: 6: Hoare triple {8346#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8346#(= main_~i~0 0)} is VALID [2022-04-28 02:47:57,534 INFO L290 TraceCheckUtils]: 7: Hoare triple {8346#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8347#(<= main_~i~0 1)} is VALID [2022-04-28 02:47:57,535 INFO L290 TraceCheckUtils]: 8: Hoare triple {8347#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8347#(<= main_~i~0 1)} is VALID [2022-04-28 02:47:57,535 INFO L290 TraceCheckUtils]: 9: Hoare triple {8347#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8348#(<= main_~i~0 2)} is VALID [2022-04-28 02:47:57,535 INFO L290 TraceCheckUtils]: 10: Hoare triple {8348#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8348#(<= main_~i~0 2)} is VALID [2022-04-28 02:47:57,536 INFO L290 TraceCheckUtils]: 11: Hoare triple {8348#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8349#(<= main_~i~0 3)} is VALID [2022-04-28 02:47:57,536 INFO L290 TraceCheckUtils]: 12: Hoare triple {8349#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8349#(<= main_~i~0 3)} is VALID [2022-04-28 02:47:57,537 INFO L290 TraceCheckUtils]: 13: Hoare triple {8349#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8350#(<= main_~i~0 4)} is VALID [2022-04-28 02:47:57,537 INFO L290 TraceCheckUtils]: 14: Hoare triple {8350#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8350#(<= main_~i~0 4)} is VALID [2022-04-28 02:47:57,537 INFO L290 TraceCheckUtils]: 15: Hoare triple {8350#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8351#(<= main_~i~0 5)} is VALID [2022-04-28 02:47:57,538 INFO L290 TraceCheckUtils]: 16: Hoare triple {8351#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8351#(<= main_~i~0 5)} is VALID [2022-04-28 02:47:57,538 INFO L290 TraceCheckUtils]: 17: Hoare triple {8351#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8352#(<= main_~i~0 6)} is VALID [2022-04-28 02:47:57,538 INFO L290 TraceCheckUtils]: 18: Hoare triple {8352#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8352#(<= main_~i~0 6)} is VALID [2022-04-28 02:47:57,539 INFO L290 TraceCheckUtils]: 19: Hoare triple {8352#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8353#(<= main_~i~0 7)} is VALID [2022-04-28 02:47:57,539 INFO L290 TraceCheckUtils]: 20: Hoare triple {8353#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8353#(<= main_~i~0 7)} is VALID [2022-04-28 02:47:57,540 INFO L290 TraceCheckUtils]: 21: Hoare triple {8353#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8354#(<= main_~i~0 8)} is VALID [2022-04-28 02:47:57,540 INFO L290 TraceCheckUtils]: 22: Hoare triple {8354#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8354#(<= main_~i~0 8)} is VALID [2022-04-28 02:47:57,540 INFO L290 TraceCheckUtils]: 23: Hoare triple {8354#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8355#(<= main_~i~0 9)} is VALID [2022-04-28 02:47:57,541 INFO L290 TraceCheckUtils]: 24: Hoare triple {8355#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8355#(<= main_~i~0 9)} is VALID [2022-04-28 02:47:57,541 INFO L290 TraceCheckUtils]: 25: Hoare triple {8355#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8356#(<= main_~i~0 10)} is VALID [2022-04-28 02:47:57,542 INFO L290 TraceCheckUtils]: 26: Hoare triple {8356#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8356#(<= main_~i~0 10)} is VALID [2022-04-28 02:47:57,542 INFO L290 TraceCheckUtils]: 27: Hoare triple {8356#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8357#(<= main_~i~0 11)} is VALID [2022-04-28 02:47:57,542 INFO L290 TraceCheckUtils]: 28: Hoare triple {8357#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8357#(<= main_~i~0 11)} is VALID [2022-04-28 02:47:57,543 INFO L290 TraceCheckUtils]: 29: Hoare triple {8357#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8358#(<= main_~i~0 12)} is VALID [2022-04-28 02:47:57,543 INFO L290 TraceCheckUtils]: 30: Hoare triple {8358#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8358#(<= main_~i~0 12)} is VALID [2022-04-28 02:47:57,544 INFO L290 TraceCheckUtils]: 31: Hoare triple {8358#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8359#(<= main_~i~0 13)} is VALID [2022-04-28 02:47:57,544 INFO L290 TraceCheckUtils]: 32: Hoare triple {8359#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8359#(<= main_~i~0 13)} is VALID [2022-04-28 02:47:57,544 INFO L290 TraceCheckUtils]: 33: Hoare triple {8359#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8360#(<= main_~i~0 14)} is VALID [2022-04-28 02:47:57,545 INFO L290 TraceCheckUtils]: 34: Hoare triple {8360#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8360#(<= main_~i~0 14)} is VALID [2022-04-28 02:47:57,545 INFO L290 TraceCheckUtils]: 35: Hoare triple {8360#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8361#(<= main_~i~0 15)} is VALID [2022-04-28 02:47:57,545 INFO L290 TraceCheckUtils]: 36: Hoare triple {8361#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8361#(<= main_~i~0 15)} is VALID [2022-04-28 02:47:57,546 INFO L290 TraceCheckUtils]: 37: Hoare triple {8361#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8362#(<= main_~i~0 16)} is VALID [2022-04-28 02:47:57,546 INFO L290 TraceCheckUtils]: 38: Hoare triple {8362#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8362#(<= main_~i~0 16)} is VALID [2022-04-28 02:47:57,546 INFO L290 TraceCheckUtils]: 39: Hoare triple {8362#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8363#(<= main_~i~0 17)} is VALID [2022-04-28 02:47:57,547 INFO L290 TraceCheckUtils]: 40: Hoare triple {8363#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8363#(<= main_~i~0 17)} is VALID [2022-04-28 02:47:57,547 INFO L290 TraceCheckUtils]: 41: Hoare triple {8363#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8364#(<= main_~i~0 18)} is VALID [2022-04-28 02:47:57,547 INFO L290 TraceCheckUtils]: 42: Hoare triple {8364#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8364#(<= main_~i~0 18)} is VALID [2022-04-28 02:47:57,548 INFO L290 TraceCheckUtils]: 43: Hoare triple {8364#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8365#(<= main_~i~0 19)} is VALID [2022-04-28 02:47:57,548 INFO L290 TraceCheckUtils]: 44: Hoare triple {8365#(<= main_~i~0 19)} assume !(~i~0 < 1024); {8342#false} is VALID [2022-04-28 02:47:57,548 INFO L290 TraceCheckUtils]: 45: Hoare triple {8342#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {8342#false} is VALID [2022-04-28 02:47:57,548 INFO L272 TraceCheckUtils]: 46: Hoare triple {8342#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {8342#false} is VALID [2022-04-28 02:47:57,548 INFO L290 TraceCheckUtils]: 47: Hoare triple {8342#false} ~cond := #in~cond; {8342#false} is VALID [2022-04-28 02:47:57,548 INFO L290 TraceCheckUtils]: 48: Hoare triple {8342#false} assume 0 == ~cond; {8342#false} is VALID [2022-04-28 02:47:57,548 INFO L290 TraceCheckUtils]: 49: Hoare triple {8342#false} assume !false; {8342#false} is VALID [2022-04-28 02:47:57,549 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:47:57,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:47:57,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607991302] [2022-04-28 02:47:57,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607991302] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:47:57,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1094801153] [2022-04-28 02:47:57,549 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:47:57,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:47:57,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:47:57,550 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:47:57,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-28 02:47:57,630 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:47:57,630 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:47:57,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 02:47:57,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:47:57,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:47:57,906 INFO L272 TraceCheckUtils]: 0: Hoare triple {8341#true} call ULTIMATE.init(); {8341#true} is VALID [2022-04-28 02:47:57,907 INFO L290 TraceCheckUtils]: 1: Hoare triple {8341#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {8341#true} is VALID [2022-04-28 02:47:57,907 INFO L290 TraceCheckUtils]: 2: Hoare triple {8341#true} assume true; {8341#true} is VALID [2022-04-28 02:47:57,907 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8341#true} {8341#true} #39#return; {8341#true} is VALID [2022-04-28 02:47:57,907 INFO L272 TraceCheckUtils]: 4: Hoare triple {8341#true} call #t~ret6 := main(); {8341#true} is VALID [2022-04-28 02:47:57,907 INFO L290 TraceCheckUtils]: 5: Hoare triple {8341#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {8385#(<= main_~i~0 0)} is VALID [2022-04-28 02:47:57,908 INFO L290 TraceCheckUtils]: 6: Hoare triple {8385#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8385#(<= main_~i~0 0)} is VALID [2022-04-28 02:47:57,908 INFO L290 TraceCheckUtils]: 7: Hoare triple {8385#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8347#(<= main_~i~0 1)} is VALID [2022-04-28 02:47:57,908 INFO L290 TraceCheckUtils]: 8: Hoare triple {8347#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8347#(<= main_~i~0 1)} is VALID [2022-04-28 02:47:57,909 INFO L290 TraceCheckUtils]: 9: Hoare triple {8347#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8348#(<= main_~i~0 2)} is VALID [2022-04-28 02:47:57,909 INFO L290 TraceCheckUtils]: 10: Hoare triple {8348#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8348#(<= main_~i~0 2)} is VALID [2022-04-28 02:47:57,909 INFO L290 TraceCheckUtils]: 11: Hoare triple {8348#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8349#(<= main_~i~0 3)} is VALID [2022-04-28 02:47:57,909 INFO L290 TraceCheckUtils]: 12: Hoare triple {8349#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8349#(<= main_~i~0 3)} is VALID [2022-04-28 02:47:57,910 INFO L290 TraceCheckUtils]: 13: Hoare triple {8349#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8350#(<= main_~i~0 4)} is VALID [2022-04-28 02:47:57,910 INFO L290 TraceCheckUtils]: 14: Hoare triple {8350#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8350#(<= main_~i~0 4)} is VALID [2022-04-28 02:47:57,910 INFO L290 TraceCheckUtils]: 15: Hoare triple {8350#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8351#(<= main_~i~0 5)} is VALID [2022-04-28 02:47:57,911 INFO L290 TraceCheckUtils]: 16: Hoare triple {8351#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8351#(<= main_~i~0 5)} is VALID [2022-04-28 02:47:57,911 INFO L290 TraceCheckUtils]: 17: Hoare triple {8351#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8352#(<= main_~i~0 6)} is VALID [2022-04-28 02:47:57,911 INFO L290 TraceCheckUtils]: 18: Hoare triple {8352#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8352#(<= main_~i~0 6)} is VALID [2022-04-28 02:47:57,912 INFO L290 TraceCheckUtils]: 19: Hoare triple {8352#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8353#(<= main_~i~0 7)} is VALID [2022-04-28 02:47:57,912 INFO L290 TraceCheckUtils]: 20: Hoare triple {8353#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8353#(<= main_~i~0 7)} is VALID [2022-04-28 02:47:57,912 INFO L290 TraceCheckUtils]: 21: Hoare triple {8353#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8354#(<= main_~i~0 8)} is VALID [2022-04-28 02:47:57,913 INFO L290 TraceCheckUtils]: 22: Hoare triple {8354#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8354#(<= main_~i~0 8)} is VALID [2022-04-28 02:47:57,913 INFO L290 TraceCheckUtils]: 23: Hoare triple {8354#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8355#(<= main_~i~0 9)} is VALID [2022-04-28 02:47:57,913 INFO L290 TraceCheckUtils]: 24: Hoare triple {8355#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8355#(<= main_~i~0 9)} is VALID [2022-04-28 02:47:57,914 INFO L290 TraceCheckUtils]: 25: Hoare triple {8355#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8356#(<= main_~i~0 10)} is VALID [2022-04-28 02:47:57,914 INFO L290 TraceCheckUtils]: 26: Hoare triple {8356#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8356#(<= main_~i~0 10)} is VALID [2022-04-28 02:47:57,914 INFO L290 TraceCheckUtils]: 27: Hoare triple {8356#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8357#(<= main_~i~0 11)} is VALID [2022-04-28 02:47:57,914 INFO L290 TraceCheckUtils]: 28: Hoare triple {8357#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8357#(<= main_~i~0 11)} is VALID [2022-04-28 02:47:57,915 INFO L290 TraceCheckUtils]: 29: Hoare triple {8357#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8358#(<= main_~i~0 12)} is VALID [2022-04-28 02:47:57,915 INFO L290 TraceCheckUtils]: 30: Hoare triple {8358#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8358#(<= main_~i~0 12)} is VALID [2022-04-28 02:47:57,916 INFO L290 TraceCheckUtils]: 31: Hoare triple {8358#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8359#(<= main_~i~0 13)} is VALID [2022-04-28 02:47:57,916 INFO L290 TraceCheckUtils]: 32: Hoare triple {8359#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8359#(<= main_~i~0 13)} is VALID [2022-04-28 02:47:57,916 INFO L290 TraceCheckUtils]: 33: Hoare triple {8359#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8360#(<= main_~i~0 14)} is VALID [2022-04-28 02:47:57,916 INFO L290 TraceCheckUtils]: 34: Hoare triple {8360#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8360#(<= main_~i~0 14)} is VALID [2022-04-28 02:47:57,917 INFO L290 TraceCheckUtils]: 35: Hoare triple {8360#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8361#(<= main_~i~0 15)} is VALID [2022-04-28 02:47:57,917 INFO L290 TraceCheckUtils]: 36: Hoare triple {8361#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8361#(<= main_~i~0 15)} is VALID [2022-04-28 02:47:57,917 INFO L290 TraceCheckUtils]: 37: Hoare triple {8361#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8362#(<= main_~i~0 16)} is VALID [2022-04-28 02:47:57,918 INFO L290 TraceCheckUtils]: 38: Hoare triple {8362#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8362#(<= main_~i~0 16)} is VALID [2022-04-28 02:47:57,918 INFO L290 TraceCheckUtils]: 39: Hoare triple {8362#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8363#(<= main_~i~0 17)} is VALID [2022-04-28 02:47:57,918 INFO L290 TraceCheckUtils]: 40: Hoare triple {8363#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8363#(<= main_~i~0 17)} is VALID [2022-04-28 02:47:57,919 INFO L290 TraceCheckUtils]: 41: Hoare triple {8363#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8364#(<= main_~i~0 18)} is VALID [2022-04-28 02:47:57,919 INFO L290 TraceCheckUtils]: 42: Hoare triple {8364#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8364#(<= main_~i~0 18)} is VALID [2022-04-28 02:47:57,919 INFO L290 TraceCheckUtils]: 43: Hoare triple {8364#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8365#(<= main_~i~0 19)} is VALID [2022-04-28 02:47:57,920 INFO L290 TraceCheckUtils]: 44: Hoare triple {8365#(<= main_~i~0 19)} assume !(~i~0 < 1024); {8342#false} is VALID [2022-04-28 02:47:57,920 INFO L290 TraceCheckUtils]: 45: Hoare triple {8342#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {8342#false} is VALID [2022-04-28 02:47:57,920 INFO L272 TraceCheckUtils]: 46: Hoare triple {8342#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {8342#false} is VALID [2022-04-28 02:47:57,920 INFO L290 TraceCheckUtils]: 47: Hoare triple {8342#false} ~cond := #in~cond; {8342#false} is VALID [2022-04-28 02:47:57,920 INFO L290 TraceCheckUtils]: 48: Hoare triple {8342#false} assume 0 == ~cond; {8342#false} is VALID [2022-04-28 02:47:57,920 INFO L290 TraceCheckUtils]: 49: Hoare triple {8342#false} assume !false; {8342#false} is VALID [2022-04-28 02:47:57,920 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:47:57,920 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:47:58,614 INFO L290 TraceCheckUtils]: 49: Hoare triple {8342#false} assume !false; {8342#false} is VALID [2022-04-28 02:47:58,615 INFO L290 TraceCheckUtils]: 48: Hoare triple {8342#false} assume 0 == ~cond; {8342#false} is VALID [2022-04-28 02:47:58,615 INFO L290 TraceCheckUtils]: 47: Hoare triple {8342#false} ~cond := #in~cond; {8342#false} is VALID [2022-04-28 02:47:58,615 INFO L272 TraceCheckUtils]: 46: Hoare triple {8342#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {8342#false} is VALID [2022-04-28 02:47:58,615 INFO L290 TraceCheckUtils]: 45: Hoare triple {8342#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {8342#false} is VALID [2022-04-28 02:47:58,615 INFO L290 TraceCheckUtils]: 44: Hoare triple {8533#(< main_~i~0 1024)} assume !(~i~0 < 1024); {8342#false} is VALID [2022-04-28 02:47:58,615 INFO L290 TraceCheckUtils]: 43: Hoare triple {8537#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8533#(< main_~i~0 1024)} is VALID [2022-04-28 02:47:58,616 INFO L290 TraceCheckUtils]: 42: Hoare triple {8537#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8537#(< main_~i~0 1023)} is VALID [2022-04-28 02:47:58,616 INFO L290 TraceCheckUtils]: 41: Hoare triple {8544#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8537#(< main_~i~0 1023)} is VALID [2022-04-28 02:47:58,616 INFO L290 TraceCheckUtils]: 40: Hoare triple {8544#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8544#(< main_~i~0 1022)} is VALID [2022-04-28 02:47:58,617 INFO L290 TraceCheckUtils]: 39: Hoare triple {8551#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8544#(< main_~i~0 1022)} is VALID [2022-04-28 02:47:58,617 INFO L290 TraceCheckUtils]: 38: Hoare triple {8551#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8551#(< main_~i~0 1021)} is VALID [2022-04-28 02:47:58,617 INFO L290 TraceCheckUtils]: 37: Hoare triple {8558#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8551#(< main_~i~0 1021)} is VALID [2022-04-28 02:47:58,618 INFO L290 TraceCheckUtils]: 36: Hoare triple {8558#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8558#(< main_~i~0 1020)} is VALID [2022-04-28 02:47:58,618 INFO L290 TraceCheckUtils]: 35: Hoare triple {8565#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8558#(< main_~i~0 1020)} is VALID [2022-04-28 02:47:58,618 INFO L290 TraceCheckUtils]: 34: Hoare triple {8565#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8565#(< main_~i~0 1019)} is VALID [2022-04-28 02:47:58,619 INFO L290 TraceCheckUtils]: 33: Hoare triple {8572#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8565#(< main_~i~0 1019)} is VALID [2022-04-28 02:47:58,619 INFO L290 TraceCheckUtils]: 32: Hoare triple {8572#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8572#(< main_~i~0 1018)} is VALID [2022-04-28 02:47:58,619 INFO L290 TraceCheckUtils]: 31: Hoare triple {8579#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8572#(< main_~i~0 1018)} is VALID [2022-04-28 02:47:58,619 INFO L290 TraceCheckUtils]: 30: Hoare triple {8579#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8579#(< main_~i~0 1017)} is VALID [2022-04-28 02:47:58,620 INFO L290 TraceCheckUtils]: 29: Hoare triple {8586#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8579#(< main_~i~0 1017)} is VALID [2022-04-28 02:47:58,620 INFO L290 TraceCheckUtils]: 28: Hoare triple {8586#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8586#(< main_~i~0 1016)} is VALID [2022-04-28 02:47:58,620 INFO L290 TraceCheckUtils]: 27: Hoare triple {8593#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8586#(< main_~i~0 1016)} is VALID [2022-04-28 02:47:58,621 INFO L290 TraceCheckUtils]: 26: Hoare triple {8593#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8593#(< main_~i~0 1015)} is VALID [2022-04-28 02:47:58,621 INFO L290 TraceCheckUtils]: 25: Hoare triple {8600#(< main_~i~0 1014)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8593#(< main_~i~0 1015)} is VALID [2022-04-28 02:47:58,621 INFO L290 TraceCheckUtils]: 24: Hoare triple {8600#(< main_~i~0 1014)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8600#(< main_~i~0 1014)} is VALID [2022-04-28 02:47:58,622 INFO L290 TraceCheckUtils]: 23: Hoare triple {8607#(< main_~i~0 1013)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8600#(< main_~i~0 1014)} is VALID [2022-04-28 02:47:58,622 INFO L290 TraceCheckUtils]: 22: Hoare triple {8607#(< main_~i~0 1013)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8607#(< main_~i~0 1013)} is VALID [2022-04-28 02:47:58,622 INFO L290 TraceCheckUtils]: 21: Hoare triple {8614#(< main_~i~0 1012)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8607#(< main_~i~0 1013)} is VALID [2022-04-28 02:47:58,623 INFO L290 TraceCheckUtils]: 20: Hoare triple {8614#(< main_~i~0 1012)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8614#(< main_~i~0 1012)} is VALID [2022-04-28 02:47:58,623 INFO L290 TraceCheckUtils]: 19: Hoare triple {8621#(< main_~i~0 1011)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8614#(< main_~i~0 1012)} is VALID [2022-04-28 02:47:58,623 INFO L290 TraceCheckUtils]: 18: Hoare triple {8621#(< main_~i~0 1011)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8621#(< main_~i~0 1011)} is VALID [2022-04-28 02:47:58,624 INFO L290 TraceCheckUtils]: 17: Hoare triple {8628#(< main_~i~0 1010)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8621#(< main_~i~0 1011)} is VALID [2022-04-28 02:47:58,624 INFO L290 TraceCheckUtils]: 16: Hoare triple {8628#(< main_~i~0 1010)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8628#(< main_~i~0 1010)} is VALID [2022-04-28 02:47:58,624 INFO L290 TraceCheckUtils]: 15: Hoare triple {8635#(< main_~i~0 1009)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8628#(< main_~i~0 1010)} is VALID [2022-04-28 02:47:58,624 INFO L290 TraceCheckUtils]: 14: Hoare triple {8635#(< main_~i~0 1009)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8635#(< main_~i~0 1009)} is VALID [2022-04-28 02:47:58,625 INFO L290 TraceCheckUtils]: 13: Hoare triple {8642#(< main_~i~0 1008)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8635#(< main_~i~0 1009)} is VALID [2022-04-28 02:47:58,625 INFO L290 TraceCheckUtils]: 12: Hoare triple {8642#(< main_~i~0 1008)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8642#(< main_~i~0 1008)} is VALID [2022-04-28 02:47:58,625 INFO L290 TraceCheckUtils]: 11: Hoare triple {8649#(< main_~i~0 1007)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8642#(< main_~i~0 1008)} is VALID [2022-04-28 02:47:58,626 INFO L290 TraceCheckUtils]: 10: Hoare triple {8649#(< main_~i~0 1007)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8649#(< main_~i~0 1007)} is VALID [2022-04-28 02:47:58,626 INFO L290 TraceCheckUtils]: 9: Hoare triple {8656#(< main_~i~0 1006)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8649#(< main_~i~0 1007)} is VALID [2022-04-28 02:47:58,626 INFO L290 TraceCheckUtils]: 8: Hoare triple {8656#(< main_~i~0 1006)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8656#(< main_~i~0 1006)} is VALID [2022-04-28 02:47:58,627 INFO L290 TraceCheckUtils]: 7: Hoare triple {8663#(< main_~i~0 1005)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8656#(< main_~i~0 1006)} is VALID [2022-04-28 02:47:58,627 INFO L290 TraceCheckUtils]: 6: Hoare triple {8663#(< main_~i~0 1005)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8663#(< main_~i~0 1005)} is VALID [2022-04-28 02:47:58,627 INFO L290 TraceCheckUtils]: 5: Hoare triple {8341#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {8663#(< main_~i~0 1005)} is VALID [2022-04-28 02:47:58,627 INFO L272 TraceCheckUtils]: 4: Hoare triple {8341#true} call #t~ret6 := main(); {8341#true} is VALID [2022-04-28 02:47:58,627 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8341#true} {8341#true} #39#return; {8341#true} is VALID [2022-04-28 02:47:58,628 INFO L290 TraceCheckUtils]: 2: Hoare triple {8341#true} assume true; {8341#true} is VALID [2022-04-28 02:47:58,628 INFO L290 TraceCheckUtils]: 1: Hoare triple {8341#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {8341#true} is VALID [2022-04-28 02:47:58,628 INFO L272 TraceCheckUtils]: 0: Hoare triple {8341#true} call ULTIMATE.init(); {8341#true} is VALID [2022-04-28 02:47:58,628 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:47:58,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1094801153] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:47:58,628 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:47:58,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 44 [2022-04-28 02:47:58,628 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:47:58,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [677895513] [2022-04-28 02:47:58,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [677895513] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:47:58,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:47:58,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-28 02:47:58,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321199714] [2022-04-28 02:47:58,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:47:58,629 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.0) internal successors, (46), 22 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2022-04-28 02:47:58,629 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:47:58,629 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 2.0) internal successors, (46), 22 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:58,661 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:47:58,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-28 02:47:58,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:47:58,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-28 02:47:58,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=905, Invalid=987, Unknown=0, NotChecked=0, Total=1892 [2022-04-28 02:47:58,662 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand has 23 states, 23 states have (on average 2.0) internal successors, (46), 22 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:59,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:47:59,156 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2022-04-28 02:47:59,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-28 02:47:59,157 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.0) internal successors, (46), 22 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2022-04-28 02:47:59,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:47:59,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 2.0) internal successors, (46), 22 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:59,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 60 transitions. [2022-04-28 02:47:59,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 2.0) internal successors, (46), 22 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:59,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 60 transitions. [2022-04-28 02:47:59,160 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 60 transitions. [2022-04-28 02:47:59,202 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:47:59,203 INFO L225 Difference]: With dead ends: 60 [2022-04-28 02:47:59,203 INFO L226 Difference]: Without dead ends: 54 [2022-04-28 02:47:59,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 81 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-28 02:47:59,205 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 48 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:47:59,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 34 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:47:59,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-28 02:47:59,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2022-04-28 02:47:59,308 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:47:59,309 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 53 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:59,309 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 53 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:59,309 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 53 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:59,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:47:59,310 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2022-04-28 02:47:59,310 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2022-04-28 02:47:59,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:47:59,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:47:59,310 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 54 states. [2022-04-28 02:47:59,311 INFO L87 Difference]: Start difference. First operand has 53 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 54 states. [2022-04-28 02:47:59,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:47:59,311 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2022-04-28 02:47:59,311 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2022-04-28 02:47:59,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:47:59,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:47:59,311 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:47:59,311 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:47:59,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:59,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2022-04-28 02:47:59,312 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 50 [2022-04-28 02:47:59,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:47:59,312 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2022-04-28 02:47:59,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.0) internal successors, (46), 22 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:59,313 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 53 transitions. [2022-04-28 02:47:59,368 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:47:59,368 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2022-04-28 02:47:59,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-28 02:47:59,368 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:47:59,369 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:47:59,384 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-28 02:47:59,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:47:59,569 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:47:59,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:47:59,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1720179550, now seen corresponding path program 39 times [2022-04-28 02:47:59,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:47:59,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [314235254] [2022-04-28 02:47:59,572 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:47:59,572 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:47:59,572 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:47:59,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1720179550, now seen corresponding path program 40 times [2022-04-28 02:47:59,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:47:59,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842439357] [2022-04-28 02:47:59,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:47:59,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:47:59,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:47:59,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:47:59,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:47:59,830 INFO L290 TraceCheckUtils]: 0: Hoare triple {9087#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {9061#true} is VALID [2022-04-28 02:47:59,830 INFO L290 TraceCheckUtils]: 1: Hoare triple {9061#true} assume true; {9061#true} is VALID [2022-04-28 02:47:59,831 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9061#true} {9061#true} #39#return; {9061#true} is VALID [2022-04-28 02:47:59,831 INFO L272 TraceCheckUtils]: 0: Hoare triple {9061#true} call ULTIMATE.init(); {9087#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:47:59,831 INFO L290 TraceCheckUtils]: 1: Hoare triple {9087#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {9061#true} is VALID [2022-04-28 02:47:59,831 INFO L290 TraceCheckUtils]: 2: Hoare triple {9061#true} assume true; {9061#true} is VALID [2022-04-28 02:47:59,831 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9061#true} {9061#true} #39#return; {9061#true} is VALID [2022-04-28 02:47:59,831 INFO L272 TraceCheckUtils]: 4: Hoare triple {9061#true} call #t~ret6 := main(); {9061#true} is VALID [2022-04-28 02:47:59,832 INFO L290 TraceCheckUtils]: 5: Hoare triple {9061#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {9066#(= main_~i~0 0)} is VALID [2022-04-28 02:47:59,832 INFO L290 TraceCheckUtils]: 6: Hoare triple {9066#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9066#(= main_~i~0 0)} is VALID [2022-04-28 02:47:59,832 INFO L290 TraceCheckUtils]: 7: Hoare triple {9066#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9067#(<= main_~i~0 1)} is VALID [2022-04-28 02:47:59,833 INFO L290 TraceCheckUtils]: 8: Hoare triple {9067#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9067#(<= main_~i~0 1)} is VALID [2022-04-28 02:47:59,833 INFO L290 TraceCheckUtils]: 9: Hoare triple {9067#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9068#(<= main_~i~0 2)} is VALID [2022-04-28 02:47:59,834 INFO L290 TraceCheckUtils]: 10: Hoare triple {9068#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9068#(<= main_~i~0 2)} is VALID [2022-04-28 02:47:59,834 INFO L290 TraceCheckUtils]: 11: Hoare triple {9068#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9069#(<= main_~i~0 3)} is VALID [2022-04-28 02:47:59,834 INFO L290 TraceCheckUtils]: 12: Hoare triple {9069#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9069#(<= main_~i~0 3)} is VALID [2022-04-28 02:47:59,835 INFO L290 TraceCheckUtils]: 13: Hoare triple {9069#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9070#(<= main_~i~0 4)} is VALID [2022-04-28 02:47:59,835 INFO L290 TraceCheckUtils]: 14: Hoare triple {9070#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9070#(<= main_~i~0 4)} is VALID [2022-04-28 02:47:59,836 INFO L290 TraceCheckUtils]: 15: Hoare triple {9070#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9071#(<= main_~i~0 5)} is VALID [2022-04-28 02:47:59,836 INFO L290 TraceCheckUtils]: 16: Hoare triple {9071#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9071#(<= main_~i~0 5)} is VALID [2022-04-28 02:47:59,837 INFO L290 TraceCheckUtils]: 17: Hoare triple {9071#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9072#(<= main_~i~0 6)} is VALID [2022-04-28 02:47:59,837 INFO L290 TraceCheckUtils]: 18: Hoare triple {9072#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9072#(<= main_~i~0 6)} is VALID [2022-04-28 02:47:59,837 INFO L290 TraceCheckUtils]: 19: Hoare triple {9072#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9073#(<= main_~i~0 7)} is VALID [2022-04-28 02:47:59,838 INFO L290 TraceCheckUtils]: 20: Hoare triple {9073#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9073#(<= main_~i~0 7)} is VALID [2022-04-28 02:47:59,838 INFO L290 TraceCheckUtils]: 21: Hoare triple {9073#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9074#(<= main_~i~0 8)} is VALID [2022-04-28 02:47:59,839 INFO L290 TraceCheckUtils]: 22: Hoare triple {9074#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9074#(<= main_~i~0 8)} is VALID [2022-04-28 02:47:59,839 INFO L290 TraceCheckUtils]: 23: Hoare triple {9074#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9075#(<= main_~i~0 9)} is VALID [2022-04-28 02:47:59,839 INFO L290 TraceCheckUtils]: 24: Hoare triple {9075#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9075#(<= main_~i~0 9)} is VALID [2022-04-28 02:47:59,840 INFO L290 TraceCheckUtils]: 25: Hoare triple {9075#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9076#(<= main_~i~0 10)} is VALID [2022-04-28 02:47:59,840 INFO L290 TraceCheckUtils]: 26: Hoare triple {9076#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9076#(<= main_~i~0 10)} is VALID [2022-04-28 02:47:59,841 INFO L290 TraceCheckUtils]: 27: Hoare triple {9076#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9077#(<= main_~i~0 11)} is VALID [2022-04-28 02:47:59,841 INFO L290 TraceCheckUtils]: 28: Hoare triple {9077#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9077#(<= main_~i~0 11)} is VALID [2022-04-28 02:47:59,841 INFO L290 TraceCheckUtils]: 29: Hoare triple {9077#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9078#(<= main_~i~0 12)} is VALID [2022-04-28 02:47:59,842 INFO L290 TraceCheckUtils]: 30: Hoare triple {9078#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9078#(<= main_~i~0 12)} is VALID [2022-04-28 02:47:59,842 INFO L290 TraceCheckUtils]: 31: Hoare triple {9078#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9079#(<= main_~i~0 13)} is VALID [2022-04-28 02:47:59,842 INFO L290 TraceCheckUtils]: 32: Hoare triple {9079#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9079#(<= main_~i~0 13)} is VALID [2022-04-28 02:47:59,843 INFO L290 TraceCheckUtils]: 33: Hoare triple {9079#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9080#(<= main_~i~0 14)} is VALID [2022-04-28 02:47:59,843 INFO L290 TraceCheckUtils]: 34: Hoare triple {9080#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9080#(<= main_~i~0 14)} is VALID [2022-04-28 02:47:59,843 INFO L290 TraceCheckUtils]: 35: Hoare triple {9080#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9081#(<= main_~i~0 15)} is VALID [2022-04-28 02:47:59,844 INFO L290 TraceCheckUtils]: 36: Hoare triple {9081#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9081#(<= main_~i~0 15)} is VALID [2022-04-28 02:47:59,844 INFO L290 TraceCheckUtils]: 37: Hoare triple {9081#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9082#(<= main_~i~0 16)} is VALID [2022-04-28 02:47:59,844 INFO L290 TraceCheckUtils]: 38: Hoare triple {9082#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9082#(<= main_~i~0 16)} is VALID [2022-04-28 02:47:59,845 INFO L290 TraceCheckUtils]: 39: Hoare triple {9082#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9083#(<= main_~i~0 17)} is VALID [2022-04-28 02:47:59,845 INFO L290 TraceCheckUtils]: 40: Hoare triple {9083#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9083#(<= main_~i~0 17)} is VALID [2022-04-28 02:47:59,845 INFO L290 TraceCheckUtils]: 41: Hoare triple {9083#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9084#(<= main_~i~0 18)} is VALID [2022-04-28 02:47:59,846 INFO L290 TraceCheckUtils]: 42: Hoare triple {9084#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9084#(<= main_~i~0 18)} is VALID [2022-04-28 02:47:59,846 INFO L290 TraceCheckUtils]: 43: Hoare triple {9084#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9085#(<= main_~i~0 19)} is VALID [2022-04-28 02:47:59,846 INFO L290 TraceCheckUtils]: 44: Hoare triple {9085#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9085#(<= main_~i~0 19)} is VALID [2022-04-28 02:47:59,847 INFO L290 TraceCheckUtils]: 45: Hoare triple {9085#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9086#(<= main_~i~0 20)} is VALID [2022-04-28 02:47:59,847 INFO L290 TraceCheckUtils]: 46: Hoare triple {9086#(<= main_~i~0 20)} assume !(~i~0 < 1024); {9062#false} is VALID [2022-04-28 02:47:59,847 INFO L290 TraceCheckUtils]: 47: Hoare triple {9062#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {9062#false} is VALID [2022-04-28 02:47:59,847 INFO L272 TraceCheckUtils]: 48: Hoare triple {9062#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {9062#false} is VALID [2022-04-28 02:47:59,847 INFO L290 TraceCheckUtils]: 49: Hoare triple {9062#false} ~cond := #in~cond; {9062#false} is VALID [2022-04-28 02:47:59,847 INFO L290 TraceCheckUtils]: 50: Hoare triple {9062#false} assume 0 == ~cond; {9062#false} is VALID [2022-04-28 02:47:59,847 INFO L290 TraceCheckUtils]: 51: Hoare triple {9062#false} assume !false; {9062#false} is VALID [2022-04-28 02:47:59,847 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:47:59,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:47:59,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842439357] [2022-04-28 02:47:59,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842439357] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:47:59,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137472370] [2022-04-28 02:47:59,848 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 02:47:59,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:47:59,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:47:59,849 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:47:59,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-28 02:47:59,930 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 02:47:59,930 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:47:59,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-28 02:47:59,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:47:59,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:48:00,252 INFO L272 TraceCheckUtils]: 0: Hoare triple {9061#true} call ULTIMATE.init(); {9061#true} is VALID [2022-04-28 02:48:00,252 INFO L290 TraceCheckUtils]: 1: Hoare triple {9061#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {9061#true} is VALID [2022-04-28 02:48:00,252 INFO L290 TraceCheckUtils]: 2: Hoare triple {9061#true} assume true; {9061#true} is VALID [2022-04-28 02:48:00,253 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9061#true} {9061#true} #39#return; {9061#true} is VALID [2022-04-28 02:48:00,253 INFO L272 TraceCheckUtils]: 4: Hoare triple {9061#true} call #t~ret6 := main(); {9061#true} is VALID [2022-04-28 02:48:00,253 INFO L290 TraceCheckUtils]: 5: Hoare triple {9061#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {9106#(<= main_~i~0 0)} is VALID [2022-04-28 02:48:00,253 INFO L290 TraceCheckUtils]: 6: Hoare triple {9106#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9106#(<= main_~i~0 0)} is VALID [2022-04-28 02:48:00,254 INFO L290 TraceCheckUtils]: 7: Hoare triple {9106#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9067#(<= main_~i~0 1)} is VALID [2022-04-28 02:48:00,254 INFO L290 TraceCheckUtils]: 8: Hoare triple {9067#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9067#(<= main_~i~0 1)} is VALID [2022-04-28 02:48:00,254 INFO L290 TraceCheckUtils]: 9: Hoare triple {9067#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9068#(<= main_~i~0 2)} is VALID [2022-04-28 02:48:00,255 INFO L290 TraceCheckUtils]: 10: Hoare triple {9068#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9068#(<= main_~i~0 2)} is VALID [2022-04-28 02:48:00,255 INFO L290 TraceCheckUtils]: 11: Hoare triple {9068#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9069#(<= main_~i~0 3)} is VALID [2022-04-28 02:48:00,255 INFO L290 TraceCheckUtils]: 12: Hoare triple {9069#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9069#(<= main_~i~0 3)} is VALID [2022-04-28 02:48:00,256 INFO L290 TraceCheckUtils]: 13: Hoare triple {9069#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9070#(<= main_~i~0 4)} is VALID [2022-04-28 02:48:00,256 INFO L290 TraceCheckUtils]: 14: Hoare triple {9070#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9070#(<= main_~i~0 4)} is VALID [2022-04-28 02:48:00,256 INFO L290 TraceCheckUtils]: 15: Hoare triple {9070#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9071#(<= main_~i~0 5)} is VALID [2022-04-28 02:48:00,256 INFO L290 TraceCheckUtils]: 16: Hoare triple {9071#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9071#(<= main_~i~0 5)} is VALID [2022-04-28 02:48:00,257 INFO L290 TraceCheckUtils]: 17: Hoare triple {9071#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9072#(<= main_~i~0 6)} is VALID [2022-04-28 02:48:00,257 INFO L290 TraceCheckUtils]: 18: Hoare triple {9072#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9072#(<= main_~i~0 6)} is VALID [2022-04-28 02:48:00,257 INFO L290 TraceCheckUtils]: 19: Hoare triple {9072#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9073#(<= main_~i~0 7)} is VALID [2022-04-28 02:48:00,258 INFO L290 TraceCheckUtils]: 20: Hoare triple {9073#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9073#(<= main_~i~0 7)} is VALID [2022-04-28 02:48:00,258 INFO L290 TraceCheckUtils]: 21: Hoare triple {9073#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9074#(<= main_~i~0 8)} is VALID [2022-04-28 02:48:00,258 INFO L290 TraceCheckUtils]: 22: Hoare triple {9074#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9074#(<= main_~i~0 8)} is VALID [2022-04-28 02:48:00,259 INFO L290 TraceCheckUtils]: 23: Hoare triple {9074#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9075#(<= main_~i~0 9)} is VALID [2022-04-28 02:48:00,259 INFO L290 TraceCheckUtils]: 24: Hoare triple {9075#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9075#(<= main_~i~0 9)} is VALID [2022-04-28 02:48:00,259 INFO L290 TraceCheckUtils]: 25: Hoare triple {9075#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9076#(<= main_~i~0 10)} is VALID [2022-04-28 02:48:00,260 INFO L290 TraceCheckUtils]: 26: Hoare triple {9076#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9076#(<= main_~i~0 10)} is VALID [2022-04-28 02:48:00,260 INFO L290 TraceCheckUtils]: 27: Hoare triple {9076#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9077#(<= main_~i~0 11)} is VALID [2022-04-28 02:48:00,260 INFO L290 TraceCheckUtils]: 28: Hoare triple {9077#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9077#(<= main_~i~0 11)} is VALID [2022-04-28 02:48:00,261 INFO L290 TraceCheckUtils]: 29: Hoare triple {9077#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9078#(<= main_~i~0 12)} is VALID [2022-04-28 02:48:00,261 INFO L290 TraceCheckUtils]: 30: Hoare triple {9078#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9078#(<= main_~i~0 12)} is VALID [2022-04-28 02:48:00,261 INFO L290 TraceCheckUtils]: 31: Hoare triple {9078#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9079#(<= main_~i~0 13)} is VALID [2022-04-28 02:48:00,261 INFO L290 TraceCheckUtils]: 32: Hoare triple {9079#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9079#(<= main_~i~0 13)} is VALID [2022-04-28 02:48:00,262 INFO L290 TraceCheckUtils]: 33: Hoare triple {9079#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9080#(<= main_~i~0 14)} is VALID [2022-04-28 02:48:00,262 INFO L290 TraceCheckUtils]: 34: Hoare triple {9080#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9080#(<= main_~i~0 14)} is VALID [2022-04-28 02:48:00,262 INFO L290 TraceCheckUtils]: 35: Hoare triple {9080#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9081#(<= main_~i~0 15)} is VALID [2022-04-28 02:48:00,263 INFO L290 TraceCheckUtils]: 36: Hoare triple {9081#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9081#(<= main_~i~0 15)} is VALID [2022-04-28 02:48:00,263 INFO L290 TraceCheckUtils]: 37: Hoare triple {9081#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9082#(<= main_~i~0 16)} is VALID [2022-04-28 02:48:00,263 INFO L290 TraceCheckUtils]: 38: Hoare triple {9082#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9082#(<= main_~i~0 16)} is VALID [2022-04-28 02:48:00,264 INFO L290 TraceCheckUtils]: 39: Hoare triple {9082#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9083#(<= main_~i~0 17)} is VALID [2022-04-28 02:48:00,264 INFO L290 TraceCheckUtils]: 40: Hoare triple {9083#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9083#(<= main_~i~0 17)} is VALID [2022-04-28 02:48:00,264 INFO L290 TraceCheckUtils]: 41: Hoare triple {9083#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9084#(<= main_~i~0 18)} is VALID [2022-04-28 02:48:00,265 INFO L290 TraceCheckUtils]: 42: Hoare triple {9084#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9084#(<= main_~i~0 18)} is VALID [2022-04-28 02:48:00,265 INFO L290 TraceCheckUtils]: 43: Hoare triple {9084#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9085#(<= main_~i~0 19)} is VALID [2022-04-28 02:48:00,265 INFO L290 TraceCheckUtils]: 44: Hoare triple {9085#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9085#(<= main_~i~0 19)} is VALID [2022-04-28 02:48:00,266 INFO L290 TraceCheckUtils]: 45: Hoare triple {9085#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9086#(<= main_~i~0 20)} is VALID [2022-04-28 02:48:00,266 INFO L290 TraceCheckUtils]: 46: Hoare triple {9086#(<= main_~i~0 20)} assume !(~i~0 < 1024); {9062#false} is VALID [2022-04-28 02:48:00,266 INFO L290 TraceCheckUtils]: 47: Hoare triple {9062#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {9062#false} is VALID [2022-04-28 02:48:00,266 INFO L272 TraceCheckUtils]: 48: Hoare triple {9062#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {9062#false} is VALID [2022-04-28 02:48:00,266 INFO L290 TraceCheckUtils]: 49: Hoare triple {9062#false} ~cond := #in~cond; {9062#false} is VALID [2022-04-28 02:48:00,266 INFO L290 TraceCheckUtils]: 50: Hoare triple {9062#false} assume 0 == ~cond; {9062#false} is VALID [2022-04-28 02:48:00,266 INFO L290 TraceCheckUtils]: 51: Hoare triple {9062#false} assume !false; {9062#false} is VALID [2022-04-28 02:48:00,267 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:48:00,267 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:48:01,018 INFO L290 TraceCheckUtils]: 51: Hoare triple {9062#false} assume !false; {9062#false} is VALID [2022-04-28 02:48:01,018 INFO L290 TraceCheckUtils]: 50: Hoare triple {9062#false} assume 0 == ~cond; {9062#false} is VALID [2022-04-28 02:48:01,018 INFO L290 TraceCheckUtils]: 49: Hoare triple {9062#false} ~cond := #in~cond; {9062#false} is VALID [2022-04-28 02:48:01,018 INFO L272 TraceCheckUtils]: 48: Hoare triple {9062#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {9062#false} is VALID [2022-04-28 02:48:01,018 INFO L290 TraceCheckUtils]: 47: Hoare triple {9062#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {9062#false} is VALID [2022-04-28 02:48:01,019 INFO L290 TraceCheckUtils]: 46: Hoare triple {9260#(< main_~i~0 1024)} assume !(~i~0 < 1024); {9062#false} is VALID [2022-04-28 02:48:01,019 INFO L290 TraceCheckUtils]: 45: Hoare triple {9264#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9260#(< main_~i~0 1024)} is VALID [2022-04-28 02:48:01,020 INFO L290 TraceCheckUtils]: 44: Hoare triple {9264#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9264#(< main_~i~0 1023)} is VALID [2022-04-28 02:48:01,020 INFO L290 TraceCheckUtils]: 43: Hoare triple {9271#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9264#(< main_~i~0 1023)} is VALID [2022-04-28 02:48:01,020 INFO L290 TraceCheckUtils]: 42: Hoare triple {9271#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9271#(< main_~i~0 1022)} is VALID [2022-04-28 02:48:01,021 INFO L290 TraceCheckUtils]: 41: Hoare triple {9278#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9271#(< main_~i~0 1022)} is VALID [2022-04-28 02:48:01,021 INFO L290 TraceCheckUtils]: 40: Hoare triple {9278#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9278#(< main_~i~0 1021)} is VALID [2022-04-28 02:48:01,021 INFO L290 TraceCheckUtils]: 39: Hoare triple {9285#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9278#(< main_~i~0 1021)} is VALID [2022-04-28 02:48:01,022 INFO L290 TraceCheckUtils]: 38: Hoare triple {9285#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9285#(< main_~i~0 1020)} is VALID [2022-04-28 02:48:01,022 INFO L290 TraceCheckUtils]: 37: Hoare triple {9292#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9285#(< main_~i~0 1020)} is VALID [2022-04-28 02:48:01,022 INFO L290 TraceCheckUtils]: 36: Hoare triple {9292#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9292#(< main_~i~0 1019)} is VALID [2022-04-28 02:48:01,023 INFO L290 TraceCheckUtils]: 35: Hoare triple {9299#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9292#(< main_~i~0 1019)} is VALID [2022-04-28 02:48:01,023 INFO L290 TraceCheckUtils]: 34: Hoare triple {9299#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9299#(< main_~i~0 1018)} is VALID [2022-04-28 02:48:01,023 INFO L290 TraceCheckUtils]: 33: Hoare triple {9306#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9299#(< main_~i~0 1018)} is VALID [2022-04-28 02:48:01,024 INFO L290 TraceCheckUtils]: 32: Hoare triple {9306#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9306#(< main_~i~0 1017)} is VALID [2022-04-28 02:48:01,024 INFO L290 TraceCheckUtils]: 31: Hoare triple {9313#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9306#(< main_~i~0 1017)} is VALID [2022-04-28 02:48:01,024 INFO L290 TraceCheckUtils]: 30: Hoare triple {9313#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9313#(< main_~i~0 1016)} is VALID [2022-04-28 02:48:01,025 INFO L290 TraceCheckUtils]: 29: Hoare triple {9320#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9313#(< main_~i~0 1016)} is VALID [2022-04-28 02:48:01,025 INFO L290 TraceCheckUtils]: 28: Hoare triple {9320#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9320#(< main_~i~0 1015)} is VALID [2022-04-28 02:48:01,025 INFO L290 TraceCheckUtils]: 27: Hoare triple {9327#(< main_~i~0 1014)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9320#(< main_~i~0 1015)} is VALID [2022-04-28 02:48:01,026 INFO L290 TraceCheckUtils]: 26: Hoare triple {9327#(< main_~i~0 1014)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9327#(< main_~i~0 1014)} is VALID [2022-04-28 02:48:01,026 INFO L290 TraceCheckUtils]: 25: Hoare triple {9334#(< main_~i~0 1013)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9327#(< main_~i~0 1014)} is VALID [2022-04-28 02:48:01,026 INFO L290 TraceCheckUtils]: 24: Hoare triple {9334#(< main_~i~0 1013)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9334#(< main_~i~0 1013)} is VALID [2022-04-28 02:48:01,027 INFO L290 TraceCheckUtils]: 23: Hoare triple {9341#(< main_~i~0 1012)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9334#(< main_~i~0 1013)} is VALID [2022-04-28 02:48:01,027 INFO L290 TraceCheckUtils]: 22: Hoare triple {9341#(< main_~i~0 1012)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9341#(< main_~i~0 1012)} is VALID [2022-04-28 02:48:01,027 INFO L290 TraceCheckUtils]: 21: Hoare triple {9348#(< main_~i~0 1011)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9341#(< main_~i~0 1012)} is VALID [2022-04-28 02:48:01,027 INFO L290 TraceCheckUtils]: 20: Hoare triple {9348#(< main_~i~0 1011)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9348#(< main_~i~0 1011)} is VALID [2022-04-28 02:48:01,028 INFO L290 TraceCheckUtils]: 19: Hoare triple {9355#(< main_~i~0 1010)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9348#(< main_~i~0 1011)} is VALID [2022-04-28 02:48:01,028 INFO L290 TraceCheckUtils]: 18: Hoare triple {9355#(< main_~i~0 1010)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9355#(< main_~i~0 1010)} is VALID [2022-04-28 02:48:01,028 INFO L290 TraceCheckUtils]: 17: Hoare triple {9362#(< main_~i~0 1009)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9355#(< main_~i~0 1010)} is VALID [2022-04-28 02:48:01,029 INFO L290 TraceCheckUtils]: 16: Hoare triple {9362#(< main_~i~0 1009)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9362#(< main_~i~0 1009)} is VALID [2022-04-28 02:48:01,029 INFO L290 TraceCheckUtils]: 15: Hoare triple {9369#(< main_~i~0 1008)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9362#(< main_~i~0 1009)} is VALID [2022-04-28 02:48:01,029 INFO L290 TraceCheckUtils]: 14: Hoare triple {9369#(< main_~i~0 1008)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9369#(< main_~i~0 1008)} is VALID [2022-04-28 02:48:01,030 INFO L290 TraceCheckUtils]: 13: Hoare triple {9376#(< main_~i~0 1007)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9369#(< main_~i~0 1008)} is VALID [2022-04-28 02:48:01,030 INFO L290 TraceCheckUtils]: 12: Hoare triple {9376#(< main_~i~0 1007)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9376#(< main_~i~0 1007)} is VALID [2022-04-28 02:48:01,030 INFO L290 TraceCheckUtils]: 11: Hoare triple {9383#(< main_~i~0 1006)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9376#(< main_~i~0 1007)} is VALID [2022-04-28 02:48:01,031 INFO L290 TraceCheckUtils]: 10: Hoare triple {9383#(< main_~i~0 1006)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9383#(< main_~i~0 1006)} is VALID [2022-04-28 02:48:01,031 INFO L290 TraceCheckUtils]: 9: Hoare triple {9390#(< main_~i~0 1005)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9383#(< main_~i~0 1006)} is VALID [2022-04-28 02:48:01,031 INFO L290 TraceCheckUtils]: 8: Hoare triple {9390#(< main_~i~0 1005)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9390#(< main_~i~0 1005)} is VALID [2022-04-28 02:48:01,032 INFO L290 TraceCheckUtils]: 7: Hoare triple {9397#(< main_~i~0 1004)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9390#(< main_~i~0 1005)} is VALID [2022-04-28 02:48:01,032 INFO L290 TraceCheckUtils]: 6: Hoare triple {9397#(< main_~i~0 1004)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9397#(< main_~i~0 1004)} is VALID [2022-04-28 02:48:01,032 INFO L290 TraceCheckUtils]: 5: Hoare triple {9061#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {9397#(< main_~i~0 1004)} is VALID [2022-04-28 02:48:01,032 INFO L272 TraceCheckUtils]: 4: Hoare triple {9061#true} call #t~ret6 := main(); {9061#true} is VALID [2022-04-28 02:48:01,033 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9061#true} {9061#true} #39#return; {9061#true} is VALID [2022-04-28 02:48:01,033 INFO L290 TraceCheckUtils]: 2: Hoare triple {9061#true} assume true; {9061#true} is VALID [2022-04-28 02:48:01,033 INFO L290 TraceCheckUtils]: 1: Hoare triple {9061#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {9061#true} is VALID [2022-04-28 02:48:01,033 INFO L272 TraceCheckUtils]: 0: Hoare triple {9061#true} call ULTIMATE.init(); {9061#true} is VALID [2022-04-28 02:48:01,033 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:48:01,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137472370] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:48:01,033 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:48:01,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 46 [2022-04-28 02:48:01,034 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:48:01,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [314235254] [2022-04-28 02:48:01,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [314235254] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:48:01,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:48:01,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-28 02:48:01,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657062824] [2022-04-28 02:48:01,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:48:01,034 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.0) internal successors, (48), 23 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2022-04-28 02:48:01,034 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:48:01,035 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 2.0) internal successors, (48), 23 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:01,068 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:48:01,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-28 02:48:01,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:48:01,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-28 02:48:01,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=992, Invalid=1078, Unknown=0, NotChecked=0, Total=2070 [2022-04-28 02:48:01,070 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand has 24 states, 24 states have (on average 2.0) internal successors, (48), 23 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:01,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:48:01,572 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2022-04-28 02:48:01,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-28 02:48:01,573 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.0) internal successors, (48), 23 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2022-04-28 02:48:01,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:48:01,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 2.0) internal successors, (48), 23 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:01,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 62 transitions. [2022-04-28 02:48:01,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 2.0) internal successors, (48), 23 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:01,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 62 transitions. [2022-04-28 02:48:01,576 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 62 transitions. [2022-04-28 02:48:01,625 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:48:01,626 INFO L225 Difference]: With dead ends: 62 [2022-04-28 02:48:01,626 INFO L226 Difference]: Without dead ends: 56 [2022-04-28 02:48:01,627 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1938, Invalid=2484, Unknown=0, NotChecked=0, Total=4422 [2022-04-28 02:48:01,627 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 50 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:48:01,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 39 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:48:01,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-28 02:48:01,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2022-04-28 02:48:01,733 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:48:01,733 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 55 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:01,733 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 55 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:01,734 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 55 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:01,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:48:01,735 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2022-04-28 02:48:01,735 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2022-04-28 02:48:01,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:48:01,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:48:01,735 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 56 states. [2022-04-28 02:48:01,735 INFO L87 Difference]: Start difference. First operand has 55 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 56 states. [2022-04-28 02:48:01,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:48:01,736 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2022-04-28 02:48:01,736 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2022-04-28 02:48:01,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:48:01,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:48:01,737 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:48:01,737 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:48:01,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:01,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2022-04-28 02:48:01,738 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 52 [2022-04-28 02:48:01,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:48:01,738 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2022-04-28 02:48:01,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.0) internal successors, (48), 23 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:01,738 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 55 transitions. [2022-04-28 02:48:01,790 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:48:01,791 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2022-04-28 02:48:01,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-28 02:48:01,791 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:48:01,791 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:48:01,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-28 02:48:01,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-04-28 02:48:01,992 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:48:01,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:48:01,992 INFO L85 PathProgramCache]: Analyzing trace with hash -404226140, now seen corresponding path program 41 times [2022-04-28 02:48:01,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:48:01,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1236595057] [2022-04-28 02:48:01,996 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:48:01,996 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:48:01,996 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:48:01,996 INFO L85 PathProgramCache]: Analyzing trace with hash -404226140, now seen corresponding path program 42 times [2022-04-28 02:48:01,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:48:01,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661073561] [2022-04-28 02:48:01,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:48:01,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:48:02,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:48:02,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:48:02,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:48:02,263 INFO L290 TraceCheckUtils]: 0: Hoare triple {9836#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {9809#true} is VALID [2022-04-28 02:48:02,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {9809#true} assume true; {9809#true} is VALID [2022-04-28 02:48:02,263 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9809#true} {9809#true} #39#return; {9809#true} is VALID [2022-04-28 02:48:02,264 INFO L272 TraceCheckUtils]: 0: Hoare triple {9809#true} call ULTIMATE.init(); {9836#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:48:02,264 INFO L290 TraceCheckUtils]: 1: Hoare triple {9836#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {9809#true} is VALID [2022-04-28 02:48:02,264 INFO L290 TraceCheckUtils]: 2: Hoare triple {9809#true} assume true; {9809#true} is VALID [2022-04-28 02:48:02,264 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9809#true} {9809#true} #39#return; {9809#true} is VALID [2022-04-28 02:48:02,264 INFO L272 TraceCheckUtils]: 4: Hoare triple {9809#true} call #t~ret6 := main(); {9809#true} is VALID [2022-04-28 02:48:02,264 INFO L290 TraceCheckUtils]: 5: Hoare triple {9809#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {9814#(= main_~i~0 0)} is VALID [2022-04-28 02:48:02,264 INFO L290 TraceCheckUtils]: 6: Hoare triple {9814#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9814#(= main_~i~0 0)} is VALID [2022-04-28 02:48:02,265 INFO L290 TraceCheckUtils]: 7: Hoare triple {9814#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9815#(<= main_~i~0 1)} is VALID [2022-04-28 02:48:02,265 INFO L290 TraceCheckUtils]: 8: Hoare triple {9815#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9815#(<= main_~i~0 1)} is VALID [2022-04-28 02:48:02,265 INFO L290 TraceCheckUtils]: 9: Hoare triple {9815#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9816#(<= main_~i~0 2)} is VALID [2022-04-28 02:48:02,266 INFO L290 TraceCheckUtils]: 10: Hoare triple {9816#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9816#(<= main_~i~0 2)} is VALID [2022-04-28 02:48:02,266 INFO L290 TraceCheckUtils]: 11: Hoare triple {9816#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9817#(<= main_~i~0 3)} is VALID [2022-04-28 02:48:02,266 INFO L290 TraceCheckUtils]: 12: Hoare triple {9817#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9817#(<= main_~i~0 3)} is VALID [2022-04-28 02:48:02,267 INFO L290 TraceCheckUtils]: 13: Hoare triple {9817#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9818#(<= main_~i~0 4)} is VALID [2022-04-28 02:48:02,267 INFO L290 TraceCheckUtils]: 14: Hoare triple {9818#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9818#(<= main_~i~0 4)} is VALID [2022-04-28 02:48:02,267 INFO L290 TraceCheckUtils]: 15: Hoare triple {9818#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9819#(<= main_~i~0 5)} is VALID [2022-04-28 02:48:02,268 INFO L290 TraceCheckUtils]: 16: Hoare triple {9819#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9819#(<= main_~i~0 5)} is VALID [2022-04-28 02:48:02,268 INFO L290 TraceCheckUtils]: 17: Hoare triple {9819#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9820#(<= main_~i~0 6)} is VALID [2022-04-28 02:48:02,268 INFO L290 TraceCheckUtils]: 18: Hoare triple {9820#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9820#(<= main_~i~0 6)} is VALID [2022-04-28 02:48:02,269 INFO L290 TraceCheckUtils]: 19: Hoare triple {9820#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9821#(<= main_~i~0 7)} is VALID [2022-04-28 02:48:02,269 INFO L290 TraceCheckUtils]: 20: Hoare triple {9821#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9821#(<= main_~i~0 7)} is VALID [2022-04-28 02:48:02,269 INFO L290 TraceCheckUtils]: 21: Hoare triple {9821#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9822#(<= main_~i~0 8)} is VALID [2022-04-28 02:48:02,269 INFO L290 TraceCheckUtils]: 22: Hoare triple {9822#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9822#(<= main_~i~0 8)} is VALID [2022-04-28 02:48:02,270 INFO L290 TraceCheckUtils]: 23: Hoare triple {9822#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9823#(<= main_~i~0 9)} is VALID [2022-04-28 02:48:02,270 INFO L290 TraceCheckUtils]: 24: Hoare triple {9823#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9823#(<= main_~i~0 9)} is VALID [2022-04-28 02:48:02,270 INFO L290 TraceCheckUtils]: 25: Hoare triple {9823#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9824#(<= main_~i~0 10)} is VALID [2022-04-28 02:48:02,271 INFO L290 TraceCheckUtils]: 26: Hoare triple {9824#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9824#(<= main_~i~0 10)} is VALID [2022-04-28 02:48:02,271 INFO L290 TraceCheckUtils]: 27: Hoare triple {9824#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9825#(<= main_~i~0 11)} is VALID [2022-04-28 02:48:02,271 INFO L290 TraceCheckUtils]: 28: Hoare triple {9825#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9825#(<= main_~i~0 11)} is VALID [2022-04-28 02:48:02,272 INFO L290 TraceCheckUtils]: 29: Hoare triple {9825#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9826#(<= main_~i~0 12)} is VALID [2022-04-28 02:48:02,272 INFO L290 TraceCheckUtils]: 30: Hoare triple {9826#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9826#(<= main_~i~0 12)} is VALID [2022-04-28 02:48:02,272 INFO L290 TraceCheckUtils]: 31: Hoare triple {9826#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9827#(<= main_~i~0 13)} is VALID [2022-04-28 02:48:02,273 INFO L290 TraceCheckUtils]: 32: Hoare triple {9827#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9827#(<= main_~i~0 13)} is VALID [2022-04-28 02:48:02,273 INFO L290 TraceCheckUtils]: 33: Hoare triple {9827#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9828#(<= main_~i~0 14)} is VALID [2022-04-28 02:48:02,273 INFO L290 TraceCheckUtils]: 34: Hoare triple {9828#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9828#(<= main_~i~0 14)} is VALID [2022-04-28 02:48:02,274 INFO L290 TraceCheckUtils]: 35: Hoare triple {9828#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9829#(<= main_~i~0 15)} is VALID [2022-04-28 02:48:02,274 INFO L290 TraceCheckUtils]: 36: Hoare triple {9829#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9829#(<= main_~i~0 15)} is VALID [2022-04-28 02:48:02,274 INFO L290 TraceCheckUtils]: 37: Hoare triple {9829#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9830#(<= main_~i~0 16)} is VALID [2022-04-28 02:48:02,274 INFO L290 TraceCheckUtils]: 38: Hoare triple {9830#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9830#(<= main_~i~0 16)} is VALID [2022-04-28 02:48:02,275 INFO L290 TraceCheckUtils]: 39: Hoare triple {9830#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9831#(<= main_~i~0 17)} is VALID [2022-04-28 02:48:02,275 INFO L290 TraceCheckUtils]: 40: Hoare triple {9831#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9831#(<= main_~i~0 17)} is VALID [2022-04-28 02:48:02,275 INFO L290 TraceCheckUtils]: 41: Hoare triple {9831#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9832#(<= main_~i~0 18)} is VALID [2022-04-28 02:48:02,276 INFO L290 TraceCheckUtils]: 42: Hoare triple {9832#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9832#(<= main_~i~0 18)} is VALID [2022-04-28 02:48:02,276 INFO L290 TraceCheckUtils]: 43: Hoare triple {9832#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9833#(<= main_~i~0 19)} is VALID [2022-04-28 02:48:02,276 INFO L290 TraceCheckUtils]: 44: Hoare triple {9833#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9833#(<= main_~i~0 19)} is VALID [2022-04-28 02:48:02,277 INFO L290 TraceCheckUtils]: 45: Hoare triple {9833#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9834#(<= main_~i~0 20)} is VALID [2022-04-28 02:48:02,277 INFO L290 TraceCheckUtils]: 46: Hoare triple {9834#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9834#(<= main_~i~0 20)} is VALID [2022-04-28 02:48:02,277 INFO L290 TraceCheckUtils]: 47: Hoare triple {9834#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9835#(<= main_~i~0 21)} is VALID [2022-04-28 02:48:02,278 INFO L290 TraceCheckUtils]: 48: Hoare triple {9835#(<= main_~i~0 21)} assume !(~i~0 < 1024); {9810#false} is VALID [2022-04-28 02:48:02,278 INFO L290 TraceCheckUtils]: 49: Hoare triple {9810#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {9810#false} is VALID [2022-04-28 02:48:02,278 INFO L272 TraceCheckUtils]: 50: Hoare triple {9810#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {9810#false} is VALID [2022-04-28 02:48:02,278 INFO L290 TraceCheckUtils]: 51: Hoare triple {9810#false} ~cond := #in~cond; {9810#false} is VALID [2022-04-28 02:48:02,278 INFO L290 TraceCheckUtils]: 52: Hoare triple {9810#false} assume 0 == ~cond; {9810#false} is VALID [2022-04-28 02:48:02,278 INFO L290 TraceCheckUtils]: 53: Hoare triple {9810#false} assume !false; {9810#false} is VALID [2022-04-28 02:48:02,278 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:48:02,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:48:02,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661073561] [2022-04-28 02:48:02,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661073561] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:48:02,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672638507] [2022-04-28 02:48:02,279 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 02:48:02,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:48:02,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:48:02,280 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:48:02,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-28 02:48:02,820 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2022-04-28 02:48:02,820 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:48:02,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 02:48:02,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:48:02,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:48:03,116 INFO L272 TraceCheckUtils]: 0: Hoare triple {9809#true} call ULTIMATE.init(); {9809#true} is VALID [2022-04-28 02:48:03,116 INFO L290 TraceCheckUtils]: 1: Hoare triple {9809#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {9809#true} is VALID [2022-04-28 02:48:03,117 INFO L290 TraceCheckUtils]: 2: Hoare triple {9809#true} assume true; {9809#true} is VALID [2022-04-28 02:48:03,117 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9809#true} {9809#true} #39#return; {9809#true} is VALID [2022-04-28 02:48:03,117 INFO L272 TraceCheckUtils]: 4: Hoare triple {9809#true} call #t~ret6 := main(); {9809#true} is VALID [2022-04-28 02:48:03,117 INFO L290 TraceCheckUtils]: 5: Hoare triple {9809#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {9855#(<= main_~i~0 0)} is VALID [2022-04-28 02:48:03,117 INFO L290 TraceCheckUtils]: 6: Hoare triple {9855#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9855#(<= main_~i~0 0)} is VALID [2022-04-28 02:48:03,118 INFO L290 TraceCheckUtils]: 7: Hoare triple {9855#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9815#(<= main_~i~0 1)} is VALID [2022-04-28 02:48:03,118 INFO L290 TraceCheckUtils]: 8: Hoare triple {9815#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9815#(<= main_~i~0 1)} is VALID [2022-04-28 02:48:03,119 INFO L290 TraceCheckUtils]: 9: Hoare triple {9815#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9816#(<= main_~i~0 2)} is VALID [2022-04-28 02:48:03,119 INFO L290 TraceCheckUtils]: 10: Hoare triple {9816#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9816#(<= main_~i~0 2)} is VALID [2022-04-28 02:48:03,120 INFO L290 TraceCheckUtils]: 11: Hoare triple {9816#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9817#(<= main_~i~0 3)} is VALID [2022-04-28 02:48:03,121 INFO L290 TraceCheckUtils]: 12: Hoare triple {9817#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9817#(<= main_~i~0 3)} is VALID [2022-04-28 02:48:03,121 INFO L290 TraceCheckUtils]: 13: Hoare triple {9817#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9818#(<= main_~i~0 4)} is VALID [2022-04-28 02:48:03,122 INFO L290 TraceCheckUtils]: 14: Hoare triple {9818#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9818#(<= main_~i~0 4)} is VALID [2022-04-28 02:48:03,123 INFO L290 TraceCheckUtils]: 15: Hoare triple {9818#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9819#(<= main_~i~0 5)} is VALID [2022-04-28 02:48:03,123 INFO L290 TraceCheckUtils]: 16: Hoare triple {9819#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9819#(<= main_~i~0 5)} is VALID [2022-04-28 02:48:03,126 INFO L290 TraceCheckUtils]: 17: Hoare triple {9819#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9820#(<= main_~i~0 6)} is VALID [2022-04-28 02:48:03,126 INFO L290 TraceCheckUtils]: 18: Hoare triple {9820#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9820#(<= main_~i~0 6)} is VALID [2022-04-28 02:48:03,127 INFO L290 TraceCheckUtils]: 19: Hoare triple {9820#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9821#(<= main_~i~0 7)} is VALID [2022-04-28 02:48:03,127 INFO L290 TraceCheckUtils]: 20: Hoare triple {9821#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9821#(<= main_~i~0 7)} is VALID [2022-04-28 02:48:03,128 INFO L290 TraceCheckUtils]: 21: Hoare triple {9821#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9822#(<= main_~i~0 8)} is VALID [2022-04-28 02:48:03,128 INFO L290 TraceCheckUtils]: 22: Hoare triple {9822#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9822#(<= main_~i~0 8)} is VALID [2022-04-28 02:48:03,128 INFO L290 TraceCheckUtils]: 23: Hoare triple {9822#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9823#(<= main_~i~0 9)} is VALID [2022-04-28 02:48:03,129 INFO L290 TraceCheckUtils]: 24: Hoare triple {9823#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9823#(<= main_~i~0 9)} is VALID [2022-04-28 02:48:03,129 INFO L290 TraceCheckUtils]: 25: Hoare triple {9823#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9824#(<= main_~i~0 10)} is VALID [2022-04-28 02:48:03,129 INFO L290 TraceCheckUtils]: 26: Hoare triple {9824#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9824#(<= main_~i~0 10)} is VALID [2022-04-28 02:48:03,130 INFO L290 TraceCheckUtils]: 27: Hoare triple {9824#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9825#(<= main_~i~0 11)} is VALID [2022-04-28 02:48:03,130 INFO L290 TraceCheckUtils]: 28: Hoare triple {9825#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9825#(<= main_~i~0 11)} is VALID [2022-04-28 02:48:03,130 INFO L290 TraceCheckUtils]: 29: Hoare triple {9825#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9826#(<= main_~i~0 12)} is VALID [2022-04-28 02:48:03,131 INFO L290 TraceCheckUtils]: 30: Hoare triple {9826#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9826#(<= main_~i~0 12)} is VALID [2022-04-28 02:48:03,131 INFO L290 TraceCheckUtils]: 31: Hoare triple {9826#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9827#(<= main_~i~0 13)} is VALID [2022-04-28 02:48:03,131 INFO L290 TraceCheckUtils]: 32: Hoare triple {9827#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9827#(<= main_~i~0 13)} is VALID [2022-04-28 02:48:03,132 INFO L290 TraceCheckUtils]: 33: Hoare triple {9827#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9828#(<= main_~i~0 14)} is VALID [2022-04-28 02:48:03,132 INFO L290 TraceCheckUtils]: 34: Hoare triple {9828#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9828#(<= main_~i~0 14)} is VALID [2022-04-28 02:48:03,132 INFO L290 TraceCheckUtils]: 35: Hoare triple {9828#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9829#(<= main_~i~0 15)} is VALID [2022-04-28 02:48:03,132 INFO L290 TraceCheckUtils]: 36: Hoare triple {9829#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9829#(<= main_~i~0 15)} is VALID [2022-04-28 02:48:03,133 INFO L290 TraceCheckUtils]: 37: Hoare triple {9829#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9830#(<= main_~i~0 16)} is VALID [2022-04-28 02:48:03,133 INFO L290 TraceCheckUtils]: 38: Hoare triple {9830#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9830#(<= main_~i~0 16)} is VALID [2022-04-28 02:48:03,133 INFO L290 TraceCheckUtils]: 39: Hoare triple {9830#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9831#(<= main_~i~0 17)} is VALID [2022-04-28 02:48:03,134 INFO L290 TraceCheckUtils]: 40: Hoare triple {9831#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9831#(<= main_~i~0 17)} is VALID [2022-04-28 02:48:03,134 INFO L290 TraceCheckUtils]: 41: Hoare triple {9831#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9832#(<= main_~i~0 18)} is VALID [2022-04-28 02:48:03,134 INFO L290 TraceCheckUtils]: 42: Hoare triple {9832#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9832#(<= main_~i~0 18)} is VALID [2022-04-28 02:48:03,135 INFO L290 TraceCheckUtils]: 43: Hoare triple {9832#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9833#(<= main_~i~0 19)} is VALID [2022-04-28 02:48:03,135 INFO L290 TraceCheckUtils]: 44: Hoare triple {9833#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9833#(<= main_~i~0 19)} is VALID [2022-04-28 02:48:03,135 INFO L290 TraceCheckUtils]: 45: Hoare triple {9833#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9834#(<= main_~i~0 20)} is VALID [2022-04-28 02:48:03,136 INFO L290 TraceCheckUtils]: 46: Hoare triple {9834#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9834#(<= main_~i~0 20)} is VALID [2022-04-28 02:48:03,136 INFO L290 TraceCheckUtils]: 47: Hoare triple {9834#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9835#(<= main_~i~0 21)} is VALID [2022-04-28 02:48:03,136 INFO L290 TraceCheckUtils]: 48: Hoare triple {9835#(<= main_~i~0 21)} assume !(~i~0 < 1024); {9810#false} is VALID [2022-04-28 02:48:03,136 INFO L290 TraceCheckUtils]: 49: Hoare triple {9810#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {9810#false} is VALID [2022-04-28 02:48:03,136 INFO L272 TraceCheckUtils]: 50: Hoare triple {9810#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {9810#false} is VALID [2022-04-28 02:48:03,136 INFO L290 TraceCheckUtils]: 51: Hoare triple {9810#false} ~cond := #in~cond; {9810#false} is VALID [2022-04-28 02:48:03,137 INFO L290 TraceCheckUtils]: 52: Hoare triple {9810#false} assume 0 == ~cond; {9810#false} is VALID [2022-04-28 02:48:03,137 INFO L290 TraceCheckUtils]: 53: Hoare triple {9810#false} assume !false; {9810#false} is VALID [2022-04-28 02:48:03,137 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:48:03,137 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:48:03,956 INFO L290 TraceCheckUtils]: 53: Hoare triple {9810#false} assume !false; {9810#false} is VALID [2022-04-28 02:48:03,956 INFO L290 TraceCheckUtils]: 52: Hoare triple {9810#false} assume 0 == ~cond; {9810#false} is VALID [2022-04-28 02:48:03,956 INFO L290 TraceCheckUtils]: 51: Hoare triple {9810#false} ~cond := #in~cond; {9810#false} is VALID [2022-04-28 02:48:03,956 INFO L272 TraceCheckUtils]: 50: Hoare triple {9810#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {9810#false} is VALID [2022-04-28 02:48:03,956 INFO L290 TraceCheckUtils]: 49: Hoare triple {9810#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {9810#false} is VALID [2022-04-28 02:48:03,956 INFO L290 TraceCheckUtils]: 48: Hoare triple {10015#(< main_~i~0 1024)} assume !(~i~0 < 1024); {9810#false} is VALID [2022-04-28 02:48:03,957 INFO L290 TraceCheckUtils]: 47: Hoare triple {10019#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10015#(< main_~i~0 1024)} is VALID [2022-04-28 02:48:03,957 INFO L290 TraceCheckUtils]: 46: Hoare triple {10019#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10019#(< main_~i~0 1023)} is VALID [2022-04-28 02:48:03,957 INFO L290 TraceCheckUtils]: 45: Hoare triple {10026#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10019#(< main_~i~0 1023)} is VALID [2022-04-28 02:48:03,958 INFO L290 TraceCheckUtils]: 44: Hoare triple {10026#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10026#(< main_~i~0 1022)} is VALID [2022-04-28 02:48:03,958 INFO L290 TraceCheckUtils]: 43: Hoare triple {10033#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10026#(< main_~i~0 1022)} is VALID [2022-04-28 02:48:03,958 INFO L290 TraceCheckUtils]: 42: Hoare triple {10033#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10033#(< main_~i~0 1021)} is VALID [2022-04-28 02:48:03,959 INFO L290 TraceCheckUtils]: 41: Hoare triple {10040#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10033#(< main_~i~0 1021)} is VALID [2022-04-28 02:48:03,959 INFO L290 TraceCheckUtils]: 40: Hoare triple {10040#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10040#(< main_~i~0 1020)} is VALID [2022-04-28 02:48:03,959 INFO L290 TraceCheckUtils]: 39: Hoare triple {10047#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10040#(< main_~i~0 1020)} is VALID [2022-04-28 02:48:03,960 INFO L290 TraceCheckUtils]: 38: Hoare triple {10047#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10047#(< main_~i~0 1019)} is VALID [2022-04-28 02:48:03,960 INFO L290 TraceCheckUtils]: 37: Hoare triple {10054#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10047#(< main_~i~0 1019)} is VALID [2022-04-28 02:48:03,960 INFO L290 TraceCheckUtils]: 36: Hoare triple {10054#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10054#(< main_~i~0 1018)} is VALID [2022-04-28 02:48:03,961 INFO L290 TraceCheckUtils]: 35: Hoare triple {10061#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10054#(< main_~i~0 1018)} is VALID [2022-04-28 02:48:03,961 INFO L290 TraceCheckUtils]: 34: Hoare triple {10061#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10061#(< main_~i~0 1017)} is VALID [2022-04-28 02:48:03,961 INFO L290 TraceCheckUtils]: 33: Hoare triple {10068#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10061#(< main_~i~0 1017)} is VALID [2022-04-28 02:48:03,961 INFO L290 TraceCheckUtils]: 32: Hoare triple {10068#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10068#(< main_~i~0 1016)} is VALID [2022-04-28 02:48:03,962 INFO L290 TraceCheckUtils]: 31: Hoare triple {10075#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10068#(< main_~i~0 1016)} is VALID [2022-04-28 02:48:03,962 INFO L290 TraceCheckUtils]: 30: Hoare triple {10075#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10075#(< main_~i~0 1015)} is VALID [2022-04-28 02:48:03,962 INFO L290 TraceCheckUtils]: 29: Hoare triple {10082#(< main_~i~0 1014)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10075#(< main_~i~0 1015)} is VALID [2022-04-28 02:48:03,963 INFO L290 TraceCheckUtils]: 28: Hoare triple {10082#(< main_~i~0 1014)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10082#(< main_~i~0 1014)} is VALID [2022-04-28 02:48:03,963 INFO L290 TraceCheckUtils]: 27: Hoare triple {10089#(< main_~i~0 1013)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10082#(< main_~i~0 1014)} is VALID [2022-04-28 02:48:03,963 INFO L290 TraceCheckUtils]: 26: Hoare triple {10089#(< main_~i~0 1013)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10089#(< main_~i~0 1013)} is VALID [2022-04-28 02:48:03,964 INFO L290 TraceCheckUtils]: 25: Hoare triple {10096#(< main_~i~0 1012)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10089#(< main_~i~0 1013)} is VALID [2022-04-28 02:48:03,964 INFO L290 TraceCheckUtils]: 24: Hoare triple {10096#(< main_~i~0 1012)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10096#(< main_~i~0 1012)} is VALID [2022-04-28 02:48:03,964 INFO L290 TraceCheckUtils]: 23: Hoare triple {10103#(< main_~i~0 1011)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10096#(< main_~i~0 1012)} is VALID [2022-04-28 02:48:03,965 INFO L290 TraceCheckUtils]: 22: Hoare triple {10103#(< main_~i~0 1011)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10103#(< main_~i~0 1011)} is VALID [2022-04-28 02:48:03,965 INFO L290 TraceCheckUtils]: 21: Hoare triple {10110#(< main_~i~0 1010)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10103#(< main_~i~0 1011)} is VALID [2022-04-28 02:48:03,965 INFO L290 TraceCheckUtils]: 20: Hoare triple {10110#(< main_~i~0 1010)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10110#(< main_~i~0 1010)} is VALID [2022-04-28 02:48:03,966 INFO L290 TraceCheckUtils]: 19: Hoare triple {10117#(< main_~i~0 1009)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10110#(< main_~i~0 1010)} is VALID [2022-04-28 02:48:03,966 INFO L290 TraceCheckUtils]: 18: Hoare triple {10117#(< main_~i~0 1009)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10117#(< main_~i~0 1009)} is VALID [2022-04-28 02:48:03,966 INFO L290 TraceCheckUtils]: 17: Hoare triple {10124#(< main_~i~0 1008)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10117#(< main_~i~0 1009)} is VALID [2022-04-28 02:48:03,966 INFO L290 TraceCheckUtils]: 16: Hoare triple {10124#(< main_~i~0 1008)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10124#(< main_~i~0 1008)} is VALID [2022-04-28 02:48:03,967 INFO L290 TraceCheckUtils]: 15: Hoare triple {10131#(< main_~i~0 1007)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10124#(< main_~i~0 1008)} is VALID [2022-04-28 02:48:03,967 INFO L290 TraceCheckUtils]: 14: Hoare triple {10131#(< main_~i~0 1007)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10131#(< main_~i~0 1007)} is VALID [2022-04-28 02:48:03,967 INFO L290 TraceCheckUtils]: 13: Hoare triple {10138#(< main_~i~0 1006)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10131#(< main_~i~0 1007)} is VALID [2022-04-28 02:48:03,968 INFO L290 TraceCheckUtils]: 12: Hoare triple {10138#(< main_~i~0 1006)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10138#(< main_~i~0 1006)} is VALID [2022-04-28 02:48:03,968 INFO L290 TraceCheckUtils]: 11: Hoare triple {10145#(< main_~i~0 1005)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10138#(< main_~i~0 1006)} is VALID [2022-04-28 02:48:03,968 INFO L290 TraceCheckUtils]: 10: Hoare triple {10145#(< main_~i~0 1005)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10145#(< main_~i~0 1005)} is VALID [2022-04-28 02:48:03,969 INFO L290 TraceCheckUtils]: 9: Hoare triple {10152#(< main_~i~0 1004)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10145#(< main_~i~0 1005)} is VALID [2022-04-28 02:48:03,969 INFO L290 TraceCheckUtils]: 8: Hoare triple {10152#(< main_~i~0 1004)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10152#(< main_~i~0 1004)} is VALID [2022-04-28 02:48:03,969 INFO L290 TraceCheckUtils]: 7: Hoare triple {10159#(< main_~i~0 1003)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10152#(< main_~i~0 1004)} is VALID [2022-04-28 02:48:03,970 INFO L290 TraceCheckUtils]: 6: Hoare triple {10159#(< main_~i~0 1003)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10159#(< main_~i~0 1003)} is VALID [2022-04-28 02:48:03,970 INFO L290 TraceCheckUtils]: 5: Hoare triple {9809#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {10159#(< main_~i~0 1003)} is VALID [2022-04-28 02:48:03,970 INFO L272 TraceCheckUtils]: 4: Hoare triple {9809#true} call #t~ret6 := main(); {9809#true} is VALID [2022-04-28 02:48:03,970 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9809#true} {9809#true} #39#return; {9809#true} is VALID [2022-04-28 02:48:03,970 INFO L290 TraceCheckUtils]: 2: Hoare triple {9809#true} assume true; {9809#true} is VALID [2022-04-28 02:48:03,970 INFO L290 TraceCheckUtils]: 1: Hoare triple {9809#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {9809#true} is VALID [2022-04-28 02:48:03,970 INFO L272 TraceCheckUtils]: 0: Hoare triple {9809#true} call ULTIMATE.init(); {9809#true} is VALID [2022-04-28 02:48:03,971 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:48:03,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672638507] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:48:03,971 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:48:03,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 48 [2022-04-28 02:48:03,971 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:48:03,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1236595057] [2022-04-28 02:48:03,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1236595057] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:48:03,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:48:03,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-28 02:48:03,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998694539] [2022-04-28 02:48:03,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:48:03,972 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2022-04-28 02:48:03,972 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:48:03,972 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:04,005 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:48:04,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-28 02:48:04,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:48:04,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-28 02:48:04,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1083, Invalid=1173, Unknown=0, NotChecked=0, Total=2256 [2022-04-28 02:48:04,006 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand has 25 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:04,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:48:04,545 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2022-04-28 02:48:04,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-28 02:48:04,546 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2022-04-28 02:48:04,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:48:04,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:04,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 64 transitions. [2022-04-28 02:48:04,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:04,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 64 transitions. [2022-04-28 02:48:04,548 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 64 transitions. [2022-04-28 02:48:04,599 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:48:04,599 INFO L225 Difference]: With dead ends: 64 [2022-04-28 02:48:04,599 INFO L226 Difference]: Without dead ends: 58 [2022-04-28 02:48:04,601 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2118, Invalid=2712, Unknown=0, NotChecked=0, Total=4830 [2022-04-28 02:48:04,601 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 52 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:48:04,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 39 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:48:04,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-28 02:48:04,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2022-04-28 02:48:04,708 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:48:04,709 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 57 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:04,709 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 57 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:04,709 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 57 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:04,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:48:04,709 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2022-04-28 02:48:04,709 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2022-04-28 02:48:04,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:48:04,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:48:04,710 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 58 states. [2022-04-28 02:48:04,710 INFO L87 Difference]: Start difference. First operand has 57 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 58 states. [2022-04-28 02:48:04,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:48:04,711 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2022-04-28 02:48:04,711 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2022-04-28 02:48:04,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:48:04,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:48:04,711 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:48:04,711 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:48:04,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:04,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2022-04-28 02:48:04,712 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 54 [2022-04-28 02:48:04,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:48:04,712 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2022-04-28 02:48:04,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:04,713 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 57 transitions. [2022-04-28 02:48:04,779 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:48:04,779 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2022-04-28 02:48:04,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-28 02:48:04,780 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:48:04,780 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:48:04,798 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-28 02:48:04,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-04-28 02:48:04,983 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:48:04,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:48:04,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1506615846, now seen corresponding path program 43 times [2022-04-28 02:48:04,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:48:04,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [963254301] [2022-04-28 02:48:04,986 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:48:04,986 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:48:04,986 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:48:04,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1506615846, now seen corresponding path program 44 times [2022-04-28 02:48:04,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:48:04,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901539830] [2022-04-28 02:48:04,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:48:04,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:48:05,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:48:05,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:48:05,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:48:05,302 INFO L290 TraceCheckUtils]: 0: Hoare triple {10613#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {10585#true} is VALID [2022-04-28 02:48:05,302 INFO L290 TraceCheckUtils]: 1: Hoare triple {10585#true} assume true; {10585#true} is VALID [2022-04-28 02:48:05,302 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10585#true} {10585#true} #39#return; {10585#true} is VALID [2022-04-28 02:48:05,302 INFO L272 TraceCheckUtils]: 0: Hoare triple {10585#true} call ULTIMATE.init(); {10613#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:48:05,302 INFO L290 TraceCheckUtils]: 1: Hoare triple {10613#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {10585#true} is VALID [2022-04-28 02:48:05,302 INFO L290 TraceCheckUtils]: 2: Hoare triple {10585#true} assume true; {10585#true} is VALID [2022-04-28 02:48:05,302 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10585#true} {10585#true} #39#return; {10585#true} is VALID [2022-04-28 02:48:05,302 INFO L272 TraceCheckUtils]: 4: Hoare triple {10585#true} call #t~ret6 := main(); {10585#true} is VALID [2022-04-28 02:48:05,303 INFO L290 TraceCheckUtils]: 5: Hoare triple {10585#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {10590#(= main_~i~0 0)} is VALID [2022-04-28 02:48:05,303 INFO L290 TraceCheckUtils]: 6: Hoare triple {10590#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10590#(= main_~i~0 0)} is VALID [2022-04-28 02:48:05,303 INFO L290 TraceCheckUtils]: 7: Hoare triple {10590#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10591#(<= main_~i~0 1)} is VALID [2022-04-28 02:48:05,304 INFO L290 TraceCheckUtils]: 8: Hoare triple {10591#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10591#(<= main_~i~0 1)} is VALID [2022-04-28 02:48:05,304 INFO L290 TraceCheckUtils]: 9: Hoare triple {10591#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10592#(<= main_~i~0 2)} is VALID [2022-04-28 02:48:05,304 INFO L290 TraceCheckUtils]: 10: Hoare triple {10592#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10592#(<= main_~i~0 2)} is VALID [2022-04-28 02:48:05,305 INFO L290 TraceCheckUtils]: 11: Hoare triple {10592#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10593#(<= main_~i~0 3)} is VALID [2022-04-28 02:48:05,305 INFO L290 TraceCheckUtils]: 12: Hoare triple {10593#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10593#(<= main_~i~0 3)} is VALID [2022-04-28 02:48:05,305 INFO L290 TraceCheckUtils]: 13: Hoare triple {10593#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10594#(<= main_~i~0 4)} is VALID [2022-04-28 02:48:05,305 INFO L290 TraceCheckUtils]: 14: Hoare triple {10594#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10594#(<= main_~i~0 4)} is VALID [2022-04-28 02:48:05,306 INFO L290 TraceCheckUtils]: 15: Hoare triple {10594#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10595#(<= main_~i~0 5)} is VALID [2022-04-28 02:48:05,306 INFO L290 TraceCheckUtils]: 16: Hoare triple {10595#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10595#(<= main_~i~0 5)} is VALID [2022-04-28 02:48:05,306 INFO L290 TraceCheckUtils]: 17: Hoare triple {10595#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10596#(<= main_~i~0 6)} is VALID [2022-04-28 02:48:05,307 INFO L290 TraceCheckUtils]: 18: Hoare triple {10596#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10596#(<= main_~i~0 6)} is VALID [2022-04-28 02:48:05,307 INFO L290 TraceCheckUtils]: 19: Hoare triple {10596#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10597#(<= main_~i~0 7)} is VALID [2022-04-28 02:48:05,307 INFO L290 TraceCheckUtils]: 20: Hoare triple {10597#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10597#(<= main_~i~0 7)} is VALID [2022-04-28 02:48:05,308 INFO L290 TraceCheckUtils]: 21: Hoare triple {10597#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10598#(<= main_~i~0 8)} is VALID [2022-04-28 02:48:05,308 INFO L290 TraceCheckUtils]: 22: Hoare triple {10598#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10598#(<= main_~i~0 8)} is VALID [2022-04-28 02:48:05,308 INFO L290 TraceCheckUtils]: 23: Hoare triple {10598#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10599#(<= main_~i~0 9)} is VALID [2022-04-28 02:48:05,309 INFO L290 TraceCheckUtils]: 24: Hoare triple {10599#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10599#(<= main_~i~0 9)} is VALID [2022-04-28 02:48:05,309 INFO L290 TraceCheckUtils]: 25: Hoare triple {10599#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10600#(<= main_~i~0 10)} is VALID [2022-04-28 02:48:05,309 INFO L290 TraceCheckUtils]: 26: Hoare triple {10600#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10600#(<= main_~i~0 10)} is VALID [2022-04-28 02:48:05,310 INFO L290 TraceCheckUtils]: 27: Hoare triple {10600#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10601#(<= main_~i~0 11)} is VALID [2022-04-28 02:48:05,310 INFO L290 TraceCheckUtils]: 28: Hoare triple {10601#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10601#(<= main_~i~0 11)} is VALID [2022-04-28 02:48:05,310 INFO L290 TraceCheckUtils]: 29: Hoare triple {10601#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10602#(<= main_~i~0 12)} is VALID [2022-04-28 02:48:05,310 INFO L290 TraceCheckUtils]: 30: Hoare triple {10602#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10602#(<= main_~i~0 12)} is VALID [2022-04-28 02:48:05,311 INFO L290 TraceCheckUtils]: 31: Hoare triple {10602#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10603#(<= main_~i~0 13)} is VALID [2022-04-28 02:48:05,311 INFO L290 TraceCheckUtils]: 32: Hoare triple {10603#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10603#(<= main_~i~0 13)} is VALID [2022-04-28 02:48:05,311 INFO L290 TraceCheckUtils]: 33: Hoare triple {10603#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10604#(<= main_~i~0 14)} is VALID [2022-04-28 02:48:05,312 INFO L290 TraceCheckUtils]: 34: Hoare triple {10604#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10604#(<= main_~i~0 14)} is VALID [2022-04-28 02:48:05,312 INFO L290 TraceCheckUtils]: 35: Hoare triple {10604#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10605#(<= main_~i~0 15)} is VALID [2022-04-28 02:48:05,312 INFO L290 TraceCheckUtils]: 36: Hoare triple {10605#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10605#(<= main_~i~0 15)} is VALID [2022-04-28 02:48:05,313 INFO L290 TraceCheckUtils]: 37: Hoare triple {10605#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10606#(<= main_~i~0 16)} is VALID [2022-04-28 02:48:05,313 INFO L290 TraceCheckUtils]: 38: Hoare triple {10606#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10606#(<= main_~i~0 16)} is VALID [2022-04-28 02:48:05,313 INFO L290 TraceCheckUtils]: 39: Hoare triple {10606#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10607#(<= main_~i~0 17)} is VALID [2022-04-28 02:48:05,314 INFO L290 TraceCheckUtils]: 40: Hoare triple {10607#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10607#(<= main_~i~0 17)} is VALID [2022-04-28 02:48:05,314 INFO L290 TraceCheckUtils]: 41: Hoare triple {10607#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10608#(<= main_~i~0 18)} is VALID [2022-04-28 02:48:05,314 INFO L290 TraceCheckUtils]: 42: Hoare triple {10608#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10608#(<= main_~i~0 18)} is VALID [2022-04-28 02:48:05,315 INFO L290 TraceCheckUtils]: 43: Hoare triple {10608#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10609#(<= main_~i~0 19)} is VALID [2022-04-28 02:48:05,315 INFO L290 TraceCheckUtils]: 44: Hoare triple {10609#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10609#(<= main_~i~0 19)} is VALID [2022-04-28 02:48:05,315 INFO L290 TraceCheckUtils]: 45: Hoare triple {10609#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10610#(<= main_~i~0 20)} is VALID [2022-04-28 02:48:05,315 INFO L290 TraceCheckUtils]: 46: Hoare triple {10610#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10610#(<= main_~i~0 20)} is VALID [2022-04-28 02:48:05,316 INFO L290 TraceCheckUtils]: 47: Hoare triple {10610#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10611#(<= main_~i~0 21)} is VALID [2022-04-28 02:48:05,316 INFO L290 TraceCheckUtils]: 48: Hoare triple {10611#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10611#(<= main_~i~0 21)} is VALID [2022-04-28 02:48:05,316 INFO L290 TraceCheckUtils]: 49: Hoare triple {10611#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10612#(<= main_~i~0 22)} is VALID [2022-04-28 02:48:05,317 INFO L290 TraceCheckUtils]: 50: Hoare triple {10612#(<= main_~i~0 22)} assume !(~i~0 < 1024); {10586#false} is VALID [2022-04-28 02:48:05,317 INFO L290 TraceCheckUtils]: 51: Hoare triple {10586#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {10586#false} is VALID [2022-04-28 02:48:05,317 INFO L272 TraceCheckUtils]: 52: Hoare triple {10586#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {10586#false} is VALID [2022-04-28 02:48:05,317 INFO L290 TraceCheckUtils]: 53: Hoare triple {10586#false} ~cond := #in~cond; {10586#false} is VALID [2022-04-28 02:48:05,317 INFO L290 TraceCheckUtils]: 54: Hoare triple {10586#false} assume 0 == ~cond; {10586#false} is VALID [2022-04-28 02:48:05,317 INFO L290 TraceCheckUtils]: 55: Hoare triple {10586#false} assume !false; {10586#false} is VALID [2022-04-28 02:48:05,317 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:48:05,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:48:05,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901539830] [2022-04-28 02:48:05,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901539830] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:48:05,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603652072] [2022-04-28 02:48:05,318 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:48:05,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:48:05,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:48:05,319 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:48:05,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-28 02:48:05,411 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:48:05,412 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:48:05,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 02:48:05,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:48:05,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:48:05,724 INFO L272 TraceCheckUtils]: 0: Hoare triple {10585#true} call ULTIMATE.init(); {10585#true} is VALID [2022-04-28 02:48:05,724 INFO L290 TraceCheckUtils]: 1: Hoare triple {10585#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {10585#true} is VALID [2022-04-28 02:48:05,724 INFO L290 TraceCheckUtils]: 2: Hoare triple {10585#true} assume true; {10585#true} is VALID [2022-04-28 02:48:05,724 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10585#true} {10585#true} #39#return; {10585#true} is VALID [2022-04-28 02:48:05,724 INFO L272 TraceCheckUtils]: 4: Hoare triple {10585#true} call #t~ret6 := main(); {10585#true} is VALID [2022-04-28 02:48:05,725 INFO L290 TraceCheckUtils]: 5: Hoare triple {10585#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {10632#(<= main_~i~0 0)} is VALID [2022-04-28 02:48:05,725 INFO L290 TraceCheckUtils]: 6: Hoare triple {10632#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10632#(<= main_~i~0 0)} is VALID [2022-04-28 02:48:05,725 INFO L290 TraceCheckUtils]: 7: Hoare triple {10632#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10591#(<= main_~i~0 1)} is VALID [2022-04-28 02:48:05,726 INFO L290 TraceCheckUtils]: 8: Hoare triple {10591#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10591#(<= main_~i~0 1)} is VALID [2022-04-28 02:48:05,726 INFO L290 TraceCheckUtils]: 9: Hoare triple {10591#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10592#(<= main_~i~0 2)} is VALID [2022-04-28 02:48:05,726 INFO L290 TraceCheckUtils]: 10: Hoare triple {10592#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10592#(<= main_~i~0 2)} is VALID [2022-04-28 02:48:05,727 INFO L290 TraceCheckUtils]: 11: Hoare triple {10592#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10593#(<= main_~i~0 3)} is VALID [2022-04-28 02:48:05,727 INFO L290 TraceCheckUtils]: 12: Hoare triple {10593#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10593#(<= main_~i~0 3)} is VALID [2022-04-28 02:48:05,727 INFO L290 TraceCheckUtils]: 13: Hoare triple {10593#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10594#(<= main_~i~0 4)} is VALID [2022-04-28 02:48:05,728 INFO L290 TraceCheckUtils]: 14: Hoare triple {10594#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10594#(<= main_~i~0 4)} is VALID [2022-04-28 02:48:05,728 INFO L290 TraceCheckUtils]: 15: Hoare triple {10594#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10595#(<= main_~i~0 5)} is VALID [2022-04-28 02:48:05,729 INFO L290 TraceCheckUtils]: 16: Hoare triple {10595#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10595#(<= main_~i~0 5)} is VALID [2022-04-28 02:48:05,729 INFO L290 TraceCheckUtils]: 17: Hoare triple {10595#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10596#(<= main_~i~0 6)} is VALID [2022-04-28 02:48:05,730 INFO L290 TraceCheckUtils]: 18: Hoare triple {10596#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10596#(<= main_~i~0 6)} is VALID [2022-04-28 02:48:05,730 INFO L290 TraceCheckUtils]: 19: Hoare triple {10596#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10597#(<= main_~i~0 7)} is VALID [2022-04-28 02:48:05,730 INFO L290 TraceCheckUtils]: 20: Hoare triple {10597#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10597#(<= main_~i~0 7)} is VALID [2022-04-28 02:48:05,731 INFO L290 TraceCheckUtils]: 21: Hoare triple {10597#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10598#(<= main_~i~0 8)} is VALID [2022-04-28 02:48:05,731 INFO L290 TraceCheckUtils]: 22: Hoare triple {10598#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10598#(<= main_~i~0 8)} is VALID [2022-04-28 02:48:05,731 INFO L290 TraceCheckUtils]: 23: Hoare triple {10598#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10599#(<= main_~i~0 9)} is VALID [2022-04-28 02:48:05,732 INFO L290 TraceCheckUtils]: 24: Hoare triple {10599#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10599#(<= main_~i~0 9)} is VALID [2022-04-28 02:48:05,732 INFO L290 TraceCheckUtils]: 25: Hoare triple {10599#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10600#(<= main_~i~0 10)} is VALID [2022-04-28 02:48:05,733 INFO L290 TraceCheckUtils]: 26: Hoare triple {10600#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10600#(<= main_~i~0 10)} is VALID [2022-04-28 02:48:05,733 INFO L290 TraceCheckUtils]: 27: Hoare triple {10600#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10601#(<= main_~i~0 11)} is VALID [2022-04-28 02:48:05,733 INFO L290 TraceCheckUtils]: 28: Hoare triple {10601#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10601#(<= main_~i~0 11)} is VALID [2022-04-28 02:48:05,734 INFO L290 TraceCheckUtils]: 29: Hoare triple {10601#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10602#(<= main_~i~0 12)} is VALID [2022-04-28 02:48:05,734 INFO L290 TraceCheckUtils]: 30: Hoare triple {10602#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10602#(<= main_~i~0 12)} is VALID [2022-04-28 02:48:05,734 INFO L290 TraceCheckUtils]: 31: Hoare triple {10602#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10603#(<= main_~i~0 13)} is VALID [2022-04-28 02:48:05,735 INFO L290 TraceCheckUtils]: 32: Hoare triple {10603#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10603#(<= main_~i~0 13)} is VALID [2022-04-28 02:48:05,735 INFO L290 TraceCheckUtils]: 33: Hoare triple {10603#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10604#(<= main_~i~0 14)} is VALID [2022-04-28 02:48:05,735 INFO L290 TraceCheckUtils]: 34: Hoare triple {10604#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10604#(<= main_~i~0 14)} is VALID [2022-04-28 02:48:05,736 INFO L290 TraceCheckUtils]: 35: Hoare triple {10604#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10605#(<= main_~i~0 15)} is VALID [2022-04-28 02:48:05,736 INFO L290 TraceCheckUtils]: 36: Hoare triple {10605#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10605#(<= main_~i~0 15)} is VALID [2022-04-28 02:48:05,736 INFO L290 TraceCheckUtils]: 37: Hoare triple {10605#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10606#(<= main_~i~0 16)} is VALID [2022-04-28 02:48:05,736 INFO L290 TraceCheckUtils]: 38: Hoare triple {10606#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10606#(<= main_~i~0 16)} is VALID [2022-04-28 02:48:05,737 INFO L290 TraceCheckUtils]: 39: Hoare triple {10606#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10607#(<= main_~i~0 17)} is VALID [2022-04-28 02:48:05,737 INFO L290 TraceCheckUtils]: 40: Hoare triple {10607#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10607#(<= main_~i~0 17)} is VALID [2022-04-28 02:48:05,737 INFO L290 TraceCheckUtils]: 41: Hoare triple {10607#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10608#(<= main_~i~0 18)} is VALID [2022-04-28 02:48:05,738 INFO L290 TraceCheckUtils]: 42: Hoare triple {10608#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10608#(<= main_~i~0 18)} is VALID [2022-04-28 02:48:05,738 INFO L290 TraceCheckUtils]: 43: Hoare triple {10608#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10609#(<= main_~i~0 19)} is VALID [2022-04-28 02:48:05,738 INFO L290 TraceCheckUtils]: 44: Hoare triple {10609#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10609#(<= main_~i~0 19)} is VALID [2022-04-28 02:48:05,739 INFO L290 TraceCheckUtils]: 45: Hoare triple {10609#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10610#(<= main_~i~0 20)} is VALID [2022-04-28 02:48:05,739 INFO L290 TraceCheckUtils]: 46: Hoare triple {10610#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10610#(<= main_~i~0 20)} is VALID [2022-04-28 02:48:05,739 INFO L290 TraceCheckUtils]: 47: Hoare triple {10610#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10611#(<= main_~i~0 21)} is VALID [2022-04-28 02:48:05,740 INFO L290 TraceCheckUtils]: 48: Hoare triple {10611#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10611#(<= main_~i~0 21)} is VALID [2022-04-28 02:48:05,740 INFO L290 TraceCheckUtils]: 49: Hoare triple {10611#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10612#(<= main_~i~0 22)} is VALID [2022-04-28 02:48:05,740 INFO L290 TraceCheckUtils]: 50: Hoare triple {10612#(<= main_~i~0 22)} assume !(~i~0 < 1024); {10586#false} is VALID [2022-04-28 02:48:05,740 INFO L290 TraceCheckUtils]: 51: Hoare triple {10586#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {10586#false} is VALID [2022-04-28 02:48:05,740 INFO L272 TraceCheckUtils]: 52: Hoare triple {10586#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {10586#false} is VALID [2022-04-28 02:48:05,740 INFO L290 TraceCheckUtils]: 53: Hoare triple {10586#false} ~cond := #in~cond; {10586#false} is VALID [2022-04-28 02:48:05,740 INFO L290 TraceCheckUtils]: 54: Hoare triple {10586#false} assume 0 == ~cond; {10586#false} is VALID [2022-04-28 02:48:05,741 INFO L290 TraceCheckUtils]: 55: Hoare triple {10586#false} assume !false; {10586#false} is VALID [2022-04-28 02:48:05,741 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:48:05,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:48:06,540 INFO L290 TraceCheckUtils]: 55: Hoare triple {10586#false} assume !false; {10586#false} is VALID [2022-04-28 02:48:06,541 INFO L290 TraceCheckUtils]: 54: Hoare triple {10586#false} assume 0 == ~cond; {10586#false} is VALID [2022-04-28 02:48:06,541 INFO L290 TraceCheckUtils]: 53: Hoare triple {10586#false} ~cond := #in~cond; {10586#false} is VALID [2022-04-28 02:48:06,541 INFO L272 TraceCheckUtils]: 52: Hoare triple {10586#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {10586#false} is VALID [2022-04-28 02:48:06,541 INFO L290 TraceCheckUtils]: 51: Hoare triple {10586#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {10586#false} is VALID [2022-04-28 02:48:06,541 INFO L290 TraceCheckUtils]: 50: Hoare triple {10798#(< main_~i~0 1024)} assume !(~i~0 < 1024); {10586#false} is VALID [2022-04-28 02:48:06,541 INFO L290 TraceCheckUtils]: 49: Hoare triple {10802#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10798#(< main_~i~0 1024)} is VALID [2022-04-28 02:48:06,542 INFO L290 TraceCheckUtils]: 48: Hoare triple {10802#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10802#(< main_~i~0 1023)} is VALID [2022-04-28 02:48:06,542 INFO L290 TraceCheckUtils]: 47: Hoare triple {10809#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10802#(< main_~i~0 1023)} is VALID [2022-04-28 02:48:06,542 INFO L290 TraceCheckUtils]: 46: Hoare triple {10809#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10809#(< main_~i~0 1022)} is VALID [2022-04-28 02:48:06,543 INFO L290 TraceCheckUtils]: 45: Hoare triple {10816#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10809#(< main_~i~0 1022)} is VALID [2022-04-28 02:48:06,543 INFO L290 TraceCheckUtils]: 44: Hoare triple {10816#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10816#(< main_~i~0 1021)} is VALID [2022-04-28 02:48:06,543 INFO L290 TraceCheckUtils]: 43: Hoare triple {10823#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10816#(< main_~i~0 1021)} is VALID [2022-04-28 02:48:06,543 INFO L290 TraceCheckUtils]: 42: Hoare triple {10823#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10823#(< main_~i~0 1020)} is VALID [2022-04-28 02:48:06,544 INFO L290 TraceCheckUtils]: 41: Hoare triple {10830#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10823#(< main_~i~0 1020)} is VALID [2022-04-28 02:48:06,544 INFO L290 TraceCheckUtils]: 40: Hoare triple {10830#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10830#(< main_~i~0 1019)} is VALID [2022-04-28 02:48:06,544 INFO L290 TraceCheckUtils]: 39: Hoare triple {10837#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10830#(< main_~i~0 1019)} is VALID [2022-04-28 02:48:06,545 INFO L290 TraceCheckUtils]: 38: Hoare triple {10837#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10837#(< main_~i~0 1018)} is VALID [2022-04-28 02:48:06,545 INFO L290 TraceCheckUtils]: 37: Hoare triple {10844#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10837#(< main_~i~0 1018)} is VALID [2022-04-28 02:48:06,545 INFO L290 TraceCheckUtils]: 36: Hoare triple {10844#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10844#(< main_~i~0 1017)} is VALID [2022-04-28 02:48:06,546 INFO L290 TraceCheckUtils]: 35: Hoare triple {10851#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10844#(< main_~i~0 1017)} is VALID [2022-04-28 02:48:06,546 INFO L290 TraceCheckUtils]: 34: Hoare triple {10851#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10851#(< main_~i~0 1016)} is VALID [2022-04-28 02:48:06,546 INFO L290 TraceCheckUtils]: 33: Hoare triple {10858#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10851#(< main_~i~0 1016)} is VALID [2022-04-28 02:48:06,547 INFO L290 TraceCheckUtils]: 32: Hoare triple {10858#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10858#(< main_~i~0 1015)} is VALID [2022-04-28 02:48:06,547 INFO L290 TraceCheckUtils]: 31: Hoare triple {10865#(< main_~i~0 1014)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10858#(< main_~i~0 1015)} is VALID [2022-04-28 02:48:06,547 INFO L290 TraceCheckUtils]: 30: Hoare triple {10865#(< main_~i~0 1014)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10865#(< main_~i~0 1014)} is VALID [2022-04-28 02:48:06,548 INFO L290 TraceCheckUtils]: 29: Hoare triple {10872#(< main_~i~0 1013)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10865#(< main_~i~0 1014)} is VALID [2022-04-28 02:48:06,548 INFO L290 TraceCheckUtils]: 28: Hoare triple {10872#(< main_~i~0 1013)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10872#(< main_~i~0 1013)} is VALID [2022-04-28 02:48:06,548 INFO L290 TraceCheckUtils]: 27: Hoare triple {10879#(< main_~i~0 1012)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10872#(< main_~i~0 1013)} is VALID [2022-04-28 02:48:06,549 INFO L290 TraceCheckUtils]: 26: Hoare triple {10879#(< main_~i~0 1012)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10879#(< main_~i~0 1012)} is VALID [2022-04-28 02:48:06,549 INFO L290 TraceCheckUtils]: 25: Hoare triple {10886#(< main_~i~0 1011)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10879#(< main_~i~0 1012)} is VALID [2022-04-28 02:48:06,549 INFO L290 TraceCheckUtils]: 24: Hoare triple {10886#(< main_~i~0 1011)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10886#(< main_~i~0 1011)} is VALID [2022-04-28 02:48:06,549 INFO L290 TraceCheckUtils]: 23: Hoare triple {10893#(< main_~i~0 1010)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10886#(< main_~i~0 1011)} is VALID [2022-04-28 02:48:06,550 INFO L290 TraceCheckUtils]: 22: Hoare triple {10893#(< main_~i~0 1010)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10893#(< main_~i~0 1010)} is VALID [2022-04-28 02:48:06,550 INFO L290 TraceCheckUtils]: 21: Hoare triple {10900#(< main_~i~0 1009)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10893#(< main_~i~0 1010)} is VALID [2022-04-28 02:48:06,550 INFO L290 TraceCheckUtils]: 20: Hoare triple {10900#(< main_~i~0 1009)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10900#(< main_~i~0 1009)} is VALID [2022-04-28 02:48:06,551 INFO L290 TraceCheckUtils]: 19: Hoare triple {10907#(< main_~i~0 1008)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10900#(< main_~i~0 1009)} is VALID [2022-04-28 02:48:06,551 INFO L290 TraceCheckUtils]: 18: Hoare triple {10907#(< main_~i~0 1008)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10907#(< main_~i~0 1008)} is VALID [2022-04-28 02:48:06,551 INFO L290 TraceCheckUtils]: 17: Hoare triple {10914#(< main_~i~0 1007)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10907#(< main_~i~0 1008)} is VALID [2022-04-28 02:48:06,552 INFO L290 TraceCheckUtils]: 16: Hoare triple {10914#(< main_~i~0 1007)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10914#(< main_~i~0 1007)} is VALID [2022-04-28 02:48:06,552 INFO L290 TraceCheckUtils]: 15: Hoare triple {10921#(< main_~i~0 1006)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10914#(< main_~i~0 1007)} is VALID [2022-04-28 02:48:06,552 INFO L290 TraceCheckUtils]: 14: Hoare triple {10921#(< main_~i~0 1006)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10921#(< main_~i~0 1006)} is VALID [2022-04-28 02:48:06,553 INFO L290 TraceCheckUtils]: 13: Hoare triple {10928#(< main_~i~0 1005)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10921#(< main_~i~0 1006)} is VALID [2022-04-28 02:48:06,553 INFO L290 TraceCheckUtils]: 12: Hoare triple {10928#(< main_~i~0 1005)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10928#(< main_~i~0 1005)} is VALID [2022-04-28 02:48:06,553 INFO L290 TraceCheckUtils]: 11: Hoare triple {10935#(< main_~i~0 1004)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10928#(< main_~i~0 1005)} is VALID [2022-04-28 02:48:06,554 INFO L290 TraceCheckUtils]: 10: Hoare triple {10935#(< main_~i~0 1004)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10935#(< main_~i~0 1004)} is VALID [2022-04-28 02:48:06,554 INFO L290 TraceCheckUtils]: 9: Hoare triple {10942#(< main_~i~0 1003)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10935#(< main_~i~0 1004)} is VALID [2022-04-28 02:48:06,554 INFO L290 TraceCheckUtils]: 8: Hoare triple {10942#(< main_~i~0 1003)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10942#(< main_~i~0 1003)} is VALID [2022-04-28 02:48:06,555 INFO L290 TraceCheckUtils]: 7: Hoare triple {10949#(< main_~i~0 1002)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10942#(< main_~i~0 1003)} is VALID [2022-04-28 02:48:06,555 INFO L290 TraceCheckUtils]: 6: Hoare triple {10949#(< main_~i~0 1002)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10949#(< main_~i~0 1002)} is VALID [2022-04-28 02:48:06,555 INFO L290 TraceCheckUtils]: 5: Hoare triple {10585#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {10949#(< main_~i~0 1002)} is VALID [2022-04-28 02:48:06,555 INFO L272 TraceCheckUtils]: 4: Hoare triple {10585#true} call #t~ret6 := main(); {10585#true} is VALID [2022-04-28 02:48:06,555 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10585#true} {10585#true} #39#return; {10585#true} is VALID [2022-04-28 02:48:06,555 INFO L290 TraceCheckUtils]: 2: Hoare triple {10585#true} assume true; {10585#true} is VALID [2022-04-28 02:48:06,555 INFO L290 TraceCheckUtils]: 1: Hoare triple {10585#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {10585#true} is VALID [2022-04-28 02:48:06,555 INFO L272 TraceCheckUtils]: 0: Hoare triple {10585#true} call ULTIMATE.init(); {10585#true} is VALID [2022-04-28 02:48:06,556 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:48:06,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [603652072] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:48:06,556 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:48:06,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 50 [2022-04-28 02:48:06,556 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:48:06,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [963254301] [2022-04-28 02:48:06,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [963254301] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:48:06,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:48:06,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-28 02:48:06,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621836005] [2022-04-28 02:48:06,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:48:06,557 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.0) internal successors, (52), 25 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2022-04-28 02:48:06,557 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:48:06,557 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 2.0) internal successors, (52), 25 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:06,592 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:48:06,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-28 02:48:06,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:48:06,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-28 02:48:06,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1178, Invalid=1272, Unknown=0, NotChecked=0, Total=2450 [2022-04-28 02:48:06,594 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand has 26 states, 26 states have (on average 2.0) internal successors, (52), 25 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:07,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:48:07,104 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2022-04-28 02:48:07,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-28 02:48:07,104 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.0) internal successors, (52), 25 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2022-04-28 02:48:07,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:48:07,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 2.0) internal successors, (52), 25 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:07,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 66 transitions. [2022-04-28 02:48:07,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 2.0) internal successors, (52), 25 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:07,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 66 transitions. [2022-04-28 02:48:07,106 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 66 transitions. [2022-04-28 02:48:07,166 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:48:07,167 INFO L225 Difference]: With dead ends: 66 [2022-04-28 02:48:07,167 INFO L226 Difference]: Without dead ends: 60 [2022-04-28 02:48:07,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2306, Invalid=2950, Unknown=0, NotChecked=0, Total=5256 [2022-04-28 02:48:07,168 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 54 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:48:07,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 24 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:48:07,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-28 02:48:07,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2022-04-28 02:48:07,283 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:48:07,283 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 59 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:07,283 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 59 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:07,283 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 59 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:07,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:48:07,284 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2022-04-28 02:48:07,284 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2022-04-28 02:48:07,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:48:07,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:48:07,284 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 60 states. [2022-04-28 02:48:07,285 INFO L87 Difference]: Start difference. First operand has 59 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 60 states. [2022-04-28 02:48:07,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:48:07,285 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2022-04-28 02:48:07,285 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2022-04-28 02:48:07,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:48:07,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:48:07,286 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:48:07,286 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:48:07,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:07,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2022-04-28 02:48:07,287 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 56 [2022-04-28 02:48:07,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:48:07,287 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2022-04-28 02:48:07,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.0) internal successors, (52), 25 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:07,287 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 59 transitions. [2022-04-28 02:48:07,344 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:48:07,344 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2022-04-28 02:48:07,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-28 02:48:07,344 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:48:07,345 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:48:07,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-04-28 02:48:07,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:48:07,545 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:48:07,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:48:07,545 INFO L85 PathProgramCache]: Analyzing trace with hash -420238296, now seen corresponding path program 45 times [2022-04-28 02:48:07,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:48:07,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [648356507] [2022-04-28 02:48:07,547 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:48:07,547 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:48:07,547 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:48:07,547 INFO L85 PathProgramCache]: Analyzing trace with hash -420238296, now seen corresponding path program 46 times [2022-04-28 02:48:07,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:48:07,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253150449] [2022-04-28 02:48:07,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:48:07,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:48:07,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:48:07,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:48:07,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:48:07,876 INFO L290 TraceCheckUtils]: 0: Hoare triple {11418#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {11389#true} is VALID [2022-04-28 02:48:07,876 INFO L290 TraceCheckUtils]: 1: Hoare triple {11389#true} assume true; {11389#true} is VALID [2022-04-28 02:48:07,876 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11389#true} {11389#true} #39#return; {11389#true} is VALID [2022-04-28 02:48:07,877 INFO L272 TraceCheckUtils]: 0: Hoare triple {11389#true} call ULTIMATE.init(); {11418#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:48:07,877 INFO L290 TraceCheckUtils]: 1: Hoare triple {11418#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {11389#true} is VALID [2022-04-28 02:48:07,877 INFO L290 TraceCheckUtils]: 2: Hoare triple {11389#true} assume true; {11389#true} is VALID [2022-04-28 02:48:07,877 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11389#true} {11389#true} #39#return; {11389#true} is VALID [2022-04-28 02:48:07,877 INFO L272 TraceCheckUtils]: 4: Hoare triple {11389#true} call #t~ret6 := main(); {11389#true} is VALID [2022-04-28 02:48:07,878 INFO L290 TraceCheckUtils]: 5: Hoare triple {11389#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {11394#(= main_~i~0 0)} is VALID [2022-04-28 02:48:07,878 INFO L290 TraceCheckUtils]: 6: Hoare triple {11394#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11394#(= main_~i~0 0)} is VALID [2022-04-28 02:48:07,878 INFO L290 TraceCheckUtils]: 7: Hoare triple {11394#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11395#(<= main_~i~0 1)} is VALID [2022-04-28 02:48:07,879 INFO L290 TraceCheckUtils]: 8: Hoare triple {11395#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11395#(<= main_~i~0 1)} is VALID [2022-04-28 02:48:07,879 INFO L290 TraceCheckUtils]: 9: Hoare triple {11395#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11396#(<= main_~i~0 2)} is VALID [2022-04-28 02:48:07,879 INFO L290 TraceCheckUtils]: 10: Hoare triple {11396#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11396#(<= main_~i~0 2)} is VALID [2022-04-28 02:48:07,880 INFO L290 TraceCheckUtils]: 11: Hoare triple {11396#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11397#(<= main_~i~0 3)} is VALID [2022-04-28 02:48:07,880 INFO L290 TraceCheckUtils]: 12: Hoare triple {11397#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11397#(<= main_~i~0 3)} is VALID [2022-04-28 02:48:07,881 INFO L290 TraceCheckUtils]: 13: Hoare triple {11397#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11398#(<= main_~i~0 4)} is VALID [2022-04-28 02:48:07,881 INFO L290 TraceCheckUtils]: 14: Hoare triple {11398#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11398#(<= main_~i~0 4)} is VALID [2022-04-28 02:48:07,881 INFO L290 TraceCheckUtils]: 15: Hoare triple {11398#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11399#(<= main_~i~0 5)} is VALID [2022-04-28 02:48:07,882 INFO L290 TraceCheckUtils]: 16: Hoare triple {11399#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11399#(<= main_~i~0 5)} is VALID [2022-04-28 02:48:07,882 INFO L290 TraceCheckUtils]: 17: Hoare triple {11399#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11400#(<= main_~i~0 6)} is VALID [2022-04-28 02:48:07,883 INFO L290 TraceCheckUtils]: 18: Hoare triple {11400#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11400#(<= main_~i~0 6)} is VALID [2022-04-28 02:48:07,883 INFO L290 TraceCheckUtils]: 19: Hoare triple {11400#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11401#(<= main_~i~0 7)} is VALID [2022-04-28 02:48:07,883 INFO L290 TraceCheckUtils]: 20: Hoare triple {11401#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11401#(<= main_~i~0 7)} is VALID [2022-04-28 02:48:07,884 INFO L290 TraceCheckUtils]: 21: Hoare triple {11401#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11402#(<= main_~i~0 8)} is VALID [2022-04-28 02:48:07,884 INFO L290 TraceCheckUtils]: 22: Hoare triple {11402#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11402#(<= main_~i~0 8)} is VALID [2022-04-28 02:48:07,885 INFO L290 TraceCheckUtils]: 23: Hoare triple {11402#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11403#(<= main_~i~0 9)} is VALID [2022-04-28 02:48:07,885 INFO L290 TraceCheckUtils]: 24: Hoare triple {11403#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11403#(<= main_~i~0 9)} is VALID [2022-04-28 02:48:07,885 INFO L290 TraceCheckUtils]: 25: Hoare triple {11403#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11404#(<= main_~i~0 10)} is VALID [2022-04-28 02:48:07,886 INFO L290 TraceCheckUtils]: 26: Hoare triple {11404#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11404#(<= main_~i~0 10)} is VALID [2022-04-28 02:48:07,886 INFO L290 TraceCheckUtils]: 27: Hoare triple {11404#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11405#(<= main_~i~0 11)} is VALID [2022-04-28 02:48:07,887 INFO L290 TraceCheckUtils]: 28: Hoare triple {11405#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11405#(<= main_~i~0 11)} is VALID [2022-04-28 02:48:07,887 INFO L290 TraceCheckUtils]: 29: Hoare triple {11405#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11406#(<= main_~i~0 12)} is VALID [2022-04-28 02:48:07,887 INFO L290 TraceCheckUtils]: 30: Hoare triple {11406#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11406#(<= main_~i~0 12)} is VALID [2022-04-28 02:48:07,888 INFO L290 TraceCheckUtils]: 31: Hoare triple {11406#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11407#(<= main_~i~0 13)} is VALID [2022-04-28 02:48:07,888 INFO L290 TraceCheckUtils]: 32: Hoare triple {11407#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11407#(<= main_~i~0 13)} is VALID [2022-04-28 02:48:07,889 INFO L290 TraceCheckUtils]: 33: Hoare triple {11407#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11408#(<= main_~i~0 14)} is VALID [2022-04-28 02:48:07,889 INFO L290 TraceCheckUtils]: 34: Hoare triple {11408#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11408#(<= main_~i~0 14)} is VALID [2022-04-28 02:48:07,889 INFO L290 TraceCheckUtils]: 35: Hoare triple {11408#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11409#(<= main_~i~0 15)} is VALID [2022-04-28 02:48:07,890 INFO L290 TraceCheckUtils]: 36: Hoare triple {11409#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11409#(<= main_~i~0 15)} is VALID [2022-04-28 02:48:07,890 INFO L290 TraceCheckUtils]: 37: Hoare triple {11409#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11410#(<= main_~i~0 16)} is VALID [2022-04-28 02:48:07,891 INFO L290 TraceCheckUtils]: 38: Hoare triple {11410#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11410#(<= main_~i~0 16)} is VALID [2022-04-28 02:48:07,891 INFO L290 TraceCheckUtils]: 39: Hoare triple {11410#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11411#(<= main_~i~0 17)} is VALID [2022-04-28 02:48:07,891 INFO L290 TraceCheckUtils]: 40: Hoare triple {11411#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11411#(<= main_~i~0 17)} is VALID [2022-04-28 02:48:07,892 INFO L290 TraceCheckUtils]: 41: Hoare triple {11411#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11412#(<= main_~i~0 18)} is VALID [2022-04-28 02:48:07,892 INFO L290 TraceCheckUtils]: 42: Hoare triple {11412#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11412#(<= main_~i~0 18)} is VALID [2022-04-28 02:48:07,893 INFO L290 TraceCheckUtils]: 43: Hoare triple {11412#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11413#(<= main_~i~0 19)} is VALID [2022-04-28 02:48:07,893 INFO L290 TraceCheckUtils]: 44: Hoare triple {11413#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11413#(<= main_~i~0 19)} is VALID [2022-04-28 02:48:07,893 INFO L290 TraceCheckUtils]: 45: Hoare triple {11413#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11414#(<= main_~i~0 20)} is VALID [2022-04-28 02:48:07,894 INFO L290 TraceCheckUtils]: 46: Hoare triple {11414#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11414#(<= main_~i~0 20)} is VALID [2022-04-28 02:48:07,894 INFO L290 TraceCheckUtils]: 47: Hoare triple {11414#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11415#(<= main_~i~0 21)} is VALID [2022-04-28 02:48:07,895 INFO L290 TraceCheckUtils]: 48: Hoare triple {11415#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11415#(<= main_~i~0 21)} is VALID [2022-04-28 02:48:07,895 INFO L290 TraceCheckUtils]: 49: Hoare triple {11415#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11416#(<= main_~i~0 22)} is VALID [2022-04-28 02:48:07,895 INFO L290 TraceCheckUtils]: 50: Hoare triple {11416#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11416#(<= main_~i~0 22)} is VALID [2022-04-28 02:48:07,896 INFO L290 TraceCheckUtils]: 51: Hoare triple {11416#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11417#(<= main_~i~0 23)} is VALID [2022-04-28 02:48:07,896 INFO L290 TraceCheckUtils]: 52: Hoare triple {11417#(<= main_~i~0 23)} assume !(~i~0 < 1024); {11390#false} is VALID [2022-04-28 02:48:07,896 INFO L290 TraceCheckUtils]: 53: Hoare triple {11390#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {11390#false} is VALID [2022-04-28 02:48:07,896 INFO L272 TraceCheckUtils]: 54: Hoare triple {11390#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {11390#false} is VALID [2022-04-28 02:48:07,897 INFO L290 TraceCheckUtils]: 55: Hoare triple {11390#false} ~cond := #in~cond; {11390#false} is VALID [2022-04-28 02:48:07,897 INFO L290 TraceCheckUtils]: 56: Hoare triple {11390#false} assume 0 == ~cond; {11390#false} is VALID [2022-04-28 02:48:07,897 INFO L290 TraceCheckUtils]: 57: Hoare triple {11390#false} assume !false; {11390#false} is VALID [2022-04-28 02:48:07,897 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:48:07,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:48:07,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253150449] [2022-04-28 02:48:07,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253150449] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:48:07,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [338401411] [2022-04-28 02:48:07,898 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 02:48:07,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:48:07,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:48:07,900 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:48:07,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-28 02:48:08,018 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 02:48:08,019 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:48:08,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 02:48:08,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:48:08,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:48:08,397 INFO L272 TraceCheckUtils]: 0: Hoare triple {11389#true} call ULTIMATE.init(); {11389#true} is VALID [2022-04-28 02:48:08,398 INFO L290 TraceCheckUtils]: 1: Hoare triple {11389#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {11389#true} is VALID [2022-04-28 02:48:08,398 INFO L290 TraceCheckUtils]: 2: Hoare triple {11389#true} assume true; {11389#true} is VALID [2022-04-28 02:48:08,398 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11389#true} {11389#true} #39#return; {11389#true} is VALID [2022-04-28 02:48:08,398 INFO L272 TraceCheckUtils]: 4: Hoare triple {11389#true} call #t~ret6 := main(); {11389#true} is VALID [2022-04-28 02:48:08,398 INFO L290 TraceCheckUtils]: 5: Hoare triple {11389#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {11437#(<= main_~i~0 0)} is VALID [2022-04-28 02:48:08,399 INFO L290 TraceCheckUtils]: 6: Hoare triple {11437#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11437#(<= main_~i~0 0)} is VALID [2022-04-28 02:48:08,399 INFO L290 TraceCheckUtils]: 7: Hoare triple {11437#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11395#(<= main_~i~0 1)} is VALID [2022-04-28 02:48:08,399 INFO L290 TraceCheckUtils]: 8: Hoare triple {11395#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11395#(<= main_~i~0 1)} is VALID [2022-04-28 02:48:08,400 INFO L290 TraceCheckUtils]: 9: Hoare triple {11395#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11396#(<= main_~i~0 2)} is VALID [2022-04-28 02:48:08,400 INFO L290 TraceCheckUtils]: 10: Hoare triple {11396#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11396#(<= main_~i~0 2)} is VALID [2022-04-28 02:48:08,400 INFO L290 TraceCheckUtils]: 11: Hoare triple {11396#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11397#(<= main_~i~0 3)} is VALID [2022-04-28 02:48:08,400 INFO L290 TraceCheckUtils]: 12: Hoare triple {11397#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11397#(<= main_~i~0 3)} is VALID [2022-04-28 02:48:08,401 INFO L290 TraceCheckUtils]: 13: Hoare triple {11397#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11398#(<= main_~i~0 4)} is VALID [2022-04-28 02:48:08,401 INFO L290 TraceCheckUtils]: 14: Hoare triple {11398#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11398#(<= main_~i~0 4)} is VALID [2022-04-28 02:48:08,401 INFO L290 TraceCheckUtils]: 15: Hoare triple {11398#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11399#(<= main_~i~0 5)} is VALID [2022-04-28 02:48:08,402 INFO L290 TraceCheckUtils]: 16: Hoare triple {11399#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11399#(<= main_~i~0 5)} is VALID [2022-04-28 02:48:08,402 INFO L290 TraceCheckUtils]: 17: Hoare triple {11399#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11400#(<= main_~i~0 6)} is VALID [2022-04-28 02:48:08,402 INFO L290 TraceCheckUtils]: 18: Hoare triple {11400#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11400#(<= main_~i~0 6)} is VALID [2022-04-28 02:48:08,403 INFO L290 TraceCheckUtils]: 19: Hoare triple {11400#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11401#(<= main_~i~0 7)} is VALID [2022-04-28 02:48:08,403 INFO L290 TraceCheckUtils]: 20: Hoare triple {11401#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11401#(<= main_~i~0 7)} is VALID [2022-04-28 02:48:08,403 INFO L290 TraceCheckUtils]: 21: Hoare triple {11401#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11402#(<= main_~i~0 8)} is VALID [2022-04-28 02:48:08,404 INFO L290 TraceCheckUtils]: 22: Hoare triple {11402#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11402#(<= main_~i~0 8)} is VALID [2022-04-28 02:48:08,404 INFO L290 TraceCheckUtils]: 23: Hoare triple {11402#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11403#(<= main_~i~0 9)} is VALID [2022-04-28 02:48:08,404 INFO L290 TraceCheckUtils]: 24: Hoare triple {11403#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11403#(<= main_~i~0 9)} is VALID [2022-04-28 02:48:08,405 INFO L290 TraceCheckUtils]: 25: Hoare triple {11403#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11404#(<= main_~i~0 10)} is VALID [2022-04-28 02:48:08,405 INFO L290 TraceCheckUtils]: 26: Hoare triple {11404#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11404#(<= main_~i~0 10)} is VALID [2022-04-28 02:48:08,405 INFO L290 TraceCheckUtils]: 27: Hoare triple {11404#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11405#(<= main_~i~0 11)} is VALID [2022-04-28 02:48:08,405 INFO L290 TraceCheckUtils]: 28: Hoare triple {11405#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11405#(<= main_~i~0 11)} is VALID [2022-04-28 02:48:08,406 INFO L290 TraceCheckUtils]: 29: Hoare triple {11405#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11406#(<= main_~i~0 12)} is VALID [2022-04-28 02:48:08,406 INFO L290 TraceCheckUtils]: 30: Hoare triple {11406#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11406#(<= main_~i~0 12)} is VALID [2022-04-28 02:48:08,406 INFO L290 TraceCheckUtils]: 31: Hoare triple {11406#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11407#(<= main_~i~0 13)} is VALID [2022-04-28 02:48:08,407 INFO L290 TraceCheckUtils]: 32: Hoare triple {11407#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11407#(<= main_~i~0 13)} is VALID [2022-04-28 02:48:08,407 INFO L290 TraceCheckUtils]: 33: Hoare triple {11407#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11408#(<= main_~i~0 14)} is VALID [2022-04-28 02:48:08,407 INFO L290 TraceCheckUtils]: 34: Hoare triple {11408#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11408#(<= main_~i~0 14)} is VALID [2022-04-28 02:48:08,408 INFO L290 TraceCheckUtils]: 35: Hoare triple {11408#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11409#(<= main_~i~0 15)} is VALID [2022-04-28 02:48:08,408 INFO L290 TraceCheckUtils]: 36: Hoare triple {11409#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11409#(<= main_~i~0 15)} is VALID [2022-04-28 02:48:08,408 INFO L290 TraceCheckUtils]: 37: Hoare triple {11409#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11410#(<= main_~i~0 16)} is VALID [2022-04-28 02:48:08,409 INFO L290 TraceCheckUtils]: 38: Hoare triple {11410#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11410#(<= main_~i~0 16)} is VALID [2022-04-28 02:48:08,409 INFO L290 TraceCheckUtils]: 39: Hoare triple {11410#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11411#(<= main_~i~0 17)} is VALID [2022-04-28 02:48:08,409 INFO L290 TraceCheckUtils]: 40: Hoare triple {11411#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11411#(<= main_~i~0 17)} is VALID [2022-04-28 02:48:08,410 INFO L290 TraceCheckUtils]: 41: Hoare triple {11411#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11412#(<= main_~i~0 18)} is VALID [2022-04-28 02:48:08,410 INFO L290 TraceCheckUtils]: 42: Hoare triple {11412#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11412#(<= main_~i~0 18)} is VALID [2022-04-28 02:48:08,410 INFO L290 TraceCheckUtils]: 43: Hoare triple {11412#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11413#(<= main_~i~0 19)} is VALID [2022-04-28 02:48:08,411 INFO L290 TraceCheckUtils]: 44: Hoare triple {11413#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11413#(<= main_~i~0 19)} is VALID [2022-04-28 02:48:08,411 INFO L290 TraceCheckUtils]: 45: Hoare triple {11413#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11414#(<= main_~i~0 20)} is VALID [2022-04-28 02:48:08,411 INFO L290 TraceCheckUtils]: 46: Hoare triple {11414#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11414#(<= main_~i~0 20)} is VALID [2022-04-28 02:48:08,412 INFO L290 TraceCheckUtils]: 47: Hoare triple {11414#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11415#(<= main_~i~0 21)} is VALID [2022-04-28 02:48:08,412 INFO L290 TraceCheckUtils]: 48: Hoare triple {11415#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11415#(<= main_~i~0 21)} is VALID [2022-04-28 02:48:08,412 INFO L290 TraceCheckUtils]: 49: Hoare triple {11415#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11416#(<= main_~i~0 22)} is VALID [2022-04-28 02:48:08,412 INFO L290 TraceCheckUtils]: 50: Hoare triple {11416#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11416#(<= main_~i~0 22)} is VALID [2022-04-28 02:48:08,413 INFO L290 TraceCheckUtils]: 51: Hoare triple {11416#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11417#(<= main_~i~0 23)} is VALID [2022-04-28 02:48:08,413 INFO L290 TraceCheckUtils]: 52: Hoare triple {11417#(<= main_~i~0 23)} assume !(~i~0 < 1024); {11390#false} is VALID [2022-04-28 02:48:08,413 INFO L290 TraceCheckUtils]: 53: Hoare triple {11390#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {11390#false} is VALID [2022-04-28 02:48:08,413 INFO L272 TraceCheckUtils]: 54: Hoare triple {11390#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {11390#false} is VALID [2022-04-28 02:48:08,413 INFO L290 TraceCheckUtils]: 55: Hoare triple {11390#false} ~cond := #in~cond; {11390#false} is VALID [2022-04-28 02:48:08,413 INFO L290 TraceCheckUtils]: 56: Hoare triple {11390#false} assume 0 == ~cond; {11390#false} is VALID [2022-04-28 02:48:08,413 INFO L290 TraceCheckUtils]: 57: Hoare triple {11390#false} assume !false; {11390#false} is VALID [2022-04-28 02:48:08,414 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:48:08,414 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:48:09,259 INFO L290 TraceCheckUtils]: 57: Hoare triple {11390#false} assume !false; {11390#false} is VALID [2022-04-28 02:48:09,259 INFO L290 TraceCheckUtils]: 56: Hoare triple {11390#false} assume 0 == ~cond; {11390#false} is VALID [2022-04-28 02:48:09,259 INFO L290 TraceCheckUtils]: 55: Hoare triple {11390#false} ~cond := #in~cond; {11390#false} is VALID [2022-04-28 02:48:09,259 INFO L272 TraceCheckUtils]: 54: Hoare triple {11390#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {11390#false} is VALID [2022-04-28 02:48:09,259 INFO L290 TraceCheckUtils]: 53: Hoare triple {11390#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {11390#false} is VALID [2022-04-28 02:48:09,260 INFO L290 TraceCheckUtils]: 52: Hoare triple {11609#(< main_~i~0 1024)} assume !(~i~0 < 1024); {11390#false} is VALID [2022-04-28 02:48:09,260 INFO L290 TraceCheckUtils]: 51: Hoare triple {11613#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11609#(< main_~i~0 1024)} is VALID [2022-04-28 02:48:09,260 INFO L290 TraceCheckUtils]: 50: Hoare triple {11613#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11613#(< main_~i~0 1023)} is VALID [2022-04-28 02:48:09,261 INFO L290 TraceCheckUtils]: 49: Hoare triple {11620#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11613#(< main_~i~0 1023)} is VALID [2022-04-28 02:48:09,261 INFO L290 TraceCheckUtils]: 48: Hoare triple {11620#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11620#(< main_~i~0 1022)} is VALID [2022-04-28 02:48:09,261 INFO L290 TraceCheckUtils]: 47: Hoare triple {11627#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11620#(< main_~i~0 1022)} is VALID [2022-04-28 02:48:09,262 INFO L290 TraceCheckUtils]: 46: Hoare triple {11627#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11627#(< main_~i~0 1021)} is VALID [2022-04-28 02:48:09,262 INFO L290 TraceCheckUtils]: 45: Hoare triple {11634#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11627#(< main_~i~0 1021)} is VALID [2022-04-28 02:48:09,262 INFO L290 TraceCheckUtils]: 44: Hoare triple {11634#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11634#(< main_~i~0 1020)} is VALID [2022-04-28 02:48:09,263 INFO L290 TraceCheckUtils]: 43: Hoare triple {11641#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11634#(< main_~i~0 1020)} is VALID [2022-04-28 02:48:09,263 INFO L290 TraceCheckUtils]: 42: Hoare triple {11641#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11641#(< main_~i~0 1019)} is VALID [2022-04-28 02:48:09,263 INFO L290 TraceCheckUtils]: 41: Hoare triple {11648#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11641#(< main_~i~0 1019)} is VALID [2022-04-28 02:48:09,263 INFO L290 TraceCheckUtils]: 40: Hoare triple {11648#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11648#(< main_~i~0 1018)} is VALID [2022-04-28 02:48:09,264 INFO L290 TraceCheckUtils]: 39: Hoare triple {11655#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11648#(< main_~i~0 1018)} is VALID [2022-04-28 02:48:09,264 INFO L290 TraceCheckUtils]: 38: Hoare triple {11655#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11655#(< main_~i~0 1017)} is VALID [2022-04-28 02:48:09,264 INFO L290 TraceCheckUtils]: 37: Hoare triple {11662#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11655#(< main_~i~0 1017)} is VALID [2022-04-28 02:48:09,265 INFO L290 TraceCheckUtils]: 36: Hoare triple {11662#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11662#(< main_~i~0 1016)} is VALID [2022-04-28 02:48:09,265 INFO L290 TraceCheckUtils]: 35: Hoare triple {11669#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11662#(< main_~i~0 1016)} is VALID [2022-04-28 02:48:09,265 INFO L290 TraceCheckUtils]: 34: Hoare triple {11669#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11669#(< main_~i~0 1015)} is VALID [2022-04-28 02:48:09,266 INFO L290 TraceCheckUtils]: 33: Hoare triple {11676#(< main_~i~0 1014)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11669#(< main_~i~0 1015)} is VALID [2022-04-28 02:48:09,266 INFO L290 TraceCheckUtils]: 32: Hoare triple {11676#(< main_~i~0 1014)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11676#(< main_~i~0 1014)} is VALID [2022-04-28 02:48:09,266 INFO L290 TraceCheckUtils]: 31: Hoare triple {11683#(< main_~i~0 1013)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11676#(< main_~i~0 1014)} is VALID [2022-04-28 02:48:09,267 INFO L290 TraceCheckUtils]: 30: Hoare triple {11683#(< main_~i~0 1013)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11683#(< main_~i~0 1013)} is VALID [2022-04-28 02:48:09,267 INFO L290 TraceCheckUtils]: 29: Hoare triple {11690#(< main_~i~0 1012)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11683#(< main_~i~0 1013)} is VALID [2022-04-28 02:48:09,267 INFO L290 TraceCheckUtils]: 28: Hoare triple {11690#(< main_~i~0 1012)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11690#(< main_~i~0 1012)} is VALID [2022-04-28 02:48:09,268 INFO L290 TraceCheckUtils]: 27: Hoare triple {11697#(< main_~i~0 1011)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11690#(< main_~i~0 1012)} is VALID [2022-04-28 02:48:09,268 INFO L290 TraceCheckUtils]: 26: Hoare triple {11697#(< main_~i~0 1011)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11697#(< main_~i~0 1011)} is VALID [2022-04-28 02:48:09,268 INFO L290 TraceCheckUtils]: 25: Hoare triple {11704#(< main_~i~0 1010)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11697#(< main_~i~0 1011)} is VALID [2022-04-28 02:48:09,268 INFO L290 TraceCheckUtils]: 24: Hoare triple {11704#(< main_~i~0 1010)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11704#(< main_~i~0 1010)} is VALID [2022-04-28 02:48:09,269 INFO L290 TraceCheckUtils]: 23: Hoare triple {11711#(< main_~i~0 1009)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11704#(< main_~i~0 1010)} is VALID [2022-04-28 02:48:09,269 INFO L290 TraceCheckUtils]: 22: Hoare triple {11711#(< main_~i~0 1009)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11711#(< main_~i~0 1009)} is VALID [2022-04-28 02:48:09,269 INFO L290 TraceCheckUtils]: 21: Hoare triple {11718#(< main_~i~0 1008)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11711#(< main_~i~0 1009)} is VALID [2022-04-28 02:48:09,270 INFO L290 TraceCheckUtils]: 20: Hoare triple {11718#(< main_~i~0 1008)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11718#(< main_~i~0 1008)} is VALID [2022-04-28 02:48:09,270 INFO L290 TraceCheckUtils]: 19: Hoare triple {11725#(< main_~i~0 1007)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11718#(< main_~i~0 1008)} is VALID [2022-04-28 02:48:09,270 INFO L290 TraceCheckUtils]: 18: Hoare triple {11725#(< main_~i~0 1007)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11725#(< main_~i~0 1007)} is VALID [2022-04-28 02:48:09,271 INFO L290 TraceCheckUtils]: 17: Hoare triple {11732#(< main_~i~0 1006)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11725#(< main_~i~0 1007)} is VALID [2022-04-28 02:48:09,271 INFO L290 TraceCheckUtils]: 16: Hoare triple {11732#(< main_~i~0 1006)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11732#(< main_~i~0 1006)} is VALID [2022-04-28 02:48:09,271 INFO L290 TraceCheckUtils]: 15: Hoare triple {11739#(< main_~i~0 1005)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11732#(< main_~i~0 1006)} is VALID [2022-04-28 02:48:09,272 INFO L290 TraceCheckUtils]: 14: Hoare triple {11739#(< main_~i~0 1005)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11739#(< main_~i~0 1005)} is VALID [2022-04-28 02:48:09,272 INFO L290 TraceCheckUtils]: 13: Hoare triple {11746#(< main_~i~0 1004)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11739#(< main_~i~0 1005)} is VALID [2022-04-28 02:48:09,272 INFO L290 TraceCheckUtils]: 12: Hoare triple {11746#(< main_~i~0 1004)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11746#(< main_~i~0 1004)} is VALID [2022-04-28 02:48:09,273 INFO L290 TraceCheckUtils]: 11: Hoare triple {11753#(< main_~i~0 1003)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11746#(< main_~i~0 1004)} is VALID [2022-04-28 02:48:09,273 INFO L290 TraceCheckUtils]: 10: Hoare triple {11753#(< main_~i~0 1003)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11753#(< main_~i~0 1003)} is VALID [2022-04-28 02:48:09,273 INFO L290 TraceCheckUtils]: 9: Hoare triple {11760#(< main_~i~0 1002)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11753#(< main_~i~0 1003)} is VALID [2022-04-28 02:48:09,273 INFO L290 TraceCheckUtils]: 8: Hoare triple {11760#(< main_~i~0 1002)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11760#(< main_~i~0 1002)} is VALID [2022-04-28 02:48:09,274 INFO L290 TraceCheckUtils]: 7: Hoare triple {11767#(< main_~i~0 1001)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11760#(< main_~i~0 1002)} is VALID [2022-04-28 02:48:09,274 INFO L290 TraceCheckUtils]: 6: Hoare triple {11767#(< main_~i~0 1001)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11767#(< main_~i~0 1001)} is VALID [2022-04-28 02:48:09,274 INFO L290 TraceCheckUtils]: 5: Hoare triple {11389#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {11767#(< main_~i~0 1001)} is VALID [2022-04-28 02:48:09,275 INFO L272 TraceCheckUtils]: 4: Hoare triple {11389#true} call #t~ret6 := main(); {11389#true} is VALID [2022-04-28 02:48:09,275 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11389#true} {11389#true} #39#return; {11389#true} is VALID [2022-04-28 02:48:09,275 INFO L290 TraceCheckUtils]: 2: Hoare triple {11389#true} assume true; {11389#true} is VALID [2022-04-28 02:48:09,275 INFO L290 TraceCheckUtils]: 1: Hoare triple {11389#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {11389#true} is VALID [2022-04-28 02:48:09,275 INFO L272 TraceCheckUtils]: 0: Hoare triple {11389#true} call ULTIMATE.init(); {11389#true} is VALID [2022-04-28 02:48:09,275 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:48:09,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [338401411] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:48:09,275 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:48:09,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 26] total 52 [2022-04-28 02:48:09,275 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:48:09,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [648356507] [2022-04-28 02:48:09,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [648356507] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:48:09,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:48:09,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-28 02:48:09,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655726505] [2022-04-28 02:48:09,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:48:09,276 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.0) internal successors, (54), 26 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2022-04-28 02:48:09,276 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:48:09,276 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 27 states have (on average 2.0) internal successors, (54), 26 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:09,314 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:48:09,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-28 02:48:09,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:48:09,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-28 02:48:09,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1277, Invalid=1375, Unknown=0, NotChecked=0, Total=2652 [2022-04-28 02:48:09,315 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand has 27 states, 27 states have (on average 2.0) internal successors, (54), 26 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:09,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:48:09,896 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2022-04-28 02:48:09,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-28 02:48:09,896 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.0) internal successors, (54), 26 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2022-04-28 02:48:09,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:48:09,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 2.0) internal successors, (54), 26 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:09,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 68 transitions. [2022-04-28 02:48:09,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 2.0) internal successors, (54), 26 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:09,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 68 transitions. [2022-04-28 02:48:09,899 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 68 transitions. [2022-04-28 02:48:09,972 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:48:09,972 INFO L225 Difference]: With dead ends: 68 [2022-04-28 02:48:09,972 INFO L226 Difference]: Without dead ends: 62 [2022-04-28 02:48:09,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2502, Invalid=3198, Unknown=0, NotChecked=0, Total=5700 [2022-04-28 02:48:09,974 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 56 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:48:09,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 49 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:48:09,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-04-28 02:48:10,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2022-04-28 02:48:10,131 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:48:10,131 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand has 61 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:10,131 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand has 61 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:10,131 INFO L87 Difference]: Start difference. First operand 62 states. Second operand has 61 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:10,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:48:10,132 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2022-04-28 02:48:10,132 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2022-04-28 02:48:10,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:48:10,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:48:10,133 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 62 states. [2022-04-28 02:48:10,133 INFO L87 Difference]: Start difference. First operand has 61 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 62 states. [2022-04-28 02:48:10,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:48:10,134 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2022-04-28 02:48:10,134 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2022-04-28 02:48:10,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:48:10,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:48:10,134 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:48:10,134 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:48:10,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:10,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2022-04-28 02:48:10,135 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 58 [2022-04-28 02:48:10,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:48:10,135 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2022-04-28 02:48:10,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.0) internal successors, (54), 26 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:10,135 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 61 transitions. [2022-04-28 02:48:10,205 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:48:10,205 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2022-04-28 02:48:10,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-04-28 02:48:10,206 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:48:10,206 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:48:10,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-28 02:48:10,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:48:10,406 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:48:10,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:48:10,407 INFO L85 PathProgramCache]: Analyzing trace with hash -996164182, now seen corresponding path program 47 times [2022-04-28 02:48:10,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:48:10,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [129453300] [2022-04-28 02:48:10,408 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:48:10,408 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:48:10,409 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:48:10,409 INFO L85 PathProgramCache]: Analyzing trace with hash -996164182, now seen corresponding path program 48 times [2022-04-28 02:48:10,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:48:10,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255615150] [2022-04-28 02:48:10,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:48:10,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:48:10,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:48:10,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:48:10,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:48:10,774 INFO L290 TraceCheckUtils]: 0: Hoare triple {12251#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {12221#true} is VALID [2022-04-28 02:48:10,775 INFO L290 TraceCheckUtils]: 1: Hoare triple {12221#true} assume true; {12221#true} is VALID [2022-04-28 02:48:10,775 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12221#true} {12221#true} #39#return; {12221#true} is VALID [2022-04-28 02:48:10,775 INFO L272 TraceCheckUtils]: 0: Hoare triple {12221#true} call ULTIMATE.init(); {12251#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:48:10,775 INFO L290 TraceCheckUtils]: 1: Hoare triple {12251#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {12221#true} is VALID [2022-04-28 02:48:10,775 INFO L290 TraceCheckUtils]: 2: Hoare triple {12221#true} assume true; {12221#true} is VALID [2022-04-28 02:48:10,775 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12221#true} {12221#true} #39#return; {12221#true} is VALID [2022-04-28 02:48:10,776 INFO L272 TraceCheckUtils]: 4: Hoare triple {12221#true} call #t~ret6 := main(); {12221#true} is VALID [2022-04-28 02:48:10,776 INFO L290 TraceCheckUtils]: 5: Hoare triple {12221#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {12226#(= main_~i~0 0)} is VALID [2022-04-28 02:48:10,776 INFO L290 TraceCheckUtils]: 6: Hoare triple {12226#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12226#(= main_~i~0 0)} is VALID [2022-04-28 02:48:10,777 INFO L290 TraceCheckUtils]: 7: Hoare triple {12226#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12227#(<= main_~i~0 1)} is VALID [2022-04-28 02:48:10,777 INFO L290 TraceCheckUtils]: 8: Hoare triple {12227#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12227#(<= main_~i~0 1)} is VALID [2022-04-28 02:48:10,777 INFO L290 TraceCheckUtils]: 9: Hoare triple {12227#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12228#(<= main_~i~0 2)} is VALID [2022-04-28 02:48:10,778 INFO L290 TraceCheckUtils]: 10: Hoare triple {12228#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12228#(<= main_~i~0 2)} is VALID [2022-04-28 02:48:10,778 INFO L290 TraceCheckUtils]: 11: Hoare triple {12228#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12229#(<= main_~i~0 3)} is VALID [2022-04-28 02:48:10,779 INFO L290 TraceCheckUtils]: 12: Hoare triple {12229#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12229#(<= main_~i~0 3)} is VALID [2022-04-28 02:48:10,779 INFO L290 TraceCheckUtils]: 13: Hoare triple {12229#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12230#(<= main_~i~0 4)} is VALID [2022-04-28 02:48:10,779 INFO L290 TraceCheckUtils]: 14: Hoare triple {12230#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12230#(<= main_~i~0 4)} is VALID [2022-04-28 02:48:10,780 INFO L290 TraceCheckUtils]: 15: Hoare triple {12230#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12231#(<= main_~i~0 5)} is VALID [2022-04-28 02:48:10,780 INFO L290 TraceCheckUtils]: 16: Hoare triple {12231#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12231#(<= main_~i~0 5)} is VALID [2022-04-28 02:48:10,781 INFO L290 TraceCheckUtils]: 17: Hoare triple {12231#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12232#(<= main_~i~0 6)} is VALID [2022-04-28 02:48:10,781 INFO L290 TraceCheckUtils]: 18: Hoare triple {12232#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12232#(<= main_~i~0 6)} is VALID [2022-04-28 02:48:10,781 INFO L290 TraceCheckUtils]: 19: Hoare triple {12232#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12233#(<= main_~i~0 7)} is VALID [2022-04-28 02:48:10,782 INFO L290 TraceCheckUtils]: 20: Hoare triple {12233#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12233#(<= main_~i~0 7)} is VALID [2022-04-28 02:48:10,782 INFO L290 TraceCheckUtils]: 21: Hoare triple {12233#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12234#(<= main_~i~0 8)} is VALID [2022-04-28 02:48:10,783 INFO L290 TraceCheckUtils]: 22: Hoare triple {12234#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12234#(<= main_~i~0 8)} is VALID [2022-04-28 02:48:10,783 INFO L290 TraceCheckUtils]: 23: Hoare triple {12234#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12235#(<= main_~i~0 9)} is VALID [2022-04-28 02:48:10,783 INFO L290 TraceCheckUtils]: 24: Hoare triple {12235#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12235#(<= main_~i~0 9)} is VALID [2022-04-28 02:48:10,784 INFO L290 TraceCheckUtils]: 25: Hoare triple {12235#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12236#(<= main_~i~0 10)} is VALID [2022-04-28 02:48:10,784 INFO L290 TraceCheckUtils]: 26: Hoare triple {12236#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12236#(<= main_~i~0 10)} is VALID [2022-04-28 02:48:10,785 INFO L290 TraceCheckUtils]: 27: Hoare triple {12236#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12237#(<= main_~i~0 11)} is VALID [2022-04-28 02:48:10,785 INFO L290 TraceCheckUtils]: 28: Hoare triple {12237#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12237#(<= main_~i~0 11)} is VALID [2022-04-28 02:48:10,786 INFO L290 TraceCheckUtils]: 29: Hoare triple {12237#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12238#(<= main_~i~0 12)} is VALID [2022-04-28 02:48:10,786 INFO L290 TraceCheckUtils]: 30: Hoare triple {12238#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12238#(<= main_~i~0 12)} is VALID [2022-04-28 02:48:10,786 INFO L290 TraceCheckUtils]: 31: Hoare triple {12238#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12239#(<= main_~i~0 13)} is VALID [2022-04-28 02:48:10,787 INFO L290 TraceCheckUtils]: 32: Hoare triple {12239#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12239#(<= main_~i~0 13)} is VALID [2022-04-28 02:48:10,787 INFO L290 TraceCheckUtils]: 33: Hoare triple {12239#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12240#(<= main_~i~0 14)} is VALID [2022-04-28 02:48:10,787 INFO L290 TraceCheckUtils]: 34: Hoare triple {12240#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12240#(<= main_~i~0 14)} is VALID [2022-04-28 02:48:10,788 INFO L290 TraceCheckUtils]: 35: Hoare triple {12240#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12241#(<= main_~i~0 15)} is VALID [2022-04-28 02:48:10,788 INFO L290 TraceCheckUtils]: 36: Hoare triple {12241#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12241#(<= main_~i~0 15)} is VALID [2022-04-28 02:48:10,789 INFO L290 TraceCheckUtils]: 37: Hoare triple {12241#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12242#(<= main_~i~0 16)} is VALID [2022-04-28 02:48:10,789 INFO L290 TraceCheckUtils]: 38: Hoare triple {12242#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12242#(<= main_~i~0 16)} is VALID [2022-04-28 02:48:10,790 INFO L290 TraceCheckUtils]: 39: Hoare triple {12242#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12243#(<= main_~i~0 17)} is VALID [2022-04-28 02:48:10,790 INFO L290 TraceCheckUtils]: 40: Hoare triple {12243#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12243#(<= main_~i~0 17)} is VALID [2022-04-28 02:48:10,790 INFO L290 TraceCheckUtils]: 41: Hoare triple {12243#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12244#(<= main_~i~0 18)} is VALID [2022-04-28 02:48:10,791 INFO L290 TraceCheckUtils]: 42: Hoare triple {12244#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12244#(<= main_~i~0 18)} is VALID [2022-04-28 02:48:10,791 INFO L290 TraceCheckUtils]: 43: Hoare triple {12244#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12245#(<= main_~i~0 19)} is VALID [2022-04-28 02:48:10,791 INFO L290 TraceCheckUtils]: 44: Hoare triple {12245#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12245#(<= main_~i~0 19)} is VALID [2022-04-28 02:48:10,792 INFO L290 TraceCheckUtils]: 45: Hoare triple {12245#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12246#(<= main_~i~0 20)} is VALID [2022-04-28 02:48:10,792 INFO L290 TraceCheckUtils]: 46: Hoare triple {12246#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12246#(<= main_~i~0 20)} is VALID [2022-04-28 02:48:10,793 INFO L290 TraceCheckUtils]: 47: Hoare triple {12246#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12247#(<= main_~i~0 21)} is VALID [2022-04-28 02:48:10,793 INFO L290 TraceCheckUtils]: 48: Hoare triple {12247#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12247#(<= main_~i~0 21)} is VALID [2022-04-28 02:48:10,794 INFO L290 TraceCheckUtils]: 49: Hoare triple {12247#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12248#(<= main_~i~0 22)} is VALID [2022-04-28 02:48:10,794 INFO L290 TraceCheckUtils]: 50: Hoare triple {12248#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12248#(<= main_~i~0 22)} is VALID [2022-04-28 02:48:10,794 INFO L290 TraceCheckUtils]: 51: Hoare triple {12248#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12249#(<= main_~i~0 23)} is VALID [2022-04-28 02:48:10,795 INFO L290 TraceCheckUtils]: 52: Hoare triple {12249#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12249#(<= main_~i~0 23)} is VALID [2022-04-28 02:48:10,795 INFO L290 TraceCheckUtils]: 53: Hoare triple {12249#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12250#(<= main_~i~0 24)} is VALID [2022-04-28 02:48:10,796 INFO L290 TraceCheckUtils]: 54: Hoare triple {12250#(<= main_~i~0 24)} assume !(~i~0 < 1024); {12222#false} is VALID [2022-04-28 02:48:10,796 INFO L290 TraceCheckUtils]: 55: Hoare triple {12222#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {12222#false} is VALID [2022-04-28 02:48:10,796 INFO L272 TraceCheckUtils]: 56: Hoare triple {12222#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {12222#false} is VALID [2022-04-28 02:48:10,796 INFO L290 TraceCheckUtils]: 57: Hoare triple {12222#false} ~cond := #in~cond; {12222#false} is VALID [2022-04-28 02:48:10,796 INFO L290 TraceCheckUtils]: 58: Hoare triple {12222#false} assume 0 == ~cond; {12222#false} is VALID [2022-04-28 02:48:10,796 INFO L290 TraceCheckUtils]: 59: Hoare triple {12222#false} assume !false; {12222#false} is VALID [2022-04-28 02:48:10,796 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:48:10,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:48:10,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255615150] [2022-04-28 02:48:10,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255615150] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:48:10,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519326116] [2022-04-28 02:48:10,797 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 02:48:10,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:48:10,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:48:10,798 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:48:10,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-28 02:48:11,510 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2022-04-28 02:48:11,510 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:48:11,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-28 02:48:11,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:48:11,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:48:11,898 INFO L272 TraceCheckUtils]: 0: Hoare triple {12221#true} call ULTIMATE.init(); {12221#true} is VALID [2022-04-28 02:48:11,898 INFO L290 TraceCheckUtils]: 1: Hoare triple {12221#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {12221#true} is VALID [2022-04-28 02:48:11,898 INFO L290 TraceCheckUtils]: 2: Hoare triple {12221#true} assume true; {12221#true} is VALID [2022-04-28 02:48:11,898 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12221#true} {12221#true} #39#return; {12221#true} is VALID [2022-04-28 02:48:11,898 INFO L272 TraceCheckUtils]: 4: Hoare triple {12221#true} call #t~ret6 := main(); {12221#true} is VALID [2022-04-28 02:48:11,899 INFO L290 TraceCheckUtils]: 5: Hoare triple {12221#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {12270#(<= main_~i~0 0)} is VALID [2022-04-28 02:48:11,899 INFO L290 TraceCheckUtils]: 6: Hoare triple {12270#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12270#(<= main_~i~0 0)} is VALID [2022-04-28 02:48:11,899 INFO L290 TraceCheckUtils]: 7: Hoare triple {12270#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12227#(<= main_~i~0 1)} is VALID [2022-04-28 02:48:11,900 INFO L290 TraceCheckUtils]: 8: Hoare triple {12227#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12227#(<= main_~i~0 1)} is VALID [2022-04-28 02:48:11,900 INFO L290 TraceCheckUtils]: 9: Hoare triple {12227#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12228#(<= main_~i~0 2)} is VALID [2022-04-28 02:48:11,900 INFO L290 TraceCheckUtils]: 10: Hoare triple {12228#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12228#(<= main_~i~0 2)} is VALID [2022-04-28 02:48:11,901 INFO L290 TraceCheckUtils]: 11: Hoare triple {12228#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12229#(<= main_~i~0 3)} is VALID [2022-04-28 02:48:11,901 INFO L290 TraceCheckUtils]: 12: Hoare triple {12229#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12229#(<= main_~i~0 3)} is VALID [2022-04-28 02:48:11,901 INFO L290 TraceCheckUtils]: 13: Hoare triple {12229#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12230#(<= main_~i~0 4)} is VALID [2022-04-28 02:48:11,901 INFO L290 TraceCheckUtils]: 14: Hoare triple {12230#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12230#(<= main_~i~0 4)} is VALID [2022-04-28 02:48:11,902 INFO L290 TraceCheckUtils]: 15: Hoare triple {12230#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12231#(<= main_~i~0 5)} is VALID [2022-04-28 02:48:11,902 INFO L290 TraceCheckUtils]: 16: Hoare triple {12231#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12231#(<= main_~i~0 5)} is VALID [2022-04-28 02:48:11,902 INFO L290 TraceCheckUtils]: 17: Hoare triple {12231#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12232#(<= main_~i~0 6)} is VALID [2022-04-28 02:48:11,903 INFO L290 TraceCheckUtils]: 18: Hoare triple {12232#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12232#(<= main_~i~0 6)} is VALID [2022-04-28 02:48:11,907 INFO L290 TraceCheckUtils]: 19: Hoare triple {12232#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12233#(<= main_~i~0 7)} is VALID [2022-04-28 02:48:11,908 INFO L290 TraceCheckUtils]: 20: Hoare triple {12233#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12233#(<= main_~i~0 7)} is VALID [2022-04-28 02:48:11,908 INFO L290 TraceCheckUtils]: 21: Hoare triple {12233#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12234#(<= main_~i~0 8)} is VALID [2022-04-28 02:48:11,908 INFO L290 TraceCheckUtils]: 22: Hoare triple {12234#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12234#(<= main_~i~0 8)} is VALID [2022-04-28 02:48:11,909 INFO L290 TraceCheckUtils]: 23: Hoare triple {12234#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12235#(<= main_~i~0 9)} is VALID [2022-04-28 02:48:11,909 INFO L290 TraceCheckUtils]: 24: Hoare triple {12235#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12235#(<= main_~i~0 9)} is VALID [2022-04-28 02:48:11,910 INFO L290 TraceCheckUtils]: 25: Hoare triple {12235#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12236#(<= main_~i~0 10)} is VALID [2022-04-28 02:48:11,910 INFO L290 TraceCheckUtils]: 26: Hoare triple {12236#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12236#(<= main_~i~0 10)} is VALID [2022-04-28 02:48:11,910 INFO L290 TraceCheckUtils]: 27: Hoare triple {12236#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12237#(<= main_~i~0 11)} is VALID [2022-04-28 02:48:11,911 INFO L290 TraceCheckUtils]: 28: Hoare triple {12237#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12237#(<= main_~i~0 11)} is VALID [2022-04-28 02:48:11,911 INFO L290 TraceCheckUtils]: 29: Hoare triple {12237#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12238#(<= main_~i~0 12)} is VALID [2022-04-28 02:48:11,912 INFO L290 TraceCheckUtils]: 30: Hoare triple {12238#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12238#(<= main_~i~0 12)} is VALID [2022-04-28 02:48:11,912 INFO L290 TraceCheckUtils]: 31: Hoare triple {12238#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12239#(<= main_~i~0 13)} is VALID [2022-04-28 02:48:11,913 INFO L290 TraceCheckUtils]: 32: Hoare triple {12239#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12239#(<= main_~i~0 13)} is VALID [2022-04-28 02:48:11,913 INFO L290 TraceCheckUtils]: 33: Hoare triple {12239#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12240#(<= main_~i~0 14)} is VALID [2022-04-28 02:48:11,913 INFO L290 TraceCheckUtils]: 34: Hoare triple {12240#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12240#(<= main_~i~0 14)} is VALID [2022-04-28 02:48:11,914 INFO L290 TraceCheckUtils]: 35: Hoare triple {12240#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12241#(<= main_~i~0 15)} is VALID [2022-04-28 02:48:11,914 INFO L290 TraceCheckUtils]: 36: Hoare triple {12241#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12241#(<= main_~i~0 15)} is VALID [2022-04-28 02:48:11,915 INFO L290 TraceCheckUtils]: 37: Hoare triple {12241#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12242#(<= main_~i~0 16)} is VALID [2022-04-28 02:48:11,915 INFO L290 TraceCheckUtils]: 38: Hoare triple {12242#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12242#(<= main_~i~0 16)} is VALID [2022-04-28 02:48:11,915 INFO L290 TraceCheckUtils]: 39: Hoare triple {12242#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12243#(<= main_~i~0 17)} is VALID [2022-04-28 02:48:11,916 INFO L290 TraceCheckUtils]: 40: Hoare triple {12243#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12243#(<= main_~i~0 17)} is VALID [2022-04-28 02:48:11,916 INFO L290 TraceCheckUtils]: 41: Hoare triple {12243#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12244#(<= main_~i~0 18)} is VALID [2022-04-28 02:48:11,917 INFO L290 TraceCheckUtils]: 42: Hoare triple {12244#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12244#(<= main_~i~0 18)} is VALID [2022-04-28 02:48:11,917 INFO L290 TraceCheckUtils]: 43: Hoare triple {12244#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12245#(<= main_~i~0 19)} is VALID [2022-04-28 02:48:11,917 INFO L290 TraceCheckUtils]: 44: Hoare triple {12245#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12245#(<= main_~i~0 19)} is VALID [2022-04-28 02:48:11,918 INFO L290 TraceCheckUtils]: 45: Hoare triple {12245#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12246#(<= main_~i~0 20)} is VALID [2022-04-28 02:48:11,918 INFO L290 TraceCheckUtils]: 46: Hoare triple {12246#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12246#(<= main_~i~0 20)} is VALID [2022-04-28 02:48:11,919 INFO L290 TraceCheckUtils]: 47: Hoare triple {12246#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12247#(<= main_~i~0 21)} is VALID [2022-04-28 02:48:11,919 INFO L290 TraceCheckUtils]: 48: Hoare triple {12247#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12247#(<= main_~i~0 21)} is VALID [2022-04-28 02:48:11,920 INFO L290 TraceCheckUtils]: 49: Hoare triple {12247#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12248#(<= main_~i~0 22)} is VALID [2022-04-28 02:48:11,920 INFO L290 TraceCheckUtils]: 50: Hoare triple {12248#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12248#(<= main_~i~0 22)} is VALID [2022-04-28 02:48:11,920 INFO L290 TraceCheckUtils]: 51: Hoare triple {12248#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12249#(<= main_~i~0 23)} is VALID [2022-04-28 02:48:11,921 INFO L290 TraceCheckUtils]: 52: Hoare triple {12249#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12249#(<= main_~i~0 23)} is VALID [2022-04-28 02:48:11,921 INFO L290 TraceCheckUtils]: 53: Hoare triple {12249#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12250#(<= main_~i~0 24)} is VALID [2022-04-28 02:48:11,922 INFO L290 TraceCheckUtils]: 54: Hoare triple {12250#(<= main_~i~0 24)} assume !(~i~0 < 1024); {12222#false} is VALID [2022-04-28 02:48:11,922 INFO L290 TraceCheckUtils]: 55: Hoare triple {12222#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {12222#false} is VALID [2022-04-28 02:48:11,922 INFO L272 TraceCheckUtils]: 56: Hoare triple {12222#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {12222#false} is VALID [2022-04-28 02:48:11,922 INFO L290 TraceCheckUtils]: 57: Hoare triple {12222#false} ~cond := #in~cond; {12222#false} is VALID [2022-04-28 02:48:11,922 INFO L290 TraceCheckUtils]: 58: Hoare triple {12222#false} assume 0 == ~cond; {12222#false} is VALID [2022-04-28 02:48:11,922 INFO L290 TraceCheckUtils]: 59: Hoare triple {12222#false} assume !false; {12222#false} is VALID [2022-04-28 02:48:11,922 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:48:11,923 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:48:12,820 INFO L290 TraceCheckUtils]: 59: Hoare triple {12222#false} assume !false; {12222#false} is VALID [2022-04-28 02:48:12,820 INFO L290 TraceCheckUtils]: 58: Hoare triple {12222#false} assume 0 == ~cond; {12222#false} is VALID [2022-04-28 02:48:12,821 INFO L290 TraceCheckUtils]: 57: Hoare triple {12222#false} ~cond := #in~cond; {12222#false} is VALID [2022-04-28 02:48:12,821 INFO L272 TraceCheckUtils]: 56: Hoare triple {12222#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {12222#false} is VALID [2022-04-28 02:48:12,821 INFO L290 TraceCheckUtils]: 55: Hoare triple {12222#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {12222#false} is VALID [2022-04-28 02:48:12,821 INFO L290 TraceCheckUtils]: 54: Hoare triple {12448#(< main_~i~0 1024)} assume !(~i~0 < 1024); {12222#false} is VALID [2022-04-28 02:48:12,821 INFO L290 TraceCheckUtils]: 53: Hoare triple {12452#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12448#(< main_~i~0 1024)} is VALID [2022-04-28 02:48:12,822 INFO L290 TraceCheckUtils]: 52: Hoare triple {12452#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12452#(< main_~i~0 1023)} is VALID [2022-04-28 02:48:12,822 INFO L290 TraceCheckUtils]: 51: Hoare triple {12459#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12452#(< main_~i~0 1023)} is VALID [2022-04-28 02:48:12,822 INFO L290 TraceCheckUtils]: 50: Hoare triple {12459#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12459#(< main_~i~0 1022)} is VALID [2022-04-28 02:48:12,823 INFO L290 TraceCheckUtils]: 49: Hoare triple {12466#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12459#(< main_~i~0 1022)} is VALID [2022-04-28 02:48:12,823 INFO L290 TraceCheckUtils]: 48: Hoare triple {12466#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12466#(< main_~i~0 1021)} is VALID [2022-04-28 02:48:12,823 INFO L290 TraceCheckUtils]: 47: Hoare triple {12473#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12466#(< main_~i~0 1021)} is VALID [2022-04-28 02:48:12,823 INFO L290 TraceCheckUtils]: 46: Hoare triple {12473#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12473#(< main_~i~0 1020)} is VALID [2022-04-28 02:48:12,824 INFO L290 TraceCheckUtils]: 45: Hoare triple {12480#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12473#(< main_~i~0 1020)} is VALID [2022-04-28 02:48:12,824 INFO L290 TraceCheckUtils]: 44: Hoare triple {12480#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12480#(< main_~i~0 1019)} is VALID [2022-04-28 02:48:12,824 INFO L290 TraceCheckUtils]: 43: Hoare triple {12487#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12480#(< main_~i~0 1019)} is VALID [2022-04-28 02:48:12,825 INFO L290 TraceCheckUtils]: 42: Hoare triple {12487#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12487#(< main_~i~0 1018)} is VALID [2022-04-28 02:48:12,825 INFO L290 TraceCheckUtils]: 41: Hoare triple {12494#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12487#(< main_~i~0 1018)} is VALID [2022-04-28 02:48:12,825 INFO L290 TraceCheckUtils]: 40: Hoare triple {12494#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12494#(< main_~i~0 1017)} is VALID [2022-04-28 02:48:12,826 INFO L290 TraceCheckUtils]: 39: Hoare triple {12501#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12494#(< main_~i~0 1017)} is VALID [2022-04-28 02:48:12,826 INFO L290 TraceCheckUtils]: 38: Hoare triple {12501#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12501#(< main_~i~0 1016)} is VALID [2022-04-28 02:48:12,826 INFO L290 TraceCheckUtils]: 37: Hoare triple {12508#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12501#(< main_~i~0 1016)} is VALID [2022-04-28 02:48:12,827 INFO L290 TraceCheckUtils]: 36: Hoare triple {12508#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12508#(< main_~i~0 1015)} is VALID [2022-04-28 02:48:12,827 INFO L290 TraceCheckUtils]: 35: Hoare triple {12515#(< main_~i~0 1014)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12508#(< main_~i~0 1015)} is VALID [2022-04-28 02:48:12,827 INFO L290 TraceCheckUtils]: 34: Hoare triple {12515#(< main_~i~0 1014)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12515#(< main_~i~0 1014)} is VALID [2022-04-28 02:48:12,828 INFO L290 TraceCheckUtils]: 33: Hoare triple {12522#(< main_~i~0 1013)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12515#(< main_~i~0 1014)} is VALID [2022-04-28 02:48:12,828 INFO L290 TraceCheckUtils]: 32: Hoare triple {12522#(< main_~i~0 1013)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12522#(< main_~i~0 1013)} is VALID [2022-04-28 02:48:12,828 INFO L290 TraceCheckUtils]: 31: Hoare triple {12529#(< main_~i~0 1012)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12522#(< main_~i~0 1013)} is VALID [2022-04-28 02:48:12,829 INFO L290 TraceCheckUtils]: 30: Hoare triple {12529#(< main_~i~0 1012)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12529#(< main_~i~0 1012)} is VALID [2022-04-28 02:48:12,829 INFO L290 TraceCheckUtils]: 29: Hoare triple {12536#(< main_~i~0 1011)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12529#(< main_~i~0 1012)} is VALID [2022-04-28 02:48:12,829 INFO L290 TraceCheckUtils]: 28: Hoare triple {12536#(< main_~i~0 1011)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12536#(< main_~i~0 1011)} is VALID [2022-04-28 02:48:12,830 INFO L290 TraceCheckUtils]: 27: Hoare triple {12543#(< main_~i~0 1010)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12536#(< main_~i~0 1011)} is VALID [2022-04-28 02:48:12,830 INFO L290 TraceCheckUtils]: 26: Hoare triple {12543#(< main_~i~0 1010)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12543#(< main_~i~0 1010)} is VALID [2022-04-28 02:48:12,830 INFO L290 TraceCheckUtils]: 25: Hoare triple {12550#(< main_~i~0 1009)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12543#(< main_~i~0 1010)} is VALID [2022-04-28 02:48:12,830 INFO L290 TraceCheckUtils]: 24: Hoare triple {12550#(< main_~i~0 1009)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12550#(< main_~i~0 1009)} is VALID [2022-04-28 02:48:12,831 INFO L290 TraceCheckUtils]: 23: Hoare triple {12557#(< main_~i~0 1008)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12550#(< main_~i~0 1009)} is VALID [2022-04-28 02:48:12,831 INFO L290 TraceCheckUtils]: 22: Hoare triple {12557#(< main_~i~0 1008)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12557#(< main_~i~0 1008)} is VALID [2022-04-28 02:48:12,831 INFO L290 TraceCheckUtils]: 21: Hoare triple {12564#(< main_~i~0 1007)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12557#(< main_~i~0 1008)} is VALID [2022-04-28 02:48:12,832 INFO L290 TraceCheckUtils]: 20: Hoare triple {12564#(< main_~i~0 1007)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12564#(< main_~i~0 1007)} is VALID [2022-04-28 02:48:12,832 INFO L290 TraceCheckUtils]: 19: Hoare triple {12571#(< main_~i~0 1006)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12564#(< main_~i~0 1007)} is VALID [2022-04-28 02:48:12,832 INFO L290 TraceCheckUtils]: 18: Hoare triple {12571#(< main_~i~0 1006)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12571#(< main_~i~0 1006)} is VALID [2022-04-28 02:48:12,833 INFO L290 TraceCheckUtils]: 17: Hoare triple {12578#(< main_~i~0 1005)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12571#(< main_~i~0 1006)} is VALID [2022-04-28 02:48:12,833 INFO L290 TraceCheckUtils]: 16: Hoare triple {12578#(< main_~i~0 1005)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12578#(< main_~i~0 1005)} is VALID [2022-04-28 02:48:12,833 INFO L290 TraceCheckUtils]: 15: Hoare triple {12585#(< main_~i~0 1004)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12578#(< main_~i~0 1005)} is VALID [2022-04-28 02:48:12,834 INFO L290 TraceCheckUtils]: 14: Hoare triple {12585#(< main_~i~0 1004)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12585#(< main_~i~0 1004)} is VALID [2022-04-28 02:48:12,834 INFO L290 TraceCheckUtils]: 13: Hoare triple {12592#(< main_~i~0 1003)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12585#(< main_~i~0 1004)} is VALID [2022-04-28 02:48:12,834 INFO L290 TraceCheckUtils]: 12: Hoare triple {12592#(< main_~i~0 1003)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12592#(< main_~i~0 1003)} is VALID [2022-04-28 02:48:12,835 INFO L290 TraceCheckUtils]: 11: Hoare triple {12599#(< main_~i~0 1002)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12592#(< main_~i~0 1003)} is VALID [2022-04-28 02:48:12,835 INFO L290 TraceCheckUtils]: 10: Hoare triple {12599#(< main_~i~0 1002)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12599#(< main_~i~0 1002)} is VALID [2022-04-28 02:48:12,835 INFO L290 TraceCheckUtils]: 9: Hoare triple {12606#(< main_~i~0 1001)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12599#(< main_~i~0 1002)} is VALID [2022-04-28 02:48:12,835 INFO L290 TraceCheckUtils]: 8: Hoare triple {12606#(< main_~i~0 1001)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12606#(< main_~i~0 1001)} is VALID [2022-04-28 02:48:12,836 INFO L290 TraceCheckUtils]: 7: Hoare triple {12613#(< main_~i~0 1000)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12606#(< main_~i~0 1001)} is VALID [2022-04-28 02:48:12,836 INFO L290 TraceCheckUtils]: 6: Hoare triple {12613#(< main_~i~0 1000)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12613#(< main_~i~0 1000)} is VALID [2022-04-28 02:48:12,836 INFO L290 TraceCheckUtils]: 5: Hoare triple {12221#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {12613#(< main_~i~0 1000)} is VALID [2022-04-28 02:48:12,837 INFO L272 TraceCheckUtils]: 4: Hoare triple {12221#true} call #t~ret6 := main(); {12221#true} is VALID [2022-04-28 02:48:12,837 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12221#true} {12221#true} #39#return; {12221#true} is VALID [2022-04-28 02:48:12,837 INFO L290 TraceCheckUtils]: 2: Hoare triple {12221#true} assume true; {12221#true} is VALID [2022-04-28 02:48:12,837 INFO L290 TraceCheckUtils]: 1: Hoare triple {12221#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {12221#true} is VALID [2022-04-28 02:48:12,837 INFO L272 TraceCheckUtils]: 0: Hoare triple {12221#true} call ULTIMATE.init(); {12221#true} is VALID [2022-04-28 02:48:12,837 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:48:12,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1519326116] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:48:12,837 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:48:12,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 27] total 54 [2022-04-28 02:48:12,838 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:48:12,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [129453300] [2022-04-28 02:48:12,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [129453300] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:48:12,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:48:12,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-28 02:48:12,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851804213] [2022-04-28 02:48:12,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:48:12,838 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.0) internal successors, (56), 27 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 60 [2022-04-28 02:48:12,838 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:48:12,838 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 28 states have (on average 2.0) internal successors, (56), 27 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:12,877 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:48:12,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-28 02:48:12,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:48:12,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-28 02:48:12,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1380, Invalid=1482, Unknown=0, NotChecked=0, Total=2862 [2022-04-28 02:48:12,878 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand has 28 states, 28 states have (on average 2.0) internal successors, (56), 27 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:13,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:48:13,485 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2022-04-28 02:48:13,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-28 02:48:13,485 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.0) internal successors, (56), 27 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 60 [2022-04-28 02:48:13,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:48:13,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 2.0) internal successors, (56), 27 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:13,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 70 transitions. [2022-04-28 02:48:13,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 2.0) internal successors, (56), 27 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:13,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 70 transitions. [2022-04-28 02:48:13,487 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 70 transitions. [2022-04-28 02:48:13,549 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:48:13,549 INFO L225 Difference]: With dead ends: 70 [2022-04-28 02:48:13,549 INFO L226 Difference]: Without dead ends: 64 [2022-04-28 02:48:13,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2706, Invalid=3456, Unknown=0, NotChecked=0, Total=6162 [2022-04-28 02:48:13,551 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 58 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:48:13,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 24 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:48:13,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-28 02:48:13,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2022-04-28 02:48:13,701 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:48:13,701 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 63 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:13,702 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 63 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:13,702 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 63 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:13,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:48:13,703 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2022-04-28 02:48:13,703 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2022-04-28 02:48:13,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:48:13,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:48:13,703 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 64 states. [2022-04-28 02:48:13,703 INFO L87 Difference]: Start difference. First operand has 63 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 64 states. [2022-04-28 02:48:13,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:48:13,704 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2022-04-28 02:48:13,704 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2022-04-28 02:48:13,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:48:13,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:48:13,705 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:48:13,705 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:48:13,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:13,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2022-04-28 02:48:13,706 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 60 [2022-04-28 02:48:13,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:48:13,706 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2022-04-28 02:48:13,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.0) internal successors, (56), 27 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:13,706 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 63 transitions. [2022-04-28 02:48:13,776 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:48:13,776 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2022-04-28 02:48:13,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-28 02:48:13,776 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:48:13,776 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:48:13,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-04-28 02:48:13,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-04-28 02:48:13,991 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:48:13,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:48:13,992 INFO L85 PathProgramCache]: Analyzing trace with hash -410159444, now seen corresponding path program 49 times [2022-04-28 02:48:13,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:48:13,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [14258977] [2022-04-28 02:48:13,994 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:48:13,994 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:48:13,994 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:48:13,995 INFO L85 PathProgramCache]: Analyzing trace with hash -410159444, now seen corresponding path program 50 times [2022-04-28 02:48:13,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:48:13,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194122117] [2022-04-28 02:48:13,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:48:13,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:48:14,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:48:14,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:48:14,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:48:14,385 INFO L290 TraceCheckUtils]: 0: Hoare triple {13112#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {13081#true} is VALID [2022-04-28 02:48:14,385 INFO L290 TraceCheckUtils]: 1: Hoare triple {13081#true} assume true; {13081#true} is VALID [2022-04-28 02:48:14,385 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13081#true} {13081#true} #39#return; {13081#true} is VALID [2022-04-28 02:48:14,385 INFO L272 TraceCheckUtils]: 0: Hoare triple {13081#true} call ULTIMATE.init(); {13112#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:48:14,385 INFO L290 TraceCheckUtils]: 1: Hoare triple {13112#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {13081#true} is VALID [2022-04-28 02:48:14,385 INFO L290 TraceCheckUtils]: 2: Hoare triple {13081#true} assume true; {13081#true} is VALID [2022-04-28 02:48:14,386 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13081#true} {13081#true} #39#return; {13081#true} is VALID [2022-04-28 02:48:14,386 INFO L272 TraceCheckUtils]: 4: Hoare triple {13081#true} call #t~ret6 := main(); {13081#true} is VALID [2022-04-28 02:48:14,386 INFO L290 TraceCheckUtils]: 5: Hoare triple {13081#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {13086#(= main_~i~0 0)} is VALID [2022-04-28 02:48:14,386 INFO L290 TraceCheckUtils]: 6: Hoare triple {13086#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13086#(= main_~i~0 0)} is VALID [2022-04-28 02:48:14,387 INFO L290 TraceCheckUtils]: 7: Hoare triple {13086#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13087#(<= main_~i~0 1)} is VALID [2022-04-28 02:48:14,387 INFO L290 TraceCheckUtils]: 8: Hoare triple {13087#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13087#(<= main_~i~0 1)} is VALID [2022-04-28 02:48:14,387 INFO L290 TraceCheckUtils]: 9: Hoare triple {13087#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13088#(<= main_~i~0 2)} is VALID [2022-04-28 02:48:14,388 INFO L290 TraceCheckUtils]: 10: Hoare triple {13088#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13088#(<= main_~i~0 2)} is VALID [2022-04-28 02:48:14,388 INFO L290 TraceCheckUtils]: 11: Hoare triple {13088#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13089#(<= main_~i~0 3)} is VALID [2022-04-28 02:48:14,389 INFO L290 TraceCheckUtils]: 12: Hoare triple {13089#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13089#(<= main_~i~0 3)} is VALID [2022-04-28 02:48:14,389 INFO L290 TraceCheckUtils]: 13: Hoare triple {13089#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13090#(<= main_~i~0 4)} is VALID [2022-04-28 02:48:14,389 INFO L290 TraceCheckUtils]: 14: Hoare triple {13090#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13090#(<= main_~i~0 4)} is VALID [2022-04-28 02:48:14,390 INFO L290 TraceCheckUtils]: 15: Hoare triple {13090#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13091#(<= main_~i~0 5)} is VALID [2022-04-28 02:48:14,390 INFO L290 TraceCheckUtils]: 16: Hoare triple {13091#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13091#(<= main_~i~0 5)} is VALID [2022-04-28 02:48:14,391 INFO L290 TraceCheckUtils]: 17: Hoare triple {13091#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13092#(<= main_~i~0 6)} is VALID [2022-04-28 02:48:14,391 INFO L290 TraceCheckUtils]: 18: Hoare triple {13092#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13092#(<= main_~i~0 6)} is VALID [2022-04-28 02:48:14,391 INFO L290 TraceCheckUtils]: 19: Hoare triple {13092#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13093#(<= main_~i~0 7)} is VALID [2022-04-28 02:48:14,392 INFO L290 TraceCheckUtils]: 20: Hoare triple {13093#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13093#(<= main_~i~0 7)} is VALID [2022-04-28 02:48:14,392 INFO L290 TraceCheckUtils]: 21: Hoare triple {13093#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13094#(<= main_~i~0 8)} is VALID [2022-04-28 02:48:14,392 INFO L290 TraceCheckUtils]: 22: Hoare triple {13094#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13094#(<= main_~i~0 8)} is VALID [2022-04-28 02:48:14,393 INFO L290 TraceCheckUtils]: 23: Hoare triple {13094#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13095#(<= main_~i~0 9)} is VALID [2022-04-28 02:48:14,393 INFO L290 TraceCheckUtils]: 24: Hoare triple {13095#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13095#(<= main_~i~0 9)} is VALID [2022-04-28 02:48:14,394 INFO L290 TraceCheckUtils]: 25: Hoare triple {13095#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13096#(<= main_~i~0 10)} is VALID [2022-04-28 02:48:14,394 INFO L290 TraceCheckUtils]: 26: Hoare triple {13096#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13096#(<= main_~i~0 10)} is VALID [2022-04-28 02:48:14,394 INFO L290 TraceCheckUtils]: 27: Hoare triple {13096#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13097#(<= main_~i~0 11)} is VALID [2022-04-28 02:48:14,395 INFO L290 TraceCheckUtils]: 28: Hoare triple {13097#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13097#(<= main_~i~0 11)} is VALID [2022-04-28 02:48:14,395 INFO L290 TraceCheckUtils]: 29: Hoare triple {13097#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13098#(<= main_~i~0 12)} is VALID [2022-04-28 02:48:14,395 INFO L290 TraceCheckUtils]: 30: Hoare triple {13098#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13098#(<= main_~i~0 12)} is VALID [2022-04-28 02:48:14,396 INFO L290 TraceCheckUtils]: 31: Hoare triple {13098#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13099#(<= main_~i~0 13)} is VALID [2022-04-28 02:48:14,396 INFO L290 TraceCheckUtils]: 32: Hoare triple {13099#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13099#(<= main_~i~0 13)} is VALID [2022-04-28 02:48:14,397 INFO L290 TraceCheckUtils]: 33: Hoare triple {13099#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13100#(<= main_~i~0 14)} is VALID [2022-04-28 02:48:14,397 INFO L290 TraceCheckUtils]: 34: Hoare triple {13100#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13100#(<= main_~i~0 14)} is VALID [2022-04-28 02:48:14,397 INFO L290 TraceCheckUtils]: 35: Hoare triple {13100#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13101#(<= main_~i~0 15)} is VALID [2022-04-28 02:48:14,398 INFO L290 TraceCheckUtils]: 36: Hoare triple {13101#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13101#(<= main_~i~0 15)} is VALID [2022-04-28 02:48:14,398 INFO L290 TraceCheckUtils]: 37: Hoare triple {13101#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13102#(<= main_~i~0 16)} is VALID [2022-04-28 02:48:14,399 INFO L290 TraceCheckUtils]: 38: Hoare triple {13102#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13102#(<= main_~i~0 16)} is VALID [2022-04-28 02:48:14,399 INFO L290 TraceCheckUtils]: 39: Hoare triple {13102#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13103#(<= main_~i~0 17)} is VALID [2022-04-28 02:48:14,399 INFO L290 TraceCheckUtils]: 40: Hoare triple {13103#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13103#(<= main_~i~0 17)} is VALID [2022-04-28 02:48:14,400 INFO L290 TraceCheckUtils]: 41: Hoare triple {13103#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13104#(<= main_~i~0 18)} is VALID [2022-04-28 02:48:14,400 INFO L290 TraceCheckUtils]: 42: Hoare triple {13104#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13104#(<= main_~i~0 18)} is VALID [2022-04-28 02:48:14,401 INFO L290 TraceCheckUtils]: 43: Hoare triple {13104#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13105#(<= main_~i~0 19)} is VALID [2022-04-28 02:48:14,401 INFO L290 TraceCheckUtils]: 44: Hoare triple {13105#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13105#(<= main_~i~0 19)} is VALID [2022-04-28 02:48:14,401 INFO L290 TraceCheckUtils]: 45: Hoare triple {13105#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13106#(<= main_~i~0 20)} is VALID [2022-04-28 02:48:14,402 INFO L290 TraceCheckUtils]: 46: Hoare triple {13106#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13106#(<= main_~i~0 20)} is VALID [2022-04-28 02:48:14,402 INFO L290 TraceCheckUtils]: 47: Hoare triple {13106#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13107#(<= main_~i~0 21)} is VALID [2022-04-28 02:48:14,402 INFO L290 TraceCheckUtils]: 48: Hoare triple {13107#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13107#(<= main_~i~0 21)} is VALID [2022-04-28 02:48:14,403 INFO L290 TraceCheckUtils]: 49: Hoare triple {13107#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13108#(<= main_~i~0 22)} is VALID [2022-04-28 02:48:14,403 INFO L290 TraceCheckUtils]: 50: Hoare triple {13108#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13108#(<= main_~i~0 22)} is VALID [2022-04-28 02:48:14,404 INFO L290 TraceCheckUtils]: 51: Hoare triple {13108#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13109#(<= main_~i~0 23)} is VALID [2022-04-28 02:48:14,404 INFO L290 TraceCheckUtils]: 52: Hoare triple {13109#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13109#(<= main_~i~0 23)} is VALID [2022-04-28 02:48:14,405 INFO L290 TraceCheckUtils]: 53: Hoare triple {13109#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13110#(<= main_~i~0 24)} is VALID [2022-04-28 02:48:14,405 INFO L290 TraceCheckUtils]: 54: Hoare triple {13110#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13110#(<= main_~i~0 24)} is VALID [2022-04-28 02:48:14,405 INFO L290 TraceCheckUtils]: 55: Hoare triple {13110#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13111#(<= main_~i~0 25)} is VALID [2022-04-28 02:48:14,406 INFO L290 TraceCheckUtils]: 56: Hoare triple {13111#(<= main_~i~0 25)} assume !(~i~0 < 1024); {13082#false} is VALID [2022-04-28 02:48:14,406 INFO L290 TraceCheckUtils]: 57: Hoare triple {13082#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {13082#false} is VALID [2022-04-28 02:48:14,406 INFO L272 TraceCheckUtils]: 58: Hoare triple {13082#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {13082#false} is VALID [2022-04-28 02:48:14,406 INFO L290 TraceCheckUtils]: 59: Hoare triple {13082#false} ~cond := #in~cond; {13082#false} is VALID [2022-04-28 02:48:14,406 INFO L290 TraceCheckUtils]: 60: Hoare triple {13082#false} assume 0 == ~cond; {13082#false} is VALID [2022-04-28 02:48:14,406 INFO L290 TraceCheckUtils]: 61: Hoare triple {13082#false} assume !false; {13082#false} is VALID [2022-04-28 02:48:14,407 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:48:14,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:48:14,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194122117] [2022-04-28 02:48:14,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194122117] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:48:14,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802715545] [2022-04-28 02:48:14,407 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:48:14,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:48:14,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:48:14,409 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:48:14,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-28 02:48:14,539 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:48:14,539 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:48:14,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-28 02:48:14,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:48:14,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:48:14,921 INFO L272 TraceCheckUtils]: 0: Hoare triple {13081#true} call ULTIMATE.init(); {13081#true} is VALID [2022-04-28 02:48:14,921 INFO L290 TraceCheckUtils]: 1: Hoare triple {13081#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {13081#true} is VALID [2022-04-28 02:48:14,921 INFO L290 TraceCheckUtils]: 2: Hoare triple {13081#true} assume true; {13081#true} is VALID [2022-04-28 02:48:14,921 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13081#true} {13081#true} #39#return; {13081#true} is VALID [2022-04-28 02:48:14,921 INFO L272 TraceCheckUtils]: 4: Hoare triple {13081#true} call #t~ret6 := main(); {13081#true} is VALID [2022-04-28 02:48:14,922 INFO L290 TraceCheckUtils]: 5: Hoare triple {13081#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {13131#(<= main_~i~0 0)} is VALID [2022-04-28 02:48:14,922 INFO L290 TraceCheckUtils]: 6: Hoare triple {13131#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13131#(<= main_~i~0 0)} is VALID [2022-04-28 02:48:14,922 INFO L290 TraceCheckUtils]: 7: Hoare triple {13131#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13087#(<= main_~i~0 1)} is VALID [2022-04-28 02:48:14,922 INFO L290 TraceCheckUtils]: 8: Hoare triple {13087#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13087#(<= main_~i~0 1)} is VALID [2022-04-28 02:48:14,923 INFO L290 TraceCheckUtils]: 9: Hoare triple {13087#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13088#(<= main_~i~0 2)} is VALID [2022-04-28 02:48:14,923 INFO L290 TraceCheckUtils]: 10: Hoare triple {13088#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13088#(<= main_~i~0 2)} is VALID [2022-04-28 02:48:14,923 INFO L290 TraceCheckUtils]: 11: Hoare triple {13088#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13089#(<= main_~i~0 3)} is VALID [2022-04-28 02:48:14,924 INFO L290 TraceCheckUtils]: 12: Hoare triple {13089#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13089#(<= main_~i~0 3)} is VALID [2022-04-28 02:48:14,924 INFO L290 TraceCheckUtils]: 13: Hoare triple {13089#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13090#(<= main_~i~0 4)} is VALID [2022-04-28 02:48:14,924 INFO L290 TraceCheckUtils]: 14: Hoare triple {13090#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13090#(<= main_~i~0 4)} is VALID [2022-04-28 02:48:14,925 INFO L290 TraceCheckUtils]: 15: Hoare triple {13090#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13091#(<= main_~i~0 5)} is VALID [2022-04-28 02:48:14,925 INFO L290 TraceCheckUtils]: 16: Hoare triple {13091#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13091#(<= main_~i~0 5)} is VALID [2022-04-28 02:48:14,925 INFO L290 TraceCheckUtils]: 17: Hoare triple {13091#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13092#(<= main_~i~0 6)} is VALID [2022-04-28 02:48:14,926 INFO L290 TraceCheckUtils]: 18: Hoare triple {13092#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13092#(<= main_~i~0 6)} is VALID [2022-04-28 02:48:14,926 INFO L290 TraceCheckUtils]: 19: Hoare triple {13092#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13093#(<= main_~i~0 7)} is VALID [2022-04-28 02:48:14,926 INFO L290 TraceCheckUtils]: 20: Hoare triple {13093#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13093#(<= main_~i~0 7)} is VALID [2022-04-28 02:48:14,927 INFO L290 TraceCheckUtils]: 21: Hoare triple {13093#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13094#(<= main_~i~0 8)} is VALID [2022-04-28 02:48:14,927 INFO L290 TraceCheckUtils]: 22: Hoare triple {13094#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13094#(<= main_~i~0 8)} is VALID [2022-04-28 02:48:14,927 INFO L290 TraceCheckUtils]: 23: Hoare triple {13094#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13095#(<= main_~i~0 9)} is VALID [2022-04-28 02:48:14,927 INFO L290 TraceCheckUtils]: 24: Hoare triple {13095#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13095#(<= main_~i~0 9)} is VALID [2022-04-28 02:48:14,928 INFO L290 TraceCheckUtils]: 25: Hoare triple {13095#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13096#(<= main_~i~0 10)} is VALID [2022-04-28 02:48:14,928 INFO L290 TraceCheckUtils]: 26: Hoare triple {13096#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13096#(<= main_~i~0 10)} is VALID [2022-04-28 02:48:14,928 INFO L290 TraceCheckUtils]: 27: Hoare triple {13096#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13097#(<= main_~i~0 11)} is VALID [2022-04-28 02:48:14,929 INFO L290 TraceCheckUtils]: 28: Hoare triple {13097#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13097#(<= main_~i~0 11)} is VALID [2022-04-28 02:48:14,929 INFO L290 TraceCheckUtils]: 29: Hoare triple {13097#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13098#(<= main_~i~0 12)} is VALID [2022-04-28 02:48:14,929 INFO L290 TraceCheckUtils]: 30: Hoare triple {13098#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13098#(<= main_~i~0 12)} is VALID [2022-04-28 02:48:14,930 INFO L290 TraceCheckUtils]: 31: Hoare triple {13098#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13099#(<= main_~i~0 13)} is VALID [2022-04-28 02:48:14,930 INFO L290 TraceCheckUtils]: 32: Hoare triple {13099#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13099#(<= main_~i~0 13)} is VALID [2022-04-28 02:48:14,930 INFO L290 TraceCheckUtils]: 33: Hoare triple {13099#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13100#(<= main_~i~0 14)} is VALID [2022-04-28 02:48:14,931 INFO L290 TraceCheckUtils]: 34: Hoare triple {13100#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13100#(<= main_~i~0 14)} is VALID [2022-04-28 02:48:14,931 INFO L290 TraceCheckUtils]: 35: Hoare triple {13100#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13101#(<= main_~i~0 15)} is VALID [2022-04-28 02:48:14,931 INFO L290 TraceCheckUtils]: 36: Hoare triple {13101#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13101#(<= main_~i~0 15)} is VALID [2022-04-28 02:48:14,932 INFO L290 TraceCheckUtils]: 37: Hoare triple {13101#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13102#(<= main_~i~0 16)} is VALID [2022-04-28 02:48:14,932 INFO L290 TraceCheckUtils]: 38: Hoare triple {13102#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13102#(<= main_~i~0 16)} is VALID [2022-04-28 02:48:14,932 INFO L290 TraceCheckUtils]: 39: Hoare triple {13102#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13103#(<= main_~i~0 17)} is VALID [2022-04-28 02:48:14,932 INFO L290 TraceCheckUtils]: 40: Hoare triple {13103#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13103#(<= main_~i~0 17)} is VALID [2022-04-28 02:48:14,933 INFO L290 TraceCheckUtils]: 41: Hoare triple {13103#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13104#(<= main_~i~0 18)} is VALID [2022-04-28 02:48:14,933 INFO L290 TraceCheckUtils]: 42: Hoare triple {13104#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13104#(<= main_~i~0 18)} is VALID [2022-04-28 02:48:14,933 INFO L290 TraceCheckUtils]: 43: Hoare triple {13104#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13105#(<= main_~i~0 19)} is VALID [2022-04-28 02:48:14,934 INFO L290 TraceCheckUtils]: 44: Hoare triple {13105#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13105#(<= main_~i~0 19)} is VALID [2022-04-28 02:48:14,934 INFO L290 TraceCheckUtils]: 45: Hoare triple {13105#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13106#(<= main_~i~0 20)} is VALID [2022-04-28 02:48:14,934 INFO L290 TraceCheckUtils]: 46: Hoare triple {13106#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13106#(<= main_~i~0 20)} is VALID [2022-04-28 02:48:14,935 INFO L290 TraceCheckUtils]: 47: Hoare triple {13106#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13107#(<= main_~i~0 21)} is VALID [2022-04-28 02:48:14,935 INFO L290 TraceCheckUtils]: 48: Hoare triple {13107#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13107#(<= main_~i~0 21)} is VALID [2022-04-28 02:48:14,935 INFO L290 TraceCheckUtils]: 49: Hoare triple {13107#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13108#(<= main_~i~0 22)} is VALID [2022-04-28 02:48:14,936 INFO L290 TraceCheckUtils]: 50: Hoare triple {13108#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13108#(<= main_~i~0 22)} is VALID [2022-04-28 02:48:14,936 INFO L290 TraceCheckUtils]: 51: Hoare triple {13108#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13109#(<= main_~i~0 23)} is VALID [2022-04-28 02:48:14,936 INFO L290 TraceCheckUtils]: 52: Hoare triple {13109#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13109#(<= main_~i~0 23)} is VALID [2022-04-28 02:48:14,937 INFO L290 TraceCheckUtils]: 53: Hoare triple {13109#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13110#(<= main_~i~0 24)} is VALID [2022-04-28 02:48:14,937 INFO L290 TraceCheckUtils]: 54: Hoare triple {13110#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13110#(<= main_~i~0 24)} is VALID [2022-04-28 02:48:14,937 INFO L290 TraceCheckUtils]: 55: Hoare triple {13110#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13111#(<= main_~i~0 25)} is VALID [2022-04-28 02:48:14,938 INFO L290 TraceCheckUtils]: 56: Hoare triple {13111#(<= main_~i~0 25)} assume !(~i~0 < 1024); {13082#false} is VALID [2022-04-28 02:48:14,938 INFO L290 TraceCheckUtils]: 57: Hoare triple {13082#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {13082#false} is VALID [2022-04-28 02:48:14,938 INFO L272 TraceCheckUtils]: 58: Hoare triple {13082#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {13082#false} is VALID [2022-04-28 02:48:14,938 INFO L290 TraceCheckUtils]: 59: Hoare triple {13082#false} ~cond := #in~cond; {13082#false} is VALID [2022-04-28 02:48:14,938 INFO L290 TraceCheckUtils]: 60: Hoare triple {13082#false} assume 0 == ~cond; {13082#false} is VALID [2022-04-28 02:48:14,938 INFO L290 TraceCheckUtils]: 61: Hoare triple {13082#false} assume !false; {13082#false} is VALID [2022-04-28 02:48:14,938 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:48:14,938 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:48:15,901 INFO L290 TraceCheckUtils]: 61: Hoare triple {13082#false} assume !false; {13082#false} is VALID [2022-04-28 02:48:15,901 INFO L290 TraceCheckUtils]: 60: Hoare triple {13082#false} assume 0 == ~cond; {13082#false} is VALID [2022-04-28 02:48:15,901 INFO L290 TraceCheckUtils]: 59: Hoare triple {13082#false} ~cond := #in~cond; {13082#false} is VALID [2022-04-28 02:48:15,901 INFO L272 TraceCheckUtils]: 58: Hoare triple {13082#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {13082#false} is VALID [2022-04-28 02:48:15,901 INFO L290 TraceCheckUtils]: 57: Hoare triple {13082#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {13082#false} is VALID [2022-04-28 02:48:15,915 INFO L290 TraceCheckUtils]: 56: Hoare triple {13315#(< main_~i~0 1024)} assume !(~i~0 < 1024); {13082#false} is VALID [2022-04-28 02:48:15,915 INFO L290 TraceCheckUtils]: 55: Hoare triple {13319#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13315#(< main_~i~0 1024)} is VALID [2022-04-28 02:48:15,915 INFO L290 TraceCheckUtils]: 54: Hoare triple {13319#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13319#(< main_~i~0 1023)} is VALID [2022-04-28 02:48:15,916 INFO L290 TraceCheckUtils]: 53: Hoare triple {13326#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13319#(< main_~i~0 1023)} is VALID [2022-04-28 02:48:15,916 INFO L290 TraceCheckUtils]: 52: Hoare triple {13326#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13326#(< main_~i~0 1022)} is VALID [2022-04-28 02:48:15,916 INFO L290 TraceCheckUtils]: 51: Hoare triple {13333#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13326#(< main_~i~0 1022)} is VALID [2022-04-28 02:48:15,917 INFO L290 TraceCheckUtils]: 50: Hoare triple {13333#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13333#(< main_~i~0 1021)} is VALID [2022-04-28 02:48:15,919 INFO L290 TraceCheckUtils]: 49: Hoare triple {13340#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13333#(< main_~i~0 1021)} is VALID [2022-04-28 02:48:15,920 INFO L290 TraceCheckUtils]: 48: Hoare triple {13340#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13340#(< main_~i~0 1020)} is VALID [2022-04-28 02:48:15,921 INFO L290 TraceCheckUtils]: 47: Hoare triple {13347#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13340#(< main_~i~0 1020)} is VALID [2022-04-28 02:48:15,921 INFO L290 TraceCheckUtils]: 46: Hoare triple {13347#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13347#(< main_~i~0 1019)} is VALID [2022-04-28 02:48:15,922 INFO L290 TraceCheckUtils]: 45: Hoare triple {13354#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13347#(< main_~i~0 1019)} is VALID [2022-04-28 02:48:15,922 INFO L290 TraceCheckUtils]: 44: Hoare triple {13354#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13354#(< main_~i~0 1018)} is VALID [2022-04-28 02:48:15,923 INFO L290 TraceCheckUtils]: 43: Hoare triple {13361#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13354#(< main_~i~0 1018)} is VALID [2022-04-28 02:48:15,923 INFO L290 TraceCheckUtils]: 42: Hoare triple {13361#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13361#(< main_~i~0 1017)} is VALID [2022-04-28 02:48:15,924 INFO L290 TraceCheckUtils]: 41: Hoare triple {13368#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13361#(< main_~i~0 1017)} is VALID [2022-04-28 02:48:15,925 INFO L290 TraceCheckUtils]: 40: Hoare triple {13368#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13368#(< main_~i~0 1016)} is VALID [2022-04-28 02:48:15,925 INFO L290 TraceCheckUtils]: 39: Hoare triple {13375#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13368#(< main_~i~0 1016)} is VALID [2022-04-28 02:48:15,926 INFO L290 TraceCheckUtils]: 38: Hoare triple {13375#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13375#(< main_~i~0 1015)} is VALID [2022-04-28 02:48:15,926 INFO L290 TraceCheckUtils]: 37: Hoare triple {13382#(< main_~i~0 1014)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13375#(< main_~i~0 1015)} is VALID [2022-04-28 02:48:15,927 INFO L290 TraceCheckUtils]: 36: Hoare triple {13382#(< main_~i~0 1014)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13382#(< main_~i~0 1014)} is VALID [2022-04-28 02:48:15,927 INFO L290 TraceCheckUtils]: 35: Hoare triple {13389#(< main_~i~0 1013)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13382#(< main_~i~0 1014)} is VALID [2022-04-28 02:48:15,928 INFO L290 TraceCheckUtils]: 34: Hoare triple {13389#(< main_~i~0 1013)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13389#(< main_~i~0 1013)} is VALID [2022-04-28 02:48:15,929 INFO L290 TraceCheckUtils]: 33: Hoare triple {13396#(< main_~i~0 1012)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13389#(< main_~i~0 1013)} is VALID [2022-04-28 02:48:15,929 INFO L290 TraceCheckUtils]: 32: Hoare triple {13396#(< main_~i~0 1012)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13396#(< main_~i~0 1012)} is VALID [2022-04-28 02:48:15,930 INFO L290 TraceCheckUtils]: 31: Hoare triple {13403#(< main_~i~0 1011)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13396#(< main_~i~0 1012)} is VALID [2022-04-28 02:48:15,930 INFO L290 TraceCheckUtils]: 30: Hoare triple {13403#(< main_~i~0 1011)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13403#(< main_~i~0 1011)} is VALID [2022-04-28 02:48:15,931 INFO L290 TraceCheckUtils]: 29: Hoare triple {13410#(< main_~i~0 1010)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13403#(< main_~i~0 1011)} is VALID [2022-04-28 02:48:15,931 INFO L290 TraceCheckUtils]: 28: Hoare triple {13410#(< main_~i~0 1010)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13410#(< main_~i~0 1010)} is VALID [2022-04-28 02:48:15,931 INFO L290 TraceCheckUtils]: 27: Hoare triple {13417#(< main_~i~0 1009)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13410#(< main_~i~0 1010)} is VALID [2022-04-28 02:48:15,932 INFO L290 TraceCheckUtils]: 26: Hoare triple {13417#(< main_~i~0 1009)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13417#(< main_~i~0 1009)} is VALID [2022-04-28 02:48:15,932 INFO L290 TraceCheckUtils]: 25: Hoare triple {13424#(< main_~i~0 1008)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13417#(< main_~i~0 1009)} is VALID [2022-04-28 02:48:15,933 INFO L290 TraceCheckUtils]: 24: Hoare triple {13424#(< main_~i~0 1008)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13424#(< main_~i~0 1008)} is VALID [2022-04-28 02:48:15,933 INFO L290 TraceCheckUtils]: 23: Hoare triple {13431#(< main_~i~0 1007)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13424#(< main_~i~0 1008)} is VALID [2022-04-28 02:48:15,933 INFO L290 TraceCheckUtils]: 22: Hoare triple {13431#(< main_~i~0 1007)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13431#(< main_~i~0 1007)} is VALID [2022-04-28 02:48:15,934 INFO L290 TraceCheckUtils]: 21: Hoare triple {13438#(< main_~i~0 1006)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13431#(< main_~i~0 1007)} is VALID [2022-04-28 02:48:15,934 INFO L290 TraceCheckUtils]: 20: Hoare triple {13438#(< main_~i~0 1006)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13438#(< main_~i~0 1006)} is VALID [2022-04-28 02:48:15,935 INFO L290 TraceCheckUtils]: 19: Hoare triple {13445#(< main_~i~0 1005)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13438#(< main_~i~0 1006)} is VALID [2022-04-28 02:48:15,935 INFO L290 TraceCheckUtils]: 18: Hoare triple {13445#(< main_~i~0 1005)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13445#(< main_~i~0 1005)} is VALID [2022-04-28 02:48:15,936 INFO L290 TraceCheckUtils]: 17: Hoare triple {13452#(< main_~i~0 1004)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13445#(< main_~i~0 1005)} is VALID [2022-04-28 02:48:15,936 INFO L290 TraceCheckUtils]: 16: Hoare triple {13452#(< main_~i~0 1004)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13452#(< main_~i~0 1004)} is VALID [2022-04-28 02:48:15,936 INFO L290 TraceCheckUtils]: 15: Hoare triple {13459#(< main_~i~0 1003)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13452#(< main_~i~0 1004)} is VALID [2022-04-28 02:48:15,937 INFO L290 TraceCheckUtils]: 14: Hoare triple {13459#(< main_~i~0 1003)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13459#(< main_~i~0 1003)} is VALID [2022-04-28 02:48:15,937 INFO L290 TraceCheckUtils]: 13: Hoare triple {13466#(< main_~i~0 1002)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13459#(< main_~i~0 1003)} is VALID [2022-04-28 02:48:15,938 INFO L290 TraceCheckUtils]: 12: Hoare triple {13466#(< main_~i~0 1002)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13466#(< main_~i~0 1002)} is VALID [2022-04-28 02:48:15,938 INFO L290 TraceCheckUtils]: 11: Hoare triple {13473#(< main_~i~0 1001)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13466#(< main_~i~0 1002)} is VALID [2022-04-28 02:48:15,938 INFO L290 TraceCheckUtils]: 10: Hoare triple {13473#(< main_~i~0 1001)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13473#(< main_~i~0 1001)} is VALID [2022-04-28 02:48:15,939 INFO L290 TraceCheckUtils]: 9: Hoare triple {13480#(< main_~i~0 1000)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13473#(< main_~i~0 1001)} is VALID [2022-04-28 02:48:15,939 INFO L290 TraceCheckUtils]: 8: Hoare triple {13480#(< main_~i~0 1000)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13480#(< main_~i~0 1000)} is VALID [2022-04-28 02:48:15,940 INFO L290 TraceCheckUtils]: 7: Hoare triple {13487#(< main_~i~0 999)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13480#(< main_~i~0 1000)} is VALID [2022-04-28 02:48:15,940 INFO L290 TraceCheckUtils]: 6: Hoare triple {13487#(< main_~i~0 999)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13487#(< main_~i~0 999)} is VALID [2022-04-28 02:48:15,941 INFO L290 TraceCheckUtils]: 5: Hoare triple {13081#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {13487#(< main_~i~0 999)} is VALID [2022-04-28 02:48:15,941 INFO L272 TraceCheckUtils]: 4: Hoare triple {13081#true} call #t~ret6 := main(); {13081#true} is VALID [2022-04-28 02:48:15,941 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13081#true} {13081#true} #39#return; {13081#true} is VALID [2022-04-28 02:48:15,941 INFO L290 TraceCheckUtils]: 2: Hoare triple {13081#true} assume true; {13081#true} is VALID [2022-04-28 02:48:15,941 INFO L290 TraceCheckUtils]: 1: Hoare triple {13081#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {13081#true} is VALID [2022-04-28 02:48:15,941 INFO L272 TraceCheckUtils]: 0: Hoare triple {13081#true} call ULTIMATE.init(); {13081#true} is VALID [2022-04-28 02:48:15,942 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:48:15,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [802715545] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:48:15,942 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:48:15,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 28] total 56 [2022-04-28 02:48:15,942 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:48:15,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [14258977] [2022-04-28 02:48:15,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [14258977] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:48:15,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:48:15,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-04-28 02:48:15,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650464635] [2022-04-28 02:48:15,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:48:15,943 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.0) internal successors, (58), 28 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2022-04-28 02:48:15,943 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:48:15,943 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 29 states have (on average 2.0) internal successors, (58), 28 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:15,987 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:48:15,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-28 02:48:15,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:48:15,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-28 02:48:15,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1487, Invalid=1593, Unknown=0, NotChecked=0, Total=3080 [2022-04-28 02:48:15,988 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand has 29 states, 29 states have (on average 2.0) internal successors, (58), 28 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:16,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:48:16,636 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2022-04-28 02:48:16,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-28 02:48:16,636 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.0) internal successors, (58), 28 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2022-04-28 02:48:16,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:48:16,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 2.0) internal successors, (58), 28 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:16,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 72 transitions. [2022-04-28 02:48:16,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 2.0) internal successors, (58), 28 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:16,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 72 transitions. [2022-04-28 02:48:16,638 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 72 transitions. [2022-04-28 02:48:16,702 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:48:16,703 INFO L225 Difference]: With dead ends: 72 [2022-04-28 02:48:16,703 INFO L226 Difference]: Without dead ends: 66 [2022-04-28 02:48:16,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 474 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2918, Invalid=3724, Unknown=0, NotChecked=0, Total=6642 [2022-04-28 02:48:16,705 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 60 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:48:16,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 34 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:48:16,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-28 02:48:16,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2022-04-28 02:48:16,889 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:48:16,889 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 65 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:16,889 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 65 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:16,889 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 65 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:16,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:48:16,892 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2022-04-28 02:48:16,892 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2022-04-28 02:48:16,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:48:16,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:48:16,892 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 66 states. [2022-04-28 02:48:16,892 INFO L87 Difference]: Start difference. First operand has 65 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 66 states. [2022-04-28 02:48:16,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:48:16,893 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2022-04-28 02:48:16,893 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2022-04-28 02:48:16,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:48:16,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:48:16,893 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:48:16,893 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:48:16,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:16,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2022-04-28 02:48:16,895 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 62 [2022-04-28 02:48:16,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:48:16,895 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2022-04-28 02:48:16,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.0) internal successors, (58), 28 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:16,895 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 65 transitions. [2022-04-28 02:48:16,968 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:48:16,969 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2022-04-28 02:48:16,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-28 02:48:16,969 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:48:16,969 INFO L195 NwaCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:48:16,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-04-28 02:48:17,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-04-28 02:48:17,171 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:48:17,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:48:17,172 INFO L85 PathProgramCache]: Analyzing trace with hash 99677998, now seen corresponding path program 51 times [2022-04-28 02:48:17,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:48:17,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1340300582] [2022-04-28 02:48:17,174 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:48:17,174 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:48:17,174 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:48:17,174 INFO L85 PathProgramCache]: Analyzing trace with hash 99677998, now seen corresponding path program 52 times [2022-04-28 02:48:17,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:48:17,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149105876] [2022-04-28 02:48:17,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:48:17,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:48:17,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:48:17,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:48:17,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:48:17,590 INFO L290 TraceCheckUtils]: 0: Hoare triple {14001#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {13969#true} is VALID [2022-04-28 02:48:17,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {13969#true} assume true; {13969#true} is VALID [2022-04-28 02:48:17,590 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13969#true} {13969#true} #39#return; {13969#true} is VALID [2022-04-28 02:48:17,591 INFO L272 TraceCheckUtils]: 0: Hoare triple {13969#true} call ULTIMATE.init(); {14001#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:48:17,591 INFO L290 TraceCheckUtils]: 1: Hoare triple {14001#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {13969#true} is VALID [2022-04-28 02:48:17,591 INFO L290 TraceCheckUtils]: 2: Hoare triple {13969#true} assume true; {13969#true} is VALID [2022-04-28 02:48:17,591 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13969#true} {13969#true} #39#return; {13969#true} is VALID [2022-04-28 02:48:17,591 INFO L272 TraceCheckUtils]: 4: Hoare triple {13969#true} call #t~ret6 := main(); {13969#true} is VALID [2022-04-28 02:48:17,591 INFO L290 TraceCheckUtils]: 5: Hoare triple {13969#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {13974#(= main_~i~0 0)} is VALID [2022-04-28 02:48:17,592 INFO L290 TraceCheckUtils]: 6: Hoare triple {13974#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13974#(= main_~i~0 0)} is VALID [2022-04-28 02:48:17,592 INFO L290 TraceCheckUtils]: 7: Hoare triple {13974#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13975#(<= main_~i~0 1)} is VALID [2022-04-28 02:48:17,592 INFO L290 TraceCheckUtils]: 8: Hoare triple {13975#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13975#(<= main_~i~0 1)} is VALID [2022-04-28 02:48:17,593 INFO L290 TraceCheckUtils]: 9: Hoare triple {13975#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13976#(<= main_~i~0 2)} is VALID [2022-04-28 02:48:17,593 INFO L290 TraceCheckUtils]: 10: Hoare triple {13976#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13976#(<= main_~i~0 2)} is VALID [2022-04-28 02:48:17,594 INFO L290 TraceCheckUtils]: 11: Hoare triple {13976#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13977#(<= main_~i~0 3)} is VALID [2022-04-28 02:48:17,594 INFO L290 TraceCheckUtils]: 12: Hoare triple {13977#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13977#(<= main_~i~0 3)} is VALID [2022-04-28 02:48:17,594 INFO L290 TraceCheckUtils]: 13: Hoare triple {13977#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13978#(<= main_~i~0 4)} is VALID [2022-04-28 02:48:17,595 INFO L290 TraceCheckUtils]: 14: Hoare triple {13978#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13978#(<= main_~i~0 4)} is VALID [2022-04-28 02:48:17,595 INFO L290 TraceCheckUtils]: 15: Hoare triple {13978#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13979#(<= main_~i~0 5)} is VALID [2022-04-28 02:48:17,596 INFO L290 TraceCheckUtils]: 16: Hoare triple {13979#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13979#(<= main_~i~0 5)} is VALID [2022-04-28 02:48:17,596 INFO L290 TraceCheckUtils]: 17: Hoare triple {13979#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13980#(<= main_~i~0 6)} is VALID [2022-04-28 02:48:17,596 INFO L290 TraceCheckUtils]: 18: Hoare triple {13980#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13980#(<= main_~i~0 6)} is VALID [2022-04-28 02:48:17,597 INFO L290 TraceCheckUtils]: 19: Hoare triple {13980#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13981#(<= main_~i~0 7)} is VALID [2022-04-28 02:48:17,597 INFO L290 TraceCheckUtils]: 20: Hoare triple {13981#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13981#(<= main_~i~0 7)} is VALID [2022-04-28 02:48:17,598 INFO L290 TraceCheckUtils]: 21: Hoare triple {13981#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13982#(<= main_~i~0 8)} is VALID [2022-04-28 02:48:17,598 INFO L290 TraceCheckUtils]: 22: Hoare triple {13982#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13982#(<= main_~i~0 8)} is VALID [2022-04-28 02:48:17,598 INFO L290 TraceCheckUtils]: 23: Hoare triple {13982#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13983#(<= main_~i~0 9)} is VALID [2022-04-28 02:48:17,599 INFO L290 TraceCheckUtils]: 24: Hoare triple {13983#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13983#(<= main_~i~0 9)} is VALID [2022-04-28 02:48:17,599 INFO L290 TraceCheckUtils]: 25: Hoare triple {13983#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13984#(<= main_~i~0 10)} is VALID [2022-04-28 02:48:17,600 INFO L290 TraceCheckUtils]: 26: Hoare triple {13984#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13984#(<= main_~i~0 10)} is VALID [2022-04-28 02:48:17,600 INFO L290 TraceCheckUtils]: 27: Hoare triple {13984#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13985#(<= main_~i~0 11)} is VALID [2022-04-28 02:48:17,600 INFO L290 TraceCheckUtils]: 28: Hoare triple {13985#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13985#(<= main_~i~0 11)} is VALID [2022-04-28 02:48:17,601 INFO L290 TraceCheckUtils]: 29: Hoare triple {13985#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13986#(<= main_~i~0 12)} is VALID [2022-04-28 02:48:17,601 INFO L290 TraceCheckUtils]: 30: Hoare triple {13986#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13986#(<= main_~i~0 12)} is VALID [2022-04-28 02:48:17,602 INFO L290 TraceCheckUtils]: 31: Hoare triple {13986#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13987#(<= main_~i~0 13)} is VALID [2022-04-28 02:48:17,602 INFO L290 TraceCheckUtils]: 32: Hoare triple {13987#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13987#(<= main_~i~0 13)} is VALID [2022-04-28 02:48:17,602 INFO L290 TraceCheckUtils]: 33: Hoare triple {13987#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13988#(<= main_~i~0 14)} is VALID [2022-04-28 02:48:17,603 INFO L290 TraceCheckUtils]: 34: Hoare triple {13988#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13988#(<= main_~i~0 14)} is VALID [2022-04-28 02:48:17,603 INFO L290 TraceCheckUtils]: 35: Hoare triple {13988#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13989#(<= main_~i~0 15)} is VALID [2022-04-28 02:48:17,603 INFO L290 TraceCheckUtils]: 36: Hoare triple {13989#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13989#(<= main_~i~0 15)} is VALID [2022-04-28 02:48:17,604 INFO L290 TraceCheckUtils]: 37: Hoare triple {13989#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13990#(<= main_~i~0 16)} is VALID [2022-04-28 02:48:17,604 INFO L290 TraceCheckUtils]: 38: Hoare triple {13990#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13990#(<= main_~i~0 16)} is VALID [2022-04-28 02:48:17,605 INFO L290 TraceCheckUtils]: 39: Hoare triple {13990#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13991#(<= main_~i~0 17)} is VALID [2022-04-28 02:48:17,605 INFO L290 TraceCheckUtils]: 40: Hoare triple {13991#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13991#(<= main_~i~0 17)} is VALID [2022-04-28 02:48:17,605 INFO L290 TraceCheckUtils]: 41: Hoare triple {13991#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13992#(<= main_~i~0 18)} is VALID [2022-04-28 02:48:17,606 INFO L290 TraceCheckUtils]: 42: Hoare triple {13992#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13992#(<= main_~i~0 18)} is VALID [2022-04-28 02:48:17,606 INFO L290 TraceCheckUtils]: 43: Hoare triple {13992#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13993#(<= main_~i~0 19)} is VALID [2022-04-28 02:48:17,607 INFO L290 TraceCheckUtils]: 44: Hoare triple {13993#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13993#(<= main_~i~0 19)} is VALID [2022-04-28 02:48:17,607 INFO L290 TraceCheckUtils]: 45: Hoare triple {13993#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13994#(<= main_~i~0 20)} is VALID [2022-04-28 02:48:17,607 INFO L290 TraceCheckUtils]: 46: Hoare triple {13994#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13994#(<= main_~i~0 20)} is VALID [2022-04-28 02:48:17,608 INFO L290 TraceCheckUtils]: 47: Hoare triple {13994#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13995#(<= main_~i~0 21)} is VALID [2022-04-28 02:48:17,608 INFO L290 TraceCheckUtils]: 48: Hoare triple {13995#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13995#(<= main_~i~0 21)} is VALID [2022-04-28 02:48:17,609 INFO L290 TraceCheckUtils]: 49: Hoare triple {13995#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13996#(<= main_~i~0 22)} is VALID [2022-04-28 02:48:17,609 INFO L290 TraceCheckUtils]: 50: Hoare triple {13996#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13996#(<= main_~i~0 22)} is VALID [2022-04-28 02:48:17,609 INFO L290 TraceCheckUtils]: 51: Hoare triple {13996#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13997#(<= main_~i~0 23)} is VALID [2022-04-28 02:48:17,610 INFO L290 TraceCheckUtils]: 52: Hoare triple {13997#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13997#(<= main_~i~0 23)} is VALID [2022-04-28 02:48:17,610 INFO L290 TraceCheckUtils]: 53: Hoare triple {13997#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13998#(<= main_~i~0 24)} is VALID [2022-04-28 02:48:17,610 INFO L290 TraceCheckUtils]: 54: Hoare triple {13998#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13998#(<= main_~i~0 24)} is VALID [2022-04-28 02:48:17,611 INFO L290 TraceCheckUtils]: 55: Hoare triple {13998#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13999#(<= main_~i~0 25)} is VALID [2022-04-28 02:48:17,611 INFO L290 TraceCheckUtils]: 56: Hoare triple {13999#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13999#(<= main_~i~0 25)} is VALID [2022-04-28 02:48:17,612 INFO L290 TraceCheckUtils]: 57: Hoare triple {13999#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14000#(<= main_~i~0 26)} is VALID [2022-04-28 02:48:17,612 INFO L290 TraceCheckUtils]: 58: Hoare triple {14000#(<= main_~i~0 26)} assume !(~i~0 < 1024); {13970#false} is VALID [2022-04-28 02:48:17,612 INFO L290 TraceCheckUtils]: 59: Hoare triple {13970#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {13970#false} is VALID [2022-04-28 02:48:17,612 INFO L272 TraceCheckUtils]: 60: Hoare triple {13970#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {13970#false} is VALID [2022-04-28 02:48:17,612 INFO L290 TraceCheckUtils]: 61: Hoare triple {13970#false} ~cond := #in~cond; {13970#false} is VALID [2022-04-28 02:48:17,612 INFO L290 TraceCheckUtils]: 62: Hoare triple {13970#false} assume 0 == ~cond; {13970#false} is VALID [2022-04-28 02:48:17,613 INFO L290 TraceCheckUtils]: 63: Hoare triple {13970#false} assume !false; {13970#false} is VALID [2022-04-28 02:48:17,613 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:48:17,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:48:17,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149105876] [2022-04-28 02:48:17,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149105876] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:48:17,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677010608] [2022-04-28 02:48:17,614 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 02:48:17,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:48:17,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:48:17,616 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:48:17,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-28 02:48:17,762 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 02:48:17,762 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:48:17,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-28 02:48:17,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:48:17,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:48:18,179 INFO L272 TraceCheckUtils]: 0: Hoare triple {13969#true} call ULTIMATE.init(); {13969#true} is VALID [2022-04-28 02:48:18,179 INFO L290 TraceCheckUtils]: 1: Hoare triple {13969#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {13969#true} is VALID [2022-04-28 02:48:18,179 INFO L290 TraceCheckUtils]: 2: Hoare triple {13969#true} assume true; {13969#true} is VALID [2022-04-28 02:48:18,179 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13969#true} {13969#true} #39#return; {13969#true} is VALID [2022-04-28 02:48:18,179 INFO L272 TraceCheckUtils]: 4: Hoare triple {13969#true} call #t~ret6 := main(); {13969#true} is VALID [2022-04-28 02:48:18,180 INFO L290 TraceCheckUtils]: 5: Hoare triple {13969#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {14020#(<= main_~i~0 0)} is VALID [2022-04-28 02:48:18,180 INFO L290 TraceCheckUtils]: 6: Hoare triple {14020#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14020#(<= main_~i~0 0)} is VALID [2022-04-28 02:48:18,180 INFO L290 TraceCheckUtils]: 7: Hoare triple {14020#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13975#(<= main_~i~0 1)} is VALID [2022-04-28 02:48:18,181 INFO L290 TraceCheckUtils]: 8: Hoare triple {13975#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13975#(<= main_~i~0 1)} is VALID [2022-04-28 02:48:18,181 INFO L290 TraceCheckUtils]: 9: Hoare triple {13975#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13976#(<= main_~i~0 2)} is VALID [2022-04-28 02:48:18,181 INFO L290 TraceCheckUtils]: 10: Hoare triple {13976#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13976#(<= main_~i~0 2)} is VALID [2022-04-28 02:48:18,181 INFO L290 TraceCheckUtils]: 11: Hoare triple {13976#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13977#(<= main_~i~0 3)} is VALID [2022-04-28 02:48:18,182 INFO L290 TraceCheckUtils]: 12: Hoare triple {13977#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13977#(<= main_~i~0 3)} is VALID [2022-04-28 02:48:18,182 INFO L290 TraceCheckUtils]: 13: Hoare triple {13977#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13978#(<= main_~i~0 4)} is VALID [2022-04-28 02:48:18,182 INFO L290 TraceCheckUtils]: 14: Hoare triple {13978#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13978#(<= main_~i~0 4)} is VALID [2022-04-28 02:48:18,183 INFO L290 TraceCheckUtils]: 15: Hoare triple {13978#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13979#(<= main_~i~0 5)} is VALID [2022-04-28 02:48:18,183 INFO L290 TraceCheckUtils]: 16: Hoare triple {13979#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13979#(<= main_~i~0 5)} is VALID [2022-04-28 02:48:18,183 INFO L290 TraceCheckUtils]: 17: Hoare triple {13979#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13980#(<= main_~i~0 6)} is VALID [2022-04-28 02:48:18,184 INFO L290 TraceCheckUtils]: 18: Hoare triple {13980#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13980#(<= main_~i~0 6)} is VALID [2022-04-28 02:48:18,184 INFO L290 TraceCheckUtils]: 19: Hoare triple {13980#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13981#(<= main_~i~0 7)} is VALID [2022-04-28 02:48:18,184 INFO L290 TraceCheckUtils]: 20: Hoare triple {13981#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13981#(<= main_~i~0 7)} is VALID [2022-04-28 02:48:18,185 INFO L290 TraceCheckUtils]: 21: Hoare triple {13981#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13982#(<= main_~i~0 8)} is VALID [2022-04-28 02:48:18,185 INFO L290 TraceCheckUtils]: 22: Hoare triple {13982#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13982#(<= main_~i~0 8)} is VALID [2022-04-28 02:48:18,185 INFO L290 TraceCheckUtils]: 23: Hoare triple {13982#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13983#(<= main_~i~0 9)} is VALID [2022-04-28 02:48:18,186 INFO L290 TraceCheckUtils]: 24: Hoare triple {13983#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13983#(<= main_~i~0 9)} is VALID [2022-04-28 02:48:18,186 INFO L290 TraceCheckUtils]: 25: Hoare triple {13983#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13984#(<= main_~i~0 10)} is VALID [2022-04-28 02:48:18,186 INFO L290 TraceCheckUtils]: 26: Hoare triple {13984#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13984#(<= main_~i~0 10)} is VALID [2022-04-28 02:48:18,186 INFO L290 TraceCheckUtils]: 27: Hoare triple {13984#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13985#(<= main_~i~0 11)} is VALID [2022-04-28 02:48:18,187 INFO L290 TraceCheckUtils]: 28: Hoare triple {13985#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13985#(<= main_~i~0 11)} is VALID [2022-04-28 02:48:18,187 INFO L290 TraceCheckUtils]: 29: Hoare triple {13985#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13986#(<= main_~i~0 12)} is VALID [2022-04-28 02:48:18,187 INFO L290 TraceCheckUtils]: 30: Hoare triple {13986#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13986#(<= main_~i~0 12)} is VALID [2022-04-28 02:48:18,188 INFO L290 TraceCheckUtils]: 31: Hoare triple {13986#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13987#(<= main_~i~0 13)} is VALID [2022-04-28 02:48:18,188 INFO L290 TraceCheckUtils]: 32: Hoare triple {13987#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13987#(<= main_~i~0 13)} is VALID [2022-04-28 02:48:18,188 INFO L290 TraceCheckUtils]: 33: Hoare triple {13987#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13988#(<= main_~i~0 14)} is VALID [2022-04-28 02:48:18,189 INFO L290 TraceCheckUtils]: 34: Hoare triple {13988#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13988#(<= main_~i~0 14)} is VALID [2022-04-28 02:48:18,189 INFO L290 TraceCheckUtils]: 35: Hoare triple {13988#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13989#(<= main_~i~0 15)} is VALID [2022-04-28 02:48:18,189 INFO L290 TraceCheckUtils]: 36: Hoare triple {13989#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13989#(<= main_~i~0 15)} is VALID [2022-04-28 02:48:18,190 INFO L290 TraceCheckUtils]: 37: Hoare triple {13989#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13990#(<= main_~i~0 16)} is VALID [2022-04-28 02:48:18,190 INFO L290 TraceCheckUtils]: 38: Hoare triple {13990#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13990#(<= main_~i~0 16)} is VALID [2022-04-28 02:48:18,190 INFO L290 TraceCheckUtils]: 39: Hoare triple {13990#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13991#(<= main_~i~0 17)} is VALID [2022-04-28 02:48:18,190 INFO L290 TraceCheckUtils]: 40: Hoare triple {13991#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13991#(<= main_~i~0 17)} is VALID [2022-04-28 02:48:18,191 INFO L290 TraceCheckUtils]: 41: Hoare triple {13991#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13992#(<= main_~i~0 18)} is VALID [2022-04-28 02:48:18,191 INFO L290 TraceCheckUtils]: 42: Hoare triple {13992#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13992#(<= main_~i~0 18)} is VALID [2022-04-28 02:48:18,191 INFO L290 TraceCheckUtils]: 43: Hoare triple {13992#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13993#(<= main_~i~0 19)} is VALID [2022-04-28 02:48:18,192 INFO L290 TraceCheckUtils]: 44: Hoare triple {13993#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13993#(<= main_~i~0 19)} is VALID [2022-04-28 02:48:18,192 INFO L290 TraceCheckUtils]: 45: Hoare triple {13993#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13994#(<= main_~i~0 20)} is VALID [2022-04-28 02:48:18,192 INFO L290 TraceCheckUtils]: 46: Hoare triple {13994#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13994#(<= main_~i~0 20)} is VALID [2022-04-28 02:48:18,193 INFO L290 TraceCheckUtils]: 47: Hoare triple {13994#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13995#(<= main_~i~0 21)} is VALID [2022-04-28 02:48:18,193 INFO L290 TraceCheckUtils]: 48: Hoare triple {13995#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13995#(<= main_~i~0 21)} is VALID [2022-04-28 02:48:18,193 INFO L290 TraceCheckUtils]: 49: Hoare triple {13995#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13996#(<= main_~i~0 22)} is VALID [2022-04-28 02:48:18,194 INFO L290 TraceCheckUtils]: 50: Hoare triple {13996#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13996#(<= main_~i~0 22)} is VALID [2022-04-28 02:48:18,194 INFO L290 TraceCheckUtils]: 51: Hoare triple {13996#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13997#(<= main_~i~0 23)} is VALID [2022-04-28 02:48:18,194 INFO L290 TraceCheckUtils]: 52: Hoare triple {13997#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13997#(<= main_~i~0 23)} is VALID [2022-04-28 02:48:18,195 INFO L290 TraceCheckUtils]: 53: Hoare triple {13997#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13998#(<= main_~i~0 24)} is VALID [2022-04-28 02:48:18,195 INFO L290 TraceCheckUtils]: 54: Hoare triple {13998#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13998#(<= main_~i~0 24)} is VALID [2022-04-28 02:48:18,195 INFO L290 TraceCheckUtils]: 55: Hoare triple {13998#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13999#(<= main_~i~0 25)} is VALID [2022-04-28 02:48:18,196 INFO L290 TraceCheckUtils]: 56: Hoare triple {13999#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13999#(<= main_~i~0 25)} is VALID [2022-04-28 02:48:18,196 INFO L290 TraceCheckUtils]: 57: Hoare triple {13999#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14000#(<= main_~i~0 26)} is VALID [2022-04-28 02:48:18,196 INFO L290 TraceCheckUtils]: 58: Hoare triple {14000#(<= main_~i~0 26)} assume !(~i~0 < 1024); {13970#false} is VALID [2022-04-28 02:48:18,196 INFO L290 TraceCheckUtils]: 59: Hoare triple {13970#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {13970#false} is VALID [2022-04-28 02:48:18,196 INFO L272 TraceCheckUtils]: 60: Hoare triple {13970#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {13970#false} is VALID [2022-04-28 02:48:18,196 INFO L290 TraceCheckUtils]: 61: Hoare triple {13970#false} ~cond := #in~cond; {13970#false} is VALID [2022-04-28 02:48:18,196 INFO L290 TraceCheckUtils]: 62: Hoare triple {13970#false} assume 0 == ~cond; {13970#false} is VALID [2022-04-28 02:48:18,196 INFO L290 TraceCheckUtils]: 63: Hoare triple {13970#false} assume !false; {13970#false} is VALID [2022-04-28 02:48:18,197 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:48:18,197 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:48:19,218 INFO L290 TraceCheckUtils]: 63: Hoare triple {13970#false} assume !false; {13970#false} is VALID [2022-04-28 02:48:19,218 INFO L290 TraceCheckUtils]: 62: Hoare triple {13970#false} assume 0 == ~cond; {13970#false} is VALID [2022-04-28 02:48:19,219 INFO L290 TraceCheckUtils]: 61: Hoare triple {13970#false} ~cond := #in~cond; {13970#false} is VALID [2022-04-28 02:48:19,219 INFO L272 TraceCheckUtils]: 60: Hoare triple {13970#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {13970#false} is VALID [2022-04-28 02:48:19,219 INFO L290 TraceCheckUtils]: 59: Hoare triple {13970#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {13970#false} is VALID [2022-04-28 02:48:19,219 INFO L290 TraceCheckUtils]: 58: Hoare triple {14210#(< main_~i~0 1024)} assume !(~i~0 < 1024); {13970#false} is VALID [2022-04-28 02:48:19,219 INFO L290 TraceCheckUtils]: 57: Hoare triple {14214#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14210#(< main_~i~0 1024)} is VALID [2022-04-28 02:48:19,220 INFO L290 TraceCheckUtils]: 56: Hoare triple {14214#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14214#(< main_~i~0 1023)} is VALID [2022-04-28 02:48:19,220 INFO L290 TraceCheckUtils]: 55: Hoare triple {14221#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14214#(< main_~i~0 1023)} is VALID [2022-04-28 02:48:19,220 INFO L290 TraceCheckUtils]: 54: Hoare triple {14221#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14221#(< main_~i~0 1022)} is VALID [2022-04-28 02:48:19,221 INFO L290 TraceCheckUtils]: 53: Hoare triple {14228#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14221#(< main_~i~0 1022)} is VALID [2022-04-28 02:48:19,221 INFO L290 TraceCheckUtils]: 52: Hoare triple {14228#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14228#(< main_~i~0 1021)} is VALID [2022-04-28 02:48:19,221 INFO L290 TraceCheckUtils]: 51: Hoare triple {14235#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14228#(< main_~i~0 1021)} is VALID [2022-04-28 02:48:19,222 INFO L290 TraceCheckUtils]: 50: Hoare triple {14235#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14235#(< main_~i~0 1020)} is VALID [2022-04-28 02:48:19,222 INFO L290 TraceCheckUtils]: 49: Hoare triple {14242#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14235#(< main_~i~0 1020)} is VALID [2022-04-28 02:48:19,222 INFO L290 TraceCheckUtils]: 48: Hoare triple {14242#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14242#(< main_~i~0 1019)} is VALID [2022-04-28 02:48:19,223 INFO L290 TraceCheckUtils]: 47: Hoare triple {14249#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14242#(< main_~i~0 1019)} is VALID [2022-04-28 02:48:19,223 INFO L290 TraceCheckUtils]: 46: Hoare triple {14249#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14249#(< main_~i~0 1018)} is VALID [2022-04-28 02:48:19,223 INFO L290 TraceCheckUtils]: 45: Hoare triple {14256#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14249#(< main_~i~0 1018)} is VALID [2022-04-28 02:48:19,223 INFO L290 TraceCheckUtils]: 44: Hoare triple {14256#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14256#(< main_~i~0 1017)} is VALID [2022-04-28 02:48:19,224 INFO L290 TraceCheckUtils]: 43: Hoare triple {14263#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14256#(< main_~i~0 1017)} is VALID [2022-04-28 02:48:19,224 INFO L290 TraceCheckUtils]: 42: Hoare triple {14263#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14263#(< main_~i~0 1016)} is VALID [2022-04-28 02:48:19,224 INFO L290 TraceCheckUtils]: 41: Hoare triple {14270#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14263#(< main_~i~0 1016)} is VALID [2022-04-28 02:48:19,225 INFO L290 TraceCheckUtils]: 40: Hoare triple {14270#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14270#(< main_~i~0 1015)} is VALID [2022-04-28 02:48:19,225 INFO L290 TraceCheckUtils]: 39: Hoare triple {14277#(< main_~i~0 1014)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14270#(< main_~i~0 1015)} is VALID [2022-04-28 02:48:19,225 INFO L290 TraceCheckUtils]: 38: Hoare triple {14277#(< main_~i~0 1014)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14277#(< main_~i~0 1014)} is VALID [2022-04-28 02:48:19,226 INFO L290 TraceCheckUtils]: 37: Hoare triple {14284#(< main_~i~0 1013)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14277#(< main_~i~0 1014)} is VALID [2022-04-28 02:48:19,226 INFO L290 TraceCheckUtils]: 36: Hoare triple {14284#(< main_~i~0 1013)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14284#(< main_~i~0 1013)} is VALID [2022-04-28 02:48:19,226 INFO L290 TraceCheckUtils]: 35: Hoare triple {14291#(< main_~i~0 1012)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14284#(< main_~i~0 1013)} is VALID [2022-04-28 02:48:19,227 INFO L290 TraceCheckUtils]: 34: Hoare triple {14291#(< main_~i~0 1012)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14291#(< main_~i~0 1012)} is VALID [2022-04-28 02:48:19,227 INFO L290 TraceCheckUtils]: 33: Hoare triple {14298#(< main_~i~0 1011)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14291#(< main_~i~0 1012)} is VALID [2022-04-28 02:48:19,227 INFO L290 TraceCheckUtils]: 32: Hoare triple {14298#(< main_~i~0 1011)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14298#(< main_~i~0 1011)} is VALID [2022-04-28 02:48:19,228 INFO L290 TraceCheckUtils]: 31: Hoare triple {14305#(< main_~i~0 1010)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14298#(< main_~i~0 1011)} is VALID [2022-04-28 02:48:19,228 INFO L290 TraceCheckUtils]: 30: Hoare triple {14305#(< main_~i~0 1010)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14305#(< main_~i~0 1010)} is VALID [2022-04-28 02:48:19,228 INFO L290 TraceCheckUtils]: 29: Hoare triple {14312#(< main_~i~0 1009)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14305#(< main_~i~0 1010)} is VALID [2022-04-28 02:48:19,229 INFO L290 TraceCheckUtils]: 28: Hoare triple {14312#(< main_~i~0 1009)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14312#(< main_~i~0 1009)} is VALID [2022-04-28 02:48:19,229 INFO L290 TraceCheckUtils]: 27: Hoare triple {14319#(< main_~i~0 1008)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14312#(< main_~i~0 1009)} is VALID [2022-04-28 02:48:19,229 INFO L290 TraceCheckUtils]: 26: Hoare triple {14319#(< main_~i~0 1008)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14319#(< main_~i~0 1008)} is VALID [2022-04-28 02:48:19,230 INFO L290 TraceCheckUtils]: 25: Hoare triple {14326#(< main_~i~0 1007)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14319#(< main_~i~0 1008)} is VALID [2022-04-28 02:48:19,230 INFO L290 TraceCheckUtils]: 24: Hoare triple {14326#(< main_~i~0 1007)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14326#(< main_~i~0 1007)} is VALID [2022-04-28 02:48:19,230 INFO L290 TraceCheckUtils]: 23: Hoare triple {14333#(< main_~i~0 1006)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14326#(< main_~i~0 1007)} is VALID [2022-04-28 02:48:19,230 INFO L290 TraceCheckUtils]: 22: Hoare triple {14333#(< main_~i~0 1006)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14333#(< main_~i~0 1006)} is VALID [2022-04-28 02:48:19,231 INFO L290 TraceCheckUtils]: 21: Hoare triple {14340#(< main_~i~0 1005)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14333#(< main_~i~0 1006)} is VALID [2022-04-28 02:48:19,231 INFO L290 TraceCheckUtils]: 20: Hoare triple {14340#(< main_~i~0 1005)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14340#(< main_~i~0 1005)} is VALID [2022-04-28 02:48:19,231 INFO L290 TraceCheckUtils]: 19: Hoare triple {14347#(< main_~i~0 1004)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14340#(< main_~i~0 1005)} is VALID [2022-04-28 02:48:19,232 INFO L290 TraceCheckUtils]: 18: Hoare triple {14347#(< main_~i~0 1004)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14347#(< main_~i~0 1004)} is VALID [2022-04-28 02:48:19,232 INFO L290 TraceCheckUtils]: 17: Hoare triple {14354#(< main_~i~0 1003)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14347#(< main_~i~0 1004)} is VALID [2022-04-28 02:48:19,232 INFO L290 TraceCheckUtils]: 16: Hoare triple {14354#(< main_~i~0 1003)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14354#(< main_~i~0 1003)} is VALID [2022-04-28 02:48:19,233 INFO L290 TraceCheckUtils]: 15: Hoare triple {14361#(< main_~i~0 1002)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14354#(< main_~i~0 1003)} is VALID [2022-04-28 02:48:19,233 INFO L290 TraceCheckUtils]: 14: Hoare triple {14361#(< main_~i~0 1002)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14361#(< main_~i~0 1002)} is VALID [2022-04-28 02:48:19,233 INFO L290 TraceCheckUtils]: 13: Hoare triple {14368#(< main_~i~0 1001)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14361#(< main_~i~0 1002)} is VALID [2022-04-28 02:48:19,234 INFO L290 TraceCheckUtils]: 12: Hoare triple {14368#(< main_~i~0 1001)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14368#(< main_~i~0 1001)} is VALID [2022-04-28 02:48:19,234 INFO L290 TraceCheckUtils]: 11: Hoare triple {14375#(< main_~i~0 1000)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14368#(< main_~i~0 1001)} is VALID [2022-04-28 02:48:19,234 INFO L290 TraceCheckUtils]: 10: Hoare triple {14375#(< main_~i~0 1000)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14375#(< main_~i~0 1000)} is VALID [2022-04-28 02:48:19,235 INFO L290 TraceCheckUtils]: 9: Hoare triple {14382#(< main_~i~0 999)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14375#(< main_~i~0 1000)} is VALID [2022-04-28 02:48:19,235 INFO L290 TraceCheckUtils]: 8: Hoare triple {14382#(< main_~i~0 999)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14382#(< main_~i~0 999)} is VALID [2022-04-28 02:48:19,235 INFO L290 TraceCheckUtils]: 7: Hoare triple {14389#(< main_~i~0 998)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14382#(< main_~i~0 999)} is VALID [2022-04-28 02:48:19,236 INFO L290 TraceCheckUtils]: 6: Hoare triple {14389#(< main_~i~0 998)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14389#(< main_~i~0 998)} is VALID [2022-04-28 02:48:19,236 INFO L290 TraceCheckUtils]: 5: Hoare triple {13969#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {14389#(< main_~i~0 998)} is VALID [2022-04-28 02:48:19,236 INFO L272 TraceCheckUtils]: 4: Hoare triple {13969#true} call #t~ret6 := main(); {13969#true} is VALID [2022-04-28 02:48:19,236 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13969#true} {13969#true} #39#return; {13969#true} is VALID [2022-04-28 02:48:19,236 INFO L290 TraceCheckUtils]: 2: Hoare triple {13969#true} assume true; {13969#true} is VALID [2022-04-28 02:48:19,236 INFO L290 TraceCheckUtils]: 1: Hoare triple {13969#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {13969#true} is VALID [2022-04-28 02:48:19,236 INFO L272 TraceCheckUtils]: 0: Hoare triple {13969#true} call ULTIMATE.init(); {13969#true} is VALID [2022-04-28 02:48:19,237 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:48:19,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [677010608] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:48:19,237 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:48:19,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29, 29] total 58 [2022-04-28 02:48:19,237 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:48:19,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1340300582] [2022-04-28 02:48:19,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1340300582] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:48:19,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:48:19,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-28 02:48:19,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398032798] [2022-04-28 02:48:19,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:48:19,238 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.0) internal successors, (60), 29 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-28 02:48:19,238 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:48:19,238 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 30 states have (on average 2.0) internal successors, (60), 29 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:19,285 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:48:19,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-28 02:48:19,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:48:19,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-28 02:48:19,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1598, Invalid=1708, Unknown=0, NotChecked=0, Total=3306 [2022-04-28 02:48:19,286 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand has 30 states, 30 states have (on average 2.0) internal successors, (60), 29 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:19,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:48:19,993 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2022-04-28 02:48:19,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-28 02:48:19,993 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.0) internal successors, (60), 29 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-28 02:48:19,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:48:19,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 2.0) internal successors, (60), 29 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:19,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 74 transitions. [2022-04-28 02:48:19,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 2.0) internal successors, (60), 29 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:19,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 74 transitions. [2022-04-28 02:48:19,995 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 74 transitions. [2022-04-28 02:48:20,058 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:48:20,059 INFO L225 Difference]: With dead ends: 74 [2022-04-28 02:48:20,059 INFO L226 Difference]: Without dead ends: 68 [2022-04-28 02:48:20,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=3138, Invalid=4002, Unknown=0, NotChecked=0, Total=7140 [2022-04-28 02:48:20,061 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 62 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:48:20,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 39 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:48:20,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-04-28 02:48:20,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2022-04-28 02:48:20,262 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:48:20,263 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand has 67 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:20,263 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand has 67 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:20,263 INFO L87 Difference]: Start difference. First operand 68 states. Second operand has 67 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:20,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:48:20,264 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2022-04-28 02:48:20,264 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2022-04-28 02:48:20,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:48:20,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:48:20,264 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 68 states. [2022-04-28 02:48:20,264 INFO L87 Difference]: Start difference. First operand has 67 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 68 states. [2022-04-28 02:48:20,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:48:20,265 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2022-04-28 02:48:20,266 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2022-04-28 02:48:20,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:48:20,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:48:20,266 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:48:20,266 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:48:20,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:20,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2022-04-28 02:48:20,267 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 64 [2022-04-28 02:48:20,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:48:20,267 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2022-04-28 02:48:20,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.0) internal successors, (60), 29 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:20,267 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 67 transitions. [2022-04-28 02:48:20,334 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:48:20,334 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2022-04-28 02:48:20,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-28 02:48:20,334 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:48:20,334 INFO L195 NwaCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:48:20,350 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-04-28 02:48:20,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-04-28 02:48:20,535 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:48:20,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:48:20,535 INFO L85 PathProgramCache]: Analyzing trace with hash 427188016, now seen corresponding path program 53 times [2022-04-28 02:48:20,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:48:20,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [286691960] [2022-04-28 02:48:20,537 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:48:20,537 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:48:20,537 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:48:20,537 INFO L85 PathProgramCache]: Analyzing trace with hash 427188016, now seen corresponding path program 54 times [2022-04-28 02:48:20,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:48:20,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034172144] [2022-04-28 02:48:20,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:48:20,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:48:20,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:48:20,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:48:20,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:48:20,920 INFO L290 TraceCheckUtils]: 0: Hoare triple {14918#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {14885#true} is VALID [2022-04-28 02:48:20,920 INFO L290 TraceCheckUtils]: 1: Hoare triple {14885#true} assume true; {14885#true} is VALID [2022-04-28 02:48:20,920 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14885#true} {14885#true} #39#return; {14885#true} is VALID [2022-04-28 02:48:20,921 INFO L272 TraceCheckUtils]: 0: Hoare triple {14885#true} call ULTIMATE.init(); {14918#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:48:20,921 INFO L290 TraceCheckUtils]: 1: Hoare triple {14918#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {14885#true} is VALID [2022-04-28 02:48:20,921 INFO L290 TraceCheckUtils]: 2: Hoare triple {14885#true} assume true; {14885#true} is VALID [2022-04-28 02:48:20,921 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14885#true} {14885#true} #39#return; {14885#true} is VALID [2022-04-28 02:48:20,921 INFO L272 TraceCheckUtils]: 4: Hoare triple {14885#true} call #t~ret6 := main(); {14885#true} is VALID [2022-04-28 02:48:20,922 INFO L290 TraceCheckUtils]: 5: Hoare triple {14885#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {14890#(= main_~i~0 0)} is VALID [2022-04-28 02:48:20,922 INFO L290 TraceCheckUtils]: 6: Hoare triple {14890#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14890#(= main_~i~0 0)} is VALID [2022-04-28 02:48:20,922 INFO L290 TraceCheckUtils]: 7: Hoare triple {14890#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14891#(<= main_~i~0 1)} is VALID [2022-04-28 02:48:20,923 INFO L290 TraceCheckUtils]: 8: Hoare triple {14891#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14891#(<= main_~i~0 1)} is VALID [2022-04-28 02:48:20,923 INFO L290 TraceCheckUtils]: 9: Hoare triple {14891#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14892#(<= main_~i~0 2)} is VALID [2022-04-28 02:48:20,923 INFO L290 TraceCheckUtils]: 10: Hoare triple {14892#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14892#(<= main_~i~0 2)} is VALID [2022-04-28 02:48:20,924 INFO L290 TraceCheckUtils]: 11: Hoare triple {14892#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14893#(<= main_~i~0 3)} is VALID [2022-04-28 02:48:20,924 INFO L290 TraceCheckUtils]: 12: Hoare triple {14893#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14893#(<= main_~i~0 3)} is VALID [2022-04-28 02:48:20,924 INFO L290 TraceCheckUtils]: 13: Hoare triple {14893#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14894#(<= main_~i~0 4)} is VALID [2022-04-28 02:48:20,925 INFO L290 TraceCheckUtils]: 14: Hoare triple {14894#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14894#(<= main_~i~0 4)} is VALID [2022-04-28 02:48:20,925 INFO L290 TraceCheckUtils]: 15: Hoare triple {14894#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14895#(<= main_~i~0 5)} is VALID [2022-04-28 02:48:20,925 INFO L290 TraceCheckUtils]: 16: Hoare triple {14895#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14895#(<= main_~i~0 5)} is VALID [2022-04-28 02:48:20,926 INFO L290 TraceCheckUtils]: 17: Hoare triple {14895#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14896#(<= main_~i~0 6)} is VALID [2022-04-28 02:48:20,926 INFO L290 TraceCheckUtils]: 18: Hoare triple {14896#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14896#(<= main_~i~0 6)} is VALID [2022-04-28 02:48:20,926 INFO L290 TraceCheckUtils]: 19: Hoare triple {14896#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14897#(<= main_~i~0 7)} is VALID [2022-04-28 02:48:20,927 INFO L290 TraceCheckUtils]: 20: Hoare triple {14897#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14897#(<= main_~i~0 7)} is VALID [2022-04-28 02:48:20,927 INFO L290 TraceCheckUtils]: 21: Hoare triple {14897#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14898#(<= main_~i~0 8)} is VALID [2022-04-28 02:48:20,927 INFO L290 TraceCheckUtils]: 22: Hoare triple {14898#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14898#(<= main_~i~0 8)} is VALID [2022-04-28 02:48:20,928 INFO L290 TraceCheckUtils]: 23: Hoare triple {14898#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14899#(<= main_~i~0 9)} is VALID [2022-04-28 02:48:20,928 INFO L290 TraceCheckUtils]: 24: Hoare triple {14899#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14899#(<= main_~i~0 9)} is VALID [2022-04-28 02:48:20,928 INFO L290 TraceCheckUtils]: 25: Hoare triple {14899#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14900#(<= main_~i~0 10)} is VALID [2022-04-28 02:48:20,929 INFO L290 TraceCheckUtils]: 26: Hoare triple {14900#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14900#(<= main_~i~0 10)} is VALID [2022-04-28 02:48:20,929 INFO L290 TraceCheckUtils]: 27: Hoare triple {14900#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14901#(<= main_~i~0 11)} is VALID [2022-04-28 02:48:20,929 INFO L290 TraceCheckUtils]: 28: Hoare triple {14901#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14901#(<= main_~i~0 11)} is VALID [2022-04-28 02:48:20,930 INFO L290 TraceCheckUtils]: 29: Hoare triple {14901#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14902#(<= main_~i~0 12)} is VALID [2022-04-28 02:48:20,930 INFO L290 TraceCheckUtils]: 30: Hoare triple {14902#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14902#(<= main_~i~0 12)} is VALID [2022-04-28 02:48:20,930 INFO L290 TraceCheckUtils]: 31: Hoare triple {14902#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14903#(<= main_~i~0 13)} is VALID [2022-04-28 02:48:20,931 INFO L290 TraceCheckUtils]: 32: Hoare triple {14903#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14903#(<= main_~i~0 13)} is VALID [2022-04-28 02:48:20,931 INFO L290 TraceCheckUtils]: 33: Hoare triple {14903#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14904#(<= main_~i~0 14)} is VALID [2022-04-28 02:48:20,931 INFO L290 TraceCheckUtils]: 34: Hoare triple {14904#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14904#(<= main_~i~0 14)} is VALID [2022-04-28 02:48:20,932 INFO L290 TraceCheckUtils]: 35: Hoare triple {14904#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14905#(<= main_~i~0 15)} is VALID [2022-04-28 02:48:20,932 INFO L290 TraceCheckUtils]: 36: Hoare triple {14905#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14905#(<= main_~i~0 15)} is VALID [2022-04-28 02:48:20,932 INFO L290 TraceCheckUtils]: 37: Hoare triple {14905#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14906#(<= main_~i~0 16)} is VALID [2022-04-28 02:48:20,933 INFO L290 TraceCheckUtils]: 38: Hoare triple {14906#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14906#(<= main_~i~0 16)} is VALID [2022-04-28 02:48:20,933 INFO L290 TraceCheckUtils]: 39: Hoare triple {14906#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14907#(<= main_~i~0 17)} is VALID [2022-04-28 02:48:20,933 INFO L290 TraceCheckUtils]: 40: Hoare triple {14907#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14907#(<= main_~i~0 17)} is VALID [2022-04-28 02:48:20,934 INFO L290 TraceCheckUtils]: 41: Hoare triple {14907#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14908#(<= main_~i~0 18)} is VALID [2022-04-28 02:48:20,934 INFO L290 TraceCheckUtils]: 42: Hoare triple {14908#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14908#(<= main_~i~0 18)} is VALID [2022-04-28 02:48:20,934 INFO L290 TraceCheckUtils]: 43: Hoare triple {14908#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14909#(<= main_~i~0 19)} is VALID [2022-04-28 02:48:20,935 INFO L290 TraceCheckUtils]: 44: Hoare triple {14909#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14909#(<= main_~i~0 19)} is VALID [2022-04-28 02:48:20,935 INFO L290 TraceCheckUtils]: 45: Hoare triple {14909#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14910#(<= main_~i~0 20)} is VALID [2022-04-28 02:48:20,935 INFO L290 TraceCheckUtils]: 46: Hoare triple {14910#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14910#(<= main_~i~0 20)} is VALID [2022-04-28 02:48:20,936 INFO L290 TraceCheckUtils]: 47: Hoare triple {14910#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14911#(<= main_~i~0 21)} is VALID [2022-04-28 02:48:20,936 INFO L290 TraceCheckUtils]: 48: Hoare triple {14911#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14911#(<= main_~i~0 21)} is VALID [2022-04-28 02:48:20,937 INFO L290 TraceCheckUtils]: 49: Hoare triple {14911#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14912#(<= main_~i~0 22)} is VALID [2022-04-28 02:48:20,937 INFO L290 TraceCheckUtils]: 50: Hoare triple {14912#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14912#(<= main_~i~0 22)} is VALID [2022-04-28 02:48:20,937 INFO L290 TraceCheckUtils]: 51: Hoare triple {14912#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14913#(<= main_~i~0 23)} is VALID [2022-04-28 02:48:20,937 INFO L290 TraceCheckUtils]: 52: Hoare triple {14913#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14913#(<= main_~i~0 23)} is VALID [2022-04-28 02:48:20,938 INFO L290 TraceCheckUtils]: 53: Hoare triple {14913#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14914#(<= main_~i~0 24)} is VALID [2022-04-28 02:48:20,938 INFO L290 TraceCheckUtils]: 54: Hoare triple {14914#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14914#(<= main_~i~0 24)} is VALID [2022-04-28 02:48:20,939 INFO L290 TraceCheckUtils]: 55: Hoare triple {14914#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14915#(<= main_~i~0 25)} is VALID [2022-04-28 02:48:20,939 INFO L290 TraceCheckUtils]: 56: Hoare triple {14915#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14915#(<= main_~i~0 25)} is VALID [2022-04-28 02:48:20,943 INFO L290 TraceCheckUtils]: 57: Hoare triple {14915#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14916#(<= main_~i~0 26)} is VALID [2022-04-28 02:48:20,944 INFO L290 TraceCheckUtils]: 58: Hoare triple {14916#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14916#(<= main_~i~0 26)} is VALID [2022-04-28 02:48:20,944 INFO L290 TraceCheckUtils]: 59: Hoare triple {14916#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14917#(<= main_~i~0 27)} is VALID [2022-04-28 02:48:20,944 INFO L290 TraceCheckUtils]: 60: Hoare triple {14917#(<= main_~i~0 27)} assume !(~i~0 < 1024); {14886#false} is VALID [2022-04-28 02:48:20,945 INFO L290 TraceCheckUtils]: 61: Hoare triple {14886#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {14886#false} is VALID [2022-04-28 02:48:20,945 INFO L272 TraceCheckUtils]: 62: Hoare triple {14886#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {14886#false} is VALID [2022-04-28 02:48:20,945 INFO L290 TraceCheckUtils]: 63: Hoare triple {14886#false} ~cond := #in~cond; {14886#false} is VALID [2022-04-28 02:48:20,945 INFO L290 TraceCheckUtils]: 64: Hoare triple {14886#false} assume 0 == ~cond; {14886#false} is VALID [2022-04-28 02:48:20,945 INFO L290 TraceCheckUtils]: 65: Hoare triple {14886#false} assume !false; {14886#false} is VALID [2022-04-28 02:48:20,946 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:48:20,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:48:20,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034172144] [2022-04-28 02:48:20,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034172144] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:48:20,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1856770847] [2022-04-28 02:48:20,946 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 02:48:20,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:48:20,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:48:20,948 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:48:20,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-04-28 02:48:27,491 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 28 check-sat command(s) [2022-04-28 02:48:27,492 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:48:27,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-28 02:48:27,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:48:27,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:48:27,871 INFO L272 TraceCheckUtils]: 0: Hoare triple {14885#true} call ULTIMATE.init(); {14885#true} is VALID [2022-04-28 02:48:27,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {14885#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {14885#true} is VALID [2022-04-28 02:48:27,872 INFO L290 TraceCheckUtils]: 2: Hoare triple {14885#true} assume true; {14885#true} is VALID [2022-04-28 02:48:27,872 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14885#true} {14885#true} #39#return; {14885#true} is VALID [2022-04-28 02:48:27,872 INFO L272 TraceCheckUtils]: 4: Hoare triple {14885#true} call #t~ret6 := main(); {14885#true} is VALID [2022-04-28 02:48:27,872 INFO L290 TraceCheckUtils]: 5: Hoare triple {14885#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {14937#(<= main_~i~0 0)} is VALID [2022-04-28 02:48:27,872 INFO L290 TraceCheckUtils]: 6: Hoare triple {14937#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14937#(<= main_~i~0 0)} is VALID [2022-04-28 02:48:27,873 INFO L290 TraceCheckUtils]: 7: Hoare triple {14937#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14891#(<= main_~i~0 1)} is VALID [2022-04-28 02:48:27,873 INFO L290 TraceCheckUtils]: 8: Hoare triple {14891#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14891#(<= main_~i~0 1)} is VALID [2022-04-28 02:48:27,873 INFO L290 TraceCheckUtils]: 9: Hoare triple {14891#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14892#(<= main_~i~0 2)} is VALID [2022-04-28 02:48:27,874 INFO L290 TraceCheckUtils]: 10: Hoare triple {14892#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14892#(<= main_~i~0 2)} is VALID [2022-04-28 02:48:27,874 INFO L290 TraceCheckUtils]: 11: Hoare triple {14892#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14893#(<= main_~i~0 3)} is VALID [2022-04-28 02:48:27,874 INFO L290 TraceCheckUtils]: 12: Hoare triple {14893#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14893#(<= main_~i~0 3)} is VALID [2022-04-28 02:48:27,875 INFO L290 TraceCheckUtils]: 13: Hoare triple {14893#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14894#(<= main_~i~0 4)} is VALID [2022-04-28 02:48:27,875 INFO L290 TraceCheckUtils]: 14: Hoare triple {14894#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14894#(<= main_~i~0 4)} is VALID [2022-04-28 02:48:27,875 INFO L290 TraceCheckUtils]: 15: Hoare triple {14894#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14895#(<= main_~i~0 5)} is VALID [2022-04-28 02:48:27,875 INFO L290 TraceCheckUtils]: 16: Hoare triple {14895#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14895#(<= main_~i~0 5)} is VALID [2022-04-28 02:48:27,876 INFO L290 TraceCheckUtils]: 17: Hoare triple {14895#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14896#(<= main_~i~0 6)} is VALID [2022-04-28 02:48:27,876 INFO L290 TraceCheckUtils]: 18: Hoare triple {14896#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14896#(<= main_~i~0 6)} is VALID [2022-04-28 02:48:27,876 INFO L290 TraceCheckUtils]: 19: Hoare triple {14896#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14897#(<= main_~i~0 7)} is VALID [2022-04-28 02:48:27,877 INFO L290 TraceCheckUtils]: 20: Hoare triple {14897#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14897#(<= main_~i~0 7)} is VALID [2022-04-28 02:48:27,877 INFO L290 TraceCheckUtils]: 21: Hoare triple {14897#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14898#(<= main_~i~0 8)} is VALID [2022-04-28 02:48:27,877 INFO L290 TraceCheckUtils]: 22: Hoare triple {14898#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14898#(<= main_~i~0 8)} is VALID [2022-04-28 02:48:27,878 INFO L290 TraceCheckUtils]: 23: Hoare triple {14898#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14899#(<= main_~i~0 9)} is VALID [2022-04-28 02:48:27,878 INFO L290 TraceCheckUtils]: 24: Hoare triple {14899#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14899#(<= main_~i~0 9)} is VALID [2022-04-28 02:48:27,878 INFO L290 TraceCheckUtils]: 25: Hoare triple {14899#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14900#(<= main_~i~0 10)} is VALID [2022-04-28 02:48:27,879 INFO L290 TraceCheckUtils]: 26: Hoare triple {14900#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14900#(<= main_~i~0 10)} is VALID [2022-04-28 02:48:27,879 INFO L290 TraceCheckUtils]: 27: Hoare triple {14900#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14901#(<= main_~i~0 11)} is VALID [2022-04-28 02:48:27,879 INFO L290 TraceCheckUtils]: 28: Hoare triple {14901#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14901#(<= main_~i~0 11)} is VALID [2022-04-28 02:48:27,880 INFO L290 TraceCheckUtils]: 29: Hoare triple {14901#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14902#(<= main_~i~0 12)} is VALID [2022-04-28 02:48:27,880 INFO L290 TraceCheckUtils]: 30: Hoare triple {14902#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14902#(<= main_~i~0 12)} is VALID [2022-04-28 02:48:27,880 INFO L290 TraceCheckUtils]: 31: Hoare triple {14902#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14903#(<= main_~i~0 13)} is VALID [2022-04-28 02:48:27,880 INFO L290 TraceCheckUtils]: 32: Hoare triple {14903#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14903#(<= main_~i~0 13)} is VALID [2022-04-28 02:48:27,881 INFO L290 TraceCheckUtils]: 33: Hoare triple {14903#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14904#(<= main_~i~0 14)} is VALID [2022-04-28 02:48:27,881 INFO L290 TraceCheckUtils]: 34: Hoare triple {14904#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14904#(<= main_~i~0 14)} is VALID [2022-04-28 02:48:27,881 INFO L290 TraceCheckUtils]: 35: Hoare triple {14904#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14905#(<= main_~i~0 15)} is VALID [2022-04-28 02:48:27,882 INFO L290 TraceCheckUtils]: 36: Hoare triple {14905#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14905#(<= main_~i~0 15)} is VALID [2022-04-28 02:48:27,882 INFO L290 TraceCheckUtils]: 37: Hoare triple {14905#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14906#(<= main_~i~0 16)} is VALID [2022-04-28 02:48:27,882 INFO L290 TraceCheckUtils]: 38: Hoare triple {14906#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14906#(<= main_~i~0 16)} is VALID [2022-04-28 02:48:27,883 INFO L290 TraceCheckUtils]: 39: Hoare triple {14906#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14907#(<= main_~i~0 17)} is VALID [2022-04-28 02:48:27,883 INFO L290 TraceCheckUtils]: 40: Hoare triple {14907#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14907#(<= main_~i~0 17)} is VALID [2022-04-28 02:48:27,883 INFO L290 TraceCheckUtils]: 41: Hoare triple {14907#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14908#(<= main_~i~0 18)} is VALID [2022-04-28 02:48:27,884 INFO L290 TraceCheckUtils]: 42: Hoare triple {14908#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14908#(<= main_~i~0 18)} is VALID [2022-04-28 02:48:27,884 INFO L290 TraceCheckUtils]: 43: Hoare triple {14908#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14909#(<= main_~i~0 19)} is VALID [2022-04-28 02:48:27,884 INFO L290 TraceCheckUtils]: 44: Hoare triple {14909#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14909#(<= main_~i~0 19)} is VALID [2022-04-28 02:48:27,884 INFO L290 TraceCheckUtils]: 45: Hoare triple {14909#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14910#(<= main_~i~0 20)} is VALID [2022-04-28 02:48:27,885 INFO L290 TraceCheckUtils]: 46: Hoare triple {14910#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14910#(<= main_~i~0 20)} is VALID [2022-04-28 02:48:27,885 INFO L290 TraceCheckUtils]: 47: Hoare triple {14910#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14911#(<= main_~i~0 21)} is VALID [2022-04-28 02:48:27,885 INFO L290 TraceCheckUtils]: 48: Hoare triple {14911#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14911#(<= main_~i~0 21)} is VALID [2022-04-28 02:48:27,886 INFO L290 TraceCheckUtils]: 49: Hoare triple {14911#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14912#(<= main_~i~0 22)} is VALID [2022-04-28 02:48:27,886 INFO L290 TraceCheckUtils]: 50: Hoare triple {14912#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14912#(<= main_~i~0 22)} is VALID [2022-04-28 02:48:27,886 INFO L290 TraceCheckUtils]: 51: Hoare triple {14912#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14913#(<= main_~i~0 23)} is VALID [2022-04-28 02:48:27,887 INFO L290 TraceCheckUtils]: 52: Hoare triple {14913#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14913#(<= main_~i~0 23)} is VALID [2022-04-28 02:48:27,887 INFO L290 TraceCheckUtils]: 53: Hoare triple {14913#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14914#(<= main_~i~0 24)} is VALID [2022-04-28 02:48:27,887 INFO L290 TraceCheckUtils]: 54: Hoare triple {14914#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14914#(<= main_~i~0 24)} is VALID [2022-04-28 02:48:27,888 INFO L290 TraceCheckUtils]: 55: Hoare triple {14914#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14915#(<= main_~i~0 25)} is VALID [2022-04-28 02:48:27,888 INFO L290 TraceCheckUtils]: 56: Hoare triple {14915#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14915#(<= main_~i~0 25)} is VALID [2022-04-28 02:48:27,888 INFO L290 TraceCheckUtils]: 57: Hoare triple {14915#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14916#(<= main_~i~0 26)} is VALID [2022-04-28 02:48:27,888 INFO L290 TraceCheckUtils]: 58: Hoare triple {14916#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14916#(<= main_~i~0 26)} is VALID [2022-04-28 02:48:27,889 INFO L290 TraceCheckUtils]: 59: Hoare triple {14916#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14917#(<= main_~i~0 27)} is VALID [2022-04-28 02:48:27,889 INFO L290 TraceCheckUtils]: 60: Hoare triple {14917#(<= main_~i~0 27)} assume !(~i~0 < 1024); {14886#false} is VALID [2022-04-28 02:48:27,889 INFO L290 TraceCheckUtils]: 61: Hoare triple {14886#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {14886#false} is VALID [2022-04-28 02:48:27,889 INFO L272 TraceCheckUtils]: 62: Hoare triple {14886#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {14886#false} is VALID [2022-04-28 02:48:27,889 INFO L290 TraceCheckUtils]: 63: Hoare triple {14886#false} ~cond := #in~cond; {14886#false} is VALID [2022-04-28 02:48:27,889 INFO L290 TraceCheckUtils]: 64: Hoare triple {14886#false} assume 0 == ~cond; {14886#false} is VALID [2022-04-28 02:48:27,889 INFO L290 TraceCheckUtils]: 65: Hoare triple {14886#false} assume !false; {14886#false} is VALID [2022-04-28 02:48:27,890 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:48:27,890 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:48:28,978 INFO L290 TraceCheckUtils]: 65: Hoare triple {14886#false} assume !false; {14886#false} is VALID [2022-04-28 02:48:28,978 INFO L290 TraceCheckUtils]: 64: Hoare triple {14886#false} assume 0 == ~cond; {14886#false} is VALID [2022-04-28 02:48:28,978 INFO L290 TraceCheckUtils]: 63: Hoare triple {14886#false} ~cond := #in~cond; {14886#false} is VALID [2022-04-28 02:48:28,979 INFO L272 TraceCheckUtils]: 62: Hoare triple {14886#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {14886#false} is VALID [2022-04-28 02:48:28,979 INFO L290 TraceCheckUtils]: 61: Hoare triple {14886#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {14886#false} is VALID [2022-04-28 02:48:28,979 INFO L290 TraceCheckUtils]: 60: Hoare triple {15133#(< main_~i~0 1024)} assume !(~i~0 < 1024); {14886#false} is VALID [2022-04-28 02:48:28,980 INFO L290 TraceCheckUtils]: 59: Hoare triple {15137#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15133#(< main_~i~0 1024)} is VALID [2022-04-28 02:48:28,980 INFO L290 TraceCheckUtils]: 58: Hoare triple {15137#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15137#(< main_~i~0 1023)} is VALID [2022-04-28 02:48:28,980 INFO L290 TraceCheckUtils]: 57: Hoare triple {15144#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15137#(< main_~i~0 1023)} is VALID [2022-04-28 02:48:28,981 INFO L290 TraceCheckUtils]: 56: Hoare triple {15144#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15144#(< main_~i~0 1022)} is VALID [2022-04-28 02:48:28,981 INFO L290 TraceCheckUtils]: 55: Hoare triple {15151#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15144#(< main_~i~0 1022)} is VALID [2022-04-28 02:48:28,982 INFO L290 TraceCheckUtils]: 54: Hoare triple {15151#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15151#(< main_~i~0 1021)} is VALID [2022-04-28 02:48:28,982 INFO L290 TraceCheckUtils]: 53: Hoare triple {15158#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15151#(< main_~i~0 1021)} is VALID [2022-04-28 02:48:28,982 INFO L290 TraceCheckUtils]: 52: Hoare triple {15158#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15158#(< main_~i~0 1020)} is VALID [2022-04-28 02:48:28,983 INFO L290 TraceCheckUtils]: 51: Hoare triple {15165#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15158#(< main_~i~0 1020)} is VALID [2022-04-28 02:48:28,983 INFO L290 TraceCheckUtils]: 50: Hoare triple {15165#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15165#(< main_~i~0 1019)} is VALID [2022-04-28 02:48:28,984 INFO L290 TraceCheckUtils]: 49: Hoare triple {15172#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15165#(< main_~i~0 1019)} is VALID [2022-04-28 02:48:28,984 INFO L290 TraceCheckUtils]: 48: Hoare triple {15172#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15172#(< main_~i~0 1018)} is VALID [2022-04-28 02:48:28,985 INFO L290 TraceCheckUtils]: 47: Hoare triple {15179#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15172#(< main_~i~0 1018)} is VALID [2022-04-28 02:48:28,985 INFO L290 TraceCheckUtils]: 46: Hoare triple {15179#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15179#(< main_~i~0 1017)} is VALID [2022-04-28 02:48:28,985 INFO L290 TraceCheckUtils]: 45: Hoare triple {15186#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15179#(< main_~i~0 1017)} is VALID [2022-04-28 02:48:28,986 INFO L290 TraceCheckUtils]: 44: Hoare triple {15186#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15186#(< main_~i~0 1016)} is VALID [2022-04-28 02:48:28,986 INFO L290 TraceCheckUtils]: 43: Hoare triple {15193#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15186#(< main_~i~0 1016)} is VALID [2022-04-28 02:48:28,987 INFO L290 TraceCheckUtils]: 42: Hoare triple {15193#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15193#(< main_~i~0 1015)} is VALID [2022-04-28 02:48:28,987 INFO L290 TraceCheckUtils]: 41: Hoare triple {15200#(< main_~i~0 1014)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15193#(< main_~i~0 1015)} is VALID [2022-04-28 02:48:28,988 INFO L290 TraceCheckUtils]: 40: Hoare triple {15200#(< main_~i~0 1014)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15200#(< main_~i~0 1014)} is VALID [2022-04-28 02:48:28,988 INFO L290 TraceCheckUtils]: 39: Hoare triple {15207#(< main_~i~0 1013)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15200#(< main_~i~0 1014)} is VALID [2022-04-28 02:48:28,988 INFO L290 TraceCheckUtils]: 38: Hoare triple {15207#(< main_~i~0 1013)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15207#(< main_~i~0 1013)} is VALID [2022-04-28 02:48:28,989 INFO L290 TraceCheckUtils]: 37: Hoare triple {15214#(< main_~i~0 1012)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15207#(< main_~i~0 1013)} is VALID [2022-04-28 02:48:28,989 INFO L290 TraceCheckUtils]: 36: Hoare triple {15214#(< main_~i~0 1012)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15214#(< main_~i~0 1012)} is VALID [2022-04-28 02:48:28,990 INFO L290 TraceCheckUtils]: 35: Hoare triple {15221#(< main_~i~0 1011)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15214#(< main_~i~0 1012)} is VALID [2022-04-28 02:48:28,990 INFO L290 TraceCheckUtils]: 34: Hoare triple {15221#(< main_~i~0 1011)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15221#(< main_~i~0 1011)} is VALID [2022-04-28 02:48:28,990 INFO L290 TraceCheckUtils]: 33: Hoare triple {15228#(< main_~i~0 1010)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15221#(< main_~i~0 1011)} is VALID [2022-04-28 02:48:28,991 INFO L290 TraceCheckUtils]: 32: Hoare triple {15228#(< main_~i~0 1010)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15228#(< main_~i~0 1010)} is VALID [2022-04-28 02:48:28,991 INFO L290 TraceCheckUtils]: 31: Hoare triple {15235#(< main_~i~0 1009)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15228#(< main_~i~0 1010)} is VALID [2022-04-28 02:48:28,992 INFO L290 TraceCheckUtils]: 30: Hoare triple {15235#(< main_~i~0 1009)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15235#(< main_~i~0 1009)} is VALID [2022-04-28 02:48:28,992 INFO L290 TraceCheckUtils]: 29: Hoare triple {15242#(< main_~i~0 1008)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15235#(< main_~i~0 1009)} is VALID [2022-04-28 02:48:28,993 INFO L290 TraceCheckUtils]: 28: Hoare triple {15242#(< main_~i~0 1008)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15242#(< main_~i~0 1008)} is VALID [2022-04-28 02:48:28,993 INFO L290 TraceCheckUtils]: 27: Hoare triple {15249#(< main_~i~0 1007)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15242#(< main_~i~0 1008)} is VALID [2022-04-28 02:48:28,993 INFO L290 TraceCheckUtils]: 26: Hoare triple {15249#(< main_~i~0 1007)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15249#(< main_~i~0 1007)} is VALID [2022-04-28 02:48:28,994 INFO L290 TraceCheckUtils]: 25: Hoare triple {15256#(< main_~i~0 1006)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15249#(< main_~i~0 1007)} is VALID [2022-04-28 02:48:28,994 INFO L290 TraceCheckUtils]: 24: Hoare triple {15256#(< main_~i~0 1006)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15256#(< main_~i~0 1006)} is VALID [2022-04-28 02:48:28,995 INFO L290 TraceCheckUtils]: 23: Hoare triple {15263#(< main_~i~0 1005)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15256#(< main_~i~0 1006)} is VALID [2022-04-28 02:48:28,995 INFO L290 TraceCheckUtils]: 22: Hoare triple {15263#(< main_~i~0 1005)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15263#(< main_~i~0 1005)} is VALID [2022-04-28 02:48:28,996 INFO L290 TraceCheckUtils]: 21: Hoare triple {15270#(< main_~i~0 1004)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15263#(< main_~i~0 1005)} is VALID [2022-04-28 02:48:28,996 INFO L290 TraceCheckUtils]: 20: Hoare triple {15270#(< main_~i~0 1004)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15270#(< main_~i~0 1004)} is VALID [2022-04-28 02:48:28,996 INFO L290 TraceCheckUtils]: 19: Hoare triple {15277#(< main_~i~0 1003)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15270#(< main_~i~0 1004)} is VALID [2022-04-28 02:48:28,997 INFO L290 TraceCheckUtils]: 18: Hoare triple {15277#(< main_~i~0 1003)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15277#(< main_~i~0 1003)} is VALID [2022-04-28 02:48:28,997 INFO L290 TraceCheckUtils]: 17: Hoare triple {15284#(< main_~i~0 1002)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15277#(< main_~i~0 1003)} is VALID [2022-04-28 02:48:28,998 INFO L290 TraceCheckUtils]: 16: Hoare triple {15284#(< main_~i~0 1002)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15284#(< main_~i~0 1002)} is VALID [2022-04-28 02:48:28,998 INFO L290 TraceCheckUtils]: 15: Hoare triple {15291#(< main_~i~0 1001)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15284#(< main_~i~0 1002)} is VALID [2022-04-28 02:48:28,998 INFO L290 TraceCheckUtils]: 14: Hoare triple {15291#(< main_~i~0 1001)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15291#(< main_~i~0 1001)} is VALID [2022-04-28 02:48:28,999 INFO L290 TraceCheckUtils]: 13: Hoare triple {15298#(< main_~i~0 1000)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15291#(< main_~i~0 1001)} is VALID [2022-04-28 02:48:28,999 INFO L290 TraceCheckUtils]: 12: Hoare triple {15298#(< main_~i~0 1000)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15298#(< main_~i~0 1000)} is VALID [2022-04-28 02:48:29,000 INFO L290 TraceCheckUtils]: 11: Hoare triple {15305#(< main_~i~0 999)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15298#(< main_~i~0 1000)} is VALID [2022-04-28 02:48:29,000 INFO L290 TraceCheckUtils]: 10: Hoare triple {15305#(< main_~i~0 999)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15305#(< main_~i~0 999)} is VALID [2022-04-28 02:48:29,001 INFO L290 TraceCheckUtils]: 9: Hoare triple {15312#(< main_~i~0 998)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15305#(< main_~i~0 999)} is VALID [2022-04-28 02:48:29,001 INFO L290 TraceCheckUtils]: 8: Hoare triple {15312#(< main_~i~0 998)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15312#(< main_~i~0 998)} is VALID [2022-04-28 02:48:29,002 INFO L290 TraceCheckUtils]: 7: Hoare triple {15319#(< main_~i~0 997)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15312#(< main_~i~0 998)} is VALID [2022-04-28 02:48:29,002 INFO L290 TraceCheckUtils]: 6: Hoare triple {15319#(< main_~i~0 997)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15319#(< main_~i~0 997)} is VALID [2022-04-28 02:48:29,002 INFO L290 TraceCheckUtils]: 5: Hoare triple {14885#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {15319#(< main_~i~0 997)} is VALID [2022-04-28 02:48:29,003 INFO L272 TraceCheckUtils]: 4: Hoare triple {14885#true} call #t~ret6 := main(); {14885#true} is VALID [2022-04-28 02:48:29,003 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14885#true} {14885#true} #39#return; {14885#true} is VALID [2022-04-28 02:48:29,003 INFO L290 TraceCheckUtils]: 2: Hoare triple {14885#true} assume true; {14885#true} is VALID [2022-04-28 02:48:29,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {14885#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {14885#true} is VALID [2022-04-28 02:48:29,003 INFO L272 TraceCheckUtils]: 0: Hoare triple {14885#true} call ULTIMATE.init(); {14885#true} is VALID [2022-04-28 02:48:29,003 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:48:29,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1856770847] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:48:29,004 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:48:29,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 30] total 60 [2022-04-28 02:48:29,004 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:48:29,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [286691960] [2022-04-28 02:48:29,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [286691960] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:48:29,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:48:29,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-04-28 02:48:29,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842403656] [2022-04-28 02:48:29,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:48:29,005 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.0) internal successors, (62), 30 states have internal predecessors, (62), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-28 02:48:29,005 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:48:29,005 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 31 states, 31 states have (on average 2.0) internal successors, (62), 30 states have internal predecessors, (62), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:29,058 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:48:29,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-28 02:48:29,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:48:29,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-28 02:48:29,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1713, Invalid=1827, Unknown=0, NotChecked=0, Total=3540 [2022-04-28 02:48:29,060 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand has 31 states, 31 states have (on average 2.0) internal successors, (62), 30 states have internal predecessors, (62), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:29,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:48:29,846 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2022-04-28 02:48:29,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-28 02:48:29,846 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.0) internal successors, (62), 30 states have internal predecessors, (62), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-28 02:48:29,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:48:29,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 2.0) internal successors, (62), 30 states have internal predecessors, (62), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:29,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 76 transitions. [2022-04-28 02:48:29,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 2.0) internal successors, (62), 30 states have internal predecessors, (62), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:29,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 76 transitions. [2022-04-28 02:48:29,848 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 76 transitions. [2022-04-28 02:48:29,914 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:48:29,915 INFO L225 Difference]: With dead ends: 76 [2022-04-28 02:48:29,915 INFO L226 Difference]: Without dead ends: 70 [2022-04-28 02:48:29,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=3366, Invalid=4290, Unknown=0, NotChecked=0, Total=7656 [2022-04-28 02:48:29,917 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 64 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:48:29,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 39 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:48:29,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-28 02:48:30,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2022-04-28 02:48:30,137 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:48:30,138 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 69 states, 64 states have (on average 1.015625) internal successors, (65), 64 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:30,138 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 69 states, 64 states have (on average 1.015625) internal successors, (65), 64 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:30,138 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 69 states, 64 states have (on average 1.015625) internal successors, (65), 64 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:30,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:48:30,139 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2022-04-28 02:48:30,139 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2022-04-28 02:48:30,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:48:30,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:48:30,139 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 64 states have (on average 1.015625) internal successors, (65), 64 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 70 states. [2022-04-28 02:48:30,139 INFO L87 Difference]: Start difference. First operand has 69 states, 64 states have (on average 1.015625) internal successors, (65), 64 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 70 states. [2022-04-28 02:48:30,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:48:30,140 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2022-04-28 02:48:30,140 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2022-04-28 02:48:30,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:48:30,141 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:48:30,141 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:48:30,141 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:48:30,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 64 states have (on average 1.015625) internal successors, (65), 64 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:30,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2022-04-28 02:48:30,142 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 66 [2022-04-28 02:48:30,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:48:30,142 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2022-04-28 02:48:30,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.0) internal successors, (62), 30 states have internal predecessors, (62), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:30,142 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 69 transitions. [2022-04-28 02:48:30,223 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:48:30,224 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2022-04-28 02:48:30,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-28 02:48:30,224 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:48:30,224 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:48:30,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-04-28 02:48:30,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-04-28 02:48:30,425 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:48:30,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:48:30,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1631702706, now seen corresponding path program 55 times [2022-04-28 02:48:30,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:48:30,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1412416568] [2022-04-28 02:48:30,427 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:48:30,427 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:48:30,427 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:48:30,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1631702706, now seen corresponding path program 56 times [2022-04-28 02:48:30,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:48:30,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236951611] [2022-04-28 02:48:30,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:48:30,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:48:30,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:48:30,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:48:30,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:48:30,804 INFO L290 TraceCheckUtils]: 0: Hoare triple {15863#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {15829#true} is VALID [2022-04-28 02:48:30,804 INFO L290 TraceCheckUtils]: 1: Hoare triple {15829#true} assume true; {15829#true} is VALID [2022-04-28 02:48:30,804 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15829#true} {15829#true} #39#return; {15829#true} is VALID [2022-04-28 02:48:30,805 INFO L272 TraceCheckUtils]: 0: Hoare triple {15829#true} call ULTIMATE.init(); {15863#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:48:30,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {15863#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {15829#true} is VALID [2022-04-28 02:48:30,805 INFO L290 TraceCheckUtils]: 2: Hoare triple {15829#true} assume true; {15829#true} is VALID [2022-04-28 02:48:30,805 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15829#true} {15829#true} #39#return; {15829#true} is VALID [2022-04-28 02:48:30,805 INFO L272 TraceCheckUtils]: 4: Hoare triple {15829#true} call #t~ret6 := main(); {15829#true} is VALID [2022-04-28 02:48:30,805 INFO L290 TraceCheckUtils]: 5: Hoare triple {15829#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {15834#(= main_~i~0 0)} is VALID [2022-04-28 02:48:30,805 INFO L290 TraceCheckUtils]: 6: Hoare triple {15834#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15834#(= main_~i~0 0)} is VALID [2022-04-28 02:48:30,806 INFO L290 TraceCheckUtils]: 7: Hoare triple {15834#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15835#(<= main_~i~0 1)} is VALID [2022-04-28 02:48:30,806 INFO L290 TraceCheckUtils]: 8: Hoare triple {15835#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15835#(<= main_~i~0 1)} is VALID [2022-04-28 02:48:30,806 INFO L290 TraceCheckUtils]: 9: Hoare triple {15835#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15836#(<= main_~i~0 2)} is VALID [2022-04-28 02:48:30,807 INFO L290 TraceCheckUtils]: 10: Hoare triple {15836#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15836#(<= main_~i~0 2)} is VALID [2022-04-28 02:48:30,807 INFO L290 TraceCheckUtils]: 11: Hoare triple {15836#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15837#(<= main_~i~0 3)} is VALID [2022-04-28 02:48:30,807 INFO L290 TraceCheckUtils]: 12: Hoare triple {15837#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15837#(<= main_~i~0 3)} is VALID [2022-04-28 02:48:30,808 INFO L290 TraceCheckUtils]: 13: Hoare triple {15837#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15838#(<= main_~i~0 4)} is VALID [2022-04-28 02:48:30,808 INFO L290 TraceCheckUtils]: 14: Hoare triple {15838#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15838#(<= main_~i~0 4)} is VALID [2022-04-28 02:48:30,808 INFO L290 TraceCheckUtils]: 15: Hoare triple {15838#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15839#(<= main_~i~0 5)} is VALID [2022-04-28 02:48:30,808 INFO L290 TraceCheckUtils]: 16: Hoare triple {15839#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15839#(<= main_~i~0 5)} is VALID [2022-04-28 02:48:30,809 INFO L290 TraceCheckUtils]: 17: Hoare triple {15839#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15840#(<= main_~i~0 6)} is VALID [2022-04-28 02:48:30,809 INFO L290 TraceCheckUtils]: 18: Hoare triple {15840#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15840#(<= main_~i~0 6)} is VALID [2022-04-28 02:48:30,809 INFO L290 TraceCheckUtils]: 19: Hoare triple {15840#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15841#(<= main_~i~0 7)} is VALID [2022-04-28 02:48:30,810 INFO L290 TraceCheckUtils]: 20: Hoare triple {15841#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15841#(<= main_~i~0 7)} is VALID [2022-04-28 02:48:30,810 INFO L290 TraceCheckUtils]: 21: Hoare triple {15841#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15842#(<= main_~i~0 8)} is VALID [2022-04-28 02:48:30,810 INFO L290 TraceCheckUtils]: 22: Hoare triple {15842#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15842#(<= main_~i~0 8)} is VALID [2022-04-28 02:48:30,811 INFO L290 TraceCheckUtils]: 23: Hoare triple {15842#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15843#(<= main_~i~0 9)} is VALID [2022-04-28 02:48:30,811 INFO L290 TraceCheckUtils]: 24: Hoare triple {15843#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15843#(<= main_~i~0 9)} is VALID [2022-04-28 02:48:30,811 INFO L290 TraceCheckUtils]: 25: Hoare triple {15843#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15844#(<= main_~i~0 10)} is VALID [2022-04-28 02:48:30,812 INFO L290 TraceCheckUtils]: 26: Hoare triple {15844#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15844#(<= main_~i~0 10)} is VALID [2022-04-28 02:48:30,812 INFO L290 TraceCheckUtils]: 27: Hoare triple {15844#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15845#(<= main_~i~0 11)} is VALID [2022-04-28 02:48:30,812 INFO L290 TraceCheckUtils]: 28: Hoare triple {15845#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15845#(<= main_~i~0 11)} is VALID [2022-04-28 02:48:30,813 INFO L290 TraceCheckUtils]: 29: Hoare triple {15845#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15846#(<= main_~i~0 12)} is VALID [2022-04-28 02:48:30,813 INFO L290 TraceCheckUtils]: 30: Hoare triple {15846#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15846#(<= main_~i~0 12)} is VALID [2022-04-28 02:48:30,813 INFO L290 TraceCheckUtils]: 31: Hoare triple {15846#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15847#(<= main_~i~0 13)} is VALID [2022-04-28 02:48:30,813 INFO L290 TraceCheckUtils]: 32: Hoare triple {15847#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15847#(<= main_~i~0 13)} is VALID [2022-04-28 02:48:30,814 INFO L290 TraceCheckUtils]: 33: Hoare triple {15847#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15848#(<= main_~i~0 14)} is VALID [2022-04-28 02:48:30,814 INFO L290 TraceCheckUtils]: 34: Hoare triple {15848#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15848#(<= main_~i~0 14)} is VALID [2022-04-28 02:48:30,814 INFO L290 TraceCheckUtils]: 35: Hoare triple {15848#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15849#(<= main_~i~0 15)} is VALID [2022-04-28 02:48:30,815 INFO L290 TraceCheckUtils]: 36: Hoare triple {15849#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15849#(<= main_~i~0 15)} is VALID [2022-04-28 02:48:30,815 INFO L290 TraceCheckUtils]: 37: Hoare triple {15849#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15850#(<= main_~i~0 16)} is VALID [2022-04-28 02:48:30,815 INFO L290 TraceCheckUtils]: 38: Hoare triple {15850#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15850#(<= main_~i~0 16)} is VALID [2022-04-28 02:48:30,816 INFO L290 TraceCheckUtils]: 39: Hoare triple {15850#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15851#(<= main_~i~0 17)} is VALID [2022-04-28 02:48:30,816 INFO L290 TraceCheckUtils]: 40: Hoare triple {15851#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15851#(<= main_~i~0 17)} is VALID [2022-04-28 02:48:30,816 INFO L290 TraceCheckUtils]: 41: Hoare triple {15851#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15852#(<= main_~i~0 18)} is VALID [2022-04-28 02:48:30,816 INFO L290 TraceCheckUtils]: 42: Hoare triple {15852#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15852#(<= main_~i~0 18)} is VALID [2022-04-28 02:48:30,817 INFO L290 TraceCheckUtils]: 43: Hoare triple {15852#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15853#(<= main_~i~0 19)} is VALID [2022-04-28 02:48:30,817 INFO L290 TraceCheckUtils]: 44: Hoare triple {15853#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15853#(<= main_~i~0 19)} is VALID [2022-04-28 02:48:30,817 INFO L290 TraceCheckUtils]: 45: Hoare triple {15853#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15854#(<= main_~i~0 20)} is VALID [2022-04-28 02:48:30,818 INFO L290 TraceCheckUtils]: 46: Hoare triple {15854#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15854#(<= main_~i~0 20)} is VALID [2022-04-28 02:48:30,818 INFO L290 TraceCheckUtils]: 47: Hoare triple {15854#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15855#(<= main_~i~0 21)} is VALID [2022-04-28 02:48:30,818 INFO L290 TraceCheckUtils]: 48: Hoare triple {15855#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15855#(<= main_~i~0 21)} is VALID [2022-04-28 02:48:30,819 INFO L290 TraceCheckUtils]: 49: Hoare triple {15855#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15856#(<= main_~i~0 22)} is VALID [2022-04-28 02:48:30,819 INFO L290 TraceCheckUtils]: 50: Hoare triple {15856#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15856#(<= main_~i~0 22)} is VALID [2022-04-28 02:48:30,819 INFO L290 TraceCheckUtils]: 51: Hoare triple {15856#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15857#(<= main_~i~0 23)} is VALID [2022-04-28 02:48:30,820 INFO L290 TraceCheckUtils]: 52: Hoare triple {15857#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15857#(<= main_~i~0 23)} is VALID [2022-04-28 02:48:30,820 INFO L290 TraceCheckUtils]: 53: Hoare triple {15857#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15858#(<= main_~i~0 24)} is VALID [2022-04-28 02:48:30,820 INFO L290 TraceCheckUtils]: 54: Hoare triple {15858#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15858#(<= main_~i~0 24)} is VALID [2022-04-28 02:48:30,821 INFO L290 TraceCheckUtils]: 55: Hoare triple {15858#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15859#(<= main_~i~0 25)} is VALID [2022-04-28 02:48:30,821 INFO L290 TraceCheckUtils]: 56: Hoare triple {15859#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15859#(<= main_~i~0 25)} is VALID [2022-04-28 02:48:30,821 INFO L290 TraceCheckUtils]: 57: Hoare triple {15859#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15860#(<= main_~i~0 26)} is VALID [2022-04-28 02:48:30,821 INFO L290 TraceCheckUtils]: 58: Hoare triple {15860#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15860#(<= main_~i~0 26)} is VALID [2022-04-28 02:48:30,822 INFO L290 TraceCheckUtils]: 59: Hoare triple {15860#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15861#(<= main_~i~0 27)} is VALID [2022-04-28 02:48:30,822 INFO L290 TraceCheckUtils]: 60: Hoare triple {15861#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15861#(<= main_~i~0 27)} is VALID [2022-04-28 02:48:30,822 INFO L290 TraceCheckUtils]: 61: Hoare triple {15861#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15862#(<= main_~i~0 28)} is VALID [2022-04-28 02:48:30,823 INFO L290 TraceCheckUtils]: 62: Hoare triple {15862#(<= main_~i~0 28)} assume !(~i~0 < 1024); {15830#false} is VALID [2022-04-28 02:48:30,823 INFO L290 TraceCheckUtils]: 63: Hoare triple {15830#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {15830#false} is VALID [2022-04-28 02:48:30,823 INFO L272 TraceCheckUtils]: 64: Hoare triple {15830#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {15830#false} is VALID [2022-04-28 02:48:30,823 INFO L290 TraceCheckUtils]: 65: Hoare triple {15830#false} ~cond := #in~cond; {15830#false} is VALID [2022-04-28 02:48:30,823 INFO L290 TraceCheckUtils]: 66: Hoare triple {15830#false} assume 0 == ~cond; {15830#false} is VALID [2022-04-28 02:48:30,823 INFO L290 TraceCheckUtils]: 67: Hoare triple {15830#false} assume !false; {15830#false} is VALID [2022-04-28 02:48:30,824 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:48:30,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:48:30,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236951611] [2022-04-28 02:48:30,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236951611] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:48:30,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847299499] [2022-04-28 02:48:30,824 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:48:30,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:48:30,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:48:30,825 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:48:30,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-04-28 02:48:30,945 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:48:30,945 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:48:30,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-28 02:48:30,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:48:30,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:48:31,320 INFO L272 TraceCheckUtils]: 0: Hoare triple {15829#true} call ULTIMATE.init(); {15829#true} is VALID [2022-04-28 02:48:31,320 INFO L290 TraceCheckUtils]: 1: Hoare triple {15829#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {15829#true} is VALID [2022-04-28 02:48:31,320 INFO L290 TraceCheckUtils]: 2: Hoare triple {15829#true} assume true; {15829#true} is VALID [2022-04-28 02:48:31,320 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15829#true} {15829#true} #39#return; {15829#true} is VALID [2022-04-28 02:48:31,320 INFO L272 TraceCheckUtils]: 4: Hoare triple {15829#true} call #t~ret6 := main(); {15829#true} is VALID [2022-04-28 02:48:31,321 INFO L290 TraceCheckUtils]: 5: Hoare triple {15829#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {15882#(<= main_~i~0 0)} is VALID [2022-04-28 02:48:31,321 INFO L290 TraceCheckUtils]: 6: Hoare triple {15882#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15882#(<= main_~i~0 0)} is VALID [2022-04-28 02:48:31,321 INFO L290 TraceCheckUtils]: 7: Hoare triple {15882#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15835#(<= main_~i~0 1)} is VALID [2022-04-28 02:48:31,322 INFO L290 TraceCheckUtils]: 8: Hoare triple {15835#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15835#(<= main_~i~0 1)} is VALID [2022-04-28 02:48:31,322 INFO L290 TraceCheckUtils]: 9: Hoare triple {15835#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15836#(<= main_~i~0 2)} is VALID [2022-04-28 02:48:31,322 INFO L290 TraceCheckUtils]: 10: Hoare triple {15836#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15836#(<= main_~i~0 2)} is VALID [2022-04-28 02:48:31,323 INFO L290 TraceCheckUtils]: 11: Hoare triple {15836#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15837#(<= main_~i~0 3)} is VALID [2022-04-28 02:48:31,323 INFO L290 TraceCheckUtils]: 12: Hoare triple {15837#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15837#(<= main_~i~0 3)} is VALID [2022-04-28 02:48:31,323 INFO L290 TraceCheckUtils]: 13: Hoare triple {15837#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15838#(<= main_~i~0 4)} is VALID [2022-04-28 02:48:31,323 INFO L290 TraceCheckUtils]: 14: Hoare triple {15838#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15838#(<= main_~i~0 4)} is VALID [2022-04-28 02:48:31,324 INFO L290 TraceCheckUtils]: 15: Hoare triple {15838#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15839#(<= main_~i~0 5)} is VALID [2022-04-28 02:48:31,324 INFO L290 TraceCheckUtils]: 16: Hoare triple {15839#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15839#(<= main_~i~0 5)} is VALID [2022-04-28 02:48:31,324 INFO L290 TraceCheckUtils]: 17: Hoare triple {15839#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15840#(<= main_~i~0 6)} is VALID [2022-04-28 02:48:31,325 INFO L290 TraceCheckUtils]: 18: Hoare triple {15840#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15840#(<= main_~i~0 6)} is VALID [2022-04-28 02:48:31,325 INFO L290 TraceCheckUtils]: 19: Hoare triple {15840#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15841#(<= main_~i~0 7)} is VALID [2022-04-28 02:48:31,325 INFO L290 TraceCheckUtils]: 20: Hoare triple {15841#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15841#(<= main_~i~0 7)} is VALID [2022-04-28 02:48:31,326 INFO L290 TraceCheckUtils]: 21: Hoare triple {15841#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15842#(<= main_~i~0 8)} is VALID [2022-04-28 02:48:31,326 INFO L290 TraceCheckUtils]: 22: Hoare triple {15842#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15842#(<= main_~i~0 8)} is VALID [2022-04-28 02:48:31,326 INFO L290 TraceCheckUtils]: 23: Hoare triple {15842#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15843#(<= main_~i~0 9)} is VALID [2022-04-28 02:48:31,327 INFO L290 TraceCheckUtils]: 24: Hoare triple {15843#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15843#(<= main_~i~0 9)} is VALID [2022-04-28 02:48:31,327 INFO L290 TraceCheckUtils]: 25: Hoare triple {15843#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15844#(<= main_~i~0 10)} is VALID [2022-04-28 02:48:31,327 INFO L290 TraceCheckUtils]: 26: Hoare triple {15844#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15844#(<= main_~i~0 10)} is VALID [2022-04-28 02:48:31,328 INFO L290 TraceCheckUtils]: 27: Hoare triple {15844#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15845#(<= main_~i~0 11)} is VALID [2022-04-28 02:48:31,328 INFO L290 TraceCheckUtils]: 28: Hoare triple {15845#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15845#(<= main_~i~0 11)} is VALID [2022-04-28 02:48:31,328 INFO L290 TraceCheckUtils]: 29: Hoare triple {15845#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15846#(<= main_~i~0 12)} is VALID [2022-04-28 02:48:31,328 INFO L290 TraceCheckUtils]: 30: Hoare triple {15846#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15846#(<= main_~i~0 12)} is VALID [2022-04-28 02:48:31,329 INFO L290 TraceCheckUtils]: 31: Hoare triple {15846#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15847#(<= main_~i~0 13)} is VALID [2022-04-28 02:48:31,329 INFO L290 TraceCheckUtils]: 32: Hoare triple {15847#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15847#(<= main_~i~0 13)} is VALID [2022-04-28 02:48:31,329 INFO L290 TraceCheckUtils]: 33: Hoare triple {15847#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15848#(<= main_~i~0 14)} is VALID [2022-04-28 02:48:31,330 INFO L290 TraceCheckUtils]: 34: Hoare triple {15848#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15848#(<= main_~i~0 14)} is VALID [2022-04-28 02:48:31,330 INFO L290 TraceCheckUtils]: 35: Hoare triple {15848#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15849#(<= main_~i~0 15)} is VALID [2022-04-28 02:48:31,330 INFO L290 TraceCheckUtils]: 36: Hoare triple {15849#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15849#(<= main_~i~0 15)} is VALID [2022-04-28 02:48:31,331 INFO L290 TraceCheckUtils]: 37: Hoare triple {15849#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15850#(<= main_~i~0 16)} is VALID [2022-04-28 02:48:31,331 INFO L290 TraceCheckUtils]: 38: Hoare triple {15850#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15850#(<= main_~i~0 16)} is VALID [2022-04-28 02:48:31,331 INFO L290 TraceCheckUtils]: 39: Hoare triple {15850#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15851#(<= main_~i~0 17)} is VALID [2022-04-28 02:48:31,332 INFO L290 TraceCheckUtils]: 40: Hoare triple {15851#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15851#(<= main_~i~0 17)} is VALID [2022-04-28 02:48:31,332 INFO L290 TraceCheckUtils]: 41: Hoare triple {15851#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15852#(<= main_~i~0 18)} is VALID [2022-04-28 02:48:31,332 INFO L290 TraceCheckUtils]: 42: Hoare triple {15852#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15852#(<= main_~i~0 18)} is VALID [2022-04-28 02:48:31,333 INFO L290 TraceCheckUtils]: 43: Hoare triple {15852#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15853#(<= main_~i~0 19)} is VALID [2022-04-28 02:48:31,333 INFO L290 TraceCheckUtils]: 44: Hoare triple {15853#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15853#(<= main_~i~0 19)} is VALID [2022-04-28 02:48:31,333 INFO L290 TraceCheckUtils]: 45: Hoare triple {15853#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15854#(<= main_~i~0 20)} is VALID [2022-04-28 02:48:31,333 INFO L290 TraceCheckUtils]: 46: Hoare triple {15854#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15854#(<= main_~i~0 20)} is VALID [2022-04-28 02:48:31,334 INFO L290 TraceCheckUtils]: 47: Hoare triple {15854#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15855#(<= main_~i~0 21)} is VALID [2022-04-28 02:48:31,334 INFO L290 TraceCheckUtils]: 48: Hoare triple {15855#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15855#(<= main_~i~0 21)} is VALID [2022-04-28 02:48:31,334 INFO L290 TraceCheckUtils]: 49: Hoare triple {15855#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15856#(<= main_~i~0 22)} is VALID [2022-04-28 02:48:31,335 INFO L290 TraceCheckUtils]: 50: Hoare triple {15856#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15856#(<= main_~i~0 22)} is VALID [2022-04-28 02:48:31,335 INFO L290 TraceCheckUtils]: 51: Hoare triple {15856#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15857#(<= main_~i~0 23)} is VALID [2022-04-28 02:48:31,335 INFO L290 TraceCheckUtils]: 52: Hoare triple {15857#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15857#(<= main_~i~0 23)} is VALID [2022-04-28 02:48:31,336 INFO L290 TraceCheckUtils]: 53: Hoare triple {15857#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15858#(<= main_~i~0 24)} is VALID [2022-04-28 02:48:31,336 INFO L290 TraceCheckUtils]: 54: Hoare triple {15858#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15858#(<= main_~i~0 24)} is VALID [2022-04-28 02:48:31,336 INFO L290 TraceCheckUtils]: 55: Hoare triple {15858#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15859#(<= main_~i~0 25)} is VALID [2022-04-28 02:48:31,336 INFO L290 TraceCheckUtils]: 56: Hoare triple {15859#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15859#(<= main_~i~0 25)} is VALID [2022-04-28 02:48:31,337 INFO L290 TraceCheckUtils]: 57: Hoare triple {15859#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15860#(<= main_~i~0 26)} is VALID [2022-04-28 02:48:31,337 INFO L290 TraceCheckUtils]: 58: Hoare triple {15860#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15860#(<= main_~i~0 26)} is VALID [2022-04-28 02:48:31,337 INFO L290 TraceCheckUtils]: 59: Hoare triple {15860#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15861#(<= main_~i~0 27)} is VALID [2022-04-28 02:48:31,338 INFO L290 TraceCheckUtils]: 60: Hoare triple {15861#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15861#(<= main_~i~0 27)} is VALID [2022-04-28 02:48:31,338 INFO L290 TraceCheckUtils]: 61: Hoare triple {15861#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15862#(<= main_~i~0 28)} is VALID [2022-04-28 02:48:31,338 INFO L290 TraceCheckUtils]: 62: Hoare triple {15862#(<= main_~i~0 28)} assume !(~i~0 < 1024); {15830#false} is VALID [2022-04-28 02:48:31,338 INFO L290 TraceCheckUtils]: 63: Hoare triple {15830#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {15830#false} is VALID [2022-04-28 02:48:31,339 INFO L272 TraceCheckUtils]: 64: Hoare triple {15830#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {15830#false} is VALID [2022-04-28 02:48:31,339 INFO L290 TraceCheckUtils]: 65: Hoare triple {15830#false} ~cond := #in~cond; {15830#false} is VALID [2022-04-28 02:48:31,339 INFO L290 TraceCheckUtils]: 66: Hoare triple {15830#false} assume 0 == ~cond; {15830#false} is VALID [2022-04-28 02:48:31,339 INFO L290 TraceCheckUtils]: 67: Hoare triple {15830#false} assume !false; {15830#false} is VALID [2022-04-28 02:48:31,339 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:48:31,339 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:48:32,518 INFO L290 TraceCheckUtils]: 67: Hoare triple {15830#false} assume !false; {15830#false} is VALID [2022-04-28 02:48:32,518 INFO L290 TraceCheckUtils]: 66: Hoare triple {15830#false} assume 0 == ~cond; {15830#false} is VALID [2022-04-28 02:48:32,518 INFO L290 TraceCheckUtils]: 65: Hoare triple {15830#false} ~cond := #in~cond; {15830#false} is VALID [2022-04-28 02:48:32,518 INFO L272 TraceCheckUtils]: 64: Hoare triple {15830#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {15830#false} is VALID [2022-04-28 02:48:32,518 INFO L290 TraceCheckUtils]: 63: Hoare triple {15830#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {15830#false} is VALID [2022-04-28 02:48:32,518 INFO L290 TraceCheckUtils]: 62: Hoare triple {16084#(< main_~i~0 1024)} assume !(~i~0 < 1024); {15830#false} is VALID [2022-04-28 02:48:32,519 INFO L290 TraceCheckUtils]: 61: Hoare triple {16088#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16084#(< main_~i~0 1024)} is VALID [2022-04-28 02:48:32,519 INFO L290 TraceCheckUtils]: 60: Hoare triple {16088#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16088#(< main_~i~0 1023)} is VALID [2022-04-28 02:48:32,519 INFO L290 TraceCheckUtils]: 59: Hoare triple {16095#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16088#(< main_~i~0 1023)} is VALID [2022-04-28 02:48:32,520 INFO L290 TraceCheckUtils]: 58: Hoare triple {16095#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16095#(< main_~i~0 1022)} is VALID [2022-04-28 02:48:32,520 INFO L290 TraceCheckUtils]: 57: Hoare triple {16102#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16095#(< main_~i~0 1022)} is VALID [2022-04-28 02:48:32,523 INFO L290 TraceCheckUtils]: 56: Hoare triple {16102#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16102#(< main_~i~0 1021)} is VALID [2022-04-28 02:48:32,524 INFO L290 TraceCheckUtils]: 55: Hoare triple {16109#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16102#(< main_~i~0 1021)} is VALID [2022-04-28 02:48:32,524 INFO L290 TraceCheckUtils]: 54: Hoare triple {16109#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16109#(< main_~i~0 1020)} is VALID [2022-04-28 02:48:32,524 INFO L290 TraceCheckUtils]: 53: Hoare triple {16116#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16109#(< main_~i~0 1020)} is VALID [2022-04-28 02:48:32,525 INFO L290 TraceCheckUtils]: 52: Hoare triple {16116#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16116#(< main_~i~0 1019)} is VALID [2022-04-28 02:48:32,525 INFO L290 TraceCheckUtils]: 51: Hoare triple {16123#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16116#(< main_~i~0 1019)} is VALID [2022-04-28 02:48:32,526 INFO L290 TraceCheckUtils]: 50: Hoare triple {16123#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16123#(< main_~i~0 1018)} is VALID [2022-04-28 02:48:32,526 INFO L290 TraceCheckUtils]: 49: Hoare triple {16130#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16123#(< main_~i~0 1018)} is VALID [2022-04-28 02:48:32,526 INFO L290 TraceCheckUtils]: 48: Hoare triple {16130#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16130#(< main_~i~0 1017)} is VALID [2022-04-28 02:48:32,527 INFO L290 TraceCheckUtils]: 47: Hoare triple {16137#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16130#(< main_~i~0 1017)} is VALID [2022-04-28 02:48:32,527 INFO L290 TraceCheckUtils]: 46: Hoare triple {16137#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16137#(< main_~i~0 1016)} is VALID [2022-04-28 02:48:32,528 INFO L290 TraceCheckUtils]: 45: Hoare triple {16144#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16137#(< main_~i~0 1016)} is VALID [2022-04-28 02:48:32,528 INFO L290 TraceCheckUtils]: 44: Hoare triple {16144#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16144#(< main_~i~0 1015)} is VALID [2022-04-28 02:48:32,528 INFO L290 TraceCheckUtils]: 43: Hoare triple {16151#(< main_~i~0 1014)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16144#(< main_~i~0 1015)} is VALID [2022-04-28 02:48:32,529 INFO L290 TraceCheckUtils]: 42: Hoare triple {16151#(< main_~i~0 1014)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16151#(< main_~i~0 1014)} is VALID [2022-04-28 02:48:32,529 INFO L290 TraceCheckUtils]: 41: Hoare triple {16158#(< main_~i~0 1013)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16151#(< main_~i~0 1014)} is VALID [2022-04-28 02:48:32,530 INFO L290 TraceCheckUtils]: 40: Hoare triple {16158#(< main_~i~0 1013)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16158#(< main_~i~0 1013)} is VALID [2022-04-28 02:48:32,530 INFO L290 TraceCheckUtils]: 39: Hoare triple {16165#(< main_~i~0 1012)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16158#(< main_~i~0 1013)} is VALID [2022-04-28 02:48:32,530 INFO L290 TraceCheckUtils]: 38: Hoare triple {16165#(< main_~i~0 1012)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16165#(< main_~i~0 1012)} is VALID [2022-04-28 02:48:32,531 INFO L290 TraceCheckUtils]: 37: Hoare triple {16172#(< main_~i~0 1011)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16165#(< main_~i~0 1012)} is VALID [2022-04-28 02:48:32,531 INFO L290 TraceCheckUtils]: 36: Hoare triple {16172#(< main_~i~0 1011)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16172#(< main_~i~0 1011)} is VALID [2022-04-28 02:48:32,532 INFO L290 TraceCheckUtils]: 35: Hoare triple {16179#(< main_~i~0 1010)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16172#(< main_~i~0 1011)} is VALID [2022-04-28 02:48:32,532 INFO L290 TraceCheckUtils]: 34: Hoare triple {16179#(< main_~i~0 1010)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16179#(< main_~i~0 1010)} is VALID [2022-04-28 02:48:32,533 INFO L290 TraceCheckUtils]: 33: Hoare triple {16186#(< main_~i~0 1009)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16179#(< main_~i~0 1010)} is VALID [2022-04-28 02:48:32,533 INFO L290 TraceCheckUtils]: 32: Hoare triple {16186#(< main_~i~0 1009)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16186#(< main_~i~0 1009)} is VALID [2022-04-28 02:48:32,533 INFO L290 TraceCheckUtils]: 31: Hoare triple {16193#(< main_~i~0 1008)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16186#(< main_~i~0 1009)} is VALID [2022-04-28 02:48:32,534 INFO L290 TraceCheckUtils]: 30: Hoare triple {16193#(< main_~i~0 1008)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16193#(< main_~i~0 1008)} is VALID [2022-04-28 02:48:32,534 INFO L290 TraceCheckUtils]: 29: Hoare triple {16200#(< main_~i~0 1007)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16193#(< main_~i~0 1008)} is VALID [2022-04-28 02:48:32,535 INFO L290 TraceCheckUtils]: 28: Hoare triple {16200#(< main_~i~0 1007)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16200#(< main_~i~0 1007)} is VALID [2022-04-28 02:48:32,535 INFO L290 TraceCheckUtils]: 27: Hoare triple {16207#(< main_~i~0 1006)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16200#(< main_~i~0 1007)} is VALID [2022-04-28 02:48:32,535 INFO L290 TraceCheckUtils]: 26: Hoare triple {16207#(< main_~i~0 1006)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16207#(< main_~i~0 1006)} is VALID [2022-04-28 02:48:32,536 INFO L290 TraceCheckUtils]: 25: Hoare triple {16214#(< main_~i~0 1005)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16207#(< main_~i~0 1006)} is VALID [2022-04-28 02:48:32,536 INFO L290 TraceCheckUtils]: 24: Hoare triple {16214#(< main_~i~0 1005)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16214#(< main_~i~0 1005)} is VALID [2022-04-28 02:48:32,536 INFO L290 TraceCheckUtils]: 23: Hoare triple {16221#(< main_~i~0 1004)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16214#(< main_~i~0 1005)} is VALID [2022-04-28 02:48:32,537 INFO L290 TraceCheckUtils]: 22: Hoare triple {16221#(< main_~i~0 1004)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16221#(< main_~i~0 1004)} is VALID [2022-04-28 02:48:32,537 INFO L290 TraceCheckUtils]: 21: Hoare triple {16228#(< main_~i~0 1003)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16221#(< main_~i~0 1004)} is VALID [2022-04-28 02:48:32,537 INFO L290 TraceCheckUtils]: 20: Hoare triple {16228#(< main_~i~0 1003)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16228#(< main_~i~0 1003)} is VALID [2022-04-28 02:48:32,538 INFO L290 TraceCheckUtils]: 19: Hoare triple {16235#(< main_~i~0 1002)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16228#(< main_~i~0 1003)} is VALID [2022-04-28 02:48:32,538 INFO L290 TraceCheckUtils]: 18: Hoare triple {16235#(< main_~i~0 1002)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16235#(< main_~i~0 1002)} is VALID [2022-04-28 02:48:32,538 INFO L290 TraceCheckUtils]: 17: Hoare triple {16242#(< main_~i~0 1001)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16235#(< main_~i~0 1002)} is VALID [2022-04-28 02:48:32,539 INFO L290 TraceCheckUtils]: 16: Hoare triple {16242#(< main_~i~0 1001)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16242#(< main_~i~0 1001)} is VALID [2022-04-28 02:48:32,539 INFO L290 TraceCheckUtils]: 15: Hoare triple {16249#(< main_~i~0 1000)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16242#(< main_~i~0 1001)} is VALID [2022-04-28 02:48:32,539 INFO L290 TraceCheckUtils]: 14: Hoare triple {16249#(< main_~i~0 1000)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16249#(< main_~i~0 1000)} is VALID [2022-04-28 02:48:32,540 INFO L290 TraceCheckUtils]: 13: Hoare triple {16256#(< main_~i~0 999)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16249#(< main_~i~0 1000)} is VALID [2022-04-28 02:48:32,540 INFO L290 TraceCheckUtils]: 12: Hoare triple {16256#(< main_~i~0 999)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16256#(< main_~i~0 999)} is VALID [2022-04-28 02:48:32,540 INFO L290 TraceCheckUtils]: 11: Hoare triple {16263#(< main_~i~0 998)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16256#(< main_~i~0 999)} is VALID [2022-04-28 02:48:32,540 INFO L290 TraceCheckUtils]: 10: Hoare triple {16263#(< main_~i~0 998)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16263#(< main_~i~0 998)} is VALID [2022-04-28 02:48:32,541 INFO L290 TraceCheckUtils]: 9: Hoare triple {16270#(< main_~i~0 997)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16263#(< main_~i~0 998)} is VALID [2022-04-28 02:48:32,541 INFO L290 TraceCheckUtils]: 8: Hoare triple {16270#(< main_~i~0 997)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16270#(< main_~i~0 997)} is VALID [2022-04-28 02:48:32,541 INFO L290 TraceCheckUtils]: 7: Hoare triple {16277#(< main_~i~0 996)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16270#(< main_~i~0 997)} is VALID [2022-04-28 02:48:32,542 INFO L290 TraceCheckUtils]: 6: Hoare triple {16277#(< main_~i~0 996)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16277#(< main_~i~0 996)} is VALID [2022-04-28 02:48:32,542 INFO L290 TraceCheckUtils]: 5: Hoare triple {15829#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {16277#(< main_~i~0 996)} is VALID [2022-04-28 02:48:32,542 INFO L272 TraceCheckUtils]: 4: Hoare triple {15829#true} call #t~ret6 := main(); {15829#true} is VALID [2022-04-28 02:48:32,542 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15829#true} {15829#true} #39#return; {15829#true} is VALID [2022-04-28 02:48:32,542 INFO L290 TraceCheckUtils]: 2: Hoare triple {15829#true} assume true; {15829#true} is VALID [2022-04-28 02:48:32,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {15829#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {15829#true} is VALID [2022-04-28 02:48:32,542 INFO L272 TraceCheckUtils]: 0: Hoare triple {15829#true} call ULTIMATE.init(); {15829#true} is VALID [2022-04-28 02:48:32,543 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:48:32,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [847299499] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:48:32,543 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:48:32,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31, 31] total 62 [2022-04-28 02:48:32,543 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:48:32,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1412416568] [2022-04-28 02:48:32,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1412416568] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:48:32,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:48:32,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-28 02:48:32,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050424715] [2022-04-28 02:48:32,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:48:32,544 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.0) internal successors, (64), 31 states have internal predecessors, (64), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2022-04-28 02:48:32,544 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:48:32,544 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 32 states have (on average 2.0) internal successors, (64), 31 states have internal predecessors, (64), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:32,595 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:48:32,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-28 02:48:32,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:48:32,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-28 02:48:32,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1832, Invalid=1950, Unknown=0, NotChecked=0, Total=3782 [2022-04-28 02:48:32,597 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand has 32 states, 32 states have (on average 2.0) internal successors, (64), 31 states have internal predecessors, (64), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:33,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:48:33,391 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2022-04-28 02:48:33,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-28 02:48:33,392 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.0) internal successors, (64), 31 states have internal predecessors, (64), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2022-04-28 02:48:33,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:48:33,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 2.0) internal successors, (64), 31 states have internal predecessors, (64), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:33,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 78 transitions. [2022-04-28 02:48:33,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 2.0) internal successors, (64), 31 states have internal predecessors, (64), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:33,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 78 transitions. [2022-04-28 02:48:33,396 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 78 transitions. [2022-04-28 02:48:33,471 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:48:33,472 INFO L225 Difference]: With dead ends: 78 [2022-04-28 02:48:33,472 INFO L226 Difference]: Without dead ends: 72 [2022-04-28 02:48:33,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 573 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=3602, Invalid=4588, Unknown=0, NotChecked=0, Total=8190 [2022-04-28 02:48:33,474 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 66 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:48:33,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 34 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:48:33,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-04-28 02:48:33,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2022-04-28 02:48:33,663 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:48:33,663 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand has 71 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:33,663 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand has 71 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:33,663 INFO L87 Difference]: Start difference. First operand 72 states. Second operand has 71 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:33,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:48:33,667 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2022-04-28 02:48:33,667 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2022-04-28 02:48:33,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:48:33,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:48:33,668 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 72 states. [2022-04-28 02:48:33,668 INFO L87 Difference]: Start difference. First operand has 71 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 72 states. [2022-04-28 02:48:33,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:48:33,669 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2022-04-28 02:48:33,669 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2022-04-28 02:48:33,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:48:33,669 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:48:33,669 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:48:33,669 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:48:33,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:33,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2022-04-28 02:48:33,670 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 68 [2022-04-28 02:48:33,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:48:33,671 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2022-04-28 02:48:33,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.0) internal successors, (64), 31 states have internal predecessors, (64), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:33,671 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 71 transitions. [2022-04-28 02:48:33,761 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:48:33,762 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2022-04-28 02:48:33,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-04-28 02:48:33,762 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:48:33,762 INFO L195 NwaCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:48:33,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-04-28 02:48:33,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-28 02:48:33,963 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:48:33,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:48:33,963 INFO L85 PathProgramCache]: Analyzing trace with hash -470850124, now seen corresponding path program 57 times [2022-04-28 02:48:33,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:48:33,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1756854225] [2022-04-28 02:48:33,966 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:48:33,966 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:48:33,966 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:48:33,966 INFO L85 PathProgramCache]: Analyzing trace with hash -470850124, now seen corresponding path program 58 times [2022-04-28 02:48:33,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:48:33,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639927042] [2022-04-28 02:48:33,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:48:33,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:48:33,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:48:34,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:48:34,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:48:34,406 INFO L290 TraceCheckUtils]: 0: Hoare triple {16836#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {16801#true} is VALID [2022-04-28 02:48:34,406 INFO L290 TraceCheckUtils]: 1: Hoare triple {16801#true} assume true; {16801#true} is VALID [2022-04-28 02:48:34,407 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16801#true} {16801#true} #39#return; {16801#true} is VALID [2022-04-28 02:48:34,407 INFO L272 TraceCheckUtils]: 0: Hoare triple {16801#true} call ULTIMATE.init(); {16836#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:48:34,407 INFO L290 TraceCheckUtils]: 1: Hoare triple {16836#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {16801#true} is VALID [2022-04-28 02:48:34,407 INFO L290 TraceCheckUtils]: 2: Hoare triple {16801#true} assume true; {16801#true} is VALID [2022-04-28 02:48:34,407 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16801#true} {16801#true} #39#return; {16801#true} is VALID [2022-04-28 02:48:34,407 INFO L272 TraceCheckUtils]: 4: Hoare triple {16801#true} call #t~ret6 := main(); {16801#true} is VALID [2022-04-28 02:48:34,408 INFO L290 TraceCheckUtils]: 5: Hoare triple {16801#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {16806#(= main_~i~0 0)} is VALID [2022-04-28 02:48:34,408 INFO L290 TraceCheckUtils]: 6: Hoare triple {16806#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16806#(= main_~i~0 0)} is VALID [2022-04-28 02:48:34,409 INFO L290 TraceCheckUtils]: 7: Hoare triple {16806#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16807#(<= main_~i~0 1)} is VALID [2022-04-28 02:48:34,409 INFO L290 TraceCheckUtils]: 8: Hoare triple {16807#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16807#(<= main_~i~0 1)} is VALID [2022-04-28 02:48:34,410 INFO L290 TraceCheckUtils]: 9: Hoare triple {16807#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16808#(<= main_~i~0 2)} is VALID [2022-04-28 02:48:34,410 INFO L290 TraceCheckUtils]: 10: Hoare triple {16808#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16808#(<= main_~i~0 2)} is VALID [2022-04-28 02:48:34,410 INFO L290 TraceCheckUtils]: 11: Hoare triple {16808#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16809#(<= main_~i~0 3)} is VALID [2022-04-28 02:48:34,411 INFO L290 TraceCheckUtils]: 12: Hoare triple {16809#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16809#(<= main_~i~0 3)} is VALID [2022-04-28 02:48:34,411 INFO L290 TraceCheckUtils]: 13: Hoare triple {16809#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16810#(<= main_~i~0 4)} is VALID [2022-04-28 02:48:34,411 INFO L290 TraceCheckUtils]: 14: Hoare triple {16810#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16810#(<= main_~i~0 4)} is VALID [2022-04-28 02:48:34,412 INFO L290 TraceCheckUtils]: 15: Hoare triple {16810#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16811#(<= main_~i~0 5)} is VALID [2022-04-28 02:48:34,412 INFO L290 TraceCheckUtils]: 16: Hoare triple {16811#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16811#(<= main_~i~0 5)} is VALID [2022-04-28 02:48:34,413 INFO L290 TraceCheckUtils]: 17: Hoare triple {16811#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16812#(<= main_~i~0 6)} is VALID [2022-04-28 02:48:34,413 INFO L290 TraceCheckUtils]: 18: Hoare triple {16812#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16812#(<= main_~i~0 6)} is VALID [2022-04-28 02:48:34,413 INFO L290 TraceCheckUtils]: 19: Hoare triple {16812#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16813#(<= main_~i~0 7)} is VALID [2022-04-28 02:48:34,414 INFO L290 TraceCheckUtils]: 20: Hoare triple {16813#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16813#(<= main_~i~0 7)} is VALID [2022-04-28 02:48:34,414 INFO L290 TraceCheckUtils]: 21: Hoare triple {16813#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16814#(<= main_~i~0 8)} is VALID [2022-04-28 02:48:34,414 INFO L290 TraceCheckUtils]: 22: Hoare triple {16814#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16814#(<= main_~i~0 8)} is VALID [2022-04-28 02:48:34,415 INFO L290 TraceCheckUtils]: 23: Hoare triple {16814#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16815#(<= main_~i~0 9)} is VALID [2022-04-28 02:48:34,415 INFO L290 TraceCheckUtils]: 24: Hoare triple {16815#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16815#(<= main_~i~0 9)} is VALID [2022-04-28 02:48:34,416 INFO L290 TraceCheckUtils]: 25: Hoare triple {16815#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16816#(<= main_~i~0 10)} is VALID [2022-04-28 02:48:34,416 INFO L290 TraceCheckUtils]: 26: Hoare triple {16816#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16816#(<= main_~i~0 10)} is VALID [2022-04-28 02:48:34,416 INFO L290 TraceCheckUtils]: 27: Hoare triple {16816#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16817#(<= main_~i~0 11)} is VALID [2022-04-28 02:48:34,417 INFO L290 TraceCheckUtils]: 28: Hoare triple {16817#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16817#(<= main_~i~0 11)} is VALID [2022-04-28 02:48:34,417 INFO L290 TraceCheckUtils]: 29: Hoare triple {16817#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16818#(<= main_~i~0 12)} is VALID [2022-04-28 02:48:34,418 INFO L290 TraceCheckUtils]: 30: Hoare triple {16818#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16818#(<= main_~i~0 12)} is VALID [2022-04-28 02:48:34,418 INFO L290 TraceCheckUtils]: 31: Hoare triple {16818#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16819#(<= main_~i~0 13)} is VALID [2022-04-28 02:48:34,418 INFO L290 TraceCheckUtils]: 32: Hoare triple {16819#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16819#(<= main_~i~0 13)} is VALID [2022-04-28 02:48:34,419 INFO L290 TraceCheckUtils]: 33: Hoare triple {16819#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16820#(<= main_~i~0 14)} is VALID [2022-04-28 02:48:34,419 INFO L290 TraceCheckUtils]: 34: Hoare triple {16820#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16820#(<= main_~i~0 14)} is VALID [2022-04-28 02:48:34,420 INFO L290 TraceCheckUtils]: 35: Hoare triple {16820#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16821#(<= main_~i~0 15)} is VALID [2022-04-28 02:48:34,420 INFO L290 TraceCheckUtils]: 36: Hoare triple {16821#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16821#(<= main_~i~0 15)} is VALID [2022-04-28 02:48:34,420 INFO L290 TraceCheckUtils]: 37: Hoare triple {16821#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16822#(<= main_~i~0 16)} is VALID [2022-04-28 02:48:34,421 INFO L290 TraceCheckUtils]: 38: Hoare triple {16822#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16822#(<= main_~i~0 16)} is VALID [2022-04-28 02:48:34,421 INFO L290 TraceCheckUtils]: 39: Hoare triple {16822#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16823#(<= main_~i~0 17)} is VALID [2022-04-28 02:48:34,421 INFO L290 TraceCheckUtils]: 40: Hoare triple {16823#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16823#(<= main_~i~0 17)} is VALID [2022-04-28 02:48:34,422 INFO L290 TraceCheckUtils]: 41: Hoare triple {16823#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16824#(<= main_~i~0 18)} is VALID [2022-04-28 02:48:34,422 INFO L290 TraceCheckUtils]: 42: Hoare triple {16824#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16824#(<= main_~i~0 18)} is VALID [2022-04-28 02:48:34,423 INFO L290 TraceCheckUtils]: 43: Hoare triple {16824#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16825#(<= main_~i~0 19)} is VALID [2022-04-28 02:48:34,423 INFO L290 TraceCheckUtils]: 44: Hoare triple {16825#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16825#(<= main_~i~0 19)} is VALID [2022-04-28 02:48:34,423 INFO L290 TraceCheckUtils]: 45: Hoare triple {16825#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16826#(<= main_~i~0 20)} is VALID [2022-04-28 02:48:34,424 INFO L290 TraceCheckUtils]: 46: Hoare triple {16826#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16826#(<= main_~i~0 20)} is VALID [2022-04-28 02:48:34,424 INFO L290 TraceCheckUtils]: 47: Hoare triple {16826#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16827#(<= main_~i~0 21)} is VALID [2022-04-28 02:48:34,424 INFO L290 TraceCheckUtils]: 48: Hoare triple {16827#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16827#(<= main_~i~0 21)} is VALID [2022-04-28 02:48:34,425 INFO L290 TraceCheckUtils]: 49: Hoare triple {16827#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16828#(<= main_~i~0 22)} is VALID [2022-04-28 02:48:34,425 INFO L290 TraceCheckUtils]: 50: Hoare triple {16828#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16828#(<= main_~i~0 22)} is VALID [2022-04-28 02:48:34,426 INFO L290 TraceCheckUtils]: 51: Hoare triple {16828#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16829#(<= main_~i~0 23)} is VALID [2022-04-28 02:48:34,426 INFO L290 TraceCheckUtils]: 52: Hoare triple {16829#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16829#(<= main_~i~0 23)} is VALID [2022-04-28 02:48:34,426 INFO L290 TraceCheckUtils]: 53: Hoare triple {16829#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16830#(<= main_~i~0 24)} is VALID [2022-04-28 02:48:34,427 INFO L290 TraceCheckUtils]: 54: Hoare triple {16830#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16830#(<= main_~i~0 24)} is VALID [2022-04-28 02:48:34,427 INFO L290 TraceCheckUtils]: 55: Hoare triple {16830#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16831#(<= main_~i~0 25)} is VALID [2022-04-28 02:48:34,428 INFO L290 TraceCheckUtils]: 56: Hoare triple {16831#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16831#(<= main_~i~0 25)} is VALID [2022-04-28 02:48:34,428 INFO L290 TraceCheckUtils]: 57: Hoare triple {16831#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16832#(<= main_~i~0 26)} is VALID [2022-04-28 02:48:34,428 INFO L290 TraceCheckUtils]: 58: Hoare triple {16832#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16832#(<= main_~i~0 26)} is VALID [2022-04-28 02:48:34,429 INFO L290 TraceCheckUtils]: 59: Hoare triple {16832#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16833#(<= main_~i~0 27)} is VALID [2022-04-28 02:48:34,429 INFO L290 TraceCheckUtils]: 60: Hoare triple {16833#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16833#(<= main_~i~0 27)} is VALID [2022-04-28 02:48:34,430 INFO L290 TraceCheckUtils]: 61: Hoare triple {16833#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16834#(<= main_~i~0 28)} is VALID [2022-04-28 02:48:34,430 INFO L290 TraceCheckUtils]: 62: Hoare triple {16834#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16834#(<= main_~i~0 28)} is VALID [2022-04-28 02:48:34,430 INFO L290 TraceCheckUtils]: 63: Hoare triple {16834#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16835#(<= main_~i~0 29)} is VALID [2022-04-28 02:48:34,431 INFO L290 TraceCheckUtils]: 64: Hoare triple {16835#(<= main_~i~0 29)} assume !(~i~0 < 1024); {16802#false} is VALID [2022-04-28 02:48:34,431 INFO L290 TraceCheckUtils]: 65: Hoare triple {16802#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {16802#false} is VALID [2022-04-28 02:48:34,431 INFO L272 TraceCheckUtils]: 66: Hoare triple {16802#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {16802#false} is VALID [2022-04-28 02:48:34,431 INFO L290 TraceCheckUtils]: 67: Hoare triple {16802#false} ~cond := #in~cond; {16802#false} is VALID [2022-04-28 02:48:34,431 INFO L290 TraceCheckUtils]: 68: Hoare triple {16802#false} assume 0 == ~cond; {16802#false} is VALID [2022-04-28 02:48:34,431 INFO L290 TraceCheckUtils]: 69: Hoare triple {16802#false} assume !false; {16802#false} is VALID [2022-04-28 02:48:34,432 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:48:34,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:48:34,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639927042] [2022-04-28 02:48:34,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639927042] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:48:34,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526770641] [2022-04-28 02:48:34,432 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 02:48:34,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:48:34,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:48:34,436 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:48:34,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-04-28 02:48:34,565 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 02:48:34,565 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:48:34,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 02:48:34,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:48:34,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:48:34,957 INFO L272 TraceCheckUtils]: 0: Hoare triple {16801#true} call ULTIMATE.init(); {16801#true} is VALID [2022-04-28 02:48:34,957 INFO L290 TraceCheckUtils]: 1: Hoare triple {16801#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {16801#true} is VALID [2022-04-28 02:48:34,957 INFO L290 TraceCheckUtils]: 2: Hoare triple {16801#true} assume true; {16801#true} is VALID [2022-04-28 02:48:34,958 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16801#true} {16801#true} #39#return; {16801#true} is VALID [2022-04-28 02:48:34,958 INFO L272 TraceCheckUtils]: 4: Hoare triple {16801#true} call #t~ret6 := main(); {16801#true} is VALID [2022-04-28 02:48:34,958 INFO L290 TraceCheckUtils]: 5: Hoare triple {16801#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {16855#(<= main_~i~0 0)} is VALID [2022-04-28 02:48:34,958 INFO L290 TraceCheckUtils]: 6: Hoare triple {16855#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16855#(<= main_~i~0 0)} is VALID [2022-04-28 02:48:34,959 INFO L290 TraceCheckUtils]: 7: Hoare triple {16855#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16807#(<= main_~i~0 1)} is VALID [2022-04-28 02:48:34,959 INFO L290 TraceCheckUtils]: 8: Hoare triple {16807#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16807#(<= main_~i~0 1)} is VALID [2022-04-28 02:48:34,959 INFO L290 TraceCheckUtils]: 9: Hoare triple {16807#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16808#(<= main_~i~0 2)} is VALID [2022-04-28 02:48:34,960 INFO L290 TraceCheckUtils]: 10: Hoare triple {16808#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16808#(<= main_~i~0 2)} is VALID [2022-04-28 02:48:34,960 INFO L290 TraceCheckUtils]: 11: Hoare triple {16808#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16809#(<= main_~i~0 3)} is VALID [2022-04-28 02:48:34,960 INFO L290 TraceCheckUtils]: 12: Hoare triple {16809#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16809#(<= main_~i~0 3)} is VALID [2022-04-28 02:48:34,960 INFO L290 TraceCheckUtils]: 13: Hoare triple {16809#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16810#(<= main_~i~0 4)} is VALID [2022-04-28 02:48:34,961 INFO L290 TraceCheckUtils]: 14: Hoare triple {16810#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16810#(<= main_~i~0 4)} is VALID [2022-04-28 02:48:34,961 INFO L290 TraceCheckUtils]: 15: Hoare triple {16810#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16811#(<= main_~i~0 5)} is VALID [2022-04-28 02:48:34,961 INFO L290 TraceCheckUtils]: 16: Hoare triple {16811#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16811#(<= main_~i~0 5)} is VALID [2022-04-28 02:48:34,962 INFO L290 TraceCheckUtils]: 17: Hoare triple {16811#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16812#(<= main_~i~0 6)} is VALID [2022-04-28 02:48:34,962 INFO L290 TraceCheckUtils]: 18: Hoare triple {16812#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16812#(<= main_~i~0 6)} is VALID [2022-04-28 02:48:34,962 INFO L290 TraceCheckUtils]: 19: Hoare triple {16812#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16813#(<= main_~i~0 7)} is VALID [2022-04-28 02:48:34,963 INFO L290 TraceCheckUtils]: 20: Hoare triple {16813#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16813#(<= main_~i~0 7)} is VALID [2022-04-28 02:48:34,963 INFO L290 TraceCheckUtils]: 21: Hoare triple {16813#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16814#(<= main_~i~0 8)} is VALID [2022-04-28 02:48:34,963 INFO L290 TraceCheckUtils]: 22: Hoare triple {16814#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16814#(<= main_~i~0 8)} is VALID [2022-04-28 02:48:34,964 INFO L290 TraceCheckUtils]: 23: Hoare triple {16814#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16815#(<= main_~i~0 9)} is VALID [2022-04-28 02:48:34,964 INFO L290 TraceCheckUtils]: 24: Hoare triple {16815#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16815#(<= main_~i~0 9)} is VALID [2022-04-28 02:48:34,964 INFO L290 TraceCheckUtils]: 25: Hoare triple {16815#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16816#(<= main_~i~0 10)} is VALID [2022-04-28 02:48:34,964 INFO L290 TraceCheckUtils]: 26: Hoare triple {16816#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16816#(<= main_~i~0 10)} is VALID [2022-04-28 02:48:34,965 INFO L290 TraceCheckUtils]: 27: Hoare triple {16816#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16817#(<= main_~i~0 11)} is VALID [2022-04-28 02:48:34,965 INFO L290 TraceCheckUtils]: 28: Hoare triple {16817#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16817#(<= main_~i~0 11)} is VALID [2022-04-28 02:48:34,965 INFO L290 TraceCheckUtils]: 29: Hoare triple {16817#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16818#(<= main_~i~0 12)} is VALID [2022-04-28 02:48:34,966 INFO L290 TraceCheckUtils]: 30: Hoare triple {16818#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16818#(<= main_~i~0 12)} is VALID [2022-04-28 02:48:34,966 INFO L290 TraceCheckUtils]: 31: Hoare triple {16818#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16819#(<= main_~i~0 13)} is VALID [2022-04-28 02:48:34,966 INFO L290 TraceCheckUtils]: 32: Hoare triple {16819#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16819#(<= main_~i~0 13)} is VALID [2022-04-28 02:48:34,967 INFO L290 TraceCheckUtils]: 33: Hoare triple {16819#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16820#(<= main_~i~0 14)} is VALID [2022-04-28 02:48:34,967 INFO L290 TraceCheckUtils]: 34: Hoare triple {16820#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16820#(<= main_~i~0 14)} is VALID [2022-04-28 02:48:34,967 INFO L290 TraceCheckUtils]: 35: Hoare triple {16820#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16821#(<= main_~i~0 15)} is VALID [2022-04-28 02:48:34,968 INFO L290 TraceCheckUtils]: 36: Hoare triple {16821#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16821#(<= main_~i~0 15)} is VALID [2022-04-28 02:48:34,968 INFO L290 TraceCheckUtils]: 37: Hoare triple {16821#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16822#(<= main_~i~0 16)} is VALID [2022-04-28 02:48:34,968 INFO L290 TraceCheckUtils]: 38: Hoare triple {16822#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16822#(<= main_~i~0 16)} is VALID [2022-04-28 02:48:34,968 INFO L290 TraceCheckUtils]: 39: Hoare triple {16822#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16823#(<= main_~i~0 17)} is VALID [2022-04-28 02:48:34,969 INFO L290 TraceCheckUtils]: 40: Hoare triple {16823#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16823#(<= main_~i~0 17)} is VALID [2022-04-28 02:48:34,969 INFO L290 TraceCheckUtils]: 41: Hoare triple {16823#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16824#(<= main_~i~0 18)} is VALID [2022-04-28 02:48:34,969 INFO L290 TraceCheckUtils]: 42: Hoare triple {16824#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16824#(<= main_~i~0 18)} is VALID [2022-04-28 02:48:34,970 INFO L290 TraceCheckUtils]: 43: Hoare triple {16824#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16825#(<= main_~i~0 19)} is VALID [2022-04-28 02:48:34,970 INFO L290 TraceCheckUtils]: 44: Hoare triple {16825#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16825#(<= main_~i~0 19)} is VALID [2022-04-28 02:48:34,970 INFO L290 TraceCheckUtils]: 45: Hoare triple {16825#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16826#(<= main_~i~0 20)} is VALID [2022-04-28 02:48:34,971 INFO L290 TraceCheckUtils]: 46: Hoare triple {16826#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16826#(<= main_~i~0 20)} is VALID [2022-04-28 02:48:34,971 INFO L290 TraceCheckUtils]: 47: Hoare triple {16826#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16827#(<= main_~i~0 21)} is VALID [2022-04-28 02:48:34,971 INFO L290 TraceCheckUtils]: 48: Hoare triple {16827#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16827#(<= main_~i~0 21)} is VALID [2022-04-28 02:48:34,972 INFO L290 TraceCheckUtils]: 49: Hoare triple {16827#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16828#(<= main_~i~0 22)} is VALID [2022-04-28 02:48:34,972 INFO L290 TraceCheckUtils]: 50: Hoare triple {16828#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16828#(<= main_~i~0 22)} is VALID [2022-04-28 02:48:34,972 INFO L290 TraceCheckUtils]: 51: Hoare triple {16828#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16829#(<= main_~i~0 23)} is VALID [2022-04-28 02:48:34,972 INFO L290 TraceCheckUtils]: 52: Hoare triple {16829#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16829#(<= main_~i~0 23)} is VALID [2022-04-28 02:48:34,973 INFO L290 TraceCheckUtils]: 53: Hoare triple {16829#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16830#(<= main_~i~0 24)} is VALID [2022-04-28 02:48:34,973 INFO L290 TraceCheckUtils]: 54: Hoare triple {16830#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16830#(<= main_~i~0 24)} is VALID [2022-04-28 02:48:34,973 INFO L290 TraceCheckUtils]: 55: Hoare triple {16830#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16831#(<= main_~i~0 25)} is VALID [2022-04-28 02:48:34,974 INFO L290 TraceCheckUtils]: 56: Hoare triple {16831#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16831#(<= main_~i~0 25)} is VALID [2022-04-28 02:48:34,974 INFO L290 TraceCheckUtils]: 57: Hoare triple {16831#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16832#(<= main_~i~0 26)} is VALID [2022-04-28 02:48:34,974 INFO L290 TraceCheckUtils]: 58: Hoare triple {16832#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16832#(<= main_~i~0 26)} is VALID [2022-04-28 02:48:34,975 INFO L290 TraceCheckUtils]: 59: Hoare triple {16832#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16833#(<= main_~i~0 27)} is VALID [2022-04-28 02:48:34,975 INFO L290 TraceCheckUtils]: 60: Hoare triple {16833#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16833#(<= main_~i~0 27)} is VALID [2022-04-28 02:48:34,975 INFO L290 TraceCheckUtils]: 61: Hoare triple {16833#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16834#(<= main_~i~0 28)} is VALID [2022-04-28 02:48:34,976 INFO L290 TraceCheckUtils]: 62: Hoare triple {16834#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16834#(<= main_~i~0 28)} is VALID [2022-04-28 02:48:34,976 INFO L290 TraceCheckUtils]: 63: Hoare triple {16834#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16835#(<= main_~i~0 29)} is VALID [2022-04-28 02:48:34,976 INFO L290 TraceCheckUtils]: 64: Hoare triple {16835#(<= main_~i~0 29)} assume !(~i~0 < 1024); {16802#false} is VALID [2022-04-28 02:48:34,976 INFO L290 TraceCheckUtils]: 65: Hoare triple {16802#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {16802#false} is VALID [2022-04-28 02:48:34,976 INFO L272 TraceCheckUtils]: 66: Hoare triple {16802#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {16802#false} is VALID [2022-04-28 02:48:34,976 INFO L290 TraceCheckUtils]: 67: Hoare triple {16802#false} ~cond := #in~cond; {16802#false} is VALID [2022-04-28 02:48:34,976 INFO L290 TraceCheckUtils]: 68: Hoare triple {16802#false} assume 0 == ~cond; {16802#false} is VALID [2022-04-28 02:48:34,977 INFO L290 TraceCheckUtils]: 69: Hoare triple {16802#false} assume !false; {16802#false} is VALID [2022-04-28 02:48:34,977 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:48:34,977 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:48:36,207 INFO L290 TraceCheckUtils]: 69: Hoare triple {16802#false} assume !false; {16802#false} is VALID [2022-04-28 02:48:36,207 INFO L290 TraceCheckUtils]: 68: Hoare triple {16802#false} assume 0 == ~cond; {16802#false} is VALID [2022-04-28 02:48:36,207 INFO L290 TraceCheckUtils]: 67: Hoare triple {16802#false} ~cond := #in~cond; {16802#false} is VALID [2022-04-28 02:48:36,207 INFO L272 TraceCheckUtils]: 66: Hoare triple {16802#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {16802#false} is VALID [2022-04-28 02:48:36,207 INFO L290 TraceCheckUtils]: 65: Hoare triple {16802#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {16802#false} is VALID [2022-04-28 02:48:36,207 INFO L290 TraceCheckUtils]: 64: Hoare triple {17063#(< main_~i~0 1024)} assume !(~i~0 < 1024); {16802#false} is VALID [2022-04-28 02:48:36,208 INFO L290 TraceCheckUtils]: 63: Hoare triple {17067#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17063#(< main_~i~0 1024)} is VALID [2022-04-28 02:48:36,208 INFO L290 TraceCheckUtils]: 62: Hoare triple {17067#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17067#(< main_~i~0 1023)} is VALID [2022-04-28 02:48:36,208 INFO L290 TraceCheckUtils]: 61: Hoare triple {17074#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17067#(< main_~i~0 1023)} is VALID [2022-04-28 02:48:36,208 INFO L290 TraceCheckUtils]: 60: Hoare triple {17074#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17074#(< main_~i~0 1022)} is VALID [2022-04-28 02:48:36,209 INFO L290 TraceCheckUtils]: 59: Hoare triple {17081#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17074#(< main_~i~0 1022)} is VALID [2022-04-28 02:48:36,209 INFO L290 TraceCheckUtils]: 58: Hoare triple {17081#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17081#(< main_~i~0 1021)} is VALID [2022-04-28 02:48:36,209 INFO L290 TraceCheckUtils]: 57: Hoare triple {17088#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17081#(< main_~i~0 1021)} is VALID [2022-04-28 02:48:36,210 INFO L290 TraceCheckUtils]: 56: Hoare triple {17088#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17088#(< main_~i~0 1020)} is VALID [2022-04-28 02:48:36,210 INFO L290 TraceCheckUtils]: 55: Hoare triple {17095#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17088#(< main_~i~0 1020)} is VALID [2022-04-28 02:48:36,210 INFO L290 TraceCheckUtils]: 54: Hoare triple {17095#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17095#(< main_~i~0 1019)} is VALID [2022-04-28 02:48:36,211 INFO L290 TraceCheckUtils]: 53: Hoare triple {17102#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17095#(< main_~i~0 1019)} is VALID [2022-04-28 02:48:36,211 INFO L290 TraceCheckUtils]: 52: Hoare triple {17102#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17102#(< main_~i~0 1018)} is VALID [2022-04-28 02:48:36,211 INFO L290 TraceCheckUtils]: 51: Hoare triple {17109#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17102#(< main_~i~0 1018)} is VALID [2022-04-28 02:48:36,212 INFO L290 TraceCheckUtils]: 50: Hoare triple {17109#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17109#(< main_~i~0 1017)} is VALID [2022-04-28 02:48:36,212 INFO L290 TraceCheckUtils]: 49: Hoare triple {17116#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17109#(< main_~i~0 1017)} is VALID [2022-04-28 02:48:36,213 INFO L290 TraceCheckUtils]: 48: Hoare triple {17116#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17116#(< main_~i~0 1016)} is VALID [2022-04-28 02:48:36,214 INFO L290 TraceCheckUtils]: 47: Hoare triple {17123#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17116#(< main_~i~0 1016)} is VALID [2022-04-28 02:48:36,214 INFO L290 TraceCheckUtils]: 46: Hoare triple {17123#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17123#(< main_~i~0 1015)} is VALID [2022-04-28 02:48:36,214 INFO L290 TraceCheckUtils]: 45: Hoare triple {17130#(< main_~i~0 1014)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17123#(< main_~i~0 1015)} is VALID [2022-04-28 02:48:36,214 INFO L290 TraceCheckUtils]: 44: Hoare triple {17130#(< main_~i~0 1014)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17130#(< main_~i~0 1014)} is VALID [2022-04-28 02:48:36,215 INFO L290 TraceCheckUtils]: 43: Hoare triple {17137#(< main_~i~0 1013)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17130#(< main_~i~0 1014)} is VALID [2022-04-28 02:48:36,215 INFO L290 TraceCheckUtils]: 42: Hoare triple {17137#(< main_~i~0 1013)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17137#(< main_~i~0 1013)} is VALID [2022-04-28 02:48:36,215 INFO L290 TraceCheckUtils]: 41: Hoare triple {17144#(< main_~i~0 1012)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17137#(< main_~i~0 1013)} is VALID [2022-04-28 02:48:36,216 INFO L290 TraceCheckUtils]: 40: Hoare triple {17144#(< main_~i~0 1012)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17144#(< main_~i~0 1012)} is VALID [2022-04-28 02:48:36,216 INFO L290 TraceCheckUtils]: 39: Hoare triple {17151#(< main_~i~0 1011)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17144#(< main_~i~0 1012)} is VALID [2022-04-28 02:48:36,216 INFO L290 TraceCheckUtils]: 38: Hoare triple {17151#(< main_~i~0 1011)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17151#(< main_~i~0 1011)} is VALID [2022-04-28 02:48:36,217 INFO L290 TraceCheckUtils]: 37: Hoare triple {17158#(< main_~i~0 1010)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17151#(< main_~i~0 1011)} is VALID [2022-04-28 02:48:36,217 INFO L290 TraceCheckUtils]: 36: Hoare triple {17158#(< main_~i~0 1010)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17158#(< main_~i~0 1010)} is VALID [2022-04-28 02:48:36,217 INFO L290 TraceCheckUtils]: 35: Hoare triple {17165#(< main_~i~0 1009)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17158#(< main_~i~0 1010)} is VALID [2022-04-28 02:48:36,218 INFO L290 TraceCheckUtils]: 34: Hoare triple {17165#(< main_~i~0 1009)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17165#(< main_~i~0 1009)} is VALID [2022-04-28 02:48:36,218 INFO L290 TraceCheckUtils]: 33: Hoare triple {17172#(< main_~i~0 1008)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17165#(< main_~i~0 1009)} is VALID [2022-04-28 02:48:36,218 INFO L290 TraceCheckUtils]: 32: Hoare triple {17172#(< main_~i~0 1008)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17172#(< main_~i~0 1008)} is VALID [2022-04-28 02:48:36,218 INFO L290 TraceCheckUtils]: 31: Hoare triple {17179#(< main_~i~0 1007)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17172#(< main_~i~0 1008)} is VALID [2022-04-28 02:48:36,219 INFO L290 TraceCheckUtils]: 30: Hoare triple {17179#(< main_~i~0 1007)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17179#(< main_~i~0 1007)} is VALID [2022-04-28 02:48:36,219 INFO L290 TraceCheckUtils]: 29: Hoare triple {17186#(< main_~i~0 1006)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17179#(< main_~i~0 1007)} is VALID [2022-04-28 02:48:36,219 INFO L290 TraceCheckUtils]: 28: Hoare triple {17186#(< main_~i~0 1006)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17186#(< main_~i~0 1006)} is VALID [2022-04-28 02:48:36,220 INFO L290 TraceCheckUtils]: 27: Hoare triple {17193#(< main_~i~0 1005)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17186#(< main_~i~0 1006)} is VALID [2022-04-28 02:48:36,220 INFO L290 TraceCheckUtils]: 26: Hoare triple {17193#(< main_~i~0 1005)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17193#(< main_~i~0 1005)} is VALID [2022-04-28 02:48:36,220 INFO L290 TraceCheckUtils]: 25: Hoare triple {17200#(< main_~i~0 1004)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17193#(< main_~i~0 1005)} is VALID [2022-04-28 02:48:36,221 INFO L290 TraceCheckUtils]: 24: Hoare triple {17200#(< main_~i~0 1004)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17200#(< main_~i~0 1004)} is VALID [2022-04-28 02:48:36,221 INFO L290 TraceCheckUtils]: 23: Hoare triple {17207#(< main_~i~0 1003)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17200#(< main_~i~0 1004)} is VALID [2022-04-28 02:48:36,221 INFO L290 TraceCheckUtils]: 22: Hoare triple {17207#(< main_~i~0 1003)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17207#(< main_~i~0 1003)} is VALID [2022-04-28 02:48:36,222 INFO L290 TraceCheckUtils]: 21: Hoare triple {17214#(< main_~i~0 1002)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17207#(< main_~i~0 1003)} is VALID [2022-04-28 02:48:36,222 INFO L290 TraceCheckUtils]: 20: Hoare triple {17214#(< main_~i~0 1002)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17214#(< main_~i~0 1002)} is VALID [2022-04-28 02:48:36,222 INFO L290 TraceCheckUtils]: 19: Hoare triple {17221#(< main_~i~0 1001)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17214#(< main_~i~0 1002)} is VALID [2022-04-28 02:48:36,222 INFO L290 TraceCheckUtils]: 18: Hoare triple {17221#(< main_~i~0 1001)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17221#(< main_~i~0 1001)} is VALID [2022-04-28 02:48:36,223 INFO L290 TraceCheckUtils]: 17: Hoare triple {17228#(< main_~i~0 1000)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17221#(< main_~i~0 1001)} is VALID [2022-04-28 02:48:36,223 INFO L290 TraceCheckUtils]: 16: Hoare triple {17228#(< main_~i~0 1000)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17228#(< main_~i~0 1000)} is VALID [2022-04-28 02:48:36,223 INFO L290 TraceCheckUtils]: 15: Hoare triple {17235#(< main_~i~0 999)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17228#(< main_~i~0 1000)} is VALID [2022-04-28 02:48:36,224 INFO L290 TraceCheckUtils]: 14: Hoare triple {17235#(< main_~i~0 999)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17235#(< main_~i~0 999)} is VALID [2022-04-28 02:48:36,224 INFO L290 TraceCheckUtils]: 13: Hoare triple {17242#(< main_~i~0 998)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17235#(< main_~i~0 999)} is VALID [2022-04-28 02:48:36,224 INFO L290 TraceCheckUtils]: 12: Hoare triple {17242#(< main_~i~0 998)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17242#(< main_~i~0 998)} is VALID [2022-04-28 02:48:36,225 INFO L290 TraceCheckUtils]: 11: Hoare triple {17249#(< main_~i~0 997)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17242#(< main_~i~0 998)} is VALID [2022-04-28 02:48:36,225 INFO L290 TraceCheckUtils]: 10: Hoare triple {17249#(< main_~i~0 997)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17249#(< main_~i~0 997)} is VALID [2022-04-28 02:48:36,225 INFO L290 TraceCheckUtils]: 9: Hoare triple {17256#(< main_~i~0 996)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17249#(< main_~i~0 997)} is VALID [2022-04-28 02:48:36,226 INFO L290 TraceCheckUtils]: 8: Hoare triple {17256#(< main_~i~0 996)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17256#(< main_~i~0 996)} is VALID [2022-04-28 02:48:36,226 INFO L290 TraceCheckUtils]: 7: Hoare triple {17263#(< main_~i~0 995)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17256#(< main_~i~0 996)} is VALID [2022-04-28 02:48:36,226 INFO L290 TraceCheckUtils]: 6: Hoare triple {17263#(< main_~i~0 995)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17263#(< main_~i~0 995)} is VALID [2022-04-28 02:48:36,227 INFO L290 TraceCheckUtils]: 5: Hoare triple {16801#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {17263#(< main_~i~0 995)} is VALID [2022-04-28 02:48:36,227 INFO L272 TraceCheckUtils]: 4: Hoare triple {16801#true} call #t~ret6 := main(); {16801#true} is VALID [2022-04-28 02:48:36,227 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16801#true} {16801#true} #39#return; {16801#true} is VALID [2022-04-28 02:48:36,227 INFO L290 TraceCheckUtils]: 2: Hoare triple {16801#true} assume true; {16801#true} is VALID [2022-04-28 02:48:36,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {16801#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {16801#true} is VALID [2022-04-28 02:48:36,227 INFO L272 TraceCheckUtils]: 0: Hoare triple {16801#true} call ULTIMATE.init(); {16801#true} is VALID [2022-04-28 02:48:36,227 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:48:36,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [526770641] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:48:36,228 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:48:36,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32, 32] total 64 [2022-04-28 02:48:36,228 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:48:36,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1756854225] [2022-04-28 02:48:36,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1756854225] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:48:36,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:48:36,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-04-28 02:48:36,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72485493] [2022-04-28 02:48:36,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:48:36,228 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.0) internal successors, (66), 32 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 70 [2022-04-28 02:48:36,229 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:48:36,229 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 33 states, 33 states have (on average 2.0) internal successors, (66), 32 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:36,283 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:48:36,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-04-28 02:48:36,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:48:36,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-04-28 02:48:36,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1955, Invalid=2077, Unknown=0, NotChecked=0, Total=4032 [2022-04-28 02:48:36,285 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand has 33 states, 33 states have (on average 2.0) internal successors, (66), 32 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:37,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:48:37,103 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2022-04-28 02:48:37,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-28 02:48:37,103 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.0) internal successors, (66), 32 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 70 [2022-04-28 02:48:37,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:48:37,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 2.0) internal successors, (66), 32 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:37,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 80 transitions. [2022-04-28 02:48:37,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 2.0) internal successors, (66), 32 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:37,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 80 transitions. [2022-04-28 02:48:37,120 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 80 transitions. [2022-04-28 02:48:37,194 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:48:37,195 INFO L225 Difference]: With dead ends: 80 [2022-04-28 02:48:37,195 INFO L226 Difference]: Without dead ends: 74 [2022-04-28 02:48:37,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=3846, Invalid=4896, Unknown=0, NotChecked=0, Total=8742 [2022-04-28 02:48:37,197 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 68 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:48:37,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 39 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:48:37,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-28 02:48:37,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2022-04-28 02:48:37,429 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:48:37,430 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 73 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:37,430 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 73 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:37,430 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 73 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:37,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:48:37,431 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2022-04-28 02:48:37,431 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2022-04-28 02:48:37,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:48:37,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:48:37,431 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 74 states. [2022-04-28 02:48:37,432 INFO L87 Difference]: Start difference. First operand has 73 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 74 states. [2022-04-28 02:48:37,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:48:37,432 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2022-04-28 02:48:37,432 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2022-04-28 02:48:37,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:48:37,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:48:37,433 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:48:37,433 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:48:37,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:37,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2022-04-28 02:48:37,434 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 70 [2022-04-28 02:48:37,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:48:37,434 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2022-04-28 02:48:37,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.0) internal successors, (66), 32 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:37,434 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 73 states and 73 transitions. [2022-04-28 02:48:37,525 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:48:37,525 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2022-04-28 02:48:37,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-04-28 02:48:37,526 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:48:37,526 INFO L195 NwaCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:48:37,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-04-28 02:48:37,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:48:37,727 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:48:37,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:48:37,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1905476662, now seen corresponding path program 59 times [2022-04-28 02:48:37,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:48:37,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [400990730] [2022-04-28 02:48:37,729 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:48:37,729 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:48:37,729 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:48:37,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1905476662, now seen corresponding path program 60 times [2022-04-28 02:48:37,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:48:37,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173434] [2022-04-28 02:48:37,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:48:37,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:48:37,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:48:38,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:48:38,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:48:38,160 INFO L290 TraceCheckUtils]: 0: Hoare triple {17837#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {17801#true} is VALID [2022-04-28 02:48:38,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {17801#true} assume true; {17801#true} is VALID [2022-04-28 02:48:38,160 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17801#true} {17801#true} #39#return; {17801#true} is VALID [2022-04-28 02:48:38,161 INFO L272 TraceCheckUtils]: 0: Hoare triple {17801#true} call ULTIMATE.init(); {17837#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:48:38,161 INFO L290 TraceCheckUtils]: 1: Hoare triple {17837#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {17801#true} is VALID [2022-04-28 02:48:38,161 INFO L290 TraceCheckUtils]: 2: Hoare triple {17801#true} assume true; {17801#true} is VALID [2022-04-28 02:48:38,161 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17801#true} {17801#true} #39#return; {17801#true} is VALID [2022-04-28 02:48:38,161 INFO L272 TraceCheckUtils]: 4: Hoare triple {17801#true} call #t~ret6 := main(); {17801#true} is VALID [2022-04-28 02:48:38,162 INFO L290 TraceCheckUtils]: 5: Hoare triple {17801#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {17806#(= main_~i~0 0)} is VALID [2022-04-28 02:48:38,162 INFO L290 TraceCheckUtils]: 6: Hoare triple {17806#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17806#(= main_~i~0 0)} is VALID [2022-04-28 02:48:38,162 INFO L290 TraceCheckUtils]: 7: Hoare triple {17806#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17807#(<= main_~i~0 1)} is VALID [2022-04-28 02:48:38,163 INFO L290 TraceCheckUtils]: 8: Hoare triple {17807#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17807#(<= main_~i~0 1)} is VALID [2022-04-28 02:48:38,163 INFO L290 TraceCheckUtils]: 9: Hoare triple {17807#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17808#(<= main_~i~0 2)} is VALID [2022-04-28 02:48:38,164 INFO L290 TraceCheckUtils]: 10: Hoare triple {17808#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17808#(<= main_~i~0 2)} is VALID [2022-04-28 02:48:38,164 INFO L290 TraceCheckUtils]: 11: Hoare triple {17808#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17809#(<= main_~i~0 3)} is VALID [2022-04-28 02:48:38,164 INFO L290 TraceCheckUtils]: 12: Hoare triple {17809#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17809#(<= main_~i~0 3)} is VALID [2022-04-28 02:48:38,165 INFO L290 TraceCheckUtils]: 13: Hoare triple {17809#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17810#(<= main_~i~0 4)} is VALID [2022-04-28 02:48:38,165 INFO L290 TraceCheckUtils]: 14: Hoare triple {17810#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17810#(<= main_~i~0 4)} is VALID [2022-04-28 02:48:38,166 INFO L290 TraceCheckUtils]: 15: Hoare triple {17810#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17811#(<= main_~i~0 5)} is VALID [2022-04-28 02:48:38,166 INFO L290 TraceCheckUtils]: 16: Hoare triple {17811#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17811#(<= main_~i~0 5)} is VALID [2022-04-28 02:48:38,166 INFO L290 TraceCheckUtils]: 17: Hoare triple {17811#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17812#(<= main_~i~0 6)} is VALID [2022-04-28 02:48:38,167 INFO L290 TraceCheckUtils]: 18: Hoare triple {17812#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17812#(<= main_~i~0 6)} is VALID [2022-04-28 02:48:38,167 INFO L290 TraceCheckUtils]: 19: Hoare triple {17812#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17813#(<= main_~i~0 7)} is VALID [2022-04-28 02:48:38,167 INFO L290 TraceCheckUtils]: 20: Hoare triple {17813#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17813#(<= main_~i~0 7)} is VALID [2022-04-28 02:48:38,168 INFO L290 TraceCheckUtils]: 21: Hoare triple {17813#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17814#(<= main_~i~0 8)} is VALID [2022-04-28 02:48:38,168 INFO L290 TraceCheckUtils]: 22: Hoare triple {17814#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17814#(<= main_~i~0 8)} is VALID [2022-04-28 02:48:38,168 INFO L290 TraceCheckUtils]: 23: Hoare triple {17814#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17815#(<= main_~i~0 9)} is VALID [2022-04-28 02:48:38,169 INFO L290 TraceCheckUtils]: 24: Hoare triple {17815#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17815#(<= main_~i~0 9)} is VALID [2022-04-28 02:48:38,169 INFO L290 TraceCheckUtils]: 25: Hoare triple {17815#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17816#(<= main_~i~0 10)} is VALID [2022-04-28 02:48:38,169 INFO L290 TraceCheckUtils]: 26: Hoare triple {17816#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17816#(<= main_~i~0 10)} is VALID [2022-04-28 02:48:38,170 INFO L290 TraceCheckUtils]: 27: Hoare triple {17816#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17817#(<= main_~i~0 11)} is VALID [2022-04-28 02:48:38,170 INFO L290 TraceCheckUtils]: 28: Hoare triple {17817#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17817#(<= main_~i~0 11)} is VALID [2022-04-28 02:48:38,170 INFO L290 TraceCheckUtils]: 29: Hoare triple {17817#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17818#(<= main_~i~0 12)} is VALID [2022-04-28 02:48:38,170 INFO L290 TraceCheckUtils]: 30: Hoare triple {17818#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17818#(<= main_~i~0 12)} is VALID [2022-04-28 02:48:38,171 INFO L290 TraceCheckUtils]: 31: Hoare triple {17818#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17819#(<= main_~i~0 13)} is VALID [2022-04-28 02:48:38,171 INFO L290 TraceCheckUtils]: 32: Hoare triple {17819#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17819#(<= main_~i~0 13)} is VALID [2022-04-28 02:48:38,171 INFO L290 TraceCheckUtils]: 33: Hoare triple {17819#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17820#(<= main_~i~0 14)} is VALID [2022-04-28 02:48:38,172 INFO L290 TraceCheckUtils]: 34: Hoare triple {17820#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17820#(<= main_~i~0 14)} is VALID [2022-04-28 02:48:38,172 INFO L290 TraceCheckUtils]: 35: Hoare triple {17820#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17821#(<= main_~i~0 15)} is VALID [2022-04-28 02:48:38,172 INFO L290 TraceCheckUtils]: 36: Hoare triple {17821#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17821#(<= main_~i~0 15)} is VALID [2022-04-28 02:48:38,173 INFO L290 TraceCheckUtils]: 37: Hoare triple {17821#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17822#(<= main_~i~0 16)} is VALID [2022-04-28 02:48:38,173 INFO L290 TraceCheckUtils]: 38: Hoare triple {17822#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17822#(<= main_~i~0 16)} is VALID [2022-04-28 02:48:38,173 INFO L290 TraceCheckUtils]: 39: Hoare triple {17822#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17823#(<= main_~i~0 17)} is VALID [2022-04-28 02:48:38,174 INFO L290 TraceCheckUtils]: 40: Hoare triple {17823#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17823#(<= main_~i~0 17)} is VALID [2022-04-28 02:48:38,174 INFO L290 TraceCheckUtils]: 41: Hoare triple {17823#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17824#(<= main_~i~0 18)} is VALID [2022-04-28 02:48:38,174 INFO L290 TraceCheckUtils]: 42: Hoare triple {17824#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17824#(<= main_~i~0 18)} is VALID [2022-04-28 02:48:38,174 INFO L290 TraceCheckUtils]: 43: Hoare triple {17824#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17825#(<= main_~i~0 19)} is VALID [2022-04-28 02:48:38,175 INFO L290 TraceCheckUtils]: 44: Hoare triple {17825#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17825#(<= main_~i~0 19)} is VALID [2022-04-28 02:48:38,175 INFO L290 TraceCheckUtils]: 45: Hoare triple {17825#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17826#(<= main_~i~0 20)} is VALID [2022-04-28 02:48:38,175 INFO L290 TraceCheckUtils]: 46: Hoare triple {17826#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17826#(<= main_~i~0 20)} is VALID [2022-04-28 02:48:38,176 INFO L290 TraceCheckUtils]: 47: Hoare triple {17826#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17827#(<= main_~i~0 21)} is VALID [2022-04-28 02:48:38,176 INFO L290 TraceCheckUtils]: 48: Hoare triple {17827#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17827#(<= main_~i~0 21)} is VALID [2022-04-28 02:48:38,176 INFO L290 TraceCheckUtils]: 49: Hoare triple {17827#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17828#(<= main_~i~0 22)} is VALID [2022-04-28 02:48:38,177 INFO L290 TraceCheckUtils]: 50: Hoare triple {17828#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17828#(<= main_~i~0 22)} is VALID [2022-04-28 02:48:38,177 INFO L290 TraceCheckUtils]: 51: Hoare triple {17828#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17829#(<= main_~i~0 23)} is VALID [2022-04-28 02:48:38,177 INFO L290 TraceCheckUtils]: 52: Hoare triple {17829#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17829#(<= main_~i~0 23)} is VALID [2022-04-28 02:48:38,178 INFO L290 TraceCheckUtils]: 53: Hoare triple {17829#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17830#(<= main_~i~0 24)} is VALID [2022-04-28 02:48:38,178 INFO L290 TraceCheckUtils]: 54: Hoare triple {17830#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17830#(<= main_~i~0 24)} is VALID [2022-04-28 02:48:38,178 INFO L290 TraceCheckUtils]: 55: Hoare triple {17830#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17831#(<= main_~i~0 25)} is VALID [2022-04-28 02:48:38,178 INFO L290 TraceCheckUtils]: 56: Hoare triple {17831#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17831#(<= main_~i~0 25)} is VALID [2022-04-28 02:48:38,179 INFO L290 TraceCheckUtils]: 57: Hoare triple {17831#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17832#(<= main_~i~0 26)} is VALID [2022-04-28 02:48:38,179 INFO L290 TraceCheckUtils]: 58: Hoare triple {17832#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17832#(<= main_~i~0 26)} is VALID [2022-04-28 02:48:38,179 INFO L290 TraceCheckUtils]: 59: Hoare triple {17832#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17833#(<= main_~i~0 27)} is VALID [2022-04-28 02:48:38,180 INFO L290 TraceCheckUtils]: 60: Hoare triple {17833#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17833#(<= main_~i~0 27)} is VALID [2022-04-28 02:48:38,180 INFO L290 TraceCheckUtils]: 61: Hoare triple {17833#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17834#(<= main_~i~0 28)} is VALID [2022-04-28 02:48:38,180 INFO L290 TraceCheckUtils]: 62: Hoare triple {17834#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17834#(<= main_~i~0 28)} is VALID [2022-04-28 02:48:38,181 INFO L290 TraceCheckUtils]: 63: Hoare triple {17834#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17835#(<= main_~i~0 29)} is VALID [2022-04-28 02:48:38,181 INFO L290 TraceCheckUtils]: 64: Hoare triple {17835#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17835#(<= main_~i~0 29)} is VALID [2022-04-28 02:48:38,181 INFO L290 TraceCheckUtils]: 65: Hoare triple {17835#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17836#(<= main_~i~0 30)} is VALID [2022-04-28 02:48:38,182 INFO L290 TraceCheckUtils]: 66: Hoare triple {17836#(<= main_~i~0 30)} assume !(~i~0 < 1024); {17802#false} is VALID [2022-04-28 02:48:38,182 INFO L290 TraceCheckUtils]: 67: Hoare triple {17802#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {17802#false} is VALID [2022-04-28 02:48:38,182 INFO L272 TraceCheckUtils]: 68: Hoare triple {17802#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {17802#false} is VALID [2022-04-28 02:48:38,182 INFO L290 TraceCheckUtils]: 69: Hoare triple {17802#false} ~cond := #in~cond; {17802#false} is VALID [2022-04-28 02:48:38,182 INFO L290 TraceCheckUtils]: 70: Hoare triple {17802#false} assume 0 == ~cond; {17802#false} is VALID [2022-04-28 02:48:38,182 INFO L290 TraceCheckUtils]: 71: Hoare triple {17802#false} assume !false; {17802#false} is VALID [2022-04-28 02:48:38,183 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:48:38,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:48:38,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173434] [2022-04-28 02:48:38,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173434] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:48:38,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203273181] [2022-04-28 02:48:38,183 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 02:48:38,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:48:38,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:48:38,184 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:48:38,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-04-28 02:48:47,214 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2022-04-28 02:48:47,215 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:48:47,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-28 02:48:47,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:48:47,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:48:47,672 INFO L272 TraceCheckUtils]: 0: Hoare triple {17801#true} call ULTIMATE.init(); {17801#true} is VALID [2022-04-28 02:48:47,672 INFO L290 TraceCheckUtils]: 1: Hoare triple {17801#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {17801#true} is VALID [2022-04-28 02:48:47,672 INFO L290 TraceCheckUtils]: 2: Hoare triple {17801#true} assume true; {17801#true} is VALID [2022-04-28 02:48:47,672 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17801#true} {17801#true} #39#return; {17801#true} is VALID [2022-04-28 02:48:47,673 INFO L272 TraceCheckUtils]: 4: Hoare triple {17801#true} call #t~ret6 := main(); {17801#true} is VALID [2022-04-28 02:48:47,673 INFO L290 TraceCheckUtils]: 5: Hoare triple {17801#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {17856#(<= main_~i~0 0)} is VALID [2022-04-28 02:48:47,673 INFO L290 TraceCheckUtils]: 6: Hoare triple {17856#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17856#(<= main_~i~0 0)} is VALID [2022-04-28 02:48:47,674 INFO L290 TraceCheckUtils]: 7: Hoare triple {17856#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17807#(<= main_~i~0 1)} is VALID [2022-04-28 02:48:47,674 INFO L290 TraceCheckUtils]: 8: Hoare triple {17807#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17807#(<= main_~i~0 1)} is VALID [2022-04-28 02:48:47,674 INFO L290 TraceCheckUtils]: 9: Hoare triple {17807#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17808#(<= main_~i~0 2)} is VALID [2022-04-28 02:48:47,674 INFO L290 TraceCheckUtils]: 10: Hoare triple {17808#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17808#(<= main_~i~0 2)} is VALID [2022-04-28 02:48:47,675 INFO L290 TraceCheckUtils]: 11: Hoare triple {17808#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17809#(<= main_~i~0 3)} is VALID [2022-04-28 02:48:47,675 INFO L290 TraceCheckUtils]: 12: Hoare triple {17809#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17809#(<= main_~i~0 3)} is VALID [2022-04-28 02:48:47,675 INFO L290 TraceCheckUtils]: 13: Hoare triple {17809#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17810#(<= main_~i~0 4)} is VALID [2022-04-28 02:48:47,676 INFO L290 TraceCheckUtils]: 14: Hoare triple {17810#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17810#(<= main_~i~0 4)} is VALID [2022-04-28 02:48:47,676 INFO L290 TraceCheckUtils]: 15: Hoare triple {17810#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17811#(<= main_~i~0 5)} is VALID [2022-04-28 02:48:47,676 INFO L290 TraceCheckUtils]: 16: Hoare triple {17811#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17811#(<= main_~i~0 5)} is VALID [2022-04-28 02:48:47,677 INFO L290 TraceCheckUtils]: 17: Hoare triple {17811#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17812#(<= main_~i~0 6)} is VALID [2022-04-28 02:48:47,677 INFO L290 TraceCheckUtils]: 18: Hoare triple {17812#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17812#(<= main_~i~0 6)} is VALID [2022-04-28 02:48:47,677 INFO L290 TraceCheckUtils]: 19: Hoare triple {17812#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17813#(<= main_~i~0 7)} is VALID [2022-04-28 02:48:47,678 INFO L290 TraceCheckUtils]: 20: Hoare triple {17813#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17813#(<= main_~i~0 7)} is VALID [2022-04-28 02:48:47,678 INFO L290 TraceCheckUtils]: 21: Hoare triple {17813#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17814#(<= main_~i~0 8)} is VALID [2022-04-28 02:48:47,678 INFO L290 TraceCheckUtils]: 22: Hoare triple {17814#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17814#(<= main_~i~0 8)} is VALID [2022-04-28 02:48:47,678 INFO L290 TraceCheckUtils]: 23: Hoare triple {17814#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17815#(<= main_~i~0 9)} is VALID [2022-04-28 02:48:47,679 INFO L290 TraceCheckUtils]: 24: Hoare triple {17815#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17815#(<= main_~i~0 9)} is VALID [2022-04-28 02:48:47,679 INFO L290 TraceCheckUtils]: 25: Hoare triple {17815#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17816#(<= main_~i~0 10)} is VALID [2022-04-28 02:48:47,679 INFO L290 TraceCheckUtils]: 26: Hoare triple {17816#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17816#(<= main_~i~0 10)} is VALID [2022-04-28 02:48:47,680 INFO L290 TraceCheckUtils]: 27: Hoare triple {17816#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17817#(<= main_~i~0 11)} is VALID [2022-04-28 02:48:47,680 INFO L290 TraceCheckUtils]: 28: Hoare triple {17817#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17817#(<= main_~i~0 11)} is VALID [2022-04-28 02:48:47,680 INFO L290 TraceCheckUtils]: 29: Hoare triple {17817#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17818#(<= main_~i~0 12)} is VALID [2022-04-28 02:48:47,681 INFO L290 TraceCheckUtils]: 30: Hoare triple {17818#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17818#(<= main_~i~0 12)} is VALID [2022-04-28 02:48:47,681 INFO L290 TraceCheckUtils]: 31: Hoare triple {17818#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17819#(<= main_~i~0 13)} is VALID [2022-04-28 02:48:47,681 INFO L290 TraceCheckUtils]: 32: Hoare triple {17819#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17819#(<= main_~i~0 13)} is VALID [2022-04-28 02:48:47,682 INFO L290 TraceCheckUtils]: 33: Hoare triple {17819#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17820#(<= main_~i~0 14)} is VALID [2022-04-28 02:48:47,682 INFO L290 TraceCheckUtils]: 34: Hoare triple {17820#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17820#(<= main_~i~0 14)} is VALID [2022-04-28 02:48:47,682 INFO L290 TraceCheckUtils]: 35: Hoare triple {17820#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17821#(<= main_~i~0 15)} is VALID [2022-04-28 02:48:47,682 INFO L290 TraceCheckUtils]: 36: Hoare triple {17821#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17821#(<= main_~i~0 15)} is VALID [2022-04-28 02:48:47,683 INFO L290 TraceCheckUtils]: 37: Hoare triple {17821#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17822#(<= main_~i~0 16)} is VALID [2022-04-28 02:48:47,683 INFO L290 TraceCheckUtils]: 38: Hoare triple {17822#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17822#(<= main_~i~0 16)} is VALID [2022-04-28 02:48:47,683 INFO L290 TraceCheckUtils]: 39: Hoare triple {17822#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17823#(<= main_~i~0 17)} is VALID [2022-04-28 02:48:47,684 INFO L290 TraceCheckUtils]: 40: Hoare triple {17823#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17823#(<= main_~i~0 17)} is VALID [2022-04-28 02:48:47,684 INFO L290 TraceCheckUtils]: 41: Hoare triple {17823#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17824#(<= main_~i~0 18)} is VALID [2022-04-28 02:48:47,684 INFO L290 TraceCheckUtils]: 42: Hoare triple {17824#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17824#(<= main_~i~0 18)} is VALID [2022-04-28 02:48:47,688 INFO L290 TraceCheckUtils]: 43: Hoare triple {17824#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17825#(<= main_~i~0 19)} is VALID [2022-04-28 02:48:47,688 INFO L290 TraceCheckUtils]: 44: Hoare triple {17825#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17825#(<= main_~i~0 19)} is VALID [2022-04-28 02:48:47,688 INFO L290 TraceCheckUtils]: 45: Hoare triple {17825#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17826#(<= main_~i~0 20)} is VALID [2022-04-28 02:48:47,689 INFO L290 TraceCheckUtils]: 46: Hoare triple {17826#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17826#(<= main_~i~0 20)} is VALID [2022-04-28 02:48:47,689 INFO L290 TraceCheckUtils]: 47: Hoare triple {17826#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17827#(<= main_~i~0 21)} is VALID [2022-04-28 02:48:47,689 INFO L290 TraceCheckUtils]: 48: Hoare triple {17827#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17827#(<= main_~i~0 21)} is VALID [2022-04-28 02:48:47,690 INFO L290 TraceCheckUtils]: 49: Hoare triple {17827#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17828#(<= main_~i~0 22)} is VALID [2022-04-28 02:48:47,690 INFO L290 TraceCheckUtils]: 50: Hoare triple {17828#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17828#(<= main_~i~0 22)} is VALID [2022-04-28 02:48:47,690 INFO L290 TraceCheckUtils]: 51: Hoare triple {17828#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17829#(<= main_~i~0 23)} is VALID [2022-04-28 02:48:47,691 INFO L290 TraceCheckUtils]: 52: Hoare triple {17829#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17829#(<= main_~i~0 23)} is VALID [2022-04-28 02:48:47,691 INFO L290 TraceCheckUtils]: 53: Hoare triple {17829#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17830#(<= main_~i~0 24)} is VALID [2022-04-28 02:48:47,691 INFO L290 TraceCheckUtils]: 54: Hoare triple {17830#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17830#(<= main_~i~0 24)} is VALID [2022-04-28 02:48:47,692 INFO L290 TraceCheckUtils]: 55: Hoare triple {17830#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17831#(<= main_~i~0 25)} is VALID [2022-04-28 02:48:47,692 INFO L290 TraceCheckUtils]: 56: Hoare triple {17831#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17831#(<= main_~i~0 25)} is VALID [2022-04-28 02:48:47,692 INFO L290 TraceCheckUtils]: 57: Hoare triple {17831#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17832#(<= main_~i~0 26)} is VALID [2022-04-28 02:48:47,692 INFO L290 TraceCheckUtils]: 58: Hoare triple {17832#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17832#(<= main_~i~0 26)} is VALID [2022-04-28 02:48:47,693 INFO L290 TraceCheckUtils]: 59: Hoare triple {17832#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17833#(<= main_~i~0 27)} is VALID [2022-04-28 02:48:47,693 INFO L290 TraceCheckUtils]: 60: Hoare triple {17833#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17833#(<= main_~i~0 27)} is VALID [2022-04-28 02:48:47,693 INFO L290 TraceCheckUtils]: 61: Hoare triple {17833#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17834#(<= main_~i~0 28)} is VALID [2022-04-28 02:48:47,694 INFO L290 TraceCheckUtils]: 62: Hoare triple {17834#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17834#(<= main_~i~0 28)} is VALID [2022-04-28 02:48:47,694 INFO L290 TraceCheckUtils]: 63: Hoare triple {17834#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17835#(<= main_~i~0 29)} is VALID [2022-04-28 02:48:47,694 INFO L290 TraceCheckUtils]: 64: Hoare triple {17835#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17835#(<= main_~i~0 29)} is VALID [2022-04-28 02:48:47,695 INFO L290 TraceCheckUtils]: 65: Hoare triple {17835#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17836#(<= main_~i~0 30)} is VALID [2022-04-28 02:48:47,695 INFO L290 TraceCheckUtils]: 66: Hoare triple {17836#(<= main_~i~0 30)} assume !(~i~0 < 1024); {17802#false} is VALID [2022-04-28 02:48:47,695 INFO L290 TraceCheckUtils]: 67: Hoare triple {17802#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {17802#false} is VALID [2022-04-28 02:48:47,695 INFO L272 TraceCheckUtils]: 68: Hoare triple {17802#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {17802#false} is VALID [2022-04-28 02:48:47,695 INFO L290 TraceCheckUtils]: 69: Hoare triple {17802#false} ~cond := #in~cond; {17802#false} is VALID [2022-04-28 02:48:47,695 INFO L290 TraceCheckUtils]: 70: Hoare triple {17802#false} assume 0 == ~cond; {17802#false} is VALID [2022-04-28 02:48:47,695 INFO L290 TraceCheckUtils]: 71: Hoare triple {17802#false} assume !false; {17802#false} is VALID [2022-04-28 02:48:47,696 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:48:47,696 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:48:49,001 INFO L290 TraceCheckUtils]: 71: Hoare triple {17802#false} assume !false; {17802#false} is VALID [2022-04-28 02:48:49,003 INFO L290 TraceCheckUtils]: 70: Hoare triple {17802#false} assume 0 == ~cond; {17802#false} is VALID [2022-04-28 02:48:49,003 INFO L290 TraceCheckUtils]: 69: Hoare triple {17802#false} ~cond := #in~cond; {17802#false} is VALID [2022-04-28 02:48:49,003 INFO L272 TraceCheckUtils]: 68: Hoare triple {17802#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {17802#false} is VALID [2022-04-28 02:48:49,003 INFO L290 TraceCheckUtils]: 67: Hoare triple {17802#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {17802#false} is VALID [2022-04-28 02:48:49,007 INFO L290 TraceCheckUtils]: 66: Hoare triple {18070#(< main_~i~0 1024)} assume !(~i~0 < 1024); {17802#false} is VALID [2022-04-28 02:48:49,008 INFO L290 TraceCheckUtils]: 65: Hoare triple {18074#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18070#(< main_~i~0 1024)} is VALID [2022-04-28 02:48:49,008 INFO L290 TraceCheckUtils]: 64: Hoare triple {18074#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18074#(< main_~i~0 1023)} is VALID [2022-04-28 02:48:49,009 INFO L290 TraceCheckUtils]: 63: Hoare triple {18081#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18074#(< main_~i~0 1023)} is VALID [2022-04-28 02:48:49,009 INFO L290 TraceCheckUtils]: 62: Hoare triple {18081#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18081#(< main_~i~0 1022)} is VALID [2022-04-28 02:48:49,009 INFO L290 TraceCheckUtils]: 61: Hoare triple {18088#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18081#(< main_~i~0 1022)} is VALID [2022-04-28 02:48:49,010 INFO L290 TraceCheckUtils]: 60: Hoare triple {18088#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18088#(< main_~i~0 1021)} is VALID [2022-04-28 02:48:49,010 INFO L290 TraceCheckUtils]: 59: Hoare triple {18095#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18088#(< main_~i~0 1021)} is VALID [2022-04-28 02:48:49,011 INFO L290 TraceCheckUtils]: 58: Hoare triple {18095#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18095#(< main_~i~0 1020)} is VALID [2022-04-28 02:48:49,011 INFO L290 TraceCheckUtils]: 57: Hoare triple {18102#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18095#(< main_~i~0 1020)} is VALID [2022-04-28 02:48:49,011 INFO L290 TraceCheckUtils]: 56: Hoare triple {18102#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18102#(< main_~i~0 1019)} is VALID [2022-04-28 02:48:49,012 INFO L290 TraceCheckUtils]: 55: Hoare triple {18109#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18102#(< main_~i~0 1019)} is VALID [2022-04-28 02:48:49,012 INFO L290 TraceCheckUtils]: 54: Hoare triple {18109#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18109#(< main_~i~0 1018)} is VALID [2022-04-28 02:48:49,013 INFO L290 TraceCheckUtils]: 53: Hoare triple {18116#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18109#(< main_~i~0 1018)} is VALID [2022-04-28 02:48:49,013 INFO L290 TraceCheckUtils]: 52: Hoare triple {18116#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18116#(< main_~i~0 1017)} is VALID [2022-04-28 02:48:49,014 INFO L290 TraceCheckUtils]: 51: Hoare triple {18123#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18116#(< main_~i~0 1017)} is VALID [2022-04-28 02:48:49,014 INFO L290 TraceCheckUtils]: 50: Hoare triple {18123#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18123#(< main_~i~0 1016)} is VALID [2022-04-28 02:48:49,014 INFO L290 TraceCheckUtils]: 49: Hoare triple {18130#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18123#(< main_~i~0 1016)} is VALID [2022-04-28 02:48:49,015 INFO L290 TraceCheckUtils]: 48: Hoare triple {18130#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18130#(< main_~i~0 1015)} is VALID [2022-04-28 02:48:49,015 INFO L290 TraceCheckUtils]: 47: Hoare triple {18137#(< main_~i~0 1014)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18130#(< main_~i~0 1015)} is VALID [2022-04-28 02:48:49,016 INFO L290 TraceCheckUtils]: 46: Hoare triple {18137#(< main_~i~0 1014)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18137#(< main_~i~0 1014)} is VALID [2022-04-28 02:48:49,016 INFO L290 TraceCheckUtils]: 45: Hoare triple {18144#(< main_~i~0 1013)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18137#(< main_~i~0 1014)} is VALID [2022-04-28 02:48:49,016 INFO L290 TraceCheckUtils]: 44: Hoare triple {18144#(< main_~i~0 1013)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18144#(< main_~i~0 1013)} is VALID [2022-04-28 02:48:49,017 INFO L290 TraceCheckUtils]: 43: Hoare triple {18151#(< main_~i~0 1012)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#(< main_~i~0 1013)} is VALID [2022-04-28 02:48:49,017 INFO L290 TraceCheckUtils]: 42: Hoare triple {18151#(< main_~i~0 1012)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18151#(< main_~i~0 1012)} is VALID [2022-04-28 02:48:49,018 INFO L290 TraceCheckUtils]: 41: Hoare triple {18158#(< main_~i~0 1011)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18151#(< main_~i~0 1012)} is VALID [2022-04-28 02:48:49,018 INFO L290 TraceCheckUtils]: 40: Hoare triple {18158#(< main_~i~0 1011)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18158#(< main_~i~0 1011)} is VALID [2022-04-28 02:48:49,019 INFO L290 TraceCheckUtils]: 39: Hoare triple {18165#(< main_~i~0 1010)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18158#(< main_~i~0 1011)} is VALID [2022-04-28 02:48:49,019 INFO L290 TraceCheckUtils]: 38: Hoare triple {18165#(< main_~i~0 1010)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18165#(< main_~i~0 1010)} is VALID [2022-04-28 02:48:49,019 INFO L290 TraceCheckUtils]: 37: Hoare triple {18172#(< main_~i~0 1009)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18165#(< main_~i~0 1010)} is VALID [2022-04-28 02:48:49,020 INFO L290 TraceCheckUtils]: 36: Hoare triple {18172#(< main_~i~0 1009)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18172#(< main_~i~0 1009)} is VALID [2022-04-28 02:48:49,020 INFO L290 TraceCheckUtils]: 35: Hoare triple {18179#(< main_~i~0 1008)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18172#(< main_~i~0 1009)} is VALID [2022-04-28 02:48:49,021 INFO L290 TraceCheckUtils]: 34: Hoare triple {18179#(< main_~i~0 1008)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18179#(< main_~i~0 1008)} is VALID [2022-04-28 02:48:49,021 INFO L290 TraceCheckUtils]: 33: Hoare triple {18186#(< main_~i~0 1007)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18179#(< main_~i~0 1008)} is VALID [2022-04-28 02:48:49,022 INFO L290 TraceCheckUtils]: 32: Hoare triple {18186#(< main_~i~0 1007)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18186#(< main_~i~0 1007)} is VALID [2022-04-28 02:48:49,022 INFO L290 TraceCheckUtils]: 31: Hoare triple {18193#(< main_~i~0 1006)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18186#(< main_~i~0 1007)} is VALID [2022-04-28 02:48:49,022 INFO L290 TraceCheckUtils]: 30: Hoare triple {18193#(< main_~i~0 1006)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18193#(< main_~i~0 1006)} is VALID [2022-04-28 02:48:49,023 INFO L290 TraceCheckUtils]: 29: Hoare triple {18200#(< main_~i~0 1005)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18193#(< main_~i~0 1006)} is VALID [2022-04-28 02:48:49,023 INFO L290 TraceCheckUtils]: 28: Hoare triple {18200#(< main_~i~0 1005)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18200#(< main_~i~0 1005)} is VALID [2022-04-28 02:48:49,024 INFO L290 TraceCheckUtils]: 27: Hoare triple {18207#(< main_~i~0 1004)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18200#(< main_~i~0 1005)} is VALID [2022-04-28 02:48:49,024 INFO L290 TraceCheckUtils]: 26: Hoare triple {18207#(< main_~i~0 1004)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18207#(< main_~i~0 1004)} is VALID [2022-04-28 02:48:49,025 INFO L290 TraceCheckUtils]: 25: Hoare triple {18214#(< main_~i~0 1003)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18207#(< main_~i~0 1004)} is VALID [2022-04-28 02:48:49,025 INFO L290 TraceCheckUtils]: 24: Hoare triple {18214#(< main_~i~0 1003)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18214#(< main_~i~0 1003)} is VALID [2022-04-28 02:48:49,025 INFO L290 TraceCheckUtils]: 23: Hoare triple {18221#(< main_~i~0 1002)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18214#(< main_~i~0 1003)} is VALID [2022-04-28 02:48:49,026 INFO L290 TraceCheckUtils]: 22: Hoare triple {18221#(< main_~i~0 1002)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18221#(< main_~i~0 1002)} is VALID [2022-04-28 02:48:49,026 INFO L290 TraceCheckUtils]: 21: Hoare triple {18228#(< main_~i~0 1001)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18221#(< main_~i~0 1002)} is VALID [2022-04-28 02:48:49,027 INFO L290 TraceCheckUtils]: 20: Hoare triple {18228#(< main_~i~0 1001)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18228#(< main_~i~0 1001)} is VALID [2022-04-28 02:48:49,027 INFO L290 TraceCheckUtils]: 19: Hoare triple {18235#(< main_~i~0 1000)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18228#(< main_~i~0 1001)} is VALID [2022-04-28 02:48:49,028 INFO L290 TraceCheckUtils]: 18: Hoare triple {18235#(< main_~i~0 1000)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18235#(< main_~i~0 1000)} is VALID [2022-04-28 02:48:49,028 INFO L290 TraceCheckUtils]: 17: Hoare triple {18242#(< main_~i~0 999)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18235#(< main_~i~0 1000)} is VALID [2022-04-28 02:48:49,029 INFO L290 TraceCheckUtils]: 16: Hoare triple {18242#(< main_~i~0 999)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18242#(< main_~i~0 999)} is VALID [2022-04-28 02:48:49,029 INFO L290 TraceCheckUtils]: 15: Hoare triple {18249#(< main_~i~0 998)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18242#(< main_~i~0 999)} is VALID [2022-04-28 02:48:49,029 INFO L290 TraceCheckUtils]: 14: Hoare triple {18249#(< main_~i~0 998)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18249#(< main_~i~0 998)} is VALID [2022-04-28 02:48:49,030 INFO L290 TraceCheckUtils]: 13: Hoare triple {18256#(< main_~i~0 997)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18249#(< main_~i~0 998)} is VALID [2022-04-28 02:48:49,030 INFO L290 TraceCheckUtils]: 12: Hoare triple {18256#(< main_~i~0 997)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18256#(< main_~i~0 997)} is VALID [2022-04-28 02:48:49,031 INFO L290 TraceCheckUtils]: 11: Hoare triple {18263#(< main_~i~0 996)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18256#(< main_~i~0 997)} is VALID [2022-04-28 02:48:49,031 INFO L290 TraceCheckUtils]: 10: Hoare triple {18263#(< main_~i~0 996)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18263#(< main_~i~0 996)} is VALID [2022-04-28 02:48:49,032 INFO L290 TraceCheckUtils]: 9: Hoare triple {18270#(< main_~i~0 995)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18263#(< main_~i~0 996)} is VALID [2022-04-28 02:48:49,032 INFO L290 TraceCheckUtils]: 8: Hoare triple {18270#(< main_~i~0 995)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18270#(< main_~i~0 995)} is VALID [2022-04-28 02:48:49,033 INFO L290 TraceCheckUtils]: 7: Hoare triple {18277#(< main_~i~0 994)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18270#(< main_~i~0 995)} is VALID [2022-04-28 02:48:49,033 INFO L290 TraceCheckUtils]: 6: Hoare triple {18277#(< main_~i~0 994)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18277#(< main_~i~0 994)} is VALID [2022-04-28 02:48:49,034 INFO L290 TraceCheckUtils]: 5: Hoare triple {17801#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {18277#(< main_~i~0 994)} is VALID [2022-04-28 02:48:49,034 INFO L272 TraceCheckUtils]: 4: Hoare triple {17801#true} call #t~ret6 := main(); {17801#true} is VALID [2022-04-28 02:48:49,034 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17801#true} {17801#true} #39#return; {17801#true} is VALID [2022-04-28 02:48:49,034 INFO L290 TraceCheckUtils]: 2: Hoare triple {17801#true} assume true; {17801#true} is VALID [2022-04-28 02:48:49,034 INFO L290 TraceCheckUtils]: 1: Hoare triple {17801#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {17801#true} is VALID [2022-04-28 02:48:49,034 INFO L272 TraceCheckUtils]: 0: Hoare triple {17801#true} call ULTIMATE.init(); {17801#true} is VALID [2022-04-28 02:48:49,035 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:48:49,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1203273181] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:48:49,035 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:48:49,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33, 33] total 66 [2022-04-28 02:48:49,035 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:48:49,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [400990730] [2022-04-28 02:48:49,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [400990730] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:48:49,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:48:49,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-04-28 02:48:49,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196327786] [2022-04-28 02:48:49,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:48:49,036 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.0) internal successors, (68), 33 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 72 [2022-04-28 02:48:49,036 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:48:49,036 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 34 states, 34 states have (on average 2.0) internal successors, (68), 33 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:49,100 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:48:49,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-28 02:48:49,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:48:49,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-28 02:48:49,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2082, Invalid=2208, Unknown=0, NotChecked=0, Total=4290 [2022-04-28 02:48:49,101 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand has 34 states, 34 states have (on average 2.0) internal successors, (68), 33 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:49,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:48:49,959 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2022-04-28 02:48:49,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-28 02:48:49,959 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.0) internal successors, (68), 33 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 72 [2022-04-28 02:48:49,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:48:49,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 2.0) internal successors, (68), 33 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:49,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 82 transitions. [2022-04-28 02:48:49,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 2.0) internal successors, (68), 33 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:49,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 82 transitions. [2022-04-28 02:48:49,961 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 82 transitions. [2022-04-28 02:48:50,038 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:48:50,039 INFO L225 Difference]: With dead ends: 82 [2022-04-28 02:48:50,039 INFO L226 Difference]: Without dead ends: 76 [2022-04-28 02:48:50,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 644 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=4098, Invalid=5214, Unknown=0, NotChecked=0, Total=9312 [2022-04-28 02:48:50,041 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 70 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:48:50,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 19 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:48:50,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-28 02:48:50,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2022-04-28 02:48:50,254 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:48:50,254 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 75 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:50,254 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 75 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:50,255 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 75 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:50,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:48:50,255 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2022-04-28 02:48:50,255 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2022-04-28 02:48:50,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:48:50,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:48:50,256 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 76 states. [2022-04-28 02:48:50,256 INFO L87 Difference]: Start difference. First operand has 75 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 76 states. [2022-04-28 02:48:50,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:48:50,257 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2022-04-28 02:48:50,257 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2022-04-28 02:48:50,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:48:50,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:48:50,258 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:48:50,258 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:48:50,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:50,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2022-04-28 02:48:50,259 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 72 [2022-04-28 02:48:50,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:48:50,259 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2022-04-28 02:48:50,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.0) internal successors, (68), 33 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:50,259 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 75 states and 75 transitions. [2022-04-28 02:48:50,368 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:48:50,369 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2022-04-28 02:48:50,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-28 02:48:50,369 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:48:50,369 INFO L195 NwaCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:48:50,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-04-28 02:48:50,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-04-28 02:48:50,571 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:48:50,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:48:50,572 INFO L85 PathProgramCache]: Analyzing trace with hash 632916536, now seen corresponding path program 61 times [2022-04-28 02:48:50,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:48:50,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [745480561] [2022-04-28 02:48:50,574 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:48:50,575 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:48:50,575 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:48:50,575 INFO L85 PathProgramCache]: Analyzing trace with hash 632916536, now seen corresponding path program 62 times [2022-04-28 02:48:50,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:48:50,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676453277] [2022-04-28 02:48:50,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:48:50,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:48:50,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:48:51,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:48:51,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:48:51,055 INFO L290 TraceCheckUtils]: 0: Hoare triple {18866#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {18829#true} is VALID [2022-04-28 02:48:51,056 INFO L290 TraceCheckUtils]: 1: Hoare triple {18829#true} assume true; {18829#true} is VALID [2022-04-28 02:48:51,056 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18829#true} {18829#true} #39#return; {18829#true} is VALID [2022-04-28 02:48:51,056 INFO L272 TraceCheckUtils]: 0: Hoare triple {18829#true} call ULTIMATE.init(); {18866#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:48:51,056 INFO L290 TraceCheckUtils]: 1: Hoare triple {18866#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {18829#true} is VALID [2022-04-28 02:48:51,056 INFO L290 TraceCheckUtils]: 2: Hoare triple {18829#true} assume true; {18829#true} is VALID [2022-04-28 02:48:51,056 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18829#true} {18829#true} #39#return; {18829#true} is VALID [2022-04-28 02:48:51,056 INFO L272 TraceCheckUtils]: 4: Hoare triple {18829#true} call #t~ret6 := main(); {18829#true} is VALID [2022-04-28 02:48:51,056 INFO L290 TraceCheckUtils]: 5: Hoare triple {18829#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {18834#(= main_~i~0 0)} is VALID [2022-04-28 02:48:51,057 INFO L290 TraceCheckUtils]: 6: Hoare triple {18834#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18834#(= main_~i~0 0)} is VALID [2022-04-28 02:48:51,057 INFO L290 TraceCheckUtils]: 7: Hoare triple {18834#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18835#(<= main_~i~0 1)} is VALID [2022-04-28 02:48:51,057 INFO L290 TraceCheckUtils]: 8: Hoare triple {18835#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18835#(<= main_~i~0 1)} is VALID [2022-04-28 02:48:51,058 INFO L290 TraceCheckUtils]: 9: Hoare triple {18835#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18836#(<= main_~i~0 2)} is VALID [2022-04-28 02:48:51,058 INFO L290 TraceCheckUtils]: 10: Hoare triple {18836#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18836#(<= main_~i~0 2)} is VALID [2022-04-28 02:48:51,058 INFO L290 TraceCheckUtils]: 11: Hoare triple {18836#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18837#(<= main_~i~0 3)} is VALID [2022-04-28 02:48:51,059 INFO L290 TraceCheckUtils]: 12: Hoare triple {18837#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18837#(<= main_~i~0 3)} is VALID [2022-04-28 02:48:51,059 INFO L290 TraceCheckUtils]: 13: Hoare triple {18837#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18838#(<= main_~i~0 4)} is VALID [2022-04-28 02:48:51,059 INFO L290 TraceCheckUtils]: 14: Hoare triple {18838#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18838#(<= main_~i~0 4)} is VALID [2022-04-28 02:48:51,060 INFO L290 TraceCheckUtils]: 15: Hoare triple {18838#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18839#(<= main_~i~0 5)} is VALID [2022-04-28 02:48:51,060 INFO L290 TraceCheckUtils]: 16: Hoare triple {18839#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18839#(<= main_~i~0 5)} is VALID [2022-04-28 02:48:51,060 INFO L290 TraceCheckUtils]: 17: Hoare triple {18839#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18840#(<= main_~i~0 6)} is VALID [2022-04-28 02:48:51,060 INFO L290 TraceCheckUtils]: 18: Hoare triple {18840#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18840#(<= main_~i~0 6)} is VALID [2022-04-28 02:48:51,061 INFO L290 TraceCheckUtils]: 19: Hoare triple {18840#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18841#(<= main_~i~0 7)} is VALID [2022-04-28 02:48:51,062 INFO L290 TraceCheckUtils]: 20: Hoare triple {18841#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18841#(<= main_~i~0 7)} is VALID [2022-04-28 02:48:51,063 INFO L290 TraceCheckUtils]: 21: Hoare triple {18841#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18842#(<= main_~i~0 8)} is VALID [2022-04-28 02:48:51,063 INFO L290 TraceCheckUtils]: 22: Hoare triple {18842#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18842#(<= main_~i~0 8)} is VALID [2022-04-28 02:48:51,063 INFO L290 TraceCheckUtils]: 23: Hoare triple {18842#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18843#(<= main_~i~0 9)} is VALID [2022-04-28 02:48:51,064 INFO L290 TraceCheckUtils]: 24: Hoare triple {18843#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18843#(<= main_~i~0 9)} is VALID [2022-04-28 02:48:51,064 INFO L290 TraceCheckUtils]: 25: Hoare triple {18843#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18844#(<= main_~i~0 10)} is VALID [2022-04-28 02:48:51,064 INFO L290 TraceCheckUtils]: 26: Hoare triple {18844#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18844#(<= main_~i~0 10)} is VALID [2022-04-28 02:48:51,065 INFO L290 TraceCheckUtils]: 27: Hoare triple {18844#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18845#(<= main_~i~0 11)} is VALID [2022-04-28 02:48:51,065 INFO L290 TraceCheckUtils]: 28: Hoare triple {18845#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18845#(<= main_~i~0 11)} is VALID [2022-04-28 02:48:51,065 INFO L290 TraceCheckUtils]: 29: Hoare triple {18845#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18846#(<= main_~i~0 12)} is VALID [2022-04-28 02:48:51,066 INFO L290 TraceCheckUtils]: 30: Hoare triple {18846#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18846#(<= main_~i~0 12)} is VALID [2022-04-28 02:48:51,066 INFO L290 TraceCheckUtils]: 31: Hoare triple {18846#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18847#(<= main_~i~0 13)} is VALID [2022-04-28 02:48:51,066 INFO L290 TraceCheckUtils]: 32: Hoare triple {18847#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18847#(<= main_~i~0 13)} is VALID [2022-04-28 02:48:51,066 INFO L290 TraceCheckUtils]: 33: Hoare triple {18847#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18848#(<= main_~i~0 14)} is VALID [2022-04-28 02:48:51,067 INFO L290 TraceCheckUtils]: 34: Hoare triple {18848#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18848#(<= main_~i~0 14)} is VALID [2022-04-28 02:48:51,067 INFO L290 TraceCheckUtils]: 35: Hoare triple {18848#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18849#(<= main_~i~0 15)} is VALID [2022-04-28 02:48:51,067 INFO L290 TraceCheckUtils]: 36: Hoare triple {18849#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18849#(<= main_~i~0 15)} is VALID [2022-04-28 02:48:51,068 INFO L290 TraceCheckUtils]: 37: Hoare triple {18849#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18850#(<= main_~i~0 16)} is VALID [2022-04-28 02:48:51,068 INFO L290 TraceCheckUtils]: 38: Hoare triple {18850#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18850#(<= main_~i~0 16)} is VALID [2022-04-28 02:48:51,068 INFO L290 TraceCheckUtils]: 39: Hoare triple {18850#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18851#(<= main_~i~0 17)} is VALID [2022-04-28 02:48:51,069 INFO L290 TraceCheckUtils]: 40: Hoare triple {18851#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18851#(<= main_~i~0 17)} is VALID [2022-04-28 02:48:51,069 INFO L290 TraceCheckUtils]: 41: Hoare triple {18851#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18852#(<= main_~i~0 18)} is VALID [2022-04-28 02:48:51,069 INFO L290 TraceCheckUtils]: 42: Hoare triple {18852#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18852#(<= main_~i~0 18)} is VALID [2022-04-28 02:48:51,070 INFO L290 TraceCheckUtils]: 43: Hoare triple {18852#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18853#(<= main_~i~0 19)} is VALID [2022-04-28 02:48:51,070 INFO L290 TraceCheckUtils]: 44: Hoare triple {18853#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18853#(<= main_~i~0 19)} is VALID [2022-04-28 02:48:51,070 INFO L290 TraceCheckUtils]: 45: Hoare triple {18853#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18854#(<= main_~i~0 20)} is VALID [2022-04-28 02:48:51,070 INFO L290 TraceCheckUtils]: 46: Hoare triple {18854#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18854#(<= main_~i~0 20)} is VALID [2022-04-28 02:48:51,071 INFO L290 TraceCheckUtils]: 47: Hoare triple {18854#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18855#(<= main_~i~0 21)} is VALID [2022-04-28 02:48:51,071 INFO L290 TraceCheckUtils]: 48: Hoare triple {18855#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18855#(<= main_~i~0 21)} is VALID [2022-04-28 02:48:51,071 INFO L290 TraceCheckUtils]: 49: Hoare triple {18855#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18856#(<= main_~i~0 22)} is VALID [2022-04-28 02:48:51,072 INFO L290 TraceCheckUtils]: 50: Hoare triple {18856#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18856#(<= main_~i~0 22)} is VALID [2022-04-28 02:48:51,072 INFO L290 TraceCheckUtils]: 51: Hoare triple {18856#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18857#(<= main_~i~0 23)} is VALID [2022-04-28 02:48:51,072 INFO L290 TraceCheckUtils]: 52: Hoare triple {18857#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18857#(<= main_~i~0 23)} is VALID [2022-04-28 02:48:51,073 INFO L290 TraceCheckUtils]: 53: Hoare triple {18857#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18858#(<= main_~i~0 24)} is VALID [2022-04-28 02:48:51,073 INFO L290 TraceCheckUtils]: 54: Hoare triple {18858#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18858#(<= main_~i~0 24)} is VALID [2022-04-28 02:48:51,073 INFO L290 TraceCheckUtils]: 55: Hoare triple {18858#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18859#(<= main_~i~0 25)} is VALID [2022-04-28 02:48:51,074 INFO L290 TraceCheckUtils]: 56: Hoare triple {18859#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18859#(<= main_~i~0 25)} is VALID [2022-04-28 02:48:51,074 INFO L290 TraceCheckUtils]: 57: Hoare triple {18859#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18860#(<= main_~i~0 26)} is VALID [2022-04-28 02:48:51,074 INFO L290 TraceCheckUtils]: 58: Hoare triple {18860#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18860#(<= main_~i~0 26)} is VALID [2022-04-28 02:48:51,075 INFO L290 TraceCheckUtils]: 59: Hoare triple {18860#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18861#(<= main_~i~0 27)} is VALID [2022-04-28 02:48:51,075 INFO L290 TraceCheckUtils]: 60: Hoare triple {18861#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18861#(<= main_~i~0 27)} is VALID [2022-04-28 02:48:51,075 INFO L290 TraceCheckUtils]: 61: Hoare triple {18861#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18862#(<= main_~i~0 28)} is VALID [2022-04-28 02:48:51,075 INFO L290 TraceCheckUtils]: 62: Hoare triple {18862#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18862#(<= main_~i~0 28)} is VALID [2022-04-28 02:48:51,076 INFO L290 TraceCheckUtils]: 63: Hoare triple {18862#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18863#(<= main_~i~0 29)} is VALID [2022-04-28 02:48:51,076 INFO L290 TraceCheckUtils]: 64: Hoare triple {18863#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18863#(<= main_~i~0 29)} is VALID [2022-04-28 02:48:51,076 INFO L290 TraceCheckUtils]: 65: Hoare triple {18863#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18864#(<= main_~i~0 30)} is VALID [2022-04-28 02:48:51,077 INFO L290 TraceCheckUtils]: 66: Hoare triple {18864#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18864#(<= main_~i~0 30)} is VALID [2022-04-28 02:48:51,077 INFO L290 TraceCheckUtils]: 67: Hoare triple {18864#(<= main_~i~0 30)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18865#(<= main_~i~0 31)} is VALID [2022-04-28 02:48:51,077 INFO L290 TraceCheckUtils]: 68: Hoare triple {18865#(<= main_~i~0 31)} assume !(~i~0 < 1024); {18830#false} is VALID [2022-04-28 02:48:51,077 INFO L290 TraceCheckUtils]: 69: Hoare triple {18830#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {18830#false} is VALID [2022-04-28 02:48:51,077 INFO L272 TraceCheckUtils]: 70: Hoare triple {18830#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {18830#false} is VALID [2022-04-28 02:48:51,077 INFO L290 TraceCheckUtils]: 71: Hoare triple {18830#false} ~cond := #in~cond; {18830#false} is VALID [2022-04-28 02:48:51,078 INFO L290 TraceCheckUtils]: 72: Hoare triple {18830#false} assume 0 == ~cond; {18830#false} is VALID [2022-04-28 02:48:51,078 INFO L290 TraceCheckUtils]: 73: Hoare triple {18830#false} assume !false; {18830#false} is VALID [2022-04-28 02:48:51,078 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:48:51,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:48:51,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676453277] [2022-04-28 02:48:51,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676453277] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:48:51,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233765248] [2022-04-28 02:48:51,078 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:48:51,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:48:51,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:48:51,079 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:48:51,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-04-28 02:48:51,238 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:48:51,238 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:48:51,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-28 02:48:51,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:48:51,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:48:51,672 INFO L272 TraceCheckUtils]: 0: Hoare triple {18829#true} call ULTIMATE.init(); {18829#true} is VALID [2022-04-28 02:48:51,672 INFO L290 TraceCheckUtils]: 1: Hoare triple {18829#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {18829#true} is VALID [2022-04-28 02:48:51,672 INFO L290 TraceCheckUtils]: 2: Hoare triple {18829#true} assume true; {18829#true} is VALID [2022-04-28 02:48:51,672 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18829#true} {18829#true} #39#return; {18829#true} is VALID [2022-04-28 02:48:51,672 INFO L272 TraceCheckUtils]: 4: Hoare triple {18829#true} call #t~ret6 := main(); {18829#true} is VALID [2022-04-28 02:48:51,673 INFO L290 TraceCheckUtils]: 5: Hoare triple {18829#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {18885#(<= main_~i~0 0)} is VALID [2022-04-28 02:48:51,673 INFO L290 TraceCheckUtils]: 6: Hoare triple {18885#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18885#(<= main_~i~0 0)} is VALID [2022-04-28 02:48:51,673 INFO L290 TraceCheckUtils]: 7: Hoare triple {18885#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18835#(<= main_~i~0 1)} is VALID [2022-04-28 02:48:51,674 INFO L290 TraceCheckUtils]: 8: Hoare triple {18835#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18835#(<= main_~i~0 1)} is VALID [2022-04-28 02:48:51,674 INFO L290 TraceCheckUtils]: 9: Hoare triple {18835#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18836#(<= main_~i~0 2)} is VALID [2022-04-28 02:48:51,674 INFO L290 TraceCheckUtils]: 10: Hoare triple {18836#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18836#(<= main_~i~0 2)} is VALID [2022-04-28 02:48:51,675 INFO L290 TraceCheckUtils]: 11: Hoare triple {18836#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18837#(<= main_~i~0 3)} is VALID [2022-04-28 02:48:51,675 INFO L290 TraceCheckUtils]: 12: Hoare triple {18837#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18837#(<= main_~i~0 3)} is VALID [2022-04-28 02:48:51,675 INFO L290 TraceCheckUtils]: 13: Hoare triple {18837#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18838#(<= main_~i~0 4)} is VALID [2022-04-28 02:48:51,675 INFO L290 TraceCheckUtils]: 14: Hoare triple {18838#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18838#(<= main_~i~0 4)} is VALID [2022-04-28 02:48:51,676 INFO L290 TraceCheckUtils]: 15: Hoare triple {18838#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18839#(<= main_~i~0 5)} is VALID [2022-04-28 02:48:51,676 INFO L290 TraceCheckUtils]: 16: Hoare triple {18839#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18839#(<= main_~i~0 5)} is VALID [2022-04-28 02:48:51,676 INFO L290 TraceCheckUtils]: 17: Hoare triple {18839#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18840#(<= main_~i~0 6)} is VALID [2022-04-28 02:48:51,677 INFO L290 TraceCheckUtils]: 18: Hoare triple {18840#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18840#(<= main_~i~0 6)} is VALID [2022-04-28 02:48:51,677 INFO L290 TraceCheckUtils]: 19: Hoare triple {18840#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18841#(<= main_~i~0 7)} is VALID [2022-04-28 02:48:51,677 INFO L290 TraceCheckUtils]: 20: Hoare triple {18841#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18841#(<= main_~i~0 7)} is VALID [2022-04-28 02:48:51,678 INFO L290 TraceCheckUtils]: 21: Hoare triple {18841#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18842#(<= main_~i~0 8)} is VALID [2022-04-28 02:48:51,678 INFO L290 TraceCheckUtils]: 22: Hoare triple {18842#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18842#(<= main_~i~0 8)} is VALID [2022-04-28 02:48:51,678 INFO L290 TraceCheckUtils]: 23: Hoare triple {18842#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18843#(<= main_~i~0 9)} is VALID [2022-04-28 02:48:51,679 INFO L290 TraceCheckUtils]: 24: Hoare triple {18843#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18843#(<= main_~i~0 9)} is VALID [2022-04-28 02:48:51,679 INFO L290 TraceCheckUtils]: 25: Hoare triple {18843#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18844#(<= main_~i~0 10)} is VALID [2022-04-28 02:48:51,679 INFO L290 TraceCheckUtils]: 26: Hoare triple {18844#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18844#(<= main_~i~0 10)} is VALID [2022-04-28 02:48:51,680 INFO L290 TraceCheckUtils]: 27: Hoare triple {18844#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18845#(<= main_~i~0 11)} is VALID [2022-04-28 02:48:51,680 INFO L290 TraceCheckUtils]: 28: Hoare triple {18845#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18845#(<= main_~i~0 11)} is VALID [2022-04-28 02:48:51,680 INFO L290 TraceCheckUtils]: 29: Hoare triple {18845#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18846#(<= main_~i~0 12)} is VALID [2022-04-28 02:48:51,680 INFO L290 TraceCheckUtils]: 30: Hoare triple {18846#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18846#(<= main_~i~0 12)} is VALID [2022-04-28 02:48:51,681 INFO L290 TraceCheckUtils]: 31: Hoare triple {18846#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18847#(<= main_~i~0 13)} is VALID [2022-04-28 02:48:51,681 INFO L290 TraceCheckUtils]: 32: Hoare triple {18847#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18847#(<= main_~i~0 13)} is VALID [2022-04-28 02:48:51,682 INFO L290 TraceCheckUtils]: 33: Hoare triple {18847#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18848#(<= main_~i~0 14)} is VALID [2022-04-28 02:48:51,682 INFO L290 TraceCheckUtils]: 34: Hoare triple {18848#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18848#(<= main_~i~0 14)} is VALID [2022-04-28 02:48:51,682 INFO L290 TraceCheckUtils]: 35: Hoare triple {18848#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18849#(<= main_~i~0 15)} is VALID [2022-04-28 02:48:51,682 INFO L290 TraceCheckUtils]: 36: Hoare triple {18849#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18849#(<= main_~i~0 15)} is VALID [2022-04-28 02:48:51,683 INFO L290 TraceCheckUtils]: 37: Hoare triple {18849#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18850#(<= main_~i~0 16)} is VALID [2022-04-28 02:48:51,683 INFO L290 TraceCheckUtils]: 38: Hoare triple {18850#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18850#(<= main_~i~0 16)} is VALID [2022-04-28 02:48:51,683 INFO L290 TraceCheckUtils]: 39: Hoare triple {18850#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18851#(<= main_~i~0 17)} is VALID [2022-04-28 02:48:51,684 INFO L290 TraceCheckUtils]: 40: Hoare triple {18851#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18851#(<= main_~i~0 17)} is VALID [2022-04-28 02:48:51,684 INFO L290 TraceCheckUtils]: 41: Hoare triple {18851#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18852#(<= main_~i~0 18)} is VALID [2022-04-28 02:48:51,684 INFO L290 TraceCheckUtils]: 42: Hoare triple {18852#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18852#(<= main_~i~0 18)} is VALID [2022-04-28 02:48:51,685 INFO L290 TraceCheckUtils]: 43: Hoare triple {18852#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18853#(<= main_~i~0 19)} is VALID [2022-04-28 02:48:51,685 INFO L290 TraceCheckUtils]: 44: Hoare triple {18853#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18853#(<= main_~i~0 19)} is VALID [2022-04-28 02:48:51,685 INFO L290 TraceCheckUtils]: 45: Hoare triple {18853#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18854#(<= main_~i~0 20)} is VALID [2022-04-28 02:48:51,686 INFO L290 TraceCheckUtils]: 46: Hoare triple {18854#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18854#(<= main_~i~0 20)} is VALID [2022-04-28 02:48:51,686 INFO L290 TraceCheckUtils]: 47: Hoare triple {18854#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18855#(<= main_~i~0 21)} is VALID [2022-04-28 02:48:51,686 INFO L290 TraceCheckUtils]: 48: Hoare triple {18855#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18855#(<= main_~i~0 21)} is VALID [2022-04-28 02:48:51,687 INFO L290 TraceCheckUtils]: 49: Hoare triple {18855#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18856#(<= main_~i~0 22)} is VALID [2022-04-28 02:48:51,687 INFO L290 TraceCheckUtils]: 50: Hoare triple {18856#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18856#(<= main_~i~0 22)} is VALID [2022-04-28 02:48:51,687 INFO L290 TraceCheckUtils]: 51: Hoare triple {18856#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18857#(<= main_~i~0 23)} is VALID [2022-04-28 02:48:51,687 INFO L290 TraceCheckUtils]: 52: Hoare triple {18857#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18857#(<= main_~i~0 23)} is VALID [2022-04-28 02:48:51,688 INFO L290 TraceCheckUtils]: 53: Hoare triple {18857#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18858#(<= main_~i~0 24)} is VALID [2022-04-28 02:48:51,688 INFO L290 TraceCheckUtils]: 54: Hoare triple {18858#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18858#(<= main_~i~0 24)} is VALID [2022-04-28 02:48:51,688 INFO L290 TraceCheckUtils]: 55: Hoare triple {18858#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18859#(<= main_~i~0 25)} is VALID [2022-04-28 02:48:51,689 INFO L290 TraceCheckUtils]: 56: Hoare triple {18859#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18859#(<= main_~i~0 25)} is VALID [2022-04-28 02:48:51,689 INFO L290 TraceCheckUtils]: 57: Hoare triple {18859#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18860#(<= main_~i~0 26)} is VALID [2022-04-28 02:48:51,689 INFO L290 TraceCheckUtils]: 58: Hoare triple {18860#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18860#(<= main_~i~0 26)} is VALID [2022-04-28 02:48:51,690 INFO L290 TraceCheckUtils]: 59: Hoare triple {18860#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18861#(<= main_~i~0 27)} is VALID [2022-04-28 02:48:51,690 INFO L290 TraceCheckUtils]: 60: Hoare triple {18861#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18861#(<= main_~i~0 27)} is VALID [2022-04-28 02:48:51,690 INFO L290 TraceCheckUtils]: 61: Hoare triple {18861#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18862#(<= main_~i~0 28)} is VALID [2022-04-28 02:48:51,691 INFO L290 TraceCheckUtils]: 62: Hoare triple {18862#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18862#(<= main_~i~0 28)} is VALID [2022-04-28 02:48:51,691 INFO L290 TraceCheckUtils]: 63: Hoare triple {18862#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18863#(<= main_~i~0 29)} is VALID [2022-04-28 02:48:51,691 INFO L290 TraceCheckUtils]: 64: Hoare triple {18863#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18863#(<= main_~i~0 29)} is VALID [2022-04-28 02:48:51,692 INFO L290 TraceCheckUtils]: 65: Hoare triple {18863#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18864#(<= main_~i~0 30)} is VALID [2022-04-28 02:48:51,692 INFO L290 TraceCheckUtils]: 66: Hoare triple {18864#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18864#(<= main_~i~0 30)} is VALID [2022-04-28 02:48:51,692 INFO L290 TraceCheckUtils]: 67: Hoare triple {18864#(<= main_~i~0 30)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18865#(<= main_~i~0 31)} is VALID [2022-04-28 02:48:51,693 INFO L290 TraceCheckUtils]: 68: Hoare triple {18865#(<= main_~i~0 31)} assume !(~i~0 < 1024); {18830#false} is VALID [2022-04-28 02:48:51,693 INFO L290 TraceCheckUtils]: 69: Hoare triple {18830#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {18830#false} is VALID [2022-04-28 02:48:51,693 INFO L272 TraceCheckUtils]: 70: Hoare triple {18830#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {18830#false} is VALID [2022-04-28 02:48:51,693 INFO L290 TraceCheckUtils]: 71: Hoare triple {18830#false} ~cond := #in~cond; {18830#false} is VALID [2022-04-28 02:48:51,693 INFO L290 TraceCheckUtils]: 72: Hoare triple {18830#false} assume 0 == ~cond; {18830#false} is VALID [2022-04-28 02:48:51,693 INFO L290 TraceCheckUtils]: 73: Hoare triple {18830#false} assume !false; {18830#false} is VALID [2022-04-28 02:48:51,693 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:48:51,693 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:48:53,077 INFO L290 TraceCheckUtils]: 73: Hoare triple {18830#false} assume !false; {18830#false} is VALID [2022-04-28 02:48:53,078 INFO L290 TraceCheckUtils]: 72: Hoare triple {18830#false} assume 0 == ~cond; {18830#false} is VALID [2022-04-28 02:48:53,078 INFO L290 TraceCheckUtils]: 71: Hoare triple {18830#false} ~cond := #in~cond; {18830#false} is VALID [2022-04-28 02:48:53,078 INFO L272 TraceCheckUtils]: 70: Hoare triple {18830#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {18830#false} is VALID [2022-04-28 02:48:53,078 INFO L290 TraceCheckUtils]: 69: Hoare triple {18830#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {18830#false} is VALID [2022-04-28 02:48:53,078 INFO L290 TraceCheckUtils]: 68: Hoare triple {19105#(< main_~i~0 1024)} assume !(~i~0 < 1024); {18830#false} is VALID [2022-04-28 02:48:53,078 INFO L290 TraceCheckUtils]: 67: Hoare triple {19109#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19105#(< main_~i~0 1024)} is VALID [2022-04-28 02:48:53,079 INFO L290 TraceCheckUtils]: 66: Hoare triple {19109#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19109#(< main_~i~0 1023)} is VALID [2022-04-28 02:48:53,079 INFO L290 TraceCheckUtils]: 65: Hoare triple {19116#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19109#(< main_~i~0 1023)} is VALID [2022-04-28 02:48:53,079 INFO L290 TraceCheckUtils]: 64: Hoare triple {19116#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19116#(< main_~i~0 1022)} is VALID [2022-04-28 02:48:53,080 INFO L290 TraceCheckUtils]: 63: Hoare triple {19123#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19116#(< main_~i~0 1022)} is VALID [2022-04-28 02:48:53,080 INFO L290 TraceCheckUtils]: 62: Hoare triple {19123#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19123#(< main_~i~0 1021)} is VALID [2022-04-28 02:48:53,080 INFO L290 TraceCheckUtils]: 61: Hoare triple {19130#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19123#(< main_~i~0 1021)} is VALID [2022-04-28 02:48:53,081 INFO L290 TraceCheckUtils]: 60: Hoare triple {19130#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19130#(< main_~i~0 1020)} is VALID [2022-04-28 02:48:53,081 INFO L290 TraceCheckUtils]: 59: Hoare triple {19137#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19130#(< main_~i~0 1020)} is VALID [2022-04-28 02:48:53,081 INFO L290 TraceCheckUtils]: 58: Hoare triple {19137#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19137#(< main_~i~0 1019)} is VALID [2022-04-28 02:48:53,082 INFO L290 TraceCheckUtils]: 57: Hoare triple {19144#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19137#(< main_~i~0 1019)} is VALID [2022-04-28 02:48:53,082 INFO L290 TraceCheckUtils]: 56: Hoare triple {19144#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19144#(< main_~i~0 1018)} is VALID [2022-04-28 02:48:53,082 INFO L290 TraceCheckUtils]: 55: Hoare triple {19151#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19144#(< main_~i~0 1018)} is VALID [2022-04-28 02:48:53,082 INFO L290 TraceCheckUtils]: 54: Hoare triple {19151#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19151#(< main_~i~0 1017)} is VALID [2022-04-28 02:48:53,083 INFO L290 TraceCheckUtils]: 53: Hoare triple {19158#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19151#(< main_~i~0 1017)} is VALID [2022-04-28 02:48:53,083 INFO L290 TraceCheckUtils]: 52: Hoare triple {19158#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19158#(< main_~i~0 1016)} is VALID [2022-04-28 02:48:53,083 INFO L290 TraceCheckUtils]: 51: Hoare triple {19165#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19158#(< main_~i~0 1016)} is VALID [2022-04-28 02:48:53,084 INFO L290 TraceCheckUtils]: 50: Hoare triple {19165#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19165#(< main_~i~0 1015)} is VALID [2022-04-28 02:48:53,084 INFO L290 TraceCheckUtils]: 49: Hoare triple {19172#(< main_~i~0 1014)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19165#(< main_~i~0 1015)} is VALID [2022-04-28 02:48:53,084 INFO L290 TraceCheckUtils]: 48: Hoare triple {19172#(< main_~i~0 1014)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19172#(< main_~i~0 1014)} is VALID [2022-04-28 02:48:53,085 INFO L290 TraceCheckUtils]: 47: Hoare triple {19179#(< main_~i~0 1013)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19172#(< main_~i~0 1014)} is VALID [2022-04-28 02:48:53,085 INFO L290 TraceCheckUtils]: 46: Hoare triple {19179#(< main_~i~0 1013)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19179#(< main_~i~0 1013)} is VALID [2022-04-28 02:48:53,085 INFO L290 TraceCheckUtils]: 45: Hoare triple {19186#(< main_~i~0 1012)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19179#(< main_~i~0 1013)} is VALID [2022-04-28 02:48:53,086 INFO L290 TraceCheckUtils]: 44: Hoare triple {19186#(< main_~i~0 1012)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19186#(< main_~i~0 1012)} is VALID [2022-04-28 02:48:53,086 INFO L290 TraceCheckUtils]: 43: Hoare triple {19193#(< main_~i~0 1011)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19186#(< main_~i~0 1012)} is VALID [2022-04-28 02:48:53,086 INFO L290 TraceCheckUtils]: 42: Hoare triple {19193#(< main_~i~0 1011)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19193#(< main_~i~0 1011)} is VALID [2022-04-28 02:48:53,087 INFO L290 TraceCheckUtils]: 41: Hoare triple {19200#(< main_~i~0 1010)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19193#(< main_~i~0 1011)} is VALID [2022-04-28 02:48:53,087 INFO L290 TraceCheckUtils]: 40: Hoare triple {19200#(< main_~i~0 1010)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19200#(< main_~i~0 1010)} is VALID [2022-04-28 02:48:53,087 INFO L290 TraceCheckUtils]: 39: Hoare triple {19207#(< main_~i~0 1009)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19200#(< main_~i~0 1010)} is VALID [2022-04-28 02:48:53,087 INFO L290 TraceCheckUtils]: 38: Hoare triple {19207#(< main_~i~0 1009)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19207#(< main_~i~0 1009)} is VALID [2022-04-28 02:48:53,088 INFO L290 TraceCheckUtils]: 37: Hoare triple {19214#(< main_~i~0 1008)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19207#(< main_~i~0 1009)} is VALID [2022-04-28 02:48:53,088 INFO L290 TraceCheckUtils]: 36: Hoare triple {19214#(< main_~i~0 1008)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19214#(< main_~i~0 1008)} is VALID [2022-04-28 02:48:53,088 INFO L290 TraceCheckUtils]: 35: Hoare triple {19221#(< main_~i~0 1007)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19214#(< main_~i~0 1008)} is VALID [2022-04-28 02:48:53,089 INFO L290 TraceCheckUtils]: 34: Hoare triple {19221#(< main_~i~0 1007)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19221#(< main_~i~0 1007)} is VALID [2022-04-28 02:48:53,089 INFO L290 TraceCheckUtils]: 33: Hoare triple {19228#(< main_~i~0 1006)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19221#(< main_~i~0 1007)} is VALID [2022-04-28 02:48:53,089 INFO L290 TraceCheckUtils]: 32: Hoare triple {19228#(< main_~i~0 1006)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19228#(< main_~i~0 1006)} is VALID [2022-04-28 02:48:53,090 INFO L290 TraceCheckUtils]: 31: Hoare triple {19235#(< main_~i~0 1005)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19228#(< main_~i~0 1006)} is VALID [2022-04-28 02:48:53,090 INFO L290 TraceCheckUtils]: 30: Hoare triple {19235#(< main_~i~0 1005)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19235#(< main_~i~0 1005)} is VALID [2022-04-28 02:48:53,090 INFO L290 TraceCheckUtils]: 29: Hoare triple {19242#(< main_~i~0 1004)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19235#(< main_~i~0 1005)} is VALID [2022-04-28 02:48:53,091 INFO L290 TraceCheckUtils]: 28: Hoare triple {19242#(< main_~i~0 1004)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19242#(< main_~i~0 1004)} is VALID [2022-04-28 02:48:53,091 INFO L290 TraceCheckUtils]: 27: Hoare triple {19249#(< main_~i~0 1003)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19242#(< main_~i~0 1004)} is VALID [2022-04-28 02:48:53,091 INFO L290 TraceCheckUtils]: 26: Hoare triple {19249#(< main_~i~0 1003)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19249#(< main_~i~0 1003)} is VALID [2022-04-28 02:48:53,092 INFO L290 TraceCheckUtils]: 25: Hoare triple {19256#(< main_~i~0 1002)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19249#(< main_~i~0 1003)} is VALID [2022-04-28 02:48:53,092 INFO L290 TraceCheckUtils]: 24: Hoare triple {19256#(< main_~i~0 1002)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19256#(< main_~i~0 1002)} is VALID [2022-04-28 02:48:53,092 INFO L290 TraceCheckUtils]: 23: Hoare triple {19263#(< main_~i~0 1001)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19256#(< main_~i~0 1002)} is VALID [2022-04-28 02:48:53,092 INFO L290 TraceCheckUtils]: 22: Hoare triple {19263#(< main_~i~0 1001)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19263#(< main_~i~0 1001)} is VALID [2022-04-28 02:48:53,093 INFO L290 TraceCheckUtils]: 21: Hoare triple {19270#(< main_~i~0 1000)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19263#(< main_~i~0 1001)} is VALID [2022-04-28 02:48:53,093 INFO L290 TraceCheckUtils]: 20: Hoare triple {19270#(< main_~i~0 1000)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19270#(< main_~i~0 1000)} is VALID [2022-04-28 02:48:53,093 INFO L290 TraceCheckUtils]: 19: Hoare triple {19277#(< main_~i~0 999)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19270#(< main_~i~0 1000)} is VALID [2022-04-28 02:48:53,094 INFO L290 TraceCheckUtils]: 18: Hoare triple {19277#(< main_~i~0 999)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19277#(< main_~i~0 999)} is VALID [2022-04-28 02:48:53,094 INFO L290 TraceCheckUtils]: 17: Hoare triple {19284#(< main_~i~0 998)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19277#(< main_~i~0 999)} is VALID [2022-04-28 02:48:53,094 INFO L290 TraceCheckUtils]: 16: Hoare triple {19284#(< main_~i~0 998)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19284#(< main_~i~0 998)} is VALID [2022-04-28 02:48:53,095 INFO L290 TraceCheckUtils]: 15: Hoare triple {19291#(< main_~i~0 997)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19284#(< main_~i~0 998)} is VALID [2022-04-28 02:48:53,095 INFO L290 TraceCheckUtils]: 14: Hoare triple {19291#(< main_~i~0 997)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19291#(< main_~i~0 997)} is VALID [2022-04-28 02:48:53,095 INFO L290 TraceCheckUtils]: 13: Hoare triple {19298#(< main_~i~0 996)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19291#(< main_~i~0 997)} is VALID [2022-04-28 02:48:53,096 INFO L290 TraceCheckUtils]: 12: Hoare triple {19298#(< main_~i~0 996)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19298#(< main_~i~0 996)} is VALID [2022-04-28 02:48:53,096 INFO L290 TraceCheckUtils]: 11: Hoare triple {19305#(< main_~i~0 995)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19298#(< main_~i~0 996)} is VALID [2022-04-28 02:48:53,096 INFO L290 TraceCheckUtils]: 10: Hoare triple {19305#(< main_~i~0 995)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19305#(< main_~i~0 995)} is VALID [2022-04-28 02:48:53,097 INFO L290 TraceCheckUtils]: 9: Hoare triple {19312#(< main_~i~0 994)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19305#(< main_~i~0 995)} is VALID [2022-04-28 02:48:53,097 INFO L290 TraceCheckUtils]: 8: Hoare triple {19312#(< main_~i~0 994)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19312#(< main_~i~0 994)} is VALID [2022-04-28 02:48:53,097 INFO L290 TraceCheckUtils]: 7: Hoare triple {19319#(< main_~i~0 993)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19312#(< main_~i~0 994)} is VALID [2022-04-28 02:48:53,097 INFO L290 TraceCheckUtils]: 6: Hoare triple {19319#(< main_~i~0 993)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19319#(< main_~i~0 993)} is VALID [2022-04-28 02:48:53,098 INFO L290 TraceCheckUtils]: 5: Hoare triple {18829#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {19319#(< main_~i~0 993)} is VALID [2022-04-28 02:48:53,098 INFO L272 TraceCheckUtils]: 4: Hoare triple {18829#true} call #t~ret6 := main(); {18829#true} is VALID [2022-04-28 02:48:53,098 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18829#true} {18829#true} #39#return; {18829#true} is VALID [2022-04-28 02:48:53,098 INFO L290 TraceCheckUtils]: 2: Hoare triple {18829#true} assume true; {18829#true} is VALID [2022-04-28 02:48:53,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {18829#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {18829#true} is VALID [2022-04-28 02:48:53,098 INFO L272 TraceCheckUtils]: 0: Hoare triple {18829#true} call ULTIMATE.init(); {18829#true} is VALID [2022-04-28 02:48:53,099 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:48:53,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [233765248] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:48:53,099 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:48:53,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34, 34] total 68 [2022-04-28 02:48:53,099 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:48:53,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [745480561] [2022-04-28 02:48:53,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [745480561] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:48:53,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:48:53,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2022-04-28 02:48:53,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748783272] [2022-04-28 02:48:53,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:48:53,100 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.0) internal successors, (70), 34 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 74 [2022-04-28 02:48:53,100 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:48:53,100 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 35 states, 35 states have (on average 2.0) internal successors, (70), 34 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:53,155 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:48:53,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-04-28 02:48:53,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:48:53,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-04-28 02:48:53,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2213, Invalid=2343, Unknown=0, NotChecked=0, Total=4556 [2022-04-28 02:48:53,157 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand has 35 states, 35 states have (on average 2.0) internal successors, (70), 34 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:54,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:48:54,038 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2022-04-28 02:48:54,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-28 02:48:54,038 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.0) internal successors, (70), 34 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 74 [2022-04-28 02:48:54,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:48:54,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 2.0) internal successors, (70), 34 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:54,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 84 transitions. [2022-04-28 02:48:54,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 2.0) internal successors, (70), 34 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:54,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 84 transitions. [2022-04-28 02:48:54,041 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 84 transitions. [2022-04-28 02:48:54,111 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:48:54,112 INFO L225 Difference]: With dead ends: 84 [2022-04-28 02:48:54,112 INFO L226 Difference]: Without dead ends: 78 [2022-04-28 02:48:54,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 681 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=4358, Invalid=5542, Unknown=0, NotChecked=0, Total=9900 [2022-04-28 02:48:54,115 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 72 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:48:54,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 24 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:48:54,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-04-28 02:48:54,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2022-04-28 02:48:54,347 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:48:54,347 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand has 77 states, 72 states have (on average 1.0138888888888888) internal successors, (73), 72 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:54,347 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand has 77 states, 72 states have (on average 1.0138888888888888) internal successors, (73), 72 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:54,347 INFO L87 Difference]: Start difference. First operand 78 states. Second operand has 77 states, 72 states have (on average 1.0138888888888888) internal successors, (73), 72 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:54,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:48:54,348 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2022-04-28 02:48:54,349 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2022-04-28 02:48:54,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:48:54,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:48:54,349 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 72 states have (on average 1.0138888888888888) internal successors, (73), 72 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 78 states. [2022-04-28 02:48:54,349 INFO L87 Difference]: Start difference. First operand has 77 states, 72 states have (on average 1.0138888888888888) internal successors, (73), 72 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 78 states. [2022-04-28 02:48:54,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:48:54,350 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2022-04-28 02:48:54,350 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2022-04-28 02:48:54,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:48:54,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:48:54,350 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:48:54,350 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:48:54,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 72 states have (on average 1.0138888888888888) internal successors, (73), 72 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:54,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2022-04-28 02:48:54,352 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 74 [2022-04-28 02:48:54,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:48:54,352 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2022-04-28 02:48:54,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.0) internal successors, (70), 34 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:54,352 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 77 states and 77 transitions. [2022-04-28 02:48:54,433 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:48:54,433 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2022-04-28 02:48:54,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-28 02:48:54,433 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:48:54,433 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:48:54,452 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2022-04-28 02:48:54,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:48:54,643 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:48:54,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:48:54,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1768314810, now seen corresponding path program 63 times [2022-04-28 02:48:54,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:48:54,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1755132382] [2022-04-28 02:48:54,646 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:48:54,646 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:48:54,646 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:48:54,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1768314810, now seen corresponding path program 64 times [2022-04-28 02:48:54,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:48:54,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148865570] [2022-04-28 02:48:54,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:48:54,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:48:54,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:48:55,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:48:55,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:48:55,197 INFO L290 TraceCheckUtils]: 0: Hoare triple {19923#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {19885#true} is VALID [2022-04-28 02:48:55,198 INFO L290 TraceCheckUtils]: 1: Hoare triple {19885#true} assume true; {19885#true} is VALID [2022-04-28 02:48:55,198 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19885#true} {19885#true} #39#return; {19885#true} is VALID [2022-04-28 02:48:55,198 INFO L272 TraceCheckUtils]: 0: Hoare triple {19885#true} call ULTIMATE.init(); {19923#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:48:55,198 INFO L290 TraceCheckUtils]: 1: Hoare triple {19923#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {19885#true} is VALID [2022-04-28 02:48:55,198 INFO L290 TraceCheckUtils]: 2: Hoare triple {19885#true} assume true; {19885#true} is VALID [2022-04-28 02:48:55,198 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19885#true} {19885#true} #39#return; {19885#true} is VALID [2022-04-28 02:48:55,198 INFO L272 TraceCheckUtils]: 4: Hoare triple {19885#true} call #t~ret6 := main(); {19885#true} is VALID [2022-04-28 02:48:55,198 INFO L290 TraceCheckUtils]: 5: Hoare triple {19885#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {19890#(= main_~i~0 0)} is VALID [2022-04-28 02:48:55,199 INFO L290 TraceCheckUtils]: 6: Hoare triple {19890#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19890#(= main_~i~0 0)} is VALID [2022-04-28 02:48:55,199 INFO L290 TraceCheckUtils]: 7: Hoare triple {19890#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19891#(<= main_~i~0 1)} is VALID [2022-04-28 02:48:55,199 INFO L290 TraceCheckUtils]: 8: Hoare triple {19891#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19891#(<= main_~i~0 1)} is VALID [2022-04-28 02:48:55,200 INFO L290 TraceCheckUtils]: 9: Hoare triple {19891#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19892#(<= main_~i~0 2)} is VALID [2022-04-28 02:48:55,200 INFO L290 TraceCheckUtils]: 10: Hoare triple {19892#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19892#(<= main_~i~0 2)} is VALID [2022-04-28 02:48:55,200 INFO L290 TraceCheckUtils]: 11: Hoare triple {19892#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19893#(<= main_~i~0 3)} is VALID [2022-04-28 02:48:55,201 INFO L290 TraceCheckUtils]: 12: Hoare triple {19893#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19893#(<= main_~i~0 3)} is VALID [2022-04-28 02:48:55,201 INFO L290 TraceCheckUtils]: 13: Hoare triple {19893#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19894#(<= main_~i~0 4)} is VALID [2022-04-28 02:48:55,201 INFO L290 TraceCheckUtils]: 14: Hoare triple {19894#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19894#(<= main_~i~0 4)} is VALID [2022-04-28 02:48:55,201 INFO L290 TraceCheckUtils]: 15: Hoare triple {19894#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19895#(<= main_~i~0 5)} is VALID [2022-04-28 02:48:55,202 INFO L290 TraceCheckUtils]: 16: Hoare triple {19895#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19895#(<= main_~i~0 5)} is VALID [2022-04-28 02:48:55,202 INFO L290 TraceCheckUtils]: 17: Hoare triple {19895#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19896#(<= main_~i~0 6)} is VALID [2022-04-28 02:48:55,202 INFO L290 TraceCheckUtils]: 18: Hoare triple {19896#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19896#(<= main_~i~0 6)} is VALID [2022-04-28 02:48:55,203 INFO L290 TraceCheckUtils]: 19: Hoare triple {19896#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19897#(<= main_~i~0 7)} is VALID [2022-04-28 02:48:55,203 INFO L290 TraceCheckUtils]: 20: Hoare triple {19897#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19897#(<= main_~i~0 7)} is VALID [2022-04-28 02:48:55,203 INFO L290 TraceCheckUtils]: 21: Hoare triple {19897#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19898#(<= main_~i~0 8)} is VALID [2022-04-28 02:48:55,204 INFO L290 TraceCheckUtils]: 22: Hoare triple {19898#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19898#(<= main_~i~0 8)} is VALID [2022-04-28 02:48:55,204 INFO L290 TraceCheckUtils]: 23: Hoare triple {19898#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19899#(<= main_~i~0 9)} is VALID [2022-04-28 02:48:55,204 INFO L290 TraceCheckUtils]: 24: Hoare triple {19899#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19899#(<= main_~i~0 9)} is VALID [2022-04-28 02:48:55,205 INFO L290 TraceCheckUtils]: 25: Hoare triple {19899#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19900#(<= main_~i~0 10)} is VALID [2022-04-28 02:48:55,205 INFO L290 TraceCheckUtils]: 26: Hoare triple {19900#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19900#(<= main_~i~0 10)} is VALID [2022-04-28 02:48:55,205 INFO L290 TraceCheckUtils]: 27: Hoare triple {19900#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19901#(<= main_~i~0 11)} is VALID [2022-04-28 02:48:55,206 INFO L290 TraceCheckUtils]: 28: Hoare triple {19901#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19901#(<= main_~i~0 11)} is VALID [2022-04-28 02:48:55,206 INFO L290 TraceCheckUtils]: 29: Hoare triple {19901#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19902#(<= main_~i~0 12)} is VALID [2022-04-28 02:48:55,207 INFO L290 TraceCheckUtils]: 30: Hoare triple {19902#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19902#(<= main_~i~0 12)} is VALID [2022-04-28 02:48:55,207 INFO L290 TraceCheckUtils]: 31: Hoare triple {19902#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19903#(<= main_~i~0 13)} is VALID [2022-04-28 02:48:55,207 INFO L290 TraceCheckUtils]: 32: Hoare triple {19903#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19903#(<= main_~i~0 13)} is VALID [2022-04-28 02:48:55,208 INFO L290 TraceCheckUtils]: 33: Hoare triple {19903#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19904#(<= main_~i~0 14)} is VALID [2022-04-28 02:48:55,208 INFO L290 TraceCheckUtils]: 34: Hoare triple {19904#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19904#(<= main_~i~0 14)} is VALID [2022-04-28 02:48:55,209 INFO L290 TraceCheckUtils]: 35: Hoare triple {19904#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19905#(<= main_~i~0 15)} is VALID [2022-04-28 02:48:55,209 INFO L290 TraceCheckUtils]: 36: Hoare triple {19905#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19905#(<= main_~i~0 15)} is VALID [2022-04-28 02:48:55,209 INFO L290 TraceCheckUtils]: 37: Hoare triple {19905#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19906#(<= main_~i~0 16)} is VALID [2022-04-28 02:48:55,210 INFO L290 TraceCheckUtils]: 38: Hoare triple {19906#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19906#(<= main_~i~0 16)} is VALID [2022-04-28 02:48:55,210 INFO L290 TraceCheckUtils]: 39: Hoare triple {19906#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19907#(<= main_~i~0 17)} is VALID [2022-04-28 02:48:55,210 INFO L290 TraceCheckUtils]: 40: Hoare triple {19907#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19907#(<= main_~i~0 17)} is VALID [2022-04-28 02:48:55,211 INFO L290 TraceCheckUtils]: 41: Hoare triple {19907#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19908#(<= main_~i~0 18)} is VALID [2022-04-28 02:48:55,211 INFO L290 TraceCheckUtils]: 42: Hoare triple {19908#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19908#(<= main_~i~0 18)} is VALID [2022-04-28 02:48:55,212 INFO L290 TraceCheckUtils]: 43: Hoare triple {19908#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19909#(<= main_~i~0 19)} is VALID [2022-04-28 02:48:55,212 INFO L290 TraceCheckUtils]: 44: Hoare triple {19909#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19909#(<= main_~i~0 19)} is VALID [2022-04-28 02:48:55,213 INFO L290 TraceCheckUtils]: 45: Hoare triple {19909#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19910#(<= main_~i~0 20)} is VALID [2022-04-28 02:48:55,213 INFO L290 TraceCheckUtils]: 46: Hoare triple {19910#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19910#(<= main_~i~0 20)} is VALID [2022-04-28 02:48:55,213 INFO L290 TraceCheckUtils]: 47: Hoare triple {19910#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19911#(<= main_~i~0 21)} is VALID [2022-04-28 02:48:55,214 INFO L290 TraceCheckUtils]: 48: Hoare triple {19911#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19911#(<= main_~i~0 21)} is VALID [2022-04-28 02:48:55,214 INFO L290 TraceCheckUtils]: 49: Hoare triple {19911#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19912#(<= main_~i~0 22)} is VALID [2022-04-28 02:48:55,214 INFO L290 TraceCheckUtils]: 50: Hoare triple {19912#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19912#(<= main_~i~0 22)} is VALID [2022-04-28 02:48:55,215 INFO L290 TraceCheckUtils]: 51: Hoare triple {19912#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19913#(<= main_~i~0 23)} is VALID [2022-04-28 02:48:55,215 INFO L290 TraceCheckUtils]: 52: Hoare triple {19913#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19913#(<= main_~i~0 23)} is VALID [2022-04-28 02:48:55,216 INFO L290 TraceCheckUtils]: 53: Hoare triple {19913#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19914#(<= main_~i~0 24)} is VALID [2022-04-28 02:48:55,216 INFO L290 TraceCheckUtils]: 54: Hoare triple {19914#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19914#(<= main_~i~0 24)} is VALID [2022-04-28 02:48:55,216 INFO L290 TraceCheckUtils]: 55: Hoare triple {19914#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19915#(<= main_~i~0 25)} is VALID [2022-04-28 02:48:55,217 INFO L290 TraceCheckUtils]: 56: Hoare triple {19915#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19915#(<= main_~i~0 25)} is VALID [2022-04-28 02:48:55,217 INFO L290 TraceCheckUtils]: 57: Hoare triple {19915#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19916#(<= main_~i~0 26)} is VALID [2022-04-28 02:48:55,218 INFO L290 TraceCheckUtils]: 58: Hoare triple {19916#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19916#(<= main_~i~0 26)} is VALID [2022-04-28 02:48:55,218 INFO L290 TraceCheckUtils]: 59: Hoare triple {19916#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19917#(<= main_~i~0 27)} is VALID [2022-04-28 02:48:55,218 INFO L290 TraceCheckUtils]: 60: Hoare triple {19917#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19917#(<= main_~i~0 27)} is VALID [2022-04-28 02:48:55,219 INFO L290 TraceCheckUtils]: 61: Hoare triple {19917#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19918#(<= main_~i~0 28)} is VALID [2022-04-28 02:48:55,219 INFO L290 TraceCheckUtils]: 62: Hoare triple {19918#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19918#(<= main_~i~0 28)} is VALID [2022-04-28 02:48:55,220 INFO L290 TraceCheckUtils]: 63: Hoare triple {19918#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19919#(<= main_~i~0 29)} is VALID [2022-04-28 02:48:55,220 INFO L290 TraceCheckUtils]: 64: Hoare triple {19919#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19919#(<= main_~i~0 29)} is VALID [2022-04-28 02:48:55,220 INFO L290 TraceCheckUtils]: 65: Hoare triple {19919#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19920#(<= main_~i~0 30)} is VALID [2022-04-28 02:48:55,221 INFO L290 TraceCheckUtils]: 66: Hoare triple {19920#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19920#(<= main_~i~0 30)} is VALID [2022-04-28 02:48:55,221 INFO L290 TraceCheckUtils]: 67: Hoare triple {19920#(<= main_~i~0 30)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19921#(<= main_~i~0 31)} is VALID [2022-04-28 02:48:55,221 INFO L290 TraceCheckUtils]: 68: Hoare triple {19921#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19921#(<= main_~i~0 31)} is VALID [2022-04-28 02:48:55,222 INFO L290 TraceCheckUtils]: 69: Hoare triple {19921#(<= main_~i~0 31)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19922#(<= main_~i~0 32)} is VALID [2022-04-28 02:48:55,222 INFO L290 TraceCheckUtils]: 70: Hoare triple {19922#(<= main_~i~0 32)} assume !(~i~0 < 1024); {19886#false} is VALID [2022-04-28 02:48:55,222 INFO L290 TraceCheckUtils]: 71: Hoare triple {19886#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {19886#false} is VALID [2022-04-28 02:48:55,223 INFO L272 TraceCheckUtils]: 72: Hoare triple {19886#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {19886#false} is VALID [2022-04-28 02:48:55,223 INFO L290 TraceCheckUtils]: 73: Hoare triple {19886#false} ~cond := #in~cond; {19886#false} is VALID [2022-04-28 02:48:55,223 INFO L290 TraceCheckUtils]: 74: Hoare triple {19886#false} assume 0 == ~cond; {19886#false} is VALID [2022-04-28 02:48:55,223 INFO L290 TraceCheckUtils]: 75: Hoare triple {19886#false} assume !false; {19886#false} is VALID [2022-04-28 02:48:55,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:48:55,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:48:55,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148865570] [2022-04-28 02:48:55,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148865570] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:48:55,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854161955] [2022-04-28 02:48:55,224 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 02:48:55,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:48:55,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:48:55,226 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:48:55,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-04-28 02:48:55,375 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 02:48:55,375 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:48:55,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 34 conjunts are in the unsatisfiable core [2022-04-28 02:48:55,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:48:55,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:48:55,793 INFO L272 TraceCheckUtils]: 0: Hoare triple {19885#true} call ULTIMATE.init(); {19885#true} is VALID [2022-04-28 02:48:55,793 INFO L290 TraceCheckUtils]: 1: Hoare triple {19885#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {19885#true} is VALID [2022-04-28 02:48:55,793 INFO L290 TraceCheckUtils]: 2: Hoare triple {19885#true} assume true; {19885#true} is VALID [2022-04-28 02:48:55,794 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19885#true} {19885#true} #39#return; {19885#true} is VALID [2022-04-28 02:48:55,794 INFO L272 TraceCheckUtils]: 4: Hoare triple {19885#true} call #t~ret6 := main(); {19885#true} is VALID [2022-04-28 02:48:55,794 INFO L290 TraceCheckUtils]: 5: Hoare triple {19885#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {19942#(<= main_~i~0 0)} is VALID [2022-04-28 02:48:55,794 INFO L290 TraceCheckUtils]: 6: Hoare triple {19942#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19942#(<= main_~i~0 0)} is VALID [2022-04-28 02:48:55,795 INFO L290 TraceCheckUtils]: 7: Hoare triple {19942#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19891#(<= main_~i~0 1)} is VALID [2022-04-28 02:48:55,795 INFO L290 TraceCheckUtils]: 8: Hoare triple {19891#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19891#(<= main_~i~0 1)} is VALID [2022-04-28 02:48:55,795 INFO L290 TraceCheckUtils]: 9: Hoare triple {19891#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19892#(<= main_~i~0 2)} is VALID [2022-04-28 02:48:55,796 INFO L290 TraceCheckUtils]: 10: Hoare triple {19892#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19892#(<= main_~i~0 2)} is VALID [2022-04-28 02:48:55,796 INFO L290 TraceCheckUtils]: 11: Hoare triple {19892#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19893#(<= main_~i~0 3)} is VALID [2022-04-28 02:48:55,796 INFO L290 TraceCheckUtils]: 12: Hoare triple {19893#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19893#(<= main_~i~0 3)} is VALID [2022-04-28 02:48:55,796 INFO L290 TraceCheckUtils]: 13: Hoare triple {19893#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19894#(<= main_~i~0 4)} is VALID [2022-04-28 02:48:55,797 INFO L290 TraceCheckUtils]: 14: Hoare triple {19894#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19894#(<= main_~i~0 4)} is VALID [2022-04-28 02:48:55,797 INFO L290 TraceCheckUtils]: 15: Hoare triple {19894#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19895#(<= main_~i~0 5)} is VALID [2022-04-28 02:48:55,797 INFO L290 TraceCheckUtils]: 16: Hoare triple {19895#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19895#(<= main_~i~0 5)} is VALID [2022-04-28 02:48:55,798 INFO L290 TraceCheckUtils]: 17: Hoare triple {19895#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19896#(<= main_~i~0 6)} is VALID [2022-04-28 02:48:55,798 INFO L290 TraceCheckUtils]: 18: Hoare triple {19896#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19896#(<= main_~i~0 6)} is VALID [2022-04-28 02:48:55,798 INFO L290 TraceCheckUtils]: 19: Hoare triple {19896#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19897#(<= main_~i~0 7)} is VALID [2022-04-28 02:48:55,799 INFO L290 TraceCheckUtils]: 20: Hoare triple {19897#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19897#(<= main_~i~0 7)} is VALID [2022-04-28 02:48:55,799 INFO L290 TraceCheckUtils]: 21: Hoare triple {19897#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19898#(<= main_~i~0 8)} is VALID [2022-04-28 02:48:55,799 INFO L290 TraceCheckUtils]: 22: Hoare triple {19898#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19898#(<= main_~i~0 8)} is VALID [2022-04-28 02:48:55,800 INFO L290 TraceCheckUtils]: 23: Hoare triple {19898#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19899#(<= main_~i~0 9)} is VALID [2022-04-28 02:48:55,800 INFO L290 TraceCheckUtils]: 24: Hoare triple {19899#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19899#(<= main_~i~0 9)} is VALID [2022-04-28 02:48:55,800 INFO L290 TraceCheckUtils]: 25: Hoare triple {19899#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19900#(<= main_~i~0 10)} is VALID [2022-04-28 02:48:55,800 INFO L290 TraceCheckUtils]: 26: Hoare triple {19900#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19900#(<= main_~i~0 10)} is VALID [2022-04-28 02:48:55,801 INFO L290 TraceCheckUtils]: 27: Hoare triple {19900#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19901#(<= main_~i~0 11)} is VALID [2022-04-28 02:48:55,801 INFO L290 TraceCheckUtils]: 28: Hoare triple {19901#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19901#(<= main_~i~0 11)} is VALID [2022-04-28 02:48:55,801 INFO L290 TraceCheckUtils]: 29: Hoare triple {19901#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19902#(<= main_~i~0 12)} is VALID [2022-04-28 02:48:55,802 INFO L290 TraceCheckUtils]: 30: Hoare triple {19902#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19902#(<= main_~i~0 12)} is VALID [2022-04-28 02:48:55,802 INFO L290 TraceCheckUtils]: 31: Hoare triple {19902#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19903#(<= main_~i~0 13)} is VALID [2022-04-28 02:48:55,802 INFO L290 TraceCheckUtils]: 32: Hoare triple {19903#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19903#(<= main_~i~0 13)} is VALID [2022-04-28 02:48:55,803 INFO L290 TraceCheckUtils]: 33: Hoare triple {19903#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19904#(<= main_~i~0 14)} is VALID [2022-04-28 02:48:55,803 INFO L290 TraceCheckUtils]: 34: Hoare triple {19904#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19904#(<= main_~i~0 14)} is VALID [2022-04-28 02:48:55,803 INFO L290 TraceCheckUtils]: 35: Hoare triple {19904#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19905#(<= main_~i~0 15)} is VALID [2022-04-28 02:48:55,803 INFO L290 TraceCheckUtils]: 36: Hoare triple {19905#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19905#(<= main_~i~0 15)} is VALID [2022-04-28 02:48:55,804 INFO L290 TraceCheckUtils]: 37: Hoare triple {19905#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19906#(<= main_~i~0 16)} is VALID [2022-04-28 02:48:55,804 INFO L290 TraceCheckUtils]: 38: Hoare triple {19906#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19906#(<= main_~i~0 16)} is VALID [2022-04-28 02:48:55,804 INFO L290 TraceCheckUtils]: 39: Hoare triple {19906#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19907#(<= main_~i~0 17)} is VALID [2022-04-28 02:48:55,805 INFO L290 TraceCheckUtils]: 40: Hoare triple {19907#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19907#(<= main_~i~0 17)} is VALID [2022-04-28 02:48:55,805 INFO L290 TraceCheckUtils]: 41: Hoare triple {19907#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19908#(<= main_~i~0 18)} is VALID [2022-04-28 02:48:55,805 INFO L290 TraceCheckUtils]: 42: Hoare triple {19908#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19908#(<= main_~i~0 18)} is VALID [2022-04-28 02:48:55,806 INFO L290 TraceCheckUtils]: 43: Hoare triple {19908#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19909#(<= main_~i~0 19)} is VALID [2022-04-28 02:48:55,806 INFO L290 TraceCheckUtils]: 44: Hoare triple {19909#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19909#(<= main_~i~0 19)} is VALID [2022-04-28 02:48:55,806 INFO L290 TraceCheckUtils]: 45: Hoare triple {19909#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19910#(<= main_~i~0 20)} is VALID [2022-04-28 02:48:55,807 INFO L290 TraceCheckUtils]: 46: Hoare triple {19910#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19910#(<= main_~i~0 20)} is VALID [2022-04-28 02:48:55,807 INFO L290 TraceCheckUtils]: 47: Hoare triple {19910#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19911#(<= main_~i~0 21)} is VALID [2022-04-28 02:48:55,807 INFO L290 TraceCheckUtils]: 48: Hoare triple {19911#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19911#(<= main_~i~0 21)} is VALID [2022-04-28 02:48:55,807 INFO L290 TraceCheckUtils]: 49: Hoare triple {19911#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19912#(<= main_~i~0 22)} is VALID [2022-04-28 02:48:55,808 INFO L290 TraceCheckUtils]: 50: Hoare triple {19912#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19912#(<= main_~i~0 22)} is VALID [2022-04-28 02:48:55,808 INFO L290 TraceCheckUtils]: 51: Hoare triple {19912#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19913#(<= main_~i~0 23)} is VALID [2022-04-28 02:48:55,808 INFO L290 TraceCheckUtils]: 52: Hoare triple {19913#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19913#(<= main_~i~0 23)} is VALID [2022-04-28 02:48:55,809 INFO L290 TraceCheckUtils]: 53: Hoare triple {19913#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19914#(<= main_~i~0 24)} is VALID [2022-04-28 02:48:55,809 INFO L290 TraceCheckUtils]: 54: Hoare triple {19914#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19914#(<= main_~i~0 24)} is VALID [2022-04-28 02:48:55,809 INFO L290 TraceCheckUtils]: 55: Hoare triple {19914#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19915#(<= main_~i~0 25)} is VALID [2022-04-28 02:48:55,810 INFO L290 TraceCheckUtils]: 56: Hoare triple {19915#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19915#(<= main_~i~0 25)} is VALID [2022-04-28 02:48:55,810 INFO L290 TraceCheckUtils]: 57: Hoare triple {19915#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19916#(<= main_~i~0 26)} is VALID [2022-04-28 02:48:55,810 INFO L290 TraceCheckUtils]: 58: Hoare triple {19916#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19916#(<= main_~i~0 26)} is VALID [2022-04-28 02:48:55,811 INFO L290 TraceCheckUtils]: 59: Hoare triple {19916#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19917#(<= main_~i~0 27)} is VALID [2022-04-28 02:48:55,811 INFO L290 TraceCheckUtils]: 60: Hoare triple {19917#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19917#(<= main_~i~0 27)} is VALID [2022-04-28 02:48:55,811 INFO L290 TraceCheckUtils]: 61: Hoare triple {19917#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19918#(<= main_~i~0 28)} is VALID [2022-04-28 02:48:55,811 INFO L290 TraceCheckUtils]: 62: Hoare triple {19918#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19918#(<= main_~i~0 28)} is VALID [2022-04-28 02:48:55,812 INFO L290 TraceCheckUtils]: 63: Hoare triple {19918#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19919#(<= main_~i~0 29)} is VALID [2022-04-28 02:48:55,812 INFO L290 TraceCheckUtils]: 64: Hoare triple {19919#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19919#(<= main_~i~0 29)} is VALID [2022-04-28 02:48:55,812 INFO L290 TraceCheckUtils]: 65: Hoare triple {19919#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19920#(<= main_~i~0 30)} is VALID [2022-04-28 02:48:55,813 INFO L290 TraceCheckUtils]: 66: Hoare triple {19920#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19920#(<= main_~i~0 30)} is VALID [2022-04-28 02:48:55,813 INFO L290 TraceCheckUtils]: 67: Hoare triple {19920#(<= main_~i~0 30)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19921#(<= main_~i~0 31)} is VALID [2022-04-28 02:48:55,813 INFO L290 TraceCheckUtils]: 68: Hoare triple {19921#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19921#(<= main_~i~0 31)} is VALID [2022-04-28 02:48:55,814 INFO L290 TraceCheckUtils]: 69: Hoare triple {19921#(<= main_~i~0 31)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19922#(<= main_~i~0 32)} is VALID [2022-04-28 02:48:55,814 INFO L290 TraceCheckUtils]: 70: Hoare triple {19922#(<= main_~i~0 32)} assume !(~i~0 < 1024); {19886#false} is VALID [2022-04-28 02:48:55,814 INFO L290 TraceCheckUtils]: 71: Hoare triple {19886#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {19886#false} is VALID [2022-04-28 02:48:55,814 INFO L272 TraceCheckUtils]: 72: Hoare triple {19886#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {19886#false} is VALID [2022-04-28 02:48:55,814 INFO L290 TraceCheckUtils]: 73: Hoare triple {19886#false} ~cond := #in~cond; {19886#false} is VALID [2022-04-28 02:48:55,814 INFO L290 TraceCheckUtils]: 74: Hoare triple {19886#false} assume 0 == ~cond; {19886#false} is VALID [2022-04-28 02:48:55,814 INFO L290 TraceCheckUtils]: 75: Hoare triple {19886#false} assume !false; {19886#false} is VALID [2022-04-28 02:48:55,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:48:55,815 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:48:57,224 INFO L290 TraceCheckUtils]: 75: Hoare triple {19886#false} assume !false; {19886#false} is VALID [2022-04-28 02:48:57,225 INFO L290 TraceCheckUtils]: 74: Hoare triple {19886#false} assume 0 == ~cond; {19886#false} is VALID [2022-04-28 02:48:57,225 INFO L290 TraceCheckUtils]: 73: Hoare triple {19886#false} ~cond := #in~cond; {19886#false} is VALID [2022-04-28 02:48:57,225 INFO L272 TraceCheckUtils]: 72: Hoare triple {19886#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {19886#false} is VALID [2022-04-28 02:48:57,225 INFO L290 TraceCheckUtils]: 71: Hoare triple {19886#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {19886#false} is VALID [2022-04-28 02:48:57,225 INFO L290 TraceCheckUtils]: 70: Hoare triple {20168#(< main_~i~0 1024)} assume !(~i~0 < 1024); {19886#false} is VALID [2022-04-28 02:48:57,225 INFO L290 TraceCheckUtils]: 69: Hoare triple {20172#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20168#(< main_~i~0 1024)} is VALID [2022-04-28 02:48:57,226 INFO L290 TraceCheckUtils]: 68: Hoare triple {20172#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20172#(< main_~i~0 1023)} is VALID [2022-04-28 02:48:57,226 INFO L290 TraceCheckUtils]: 67: Hoare triple {20179#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20172#(< main_~i~0 1023)} is VALID [2022-04-28 02:48:57,226 INFO L290 TraceCheckUtils]: 66: Hoare triple {20179#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20179#(< main_~i~0 1022)} is VALID [2022-04-28 02:48:57,227 INFO L290 TraceCheckUtils]: 65: Hoare triple {20186#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20179#(< main_~i~0 1022)} is VALID [2022-04-28 02:48:57,227 INFO L290 TraceCheckUtils]: 64: Hoare triple {20186#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20186#(< main_~i~0 1021)} is VALID [2022-04-28 02:48:57,227 INFO L290 TraceCheckUtils]: 63: Hoare triple {20193#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20186#(< main_~i~0 1021)} is VALID [2022-04-28 02:48:57,228 INFO L290 TraceCheckUtils]: 62: Hoare triple {20193#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20193#(< main_~i~0 1020)} is VALID [2022-04-28 02:48:57,228 INFO L290 TraceCheckUtils]: 61: Hoare triple {20200#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20193#(< main_~i~0 1020)} is VALID [2022-04-28 02:48:57,228 INFO L290 TraceCheckUtils]: 60: Hoare triple {20200#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20200#(< main_~i~0 1019)} is VALID [2022-04-28 02:48:57,228 INFO L290 TraceCheckUtils]: 59: Hoare triple {20207#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20200#(< main_~i~0 1019)} is VALID [2022-04-28 02:48:57,229 INFO L290 TraceCheckUtils]: 58: Hoare triple {20207#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20207#(< main_~i~0 1018)} is VALID [2022-04-28 02:48:57,229 INFO L290 TraceCheckUtils]: 57: Hoare triple {20214#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20207#(< main_~i~0 1018)} is VALID [2022-04-28 02:48:57,229 INFO L290 TraceCheckUtils]: 56: Hoare triple {20214#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20214#(< main_~i~0 1017)} is VALID [2022-04-28 02:48:57,230 INFO L290 TraceCheckUtils]: 55: Hoare triple {20221#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20214#(< main_~i~0 1017)} is VALID [2022-04-28 02:48:57,230 INFO L290 TraceCheckUtils]: 54: Hoare triple {20221#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20221#(< main_~i~0 1016)} is VALID [2022-04-28 02:48:57,230 INFO L290 TraceCheckUtils]: 53: Hoare triple {20228#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20221#(< main_~i~0 1016)} is VALID [2022-04-28 02:48:57,231 INFO L290 TraceCheckUtils]: 52: Hoare triple {20228#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20228#(< main_~i~0 1015)} is VALID [2022-04-28 02:48:57,231 INFO L290 TraceCheckUtils]: 51: Hoare triple {20235#(< main_~i~0 1014)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20228#(< main_~i~0 1015)} is VALID [2022-04-28 02:48:57,231 INFO L290 TraceCheckUtils]: 50: Hoare triple {20235#(< main_~i~0 1014)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20235#(< main_~i~0 1014)} is VALID [2022-04-28 02:48:57,232 INFO L290 TraceCheckUtils]: 49: Hoare triple {20242#(< main_~i~0 1013)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20235#(< main_~i~0 1014)} is VALID [2022-04-28 02:48:57,232 INFO L290 TraceCheckUtils]: 48: Hoare triple {20242#(< main_~i~0 1013)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20242#(< main_~i~0 1013)} is VALID [2022-04-28 02:48:57,232 INFO L290 TraceCheckUtils]: 47: Hoare triple {20249#(< main_~i~0 1012)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20242#(< main_~i~0 1013)} is VALID [2022-04-28 02:48:57,232 INFO L290 TraceCheckUtils]: 46: Hoare triple {20249#(< main_~i~0 1012)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20249#(< main_~i~0 1012)} is VALID [2022-04-28 02:48:57,233 INFO L290 TraceCheckUtils]: 45: Hoare triple {20256#(< main_~i~0 1011)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20249#(< main_~i~0 1012)} is VALID [2022-04-28 02:48:57,233 INFO L290 TraceCheckUtils]: 44: Hoare triple {20256#(< main_~i~0 1011)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20256#(< main_~i~0 1011)} is VALID [2022-04-28 02:48:57,233 INFO L290 TraceCheckUtils]: 43: Hoare triple {20263#(< main_~i~0 1010)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20256#(< main_~i~0 1011)} is VALID [2022-04-28 02:48:57,234 INFO L290 TraceCheckUtils]: 42: Hoare triple {20263#(< main_~i~0 1010)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20263#(< main_~i~0 1010)} is VALID [2022-04-28 02:48:57,234 INFO L290 TraceCheckUtils]: 41: Hoare triple {20270#(< main_~i~0 1009)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20263#(< main_~i~0 1010)} is VALID [2022-04-28 02:48:57,234 INFO L290 TraceCheckUtils]: 40: Hoare triple {20270#(< main_~i~0 1009)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20270#(< main_~i~0 1009)} is VALID [2022-04-28 02:48:57,235 INFO L290 TraceCheckUtils]: 39: Hoare triple {20277#(< main_~i~0 1008)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20270#(< main_~i~0 1009)} is VALID [2022-04-28 02:48:57,235 INFO L290 TraceCheckUtils]: 38: Hoare triple {20277#(< main_~i~0 1008)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20277#(< main_~i~0 1008)} is VALID [2022-04-28 02:48:57,235 INFO L290 TraceCheckUtils]: 37: Hoare triple {20284#(< main_~i~0 1007)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20277#(< main_~i~0 1008)} is VALID [2022-04-28 02:48:57,235 INFO L290 TraceCheckUtils]: 36: Hoare triple {20284#(< main_~i~0 1007)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20284#(< main_~i~0 1007)} is VALID [2022-04-28 02:48:57,236 INFO L290 TraceCheckUtils]: 35: Hoare triple {20291#(< main_~i~0 1006)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20284#(< main_~i~0 1007)} is VALID [2022-04-28 02:48:57,236 INFO L290 TraceCheckUtils]: 34: Hoare triple {20291#(< main_~i~0 1006)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20291#(< main_~i~0 1006)} is VALID [2022-04-28 02:48:57,236 INFO L290 TraceCheckUtils]: 33: Hoare triple {20298#(< main_~i~0 1005)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20291#(< main_~i~0 1006)} is VALID [2022-04-28 02:48:57,237 INFO L290 TraceCheckUtils]: 32: Hoare triple {20298#(< main_~i~0 1005)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20298#(< main_~i~0 1005)} is VALID [2022-04-28 02:48:57,237 INFO L290 TraceCheckUtils]: 31: Hoare triple {20305#(< main_~i~0 1004)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20298#(< main_~i~0 1005)} is VALID [2022-04-28 02:48:57,237 INFO L290 TraceCheckUtils]: 30: Hoare triple {20305#(< main_~i~0 1004)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20305#(< main_~i~0 1004)} is VALID [2022-04-28 02:48:57,238 INFO L290 TraceCheckUtils]: 29: Hoare triple {20312#(< main_~i~0 1003)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20305#(< main_~i~0 1004)} is VALID [2022-04-28 02:48:57,238 INFO L290 TraceCheckUtils]: 28: Hoare triple {20312#(< main_~i~0 1003)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20312#(< main_~i~0 1003)} is VALID [2022-04-28 02:48:57,238 INFO L290 TraceCheckUtils]: 27: Hoare triple {20319#(< main_~i~0 1002)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20312#(< main_~i~0 1003)} is VALID [2022-04-28 02:48:57,239 INFO L290 TraceCheckUtils]: 26: Hoare triple {20319#(< main_~i~0 1002)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20319#(< main_~i~0 1002)} is VALID [2022-04-28 02:48:57,239 INFO L290 TraceCheckUtils]: 25: Hoare triple {20326#(< main_~i~0 1001)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20319#(< main_~i~0 1002)} is VALID [2022-04-28 02:48:57,239 INFO L290 TraceCheckUtils]: 24: Hoare triple {20326#(< main_~i~0 1001)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20326#(< main_~i~0 1001)} is VALID [2022-04-28 02:48:57,240 INFO L290 TraceCheckUtils]: 23: Hoare triple {20333#(< main_~i~0 1000)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20326#(< main_~i~0 1001)} is VALID [2022-04-28 02:48:57,240 INFO L290 TraceCheckUtils]: 22: Hoare triple {20333#(< main_~i~0 1000)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20333#(< main_~i~0 1000)} is VALID [2022-04-28 02:48:57,240 INFO L290 TraceCheckUtils]: 21: Hoare triple {20340#(< main_~i~0 999)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20333#(< main_~i~0 1000)} is VALID [2022-04-28 02:48:57,240 INFO L290 TraceCheckUtils]: 20: Hoare triple {20340#(< main_~i~0 999)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20340#(< main_~i~0 999)} is VALID [2022-04-28 02:48:57,241 INFO L290 TraceCheckUtils]: 19: Hoare triple {20347#(< main_~i~0 998)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20340#(< main_~i~0 999)} is VALID [2022-04-28 02:48:57,241 INFO L290 TraceCheckUtils]: 18: Hoare triple {20347#(< main_~i~0 998)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20347#(< main_~i~0 998)} is VALID [2022-04-28 02:48:57,241 INFO L290 TraceCheckUtils]: 17: Hoare triple {20354#(< main_~i~0 997)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20347#(< main_~i~0 998)} is VALID [2022-04-28 02:48:57,242 INFO L290 TraceCheckUtils]: 16: Hoare triple {20354#(< main_~i~0 997)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20354#(< main_~i~0 997)} is VALID [2022-04-28 02:48:57,242 INFO L290 TraceCheckUtils]: 15: Hoare triple {20361#(< main_~i~0 996)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20354#(< main_~i~0 997)} is VALID [2022-04-28 02:48:57,242 INFO L290 TraceCheckUtils]: 14: Hoare triple {20361#(< main_~i~0 996)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20361#(< main_~i~0 996)} is VALID [2022-04-28 02:48:57,243 INFO L290 TraceCheckUtils]: 13: Hoare triple {20368#(< main_~i~0 995)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20361#(< main_~i~0 996)} is VALID [2022-04-28 02:48:57,243 INFO L290 TraceCheckUtils]: 12: Hoare triple {20368#(< main_~i~0 995)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20368#(< main_~i~0 995)} is VALID [2022-04-28 02:48:57,243 INFO L290 TraceCheckUtils]: 11: Hoare triple {20375#(< main_~i~0 994)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20368#(< main_~i~0 995)} is VALID [2022-04-28 02:48:57,244 INFO L290 TraceCheckUtils]: 10: Hoare triple {20375#(< main_~i~0 994)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20375#(< main_~i~0 994)} is VALID [2022-04-28 02:48:57,244 INFO L290 TraceCheckUtils]: 9: Hoare triple {20382#(< main_~i~0 993)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20375#(< main_~i~0 994)} is VALID [2022-04-28 02:48:57,244 INFO L290 TraceCheckUtils]: 8: Hoare triple {20382#(< main_~i~0 993)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20382#(< main_~i~0 993)} is VALID [2022-04-28 02:48:57,244 INFO L290 TraceCheckUtils]: 7: Hoare triple {20389#(< main_~i~0 992)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20382#(< main_~i~0 993)} is VALID [2022-04-28 02:48:57,245 INFO L290 TraceCheckUtils]: 6: Hoare triple {20389#(< main_~i~0 992)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20389#(< main_~i~0 992)} is VALID [2022-04-28 02:48:57,246 INFO L290 TraceCheckUtils]: 5: Hoare triple {19885#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {20389#(< main_~i~0 992)} is VALID [2022-04-28 02:48:57,246 INFO L272 TraceCheckUtils]: 4: Hoare triple {19885#true} call #t~ret6 := main(); {19885#true} is VALID [2022-04-28 02:48:57,246 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19885#true} {19885#true} #39#return; {19885#true} is VALID [2022-04-28 02:48:57,246 INFO L290 TraceCheckUtils]: 2: Hoare triple {19885#true} assume true; {19885#true} is VALID [2022-04-28 02:48:57,246 INFO L290 TraceCheckUtils]: 1: Hoare triple {19885#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {19885#true} is VALID [2022-04-28 02:48:57,246 INFO L272 TraceCheckUtils]: 0: Hoare triple {19885#true} call ULTIMATE.init(); {19885#true} is VALID [2022-04-28 02:48:57,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:48:57,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854161955] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:48:57,247 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:48:57,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35, 35] total 70 [2022-04-28 02:48:57,247 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:48:57,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1755132382] [2022-04-28 02:48:57,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1755132382] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:48:57,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:48:57,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-04-28 02:48:57,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451270573] [2022-04-28 02:48:57,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:48:57,248 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.0) internal successors, (72), 35 states have internal predecessors, (72), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 76 [2022-04-28 02:48:57,248 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:48:57,248 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 36 states, 36 states have (on average 2.0) internal successors, (72), 35 states have internal predecessors, (72), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:57,299 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:48:57,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-28 02:48:57,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:48:57,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-28 02:48:57,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2348, Invalid=2482, Unknown=0, NotChecked=0, Total=4830 [2022-04-28 02:48:57,300 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand has 36 states, 36 states have (on average 2.0) internal successors, (72), 35 states have internal predecessors, (72), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:58,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:48:58,220 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2022-04-28 02:48:58,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-28 02:48:58,221 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.0) internal successors, (72), 35 states have internal predecessors, (72), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 76 [2022-04-28 02:48:58,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:48:58,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 2.0) internal successors, (72), 35 states have internal predecessors, (72), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:58,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 86 transitions. [2022-04-28 02:48:58,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 2.0) internal successors, (72), 35 states have internal predecessors, (72), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:58,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 86 transitions. [2022-04-28 02:48:58,223 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 86 transitions. [2022-04-28 02:48:58,309 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:48:58,310 INFO L225 Difference]: With dead ends: 86 [2022-04-28 02:48:58,310 INFO L226 Difference]: Without dead ends: 80 [2022-04-28 02:48:58,312 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 719 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=4626, Invalid=5880, Unknown=0, NotChecked=0, Total=10506 [2022-04-28 02:48:58,312 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 74 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:48:58,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 29 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:48:58,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-04-28 02:48:58,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2022-04-28 02:48:58,545 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:48:58,545 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand has 79 states, 74 states have (on average 1.0135135135135136) internal successors, (75), 74 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:58,546 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand has 79 states, 74 states have (on average 1.0135135135135136) internal successors, (75), 74 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:58,546 INFO L87 Difference]: Start difference. First operand 80 states. Second operand has 79 states, 74 states have (on average 1.0135135135135136) internal successors, (75), 74 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:58,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:48:58,548 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2022-04-28 02:48:58,548 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2022-04-28 02:48:58,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:48:58,548 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:48:58,548 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 74 states have (on average 1.0135135135135136) internal successors, (75), 74 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 80 states. [2022-04-28 02:48:58,548 INFO L87 Difference]: Start difference. First operand has 79 states, 74 states have (on average 1.0135135135135136) internal successors, (75), 74 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 80 states. [2022-04-28 02:48:58,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:48:58,549 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2022-04-28 02:48:58,549 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2022-04-28 02:48:58,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:48:58,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:48:58,550 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:48:58,550 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:48:58,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 74 states have (on average 1.0135135135135136) internal successors, (75), 74 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:58,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2022-04-28 02:48:58,551 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 76 [2022-04-28 02:48:58,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:48:58,551 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2022-04-28 02:48:58,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.0) internal successors, (72), 35 states have internal predecessors, (72), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:48:58,551 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 79 states and 79 transitions. [2022-04-28 02:48:58,643 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:48:58,643 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2022-04-28 02:48:58,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-04-28 02:48:58,644 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:48:58,644 INFO L195 NwaCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:48:58,660 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2022-04-28 02:48:58,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:48:58,844 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:48:58,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:48:58,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1964362940, now seen corresponding path program 65 times [2022-04-28 02:48:58,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:48:58,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [4834395] [2022-04-28 02:48:58,846 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:48:58,847 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:48:58,847 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:48:58,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1964362940, now seen corresponding path program 66 times [2022-04-28 02:48:58,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:48:58,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331678702] [2022-04-28 02:48:58,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:48:58,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:48:58,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:48:59,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:48:59,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:48:59,432 INFO L290 TraceCheckUtils]: 0: Hoare triple {21008#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {20969#true} is VALID [2022-04-28 02:48:59,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {20969#true} assume true; {20969#true} is VALID [2022-04-28 02:48:59,432 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20969#true} {20969#true} #39#return; {20969#true} is VALID [2022-04-28 02:48:59,433 INFO L272 TraceCheckUtils]: 0: Hoare triple {20969#true} call ULTIMATE.init(); {21008#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:48:59,433 INFO L290 TraceCheckUtils]: 1: Hoare triple {21008#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {20969#true} is VALID [2022-04-28 02:48:59,433 INFO L290 TraceCheckUtils]: 2: Hoare triple {20969#true} assume true; {20969#true} is VALID [2022-04-28 02:48:59,433 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20969#true} {20969#true} #39#return; {20969#true} is VALID [2022-04-28 02:48:59,433 INFO L272 TraceCheckUtils]: 4: Hoare triple {20969#true} call #t~ret6 := main(); {20969#true} is VALID [2022-04-28 02:48:59,433 INFO L290 TraceCheckUtils]: 5: Hoare triple {20969#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {20974#(= main_~i~0 0)} is VALID [2022-04-28 02:48:59,434 INFO L290 TraceCheckUtils]: 6: Hoare triple {20974#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20974#(= main_~i~0 0)} is VALID [2022-04-28 02:48:59,434 INFO L290 TraceCheckUtils]: 7: Hoare triple {20974#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20975#(<= main_~i~0 1)} is VALID [2022-04-28 02:48:59,435 INFO L290 TraceCheckUtils]: 8: Hoare triple {20975#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20975#(<= main_~i~0 1)} is VALID [2022-04-28 02:48:59,435 INFO L290 TraceCheckUtils]: 9: Hoare triple {20975#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20976#(<= main_~i~0 2)} is VALID [2022-04-28 02:48:59,435 INFO L290 TraceCheckUtils]: 10: Hoare triple {20976#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20976#(<= main_~i~0 2)} is VALID [2022-04-28 02:48:59,436 INFO L290 TraceCheckUtils]: 11: Hoare triple {20976#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20977#(<= main_~i~0 3)} is VALID [2022-04-28 02:48:59,436 INFO L290 TraceCheckUtils]: 12: Hoare triple {20977#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20977#(<= main_~i~0 3)} is VALID [2022-04-28 02:48:59,437 INFO L290 TraceCheckUtils]: 13: Hoare triple {20977#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20978#(<= main_~i~0 4)} is VALID [2022-04-28 02:48:59,437 INFO L290 TraceCheckUtils]: 14: Hoare triple {20978#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20978#(<= main_~i~0 4)} is VALID [2022-04-28 02:48:59,437 INFO L290 TraceCheckUtils]: 15: Hoare triple {20978#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20979#(<= main_~i~0 5)} is VALID [2022-04-28 02:48:59,438 INFO L290 TraceCheckUtils]: 16: Hoare triple {20979#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20979#(<= main_~i~0 5)} is VALID [2022-04-28 02:48:59,438 INFO L290 TraceCheckUtils]: 17: Hoare triple {20979#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20980#(<= main_~i~0 6)} is VALID [2022-04-28 02:48:59,439 INFO L290 TraceCheckUtils]: 18: Hoare triple {20980#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20980#(<= main_~i~0 6)} is VALID [2022-04-28 02:48:59,439 INFO L290 TraceCheckUtils]: 19: Hoare triple {20980#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20981#(<= main_~i~0 7)} is VALID [2022-04-28 02:48:59,439 INFO L290 TraceCheckUtils]: 20: Hoare triple {20981#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20981#(<= main_~i~0 7)} is VALID [2022-04-28 02:48:59,440 INFO L290 TraceCheckUtils]: 21: Hoare triple {20981#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20982#(<= main_~i~0 8)} is VALID [2022-04-28 02:48:59,440 INFO L290 TraceCheckUtils]: 22: Hoare triple {20982#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20982#(<= main_~i~0 8)} is VALID [2022-04-28 02:48:59,441 INFO L290 TraceCheckUtils]: 23: Hoare triple {20982#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20983#(<= main_~i~0 9)} is VALID [2022-04-28 02:48:59,441 INFO L290 TraceCheckUtils]: 24: Hoare triple {20983#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20983#(<= main_~i~0 9)} is VALID [2022-04-28 02:48:59,441 INFO L290 TraceCheckUtils]: 25: Hoare triple {20983#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20984#(<= main_~i~0 10)} is VALID [2022-04-28 02:48:59,442 INFO L290 TraceCheckUtils]: 26: Hoare triple {20984#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20984#(<= main_~i~0 10)} is VALID [2022-04-28 02:48:59,442 INFO L290 TraceCheckUtils]: 27: Hoare triple {20984#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20985#(<= main_~i~0 11)} is VALID [2022-04-28 02:48:59,442 INFO L290 TraceCheckUtils]: 28: Hoare triple {20985#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20985#(<= main_~i~0 11)} is VALID [2022-04-28 02:48:59,443 INFO L290 TraceCheckUtils]: 29: Hoare triple {20985#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20986#(<= main_~i~0 12)} is VALID [2022-04-28 02:48:59,443 INFO L290 TraceCheckUtils]: 30: Hoare triple {20986#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20986#(<= main_~i~0 12)} is VALID [2022-04-28 02:48:59,444 INFO L290 TraceCheckUtils]: 31: Hoare triple {20986#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20987#(<= main_~i~0 13)} is VALID [2022-04-28 02:48:59,444 INFO L290 TraceCheckUtils]: 32: Hoare triple {20987#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20987#(<= main_~i~0 13)} is VALID [2022-04-28 02:48:59,445 INFO L290 TraceCheckUtils]: 33: Hoare triple {20987#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20988#(<= main_~i~0 14)} is VALID [2022-04-28 02:48:59,445 INFO L290 TraceCheckUtils]: 34: Hoare triple {20988#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20988#(<= main_~i~0 14)} is VALID [2022-04-28 02:48:59,445 INFO L290 TraceCheckUtils]: 35: Hoare triple {20988#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20989#(<= main_~i~0 15)} is VALID [2022-04-28 02:48:59,446 INFO L290 TraceCheckUtils]: 36: Hoare triple {20989#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20989#(<= main_~i~0 15)} is VALID [2022-04-28 02:48:59,446 INFO L290 TraceCheckUtils]: 37: Hoare triple {20989#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20990#(<= main_~i~0 16)} is VALID [2022-04-28 02:48:59,446 INFO L290 TraceCheckUtils]: 38: Hoare triple {20990#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20990#(<= main_~i~0 16)} is VALID [2022-04-28 02:48:59,447 INFO L290 TraceCheckUtils]: 39: Hoare triple {20990#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20991#(<= main_~i~0 17)} is VALID [2022-04-28 02:48:59,447 INFO L290 TraceCheckUtils]: 40: Hoare triple {20991#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20991#(<= main_~i~0 17)} is VALID [2022-04-28 02:48:59,448 INFO L290 TraceCheckUtils]: 41: Hoare triple {20991#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20992#(<= main_~i~0 18)} is VALID [2022-04-28 02:48:59,448 INFO L290 TraceCheckUtils]: 42: Hoare triple {20992#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20992#(<= main_~i~0 18)} is VALID [2022-04-28 02:48:59,448 INFO L290 TraceCheckUtils]: 43: Hoare triple {20992#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20993#(<= main_~i~0 19)} is VALID [2022-04-28 02:48:59,449 INFO L290 TraceCheckUtils]: 44: Hoare triple {20993#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20993#(<= main_~i~0 19)} is VALID [2022-04-28 02:48:59,449 INFO L290 TraceCheckUtils]: 45: Hoare triple {20993#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20994#(<= main_~i~0 20)} is VALID [2022-04-28 02:48:59,450 INFO L290 TraceCheckUtils]: 46: Hoare triple {20994#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20994#(<= main_~i~0 20)} is VALID [2022-04-28 02:48:59,450 INFO L290 TraceCheckUtils]: 47: Hoare triple {20994#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20995#(<= main_~i~0 21)} is VALID [2022-04-28 02:48:59,450 INFO L290 TraceCheckUtils]: 48: Hoare triple {20995#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20995#(<= main_~i~0 21)} is VALID [2022-04-28 02:48:59,451 INFO L290 TraceCheckUtils]: 49: Hoare triple {20995#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20996#(<= main_~i~0 22)} is VALID [2022-04-28 02:48:59,451 INFO L290 TraceCheckUtils]: 50: Hoare triple {20996#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20996#(<= main_~i~0 22)} is VALID [2022-04-28 02:48:59,451 INFO L290 TraceCheckUtils]: 51: Hoare triple {20996#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20997#(<= main_~i~0 23)} is VALID [2022-04-28 02:48:59,451 INFO L290 TraceCheckUtils]: 52: Hoare triple {20997#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20997#(<= main_~i~0 23)} is VALID [2022-04-28 02:48:59,452 INFO L290 TraceCheckUtils]: 53: Hoare triple {20997#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20998#(<= main_~i~0 24)} is VALID [2022-04-28 02:48:59,452 INFO L290 TraceCheckUtils]: 54: Hoare triple {20998#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20998#(<= main_~i~0 24)} is VALID [2022-04-28 02:48:59,452 INFO L290 TraceCheckUtils]: 55: Hoare triple {20998#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20999#(<= main_~i~0 25)} is VALID [2022-04-28 02:48:59,453 INFO L290 TraceCheckUtils]: 56: Hoare triple {20999#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20999#(<= main_~i~0 25)} is VALID [2022-04-28 02:48:59,453 INFO L290 TraceCheckUtils]: 57: Hoare triple {20999#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21000#(<= main_~i~0 26)} is VALID [2022-04-28 02:48:59,453 INFO L290 TraceCheckUtils]: 58: Hoare triple {21000#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21000#(<= main_~i~0 26)} is VALID [2022-04-28 02:48:59,454 INFO L290 TraceCheckUtils]: 59: Hoare triple {21000#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21001#(<= main_~i~0 27)} is VALID [2022-04-28 02:48:59,454 INFO L290 TraceCheckUtils]: 60: Hoare triple {21001#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21001#(<= main_~i~0 27)} is VALID [2022-04-28 02:48:59,454 INFO L290 TraceCheckUtils]: 61: Hoare triple {21001#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21002#(<= main_~i~0 28)} is VALID [2022-04-28 02:48:59,455 INFO L290 TraceCheckUtils]: 62: Hoare triple {21002#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21002#(<= main_~i~0 28)} is VALID [2022-04-28 02:48:59,455 INFO L290 TraceCheckUtils]: 63: Hoare triple {21002#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21003#(<= main_~i~0 29)} is VALID [2022-04-28 02:48:59,455 INFO L290 TraceCheckUtils]: 64: Hoare triple {21003#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21003#(<= main_~i~0 29)} is VALID [2022-04-28 02:48:59,456 INFO L290 TraceCheckUtils]: 65: Hoare triple {21003#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21004#(<= main_~i~0 30)} is VALID [2022-04-28 02:48:59,456 INFO L290 TraceCheckUtils]: 66: Hoare triple {21004#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21004#(<= main_~i~0 30)} is VALID [2022-04-28 02:48:59,456 INFO L290 TraceCheckUtils]: 67: Hoare triple {21004#(<= main_~i~0 30)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21005#(<= main_~i~0 31)} is VALID [2022-04-28 02:48:59,456 INFO L290 TraceCheckUtils]: 68: Hoare triple {21005#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21005#(<= main_~i~0 31)} is VALID [2022-04-28 02:48:59,457 INFO L290 TraceCheckUtils]: 69: Hoare triple {21005#(<= main_~i~0 31)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21006#(<= main_~i~0 32)} is VALID [2022-04-28 02:48:59,457 INFO L290 TraceCheckUtils]: 70: Hoare triple {21006#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21006#(<= main_~i~0 32)} is VALID [2022-04-28 02:48:59,457 INFO L290 TraceCheckUtils]: 71: Hoare triple {21006#(<= main_~i~0 32)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21007#(<= main_~i~0 33)} is VALID [2022-04-28 02:48:59,458 INFO L290 TraceCheckUtils]: 72: Hoare triple {21007#(<= main_~i~0 33)} assume !(~i~0 < 1024); {20970#false} is VALID [2022-04-28 02:48:59,458 INFO L290 TraceCheckUtils]: 73: Hoare triple {20970#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {20970#false} is VALID [2022-04-28 02:48:59,458 INFO L272 TraceCheckUtils]: 74: Hoare triple {20970#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {20970#false} is VALID [2022-04-28 02:48:59,458 INFO L290 TraceCheckUtils]: 75: Hoare triple {20970#false} ~cond := #in~cond; {20970#false} is VALID [2022-04-28 02:48:59,458 INFO L290 TraceCheckUtils]: 76: Hoare triple {20970#false} assume 0 == ~cond; {20970#false} is VALID [2022-04-28 02:48:59,458 INFO L290 TraceCheckUtils]: 77: Hoare triple {20970#false} assume !false; {20970#false} is VALID [2022-04-28 02:48:59,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:48:59,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:48:59,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331678702] [2022-04-28 02:48:59,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331678702] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:48:59,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [811950905] [2022-04-28 02:48:59,459 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 02:48:59,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:48:59,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:48:59,460 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:48:59,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-04-28 02:49:11,878 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 34 check-sat command(s) [2022-04-28 02:49:11,878 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:49:11,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-28 02:49:11,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:49:11,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:49:12,378 INFO L272 TraceCheckUtils]: 0: Hoare triple {20969#true} call ULTIMATE.init(); {20969#true} is VALID [2022-04-28 02:49:12,378 INFO L290 TraceCheckUtils]: 1: Hoare triple {20969#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {20969#true} is VALID [2022-04-28 02:49:12,378 INFO L290 TraceCheckUtils]: 2: Hoare triple {20969#true} assume true; {20969#true} is VALID [2022-04-28 02:49:12,378 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20969#true} {20969#true} #39#return; {20969#true} is VALID [2022-04-28 02:49:12,378 INFO L272 TraceCheckUtils]: 4: Hoare triple {20969#true} call #t~ret6 := main(); {20969#true} is VALID [2022-04-28 02:49:12,379 INFO L290 TraceCheckUtils]: 5: Hoare triple {20969#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {21027#(<= main_~i~0 0)} is VALID [2022-04-28 02:49:12,379 INFO L290 TraceCheckUtils]: 6: Hoare triple {21027#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21027#(<= main_~i~0 0)} is VALID [2022-04-28 02:49:12,379 INFO L290 TraceCheckUtils]: 7: Hoare triple {21027#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20975#(<= main_~i~0 1)} is VALID [2022-04-28 02:49:12,380 INFO L290 TraceCheckUtils]: 8: Hoare triple {20975#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20975#(<= main_~i~0 1)} is VALID [2022-04-28 02:49:12,380 INFO L290 TraceCheckUtils]: 9: Hoare triple {20975#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20976#(<= main_~i~0 2)} is VALID [2022-04-28 02:49:12,380 INFO L290 TraceCheckUtils]: 10: Hoare triple {20976#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20976#(<= main_~i~0 2)} is VALID [2022-04-28 02:49:12,381 INFO L290 TraceCheckUtils]: 11: Hoare triple {20976#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20977#(<= main_~i~0 3)} is VALID [2022-04-28 02:49:12,381 INFO L290 TraceCheckUtils]: 12: Hoare triple {20977#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20977#(<= main_~i~0 3)} is VALID [2022-04-28 02:49:12,381 INFO L290 TraceCheckUtils]: 13: Hoare triple {20977#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20978#(<= main_~i~0 4)} is VALID [2022-04-28 02:49:12,382 INFO L290 TraceCheckUtils]: 14: Hoare triple {20978#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20978#(<= main_~i~0 4)} is VALID [2022-04-28 02:49:12,382 INFO L290 TraceCheckUtils]: 15: Hoare triple {20978#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20979#(<= main_~i~0 5)} is VALID [2022-04-28 02:49:12,382 INFO L290 TraceCheckUtils]: 16: Hoare triple {20979#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20979#(<= main_~i~0 5)} is VALID [2022-04-28 02:49:12,383 INFO L290 TraceCheckUtils]: 17: Hoare triple {20979#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20980#(<= main_~i~0 6)} is VALID [2022-04-28 02:49:12,383 INFO L290 TraceCheckUtils]: 18: Hoare triple {20980#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20980#(<= main_~i~0 6)} is VALID [2022-04-28 02:49:12,383 INFO L290 TraceCheckUtils]: 19: Hoare triple {20980#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20981#(<= main_~i~0 7)} is VALID [2022-04-28 02:49:12,383 INFO L290 TraceCheckUtils]: 20: Hoare triple {20981#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20981#(<= main_~i~0 7)} is VALID [2022-04-28 02:49:12,384 INFO L290 TraceCheckUtils]: 21: Hoare triple {20981#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20982#(<= main_~i~0 8)} is VALID [2022-04-28 02:49:12,384 INFO L290 TraceCheckUtils]: 22: Hoare triple {20982#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20982#(<= main_~i~0 8)} is VALID [2022-04-28 02:49:12,384 INFO L290 TraceCheckUtils]: 23: Hoare triple {20982#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20983#(<= main_~i~0 9)} is VALID [2022-04-28 02:49:12,385 INFO L290 TraceCheckUtils]: 24: Hoare triple {20983#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20983#(<= main_~i~0 9)} is VALID [2022-04-28 02:49:12,385 INFO L290 TraceCheckUtils]: 25: Hoare triple {20983#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20984#(<= main_~i~0 10)} is VALID [2022-04-28 02:49:12,385 INFO L290 TraceCheckUtils]: 26: Hoare triple {20984#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20984#(<= main_~i~0 10)} is VALID [2022-04-28 02:49:12,386 INFO L290 TraceCheckUtils]: 27: Hoare triple {20984#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20985#(<= main_~i~0 11)} is VALID [2022-04-28 02:49:12,386 INFO L290 TraceCheckUtils]: 28: Hoare triple {20985#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20985#(<= main_~i~0 11)} is VALID [2022-04-28 02:49:12,386 INFO L290 TraceCheckUtils]: 29: Hoare triple {20985#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20986#(<= main_~i~0 12)} is VALID [2022-04-28 02:49:12,387 INFO L290 TraceCheckUtils]: 30: Hoare triple {20986#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20986#(<= main_~i~0 12)} is VALID [2022-04-28 02:49:12,387 INFO L290 TraceCheckUtils]: 31: Hoare triple {20986#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20987#(<= main_~i~0 13)} is VALID [2022-04-28 02:49:12,387 INFO L290 TraceCheckUtils]: 32: Hoare triple {20987#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20987#(<= main_~i~0 13)} is VALID [2022-04-28 02:49:12,388 INFO L290 TraceCheckUtils]: 33: Hoare triple {20987#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20988#(<= main_~i~0 14)} is VALID [2022-04-28 02:49:12,388 INFO L290 TraceCheckUtils]: 34: Hoare triple {20988#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20988#(<= main_~i~0 14)} is VALID [2022-04-28 02:49:12,388 INFO L290 TraceCheckUtils]: 35: Hoare triple {20988#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20989#(<= main_~i~0 15)} is VALID [2022-04-28 02:49:12,388 INFO L290 TraceCheckUtils]: 36: Hoare triple {20989#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20989#(<= main_~i~0 15)} is VALID [2022-04-28 02:49:12,389 INFO L290 TraceCheckUtils]: 37: Hoare triple {20989#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20990#(<= main_~i~0 16)} is VALID [2022-04-28 02:49:12,389 INFO L290 TraceCheckUtils]: 38: Hoare triple {20990#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20990#(<= main_~i~0 16)} is VALID [2022-04-28 02:49:12,389 INFO L290 TraceCheckUtils]: 39: Hoare triple {20990#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20991#(<= main_~i~0 17)} is VALID [2022-04-28 02:49:12,390 INFO L290 TraceCheckUtils]: 40: Hoare triple {20991#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20991#(<= main_~i~0 17)} is VALID [2022-04-28 02:49:12,390 INFO L290 TraceCheckUtils]: 41: Hoare triple {20991#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20992#(<= main_~i~0 18)} is VALID [2022-04-28 02:49:12,390 INFO L290 TraceCheckUtils]: 42: Hoare triple {20992#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20992#(<= main_~i~0 18)} is VALID [2022-04-28 02:49:12,391 INFO L290 TraceCheckUtils]: 43: Hoare triple {20992#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20993#(<= main_~i~0 19)} is VALID [2022-04-28 02:49:12,391 INFO L290 TraceCheckUtils]: 44: Hoare triple {20993#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20993#(<= main_~i~0 19)} is VALID [2022-04-28 02:49:12,391 INFO L290 TraceCheckUtils]: 45: Hoare triple {20993#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20994#(<= main_~i~0 20)} is VALID [2022-04-28 02:49:12,392 INFO L290 TraceCheckUtils]: 46: Hoare triple {20994#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20994#(<= main_~i~0 20)} is VALID [2022-04-28 02:49:12,392 INFO L290 TraceCheckUtils]: 47: Hoare triple {20994#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20995#(<= main_~i~0 21)} is VALID [2022-04-28 02:49:12,392 INFO L290 TraceCheckUtils]: 48: Hoare triple {20995#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20995#(<= main_~i~0 21)} is VALID [2022-04-28 02:49:12,392 INFO L290 TraceCheckUtils]: 49: Hoare triple {20995#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20996#(<= main_~i~0 22)} is VALID [2022-04-28 02:49:12,393 INFO L290 TraceCheckUtils]: 50: Hoare triple {20996#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20996#(<= main_~i~0 22)} is VALID [2022-04-28 02:49:12,393 INFO L290 TraceCheckUtils]: 51: Hoare triple {20996#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20997#(<= main_~i~0 23)} is VALID [2022-04-28 02:49:12,393 INFO L290 TraceCheckUtils]: 52: Hoare triple {20997#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20997#(<= main_~i~0 23)} is VALID [2022-04-28 02:49:12,394 INFO L290 TraceCheckUtils]: 53: Hoare triple {20997#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20998#(<= main_~i~0 24)} is VALID [2022-04-28 02:49:12,394 INFO L290 TraceCheckUtils]: 54: Hoare triple {20998#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20998#(<= main_~i~0 24)} is VALID [2022-04-28 02:49:12,394 INFO L290 TraceCheckUtils]: 55: Hoare triple {20998#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20999#(<= main_~i~0 25)} is VALID [2022-04-28 02:49:12,395 INFO L290 TraceCheckUtils]: 56: Hoare triple {20999#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20999#(<= main_~i~0 25)} is VALID [2022-04-28 02:49:12,395 INFO L290 TraceCheckUtils]: 57: Hoare triple {20999#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21000#(<= main_~i~0 26)} is VALID [2022-04-28 02:49:12,395 INFO L290 TraceCheckUtils]: 58: Hoare triple {21000#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21000#(<= main_~i~0 26)} is VALID [2022-04-28 02:49:12,396 INFO L290 TraceCheckUtils]: 59: Hoare triple {21000#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21001#(<= main_~i~0 27)} is VALID [2022-04-28 02:49:12,396 INFO L290 TraceCheckUtils]: 60: Hoare triple {21001#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21001#(<= main_~i~0 27)} is VALID [2022-04-28 02:49:12,396 INFO L290 TraceCheckUtils]: 61: Hoare triple {21001#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21002#(<= main_~i~0 28)} is VALID [2022-04-28 02:49:12,396 INFO L290 TraceCheckUtils]: 62: Hoare triple {21002#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21002#(<= main_~i~0 28)} is VALID [2022-04-28 02:49:12,397 INFO L290 TraceCheckUtils]: 63: Hoare triple {21002#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21003#(<= main_~i~0 29)} is VALID [2022-04-28 02:49:12,397 INFO L290 TraceCheckUtils]: 64: Hoare triple {21003#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21003#(<= main_~i~0 29)} is VALID [2022-04-28 02:49:12,397 INFO L290 TraceCheckUtils]: 65: Hoare triple {21003#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21004#(<= main_~i~0 30)} is VALID [2022-04-28 02:49:12,398 INFO L290 TraceCheckUtils]: 66: Hoare triple {21004#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21004#(<= main_~i~0 30)} is VALID [2022-04-28 02:49:12,398 INFO L290 TraceCheckUtils]: 67: Hoare triple {21004#(<= main_~i~0 30)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21005#(<= main_~i~0 31)} is VALID [2022-04-28 02:49:12,398 INFO L290 TraceCheckUtils]: 68: Hoare triple {21005#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21005#(<= main_~i~0 31)} is VALID [2022-04-28 02:49:12,399 INFO L290 TraceCheckUtils]: 69: Hoare triple {21005#(<= main_~i~0 31)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21006#(<= main_~i~0 32)} is VALID [2022-04-28 02:49:12,399 INFO L290 TraceCheckUtils]: 70: Hoare triple {21006#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21006#(<= main_~i~0 32)} is VALID [2022-04-28 02:49:12,399 INFO L290 TraceCheckUtils]: 71: Hoare triple {21006#(<= main_~i~0 32)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21007#(<= main_~i~0 33)} is VALID [2022-04-28 02:49:12,400 INFO L290 TraceCheckUtils]: 72: Hoare triple {21007#(<= main_~i~0 33)} assume !(~i~0 < 1024); {20970#false} is VALID [2022-04-28 02:49:12,400 INFO L290 TraceCheckUtils]: 73: Hoare triple {20970#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {20970#false} is VALID [2022-04-28 02:49:12,400 INFO L272 TraceCheckUtils]: 74: Hoare triple {20970#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {20970#false} is VALID [2022-04-28 02:49:12,400 INFO L290 TraceCheckUtils]: 75: Hoare triple {20970#false} ~cond := #in~cond; {20970#false} is VALID [2022-04-28 02:49:12,400 INFO L290 TraceCheckUtils]: 76: Hoare triple {20970#false} assume 0 == ~cond; {20970#false} is VALID [2022-04-28 02:49:12,400 INFO L290 TraceCheckUtils]: 77: Hoare triple {20970#false} assume !false; {20970#false} is VALID [2022-04-28 02:49:12,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:49:12,401 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:49:13,894 INFO L290 TraceCheckUtils]: 77: Hoare triple {20970#false} assume !false; {20970#false} is VALID [2022-04-28 02:49:13,894 INFO L290 TraceCheckUtils]: 76: Hoare triple {20970#false} assume 0 == ~cond; {20970#false} is VALID [2022-04-28 02:49:13,894 INFO L290 TraceCheckUtils]: 75: Hoare triple {20970#false} ~cond := #in~cond; {20970#false} is VALID [2022-04-28 02:49:13,894 INFO L272 TraceCheckUtils]: 74: Hoare triple {20970#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {20970#false} is VALID [2022-04-28 02:49:13,894 INFO L290 TraceCheckUtils]: 73: Hoare triple {20970#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {20970#false} is VALID [2022-04-28 02:49:13,894 INFO L290 TraceCheckUtils]: 72: Hoare triple {21259#(< main_~i~0 1024)} assume !(~i~0 < 1024); {20970#false} is VALID [2022-04-28 02:49:13,895 INFO L290 TraceCheckUtils]: 71: Hoare triple {21263#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21259#(< main_~i~0 1024)} is VALID [2022-04-28 02:49:13,895 INFO L290 TraceCheckUtils]: 70: Hoare triple {21263#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21263#(< main_~i~0 1023)} is VALID [2022-04-28 02:49:13,895 INFO L290 TraceCheckUtils]: 69: Hoare triple {21270#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21263#(< main_~i~0 1023)} is VALID [2022-04-28 02:49:13,896 INFO L290 TraceCheckUtils]: 68: Hoare triple {21270#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21270#(< main_~i~0 1022)} is VALID [2022-04-28 02:49:13,896 INFO L290 TraceCheckUtils]: 67: Hoare triple {21277#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21270#(< main_~i~0 1022)} is VALID [2022-04-28 02:49:13,896 INFO L290 TraceCheckUtils]: 66: Hoare triple {21277#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21277#(< main_~i~0 1021)} is VALID [2022-04-28 02:49:13,897 INFO L290 TraceCheckUtils]: 65: Hoare triple {21284#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21277#(< main_~i~0 1021)} is VALID [2022-04-28 02:49:13,897 INFO L290 TraceCheckUtils]: 64: Hoare triple {21284#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21284#(< main_~i~0 1020)} is VALID [2022-04-28 02:49:13,897 INFO L290 TraceCheckUtils]: 63: Hoare triple {21291#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21284#(< main_~i~0 1020)} is VALID [2022-04-28 02:49:13,897 INFO L290 TraceCheckUtils]: 62: Hoare triple {21291#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21291#(< main_~i~0 1019)} is VALID [2022-04-28 02:49:13,898 INFO L290 TraceCheckUtils]: 61: Hoare triple {21298#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21291#(< main_~i~0 1019)} is VALID [2022-04-28 02:49:13,898 INFO L290 TraceCheckUtils]: 60: Hoare triple {21298#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21298#(< main_~i~0 1018)} is VALID [2022-04-28 02:49:13,898 INFO L290 TraceCheckUtils]: 59: Hoare triple {21305#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21298#(< main_~i~0 1018)} is VALID [2022-04-28 02:49:13,899 INFO L290 TraceCheckUtils]: 58: Hoare triple {21305#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21305#(< main_~i~0 1017)} is VALID [2022-04-28 02:49:13,899 INFO L290 TraceCheckUtils]: 57: Hoare triple {21312#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21305#(< main_~i~0 1017)} is VALID [2022-04-28 02:49:13,899 INFO L290 TraceCheckUtils]: 56: Hoare triple {21312#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21312#(< main_~i~0 1016)} is VALID [2022-04-28 02:49:13,900 INFO L290 TraceCheckUtils]: 55: Hoare triple {21319#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21312#(< main_~i~0 1016)} is VALID [2022-04-28 02:49:13,900 INFO L290 TraceCheckUtils]: 54: Hoare triple {21319#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21319#(< main_~i~0 1015)} is VALID [2022-04-28 02:49:13,900 INFO L290 TraceCheckUtils]: 53: Hoare triple {21326#(< main_~i~0 1014)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21319#(< main_~i~0 1015)} is VALID [2022-04-28 02:49:13,901 INFO L290 TraceCheckUtils]: 52: Hoare triple {21326#(< main_~i~0 1014)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21326#(< main_~i~0 1014)} is VALID [2022-04-28 02:49:13,901 INFO L290 TraceCheckUtils]: 51: Hoare triple {21333#(< main_~i~0 1013)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21326#(< main_~i~0 1014)} is VALID [2022-04-28 02:49:13,901 INFO L290 TraceCheckUtils]: 50: Hoare triple {21333#(< main_~i~0 1013)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21333#(< main_~i~0 1013)} is VALID [2022-04-28 02:49:13,902 INFO L290 TraceCheckUtils]: 49: Hoare triple {21340#(< main_~i~0 1012)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21333#(< main_~i~0 1013)} is VALID [2022-04-28 02:49:13,911 INFO L290 TraceCheckUtils]: 48: Hoare triple {21340#(< main_~i~0 1012)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21340#(< main_~i~0 1012)} is VALID [2022-04-28 02:49:13,912 INFO L290 TraceCheckUtils]: 47: Hoare triple {21347#(< main_~i~0 1011)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21340#(< main_~i~0 1012)} is VALID [2022-04-28 02:49:13,912 INFO L290 TraceCheckUtils]: 46: Hoare triple {21347#(< main_~i~0 1011)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21347#(< main_~i~0 1011)} is VALID [2022-04-28 02:49:13,913 INFO L290 TraceCheckUtils]: 45: Hoare triple {21354#(< main_~i~0 1010)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21347#(< main_~i~0 1011)} is VALID [2022-04-28 02:49:13,913 INFO L290 TraceCheckUtils]: 44: Hoare triple {21354#(< main_~i~0 1010)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21354#(< main_~i~0 1010)} is VALID [2022-04-28 02:49:13,913 INFO L290 TraceCheckUtils]: 43: Hoare triple {21361#(< main_~i~0 1009)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21354#(< main_~i~0 1010)} is VALID [2022-04-28 02:49:13,914 INFO L290 TraceCheckUtils]: 42: Hoare triple {21361#(< main_~i~0 1009)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21361#(< main_~i~0 1009)} is VALID [2022-04-28 02:49:13,914 INFO L290 TraceCheckUtils]: 41: Hoare triple {21368#(< main_~i~0 1008)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21361#(< main_~i~0 1009)} is VALID [2022-04-28 02:49:13,915 INFO L290 TraceCheckUtils]: 40: Hoare triple {21368#(< main_~i~0 1008)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21368#(< main_~i~0 1008)} is VALID [2022-04-28 02:49:13,915 INFO L290 TraceCheckUtils]: 39: Hoare triple {21375#(< main_~i~0 1007)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21368#(< main_~i~0 1008)} is VALID [2022-04-28 02:49:13,915 INFO L290 TraceCheckUtils]: 38: Hoare triple {21375#(< main_~i~0 1007)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21375#(< main_~i~0 1007)} is VALID [2022-04-28 02:49:13,916 INFO L290 TraceCheckUtils]: 37: Hoare triple {21382#(< main_~i~0 1006)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21375#(< main_~i~0 1007)} is VALID [2022-04-28 02:49:13,916 INFO L290 TraceCheckUtils]: 36: Hoare triple {21382#(< main_~i~0 1006)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21382#(< main_~i~0 1006)} is VALID [2022-04-28 02:49:13,917 INFO L290 TraceCheckUtils]: 35: Hoare triple {21389#(< main_~i~0 1005)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21382#(< main_~i~0 1006)} is VALID [2022-04-28 02:49:13,917 INFO L290 TraceCheckUtils]: 34: Hoare triple {21389#(< main_~i~0 1005)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21389#(< main_~i~0 1005)} is VALID [2022-04-28 02:49:13,918 INFO L290 TraceCheckUtils]: 33: Hoare triple {21396#(< main_~i~0 1004)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21389#(< main_~i~0 1005)} is VALID [2022-04-28 02:49:13,918 INFO L290 TraceCheckUtils]: 32: Hoare triple {21396#(< main_~i~0 1004)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21396#(< main_~i~0 1004)} is VALID [2022-04-28 02:49:13,918 INFO L290 TraceCheckUtils]: 31: Hoare triple {21403#(< main_~i~0 1003)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21396#(< main_~i~0 1004)} is VALID [2022-04-28 02:49:13,919 INFO L290 TraceCheckUtils]: 30: Hoare triple {21403#(< main_~i~0 1003)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21403#(< main_~i~0 1003)} is VALID [2022-04-28 02:49:13,919 INFO L290 TraceCheckUtils]: 29: Hoare triple {21410#(< main_~i~0 1002)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21403#(< main_~i~0 1003)} is VALID [2022-04-28 02:49:13,920 INFO L290 TraceCheckUtils]: 28: Hoare triple {21410#(< main_~i~0 1002)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21410#(< main_~i~0 1002)} is VALID [2022-04-28 02:49:13,920 INFO L290 TraceCheckUtils]: 27: Hoare triple {21417#(< main_~i~0 1001)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21410#(< main_~i~0 1002)} is VALID [2022-04-28 02:49:13,920 INFO L290 TraceCheckUtils]: 26: Hoare triple {21417#(< main_~i~0 1001)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21417#(< main_~i~0 1001)} is VALID [2022-04-28 02:49:13,921 INFO L290 TraceCheckUtils]: 25: Hoare triple {21424#(< main_~i~0 1000)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21417#(< main_~i~0 1001)} is VALID [2022-04-28 02:49:13,921 INFO L290 TraceCheckUtils]: 24: Hoare triple {21424#(< main_~i~0 1000)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21424#(< main_~i~0 1000)} is VALID [2022-04-28 02:49:13,922 INFO L290 TraceCheckUtils]: 23: Hoare triple {21431#(< main_~i~0 999)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21424#(< main_~i~0 1000)} is VALID [2022-04-28 02:49:13,922 INFO L290 TraceCheckUtils]: 22: Hoare triple {21431#(< main_~i~0 999)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21431#(< main_~i~0 999)} is VALID [2022-04-28 02:49:13,923 INFO L290 TraceCheckUtils]: 21: Hoare triple {21438#(< main_~i~0 998)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21431#(< main_~i~0 999)} is VALID [2022-04-28 02:49:13,923 INFO L290 TraceCheckUtils]: 20: Hoare triple {21438#(< main_~i~0 998)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21438#(< main_~i~0 998)} is VALID [2022-04-28 02:49:13,923 INFO L290 TraceCheckUtils]: 19: Hoare triple {21445#(< main_~i~0 997)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21438#(< main_~i~0 998)} is VALID [2022-04-28 02:49:13,924 INFO L290 TraceCheckUtils]: 18: Hoare triple {21445#(< main_~i~0 997)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21445#(< main_~i~0 997)} is VALID [2022-04-28 02:49:13,924 INFO L290 TraceCheckUtils]: 17: Hoare triple {21452#(< main_~i~0 996)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21445#(< main_~i~0 997)} is VALID [2022-04-28 02:49:13,925 INFO L290 TraceCheckUtils]: 16: Hoare triple {21452#(< main_~i~0 996)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21452#(< main_~i~0 996)} is VALID [2022-04-28 02:49:13,925 INFO L290 TraceCheckUtils]: 15: Hoare triple {21459#(< main_~i~0 995)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21452#(< main_~i~0 996)} is VALID [2022-04-28 02:49:13,925 INFO L290 TraceCheckUtils]: 14: Hoare triple {21459#(< main_~i~0 995)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21459#(< main_~i~0 995)} is VALID [2022-04-28 02:49:13,926 INFO L290 TraceCheckUtils]: 13: Hoare triple {21466#(< main_~i~0 994)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21459#(< main_~i~0 995)} is VALID [2022-04-28 02:49:13,926 INFO L290 TraceCheckUtils]: 12: Hoare triple {21466#(< main_~i~0 994)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21466#(< main_~i~0 994)} is VALID [2022-04-28 02:49:13,927 INFO L290 TraceCheckUtils]: 11: Hoare triple {21473#(< main_~i~0 993)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21466#(< main_~i~0 994)} is VALID [2022-04-28 02:49:13,927 INFO L290 TraceCheckUtils]: 10: Hoare triple {21473#(< main_~i~0 993)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21473#(< main_~i~0 993)} is VALID [2022-04-28 02:49:13,927 INFO L290 TraceCheckUtils]: 9: Hoare triple {21480#(< main_~i~0 992)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21473#(< main_~i~0 993)} is VALID [2022-04-28 02:49:13,928 INFO L290 TraceCheckUtils]: 8: Hoare triple {21480#(< main_~i~0 992)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21480#(< main_~i~0 992)} is VALID [2022-04-28 02:49:13,928 INFO L290 TraceCheckUtils]: 7: Hoare triple {21487#(< main_~i~0 991)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21480#(< main_~i~0 992)} is VALID [2022-04-28 02:49:13,929 INFO L290 TraceCheckUtils]: 6: Hoare triple {21487#(< main_~i~0 991)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21487#(< main_~i~0 991)} is VALID [2022-04-28 02:49:13,929 INFO L290 TraceCheckUtils]: 5: Hoare triple {20969#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {21487#(< main_~i~0 991)} is VALID [2022-04-28 02:49:13,929 INFO L272 TraceCheckUtils]: 4: Hoare triple {20969#true} call #t~ret6 := main(); {20969#true} is VALID [2022-04-28 02:49:13,929 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20969#true} {20969#true} #39#return; {20969#true} is VALID [2022-04-28 02:49:13,929 INFO L290 TraceCheckUtils]: 2: Hoare triple {20969#true} assume true; {20969#true} is VALID [2022-04-28 02:49:13,930 INFO L290 TraceCheckUtils]: 1: Hoare triple {20969#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {20969#true} is VALID [2022-04-28 02:49:13,930 INFO L272 TraceCheckUtils]: 0: Hoare triple {20969#true} call ULTIMATE.init(); {20969#true} is VALID [2022-04-28 02:49:13,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:49:13,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [811950905] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:49:13,933 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:49:13,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 36, 36] total 72 [2022-04-28 02:49:13,934 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:49:13,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [4834395] [2022-04-28 02:49:13,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [4834395] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:49:13,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:49:13,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2022-04-28 02:49:13,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572006001] [2022-04-28 02:49:13,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:49:13,935 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.0) internal successors, (74), 36 states have internal predecessors, (74), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 78 [2022-04-28 02:49:13,935 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:49:13,935 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 37 states, 37 states have (on average 2.0) internal successors, (74), 36 states have internal predecessors, (74), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:49:13,997 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:49:13,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-04-28 02:49:13,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:49:13,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-04-28 02:49:13,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2487, Invalid=2625, Unknown=0, NotChecked=0, Total=5112 [2022-04-28 02:49:13,999 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand has 37 states, 37 states have (on average 2.0) internal successors, (74), 36 states have internal predecessors, (74), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:49:14,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:49:14,974 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2022-04-28 02:49:14,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-28 02:49:14,975 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.0) internal successors, (74), 36 states have internal predecessors, (74), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 78 [2022-04-28 02:49:14,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:49:14,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 2.0) internal successors, (74), 36 states have internal predecessors, (74), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:49:14,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 88 transitions. [2022-04-28 02:49:14,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 2.0) internal successors, (74), 36 states have internal predecessors, (74), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:49:14,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 88 transitions. [2022-04-28 02:49:14,977 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 88 transitions. [2022-04-28 02:49:15,055 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:49:15,056 INFO L225 Difference]: With dead ends: 88 [2022-04-28 02:49:15,056 INFO L226 Difference]: Without dead ends: 82 [2022-04-28 02:49:15,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 758 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=4902, Invalid=6228, Unknown=0, NotChecked=0, Total=11130 [2022-04-28 02:49:15,058 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 76 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:49:15,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 24 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:49:15,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-28 02:49:15,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2022-04-28 02:49:15,309 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:49:15,309 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand has 81 states, 76 states have (on average 1.013157894736842) internal successors, (77), 76 states have internal predecessors, (77), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:49:15,310 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand has 81 states, 76 states have (on average 1.013157894736842) internal successors, (77), 76 states have internal predecessors, (77), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:49:15,310 INFO L87 Difference]: Start difference. First operand 82 states. Second operand has 81 states, 76 states have (on average 1.013157894736842) internal successors, (77), 76 states have internal predecessors, (77), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:49:15,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:49:15,310 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2022-04-28 02:49:15,310 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2022-04-28 02:49:15,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:49:15,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:49:15,311 INFO L74 IsIncluded]: Start isIncluded. First operand has 81 states, 76 states have (on average 1.013157894736842) internal successors, (77), 76 states have internal predecessors, (77), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 82 states. [2022-04-28 02:49:15,311 INFO L87 Difference]: Start difference. First operand has 81 states, 76 states have (on average 1.013157894736842) internal successors, (77), 76 states have internal predecessors, (77), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 82 states. [2022-04-28 02:49:15,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:49:15,311 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2022-04-28 02:49:15,311 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2022-04-28 02:49:15,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:49:15,312 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:49:15,312 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:49:15,312 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:49:15,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 76 states have (on average 1.013157894736842) internal successors, (77), 76 states have internal predecessors, (77), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:49:15,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2022-04-28 02:49:15,313 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 78 [2022-04-28 02:49:15,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:49:15,313 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2022-04-28 02:49:15,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.0) internal successors, (74), 36 states have internal predecessors, (74), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:49:15,313 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 81 states and 81 transitions. [2022-04-28 02:49:15,397 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:49:15,398 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2022-04-28 02:49:15,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-04-28 02:49:15,398 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:49:15,398 INFO L195 NwaCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:49:15,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2022-04-28 02:49:15,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-04-28 02:49:15,598 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:49:15,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:49:15,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1388054846, now seen corresponding path program 67 times [2022-04-28 02:49:15,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:49:15,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [177580604] [2022-04-28 02:49:15,601 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:49:15,601 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:49:15,601 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:49:15,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1388054846, now seen corresponding path program 68 times [2022-04-28 02:49:15,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:49:15,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76583037] [2022-04-28 02:49:15,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:49:15,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:49:15,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:49:16,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:49:16,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:49:16,108 INFO L290 TraceCheckUtils]: 0: Hoare triple {22121#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {22081#true} is VALID [2022-04-28 02:49:16,108 INFO L290 TraceCheckUtils]: 1: Hoare triple {22081#true} assume true; {22081#true} is VALID [2022-04-28 02:49:16,108 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22081#true} {22081#true} #39#return; {22081#true} is VALID [2022-04-28 02:49:16,109 INFO L272 TraceCheckUtils]: 0: Hoare triple {22081#true} call ULTIMATE.init(); {22121#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:49:16,109 INFO L290 TraceCheckUtils]: 1: Hoare triple {22121#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {22081#true} is VALID [2022-04-28 02:49:16,109 INFO L290 TraceCheckUtils]: 2: Hoare triple {22081#true} assume true; {22081#true} is VALID [2022-04-28 02:49:16,109 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22081#true} {22081#true} #39#return; {22081#true} is VALID [2022-04-28 02:49:16,109 INFO L272 TraceCheckUtils]: 4: Hoare triple {22081#true} call #t~ret6 := main(); {22081#true} is VALID [2022-04-28 02:49:16,109 INFO L290 TraceCheckUtils]: 5: Hoare triple {22081#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {22086#(= main_~i~0 0)} is VALID [2022-04-28 02:49:16,110 INFO L290 TraceCheckUtils]: 6: Hoare triple {22086#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22086#(= main_~i~0 0)} is VALID [2022-04-28 02:49:16,110 INFO L290 TraceCheckUtils]: 7: Hoare triple {22086#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22087#(<= main_~i~0 1)} is VALID [2022-04-28 02:49:16,110 INFO L290 TraceCheckUtils]: 8: Hoare triple {22087#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22087#(<= main_~i~0 1)} is VALID [2022-04-28 02:49:16,111 INFO L290 TraceCheckUtils]: 9: Hoare triple {22087#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22088#(<= main_~i~0 2)} is VALID [2022-04-28 02:49:16,111 INFO L290 TraceCheckUtils]: 10: Hoare triple {22088#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22088#(<= main_~i~0 2)} is VALID [2022-04-28 02:49:16,111 INFO L290 TraceCheckUtils]: 11: Hoare triple {22088#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22089#(<= main_~i~0 3)} is VALID [2022-04-28 02:49:16,112 INFO L290 TraceCheckUtils]: 12: Hoare triple {22089#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22089#(<= main_~i~0 3)} is VALID [2022-04-28 02:49:16,112 INFO L290 TraceCheckUtils]: 13: Hoare triple {22089#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22090#(<= main_~i~0 4)} is VALID [2022-04-28 02:49:16,112 INFO L290 TraceCheckUtils]: 14: Hoare triple {22090#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22090#(<= main_~i~0 4)} is VALID [2022-04-28 02:49:16,112 INFO L290 TraceCheckUtils]: 15: Hoare triple {22090#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22091#(<= main_~i~0 5)} is VALID [2022-04-28 02:49:16,113 INFO L290 TraceCheckUtils]: 16: Hoare triple {22091#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22091#(<= main_~i~0 5)} is VALID [2022-04-28 02:49:16,113 INFO L290 TraceCheckUtils]: 17: Hoare triple {22091#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22092#(<= main_~i~0 6)} is VALID [2022-04-28 02:49:16,113 INFO L290 TraceCheckUtils]: 18: Hoare triple {22092#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22092#(<= main_~i~0 6)} is VALID [2022-04-28 02:49:16,114 INFO L290 TraceCheckUtils]: 19: Hoare triple {22092#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22093#(<= main_~i~0 7)} is VALID [2022-04-28 02:49:16,114 INFO L290 TraceCheckUtils]: 20: Hoare triple {22093#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22093#(<= main_~i~0 7)} is VALID [2022-04-28 02:49:16,114 INFO L290 TraceCheckUtils]: 21: Hoare triple {22093#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22094#(<= main_~i~0 8)} is VALID [2022-04-28 02:49:16,115 INFO L290 TraceCheckUtils]: 22: Hoare triple {22094#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22094#(<= main_~i~0 8)} is VALID [2022-04-28 02:49:16,115 INFO L290 TraceCheckUtils]: 23: Hoare triple {22094#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22095#(<= main_~i~0 9)} is VALID [2022-04-28 02:49:16,115 INFO L290 TraceCheckUtils]: 24: Hoare triple {22095#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22095#(<= main_~i~0 9)} is VALID [2022-04-28 02:49:16,116 INFO L290 TraceCheckUtils]: 25: Hoare triple {22095#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22096#(<= main_~i~0 10)} is VALID [2022-04-28 02:49:16,116 INFO L290 TraceCheckUtils]: 26: Hoare triple {22096#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22096#(<= main_~i~0 10)} is VALID [2022-04-28 02:49:16,116 INFO L290 TraceCheckUtils]: 27: Hoare triple {22096#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22097#(<= main_~i~0 11)} is VALID [2022-04-28 02:49:16,116 INFO L290 TraceCheckUtils]: 28: Hoare triple {22097#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22097#(<= main_~i~0 11)} is VALID [2022-04-28 02:49:16,117 INFO L290 TraceCheckUtils]: 29: Hoare triple {22097#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22098#(<= main_~i~0 12)} is VALID [2022-04-28 02:49:16,117 INFO L290 TraceCheckUtils]: 30: Hoare triple {22098#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22098#(<= main_~i~0 12)} is VALID [2022-04-28 02:49:16,117 INFO L290 TraceCheckUtils]: 31: Hoare triple {22098#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22099#(<= main_~i~0 13)} is VALID [2022-04-28 02:49:16,118 INFO L290 TraceCheckUtils]: 32: Hoare triple {22099#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22099#(<= main_~i~0 13)} is VALID [2022-04-28 02:49:16,118 INFO L290 TraceCheckUtils]: 33: Hoare triple {22099#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22100#(<= main_~i~0 14)} is VALID [2022-04-28 02:49:16,118 INFO L290 TraceCheckUtils]: 34: Hoare triple {22100#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22100#(<= main_~i~0 14)} is VALID [2022-04-28 02:49:16,119 INFO L290 TraceCheckUtils]: 35: Hoare triple {22100#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22101#(<= main_~i~0 15)} is VALID [2022-04-28 02:49:16,119 INFO L290 TraceCheckUtils]: 36: Hoare triple {22101#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22101#(<= main_~i~0 15)} is VALID [2022-04-28 02:49:16,119 INFO L290 TraceCheckUtils]: 37: Hoare triple {22101#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22102#(<= main_~i~0 16)} is VALID [2022-04-28 02:49:16,120 INFO L290 TraceCheckUtils]: 38: Hoare triple {22102#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22102#(<= main_~i~0 16)} is VALID [2022-04-28 02:49:16,120 INFO L290 TraceCheckUtils]: 39: Hoare triple {22102#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22103#(<= main_~i~0 17)} is VALID [2022-04-28 02:49:16,120 INFO L290 TraceCheckUtils]: 40: Hoare triple {22103#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22103#(<= main_~i~0 17)} is VALID [2022-04-28 02:49:16,120 INFO L290 TraceCheckUtils]: 41: Hoare triple {22103#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22104#(<= main_~i~0 18)} is VALID [2022-04-28 02:49:16,121 INFO L290 TraceCheckUtils]: 42: Hoare triple {22104#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22104#(<= main_~i~0 18)} is VALID [2022-04-28 02:49:16,121 INFO L290 TraceCheckUtils]: 43: Hoare triple {22104#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22105#(<= main_~i~0 19)} is VALID [2022-04-28 02:49:16,121 INFO L290 TraceCheckUtils]: 44: Hoare triple {22105#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22105#(<= main_~i~0 19)} is VALID [2022-04-28 02:49:16,122 INFO L290 TraceCheckUtils]: 45: Hoare triple {22105#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22106#(<= main_~i~0 20)} is VALID [2022-04-28 02:49:16,122 INFO L290 TraceCheckUtils]: 46: Hoare triple {22106#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22106#(<= main_~i~0 20)} is VALID [2022-04-28 02:49:16,122 INFO L290 TraceCheckUtils]: 47: Hoare triple {22106#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22107#(<= main_~i~0 21)} is VALID [2022-04-28 02:49:16,123 INFO L290 TraceCheckUtils]: 48: Hoare triple {22107#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22107#(<= main_~i~0 21)} is VALID [2022-04-28 02:49:16,123 INFO L290 TraceCheckUtils]: 49: Hoare triple {22107#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22108#(<= main_~i~0 22)} is VALID [2022-04-28 02:49:16,123 INFO L290 TraceCheckUtils]: 50: Hoare triple {22108#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22108#(<= main_~i~0 22)} is VALID [2022-04-28 02:49:16,124 INFO L290 TraceCheckUtils]: 51: Hoare triple {22108#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22109#(<= main_~i~0 23)} is VALID [2022-04-28 02:49:16,124 INFO L290 TraceCheckUtils]: 52: Hoare triple {22109#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22109#(<= main_~i~0 23)} is VALID [2022-04-28 02:49:16,124 INFO L290 TraceCheckUtils]: 53: Hoare triple {22109#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22110#(<= main_~i~0 24)} is VALID [2022-04-28 02:49:16,124 INFO L290 TraceCheckUtils]: 54: Hoare triple {22110#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22110#(<= main_~i~0 24)} is VALID [2022-04-28 02:49:16,125 INFO L290 TraceCheckUtils]: 55: Hoare triple {22110#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22111#(<= main_~i~0 25)} is VALID [2022-04-28 02:49:16,125 INFO L290 TraceCheckUtils]: 56: Hoare triple {22111#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22111#(<= main_~i~0 25)} is VALID [2022-04-28 02:49:16,125 INFO L290 TraceCheckUtils]: 57: Hoare triple {22111#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22112#(<= main_~i~0 26)} is VALID [2022-04-28 02:49:16,126 INFO L290 TraceCheckUtils]: 58: Hoare triple {22112#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22112#(<= main_~i~0 26)} is VALID [2022-04-28 02:49:16,126 INFO L290 TraceCheckUtils]: 59: Hoare triple {22112#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22113#(<= main_~i~0 27)} is VALID [2022-04-28 02:49:16,126 INFO L290 TraceCheckUtils]: 60: Hoare triple {22113#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22113#(<= main_~i~0 27)} is VALID [2022-04-28 02:49:16,127 INFO L290 TraceCheckUtils]: 61: Hoare triple {22113#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22114#(<= main_~i~0 28)} is VALID [2022-04-28 02:49:16,127 INFO L290 TraceCheckUtils]: 62: Hoare triple {22114#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22114#(<= main_~i~0 28)} is VALID [2022-04-28 02:49:16,127 INFO L290 TraceCheckUtils]: 63: Hoare triple {22114#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22115#(<= main_~i~0 29)} is VALID [2022-04-28 02:49:16,127 INFO L290 TraceCheckUtils]: 64: Hoare triple {22115#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22115#(<= main_~i~0 29)} is VALID [2022-04-28 02:49:16,128 INFO L290 TraceCheckUtils]: 65: Hoare triple {22115#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22116#(<= main_~i~0 30)} is VALID [2022-04-28 02:49:16,128 INFO L290 TraceCheckUtils]: 66: Hoare triple {22116#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22116#(<= main_~i~0 30)} is VALID [2022-04-28 02:49:16,128 INFO L290 TraceCheckUtils]: 67: Hoare triple {22116#(<= main_~i~0 30)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22117#(<= main_~i~0 31)} is VALID [2022-04-28 02:49:16,129 INFO L290 TraceCheckUtils]: 68: Hoare triple {22117#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22117#(<= main_~i~0 31)} is VALID [2022-04-28 02:49:16,129 INFO L290 TraceCheckUtils]: 69: Hoare triple {22117#(<= main_~i~0 31)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22118#(<= main_~i~0 32)} is VALID [2022-04-28 02:49:16,129 INFO L290 TraceCheckUtils]: 70: Hoare triple {22118#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22118#(<= main_~i~0 32)} is VALID [2022-04-28 02:49:16,130 INFO L290 TraceCheckUtils]: 71: Hoare triple {22118#(<= main_~i~0 32)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22119#(<= main_~i~0 33)} is VALID [2022-04-28 02:49:16,130 INFO L290 TraceCheckUtils]: 72: Hoare triple {22119#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22119#(<= main_~i~0 33)} is VALID [2022-04-28 02:49:16,130 INFO L290 TraceCheckUtils]: 73: Hoare triple {22119#(<= main_~i~0 33)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22120#(<= main_~i~0 34)} is VALID [2022-04-28 02:49:16,131 INFO L290 TraceCheckUtils]: 74: Hoare triple {22120#(<= main_~i~0 34)} assume !(~i~0 < 1024); {22082#false} is VALID [2022-04-28 02:49:16,131 INFO L290 TraceCheckUtils]: 75: Hoare triple {22082#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {22082#false} is VALID [2022-04-28 02:49:16,131 INFO L272 TraceCheckUtils]: 76: Hoare triple {22082#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {22082#false} is VALID [2022-04-28 02:49:16,131 INFO L290 TraceCheckUtils]: 77: Hoare triple {22082#false} ~cond := #in~cond; {22082#false} is VALID [2022-04-28 02:49:16,131 INFO L290 TraceCheckUtils]: 78: Hoare triple {22082#false} assume 0 == ~cond; {22082#false} is VALID [2022-04-28 02:49:16,131 INFO L290 TraceCheckUtils]: 79: Hoare triple {22082#false} assume !false; {22082#false} is VALID [2022-04-28 02:49:16,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:49:16,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:49:16,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76583037] [2022-04-28 02:49:16,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76583037] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:49:16,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1346651461] [2022-04-28 02:49:16,132 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:49:16,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:49:16,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:49:16,133 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:49:16,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-04-28 02:49:16,294 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:49:16,294 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:49:16,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-28 02:49:16,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:49:16,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:49:16,754 INFO L272 TraceCheckUtils]: 0: Hoare triple {22081#true} call ULTIMATE.init(); {22081#true} is VALID [2022-04-28 02:49:16,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {22081#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {22081#true} is VALID [2022-04-28 02:49:16,755 INFO L290 TraceCheckUtils]: 2: Hoare triple {22081#true} assume true; {22081#true} is VALID [2022-04-28 02:49:16,755 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22081#true} {22081#true} #39#return; {22081#true} is VALID [2022-04-28 02:49:16,755 INFO L272 TraceCheckUtils]: 4: Hoare triple {22081#true} call #t~ret6 := main(); {22081#true} is VALID [2022-04-28 02:49:16,755 INFO L290 TraceCheckUtils]: 5: Hoare triple {22081#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {22140#(<= main_~i~0 0)} is VALID [2022-04-28 02:49:16,755 INFO L290 TraceCheckUtils]: 6: Hoare triple {22140#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22140#(<= main_~i~0 0)} is VALID [2022-04-28 02:49:16,756 INFO L290 TraceCheckUtils]: 7: Hoare triple {22140#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22087#(<= main_~i~0 1)} is VALID [2022-04-28 02:49:16,756 INFO L290 TraceCheckUtils]: 8: Hoare triple {22087#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22087#(<= main_~i~0 1)} is VALID [2022-04-28 02:49:16,756 INFO L290 TraceCheckUtils]: 9: Hoare triple {22087#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22088#(<= main_~i~0 2)} is VALID [2022-04-28 02:49:16,757 INFO L290 TraceCheckUtils]: 10: Hoare triple {22088#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22088#(<= main_~i~0 2)} is VALID [2022-04-28 02:49:16,757 INFO L290 TraceCheckUtils]: 11: Hoare triple {22088#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22089#(<= main_~i~0 3)} is VALID [2022-04-28 02:49:16,757 INFO L290 TraceCheckUtils]: 12: Hoare triple {22089#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22089#(<= main_~i~0 3)} is VALID [2022-04-28 02:49:16,758 INFO L290 TraceCheckUtils]: 13: Hoare triple {22089#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22090#(<= main_~i~0 4)} is VALID [2022-04-28 02:49:16,758 INFO L290 TraceCheckUtils]: 14: Hoare triple {22090#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22090#(<= main_~i~0 4)} is VALID [2022-04-28 02:49:16,758 INFO L290 TraceCheckUtils]: 15: Hoare triple {22090#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22091#(<= main_~i~0 5)} is VALID [2022-04-28 02:49:16,758 INFO L290 TraceCheckUtils]: 16: Hoare triple {22091#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22091#(<= main_~i~0 5)} is VALID [2022-04-28 02:49:16,759 INFO L290 TraceCheckUtils]: 17: Hoare triple {22091#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22092#(<= main_~i~0 6)} is VALID [2022-04-28 02:49:16,759 INFO L290 TraceCheckUtils]: 18: Hoare triple {22092#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22092#(<= main_~i~0 6)} is VALID [2022-04-28 02:49:16,759 INFO L290 TraceCheckUtils]: 19: Hoare triple {22092#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22093#(<= main_~i~0 7)} is VALID [2022-04-28 02:49:16,760 INFO L290 TraceCheckUtils]: 20: Hoare triple {22093#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22093#(<= main_~i~0 7)} is VALID [2022-04-28 02:49:16,760 INFO L290 TraceCheckUtils]: 21: Hoare triple {22093#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22094#(<= main_~i~0 8)} is VALID [2022-04-28 02:49:16,760 INFO L290 TraceCheckUtils]: 22: Hoare triple {22094#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22094#(<= main_~i~0 8)} is VALID [2022-04-28 02:49:16,761 INFO L290 TraceCheckUtils]: 23: Hoare triple {22094#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22095#(<= main_~i~0 9)} is VALID [2022-04-28 02:49:16,761 INFO L290 TraceCheckUtils]: 24: Hoare triple {22095#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22095#(<= main_~i~0 9)} is VALID [2022-04-28 02:49:16,761 INFO L290 TraceCheckUtils]: 25: Hoare triple {22095#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22096#(<= main_~i~0 10)} is VALID [2022-04-28 02:49:16,762 INFO L290 TraceCheckUtils]: 26: Hoare triple {22096#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22096#(<= main_~i~0 10)} is VALID [2022-04-28 02:49:16,762 INFO L290 TraceCheckUtils]: 27: Hoare triple {22096#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22097#(<= main_~i~0 11)} is VALID [2022-04-28 02:49:16,762 INFO L290 TraceCheckUtils]: 28: Hoare triple {22097#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22097#(<= main_~i~0 11)} is VALID [2022-04-28 02:49:16,762 INFO L290 TraceCheckUtils]: 29: Hoare triple {22097#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22098#(<= main_~i~0 12)} is VALID [2022-04-28 02:49:16,763 INFO L290 TraceCheckUtils]: 30: Hoare triple {22098#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22098#(<= main_~i~0 12)} is VALID [2022-04-28 02:49:16,763 INFO L290 TraceCheckUtils]: 31: Hoare triple {22098#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22099#(<= main_~i~0 13)} is VALID [2022-04-28 02:49:16,763 INFO L290 TraceCheckUtils]: 32: Hoare triple {22099#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22099#(<= main_~i~0 13)} is VALID [2022-04-28 02:49:16,764 INFO L290 TraceCheckUtils]: 33: Hoare triple {22099#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22100#(<= main_~i~0 14)} is VALID [2022-04-28 02:49:16,764 INFO L290 TraceCheckUtils]: 34: Hoare triple {22100#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22100#(<= main_~i~0 14)} is VALID [2022-04-28 02:49:16,764 INFO L290 TraceCheckUtils]: 35: Hoare triple {22100#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22101#(<= main_~i~0 15)} is VALID [2022-04-28 02:49:16,765 INFO L290 TraceCheckUtils]: 36: Hoare triple {22101#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22101#(<= main_~i~0 15)} is VALID [2022-04-28 02:49:16,765 INFO L290 TraceCheckUtils]: 37: Hoare triple {22101#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22102#(<= main_~i~0 16)} is VALID [2022-04-28 02:49:16,765 INFO L290 TraceCheckUtils]: 38: Hoare triple {22102#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22102#(<= main_~i~0 16)} is VALID [2022-04-28 02:49:16,766 INFO L290 TraceCheckUtils]: 39: Hoare triple {22102#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22103#(<= main_~i~0 17)} is VALID [2022-04-28 02:49:16,766 INFO L290 TraceCheckUtils]: 40: Hoare triple {22103#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22103#(<= main_~i~0 17)} is VALID [2022-04-28 02:49:16,766 INFO L290 TraceCheckUtils]: 41: Hoare triple {22103#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22104#(<= main_~i~0 18)} is VALID [2022-04-28 02:49:16,766 INFO L290 TraceCheckUtils]: 42: Hoare triple {22104#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22104#(<= main_~i~0 18)} is VALID [2022-04-28 02:49:16,767 INFO L290 TraceCheckUtils]: 43: Hoare triple {22104#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22105#(<= main_~i~0 19)} is VALID [2022-04-28 02:49:16,767 INFO L290 TraceCheckUtils]: 44: Hoare triple {22105#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22105#(<= main_~i~0 19)} is VALID [2022-04-28 02:49:16,767 INFO L290 TraceCheckUtils]: 45: Hoare triple {22105#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22106#(<= main_~i~0 20)} is VALID [2022-04-28 02:49:16,768 INFO L290 TraceCheckUtils]: 46: Hoare triple {22106#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22106#(<= main_~i~0 20)} is VALID [2022-04-28 02:49:16,768 INFO L290 TraceCheckUtils]: 47: Hoare triple {22106#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22107#(<= main_~i~0 21)} is VALID [2022-04-28 02:49:16,768 INFO L290 TraceCheckUtils]: 48: Hoare triple {22107#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22107#(<= main_~i~0 21)} is VALID [2022-04-28 02:49:16,778 INFO L290 TraceCheckUtils]: 49: Hoare triple {22107#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22108#(<= main_~i~0 22)} is VALID [2022-04-28 02:49:16,778 INFO L290 TraceCheckUtils]: 50: Hoare triple {22108#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22108#(<= main_~i~0 22)} is VALID [2022-04-28 02:49:16,779 INFO L290 TraceCheckUtils]: 51: Hoare triple {22108#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22109#(<= main_~i~0 23)} is VALID [2022-04-28 02:49:16,779 INFO L290 TraceCheckUtils]: 52: Hoare triple {22109#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22109#(<= main_~i~0 23)} is VALID [2022-04-28 02:49:16,779 INFO L290 TraceCheckUtils]: 53: Hoare triple {22109#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22110#(<= main_~i~0 24)} is VALID [2022-04-28 02:49:16,780 INFO L290 TraceCheckUtils]: 54: Hoare triple {22110#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22110#(<= main_~i~0 24)} is VALID [2022-04-28 02:49:16,780 INFO L290 TraceCheckUtils]: 55: Hoare triple {22110#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22111#(<= main_~i~0 25)} is VALID [2022-04-28 02:49:16,780 INFO L290 TraceCheckUtils]: 56: Hoare triple {22111#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22111#(<= main_~i~0 25)} is VALID [2022-04-28 02:49:16,780 INFO L290 TraceCheckUtils]: 57: Hoare triple {22111#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22112#(<= main_~i~0 26)} is VALID [2022-04-28 02:49:16,781 INFO L290 TraceCheckUtils]: 58: Hoare triple {22112#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22112#(<= main_~i~0 26)} is VALID [2022-04-28 02:49:16,781 INFO L290 TraceCheckUtils]: 59: Hoare triple {22112#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22113#(<= main_~i~0 27)} is VALID [2022-04-28 02:49:16,781 INFO L290 TraceCheckUtils]: 60: Hoare triple {22113#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22113#(<= main_~i~0 27)} is VALID [2022-04-28 02:49:16,782 INFO L290 TraceCheckUtils]: 61: Hoare triple {22113#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22114#(<= main_~i~0 28)} is VALID [2022-04-28 02:49:16,782 INFO L290 TraceCheckUtils]: 62: Hoare triple {22114#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22114#(<= main_~i~0 28)} is VALID [2022-04-28 02:49:16,782 INFO L290 TraceCheckUtils]: 63: Hoare triple {22114#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22115#(<= main_~i~0 29)} is VALID [2022-04-28 02:49:16,783 INFO L290 TraceCheckUtils]: 64: Hoare triple {22115#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22115#(<= main_~i~0 29)} is VALID [2022-04-28 02:49:16,783 INFO L290 TraceCheckUtils]: 65: Hoare triple {22115#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22116#(<= main_~i~0 30)} is VALID [2022-04-28 02:49:16,783 INFO L290 TraceCheckUtils]: 66: Hoare triple {22116#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22116#(<= main_~i~0 30)} is VALID [2022-04-28 02:49:16,784 INFO L290 TraceCheckUtils]: 67: Hoare triple {22116#(<= main_~i~0 30)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22117#(<= main_~i~0 31)} is VALID [2022-04-28 02:49:16,784 INFO L290 TraceCheckUtils]: 68: Hoare triple {22117#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22117#(<= main_~i~0 31)} is VALID [2022-04-28 02:49:16,784 INFO L290 TraceCheckUtils]: 69: Hoare triple {22117#(<= main_~i~0 31)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22118#(<= main_~i~0 32)} is VALID [2022-04-28 02:49:16,784 INFO L290 TraceCheckUtils]: 70: Hoare triple {22118#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22118#(<= main_~i~0 32)} is VALID [2022-04-28 02:49:16,785 INFO L290 TraceCheckUtils]: 71: Hoare triple {22118#(<= main_~i~0 32)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22119#(<= main_~i~0 33)} is VALID [2022-04-28 02:49:16,785 INFO L290 TraceCheckUtils]: 72: Hoare triple {22119#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22119#(<= main_~i~0 33)} is VALID [2022-04-28 02:49:16,785 INFO L290 TraceCheckUtils]: 73: Hoare triple {22119#(<= main_~i~0 33)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22120#(<= main_~i~0 34)} is VALID [2022-04-28 02:49:16,786 INFO L290 TraceCheckUtils]: 74: Hoare triple {22120#(<= main_~i~0 34)} assume !(~i~0 < 1024); {22082#false} is VALID [2022-04-28 02:49:16,786 INFO L290 TraceCheckUtils]: 75: Hoare triple {22082#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {22082#false} is VALID [2022-04-28 02:49:16,786 INFO L272 TraceCheckUtils]: 76: Hoare triple {22082#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {22082#false} is VALID [2022-04-28 02:49:16,786 INFO L290 TraceCheckUtils]: 77: Hoare triple {22082#false} ~cond := #in~cond; {22082#false} is VALID [2022-04-28 02:49:16,786 INFO L290 TraceCheckUtils]: 78: Hoare triple {22082#false} assume 0 == ~cond; {22082#false} is VALID [2022-04-28 02:49:16,786 INFO L290 TraceCheckUtils]: 79: Hoare triple {22082#false} assume !false; {22082#false} is VALID [2022-04-28 02:49:16,786 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:49:16,786 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:49:18,361 INFO L290 TraceCheckUtils]: 79: Hoare triple {22082#false} assume !false; {22082#false} is VALID [2022-04-28 02:49:18,361 INFO L290 TraceCheckUtils]: 78: Hoare triple {22082#false} assume 0 == ~cond; {22082#false} is VALID [2022-04-28 02:49:18,361 INFO L290 TraceCheckUtils]: 77: Hoare triple {22082#false} ~cond := #in~cond; {22082#false} is VALID [2022-04-28 02:49:18,362 INFO L272 TraceCheckUtils]: 76: Hoare triple {22082#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {22082#false} is VALID [2022-04-28 02:49:18,362 INFO L290 TraceCheckUtils]: 75: Hoare triple {22082#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {22082#false} is VALID [2022-04-28 02:49:18,362 INFO L290 TraceCheckUtils]: 74: Hoare triple {22378#(< main_~i~0 1024)} assume !(~i~0 < 1024); {22082#false} is VALID [2022-04-28 02:49:18,362 INFO L290 TraceCheckUtils]: 73: Hoare triple {22382#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22378#(< main_~i~0 1024)} is VALID [2022-04-28 02:49:18,363 INFO L290 TraceCheckUtils]: 72: Hoare triple {22382#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22382#(< main_~i~0 1023)} is VALID [2022-04-28 02:49:18,363 INFO L290 TraceCheckUtils]: 71: Hoare triple {22389#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22382#(< main_~i~0 1023)} is VALID [2022-04-28 02:49:18,363 INFO L290 TraceCheckUtils]: 70: Hoare triple {22389#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22389#(< main_~i~0 1022)} is VALID [2022-04-28 02:49:18,364 INFO L290 TraceCheckUtils]: 69: Hoare triple {22396#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22389#(< main_~i~0 1022)} is VALID [2022-04-28 02:49:18,364 INFO L290 TraceCheckUtils]: 68: Hoare triple {22396#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22396#(< main_~i~0 1021)} is VALID [2022-04-28 02:49:18,364 INFO L290 TraceCheckUtils]: 67: Hoare triple {22403#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22396#(< main_~i~0 1021)} is VALID [2022-04-28 02:49:18,364 INFO L290 TraceCheckUtils]: 66: Hoare triple {22403#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22403#(< main_~i~0 1020)} is VALID [2022-04-28 02:49:18,365 INFO L290 TraceCheckUtils]: 65: Hoare triple {22410#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22403#(< main_~i~0 1020)} is VALID [2022-04-28 02:49:18,365 INFO L290 TraceCheckUtils]: 64: Hoare triple {22410#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22410#(< main_~i~0 1019)} is VALID [2022-04-28 02:49:18,365 INFO L290 TraceCheckUtils]: 63: Hoare triple {22417#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22410#(< main_~i~0 1019)} is VALID [2022-04-28 02:49:18,366 INFO L290 TraceCheckUtils]: 62: Hoare triple {22417#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22417#(< main_~i~0 1018)} is VALID [2022-04-28 02:49:18,366 INFO L290 TraceCheckUtils]: 61: Hoare triple {22424#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22417#(< main_~i~0 1018)} is VALID [2022-04-28 02:49:18,366 INFO L290 TraceCheckUtils]: 60: Hoare triple {22424#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22424#(< main_~i~0 1017)} is VALID [2022-04-28 02:49:18,367 INFO L290 TraceCheckUtils]: 59: Hoare triple {22431#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22424#(< main_~i~0 1017)} is VALID [2022-04-28 02:49:18,367 INFO L290 TraceCheckUtils]: 58: Hoare triple {22431#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22431#(< main_~i~0 1016)} is VALID [2022-04-28 02:49:18,367 INFO L290 TraceCheckUtils]: 57: Hoare triple {22438#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22431#(< main_~i~0 1016)} is VALID [2022-04-28 02:49:18,368 INFO L290 TraceCheckUtils]: 56: Hoare triple {22438#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22438#(< main_~i~0 1015)} is VALID [2022-04-28 02:49:18,368 INFO L290 TraceCheckUtils]: 55: Hoare triple {22445#(< main_~i~0 1014)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22438#(< main_~i~0 1015)} is VALID [2022-04-28 02:49:18,368 INFO L290 TraceCheckUtils]: 54: Hoare triple {22445#(< main_~i~0 1014)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22445#(< main_~i~0 1014)} is VALID [2022-04-28 02:49:18,369 INFO L290 TraceCheckUtils]: 53: Hoare triple {22452#(< main_~i~0 1013)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22445#(< main_~i~0 1014)} is VALID [2022-04-28 02:49:18,369 INFO L290 TraceCheckUtils]: 52: Hoare triple {22452#(< main_~i~0 1013)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22452#(< main_~i~0 1013)} is VALID [2022-04-28 02:49:18,369 INFO L290 TraceCheckUtils]: 51: Hoare triple {22459#(< main_~i~0 1012)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22452#(< main_~i~0 1013)} is VALID [2022-04-28 02:49:18,369 INFO L290 TraceCheckUtils]: 50: Hoare triple {22459#(< main_~i~0 1012)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22459#(< main_~i~0 1012)} is VALID [2022-04-28 02:49:18,370 INFO L290 TraceCheckUtils]: 49: Hoare triple {22466#(< main_~i~0 1011)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22459#(< main_~i~0 1012)} is VALID [2022-04-28 02:49:18,370 INFO L290 TraceCheckUtils]: 48: Hoare triple {22466#(< main_~i~0 1011)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22466#(< main_~i~0 1011)} is VALID [2022-04-28 02:49:18,370 INFO L290 TraceCheckUtils]: 47: Hoare triple {22473#(< main_~i~0 1010)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22466#(< main_~i~0 1011)} is VALID [2022-04-28 02:49:18,371 INFO L290 TraceCheckUtils]: 46: Hoare triple {22473#(< main_~i~0 1010)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22473#(< main_~i~0 1010)} is VALID [2022-04-28 02:49:18,371 INFO L290 TraceCheckUtils]: 45: Hoare triple {22480#(< main_~i~0 1009)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22473#(< main_~i~0 1010)} is VALID [2022-04-28 02:49:18,371 INFO L290 TraceCheckUtils]: 44: Hoare triple {22480#(< main_~i~0 1009)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22480#(< main_~i~0 1009)} is VALID [2022-04-28 02:49:18,372 INFO L290 TraceCheckUtils]: 43: Hoare triple {22487#(< main_~i~0 1008)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22480#(< main_~i~0 1009)} is VALID [2022-04-28 02:49:18,372 INFO L290 TraceCheckUtils]: 42: Hoare triple {22487#(< main_~i~0 1008)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22487#(< main_~i~0 1008)} is VALID [2022-04-28 02:49:18,372 INFO L290 TraceCheckUtils]: 41: Hoare triple {22494#(< main_~i~0 1007)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22487#(< main_~i~0 1008)} is VALID [2022-04-28 02:49:18,373 INFO L290 TraceCheckUtils]: 40: Hoare triple {22494#(< main_~i~0 1007)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22494#(< main_~i~0 1007)} is VALID [2022-04-28 02:49:18,373 INFO L290 TraceCheckUtils]: 39: Hoare triple {22501#(< main_~i~0 1006)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22494#(< main_~i~0 1007)} is VALID [2022-04-28 02:49:18,373 INFO L290 TraceCheckUtils]: 38: Hoare triple {22501#(< main_~i~0 1006)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22501#(< main_~i~0 1006)} is VALID [2022-04-28 02:49:18,374 INFO L290 TraceCheckUtils]: 37: Hoare triple {22508#(< main_~i~0 1005)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22501#(< main_~i~0 1006)} is VALID [2022-04-28 02:49:18,374 INFO L290 TraceCheckUtils]: 36: Hoare triple {22508#(< main_~i~0 1005)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22508#(< main_~i~0 1005)} is VALID [2022-04-28 02:49:18,374 INFO L290 TraceCheckUtils]: 35: Hoare triple {22515#(< main_~i~0 1004)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22508#(< main_~i~0 1005)} is VALID [2022-04-28 02:49:18,374 INFO L290 TraceCheckUtils]: 34: Hoare triple {22515#(< main_~i~0 1004)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22515#(< main_~i~0 1004)} is VALID [2022-04-28 02:49:18,375 INFO L290 TraceCheckUtils]: 33: Hoare triple {22522#(< main_~i~0 1003)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22515#(< main_~i~0 1004)} is VALID [2022-04-28 02:49:18,375 INFO L290 TraceCheckUtils]: 32: Hoare triple {22522#(< main_~i~0 1003)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22522#(< main_~i~0 1003)} is VALID [2022-04-28 02:49:18,375 INFO L290 TraceCheckUtils]: 31: Hoare triple {22529#(< main_~i~0 1002)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22522#(< main_~i~0 1003)} is VALID [2022-04-28 02:49:18,376 INFO L290 TraceCheckUtils]: 30: Hoare triple {22529#(< main_~i~0 1002)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22529#(< main_~i~0 1002)} is VALID [2022-04-28 02:49:18,376 INFO L290 TraceCheckUtils]: 29: Hoare triple {22536#(< main_~i~0 1001)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22529#(< main_~i~0 1002)} is VALID [2022-04-28 02:49:18,376 INFO L290 TraceCheckUtils]: 28: Hoare triple {22536#(< main_~i~0 1001)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22536#(< main_~i~0 1001)} is VALID [2022-04-28 02:49:18,377 INFO L290 TraceCheckUtils]: 27: Hoare triple {22543#(< main_~i~0 1000)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22536#(< main_~i~0 1001)} is VALID [2022-04-28 02:49:18,377 INFO L290 TraceCheckUtils]: 26: Hoare triple {22543#(< main_~i~0 1000)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22543#(< main_~i~0 1000)} is VALID [2022-04-28 02:49:18,377 INFO L290 TraceCheckUtils]: 25: Hoare triple {22550#(< main_~i~0 999)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22543#(< main_~i~0 1000)} is VALID [2022-04-28 02:49:18,378 INFO L290 TraceCheckUtils]: 24: Hoare triple {22550#(< main_~i~0 999)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22550#(< main_~i~0 999)} is VALID [2022-04-28 02:49:18,378 INFO L290 TraceCheckUtils]: 23: Hoare triple {22557#(< main_~i~0 998)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22550#(< main_~i~0 999)} is VALID [2022-04-28 02:49:18,378 INFO L290 TraceCheckUtils]: 22: Hoare triple {22557#(< main_~i~0 998)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22557#(< main_~i~0 998)} is VALID [2022-04-28 02:49:18,379 INFO L290 TraceCheckUtils]: 21: Hoare triple {22564#(< main_~i~0 997)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22557#(< main_~i~0 998)} is VALID [2022-04-28 02:49:18,379 INFO L290 TraceCheckUtils]: 20: Hoare triple {22564#(< main_~i~0 997)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22564#(< main_~i~0 997)} is VALID [2022-04-28 02:49:18,379 INFO L290 TraceCheckUtils]: 19: Hoare triple {22571#(< main_~i~0 996)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22564#(< main_~i~0 997)} is VALID [2022-04-28 02:49:18,379 INFO L290 TraceCheckUtils]: 18: Hoare triple {22571#(< main_~i~0 996)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22571#(< main_~i~0 996)} is VALID [2022-04-28 02:49:18,380 INFO L290 TraceCheckUtils]: 17: Hoare triple {22578#(< main_~i~0 995)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22571#(< main_~i~0 996)} is VALID [2022-04-28 02:49:18,380 INFO L290 TraceCheckUtils]: 16: Hoare triple {22578#(< main_~i~0 995)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22578#(< main_~i~0 995)} is VALID [2022-04-28 02:49:18,380 INFO L290 TraceCheckUtils]: 15: Hoare triple {22585#(< main_~i~0 994)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22578#(< main_~i~0 995)} is VALID [2022-04-28 02:49:18,381 INFO L290 TraceCheckUtils]: 14: Hoare triple {22585#(< main_~i~0 994)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22585#(< main_~i~0 994)} is VALID [2022-04-28 02:49:18,381 INFO L290 TraceCheckUtils]: 13: Hoare triple {22592#(< main_~i~0 993)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22585#(< main_~i~0 994)} is VALID [2022-04-28 02:49:18,381 INFO L290 TraceCheckUtils]: 12: Hoare triple {22592#(< main_~i~0 993)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22592#(< main_~i~0 993)} is VALID [2022-04-28 02:49:18,382 INFO L290 TraceCheckUtils]: 11: Hoare triple {22599#(< main_~i~0 992)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22592#(< main_~i~0 993)} is VALID [2022-04-28 02:49:18,382 INFO L290 TraceCheckUtils]: 10: Hoare triple {22599#(< main_~i~0 992)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22599#(< main_~i~0 992)} is VALID [2022-04-28 02:49:18,382 INFO L290 TraceCheckUtils]: 9: Hoare triple {22606#(< main_~i~0 991)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22599#(< main_~i~0 992)} is VALID [2022-04-28 02:49:18,382 INFO L290 TraceCheckUtils]: 8: Hoare triple {22606#(< main_~i~0 991)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22606#(< main_~i~0 991)} is VALID [2022-04-28 02:49:18,383 INFO L290 TraceCheckUtils]: 7: Hoare triple {22613#(< main_~i~0 990)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22606#(< main_~i~0 991)} is VALID [2022-04-28 02:49:18,383 INFO L290 TraceCheckUtils]: 6: Hoare triple {22613#(< main_~i~0 990)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22613#(< main_~i~0 990)} is VALID [2022-04-28 02:49:18,383 INFO L290 TraceCheckUtils]: 5: Hoare triple {22081#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {22613#(< main_~i~0 990)} is VALID [2022-04-28 02:49:18,384 INFO L272 TraceCheckUtils]: 4: Hoare triple {22081#true} call #t~ret6 := main(); {22081#true} is VALID [2022-04-28 02:49:18,384 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22081#true} {22081#true} #39#return; {22081#true} is VALID [2022-04-28 02:49:18,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {22081#true} assume true; {22081#true} is VALID [2022-04-28 02:49:18,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {22081#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {22081#true} is VALID [2022-04-28 02:49:18,384 INFO L272 TraceCheckUtils]: 0: Hoare triple {22081#true} call ULTIMATE.init(); {22081#true} is VALID [2022-04-28 02:49:18,384 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:49:18,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1346651461] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:49:18,384 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:49:18,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 37, 37] total 74 [2022-04-28 02:49:18,387 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:49:18,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [177580604] [2022-04-28 02:49:18,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [177580604] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:49:18,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:49:18,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2022-04-28 02:49:18,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95866308] [2022-04-28 02:49:18,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:49:18,388 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.0) internal successors, (76), 37 states have internal predecessors, (76), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 80 [2022-04-28 02:49:18,388 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:49:18,388 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 38 states, 38 states have (on average 2.0) internal successors, (76), 37 states have internal predecessors, (76), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:49:18,452 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:49:18,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-04-28 02:49:18,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:49:18,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-04-28 02:49:18,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2630, Invalid=2772, Unknown=0, NotChecked=0, Total=5402 [2022-04-28 02:49:18,453 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand has 38 states, 38 states have (on average 2.0) internal successors, (76), 37 states have internal predecessors, (76), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:49:19,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:49:19,461 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2022-04-28 02:49:19,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-28 02:49:19,461 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.0) internal successors, (76), 37 states have internal predecessors, (76), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 80 [2022-04-28 02:49:19,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:49:19,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 2.0) internal successors, (76), 37 states have internal predecessors, (76), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:49:19,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 90 transitions. [2022-04-28 02:49:19,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 2.0) internal successors, (76), 37 states have internal predecessors, (76), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:49:19,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 90 transitions. [2022-04-28 02:49:19,463 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 90 transitions. [2022-04-28 02:49:19,558 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:49:19,559 INFO L225 Difference]: With dead ends: 90 [2022-04-28 02:49:19,559 INFO L226 Difference]: Without dead ends: 84 [2022-04-28 02:49:19,560 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 798 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=5186, Invalid=6586, Unknown=0, NotChecked=0, Total=11772 [2022-04-28 02:49:19,560 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 78 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:49:19,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 29 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:49:19,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-04-28 02:49:19,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2022-04-28 02:49:19,831 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:49:19,831 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand has 83 states, 78 states have (on average 1.0128205128205128) internal successors, (79), 78 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:49:19,831 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand has 83 states, 78 states have (on average 1.0128205128205128) internal successors, (79), 78 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:49:19,831 INFO L87 Difference]: Start difference. First operand 84 states. Second operand has 83 states, 78 states have (on average 1.0128205128205128) internal successors, (79), 78 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:49:19,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:49:19,832 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2022-04-28 02:49:19,832 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2022-04-28 02:49:19,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:49:19,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:49:19,832 INFO L74 IsIncluded]: Start isIncluded. First operand has 83 states, 78 states have (on average 1.0128205128205128) internal successors, (79), 78 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 84 states. [2022-04-28 02:49:19,833 INFO L87 Difference]: Start difference. First operand has 83 states, 78 states have (on average 1.0128205128205128) internal successors, (79), 78 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 84 states. [2022-04-28 02:49:19,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:49:19,834 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2022-04-28 02:49:19,834 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2022-04-28 02:49:19,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:49:19,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:49:19,834 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:49:19,834 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:49:19,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 78 states have (on average 1.0128205128205128) internal successors, (79), 78 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:49:19,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2022-04-28 02:49:19,835 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 80 [2022-04-28 02:49:19,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:49:19,835 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2022-04-28 02:49:19,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.0) internal successors, (76), 37 states have internal predecessors, (76), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:49:19,836 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 83 states and 83 transitions. [2022-04-28 02:49:19,956 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:49:19,957 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2022-04-28 02:49:19,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-28 02:49:19,958 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:49:19,958 INFO L195 NwaCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:49:19,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-04-28 02:49:20,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-04-28 02:49:20,171 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:49:20,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:49:20,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1606757696, now seen corresponding path program 69 times [2022-04-28 02:49:20,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:49:20,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1998485145] [2022-04-28 02:49:20,174 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:49:20,174 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:49:20,174 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:49:20,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1606757696, now seen corresponding path program 70 times [2022-04-28 02:49:20,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:49:20,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949671084] [2022-04-28 02:49:20,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:49:20,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:49:20,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:49:20,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:49:20,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:49:20,773 INFO L290 TraceCheckUtils]: 0: Hoare triple {23262#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {23221#true} is VALID [2022-04-28 02:49:20,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {23221#true} assume true; {23221#true} is VALID [2022-04-28 02:49:20,774 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23221#true} {23221#true} #39#return; {23221#true} is VALID [2022-04-28 02:49:20,777 INFO L272 TraceCheckUtils]: 0: Hoare triple {23221#true} call ULTIMATE.init(); {23262#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:49:20,777 INFO L290 TraceCheckUtils]: 1: Hoare triple {23262#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {23221#true} is VALID [2022-04-28 02:49:20,777 INFO L290 TraceCheckUtils]: 2: Hoare triple {23221#true} assume true; {23221#true} is VALID [2022-04-28 02:49:20,777 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23221#true} {23221#true} #39#return; {23221#true} is VALID [2022-04-28 02:49:20,777 INFO L272 TraceCheckUtils]: 4: Hoare triple {23221#true} call #t~ret6 := main(); {23221#true} is VALID [2022-04-28 02:49:20,777 INFO L290 TraceCheckUtils]: 5: Hoare triple {23221#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {23226#(= main_~i~0 0)} is VALID [2022-04-28 02:49:20,777 INFO L290 TraceCheckUtils]: 6: Hoare triple {23226#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23226#(= main_~i~0 0)} is VALID [2022-04-28 02:49:20,778 INFO L290 TraceCheckUtils]: 7: Hoare triple {23226#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23227#(<= main_~i~0 1)} is VALID [2022-04-28 02:49:20,778 INFO L290 TraceCheckUtils]: 8: Hoare triple {23227#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23227#(<= main_~i~0 1)} is VALID [2022-04-28 02:49:20,778 INFO L290 TraceCheckUtils]: 9: Hoare triple {23227#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23228#(<= main_~i~0 2)} is VALID [2022-04-28 02:49:20,779 INFO L290 TraceCheckUtils]: 10: Hoare triple {23228#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23228#(<= main_~i~0 2)} is VALID [2022-04-28 02:49:20,779 INFO L290 TraceCheckUtils]: 11: Hoare triple {23228#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23229#(<= main_~i~0 3)} is VALID [2022-04-28 02:49:20,779 INFO L290 TraceCheckUtils]: 12: Hoare triple {23229#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23229#(<= main_~i~0 3)} is VALID [2022-04-28 02:49:20,780 INFO L290 TraceCheckUtils]: 13: Hoare triple {23229#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23230#(<= main_~i~0 4)} is VALID [2022-04-28 02:49:20,780 INFO L290 TraceCheckUtils]: 14: Hoare triple {23230#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23230#(<= main_~i~0 4)} is VALID [2022-04-28 02:49:20,780 INFO L290 TraceCheckUtils]: 15: Hoare triple {23230#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23231#(<= main_~i~0 5)} is VALID [2022-04-28 02:49:20,781 INFO L290 TraceCheckUtils]: 16: Hoare triple {23231#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23231#(<= main_~i~0 5)} is VALID [2022-04-28 02:49:20,781 INFO L290 TraceCheckUtils]: 17: Hoare triple {23231#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23232#(<= main_~i~0 6)} is VALID [2022-04-28 02:49:20,781 INFO L290 TraceCheckUtils]: 18: Hoare triple {23232#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23232#(<= main_~i~0 6)} is VALID [2022-04-28 02:49:20,781 INFO L290 TraceCheckUtils]: 19: Hoare triple {23232#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23233#(<= main_~i~0 7)} is VALID [2022-04-28 02:49:20,782 INFO L290 TraceCheckUtils]: 20: Hoare triple {23233#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23233#(<= main_~i~0 7)} is VALID [2022-04-28 02:49:20,782 INFO L290 TraceCheckUtils]: 21: Hoare triple {23233#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23234#(<= main_~i~0 8)} is VALID [2022-04-28 02:49:20,782 INFO L290 TraceCheckUtils]: 22: Hoare triple {23234#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23234#(<= main_~i~0 8)} is VALID [2022-04-28 02:49:20,783 INFO L290 TraceCheckUtils]: 23: Hoare triple {23234#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23235#(<= main_~i~0 9)} is VALID [2022-04-28 02:49:20,783 INFO L290 TraceCheckUtils]: 24: Hoare triple {23235#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23235#(<= main_~i~0 9)} is VALID [2022-04-28 02:49:20,783 INFO L290 TraceCheckUtils]: 25: Hoare triple {23235#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23236#(<= main_~i~0 10)} is VALID [2022-04-28 02:49:20,784 INFO L290 TraceCheckUtils]: 26: Hoare triple {23236#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23236#(<= main_~i~0 10)} is VALID [2022-04-28 02:49:20,784 INFO L290 TraceCheckUtils]: 27: Hoare triple {23236#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23237#(<= main_~i~0 11)} is VALID [2022-04-28 02:49:20,784 INFO L290 TraceCheckUtils]: 28: Hoare triple {23237#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23237#(<= main_~i~0 11)} is VALID [2022-04-28 02:49:20,784 INFO L290 TraceCheckUtils]: 29: Hoare triple {23237#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23238#(<= main_~i~0 12)} is VALID [2022-04-28 02:49:20,785 INFO L290 TraceCheckUtils]: 30: Hoare triple {23238#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23238#(<= main_~i~0 12)} is VALID [2022-04-28 02:49:20,785 INFO L290 TraceCheckUtils]: 31: Hoare triple {23238#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23239#(<= main_~i~0 13)} is VALID [2022-04-28 02:49:20,785 INFO L290 TraceCheckUtils]: 32: Hoare triple {23239#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23239#(<= main_~i~0 13)} is VALID [2022-04-28 02:49:20,786 INFO L290 TraceCheckUtils]: 33: Hoare triple {23239#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23240#(<= main_~i~0 14)} is VALID [2022-04-28 02:49:20,786 INFO L290 TraceCheckUtils]: 34: Hoare triple {23240#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23240#(<= main_~i~0 14)} is VALID [2022-04-28 02:49:20,786 INFO L290 TraceCheckUtils]: 35: Hoare triple {23240#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23241#(<= main_~i~0 15)} is VALID [2022-04-28 02:49:20,787 INFO L290 TraceCheckUtils]: 36: Hoare triple {23241#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23241#(<= main_~i~0 15)} is VALID [2022-04-28 02:49:20,787 INFO L290 TraceCheckUtils]: 37: Hoare triple {23241#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23242#(<= main_~i~0 16)} is VALID [2022-04-28 02:49:20,787 INFO L290 TraceCheckUtils]: 38: Hoare triple {23242#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23242#(<= main_~i~0 16)} is VALID [2022-04-28 02:49:20,788 INFO L290 TraceCheckUtils]: 39: Hoare triple {23242#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23243#(<= main_~i~0 17)} is VALID [2022-04-28 02:49:20,788 INFO L290 TraceCheckUtils]: 40: Hoare triple {23243#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23243#(<= main_~i~0 17)} is VALID [2022-04-28 02:49:20,788 INFO L290 TraceCheckUtils]: 41: Hoare triple {23243#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23244#(<= main_~i~0 18)} is VALID [2022-04-28 02:49:20,788 INFO L290 TraceCheckUtils]: 42: Hoare triple {23244#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23244#(<= main_~i~0 18)} is VALID [2022-04-28 02:49:20,789 INFO L290 TraceCheckUtils]: 43: Hoare triple {23244#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23245#(<= main_~i~0 19)} is VALID [2022-04-28 02:49:20,789 INFO L290 TraceCheckUtils]: 44: Hoare triple {23245#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23245#(<= main_~i~0 19)} is VALID [2022-04-28 02:49:20,789 INFO L290 TraceCheckUtils]: 45: Hoare triple {23245#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23246#(<= main_~i~0 20)} is VALID [2022-04-28 02:49:20,790 INFO L290 TraceCheckUtils]: 46: Hoare triple {23246#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23246#(<= main_~i~0 20)} is VALID [2022-04-28 02:49:20,790 INFO L290 TraceCheckUtils]: 47: Hoare triple {23246#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23247#(<= main_~i~0 21)} is VALID [2022-04-28 02:49:20,790 INFO L290 TraceCheckUtils]: 48: Hoare triple {23247#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23247#(<= main_~i~0 21)} is VALID [2022-04-28 02:49:20,791 INFO L290 TraceCheckUtils]: 49: Hoare triple {23247#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23248#(<= main_~i~0 22)} is VALID [2022-04-28 02:49:20,791 INFO L290 TraceCheckUtils]: 50: Hoare triple {23248#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23248#(<= main_~i~0 22)} is VALID [2022-04-28 02:49:20,791 INFO L290 TraceCheckUtils]: 51: Hoare triple {23248#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23249#(<= main_~i~0 23)} is VALID [2022-04-28 02:49:20,791 INFO L290 TraceCheckUtils]: 52: Hoare triple {23249#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23249#(<= main_~i~0 23)} is VALID [2022-04-28 02:49:20,792 INFO L290 TraceCheckUtils]: 53: Hoare triple {23249#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23250#(<= main_~i~0 24)} is VALID [2022-04-28 02:49:20,792 INFO L290 TraceCheckUtils]: 54: Hoare triple {23250#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23250#(<= main_~i~0 24)} is VALID [2022-04-28 02:49:20,792 INFO L290 TraceCheckUtils]: 55: Hoare triple {23250#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23251#(<= main_~i~0 25)} is VALID [2022-04-28 02:49:20,793 INFO L290 TraceCheckUtils]: 56: Hoare triple {23251#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23251#(<= main_~i~0 25)} is VALID [2022-04-28 02:49:20,793 INFO L290 TraceCheckUtils]: 57: Hoare triple {23251#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23252#(<= main_~i~0 26)} is VALID [2022-04-28 02:49:20,793 INFO L290 TraceCheckUtils]: 58: Hoare triple {23252#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23252#(<= main_~i~0 26)} is VALID [2022-04-28 02:49:20,794 INFO L290 TraceCheckUtils]: 59: Hoare triple {23252#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23253#(<= main_~i~0 27)} is VALID [2022-04-28 02:49:20,794 INFO L290 TraceCheckUtils]: 60: Hoare triple {23253#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23253#(<= main_~i~0 27)} is VALID [2022-04-28 02:49:20,794 INFO L290 TraceCheckUtils]: 61: Hoare triple {23253#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23254#(<= main_~i~0 28)} is VALID [2022-04-28 02:49:20,794 INFO L290 TraceCheckUtils]: 62: Hoare triple {23254#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23254#(<= main_~i~0 28)} is VALID [2022-04-28 02:49:20,795 INFO L290 TraceCheckUtils]: 63: Hoare triple {23254#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23255#(<= main_~i~0 29)} is VALID [2022-04-28 02:49:20,795 INFO L290 TraceCheckUtils]: 64: Hoare triple {23255#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23255#(<= main_~i~0 29)} is VALID [2022-04-28 02:49:20,795 INFO L290 TraceCheckUtils]: 65: Hoare triple {23255#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23256#(<= main_~i~0 30)} is VALID [2022-04-28 02:49:20,796 INFO L290 TraceCheckUtils]: 66: Hoare triple {23256#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23256#(<= main_~i~0 30)} is VALID [2022-04-28 02:49:20,796 INFO L290 TraceCheckUtils]: 67: Hoare triple {23256#(<= main_~i~0 30)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23257#(<= main_~i~0 31)} is VALID [2022-04-28 02:49:20,796 INFO L290 TraceCheckUtils]: 68: Hoare triple {23257#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23257#(<= main_~i~0 31)} is VALID [2022-04-28 02:49:20,797 INFO L290 TraceCheckUtils]: 69: Hoare triple {23257#(<= main_~i~0 31)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23258#(<= main_~i~0 32)} is VALID [2022-04-28 02:49:20,797 INFO L290 TraceCheckUtils]: 70: Hoare triple {23258#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23258#(<= main_~i~0 32)} is VALID [2022-04-28 02:49:20,797 INFO L290 TraceCheckUtils]: 71: Hoare triple {23258#(<= main_~i~0 32)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23259#(<= main_~i~0 33)} is VALID [2022-04-28 02:49:20,797 INFO L290 TraceCheckUtils]: 72: Hoare triple {23259#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23259#(<= main_~i~0 33)} is VALID [2022-04-28 02:49:20,798 INFO L290 TraceCheckUtils]: 73: Hoare triple {23259#(<= main_~i~0 33)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23260#(<= main_~i~0 34)} is VALID [2022-04-28 02:49:20,798 INFO L290 TraceCheckUtils]: 74: Hoare triple {23260#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23260#(<= main_~i~0 34)} is VALID [2022-04-28 02:49:20,798 INFO L290 TraceCheckUtils]: 75: Hoare triple {23260#(<= main_~i~0 34)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23261#(<= main_~i~0 35)} is VALID [2022-04-28 02:49:20,799 INFO L290 TraceCheckUtils]: 76: Hoare triple {23261#(<= main_~i~0 35)} assume !(~i~0 < 1024); {23222#false} is VALID [2022-04-28 02:49:20,799 INFO L290 TraceCheckUtils]: 77: Hoare triple {23222#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {23222#false} is VALID [2022-04-28 02:49:20,799 INFO L272 TraceCheckUtils]: 78: Hoare triple {23222#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {23222#false} is VALID [2022-04-28 02:49:20,799 INFO L290 TraceCheckUtils]: 79: Hoare triple {23222#false} ~cond := #in~cond; {23222#false} is VALID [2022-04-28 02:49:20,799 INFO L290 TraceCheckUtils]: 80: Hoare triple {23222#false} assume 0 == ~cond; {23222#false} is VALID [2022-04-28 02:49:20,799 INFO L290 TraceCheckUtils]: 81: Hoare triple {23222#false} assume !false; {23222#false} is VALID [2022-04-28 02:49:20,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:49:20,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:49:20,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949671084] [2022-04-28 02:49:20,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949671084] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:49:20,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100248286] [2022-04-28 02:49:20,800 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 02:49:20,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:49:20,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:49:20,801 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:49:20,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-04-28 02:49:20,974 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 02:49:20,974 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:49:20,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-28 02:49:21,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:49:21,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:49:21,453 INFO L272 TraceCheckUtils]: 0: Hoare triple {23221#true} call ULTIMATE.init(); {23221#true} is VALID [2022-04-28 02:49:21,453 INFO L290 TraceCheckUtils]: 1: Hoare triple {23221#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {23221#true} is VALID [2022-04-28 02:49:21,453 INFO L290 TraceCheckUtils]: 2: Hoare triple {23221#true} assume true; {23221#true} is VALID [2022-04-28 02:49:21,453 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23221#true} {23221#true} #39#return; {23221#true} is VALID [2022-04-28 02:49:21,453 INFO L272 TraceCheckUtils]: 4: Hoare triple {23221#true} call #t~ret6 := main(); {23221#true} is VALID [2022-04-28 02:49:21,454 INFO L290 TraceCheckUtils]: 5: Hoare triple {23221#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {23281#(<= main_~i~0 0)} is VALID [2022-04-28 02:49:21,454 INFO L290 TraceCheckUtils]: 6: Hoare triple {23281#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23281#(<= main_~i~0 0)} is VALID [2022-04-28 02:49:21,454 INFO L290 TraceCheckUtils]: 7: Hoare triple {23281#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23227#(<= main_~i~0 1)} is VALID [2022-04-28 02:49:21,455 INFO L290 TraceCheckUtils]: 8: Hoare triple {23227#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23227#(<= main_~i~0 1)} is VALID [2022-04-28 02:49:21,455 INFO L290 TraceCheckUtils]: 9: Hoare triple {23227#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23228#(<= main_~i~0 2)} is VALID [2022-04-28 02:49:21,455 INFO L290 TraceCheckUtils]: 10: Hoare triple {23228#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23228#(<= main_~i~0 2)} is VALID [2022-04-28 02:49:21,456 INFO L290 TraceCheckUtils]: 11: Hoare triple {23228#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23229#(<= main_~i~0 3)} is VALID [2022-04-28 02:49:21,456 INFO L290 TraceCheckUtils]: 12: Hoare triple {23229#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23229#(<= main_~i~0 3)} is VALID [2022-04-28 02:49:21,456 INFO L290 TraceCheckUtils]: 13: Hoare triple {23229#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23230#(<= main_~i~0 4)} is VALID [2022-04-28 02:49:21,456 INFO L290 TraceCheckUtils]: 14: Hoare triple {23230#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23230#(<= main_~i~0 4)} is VALID [2022-04-28 02:49:21,457 INFO L290 TraceCheckUtils]: 15: Hoare triple {23230#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23231#(<= main_~i~0 5)} is VALID [2022-04-28 02:49:21,457 INFO L290 TraceCheckUtils]: 16: Hoare triple {23231#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23231#(<= main_~i~0 5)} is VALID [2022-04-28 02:49:21,457 INFO L290 TraceCheckUtils]: 17: Hoare triple {23231#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23232#(<= main_~i~0 6)} is VALID [2022-04-28 02:49:21,458 INFO L290 TraceCheckUtils]: 18: Hoare triple {23232#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23232#(<= main_~i~0 6)} is VALID [2022-04-28 02:49:21,458 INFO L290 TraceCheckUtils]: 19: Hoare triple {23232#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23233#(<= main_~i~0 7)} is VALID [2022-04-28 02:49:21,458 INFO L290 TraceCheckUtils]: 20: Hoare triple {23233#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23233#(<= main_~i~0 7)} is VALID [2022-04-28 02:49:21,459 INFO L290 TraceCheckUtils]: 21: Hoare triple {23233#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23234#(<= main_~i~0 8)} is VALID [2022-04-28 02:49:21,459 INFO L290 TraceCheckUtils]: 22: Hoare triple {23234#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23234#(<= main_~i~0 8)} is VALID [2022-04-28 02:49:21,459 INFO L290 TraceCheckUtils]: 23: Hoare triple {23234#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23235#(<= main_~i~0 9)} is VALID [2022-04-28 02:49:21,459 INFO L290 TraceCheckUtils]: 24: Hoare triple {23235#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23235#(<= main_~i~0 9)} is VALID [2022-04-28 02:49:21,460 INFO L290 TraceCheckUtils]: 25: Hoare triple {23235#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23236#(<= main_~i~0 10)} is VALID [2022-04-28 02:49:21,460 INFO L290 TraceCheckUtils]: 26: Hoare triple {23236#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23236#(<= main_~i~0 10)} is VALID [2022-04-28 02:49:21,460 INFO L290 TraceCheckUtils]: 27: Hoare triple {23236#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23237#(<= main_~i~0 11)} is VALID [2022-04-28 02:49:21,461 INFO L290 TraceCheckUtils]: 28: Hoare triple {23237#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23237#(<= main_~i~0 11)} is VALID [2022-04-28 02:49:21,461 INFO L290 TraceCheckUtils]: 29: Hoare triple {23237#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23238#(<= main_~i~0 12)} is VALID [2022-04-28 02:49:21,461 INFO L290 TraceCheckUtils]: 30: Hoare triple {23238#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23238#(<= main_~i~0 12)} is VALID [2022-04-28 02:49:21,462 INFO L290 TraceCheckUtils]: 31: Hoare triple {23238#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23239#(<= main_~i~0 13)} is VALID [2022-04-28 02:49:21,462 INFO L290 TraceCheckUtils]: 32: Hoare triple {23239#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23239#(<= main_~i~0 13)} is VALID [2022-04-28 02:49:21,462 INFO L290 TraceCheckUtils]: 33: Hoare triple {23239#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23240#(<= main_~i~0 14)} is VALID [2022-04-28 02:49:21,463 INFO L290 TraceCheckUtils]: 34: Hoare triple {23240#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23240#(<= main_~i~0 14)} is VALID [2022-04-28 02:49:21,463 INFO L290 TraceCheckUtils]: 35: Hoare triple {23240#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23241#(<= main_~i~0 15)} is VALID [2022-04-28 02:49:21,463 INFO L290 TraceCheckUtils]: 36: Hoare triple {23241#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23241#(<= main_~i~0 15)} is VALID [2022-04-28 02:49:21,464 INFO L290 TraceCheckUtils]: 37: Hoare triple {23241#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23242#(<= main_~i~0 16)} is VALID [2022-04-28 02:49:21,464 INFO L290 TraceCheckUtils]: 38: Hoare triple {23242#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23242#(<= main_~i~0 16)} is VALID [2022-04-28 02:49:21,464 INFO L290 TraceCheckUtils]: 39: Hoare triple {23242#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23243#(<= main_~i~0 17)} is VALID [2022-04-28 02:49:21,464 INFO L290 TraceCheckUtils]: 40: Hoare triple {23243#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23243#(<= main_~i~0 17)} is VALID [2022-04-28 02:49:21,465 INFO L290 TraceCheckUtils]: 41: Hoare triple {23243#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23244#(<= main_~i~0 18)} is VALID [2022-04-28 02:49:21,465 INFO L290 TraceCheckUtils]: 42: Hoare triple {23244#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23244#(<= main_~i~0 18)} is VALID [2022-04-28 02:49:21,465 INFO L290 TraceCheckUtils]: 43: Hoare triple {23244#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23245#(<= main_~i~0 19)} is VALID [2022-04-28 02:49:21,466 INFO L290 TraceCheckUtils]: 44: Hoare triple {23245#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23245#(<= main_~i~0 19)} is VALID [2022-04-28 02:49:21,466 INFO L290 TraceCheckUtils]: 45: Hoare triple {23245#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23246#(<= main_~i~0 20)} is VALID [2022-04-28 02:49:21,466 INFO L290 TraceCheckUtils]: 46: Hoare triple {23246#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23246#(<= main_~i~0 20)} is VALID [2022-04-28 02:49:21,467 INFO L290 TraceCheckUtils]: 47: Hoare triple {23246#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23247#(<= main_~i~0 21)} is VALID [2022-04-28 02:49:21,467 INFO L290 TraceCheckUtils]: 48: Hoare triple {23247#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23247#(<= main_~i~0 21)} is VALID [2022-04-28 02:49:21,467 INFO L290 TraceCheckUtils]: 49: Hoare triple {23247#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23248#(<= main_~i~0 22)} is VALID [2022-04-28 02:49:21,467 INFO L290 TraceCheckUtils]: 50: Hoare triple {23248#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23248#(<= main_~i~0 22)} is VALID [2022-04-28 02:49:21,468 INFO L290 TraceCheckUtils]: 51: Hoare triple {23248#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23249#(<= main_~i~0 23)} is VALID [2022-04-28 02:49:21,468 INFO L290 TraceCheckUtils]: 52: Hoare triple {23249#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23249#(<= main_~i~0 23)} is VALID [2022-04-28 02:49:21,468 INFO L290 TraceCheckUtils]: 53: Hoare triple {23249#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23250#(<= main_~i~0 24)} is VALID [2022-04-28 02:49:21,469 INFO L290 TraceCheckUtils]: 54: Hoare triple {23250#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23250#(<= main_~i~0 24)} is VALID [2022-04-28 02:49:21,469 INFO L290 TraceCheckUtils]: 55: Hoare triple {23250#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23251#(<= main_~i~0 25)} is VALID [2022-04-28 02:49:21,469 INFO L290 TraceCheckUtils]: 56: Hoare triple {23251#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23251#(<= main_~i~0 25)} is VALID [2022-04-28 02:49:21,470 INFO L290 TraceCheckUtils]: 57: Hoare triple {23251#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23252#(<= main_~i~0 26)} is VALID [2022-04-28 02:49:21,470 INFO L290 TraceCheckUtils]: 58: Hoare triple {23252#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23252#(<= main_~i~0 26)} is VALID [2022-04-28 02:49:21,470 INFO L290 TraceCheckUtils]: 59: Hoare triple {23252#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23253#(<= main_~i~0 27)} is VALID [2022-04-28 02:49:21,471 INFO L290 TraceCheckUtils]: 60: Hoare triple {23253#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23253#(<= main_~i~0 27)} is VALID [2022-04-28 02:49:21,471 INFO L290 TraceCheckUtils]: 61: Hoare triple {23253#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23254#(<= main_~i~0 28)} is VALID [2022-04-28 02:49:21,471 INFO L290 TraceCheckUtils]: 62: Hoare triple {23254#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23254#(<= main_~i~0 28)} is VALID [2022-04-28 02:49:21,471 INFO L290 TraceCheckUtils]: 63: Hoare triple {23254#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23255#(<= main_~i~0 29)} is VALID [2022-04-28 02:49:21,472 INFO L290 TraceCheckUtils]: 64: Hoare triple {23255#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23255#(<= main_~i~0 29)} is VALID [2022-04-28 02:49:21,472 INFO L290 TraceCheckUtils]: 65: Hoare triple {23255#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23256#(<= main_~i~0 30)} is VALID [2022-04-28 02:49:21,472 INFO L290 TraceCheckUtils]: 66: Hoare triple {23256#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23256#(<= main_~i~0 30)} is VALID [2022-04-28 02:49:21,473 INFO L290 TraceCheckUtils]: 67: Hoare triple {23256#(<= main_~i~0 30)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23257#(<= main_~i~0 31)} is VALID [2022-04-28 02:49:21,473 INFO L290 TraceCheckUtils]: 68: Hoare triple {23257#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23257#(<= main_~i~0 31)} is VALID [2022-04-28 02:49:21,473 INFO L290 TraceCheckUtils]: 69: Hoare triple {23257#(<= main_~i~0 31)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23258#(<= main_~i~0 32)} is VALID [2022-04-28 02:49:21,474 INFO L290 TraceCheckUtils]: 70: Hoare triple {23258#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23258#(<= main_~i~0 32)} is VALID [2022-04-28 02:49:21,474 INFO L290 TraceCheckUtils]: 71: Hoare triple {23258#(<= main_~i~0 32)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23259#(<= main_~i~0 33)} is VALID [2022-04-28 02:49:21,474 INFO L290 TraceCheckUtils]: 72: Hoare triple {23259#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23259#(<= main_~i~0 33)} is VALID [2022-04-28 02:49:21,475 INFO L290 TraceCheckUtils]: 73: Hoare triple {23259#(<= main_~i~0 33)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23260#(<= main_~i~0 34)} is VALID [2022-04-28 02:49:21,475 INFO L290 TraceCheckUtils]: 74: Hoare triple {23260#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23260#(<= main_~i~0 34)} is VALID [2022-04-28 02:49:21,475 INFO L290 TraceCheckUtils]: 75: Hoare triple {23260#(<= main_~i~0 34)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23261#(<= main_~i~0 35)} is VALID [2022-04-28 02:49:21,475 INFO L290 TraceCheckUtils]: 76: Hoare triple {23261#(<= main_~i~0 35)} assume !(~i~0 < 1024); {23222#false} is VALID [2022-04-28 02:49:21,476 INFO L290 TraceCheckUtils]: 77: Hoare triple {23222#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {23222#false} is VALID [2022-04-28 02:49:21,476 INFO L272 TraceCheckUtils]: 78: Hoare triple {23222#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {23222#false} is VALID [2022-04-28 02:49:21,476 INFO L290 TraceCheckUtils]: 79: Hoare triple {23222#false} ~cond := #in~cond; {23222#false} is VALID [2022-04-28 02:49:21,476 INFO L290 TraceCheckUtils]: 80: Hoare triple {23222#false} assume 0 == ~cond; {23222#false} is VALID [2022-04-28 02:49:21,476 INFO L290 TraceCheckUtils]: 81: Hoare triple {23222#false} assume !false; {23222#false} is VALID [2022-04-28 02:49:21,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:49:21,476 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:49:23,141 INFO L290 TraceCheckUtils]: 81: Hoare triple {23222#false} assume !false; {23222#false} is VALID [2022-04-28 02:49:23,142 INFO L290 TraceCheckUtils]: 80: Hoare triple {23222#false} assume 0 == ~cond; {23222#false} is VALID [2022-04-28 02:49:23,142 INFO L290 TraceCheckUtils]: 79: Hoare triple {23222#false} ~cond := #in~cond; {23222#false} is VALID [2022-04-28 02:49:23,142 INFO L272 TraceCheckUtils]: 78: Hoare triple {23222#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {23222#false} is VALID [2022-04-28 02:49:23,142 INFO L290 TraceCheckUtils]: 77: Hoare triple {23222#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {23222#false} is VALID [2022-04-28 02:49:23,142 INFO L290 TraceCheckUtils]: 76: Hoare triple {23525#(< main_~i~0 1024)} assume !(~i~0 < 1024); {23222#false} is VALID [2022-04-28 02:49:23,142 INFO L290 TraceCheckUtils]: 75: Hoare triple {23529#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23525#(< main_~i~0 1024)} is VALID [2022-04-28 02:49:23,143 INFO L290 TraceCheckUtils]: 74: Hoare triple {23529#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23529#(< main_~i~0 1023)} is VALID [2022-04-28 02:49:23,143 INFO L290 TraceCheckUtils]: 73: Hoare triple {23536#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23529#(< main_~i~0 1023)} is VALID [2022-04-28 02:49:23,143 INFO L290 TraceCheckUtils]: 72: Hoare triple {23536#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23536#(< main_~i~0 1022)} is VALID [2022-04-28 02:49:23,144 INFO L290 TraceCheckUtils]: 71: Hoare triple {23543#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23536#(< main_~i~0 1022)} is VALID [2022-04-28 02:49:23,144 INFO L290 TraceCheckUtils]: 70: Hoare triple {23543#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23543#(< main_~i~0 1021)} is VALID [2022-04-28 02:49:23,144 INFO L290 TraceCheckUtils]: 69: Hoare triple {23550#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23543#(< main_~i~0 1021)} is VALID [2022-04-28 02:49:23,145 INFO L290 TraceCheckUtils]: 68: Hoare triple {23550#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23550#(< main_~i~0 1020)} is VALID [2022-04-28 02:49:23,145 INFO L290 TraceCheckUtils]: 67: Hoare triple {23557#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23550#(< main_~i~0 1020)} is VALID [2022-04-28 02:49:23,145 INFO L290 TraceCheckUtils]: 66: Hoare triple {23557#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23557#(< main_~i~0 1019)} is VALID [2022-04-28 02:49:23,146 INFO L290 TraceCheckUtils]: 65: Hoare triple {23564#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23557#(< main_~i~0 1019)} is VALID [2022-04-28 02:49:23,146 INFO L290 TraceCheckUtils]: 64: Hoare triple {23564#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23564#(< main_~i~0 1018)} is VALID [2022-04-28 02:49:23,146 INFO L290 TraceCheckUtils]: 63: Hoare triple {23571#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23564#(< main_~i~0 1018)} is VALID [2022-04-28 02:49:23,146 INFO L290 TraceCheckUtils]: 62: Hoare triple {23571#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23571#(< main_~i~0 1017)} is VALID [2022-04-28 02:49:23,147 INFO L290 TraceCheckUtils]: 61: Hoare triple {23578#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23571#(< main_~i~0 1017)} is VALID [2022-04-28 02:49:23,147 INFO L290 TraceCheckUtils]: 60: Hoare triple {23578#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23578#(< main_~i~0 1016)} is VALID [2022-04-28 02:49:23,147 INFO L290 TraceCheckUtils]: 59: Hoare triple {23585#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23578#(< main_~i~0 1016)} is VALID [2022-04-28 02:49:23,148 INFO L290 TraceCheckUtils]: 58: Hoare triple {23585#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23585#(< main_~i~0 1015)} is VALID [2022-04-28 02:49:23,148 INFO L290 TraceCheckUtils]: 57: Hoare triple {23592#(< main_~i~0 1014)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23585#(< main_~i~0 1015)} is VALID [2022-04-28 02:49:23,148 INFO L290 TraceCheckUtils]: 56: Hoare triple {23592#(< main_~i~0 1014)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23592#(< main_~i~0 1014)} is VALID [2022-04-28 02:49:23,149 INFO L290 TraceCheckUtils]: 55: Hoare triple {23599#(< main_~i~0 1013)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23592#(< main_~i~0 1014)} is VALID [2022-04-28 02:49:23,149 INFO L290 TraceCheckUtils]: 54: Hoare triple {23599#(< main_~i~0 1013)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23599#(< main_~i~0 1013)} is VALID [2022-04-28 02:49:23,149 INFO L290 TraceCheckUtils]: 53: Hoare triple {23606#(< main_~i~0 1012)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23599#(< main_~i~0 1013)} is VALID [2022-04-28 02:49:23,150 INFO L290 TraceCheckUtils]: 52: Hoare triple {23606#(< main_~i~0 1012)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23606#(< main_~i~0 1012)} is VALID [2022-04-28 02:49:23,150 INFO L290 TraceCheckUtils]: 51: Hoare triple {23613#(< main_~i~0 1011)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23606#(< main_~i~0 1012)} is VALID [2022-04-28 02:49:23,150 INFO L290 TraceCheckUtils]: 50: Hoare triple {23613#(< main_~i~0 1011)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23613#(< main_~i~0 1011)} is VALID [2022-04-28 02:49:23,151 INFO L290 TraceCheckUtils]: 49: Hoare triple {23620#(< main_~i~0 1010)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23613#(< main_~i~0 1011)} is VALID [2022-04-28 02:49:23,151 INFO L290 TraceCheckUtils]: 48: Hoare triple {23620#(< main_~i~0 1010)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23620#(< main_~i~0 1010)} is VALID [2022-04-28 02:49:23,151 INFO L290 TraceCheckUtils]: 47: Hoare triple {23627#(< main_~i~0 1009)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23620#(< main_~i~0 1010)} is VALID [2022-04-28 02:49:23,151 INFO L290 TraceCheckUtils]: 46: Hoare triple {23627#(< main_~i~0 1009)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23627#(< main_~i~0 1009)} is VALID [2022-04-28 02:49:23,152 INFO L290 TraceCheckUtils]: 45: Hoare triple {23634#(< main_~i~0 1008)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23627#(< main_~i~0 1009)} is VALID [2022-04-28 02:49:23,152 INFO L290 TraceCheckUtils]: 44: Hoare triple {23634#(< main_~i~0 1008)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23634#(< main_~i~0 1008)} is VALID [2022-04-28 02:49:23,152 INFO L290 TraceCheckUtils]: 43: Hoare triple {23641#(< main_~i~0 1007)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23634#(< main_~i~0 1008)} is VALID [2022-04-28 02:49:23,153 INFO L290 TraceCheckUtils]: 42: Hoare triple {23641#(< main_~i~0 1007)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23641#(< main_~i~0 1007)} is VALID [2022-04-28 02:49:23,153 INFO L290 TraceCheckUtils]: 41: Hoare triple {23648#(< main_~i~0 1006)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23641#(< main_~i~0 1007)} is VALID [2022-04-28 02:49:23,153 INFO L290 TraceCheckUtils]: 40: Hoare triple {23648#(< main_~i~0 1006)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23648#(< main_~i~0 1006)} is VALID [2022-04-28 02:49:23,154 INFO L290 TraceCheckUtils]: 39: Hoare triple {23655#(< main_~i~0 1005)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23648#(< main_~i~0 1006)} is VALID [2022-04-28 02:49:23,154 INFO L290 TraceCheckUtils]: 38: Hoare triple {23655#(< main_~i~0 1005)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23655#(< main_~i~0 1005)} is VALID [2022-04-28 02:49:23,154 INFO L290 TraceCheckUtils]: 37: Hoare triple {23662#(< main_~i~0 1004)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23655#(< main_~i~0 1005)} is VALID [2022-04-28 02:49:23,155 INFO L290 TraceCheckUtils]: 36: Hoare triple {23662#(< main_~i~0 1004)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23662#(< main_~i~0 1004)} is VALID [2022-04-28 02:49:23,155 INFO L290 TraceCheckUtils]: 35: Hoare triple {23669#(< main_~i~0 1003)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23662#(< main_~i~0 1004)} is VALID [2022-04-28 02:49:23,155 INFO L290 TraceCheckUtils]: 34: Hoare triple {23669#(< main_~i~0 1003)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23669#(< main_~i~0 1003)} is VALID [2022-04-28 02:49:23,156 INFO L290 TraceCheckUtils]: 33: Hoare triple {23676#(< main_~i~0 1002)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23669#(< main_~i~0 1003)} is VALID [2022-04-28 02:49:23,156 INFO L290 TraceCheckUtils]: 32: Hoare triple {23676#(< main_~i~0 1002)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23676#(< main_~i~0 1002)} is VALID [2022-04-28 02:49:23,156 INFO L290 TraceCheckUtils]: 31: Hoare triple {23683#(< main_~i~0 1001)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23676#(< main_~i~0 1002)} is VALID [2022-04-28 02:49:23,156 INFO L290 TraceCheckUtils]: 30: Hoare triple {23683#(< main_~i~0 1001)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23683#(< main_~i~0 1001)} is VALID [2022-04-28 02:49:23,157 INFO L290 TraceCheckUtils]: 29: Hoare triple {23690#(< main_~i~0 1000)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23683#(< main_~i~0 1001)} is VALID [2022-04-28 02:49:23,157 INFO L290 TraceCheckUtils]: 28: Hoare triple {23690#(< main_~i~0 1000)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23690#(< main_~i~0 1000)} is VALID [2022-04-28 02:49:23,157 INFO L290 TraceCheckUtils]: 27: Hoare triple {23697#(< main_~i~0 999)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23690#(< main_~i~0 1000)} is VALID [2022-04-28 02:49:23,158 INFO L290 TraceCheckUtils]: 26: Hoare triple {23697#(< main_~i~0 999)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23697#(< main_~i~0 999)} is VALID [2022-04-28 02:49:23,158 INFO L290 TraceCheckUtils]: 25: Hoare triple {23704#(< main_~i~0 998)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23697#(< main_~i~0 999)} is VALID [2022-04-28 02:49:23,158 INFO L290 TraceCheckUtils]: 24: Hoare triple {23704#(< main_~i~0 998)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23704#(< main_~i~0 998)} is VALID [2022-04-28 02:49:23,159 INFO L290 TraceCheckUtils]: 23: Hoare triple {23711#(< main_~i~0 997)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23704#(< main_~i~0 998)} is VALID [2022-04-28 02:49:23,159 INFO L290 TraceCheckUtils]: 22: Hoare triple {23711#(< main_~i~0 997)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23711#(< main_~i~0 997)} is VALID [2022-04-28 02:49:23,159 INFO L290 TraceCheckUtils]: 21: Hoare triple {23718#(< main_~i~0 996)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23711#(< main_~i~0 997)} is VALID [2022-04-28 02:49:23,160 INFO L290 TraceCheckUtils]: 20: Hoare triple {23718#(< main_~i~0 996)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23718#(< main_~i~0 996)} is VALID [2022-04-28 02:49:23,160 INFO L290 TraceCheckUtils]: 19: Hoare triple {23725#(< main_~i~0 995)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23718#(< main_~i~0 996)} is VALID [2022-04-28 02:49:23,160 INFO L290 TraceCheckUtils]: 18: Hoare triple {23725#(< main_~i~0 995)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23725#(< main_~i~0 995)} is VALID [2022-04-28 02:49:23,161 INFO L290 TraceCheckUtils]: 17: Hoare triple {23732#(< main_~i~0 994)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23725#(< main_~i~0 995)} is VALID [2022-04-28 02:49:23,161 INFO L290 TraceCheckUtils]: 16: Hoare triple {23732#(< main_~i~0 994)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23732#(< main_~i~0 994)} is VALID [2022-04-28 02:49:23,161 INFO L290 TraceCheckUtils]: 15: Hoare triple {23739#(< main_~i~0 993)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23732#(< main_~i~0 994)} is VALID [2022-04-28 02:49:23,161 INFO L290 TraceCheckUtils]: 14: Hoare triple {23739#(< main_~i~0 993)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23739#(< main_~i~0 993)} is VALID [2022-04-28 02:49:23,162 INFO L290 TraceCheckUtils]: 13: Hoare triple {23746#(< main_~i~0 992)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23739#(< main_~i~0 993)} is VALID [2022-04-28 02:49:23,162 INFO L290 TraceCheckUtils]: 12: Hoare triple {23746#(< main_~i~0 992)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23746#(< main_~i~0 992)} is VALID [2022-04-28 02:49:23,162 INFO L290 TraceCheckUtils]: 11: Hoare triple {23753#(< main_~i~0 991)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23746#(< main_~i~0 992)} is VALID [2022-04-28 02:49:23,163 INFO L290 TraceCheckUtils]: 10: Hoare triple {23753#(< main_~i~0 991)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23753#(< main_~i~0 991)} is VALID [2022-04-28 02:49:23,163 INFO L290 TraceCheckUtils]: 9: Hoare triple {23760#(< main_~i~0 990)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23753#(< main_~i~0 991)} is VALID [2022-04-28 02:49:23,163 INFO L290 TraceCheckUtils]: 8: Hoare triple {23760#(< main_~i~0 990)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23760#(< main_~i~0 990)} is VALID [2022-04-28 02:49:23,164 INFO L290 TraceCheckUtils]: 7: Hoare triple {23767#(< main_~i~0 989)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23760#(< main_~i~0 990)} is VALID [2022-04-28 02:49:23,164 INFO L290 TraceCheckUtils]: 6: Hoare triple {23767#(< main_~i~0 989)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23767#(< main_~i~0 989)} is VALID [2022-04-28 02:49:23,164 INFO L290 TraceCheckUtils]: 5: Hoare triple {23221#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {23767#(< main_~i~0 989)} is VALID [2022-04-28 02:49:23,164 INFO L272 TraceCheckUtils]: 4: Hoare triple {23221#true} call #t~ret6 := main(); {23221#true} is VALID [2022-04-28 02:49:23,164 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23221#true} {23221#true} #39#return; {23221#true} is VALID [2022-04-28 02:49:23,164 INFO L290 TraceCheckUtils]: 2: Hoare triple {23221#true} assume true; {23221#true} is VALID [2022-04-28 02:49:23,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {23221#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {23221#true} is VALID [2022-04-28 02:49:23,165 INFO L272 TraceCheckUtils]: 0: Hoare triple {23221#true} call ULTIMATE.init(); {23221#true} is VALID [2022-04-28 02:49:23,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:49:23,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100248286] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:49:23,165 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:49:23,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 38, 38] total 76 [2022-04-28 02:49:23,165 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:49:23,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1998485145] [2022-04-28 02:49:23,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1998485145] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:49:23,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:49:23,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2022-04-28 02:49:23,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677551689] [2022-04-28 02:49:23,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:49:23,166 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.0) internal successors, (78), 38 states have internal predecessors, (78), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 82 [2022-04-28 02:49:23,166 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:49:23,166 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 39 states, 39 states have (on average 2.0) internal successors, (78), 38 states have internal predecessors, (78), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:49:23,217 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:49:23,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-04-28 02:49:23,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:49:23,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-04-28 02:49:23,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2777, Invalid=2923, Unknown=0, NotChecked=0, Total=5700 [2022-04-28 02:49:23,219 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand has 39 states, 39 states have (on average 2.0) internal successors, (78), 38 states have internal predecessors, (78), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:49:24,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:49:24,307 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2022-04-28 02:49:24,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-04-28 02:49:24,307 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.0) internal successors, (78), 38 states have internal predecessors, (78), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 82 [2022-04-28 02:49:24,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:49:24,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 2.0) internal successors, (78), 38 states have internal predecessors, (78), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:49:24,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 92 transitions. [2022-04-28 02:49:24,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 2.0) internal successors, (78), 38 states have internal predecessors, (78), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:49:24,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 92 transitions. [2022-04-28 02:49:24,309 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 92 transitions. [2022-04-28 02:49:24,376 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:49:24,377 INFO L225 Difference]: With dead ends: 92 [2022-04-28 02:49:24,377 INFO L226 Difference]: Without dead ends: 86 [2022-04-28 02:49:24,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 839 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=5478, Invalid=6954, Unknown=0, NotChecked=0, Total=12432 [2022-04-28 02:49:24,378 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 80 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:49:24,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 49 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:49:24,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-04-28 02:49:24,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2022-04-28 02:49:24,663 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:49:24,663 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand has 85 states, 80 states have (on average 1.0125) internal successors, (81), 80 states have internal predecessors, (81), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:49:24,663 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand has 85 states, 80 states have (on average 1.0125) internal successors, (81), 80 states have internal predecessors, (81), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:49:24,663 INFO L87 Difference]: Start difference. First operand 86 states. Second operand has 85 states, 80 states have (on average 1.0125) internal successors, (81), 80 states have internal predecessors, (81), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:49:24,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:49:24,664 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2022-04-28 02:49:24,665 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2022-04-28 02:49:24,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:49:24,665 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:49:24,665 INFO L74 IsIncluded]: Start isIncluded. First operand has 85 states, 80 states have (on average 1.0125) internal successors, (81), 80 states have internal predecessors, (81), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 86 states. [2022-04-28 02:49:24,665 INFO L87 Difference]: Start difference. First operand has 85 states, 80 states have (on average 1.0125) internal successors, (81), 80 states have internal predecessors, (81), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 86 states. [2022-04-28 02:49:24,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:49:24,666 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2022-04-28 02:49:24,666 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2022-04-28 02:49:24,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:49:24,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:49:24,666 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:49:24,666 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:49:24,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 80 states have (on average 1.0125) internal successors, (81), 80 states have internal predecessors, (81), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:49:24,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2022-04-28 02:49:24,667 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 82 [2022-04-28 02:49:24,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:49:24,668 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2022-04-28 02:49:24,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.0) internal successors, (78), 38 states have internal predecessors, (78), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:49:24,668 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 85 states and 85 transitions. [2022-04-28 02:49:24,755 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:49:24,755 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2022-04-28 02:49:24,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-28 02:49:24,756 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:49:24,756 INFO L195 NwaCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:49:24,775 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2022-04-28 02:49:24,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-04-28 02:49:24,967 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:49:24,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:49:24,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1326799042, now seen corresponding path program 71 times [2022-04-28 02:49:24,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:49:24,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [281048366] [2022-04-28 02:49:24,970 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:49:24,970 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:49:24,970 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:49:24,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1326799042, now seen corresponding path program 72 times [2022-04-28 02:49:24,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:49:24,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893651001] [2022-04-28 02:49:24,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:49:24,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:49:25,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:49:25,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:49:25,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:49:25,640 INFO L290 TraceCheckUtils]: 0: Hoare triple {24431#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {24389#true} is VALID [2022-04-28 02:49:25,640 INFO L290 TraceCheckUtils]: 1: Hoare triple {24389#true} assume true; {24389#true} is VALID [2022-04-28 02:49:25,640 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24389#true} {24389#true} #39#return; {24389#true} is VALID [2022-04-28 02:49:25,641 INFO L272 TraceCheckUtils]: 0: Hoare triple {24389#true} call ULTIMATE.init(); {24431#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:49:25,641 INFO L290 TraceCheckUtils]: 1: Hoare triple {24431#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {24389#true} is VALID [2022-04-28 02:49:25,641 INFO L290 TraceCheckUtils]: 2: Hoare triple {24389#true} assume true; {24389#true} is VALID [2022-04-28 02:49:25,641 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24389#true} {24389#true} #39#return; {24389#true} is VALID [2022-04-28 02:49:25,641 INFO L272 TraceCheckUtils]: 4: Hoare triple {24389#true} call #t~ret6 := main(); {24389#true} is VALID [2022-04-28 02:49:25,641 INFO L290 TraceCheckUtils]: 5: Hoare triple {24389#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {24394#(= main_~i~0 0)} is VALID [2022-04-28 02:49:25,642 INFO L290 TraceCheckUtils]: 6: Hoare triple {24394#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24394#(= main_~i~0 0)} is VALID [2022-04-28 02:49:25,642 INFO L290 TraceCheckUtils]: 7: Hoare triple {24394#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24395#(<= main_~i~0 1)} is VALID [2022-04-28 02:49:25,643 INFO L290 TraceCheckUtils]: 8: Hoare triple {24395#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24395#(<= main_~i~0 1)} is VALID [2022-04-28 02:49:25,643 INFO L290 TraceCheckUtils]: 9: Hoare triple {24395#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24396#(<= main_~i~0 2)} is VALID [2022-04-28 02:49:25,644 INFO L290 TraceCheckUtils]: 10: Hoare triple {24396#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24396#(<= main_~i~0 2)} is VALID [2022-04-28 02:49:25,644 INFO L290 TraceCheckUtils]: 11: Hoare triple {24396#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24397#(<= main_~i~0 3)} is VALID [2022-04-28 02:49:25,645 INFO L290 TraceCheckUtils]: 12: Hoare triple {24397#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24397#(<= main_~i~0 3)} is VALID [2022-04-28 02:49:25,645 INFO L290 TraceCheckUtils]: 13: Hoare triple {24397#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24398#(<= main_~i~0 4)} is VALID [2022-04-28 02:49:25,645 INFO L290 TraceCheckUtils]: 14: Hoare triple {24398#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24398#(<= main_~i~0 4)} is VALID [2022-04-28 02:49:25,646 INFO L290 TraceCheckUtils]: 15: Hoare triple {24398#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24399#(<= main_~i~0 5)} is VALID [2022-04-28 02:49:25,646 INFO L290 TraceCheckUtils]: 16: Hoare triple {24399#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24399#(<= main_~i~0 5)} is VALID [2022-04-28 02:49:25,647 INFO L290 TraceCheckUtils]: 17: Hoare triple {24399#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24400#(<= main_~i~0 6)} is VALID [2022-04-28 02:49:25,647 INFO L290 TraceCheckUtils]: 18: Hoare triple {24400#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24400#(<= main_~i~0 6)} is VALID [2022-04-28 02:49:25,648 INFO L290 TraceCheckUtils]: 19: Hoare triple {24400#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24401#(<= main_~i~0 7)} is VALID [2022-04-28 02:49:25,648 INFO L290 TraceCheckUtils]: 20: Hoare triple {24401#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24401#(<= main_~i~0 7)} is VALID [2022-04-28 02:49:25,649 INFO L290 TraceCheckUtils]: 21: Hoare triple {24401#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24402#(<= main_~i~0 8)} is VALID [2022-04-28 02:49:25,649 INFO L290 TraceCheckUtils]: 22: Hoare triple {24402#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24402#(<= main_~i~0 8)} is VALID [2022-04-28 02:49:25,649 INFO L290 TraceCheckUtils]: 23: Hoare triple {24402#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24403#(<= main_~i~0 9)} is VALID [2022-04-28 02:49:25,650 INFO L290 TraceCheckUtils]: 24: Hoare triple {24403#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24403#(<= main_~i~0 9)} is VALID [2022-04-28 02:49:25,650 INFO L290 TraceCheckUtils]: 25: Hoare triple {24403#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24404#(<= main_~i~0 10)} is VALID [2022-04-28 02:49:25,651 INFO L290 TraceCheckUtils]: 26: Hoare triple {24404#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24404#(<= main_~i~0 10)} is VALID [2022-04-28 02:49:25,651 INFO L290 TraceCheckUtils]: 27: Hoare triple {24404#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24405#(<= main_~i~0 11)} is VALID [2022-04-28 02:49:25,652 INFO L290 TraceCheckUtils]: 28: Hoare triple {24405#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24405#(<= main_~i~0 11)} is VALID [2022-04-28 02:49:25,652 INFO L290 TraceCheckUtils]: 29: Hoare triple {24405#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24406#(<= main_~i~0 12)} is VALID [2022-04-28 02:49:25,652 INFO L290 TraceCheckUtils]: 30: Hoare triple {24406#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24406#(<= main_~i~0 12)} is VALID [2022-04-28 02:49:25,653 INFO L290 TraceCheckUtils]: 31: Hoare triple {24406#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24407#(<= main_~i~0 13)} is VALID [2022-04-28 02:49:25,653 INFO L290 TraceCheckUtils]: 32: Hoare triple {24407#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24407#(<= main_~i~0 13)} is VALID [2022-04-28 02:49:25,653 INFO L290 TraceCheckUtils]: 33: Hoare triple {24407#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24408#(<= main_~i~0 14)} is VALID [2022-04-28 02:49:25,653 INFO L290 TraceCheckUtils]: 34: Hoare triple {24408#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24408#(<= main_~i~0 14)} is VALID [2022-04-28 02:49:25,654 INFO L290 TraceCheckUtils]: 35: Hoare triple {24408#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24409#(<= main_~i~0 15)} is VALID [2022-04-28 02:49:25,654 INFO L290 TraceCheckUtils]: 36: Hoare triple {24409#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24409#(<= main_~i~0 15)} is VALID [2022-04-28 02:49:25,654 INFO L290 TraceCheckUtils]: 37: Hoare triple {24409#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24410#(<= main_~i~0 16)} is VALID [2022-04-28 02:49:25,655 INFO L290 TraceCheckUtils]: 38: Hoare triple {24410#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24410#(<= main_~i~0 16)} is VALID [2022-04-28 02:49:25,655 INFO L290 TraceCheckUtils]: 39: Hoare triple {24410#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24411#(<= main_~i~0 17)} is VALID [2022-04-28 02:49:25,655 INFO L290 TraceCheckUtils]: 40: Hoare triple {24411#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24411#(<= main_~i~0 17)} is VALID [2022-04-28 02:49:25,656 INFO L290 TraceCheckUtils]: 41: Hoare triple {24411#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24412#(<= main_~i~0 18)} is VALID [2022-04-28 02:49:25,656 INFO L290 TraceCheckUtils]: 42: Hoare triple {24412#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24412#(<= main_~i~0 18)} is VALID [2022-04-28 02:49:25,656 INFO L290 TraceCheckUtils]: 43: Hoare triple {24412#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24413#(<= main_~i~0 19)} is VALID [2022-04-28 02:49:25,656 INFO L290 TraceCheckUtils]: 44: Hoare triple {24413#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24413#(<= main_~i~0 19)} is VALID [2022-04-28 02:49:25,657 INFO L290 TraceCheckUtils]: 45: Hoare triple {24413#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24414#(<= main_~i~0 20)} is VALID [2022-04-28 02:49:25,657 INFO L290 TraceCheckUtils]: 46: Hoare triple {24414#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24414#(<= main_~i~0 20)} is VALID [2022-04-28 02:49:25,657 INFO L290 TraceCheckUtils]: 47: Hoare triple {24414#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24415#(<= main_~i~0 21)} is VALID [2022-04-28 02:49:25,658 INFO L290 TraceCheckUtils]: 48: Hoare triple {24415#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24415#(<= main_~i~0 21)} is VALID [2022-04-28 02:49:25,658 INFO L290 TraceCheckUtils]: 49: Hoare triple {24415#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24416#(<= main_~i~0 22)} is VALID [2022-04-28 02:49:25,658 INFO L290 TraceCheckUtils]: 50: Hoare triple {24416#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24416#(<= main_~i~0 22)} is VALID [2022-04-28 02:49:25,659 INFO L290 TraceCheckUtils]: 51: Hoare triple {24416#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24417#(<= main_~i~0 23)} is VALID [2022-04-28 02:49:25,659 INFO L290 TraceCheckUtils]: 52: Hoare triple {24417#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24417#(<= main_~i~0 23)} is VALID [2022-04-28 02:49:25,659 INFO L290 TraceCheckUtils]: 53: Hoare triple {24417#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24418#(<= main_~i~0 24)} is VALID [2022-04-28 02:49:25,660 INFO L290 TraceCheckUtils]: 54: Hoare triple {24418#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24418#(<= main_~i~0 24)} is VALID [2022-04-28 02:49:25,660 INFO L290 TraceCheckUtils]: 55: Hoare triple {24418#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24419#(<= main_~i~0 25)} is VALID [2022-04-28 02:49:25,660 INFO L290 TraceCheckUtils]: 56: Hoare triple {24419#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24419#(<= main_~i~0 25)} is VALID [2022-04-28 02:49:25,661 INFO L290 TraceCheckUtils]: 57: Hoare triple {24419#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24420#(<= main_~i~0 26)} is VALID [2022-04-28 02:49:25,661 INFO L290 TraceCheckUtils]: 58: Hoare triple {24420#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24420#(<= main_~i~0 26)} is VALID [2022-04-28 02:49:25,661 INFO L290 TraceCheckUtils]: 59: Hoare triple {24420#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24421#(<= main_~i~0 27)} is VALID [2022-04-28 02:49:25,661 INFO L290 TraceCheckUtils]: 60: Hoare triple {24421#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24421#(<= main_~i~0 27)} is VALID [2022-04-28 02:49:25,662 INFO L290 TraceCheckUtils]: 61: Hoare triple {24421#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24422#(<= main_~i~0 28)} is VALID [2022-04-28 02:49:25,662 INFO L290 TraceCheckUtils]: 62: Hoare triple {24422#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24422#(<= main_~i~0 28)} is VALID [2022-04-28 02:49:25,662 INFO L290 TraceCheckUtils]: 63: Hoare triple {24422#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24423#(<= main_~i~0 29)} is VALID [2022-04-28 02:49:25,663 INFO L290 TraceCheckUtils]: 64: Hoare triple {24423#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24423#(<= main_~i~0 29)} is VALID [2022-04-28 02:49:25,663 INFO L290 TraceCheckUtils]: 65: Hoare triple {24423#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24424#(<= main_~i~0 30)} is VALID [2022-04-28 02:49:25,663 INFO L290 TraceCheckUtils]: 66: Hoare triple {24424#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24424#(<= main_~i~0 30)} is VALID [2022-04-28 02:49:25,664 INFO L290 TraceCheckUtils]: 67: Hoare triple {24424#(<= main_~i~0 30)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24425#(<= main_~i~0 31)} is VALID [2022-04-28 02:49:25,664 INFO L290 TraceCheckUtils]: 68: Hoare triple {24425#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24425#(<= main_~i~0 31)} is VALID [2022-04-28 02:49:25,664 INFO L290 TraceCheckUtils]: 69: Hoare triple {24425#(<= main_~i~0 31)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24426#(<= main_~i~0 32)} is VALID [2022-04-28 02:49:25,664 INFO L290 TraceCheckUtils]: 70: Hoare triple {24426#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24426#(<= main_~i~0 32)} is VALID [2022-04-28 02:49:25,665 INFO L290 TraceCheckUtils]: 71: Hoare triple {24426#(<= main_~i~0 32)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24427#(<= main_~i~0 33)} is VALID [2022-04-28 02:49:25,665 INFO L290 TraceCheckUtils]: 72: Hoare triple {24427#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24427#(<= main_~i~0 33)} is VALID [2022-04-28 02:49:25,665 INFO L290 TraceCheckUtils]: 73: Hoare triple {24427#(<= main_~i~0 33)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24428#(<= main_~i~0 34)} is VALID [2022-04-28 02:49:25,666 INFO L290 TraceCheckUtils]: 74: Hoare triple {24428#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24428#(<= main_~i~0 34)} is VALID [2022-04-28 02:49:25,666 INFO L290 TraceCheckUtils]: 75: Hoare triple {24428#(<= main_~i~0 34)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24429#(<= main_~i~0 35)} is VALID [2022-04-28 02:49:25,666 INFO L290 TraceCheckUtils]: 76: Hoare triple {24429#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24429#(<= main_~i~0 35)} is VALID [2022-04-28 02:49:25,667 INFO L290 TraceCheckUtils]: 77: Hoare triple {24429#(<= main_~i~0 35)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24430#(<= main_~i~0 36)} is VALID [2022-04-28 02:49:25,667 INFO L290 TraceCheckUtils]: 78: Hoare triple {24430#(<= main_~i~0 36)} assume !(~i~0 < 1024); {24390#false} is VALID [2022-04-28 02:49:25,667 INFO L290 TraceCheckUtils]: 79: Hoare triple {24390#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {24390#false} is VALID [2022-04-28 02:49:25,667 INFO L272 TraceCheckUtils]: 80: Hoare triple {24390#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {24390#false} is VALID [2022-04-28 02:49:25,667 INFO L290 TraceCheckUtils]: 81: Hoare triple {24390#false} ~cond := #in~cond; {24390#false} is VALID [2022-04-28 02:49:25,667 INFO L290 TraceCheckUtils]: 82: Hoare triple {24390#false} assume 0 == ~cond; {24390#false} is VALID [2022-04-28 02:49:25,667 INFO L290 TraceCheckUtils]: 83: Hoare triple {24390#false} assume !false; {24390#false} is VALID [2022-04-28 02:49:25,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:49:25,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:49:25,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893651001] [2022-04-28 02:49:25,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893651001] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:49:25,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253397204] [2022-04-28 02:49:25,668 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 02:49:25,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:49:25,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:49:25,669 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:49:25,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-04-28 02:49:42,437 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2022-04-28 02:49:42,437 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:49:42,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 38 conjunts are in the unsatisfiable core [2022-04-28 02:49:42,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:49:42,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:49:42,947 INFO L272 TraceCheckUtils]: 0: Hoare triple {24389#true} call ULTIMATE.init(); {24389#true} is VALID [2022-04-28 02:49:42,947 INFO L290 TraceCheckUtils]: 1: Hoare triple {24389#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {24389#true} is VALID [2022-04-28 02:49:42,947 INFO L290 TraceCheckUtils]: 2: Hoare triple {24389#true} assume true; {24389#true} is VALID [2022-04-28 02:49:42,947 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24389#true} {24389#true} #39#return; {24389#true} is VALID [2022-04-28 02:49:42,947 INFO L272 TraceCheckUtils]: 4: Hoare triple {24389#true} call #t~ret6 := main(); {24389#true} is VALID [2022-04-28 02:49:42,947 INFO L290 TraceCheckUtils]: 5: Hoare triple {24389#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {24450#(<= main_~i~0 0)} is VALID [2022-04-28 02:49:42,948 INFO L290 TraceCheckUtils]: 6: Hoare triple {24450#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24450#(<= main_~i~0 0)} is VALID [2022-04-28 02:49:42,948 INFO L290 TraceCheckUtils]: 7: Hoare triple {24450#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24395#(<= main_~i~0 1)} is VALID [2022-04-28 02:49:42,948 INFO L290 TraceCheckUtils]: 8: Hoare triple {24395#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24395#(<= main_~i~0 1)} is VALID [2022-04-28 02:49:42,949 INFO L290 TraceCheckUtils]: 9: Hoare triple {24395#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24396#(<= main_~i~0 2)} is VALID [2022-04-28 02:49:42,949 INFO L290 TraceCheckUtils]: 10: Hoare triple {24396#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24396#(<= main_~i~0 2)} is VALID [2022-04-28 02:49:42,949 INFO L290 TraceCheckUtils]: 11: Hoare triple {24396#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24397#(<= main_~i~0 3)} is VALID [2022-04-28 02:49:42,950 INFO L290 TraceCheckUtils]: 12: Hoare triple {24397#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24397#(<= main_~i~0 3)} is VALID [2022-04-28 02:49:42,950 INFO L290 TraceCheckUtils]: 13: Hoare triple {24397#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24398#(<= main_~i~0 4)} is VALID [2022-04-28 02:49:42,950 INFO L290 TraceCheckUtils]: 14: Hoare triple {24398#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24398#(<= main_~i~0 4)} is VALID [2022-04-28 02:49:42,950 INFO L290 TraceCheckUtils]: 15: Hoare triple {24398#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24399#(<= main_~i~0 5)} is VALID [2022-04-28 02:49:42,951 INFO L290 TraceCheckUtils]: 16: Hoare triple {24399#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24399#(<= main_~i~0 5)} is VALID [2022-04-28 02:49:42,951 INFO L290 TraceCheckUtils]: 17: Hoare triple {24399#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24400#(<= main_~i~0 6)} is VALID [2022-04-28 02:49:42,951 INFO L290 TraceCheckUtils]: 18: Hoare triple {24400#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24400#(<= main_~i~0 6)} is VALID [2022-04-28 02:49:42,952 INFO L290 TraceCheckUtils]: 19: Hoare triple {24400#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24401#(<= main_~i~0 7)} is VALID [2022-04-28 02:49:42,952 INFO L290 TraceCheckUtils]: 20: Hoare triple {24401#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24401#(<= main_~i~0 7)} is VALID [2022-04-28 02:49:42,952 INFO L290 TraceCheckUtils]: 21: Hoare triple {24401#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24402#(<= main_~i~0 8)} is VALID [2022-04-28 02:49:42,953 INFO L290 TraceCheckUtils]: 22: Hoare triple {24402#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24402#(<= main_~i~0 8)} is VALID [2022-04-28 02:49:42,953 INFO L290 TraceCheckUtils]: 23: Hoare triple {24402#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24403#(<= main_~i~0 9)} is VALID [2022-04-28 02:49:42,953 INFO L290 TraceCheckUtils]: 24: Hoare triple {24403#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24403#(<= main_~i~0 9)} is VALID [2022-04-28 02:49:42,954 INFO L290 TraceCheckUtils]: 25: Hoare triple {24403#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24404#(<= main_~i~0 10)} is VALID [2022-04-28 02:49:42,954 INFO L290 TraceCheckUtils]: 26: Hoare triple {24404#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24404#(<= main_~i~0 10)} is VALID [2022-04-28 02:49:42,954 INFO L290 TraceCheckUtils]: 27: Hoare triple {24404#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24405#(<= main_~i~0 11)} is VALID [2022-04-28 02:49:42,954 INFO L290 TraceCheckUtils]: 28: Hoare triple {24405#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24405#(<= main_~i~0 11)} is VALID [2022-04-28 02:49:42,955 INFO L290 TraceCheckUtils]: 29: Hoare triple {24405#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24406#(<= main_~i~0 12)} is VALID [2022-04-28 02:49:42,955 INFO L290 TraceCheckUtils]: 30: Hoare triple {24406#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24406#(<= main_~i~0 12)} is VALID [2022-04-28 02:49:42,955 INFO L290 TraceCheckUtils]: 31: Hoare triple {24406#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24407#(<= main_~i~0 13)} is VALID [2022-04-28 02:49:42,956 INFO L290 TraceCheckUtils]: 32: Hoare triple {24407#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24407#(<= main_~i~0 13)} is VALID [2022-04-28 02:49:42,956 INFO L290 TraceCheckUtils]: 33: Hoare triple {24407#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24408#(<= main_~i~0 14)} is VALID [2022-04-28 02:49:42,956 INFO L290 TraceCheckUtils]: 34: Hoare triple {24408#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24408#(<= main_~i~0 14)} is VALID [2022-04-28 02:49:42,957 INFO L290 TraceCheckUtils]: 35: Hoare triple {24408#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24409#(<= main_~i~0 15)} is VALID [2022-04-28 02:49:42,957 INFO L290 TraceCheckUtils]: 36: Hoare triple {24409#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24409#(<= main_~i~0 15)} is VALID [2022-04-28 02:49:42,957 INFO L290 TraceCheckUtils]: 37: Hoare triple {24409#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24410#(<= main_~i~0 16)} is VALID [2022-04-28 02:49:42,958 INFO L290 TraceCheckUtils]: 38: Hoare triple {24410#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24410#(<= main_~i~0 16)} is VALID [2022-04-28 02:49:42,958 INFO L290 TraceCheckUtils]: 39: Hoare triple {24410#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24411#(<= main_~i~0 17)} is VALID [2022-04-28 02:49:42,958 INFO L290 TraceCheckUtils]: 40: Hoare triple {24411#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24411#(<= main_~i~0 17)} is VALID [2022-04-28 02:49:42,959 INFO L290 TraceCheckUtils]: 41: Hoare triple {24411#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24412#(<= main_~i~0 18)} is VALID [2022-04-28 02:49:42,959 INFO L290 TraceCheckUtils]: 42: Hoare triple {24412#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24412#(<= main_~i~0 18)} is VALID [2022-04-28 02:49:42,959 INFO L290 TraceCheckUtils]: 43: Hoare triple {24412#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24413#(<= main_~i~0 19)} is VALID [2022-04-28 02:49:42,959 INFO L290 TraceCheckUtils]: 44: Hoare triple {24413#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24413#(<= main_~i~0 19)} is VALID [2022-04-28 02:49:42,960 INFO L290 TraceCheckUtils]: 45: Hoare triple {24413#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24414#(<= main_~i~0 20)} is VALID [2022-04-28 02:49:42,960 INFO L290 TraceCheckUtils]: 46: Hoare triple {24414#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24414#(<= main_~i~0 20)} is VALID [2022-04-28 02:49:42,960 INFO L290 TraceCheckUtils]: 47: Hoare triple {24414#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24415#(<= main_~i~0 21)} is VALID [2022-04-28 02:49:42,961 INFO L290 TraceCheckUtils]: 48: Hoare triple {24415#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24415#(<= main_~i~0 21)} is VALID [2022-04-28 02:49:42,961 INFO L290 TraceCheckUtils]: 49: Hoare triple {24415#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24416#(<= main_~i~0 22)} is VALID [2022-04-28 02:49:42,961 INFO L290 TraceCheckUtils]: 50: Hoare triple {24416#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24416#(<= main_~i~0 22)} is VALID [2022-04-28 02:49:42,962 INFO L290 TraceCheckUtils]: 51: Hoare triple {24416#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24417#(<= main_~i~0 23)} is VALID [2022-04-28 02:49:42,962 INFO L290 TraceCheckUtils]: 52: Hoare triple {24417#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24417#(<= main_~i~0 23)} is VALID [2022-04-28 02:49:42,962 INFO L290 TraceCheckUtils]: 53: Hoare triple {24417#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24418#(<= main_~i~0 24)} is VALID [2022-04-28 02:49:42,963 INFO L290 TraceCheckUtils]: 54: Hoare triple {24418#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24418#(<= main_~i~0 24)} is VALID [2022-04-28 02:49:42,963 INFO L290 TraceCheckUtils]: 55: Hoare triple {24418#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24419#(<= main_~i~0 25)} is VALID [2022-04-28 02:49:42,963 INFO L290 TraceCheckUtils]: 56: Hoare triple {24419#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24419#(<= main_~i~0 25)} is VALID [2022-04-28 02:49:42,963 INFO L290 TraceCheckUtils]: 57: Hoare triple {24419#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24420#(<= main_~i~0 26)} is VALID [2022-04-28 02:49:42,964 INFO L290 TraceCheckUtils]: 58: Hoare triple {24420#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24420#(<= main_~i~0 26)} is VALID [2022-04-28 02:49:42,964 INFO L290 TraceCheckUtils]: 59: Hoare triple {24420#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24421#(<= main_~i~0 27)} is VALID [2022-04-28 02:49:42,964 INFO L290 TraceCheckUtils]: 60: Hoare triple {24421#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24421#(<= main_~i~0 27)} is VALID [2022-04-28 02:49:42,965 INFO L290 TraceCheckUtils]: 61: Hoare triple {24421#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24422#(<= main_~i~0 28)} is VALID [2022-04-28 02:49:42,965 INFO L290 TraceCheckUtils]: 62: Hoare triple {24422#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24422#(<= main_~i~0 28)} is VALID [2022-04-28 02:49:42,965 INFO L290 TraceCheckUtils]: 63: Hoare triple {24422#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24423#(<= main_~i~0 29)} is VALID [2022-04-28 02:49:42,966 INFO L290 TraceCheckUtils]: 64: Hoare triple {24423#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24423#(<= main_~i~0 29)} is VALID [2022-04-28 02:49:42,966 INFO L290 TraceCheckUtils]: 65: Hoare triple {24423#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24424#(<= main_~i~0 30)} is VALID [2022-04-28 02:49:42,966 INFO L290 TraceCheckUtils]: 66: Hoare triple {24424#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24424#(<= main_~i~0 30)} is VALID [2022-04-28 02:49:42,967 INFO L290 TraceCheckUtils]: 67: Hoare triple {24424#(<= main_~i~0 30)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24425#(<= main_~i~0 31)} is VALID [2022-04-28 02:49:42,967 INFO L290 TraceCheckUtils]: 68: Hoare triple {24425#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24425#(<= main_~i~0 31)} is VALID [2022-04-28 02:49:42,967 INFO L290 TraceCheckUtils]: 69: Hoare triple {24425#(<= main_~i~0 31)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24426#(<= main_~i~0 32)} is VALID [2022-04-28 02:49:42,967 INFO L290 TraceCheckUtils]: 70: Hoare triple {24426#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24426#(<= main_~i~0 32)} is VALID [2022-04-28 02:49:42,968 INFO L290 TraceCheckUtils]: 71: Hoare triple {24426#(<= main_~i~0 32)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24427#(<= main_~i~0 33)} is VALID [2022-04-28 02:49:42,968 INFO L290 TraceCheckUtils]: 72: Hoare triple {24427#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24427#(<= main_~i~0 33)} is VALID [2022-04-28 02:49:42,968 INFO L290 TraceCheckUtils]: 73: Hoare triple {24427#(<= main_~i~0 33)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24428#(<= main_~i~0 34)} is VALID [2022-04-28 02:49:42,971 INFO L290 TraceCheckUtils]: 74: Hoare triple {24428#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24428#(<= main_~i~0 34)} is VALID [2022-04-28 02:49:42,972 INFO L290 TraceCheckUtils]: 75: Hoare triple {24428#(<= main_~i~0 34)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24429#(<= main_~i~0 35)} is VALID [2022-04-28 02:49:42,972 INFO L290 TraceCheckUtils]: 76: Hoare triple {24429#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24429#(<= main_~i~0 35)} is VALID [2022-04-28 02:49:42,972 INFO L290 TraceCheckUtils]: 77: Hoare triple {24429#(<= main_~i~0 35)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24430#(<= main_~i~0 36)} is VALID [2022-04-28 02:49:42,973 INFO L290 TraceCheckUtils]: 78: Hoare triple {24430#(<= main_~i~0 36)} assume !(~i~0 < 1024); {24390#false} is VALID [2022-04-28 02:49:42,973 INFO L290 TraceCheckUtils]: 79: Hoare triple {24390#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {24390#false} is VALID [2022-04-28 02:49:42,973 INFO L272 TraceCheckUtils]: 80: Hoare triple {24390#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {24390#false} is VALID [2022-04-28 02:49:42,973 INFO L290 TraceCheckUtils]: 81: Hoare triple {24390#false} ~cond := #in~cond; {24390#false} is VALID [2022-04-28 02:49:42,973 INFO L290 TraceCheckUtils]: 82: Hoare triple {24390#false} assume 0 == ~cond; {24390#false} is VALID [2022-04-28 02:49:42,973 INFO L290 TraceCheckUtils]: 83: Hoare triple {24390#false} assume !false; {24390#false} is VALID [2022-04-28 02:49:42,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:49:42,974 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:49:44,728 INFO L290 TraceCheckUtils]: 83: Hoare triple {24390#false} assume !false; {24390#false} is VALID [2022-04-28 02:49:44,728 INFO L290 TraceCheckUtils]: 82: Hoare triple {24390#false} assume 0 == ~cond; {24390#false} is VALID [2022-04-28 02:49:44,728 INFO L290 TraceCheckUtils]: 81: Hoare triple {24390#false} ~cond := #in~cond; {24390#false} is VALID [2022-04-28 02:49:44,728 INFO L272 TraceCheckUtils]: 80: Hoare triple {24390#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {24390#false} is VALID [2022-04-28 02:49:44,728 INFO L290 TraceCheckUtils]: 79: Hoare triple {24390#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {24390#false} is VALID [2022-04-28 02:49:44,728 INFO L290 TraceCheckUtils]: 78: Hoare triple {24700#(< main_~i~0 1024)} assume !(~i~0 < 1024); {24390#false} is VALID [2022-04-28 02:49:44,729 INFO L290 TraceCheckUtils]: 77: Hoare triple {24704#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24700#(< main_~i~0 1024)} is VALID [2022-04-28 02:49:44,729 INFO L290 TraceCheckUtils]: 76: Hoare triple {24704#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24704#(< main_~i~0 1023)} is VALID [2022-04-28 02:49:44,729 INFO L290 TraceCheckUtils]: 75: Hoare triple {24711#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24704#(< main_~i~0 1023)} is VALID [2022-04-28 02:49:44,729 INFO L290 TraceCheckUtils]: 74: Hoare triple {24711#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24711#(< main_~i~0 1022)} is VALID [2022-04-28 02:49:44,730 INFO L290 TraceCheckUtils]: 73: Hoare triple {24718#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24711#(< main_~i~0 1022)} is VALID [2022-04-28 02:49:44,730 INFO L290 TraceCheckUtils]: 72: Hoare triple {24718#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24718#(< main_~i~0 1021)} is VALID [2022-04-28 02:49:44,730 INFO L290 TraceCheckUtils]: 71: Hoare triple {24725#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24718#(< main_~i~0 1021)} is VALID [2022-04-28 02:49:44,731 INFO L290 TraceCheckUtils]: 70: Hoare triple {24725#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24725#(< main_~i~0 1020)} is VALID [2022-04-28 02:49:44,731 INFO L290 TraceCheckUtils]: 69: Hoare triple {24732#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24725#(< main_~i~0 1020)} is VALID [2022-04-28 02:49:44,731 INFO L290 TraceCheckUtils]: 68: Hoare triple {24732#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24732#(< main_~i~0 1019)} is VALID [2022-04-28 02:49:44,732 INFO L290 TraceCheckUtils]: 67: Hoare triple {24739#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24732#(< main_~i~0 1019)} is VALID [2022-04-28 02:49:44,739 INFO L290 TraceCheckUtils]: 66: Hoare triple {24739#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24739#(< main_~i~0 1018)} is VALID [2022-04-28 02:49:44,740 INFO L290 TraceCheckUtils]: 65: Hoare triple {24746#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24739#(< main_~i~0 1018)} is VALID [2022-04-28 02:49:44,741 INFO L290 TraceCheckUtils]: 64: Hoare triple {24746#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24746#(< main_~i~0 1017)} is VALID [2022-04-28 02:49:44,741 INFO L290 TraceCheckUtils]: 63: Hoare triple {24753#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24746#(< main_~i~0 1017)} is VALID [2022-04-28 02:49:44,741 INFO L290 TraceCheckUtils]: 62: Hoare triple {24753#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24753#(< main_~i~0 1016)} is VALID [2022-04-28 02:49:44,742 INFO L290 TraceCheckUtils]: 61: Hoare triple {24760#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24753#(< main_~i~0 1016)} is VALID [2022-04-28 02:49:44,742 INFO L290 TraceCheckUtils]: 60: Hoare triple {24760#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24760#(< main_~i~0 1015)} is VALID [2022-04-28 02:49:44,742 INFO L290 TraceCheckUtils]: 59: Hoare triple {24767#(< main_~i~0 1014)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24760#(< main_~i~0 1015)} is VALID [2022-04-28 02:49:44,742 INFO L290 TraceCheckUtils]: 58: Hoare triple {24767#(< main_~i~0 1014)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24767#(< main_~i~0 1014)} is VALID [2022-04-28 02:49:44,743 INFO L290 TraceCheckUtils]: 57: Hoare triple {24774#(< main_~i~0 1013)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24767#(< main_~i~0 1014)} is VALID [2022-04-28 02:49:44,743 INFO L290 TraceCheckUtils]: 56: Hoare triple {24774#(< main_~i~0 1013)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24774#(< main_~i~0 1013)} is VALID [2022-04-28 02:49:44,743 INFO L290 TraceCheckUtils]: 55: Hoare triple {24781#(< main_~i~0 1012)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24774#(< main_~i~0 1013)} is VALID [2022-04-28 02:49:44,747 INFO L290 TraceCheckUtils]: 54: Hoare triple {24781#(< main_~i~0 1012)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24781#(< main_~i~0 1012)} is VALID [2022-04-28 02:49:44,748 INFO L290 TraceCheckUtils]: 53: Hoare triple {24788#(< main_~i~0 1011)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24781#(< main_~i~0 1012)} is VALID [2022-04-28 02:49:44,748 INFO L290 TraceCheckUtils]: 52: Hoare triple {24788#(< main_~i~0 1011)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24788#(< main_~i~0 1011)} is VALID [2022-04-28 02:49:44,749 INFO L290 TraceCheckUtils]: 51: Hoare triple {24795#(< main_~i~0 1010)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24788#(< main_~i~0 1011)} is VALID [2022-04-28 02:49:44,749 INFO L290 TraceCheckUtils]: 50: Hoare triple {24795#(< main_~i~0 1010)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24795#(< main_~i~0 1010)} is VALID [2022-04-28 02:49:44,749 INFO L290 TraceCheckUtils]: 49: Hoare triple {24802#(< main_~i~0 1009)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24795#(< main_~i~0 1010)} is VALID [2022-04-28 02:49:44,750 INFO L290 TraceCheckUtils]: 48: Hoare triple {24802#(< main_~i~0 1009)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24802#(< main_~i~0 1009)} is VALID [2022-04-28 02:49:44,750 INFO L290 TraceCheckUtils]: 47: Hoare triple {24809#(< main_~i~0 1008)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24802#(< main_~i~0 1009)} is VALID [2022-04-28 02:49:44,751 INFO L290 TraceCheckUtils]: 46: Hoare triple {24809#(< main_~i~0 1008)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24809#(< main_~i~0 1008)} is VALID [2022-04-28 02:49:44,751 INFO L290 TraceCheckUtils]: 45: Hoare triple {24816#(< main_~i~0 1007)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24809#(< main_~i~0 1008)} is VALID [2022-04-28 02:49:44,752 INFO L290 TraceCheckUtils]: 44: Hoare triple {24816#(< main_~i~0 1007)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24816#(< main_~i~0 1007)} is VALID [2022-04-28 02:49:44,752 INFO L290 TraceCheckUtils]: 43: Hoare triple {24823#(< main_~i~0 1006)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24816#(< main_~i~0 1007)} is VALID [2022-04-28 02:49:44,753 INFO L290 TraceCheckUtils]: 42: Hoare triple {24823#(< main_~i~0 1006)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24823#(< main_~i~0 1006)} is VALID [2022-04-28 02:49:44,753 INFO L290 TraceCheckUtils]: 41: Hoare triple {24830#(< main_~i~0 1005)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24823#(< main_~i~0 1006)} is VALID [2022-04-28 02:49:44,753 INFO L290 TraceCheckUtils]: 40: Hoare triple {24830#(< main_~i~0 1005)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24830#(< main_~i~0 1005)} is VALID [2022-04-28 02:49:44,754 INFO L290 TraceCheckUtils]: 39: Hoare triple {24837#(< main_~i~0 1004)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24830#(< main_~i~0 1005)} is VALID [2022-04-28 02:49:44,754 INFO L290 TraceCheckUtils]: 38: Hoare triple {24837#(< main_~i~0 1004)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24837#(< main_~i~0 1004)} is VALID [2022-04-28 02:49:44,755 INFO L290 TraceCheckUtils]: 37: Hoare triple {24844#(< main_~i~0 1003)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24837#(< main_~i~0 1004)} is VALID [2022-04-28 02:49:44,755 INFO L290 TraceCheckUtils]: 36: Hoare triple {24844#(< main_~i~0 1003)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24844#(< main_~i~0 1003)} is VALID [2022-04-28 02:49:44,756 INFO L290 TraceCheckUtils]: 35: Hoare triple {24851#(< main_~i~0 1002)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24844#(< main_~i~0 1003)} is VALID [2022-04-28 02:49:44,756 INFO L290 TraceCheckUtils]: 34: Hoare triple {24851#(< main_~i~0 1002)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24851#(< main_~i~0 1002)} is VALID [2022-04-28 02:49:44,757 INFO L290 TraceCheckUtils]: 33: Hoare triple {24858#(< main_~i~0 1001)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24851#(< main_~i~0 1002)} is VALID [2022-04-28 02:49:44,757 INFO L290 TraceCheckUtils]: 32: Hoare triple {24858#(< main_~i~0 1001)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24858#(< main_~i~0 1001)} is VALID [2022-04-28 02:49:44,757 INFO L290 TraceCheckUtils]: 31: Hoare triple {24865#(< main_~i~0 1000)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24858#(< main_~i~0 1001)} is VALID [2022-04-28 02:49:44,758 INFO L290 TraceCheckUtils]: 30: Hoare triple {24865#(< main_~i~0 1000)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24865#(< main_~i~0 1000)} is VALID [2022-04-28 02:49:44,758 INFO L290 TraceCheckUtils]: 29: Hoare triple {24872#(< main_~i~0 999)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24865#(< main_~i~0 1000)} is VALID [2022-04-28 02:49:44,759 INFO L290 TraceCheckUtils]: 28: Hoare triple {24872#(< main_~i~0 999)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24872#(< main_~i~0 999)} is VALID [2022-04-28 02:49:44,759 INFO L290 TraceCheckUtils]: 27: Hoare triple {24879#(< main_~i~0 998)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24872#(< main_~i~0 999)} is VALID [2022-04-28 02:49:44,760 INFO L290 TraceCheckUtils]: 26: Hoare triple {24879#(< main_~i~0 998)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24879#(< main_~i~0 998)} is VALID [2022-04-28 02:49:44,760 INFO L290 TraceCheckUtils]: 25: Hoare triple {24886#(< main_~i~0 997)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24879#(< main_~i~0 998)} is VALID [2022-04-28 02:49:44,761 INFO L290 TraceCheckUtils]: 24: Hoare triple {24886#(< main_~i~0 997)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24886#(< main_~i~0 997)} is VALID [2022-04-28 02:49:44,761 INFO L290 TraceCheckUtils]: 23: Hoare triple {24893#(< main_~i~0 996)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24886#(< main_~i~0 997)} is VALID [2022-04-28 02:49:44,761 INFO L290 TraceCheckUtils]: 22: Hoare triple {24893#(< main_~i~0 996)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24893#(< main_~i~0 996)} is VALID [2022-04-28 02:49:44,762 INFO L290 TraceCheckUtils]: 21: Hoare triple {24900#(< main_~i~0 995)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24893#(< main_~i~0 996)} is VALID [2022-04-28 02:49:44,762 INFO L290 TraceCheckUtils]: 20: Hoare triple {24900#(< main_~i~0 995)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24900#(< main_~i~0 995)} is VALID [2022-04-28 02:49:44,763 INFO L290 TraceCheckUtils]: 19: Hoare triple {24907#(< main_~i~0 994)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24900#(< main_~i~0 995)} is VALID [2022-04-28 02:49:44,763 INFO L290 TraceCheckUtils]: 18: Hoare triple {24907#(< main_~i~0 994)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24907#(< main_~i~0 994)} is VALID [2022-04-28 02:49:44,764 INFO L290 TraceCheckUtils]: 17: Hoare triple {24914#(< main_~i~0 993)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24907#(< main_~i~0 994)} is VALID [2022-04-28 02:49:44,764 INFO L290 TraceCheckUtils]: 16: Hoare triple {24914#(< main_~i~0 993)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24914#(< main_~i~0 993)} is VALID [2022-04-28 02:49:44,765 INFO L290 TraceCheckUtils]: 15: Hoare triple {24921#(< main_~i~0 992)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24914#(< main_~i~0 993)} is VALID [2022-04-28 02:49:44,765 INFO L290 TraceCheckUtils]: 14: Hoare triple {24921#(< main_~i~0 992)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24921#(< main_~i~0 992)} is VALID [2022-04-28 02:49:44,765 INFO L290 TraceCheckUtils]: 13: Hoare triple {24928#(< main_~i~0 991)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24921#(< main_~i~0 992)} is VALID [2022-04-28 02:49:44,766 INFO L290 TraceCheckUtils]: 12: Hoare triple {24928#(< main_~i~0 991)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24928#(< main_~i~0 991)} is VALID [2022-04-28 02:49:44,766 INFO L290 TraceCheckUtils]: 11: Hoare triple {24935#(< main_~i~0 990)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24928#(< main_~i~0 991)} is VALID [2022-04-28 02:49:44,767 INFO L290 TraceCheckUtils]: 10: Hoare triple {24935#(< main_~i~0 990)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24935#(< main_~i~0 990)} is VALID [2022-04-28 02:49:44,767 INFO L290 TraceCheckUtils]: 9: Hoare triple {24942#(< main_~i~0 989)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24935#(< main_~i~0 990)} is VALID [2022-04-28 02:49:44,768 INFO L290 TraceCheckUtils]: 8: Hoare triple {24942#(< main_~i~0 989)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24942#(< main_~i~0 989)} is VALID [2022-04-28 02:49:44,768 INFO L290 TraceCheckUtils]: 7: Hoare triple {24949#(< main_~i~0 988)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24942#(< main_~i~0 989)} is VALID [2022-04-28 02:49:44,769 INFO L290 TraceCheckUtils]: 6: Hoare triple {24949#(< main_~i~0 988)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24949#(< main_~i~0 988)} is VALID [2022-04-28 02:49:44,769 INFO L290 TraceCheckUtils]: 5: Hoare triple {24389#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {24949#(< main_~i~0 988)} is VALID [2022-04-28 02:49:44,769 INFO L272 TraceCheckUtils]: 4: Hoare triple {24389#true} call #t~ret6 := main(); {24389#true} is VALID [2022-04-28 02:49:44,769 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24389#true} {24389#true} #39#return; {24389#true} is VALID [2022-04-28 02:49:44,769 INFO L290 TraceCheckUtils]: 2: Hoare triple {24389#true} assume true; {24389#true} is VALID [2022-04-28 02:49:44,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {24389#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {24389#true} is VALID [2022-04-28 02:49:44,769 INFO L272 TraceCheckUtils]: 0: Hoare triple {24389#true} call ULTIMATE.init(); {24389#true} is VALID [2022-04-28 02:49:44,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:49:44,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1253397204] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:49:44,770 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:49:44,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 39, 39] total 78 [2022-04-28 02:49:44,770 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:49:44,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [281048366] [2022-04-28 02:49:44,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [281048366] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:49:44,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:49:44,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2022-04-28 02:49:44,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715904030] [2022-04-28 02:49:44,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:49:44,771 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.0) internal successors, (80), 39 states have internal predecessors, (80), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 84 [2022-04-28 02:49:44,771 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:49:44,772 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 40 states, 40 states have (on average 2.0) internal successors, (80), 39 states have internal predecessors, (80), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:49:44,835 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:49:44,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-04-28 02:49:44,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:49:44,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-04-28 02:49:44,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2928, Invalid=3078, Unknown=0, NotChecked=0, Total=6006 [2022-04-28 02:49:44,837 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand has 40 states, 40 states have (on average 2.0) internal successors, (80), 39 states have internal predecessors, (80), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:49:45,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:49:45,934 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2022-04-28 02:49:45,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-28 02:49:45,934 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.0) internal successors, (80), 39 states have internal predecessors, (80), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 84 [2022-04-28 02:49:45,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:49:45,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 2.0) internal successors, (80), 39 states have internal predecessors, (80), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:49:45,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 94 transitions. [2022-04-28 02:49:45,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 2.0) internal successors, (80), 39 states have internal predecessors, (80), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:49:45,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 94 transitions. [2022-04-28 02:49:45,936 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 94 transitions. [2022-04-28 02:49:46,010 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:49:46,011 INFO L225 Difference]: With dead ends: 94 [2022-04-28 02:49:46,011 INFO L226 Difference]: Without dead ends: 88 [2022-04-28 02:49:46,013 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 881 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=5778, Invalid=7332, Unknown=0, NotChecked=0, Total=13110 [2022-04-28 02:49:46,013 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 82 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:49:46,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 29 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:49:46,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-04-28 02:49:46,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2022-04-28 02:49:46,304 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:49:46,305 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand has 87 states, 82 states have (on average 1.0121951219512195) internal successors, (83), 82 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:49:46,305 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand has 87 states, 82 states have (on average 1.0121951219512195) internal successors, (83), 82 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:49:46,305 INFO L87 Difference]: Start difference. First operand 88 states. Second operand has 87 states, 82 states have (on average 1.0121951219512195) internal successors, (83), 82 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:49:46,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:49:46,306 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2022-04-28 02:49:46,306 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2022-04-28 02:49:46,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:49:46,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:49:46,307 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 82 states have (on average 1.0121951219512195) internal successors, (83), 82 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 88 states. [2022-04-28 02:49:46,307 INFO L87 Difference]: Start difference. First operand has 87 states, 82 states have (on average 1.0121951219512195) internal successors, (83), 82 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 88 states. [2022-04-28 02:49:46,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:49:46,308 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2022-04-28 02:49:46,308 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2022-04-28 02:49:46,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:49:46,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:49:46,308 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:49:46,308 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:49:46,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 82 states have (on average 1.0121951219512195) internal successors, (83), 82 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:49:46,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2022-04-28 02:49:46,309 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 84 [2022-04-28 02:49:46,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:49:46,309 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2022-04-28 02:49:46,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.0) internal successors, (80), 39 states have internal predecessors, (80), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:49:46,310 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 87 states and 87 transitions. [2022-04-28 02:49:46,408 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:49:46,408 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2022-04-28 02:49:46,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-28 02:49:46,408 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:49:46,408 INFO L195 NwaCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:49:46,433 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2022-04-28 02:49:46,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:49:46,609 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:49:46,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:49:46,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1425495100, now seen corresponding path program 73 times [2022-04-28 02:49:46,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:49:46,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [855844494] [2022-04-28 02:49:46,611 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:49:46,612 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:49:46,612 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:49:46,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1425495100, now seen corresponding path program 74 times [2022-04-28 02:49:46,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:49:46,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260055070] [2022-04-28 02:49:46,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:49:46,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:49:46,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:49:47,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:49:47,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:49:47,203 INFO L290 TraceCheckUtils]: 0: Hoare triple {25628#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {25585#true} is VALID [2022-04-28 02:49:47,203 INFO L290 TraceCheckUtils]: 1: Hoare triple {25585#true} assume true; {25585#true} is VALID [2022-04-28 02:49:47,204 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25585#true} {25585#true} #39#return; {25585#true} is VALID [2022-04-28 02:49:47,204 INFO L272 TraceCheckUtils]: 0: Hoare triple {25585#true} call ULTIMATE.init(); {25628#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:49:47,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {25628#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {25585#true} is VALID [2022-04-28 02:49:47,204 INFO L290 TraceCheckUtils]: 2: Hoare triple {25585#true} assume true; {25585#true} is VALID [2022-04-28 02:49:47,207 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25585#true} {25585#true} #39#return; {25585#true} is VALID [2022-04-28 02:49:47,207 INFO L272 TraceCheckUtils]: 4: Hoare triple {25585#true} call #t~ret6 := main(); {25585#true} is VALID [2022-04-28 02:49:47,209 INFO L290 TraceCheckUtils]: 5: Hoare triple {25585#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {25590#(= main_~i~0 0)} is VALID [2022-04-28 02:49:47,209 INFO L290 TraceCheckUtils]: 6: Hoare triple {25590#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25590#(= main_~i~0 0)} is VALID [2022-04-28 02:49:47,209 INFO L290 TraceCheckUtils]: 7: Hoare triple {25590#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25591#(<= main_~i~0 1)} is VALID [2022-04-28 02:49:47,210 INFO L290 TraceCheckUtils]: 8: Hoare triple {25591#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25591#(<= main_~i~0 1)} is VALID [2022-04-28 02:49:47,210 INFO L290 TraceCheckUtils]: 9: Hoare triple {25591#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25592#(<= main_~i~0 2)} is VALID [2022-04-28 02:49:47,210 INFO L290 TraceCheckUtils]: 10: Hoare triple {25592#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25592#(<= main_~i~0 2)} is VALID [2022-04-28 02:49:47,211 INFO L290 TraceCheckUtils]: 11: Hoare triple {25592#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25593#(<= main_~i~0 3)} is VALID [2022-04-28 02:49:47,211 INFO L290 TraceCheckUtils]: 12: Hoare triple {25593#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25593#(<= main_~i~0 3)} is VALID [2022-04-28 02:49:47,211 INFO L290 TraceCheckUtils]: 13: Hoare triple {25593#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25594#(<= main_~i~0 4)} is VALID [2022-04-28 02:49:47,211 INFO L290 TraceCheckUtils]: 14: Hoare triple {25594#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25594#(<= main_~i~0 4)} is VALID [2022-04-28 02:49:47,212 INFO L290 TraceCheckUtils]: 15: Hoare triple {25594#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25595#(<= main_~i~0 5)} is VALID [2022-04-28 02:49:47,212 INFO L290 TraceCheckUtils]: 16: Hoare triple {25595#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25595#(<= main_~i~0 5)} is VALID [2022-04-28 02:49:47,212 INFO L290 TraceCheckUtils]: 17: Hoare triple {25595#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25596#(<= main_~i~0 6)} is VALID [2022-04-28 02:49:47,213 INFO L290 TraceCheckUtils]: 18: Hoare triple {25596#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25596#(<= main_~i~0 6)} is VALID [2022-04-28 02:49:47,213 INFO L290 TraceCheckUtils]: 19: Hoare triple {25596#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25597#(<= main_~i~0 7)} is VALID [2022-04-28 02:49:47,213 INFO L290 TraceCheckUtils]: 20: Hoare triple {25597#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25597#(<= main_~i~0 7)} is VALID [2022-04-28 02:49:47,214 INFO L290 TraceCheckUtils]: 21: Hoare triple {25597#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25598#(<= main_~i~0 8)} is VALID [2022-04-28 02:49:47,214 INFO L290 TraceCheckUtils]: 22: Hoare triple {25598#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25598#(<= main_~i~0 8)} is VALID [2022-04-28 02:49:47,214 INFO L290 TraceCheckUtils]: 23: Hoare triple {25598#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25599#(<= main_~i~0 9)} is VALID [2022-04-28 02:49:47,214 INFO L290 TraceCheckUtils]: 24: Hoare triple {25599#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25599#(<= main_~i~0 9)} is VALID [2022-04-28 02:49:47,215 INFO L290 TraceCheckUtils]: 25: Hoare triple {25599#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25600#(<= main_~i~0 10)} is VALID [2022-04-28 02:49:47,215 INFO L290 TraceCheckUtils]: 26: Hoare triple {25600#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25600#(<= main_~i~0 10)} is VALID [2022-04-28 02:49:47,215 INFO L290 TraceCheckUtils]: 27: Hoare triple {25600#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25601#(<= main_~i~0 11)} is VALID [2022-04-28 02:49:47,216 INFO L290 TraceCheckUtils]: 28: Hoare triple {25601#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25601#(<= main_~i~0 11)} is VALID [2022-04-28 02:49:47,216 INFO L290 TraceCheckUtils]: 29: Hoare triple {25601#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25602#(<= main_~i~0 12)} is VALID [2022-04-28 02:49:47,216 INFO L290 TraceCheckUtils]: 30: Hoare triple {25602#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25602#(<= main_~i~0 12)} is VALID [2022-04-28 02:49:47,217 INFO L290 TraceCheckUtils]: 31: Hoare triple {25602#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25603#(<= main_~i~0 13)} is VALID [2022-04-28 02:49:47,217 INFO L290 TraceCheckUtils]: 32: Hoare triple {25603#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25603#(<= main_~i~0 13)} is VALID [2022-04-28 02:49:47,217 INFO L290 TraceCheckUtils]: 33: Hoare triple {25603#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25604#(<= main_~i~0 14)} is VALID [2022-04-28 02:49:47,218 INFO L290 TraceCheckUtils]: 34: Hoare triple {25604#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25604#(<= main_~i~0 14)} is VALID [2022-04-28 02:49:47,218 INFO L290 TraceCheckUtils]: 35: Hoare triple {25604#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25605#(<= main_~i~0 15)} is VALID [2022-04-28 02:49:47,218 INFO L290 TraceCheckUtils]: 36: Hoare triple {25605#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25605#(<= main_~i~0 15)} is VALID [2022-04-28 02:49:47,218 INFO L290 TraceCheckUtils]: 37: Hoare triple {25605#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25606#(<= main_~i~0 16)} is VALID [2022-04-28 02:49:47,219 INFO L290 TraceCheckUtils]: 38: Hoare triple {25606#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25606#(<= main_~i~0 16)} is VALID [2022-04-28 02:49:47,219 INFO L290 TraceCheckUtils]: 39: Hoare triple {25606#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25607#(<= main_~i~0 17)} is VALID [2022-04-28 02:49:47,219 INFO L290 TraceCheckUtils]: 40: Hoare triple {25607#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25607#(<= main_~i~0 17)} is VALID [2022-04-28 02:49:47,220 INFO L290 TraceCheckUtils]: 41: Hoare triple {25607#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25608#(<= main_~i~0 18)} is VALID [2022-04-28 02:49:47,220 INFO L290 TraceCheckUtils]: 42: Hoare triple {25608#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25608#(<= main_~i~0 18)} is VALID [2022-04-28 02:49:47,220 INFO L290 TraceCheckUtils]: 43: Hoare triple {25608#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25609#(<= main_~i~0 19)} is VALID [2022-04-28 02:49:47,221 INFO L290 TraceCheckUtils]: 44: Hoare triple {25609#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25609#(<= main_~i~0 19)} is VALID [2022-04-28 02:49:47,221 INFO L290 TraceCheckUtils]: 45: Hoare triple {25609#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25610#(<= main_~i~0 20)} is VALID [2022-04-28 02:49:47,221 INFO L290 TraceCheckUtils]: 46: Hoare triple {25610#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25610#(<= main_~i~0 20)} is VALID [2022-04-28 02:49:47,222 INFO L290 TraceCheckUtils]: 47: Hoare triple {25610#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25611#(<= main_~i~0 21)} is VALID [2022-04-28 02:49:47,222 INFO L290 TraceCheckUtils]: 48: Hoare triple {25611#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25611#(<= main_~i~0 21)} is VALID [2022-04-28 02:49:47,222 INFO L290 TraceCheckUtils]: 49: Hoare triple {25611#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25612#(<= main_~i~0 22)} is VALID [2022-04-28 02:49:47,222 INFO L290 TraceCheckUtils]: 50: Hoare triple {25612#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25612#(<= main_~i~0 22)} is VALID [2022-04-28 02:49:47,223 INFO L290 TraceCheckUtils]: 51: Hoare triple {25612#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25613#(<= main_~i~0 23)} is VALID [2022-04-28 02:49:47,223 INFO L290 TraceCheckUtils]: 52: Hoare triple {25613#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25613#(<= main_~i~0 23)} is VALID [2022-04-28 02:49:47,223 INFO L290 TraceCheckUtils]: 53: Hoare triple {25613#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25614#(<= main_~i~0 24)} is VALID [2022-04-28 02:49:47,224 INFO L290 TraceCheckUtils]: 54: Hoare triple {25614#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25614#(<= main_~i~0 24)} is VALID [2022-04-28 02:49:47,224 INFO L290 TraceCheckUtils]: 55: Hoare triple {25614#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25615#(<= main_~i~0 25)} is VALID [2022-04-28 02:49:47,224 INFO L290 TraceCheckUtils]: 56: Hoare triple {25615#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25615#(<= main_~i~0 25)} is VALID [2022-04-28 02:49:47,225 INFO L290 TraceCheckUtils]: 57: Hoare triple {25615#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25616#(<= main_~i~0 26)} is VALID [2022-04-28 02:49:47,225 INFO L290 TraceCheckUtils]: 58: Hoare triple {25616#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25616#(<= main_~i~0 26)} is VALID [2022-04-28 02:49:47,225 INFO L290 TraceCheckUtils]: 59: Hoare triple {25616#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25617#(<= main_~i~0 27)} is VALID [2022-04-28 02:49:47,225 INFO L290 TraceCheckUtils]: 60: Hoare triple {25617#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25617#(<= main_~i~0 27)} is VALID [2022-04-28 02:49:47,226 INFO L290 TraceCheckUtils]: 61: Hoare triple {25617#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25618#(<= main_~i~0 28)} is VALID [2022-04-28 02:49:47,226 INFO L290 TraceCheckUtils]: 62: Hoare triple {25618#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25618#(<= main_~i~0 28)} is VALID [2022-04-28 02:49:47,226 INFO L290 TraceCheckUtils]: 63: Hoare triple {25618#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25619#(<= main_~i~0 29)} is VALID [2022-04-28 02:49:47,227 INFO L290 TraceCheckUtils]: 64: Hoare triple {25619#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25619#(<= main_~i~0 29)} is VALID [2022-04-28 02:49:47,227 INFO L290 TraceCheckUtils]: 65: Hoare triple {25619#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25620#(<= main_~i~0 30)} is VALID [2022-04-28 02:49:47,227 INFO L290 TraceCheckUtils]: 66: Hoare triple {25620#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25620#(<= main_~i~0 30)} is VALID [2022-04-28 02:49:47,228 INFO L290 TraceCheckUtils]: 67: Hoare triple {25620#(<= main_~i~0 30)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25621#(<= main_~i~0 31)} is VALID [2022-04-28 02:49:47,228 INFO L290 TraceCheckUtils]: 68: Hoare triple {25621#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25621#(<= main_~i~0 31)} is VALID [2022-04-28 02:49:47,228 INFO L290 TraceCheckUtils]: 69: Hoare triple {25621#(<= main_~i~0 31)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25622#(<= main_~i~0 32)} is VALID [2022-04-28 02:49:47,228 INFO L290 TraceCheckUtils]: 70: Hoare triple {25622#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25622#(<= main_~i~0 32)} is VALID [2022-04-28 02:49:47,229 INFO L290 TraceCheckUtils]: 71: Hoare triple {25622#(<= main_~i~0 32)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25623#(<= main_~i~0 33)} is VALID [2022-04-28 02:49:47,229 INFO L290 TraceCheckUtils]: 72: Hoare triple {25623#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25623#(<= main_~i~0 33)} is VALID [2022-04-28 02:49:47,229 INFO L290 TraceCheckUtils]: 73: Hoare triple {25623#(<= main_~i~0 33)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25624#(<= main_~i~0 34)} is VALID [2022-04-28 02:49:47,230 INFO L290 TraceCheckUtils]: 74: Hoare triple {25624#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25624#(<= main_~i~0 34)} is VALID [2022-04-28 02:49:47,230 INFO L290 TraceCheckUtils]: 75: Hoare triple {25624#(<= main_~i~0 34)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25625#(<= main_~i~0 35)} is VALID [2022-04-28 02:49:47,230 INFO L290 TraceCheckUtils]: 76: Hoare triple {25625#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25625#(<= main_~i~0 35)} is VALID [2022-04-28 02:49:47,231 INFO L290 TraceCheckUtils]: 77: Hoare triple {25625#(<= main_~i~0 35)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25626#(<= main_~i~0 36)} is VALID [2022-04-28 02:49:47,231 INFO L290 TraceCheckUtils]: 78: Hoare triple {25626#(<= main_~i~0 36)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25626#(<= main_~i~0 36)} is VALID [2022-04-28 02:49:47,231 INFO L290 TraceCheckUtils]: 79: Hoare triple {25626#(<= main_~i~0 36)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25627#(<= main_~i~0 37)} is VALID [2022-04-28 02:49:47,232 INFO L290 TraceCheckUtils]: 80: Hoare triple {25627#(<= main_~i~0 37)} assume !(~i~0 < 1024); {25586#false} is VALID [2022-04-28 02:49:47,232 INFO L290 TraceCheckUtils]: 81: Hoare triple {25586#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {25586#false} is VALID [2022-04-28 02:49:47,232 INFO L272 TraceCheckUtils]: 82: Hoare triple {25586#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {25586#false} is VALID [2022-04-28 02:49:47,232 INFO L290 TraceCheckUtils]: 83: Hoare triple {25586#false} ~cond := #in~cond; {25586#false} is VALID [2022-04-28 02:49:47,232 INFO L290 TraceCheckUtils]: 84: Hoare triple {25586#false} assume 0 == ~cond; {25586#false} is VALID [2022-04-28 02:49:47,232 INFO L290 TraceCheckUtils]: 85: Hoare triple {25586#false} assume !false; {25586#false} is VALID [2022-04-28 02:49:47,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:49:47,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:49:47,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260055070] [2022-04-28 02:49:47,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260055070] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:49:47,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015002922] [2022-04-28 02:49:47,233 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:49:47,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:49:47,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:49:47,236 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:49:47,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-04-28 02:49:47,421 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:49:47,422 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:49:47,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-28 02:49:47,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:49:47,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:49:47,958 INFO L272 TraceCheckUtils]: 0: Hoare triple {25585#true} call ULTIMATE.init(); {25585#true} is VALID [2022-04-28 02:49:47,958 INFO L290 TraceCheckUtils]: 1: Hoare triple {25585#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {25585#true} is VALID [2022-04-28 02:49:47,958 INFO L290 TraceCheckUtils]: 2: Hoare triple {25585#true} assume true; {25585#true} is VALID [2022-04-28 02:49:47,958 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25585#true} {25585#true} #39#return; {25585#true} is VALID [2022-04-28 02:49:47,958 INFO L272 TraceCheckUtils]: 4: Hoare triple {25585#true} call #t~ret6 := main(); {25585#true} is VALID [2022-04-28 02:49:47,959 INFO L290 TraceCheckUtils]: 5: Hoare triple {25585#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {25647#(<= main_~i~0 0)} is VALID [2022-04-28 02:49:47,959 INFO L290 TraceCheckUtils]: 6: Hoare triple {25647#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25647#(<= main_~i~0 0)} is VALID [2022-04-28 02:49:47,959 INFO L290 TraceCheckUtils]: 7: Hoare triple {25647#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25591#(<= main_~i~0 1)} is VALID [2022-04-28 02:49:47,960 INFO L290 TraceCheckUtils]: 8: Hoare triple {25591#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25591#(<= main_~i~0 1)} is VALID [2022-04-28 02:49:47,960 INFO L290 TraceCheckUtils]: 9: Hoare triple {25591#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25592#(<= main_~i~0 2)} is VALID [2022-04-28 02:49:47,960 INFO L290 TraceCheckUtils]: 10: Hoare triple {25592#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25592#(<= main_~i~0 2)} is VALID [2022-04-28 02:49:47,961 INFO L290 TraceCheckUtils]: 11: Hoare triple {25592#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25593#(<= main_~i~0 3)} is VALID [2022-04-28 02:49:47,961 INFO L290 TraceCheckUtils]: 12: Hoare triple {25593#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25593#(<= main_~i~0 3)} is VALID [2022-04-28 02:49:47,961 INFO L290 TraceCheckUtils]: 13: Hoare triple {25593#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25594#(<= main_~i~0 4)} is VALID [2022-04-28 02:49:47,961 INFO L290 TraceCheckUtils]: 14: Hoare triple {25594#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25594#(<= main_~i~0 4)} is VALID [2022-04-28 02:49:47,962 INFO L290 TraceCheckUtils]: 15: Hoare triple {25594#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25595#(<= main_~i~0 5)} is VALID [2022-04-28 02:49:47,962 INFO L290 TraceCheckUtils]: 16: Hoare triple {25595#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25595#(<= main_~i~0 5)} is VALID [2022-04-28 02:49:47,962 INFO L290 TraceCheckUtils]: 17: Hoare triple {25595#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25596#(<= main_~i~0 6)} is VALID [2022-04-28 02:49:47,963 INFO L290 TraceCheckUtils]: 18: Hoare triple {25596#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25596#(<= main_~i~0 6)} is VALID [2022-04-28 02:49:47,963 INFO L290 TraceCheckUtils]: 19: Hoare triple {25596#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25597#(<= main_~i~0 7)} is VALID [2022-04-28 02:49:47,963 INFO L290 TraceCheckUtils]: 20: Hoare triple {25597#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25597#(<= main_~i~0 7)} is VALID [2022-04-28 02:49:47,964 INFO L290 TraceCheckUtils]: 21: Hoare triple {25597#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25598#(<= main_~i~0 8)} is VALID [2022-04-28 02:49:47,964 INFO L290 TraceCheckUtils]: 22: Hoare triple {25598#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25598#(<= main_~i~0 8)} is VALID [2022-04-28 02:49:47,964 INFO L290 TraceCheckUtils]: 23: Hoare triple {25598#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25599#(<= main_~i~0 9)} is VALID [2022-04-28 02:49:47,965 INFO L290 TraceCheckUtils]: 24: Hoare triple {25599#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25599#(<= main_~i~0 9)} is VALID [2022-04-28 02:49:47,965 INFO L290 TraceCheckUtils]: 25: Hoare triple {25599#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25600#(<= main_~i~0 10)} is VALID [2022-04-28 02:49:47,965 INFO L290 TraceCheckUtils]: 26: Hoare triple {25600#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25600#(<= main_~i~0 10)} is VALID [2022-04-28 02:49:47,965 INFO L290 TraceCheckUtils]: 27: Hoare triple {25600#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25601#(<= main_~i~0 11)} is VALID [2022-04-28 02:49:47,966 INFO L290 TraceCheckUtils]: 28: Hoare triple {25601#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25601#(<= main_~i~0 11)} is VALID [2022-04-28 02:49:47,966 INFO L290 TraceCheckUtils]: 29: Hoare triple {25601#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25602#(<= main_~i~0 12)} is VALID [2022-04-28 02:49:47,966 INFO L290 TraceCheckUtils]: 30: Hoare triple {25602#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25602#(<= main_~i~0 12)} is VALID [2022-04-28 02:49:47,967 INFO L290 TraceCheckUtils]: 31: Hoare triple {25602#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25603#(<= main_~i~0 13)} is VALID [2022-04-28 02:49:47,967 INFO L290 TraceCheckUtils]: 32: Hoare triple {25603#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25603#(<= main_~i~0 13)} is VALID [2022-04-28 02:49:47,967 INFO L290 TraceCheckUtils]: 33: Hoare triple {25603#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25604#(<= main_~i~0 14)} is VALID [2022-04-28 02:49:47,968 INFO L290 TraceCheckUtils]: 34: Hoare triple {25604#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25604#(<= main_~i~0 14)} is VALID [2022-04-28 02:49:47,968 INFO L290 TraceCheckUtils]: 35: Hoare triple {25604#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25605#(<= main_~i~0 15)} is VALID [2022-04-28 02:49:47,968 INFO L290 TraceCheckUtils]: 36: Hoare triple {25605#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25605#(<= main_~i~0 15)} is VALID [2022-04-28 02:49:47,969 INFO L290 TraceCheckUtils]: 37: Hoare triple {25605#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25606#(<= main_~i~0 16)} is VALID [2022-04-28 02:49:47,969 INFO L290 TraceCheckUtils]: 38: Hoare triple {25606#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25606#(<= main_~i~0 16)} is VALID [2022-04-28 02:49:47,969 INFO L290 TraceCheckUtils]: 39: Hoare triple {25606#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25607#(<= main_~i~0 17)} is VALID [2022-04-28 02:49:47,969 INFO L290 TraceCheckUtils]: 40: Hoare triple {25607#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25607#(<= main_~i~0 17)} is VALID [2022-04-28 02:49:47,970 INFO L290 TraceCheckUtils]: 41: Hoare triple {25607#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25608#(<= main_~i~0 18)} is VALID [2022-04-28 02:49:47,970 INFO L290 TraceCheckUtils]: 42: Hoare triple {25608#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25608#(<= main_~i~0 18)} is VALID [2022-04-28 02:49:47,970 INFO L290 TraceCheckUtils]: 43: Hoare triple {25608#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25609#(<= main_~i~0 19)} is VALID [2022-04-28 02:49:47,971 INFO L290 TraceCheckUtils]: 44: Hoare triple {25609#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25609#(<= main_~i~0 19)} is VALID [2022-04-28 02:49:47,971 INFO L290 TraceCheckUtils]: 45: Hoare triple {25609#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25610#(<= main_~i~0 20)} is VALID [2022-04-28 02:49:47,971 INFO L290 TraceCheckUtils]: 46: Hoare triple {25610#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25610#(<= main_~i~0 20)} is VALID [2022-04-28 02:49:47,972 INFO L290 TraceCheckUtils]: 47: Hoare triple {25610#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25611#(<= main_~i~0 21)} is VALID [2022-04-28 02:49:47,972 INFO L290 TraceCheckUtils]: 48: Hoare triple {25611#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25611#(<= main_~i~0 21)} is VALID [2022-04-28 02:49:47,972 INFO L290 TraceCheckUtils]: 49: Hoare triple {25611#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25612#(<= main_~i~0 22)} is VALID [2022-04-28 02:49:47,972 INFO L290 TraceCheckUtils]: 50: Hoare triple {25612#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25612#(<= main_~i~0 22)} is VALID [2022-04-28 02:49:47,973 INFO L290 TraceCheckUtils]: 51: Hoare triple {25612#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25613#(<= main_~i~0 23)} is VALID [2022-04-28 02:49:47,973 INFO L290 TraceCheckUtils]: 52: Hoare triple {25613#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25613#(<= main_~i~0 23)} is VALID [2022-04-28 02:49:47,973 INFO L290 TraceCheckUtils]: 53: Hoare triple {25613#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25614#(<= main_~i~0 24)} is VALID [2022-04-28 02:49:47,974 INFO L290 TraceCheckUtils]: 54: Hoare triple {25614#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25614#(<= main_~i~0 24)} is VALID [2022-04-28 02:49:47,974 INFO L290 TraceCheckUtils]: 55: Hoare triple {25614#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25615#(<= main_~i~0 25)} is VALID [2022-04-28 02:49:47,974 INFO L290 TraceCheckUtils]: 56: Hoare triple {25615#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25615#(<= main_~i~0 25)} is VALID [2022-04-28 02:49:47,975 INFO L290 TraceCheckUtils]: 57: Hoare triple {25615#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25616#(<= main_~i~0 26)} is VALID [2022-04-28 02:49:47,975 INFO L290 TraceCheckUtils]: 58: Hoare triple {25616#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25616#(<= main_~i~0 26)} is VALID [2022-04-28 02:49:47,975 INFO L290 TraceCheckUtils]: 59: Hoare triple {25616#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25617#(<= main_~i~0 27)} is VALID [2022-04-28 02:49:47,975 INFO L290 TraceCheckUtils]: 60: Hoare triple {25617#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25617#(<= main_~i~0 27)} is VALID [2022-04-28 02:49:47,976 INFO L290 TraceCheckUtils]: 61: Hoare triple {25617#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25618#(<= main_~i~0 28)} is VALID [2022-04-28 02:49:47,976 INFO L290 TraceCheckUtils]: 62: Hoare triple {25618#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25618#(<= main_~i~0 28)} is VALID [2022-04-28 02:49:47,976 INFO L290 TraceCheckUtils]: 63: Hoare triple {25618#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25619#(<= main_~i~0 29)} is VALID [2022-04-28 02:49:47,977 INFO L290 TraceCheckUtils]: 64: Hoare triple {25619#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25619#(<= main_~i~0 29)} is VALID [2022-04-28 02:49:47,977 INFO L290 TraceCheckUtils]: 65: Hoare triple {25619#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25620#(<= main_~i~0 30)} is VALID [2022-04-28 02:49:47,977 INFO L290 TraceCheckUtils]: 66: Hoare triple {25620#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25620#(<= main_~i~0 30)} is VALID [2022-04-28 02:49:47,978 INFO L290 TraceCheckUtils]: 67: Hoare triple {25620#(<= main_~i~0 30)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25621#(<= main_~i~0 31)} is VALID [2022-04-28 02:49:47,978 INFO L290 TraceCheckUtils]: 68: Hoare triple {25621#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25621#(<= main_~i~0 31)} is VALID [2022-04-28 02:49:47,978 INFO L290 TraceCheckUtils]: 69: Hoare triple {25621#(<= main_~i~0 31)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25622#(<= main_~i~0 32)} is VALID [2022-04-28 02:49:47,979 INFO L290 TraceCheckUtils]: 70: Hoare triple {25622#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25622#(<= main_~i~0 32)} is VALID [2022-04-28 02:49:47,979 INFO L290 TraceCheckUtils]: 71: Hoare triple {25622#(<= main_~i~0 32)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25623#(<= main_~i~0 33)} is VALID [2022-04-28 02:49:47,979 INFO L290 TraceCheckUtils]: 72: Hoare triple {25623#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25623#(<= main_~i~0 33)} is VALID [2022-04-28 02:49:47,980 INFO L290 TraceCheckUtils]: 73: Hoare triple {25623#(<= main_~i~0 33)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25624#(<= main_~i~0 34)} is VALID [2022-04-28 02:49:47,980 INFO L290 TraceCheckUtils]: 74: Hoare triple {25624#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25624#(<= main_~i~0 34)} is VALID [2022-04-28 02:49:47,980 INFO L290 TraceCheckUtils]: 75: Hoare triple {25624#(<= main_~i~0 34)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25625#(<= main_~i~0 35)} is VALID [2022-04-28 02:49:47,980 INFO L290 TraceCheckUtils]: 76: Hoare triple {25625#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25625#(<= main_~i~0 35)} is VALID [2022-04-28 02:49:47,981 INFO L290 TraceCheckUtils]: 77: Hoare triple {25625#(<= main_~i~0 35)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25626#(<= main_~i~0 36)} is VALID [2022-04-28 02:49:47,981 INFO L290 TraceCheckUtils]: 78: Hoare triple {25626#(<= main_~i~0 36)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25626#(<= main_~i~0 36)} is VALID [2022-04-28 02:49:47,981 INFO L290 TraceCheckUtils]: 79: Hoare triple {25626#(<= main_~i~0 36)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25627#(<= main_~i~0 37)} is VALID [2022-04-28 02:49:47,982 INFO L290 TraceCheckUtils]: 80: Hoare triple {25627#(<= main_~i~0 37)} assume !(~i~0 < 1024); {25586#false} is VALID [2022-04-28 02:49:47,982 INFO L290 TraceCheckUtils]: 81: Hoare triple {25586#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {25586#false} is VALID [2022-04-28 02:49:47,982 INFO L272 TraceCheckUtils]: 82: Hoare triple {25586#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {25586#false} is VALID [2022-04-28 02:49:47,982 INFO L290 TraceCheckUtils]: 83: Hoare triple {25586#false} ~cond := #in~cond; {25586#false} is VALID [2022-04-28 02:49:47,982 INFO L290 TraceCheckUtils]: 84: Hoare triple {25586#false} assume 0 == ~cond; {25586#false} is VALID [2022-04-28 02:49:47,982 INFO L290 TraceCheckUtils]: 85: Hoare triple {25586#false} assume !false; {25586#false} is VALID [2022-04-28 02:49:47,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:49:47,982 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:49:49,857 INFO L290 TraceCheckUtils]: 85: Hoare triple {25586#false} assume !false; {25586#false} is VALID [2022-04-28 02:49:49,858 INFO L290 TraceCheckUtils]: 84: Hoare triple {25586#false} assume 0 == ~cond; {25586#false} is VALID [2022-04-28 02:49:49,858 INFO L290 TraceCheckUtils]: 83: Hoare triple {25586#false} ~cond := #in~cond; {25586#false} is VALID [2022-04-28 02:49:49,858 INFO L272 TraceCheckUtils]: 82: Hoare triple {25586#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {25586#false} is VALID [2022-04-28 02:49:49,858 INFO L290 TraceCheckUtils]: 81: Hoare triple {25586#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {25586#false} is VALID [2022-04-28 02:49:49,858 INFO L290 TraceCheckUtils]: 80: Hoare triple {25903#(< main_~i~0 1024)} assume !(~i~0 < 1024); {25586#false} is VALID [2022-04-28 02:49:49,858 INFO L290 TraceCheckUtils]: 79: Hoare triple {25907#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25903#(< main_~i~0 1024)} is VALID [2022-04-28 02:49:49,859 INFO L290 TraceCheckUtils]: 78: Hoare triple {25907#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25907#(< main_~i~0 1023)} is VALID [2022-04-28 02:49:49,859 INFO L290 TraceCheckUtils]: 77: Hoare triple {25914#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25907#(< main_~i~0 1023)} is VALID [2022-04-28 02:49:49,859 INFO L290 TraceCheckUtils]: 76: Hoare triple {25914#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25914#(< main_~i~0 1022)} is VALID [2022-04-28 02:49:49,860 INFO L290 TraceCheckUtils]: 75: Hoare triple {25921#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25914#(< main_~i~0 1022)} is VALID [2022-04-28 02:49:49,860 INFO L290 TraceCheckUtils]: 74: Hoare triple {25921#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25921#(< main_~i~0 1021)} is VALID [2022-04-28 02:49:49,860 INFO L290 TraceCheckUtils]: 73: Hoare triple {25928#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25921#(< main_~i~0 1021)} is VALID [2022-04-28 02:49:49,860 INFO L290 TraceCheckUtils]: 72: Hoare triple {25928#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25928#(< main_~i~0 1020)} is VALID [2022-04-28 02:49:49,861 INFO L290 TraceCheckUtils]: 71: Hoare triple {25935#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25928#(< main_~i~0 1020)} is VALID [2022-04-28 02:49:49,861 INFO L290 TraceCheckUtils]: 70: Hoare triple {25935#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25935#(< main_~i~0 1019)} is VALID [2022-04-28 02:49:49,861 INFO L290 TraceCheckUtils]: 69: Hoare triple {25942#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25935#(< main_~i~0 1019)} is VALID [2022-04-28 02:49:49,862 INFO L290 TraceCheckUtils]: 68: Hoare triple {25942#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25942#(< main_~i~0 1018)} is VALID [2022-04-28 02:49:49,862 INFO L290 TraceCheckUtils]: 67: Hoare triple {25949#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25942#(< main_~i~0 1018)} is VALID [2022-04-28 02:49:49,862 INFO L290 TraceCheckUtils]: 66: Hoare triple {25949#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25949#(< main_~i~0 1017)} is VALID [2022-04-28 02:49:49,863 INFO L290 TraceCheckUtils]: 65: Hoare triple {25956#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25949#(< main_~i~0 1017)} is VALID [2022-04-28 02:49:49,863 INFO L290 TraceCheckUtils]: 64: Hoare triple {25956#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25956#(< main_~i~0 1016)} is VALID [2022-04-28 02:49:49,863 INFO L290 TraceCheckUtils]: 63: Hoare triple {25963#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25956#(< main_~i~0 1016)} is VALID [2022-04-28 02:49:49,864 INFO L290 TraceCheckUtils]: 62: Hoare triple {25963#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25963#(< main_~i~0 1015)} is VALID [2022-04-28 02:49:49,864 INFO L290 TraceCheckUtils]: 61: Hoare triple {25970#(< main_~i~0 1014)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25963#(< main_~i~0 1015)} is VALID [2022-04-28 02:49:49,864 INFO L290 TraceCheckUtils]: 60: Hoare triple {25970#(< main_~i~0 1014)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25970#(< main_~i~0 1014)} is VALID [2022-04-28 02:49:49,865 INFO L290 TraceCheckUtils]: 59: Hoare triple {25977#(< main_~i~0 1013)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25970#(< main_~i~0 1014)} is VALID [2022-04-28 02:49:49,865 INFO L290 TraceCheckUtils]: 58: Hoare triple {25977#(< main_~i~0 1013)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25977#(< main_~i~0 1013)} is VALID [2022-04-28 02:49:49,865 INFO L290 TraceCheckUtils]: 57: Hoare triple {25984#(< main_~i~0 1012)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25977#(< main_~i~0 1013)} is VALID [2022-04-28 02:49:49,865 INFO L290 TraceCheckUtils]: 56: Hoare triple {25984#(< main_~i~0 1012)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25984#(< main_~i~0 1012)} is VALID [2022-04-28 02:49:49,866 INFO L290 TraceCheckUtils]: 55: Hoare triple {25991#(< main_~i~0 1011)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25984#(< main_~i~0 1012)} is VALID [2022-04-28 02:49:49,866 INFO L290 TraceCheckUtils]: 54: Hoare triple {25991#(< main_~i~0 1011)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25991#(< main_~i~0 1011)} is VALID [2022-04-28 02:49:49,866 INFO L290 TraceCheckUtils]: 53: Hoare triple {25998#(< main_~i~0 1010)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25991#(< main_~i~0 1011)} is VALID [2022-04-28 02:49:49,867 INFO L290 TraceCheckUtils]: 52: Hoare triple {25998#(< main_~i~0 1010)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25998#(< main_~i~0 1010)} is VALID [2022-04-28 02:49:49,867 INFO L290 TraceCheckUtils]: 51: Hoare triple {26005#(< main_~i~0 1009)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25998#(< main_~i~0 1010)} is VALID [2022-04-28 02:49:49,867 INFO L290 TraceCheckUtils]: 50: Hoare triple {26005#(< main_~i~0 1009)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26005#(< main_~i~0 1009)} is VALID [2022-04-28 02:49:49,868 INFO L290 TraceCheckUtils]: 49: Hoare triple {26012#(< main_~i~0 1008)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26005#(< main_~i~0 1009)} is VALID [2022-04-28 02:49:49,868 INFO L290 TraceCheckUtils]: 48: Hoare triple {26012#(< main_~i~0 1008)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26012#(< main_~i~0 1008)} is VALID [2022-04-28 02:49:49,868 INFO L290 TraceCheckUtils]: 47: Hoare triple {26019#(< main_~i~0 1007)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26012#(< main_~i~0 1008)} is VALID [2022-04-28 02:49:49,869 INFO L290 TraceCheckUtils]: 46: Hoare triple {26019#(< main_~i~0 1007)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26019#(< main_~i~0 1007)} is VALID [2022-04-28 02:49:49,869 INFO L290 TraceCheckUtils]: 45: Hoare triple {26026#(< main_~i~0 1006)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26019#(< main_~i~0 1007)} is VALID [2022-04-28 02:49:49,869 INFO L290 TraceCheckUtils]: 44: Hoare triple {26026#(< main_~i~0 1006)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26026#(< main_~i~0 1006)} is VALID [2022-04-28 02:49:49,869 INFO L290 TraceCheckUtils]: 43: Hoare triple {26033#(< main_~i~0 1005)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26026#(< main_~i~0 1006)} is VALID [2022-04-28 02:49:49,870 INFO L290 TraceCheckUtils]: 42: Hoare triple {26033#(< main_~i~0 1005)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26033#(< main_~i~0 1005)} is VALID [2022-04-28 02:49:49,870 INFO L290 TraceCheckUtils]: 41: Hoare triple {26040#(< main_~i~0 1004)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26033#(< main_~i~0 1005)} is VALID [2022-04-28 02:49:49,870 INFO L290 TraceCheckUtils]: 40: Hoare triple {26040#(< main_~i~0 1004)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26040#(< main_~i~0 1004)} is VALID [2022-04-28 02:49:49,871 INFO L290 TraceCheckUtils]: 39: Hoare triple {26047#(< main_~i~0 1003)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26040#(< main_~i~0 1004)} is VALID [2022-04-28 02:49:49,871 INFO L290 TraceCheckUtils]: 38: Hoare triple {26047#(< main_~i~0 1003)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26047#(< main_~i~0 1003)} is VALID [2022-04-28 02:49:49,871 INFO L290 TraceCheckUtils]: 37: Hoare triple {26054#(< main_~i~0 1002)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26047#(< main_~i~0 1003)} is VALID [2022-04-28 02:49:49,872 INFO L290 TraceCheckUtils]: 36: Hoare triple {26054#(< main_~i~0 1002)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26054#(< main_~i~0 1002)} is VALID [2022-04-28 02:49:49,872 INFO L290 TraceCheckUtils]: 35: Hoare triple {26061#(< main_~i~0 1001)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26054#(< main_~i~0 1002)} is VALID [2022-04-28 02:49:49,872 INFO L290 TraceCheckUtils]: 34: Hoare triple {26061#(< main_~i~0 1001)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26061#(< main_~i~0 1001)} is VALID [2022-04-28 02:49:49,873 INFO L290 TraceCheckUtils]: 33: Hoare triple {26068#(< main_~i~0 1000)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26061#(< main_~i~0 1001)} is VALID [2022-04-28 02:49:49,873 INFO L290 TraceCheckUtils]: 32: Hoare triple {26068#(< main_~i~0 1000)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26068#(< main_~i~0 1000)} is VALID [2022-04-28 02:49:49,873 INFO L290 TraceCheckUtils]: 31: Hoare triple {26075#(< main_~i~0 999)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26068#(< main_~i~0 1000)} is VALID [2022-04-28 02:49:49,873 INFO L290 TraceCheckUtils]: 30: Hoare triple {26075#(< main_~i~0 999)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26075#(< main_~i~0 999)} is VALID [2022-04-28 02:49:49,874 INFO L290 TraceCheckUtils]: 29: Hoare triple {26082#(< main_~i~0 998)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26075#(< main_~i~0 999)} is VALID [2022-04-28 02:49:49,874 INFO L290 TraceCheckUtils]: 28: Hoare triple {26082#(< main_~i~0 998)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26082#(< main_~i~0 998)} is VALID [2022-04-28 02:49:49,874 INFO L290 TraceCheckUtils]: 27: Hoare triple {26089#(< main_~i~0 997)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26082#(< main_~i~0 998)} is VALID [2022-04-28 02:49:49,875 INFO L290 TraceCheckUtils]: 26: Hoare triple {26089#(< main_~i~0 997)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26089#(< main_~i~0 997)} is VALID [2022-04-28 02:49:49,875 INFO L290 TraceCheckUtils]: 25: Hoare triple {26096#(< main_~i~0 996)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26089#(< main_~i~0 997)} is VALID [2022-04-28 02:49:49,875 INFO L290 TraceCheckUtils]: 24: Hoare triple {26096#(< main_~i~0 996)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26096#(< main_~i~0 996)} is VALID [2022-04-28 02:49:49,876 INFO L290 TraceCheckUtils]: 23: Hoare triple {26103#(< main_~i~0 995)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26096#(< main_~i~0 996)} is VALID [2022-04-28 02:49:49,876 INFO L290 TraceCheckUtils]: 22: Hoare triple {26103#(< main_~i~0 995)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26103#(< main_~i~0 995)} is VALID [2022-04-28 02:49:49,876 INFO L290 TraceCheckUtils]: 21: Hoare triple {26110#(< main_~i~0 994)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26103#(< main_~i~0 995)} is VALID [2022-04-28 02:49:49,877 INFO L290 TraceCheckUtils]: 20: Hoare triple {26110#(< main_~i~0 994)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26110#(< main_~i~0 994)} is VALID [2022-04-28 02:49:49,877 INFO L290 TraceCheckUtils]: 19: Hoare triple {26117#(< main_~i~0 993)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26110#(< main_~i~0 994)} is VALID [2022-04-28 02:49:49,877 INFO L290 TraceCheckUtils]: 18: Hoare triple {26117#(< main_~i~0 993)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26117#(< main_~i~0 993)} is VALID [2022-04-28 02:49:49,878 INFO L290 TraceCheckUtils]: 17: Hoare triple {26124#(< main_~i~0 992)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26117#(< main_~i~0 993)} is VALID [2022-04-28 02:49:49,878 INFO L290 TraceCheckUtils]: 16: Hoare triple {26124#(< main_~i~0 992)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26124#(< main_~i~0 992)} is VALID [2022-04-28 02:49:49,878 INFO L290 TraceCheckUtils]: 15: Hoare triple {26131#(< main_~i~0 991)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26124#(< main_~i~0 992)} is VALID [2022-04-28 02:49:49,878 INFO L290 TraceCheckUtils]: 14: Hoare triple {26131#(< main_~i~0 991)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26131#(< main_~i~0 991)} is VALID [2022-04-28 02:49:49,879 INFO L290 TraceCheckUtils]: 13: Hoare triple {26138#(< main_~i~0 990)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26131#(< main_~i~0 991)} is VALID [2022-04-28 02:49:49,879 INFO L290 TraceCheckUtils]: 12: Hoare triple {26138#(< main_~i~0 990)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26138#(< main_~i~0 990)} is VALID [2022-04-28 02:49:49,879 INFO L290 TraceCheckUtils]: 11: Hoare triple {26145#(< main_~i~0 989)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26138#(< main_~i~0 990)} is VALID [2022-04-28 02:49:49,880 INFO L290 TraceCheckUtils]: 10: Hoare triple {26145#(< main_~i~0 989)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26145#(< main_~i~0 989)} is VALID [2022-04-28 02:49:49,880 INFO L290 TraceCheckUtils]: 9: Hoare triple {26152#(< main_~i~0 988)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26145#(< main_~i~0 989)} is VALID [2022-04-28 02:49:49,880 INFO L290 TraceCheckUtils]: 8: Hoare triple {26152#(< main_~i~0 988)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26152#(< main_~i~0 988)} is VALID [2022-04-28 02:49:49,881 INFO L290 TraceCheckUtils]: 7: Hoare triple {26159#(< main_~i~0 987)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26152#(< main_~i~0 988)} is VALID [2022-04-28 02:49:49,881 INFO L290 TraceCheckUtils]: 6: Hoare triple {26159#(< main_~i~0 987)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26159#(< main_~i~0 987)} is VALID [2022-04-28 02:49:49,881 INFO L290 TraceCheckUtils]: 5: Hoare triple {25585#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {26159#(< main_~i~0 987)} is VALID [2022-04-28 02:49:49,881 INFO L272 TraceCheckUtils]: 4: Hoare triple {25585#true} call #t~ret6 := main(); {25585#true} is VALID [2022-04-28 02:49:49,881 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25585#true} {25585#true} #39#return; {25585#true} is VALID [2022-04-28 02:49:49,881 INFO L290 TraceCheckUtils]: 2: Hoare triple {25585#true} assume true; {25585#true} is VALID [2022-04-28 02:49:49,881 INFO L290 TraceCheckUtils]: 1: Hoare triple {25585#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {25585#true} is VALID [2022-04-28 02:49:49,882 INFO L272 TraceCheckUtils]: 0: Hoare triple {25585#true} call ULTIMATE.init(); {25585#true} is VALID [2022-04-28 02:49:49,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:49:49,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1015002922] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:49:49,882 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:49:49,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 40, 40] total 80 [2022-04-28 02:49:49,882 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:49:49,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [855844494] [2022-04-28 02:49:49,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [855844494] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:49:49,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:49:49,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2022-04-28 02:49:49,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784085000] [2022-04-28 02:49:49,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:49:49,883 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.0) internal successors, (82), 40 states have internal predecessors, (82), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 86 [2022-04-28 02:49:49,883 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:49:49,883 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 41 states, 41 states have (on average 2.0) internal successors, (82), 40 states have internal predecessors, (82), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:49:49,956 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:49:49,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-04-28 02:49:49,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:49:49,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-04-28 02:49:49,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3083, Invalid=3237, Unknown=0, NotChecked=0, Total=6320 [2022-04-28 02:49:49,958 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand has 41 states, 41 states have (on average 2.0) internal successors, (82), 40 states have internal predecessors, (82), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:49:51,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:49:51,142 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2022-04-28 02:49:51,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-04-28 02:49:51,143 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.0) internal successors, (82), 40 states have internal predecessors, (82), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 86 [2022-04-28 02:49:51,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:49:51,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 2.0) internal successors, (82), 40 states have internal predecessors, (82), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:49:51,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 96 transitions. [2022-04-28 02:49:51,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 2.0) internal successors, (82), 40 states have internal predecessors, (82), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:49:51,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 96 transitions. [2022-04-28 02:49:51,145 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 96 transitions. [2022-04-28 02:49:51,217 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:49:51,218 INFO L225 Difference]: With dead ends: 96 [2022-04-28 02:49:51,218 INFO L226 Difference]: Without dead ends: 90 [2022-04-28 02:49:51,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=6086, Invalid=7720, Unknown=0, NotChecked=0, Total=13806 [2022-04-28 02:49:51,220 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 84 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:49:51,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 44 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:49:51,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-04-28 02:49:51,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2022-04-28 02:49:51,535 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:49:51,535 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand has 89 states, 84 states have (on average 1.0119047619047619) internal successors, (85), 84 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:49:51,535 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand has 89 states, 84 states have (on average 1.0119047619047619) internal successors, (85), 84 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:49:51,535 INFO L87 Difference]: Start difference. First operand 90 states. Second operand has 89 states, 84 states have (on average 1.0119047619047619) internal successors, (85), 84 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:49:51,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:49:51,536 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2022-04-28 02:49:51,536 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2022-04-28 02:49:51,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:49:51,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:49:51,537 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 84 states have (on average 1.0119047619047619) internal successors, (85), 84 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 90 states. [2022-04-28 02:49:51,537 INFO L87 Difference]: Start difference. First operand has 89 states, 84 states have (on average 1.0119047619047619) internal successors, (85), 84 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 90 states. [2022-04-28 02:49:51,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:49:51,537 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2022-04-28 02:49:51,537 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2022-04-28 02:49:51,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:49:51,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:49:51,538 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:49:51,538 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:49:51,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 84 states have (on average 1.0119047619047619) internal successors, (85), 84 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:49:51,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2022-04-28 02:49:51,539 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 86 [2022-04-28 02:49:51,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:49:51,539 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2022-04-28 02:49:51,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.0) internal successors, (82), 40 states have internal predecessors, (82), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:49:51,539 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 89 states and 89 transitions. [2022-04-28 02:49:51,664 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:49:51,664 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2022-04-28 02:49:51,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-04-28 02:49:51,664 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:49:51,665 INFO L195 NwaCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:49:51,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-04-28 02:49:51,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-04-28 02:49:51,875 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:49:51,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:49:51,876 INFO L85 PathProgramCache]: Analyzing trace with hash -680311226, now seen corresponding path program 75 times [2022-04-28 02:49:51,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:49:51,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1557409643] [2022-04-28 02:49:51,879 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:49:51,879 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:49:51,879 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:49:51,879 INFO L85 PathProgramCache]: Analyzing trace with hash -680311226, now seen corresponding path program 76 times [2022-04-28 02:49:51,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:49:51,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374830890] [2022-04-28 02:49:51,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:49:51,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:49:51,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:49:52,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:49:52,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:49:52,576 INFO L290 TraceCheckUtils]: 0: Hoare triple {26853#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {26809#true} is VALID [2022-04-28 02:49:52,576 INFO L290 TraceCheckUtils]: 1: Hoare triple {26809#true} assume true; {26809#true} is VALID [2022-04-28 02:49:52,576 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26809#true} {26809#true} #39#return; {26809#true} is VALID [2022-04-28 02:49:52,577 INFO L272 TraceCheckUtils]: 0: Hoare triple {26809#true} call ULTIMATE.init(); {26853#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:49:52,577 INFO L290 TraceCheckUtils]: 1: Hoare triple {26853#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {26809#true} is VALID [2022-04-28 02:49:52,577 INFO L290 TraceCheckUtils]: 2: Hoare triple {26809#true} assume true; {26809#true} is VALID [2022-04-28 02:49:52,577 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26809#true} {26809#true} #39#return; {26809#true} is VALID [2022-04-28 02:49:52,577 INFO L272 TraceCheckUtils]: 4: Hoare triple {26809#true} call #t~ret6 := main(); {26809#true} is VALID [2022-04-28 02:49:52,577 INFO L290 TraceCheckUtils]: 5: Hoare triple {26809#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {26814#(= main_~i~0 0)} is VALID [2022-04-28 02:49:52,577 INFO L290 TraceCheckUtils]: 6: Hoare triple {26814#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26814#(= main_~i~0 0)} is VALID [2022-04-28 02:49:52,578 INFO L290 TraceCheckUtils]: 7: Hoare triple {26814#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26815#(<= main_~i~0 1)} is VALID [2022-04-28 02:49:52,578 INFO L290 TraceCheckUtils]: 8: Hoare triple {26815#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26815#(<= main_~i~0 1)} is VALID [2022-04-28 02:49:52,578 INFO L290 TraceCheckUtils]: 9: Hoare triple {26815#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26816#(<= main_~i~0 2)} is VALID [2022-04-28 02:49:52,578 INFO L290 TraceCheckUtils]: 10: Hoare triple {26816#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26816#(<= main_~i~0 2)} is VALID [2022-04-28 02:49:52,579 INFO L290 TraceCheckUtils]: 11: Hoare triple {26816#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26817#(<= main_~i~0 3)} is VALID [2022-04-28 02:49:52,579 INFO L290 TraceCheckUtils]: 12: Hoare triple {26817#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26817#(<= main_~i~0 3)} is VALID [2022-04-28 02:49:52,579 INFO L290 TraceCheckUtils]: 13: Hoare triple {26817#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26818#(<= main_~i~0 4)} is VALID [2022-04-28 02:49:52,580 INFO L290 TraceCheckUtils]: 14: Hoare triple {26818#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26818#(<= main_~i~0 4)} is VALID [2022-04-28 02:49:52,580 INFO L290 TraceCheckUtils]: 15: Hoare triple {26818#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26819#(<= main_~i~0 5)} is VALID [2022-04-28 02:49:52,580 INFO L290 TraceCheckUtils]: 16: Hoare triple {26819#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26819#(<= main_~i~0 5)} is VALID [2022-04-28 02:49:52,581 INFO L290 TraceCheckUtils]: 17: Hoare triple {26819#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26820#(<= main_~i~0 6)} is VALID [2022-04-28 02:49:52,581 INFO L290 TraceCheckUtils]: 18: Hoare triple {26820#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26820#(<= main_~i~0 6)} is VALID [2022-04-28 02:49:52,581 INFO L290 TraceCheckUtils]: 19: Hoare triple {26820#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26821#(<= main_~i~0 7)} is VALID [2022-04-28 02:49:52,581 INFO L290 TraceCheckUtils]: 20: Hoare triple {26821#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26821#(<= main_~i~0 7)} is VALID [2022-04-28 02:49:52,582 INFO L290 TraceCheckUtils]: 21: Hoare triple {26821#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26822#(<= main_~i~0 8)} is VALID [2022-04-28 02:49:52,582 INFO L290 TraceCheckUtils]: 22: Hoare triple {26822#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26822#(<= main_~i~0 8)} is VALID [2022-04-28 02:49:52,582 INFO L290 TraceCheckUtils]: 23: Hoare triple {26822#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26823#(<= main_~i~0 9)} is VALID [2022-04-28 02:49:52,583 INFO L290 TraceCheckUtils]: 24: Hoare triple {26823#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26823#(<= main_~i~0 9)} is VALID [2022-04-28 02:49:52,583 INFO L290 TraceCheckUtils]: 25: Hoare triple {26823#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26824#(<= main_~i~0 10)} is VALID [2022-04-28 02:49:52,583 INFO L290 TraceCheckUtils]: 26: Hoare triple {26824#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26824#(<= main_~i~0 10)} is VALID [2022-04-28 02:49:52,584 INFO L290 TraceCheckUtils]: 27: Hoare triple {26824#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26825#(<= main_~i~0 11)} is VALID [2022-04-28 02:49:52,584 INFO L290 TraceCheckUtils]: 28: Hoare triple {26825#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26825#(<= main_~i~0 11)} is VALID [2022-04-28 02:49:52,584 INFO L290 TraceCheckUtils]: 29: Hoare triple {26825#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26826#(<= main_~i~0 12)} is VALID [2022-04-28 02:49:52,584 INFO L290 TraceCheckUtils]: 30: Hoare triple {26826#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26826#(<= main_~i~0 12)} is VALID [2022-04-28 02:49:52,585 INFO L290 TraceCheckUtils]: 31: Hoare triple {26826#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26827#(<= main_~i~0 13)} is VALID [2022-04-28 02:49:52,585 INFO L290 TraceCheckUtils]: 32: Hoare triple {26827#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26827#(<= main_~i~0 13)} is VALID [2022-04-28 02:49:52,585 INFO L290 TraceCheckUtils]: 33: Hoare triple {26827#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26828#(<= main_~i~0 14)} is VALID [2022-04-28 02:49:52,586 INFO L290 TraceCheckUtils]: 34: Hoare triple {26828#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26828#(<= main_~i~0 14)} is VALID [2022-04-28 02:49:52,586 INFO L290 TraceCheckUtils]: 35: Hoare triple {26828#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26829#(<= main_~i~0 15)} is VALID [2022-04-28 02:49:52,586 INFO L290 TraceCheckUtils]: 36: Hoare triple {26829#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26829#(<= main_~i~0 15)} is VALID [2022-04-28 02:49:52,587 INFO L290 TraceCheckUtils]: 37: Hoare triple {26829#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26830#(<= main_~i~0 16)} is VALID [2022-04-28 02:49:52,587 INFO L290 TraceCheckUtils]: 38: Hoare triple {26830#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26830#(<= main_~i~0 16)} is VALID [2022-04-28 02:49:52,587 INFO L290 TraceCheckUtils]: 39: Hoare triple {26830#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26831#(<= main_~i~0 17)} is VALID [2022-04-28 02:49:52,587 INFO L290 TraceCheckUtils]: 40: Hoare triple {26831#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26831#(<= main_~i~0 17)} is VALID [2022-04-28 02:49:52,588 INFO L290 TraceCheckUtils]: 41: Hoare triple {26831#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26832#(<= main_~i~0 18)} is VALID [2022-04-28 02:49:52,588 INFO L290 TraceCheckUtils]: 42: Hoare triple {26832#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26832#(<= main_~i~0 18)} is VALID [2022-04-28 02:49:52,588 INFO L290 TraceCheckUtils]: 43: Hoare triple {26832#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26833#(<= main_~i~0 19)} is VALID [2022-04-28 02:49:52,589 INFO L290 TraceCheckUtils]: 44: Hoare triple {26833#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26833#(<= main_~i~0 19)} is VALID [2022-04-28 02:49:52,589 INFO L290 TraceCheckUtils]: 45: Hoare triple {26833#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26834#(<= main_~i~0 20)} is VALID [2022-04-28 02:49:52,589 INFO L290 TraceCheckUtils]: 46: Hoare triple {26834#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26834#(<= main_~i~0 20)} is VALID [2022-04-28 02:49:52,590 INFO L290 TraceCheckUtils]: 47: Hoare triple {26834#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26835#(<= main_~i~0 21)} is VALID [2022-04-28 02:49:52,590 INFO L290 TraceCheckUtils]: 48: Hoare triple {26835#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26835#(<= main_~i~0 21)} is VALID [2022-04-28 02:49:52,590 INFO L290 TraceCheckUtils]: 49: Hoare triple {26835#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26836#(<= main_~i~0 22)} is VALID [2022-04-28 02:49:52,590 INFO L290 TraceCheckUtils]: 50: Hoare triple {26836#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26836#(<= main_~i~0 22)} is VALID [2022-04-28 02:49:52,591 INFO L290 TraceCheckUtils]: 51: Hoare triple {26836#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26837#(<= main_~i~0 23)} is VALID [2022-04-28 02:49:52,591 INFO L290 TraceCheckUtils]: 52: Hoare triple {26837#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26837#(<= main_~i~0 23)} is VALID [2022-04-28 02:49:52,591 INFO L290 TraceCheckUtils]: 53: Hoare triple {26837#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26838#(<= main_~i~0 24)} is VALID [2022-04-28 02:49:52,592 INFO L290 TraceCheckUtils]: 54: Hoare triple {26838#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26838#(<= main_~i~0 24)} is VALID [2022-04-28 02:49:52,592 INFO L290 TraceCheckUtils]: 55: Hoare triple {26838#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26839#(<= main_~i~0 25)} is VALID [2022-04-28 02:49:52,592 INFO L290 TraceCheckUtils]: 56: Hoare triple {26839#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26839#(<= main_~i~0 25)} is VALID [2022-04-28 02:49:52,593 INFO L290 TraceCheckUtils]: 57: Hoare triple {26839#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26840#(<= main_~i~0 26)} is VALID [2022-04-28 02:49:52,593 INFO L290 TraceCheckUtils]: 58: Hoare triple {26840#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26840#(<= main_~i~0 26)} is VALID [2022-04-28 02:49:52,593 INFO L290 TraceCheckUtils]: 59: Hoare triple {26840#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26841#(<= main_~i~0 27)} is VALID [2022-04-28 02:49:52,593 INFO L290 TraceCheckUtils]: 60: Hoare triple {26841#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26841#(<= main_~i~0 27)} is VALID [2022-04-28 02:49:52,594 INFO L290 TraceCheckUtils]: 61: Hoare triple {26841#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26842#(<= main_~i~0 28)} is VALID [2022-04-28 02:49:52,594 INFO L290 TraceCheckUtils]: 62: Hoare triple {26842#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26842#(<= main_~i~0 28)} is VALID [2022-04-28 02:49:52,594 INFO L290 TraceCheckUtils]: 63: Hoare triple {26842#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26843#(<= main_~i~0 29)} is VALID [2022-04-28 02:49:52,595 INFO L290 TraceCheckUtils]: 64: Hoare triple {26843#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26843#(<= main_~i~0 29)} is VALID [2022-04-28 02:49:52,595 INFO L290 TraceCheckUtils]: 65: Hoare triple {26843#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26844#(<= main_~i~0 30)} is VALID [2022-04-28 02:49:52,595 INFO L290 TraceCheckUtils]: 66: Hoare triple {26844#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26844#(<= main_~i~0 30)} is VALID [2022-04-28 02:49:52,596 INFO L290 TraceCheckUtils]: 67: Hoare triple {26844#(<= main_~i~0 30)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26845#(<= main_~i~0 31)} is VALID [2022-04-28 02:49:52,596 INFO L290 TraceCheckUtils]: 68: Hoare triple {26845#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26845#(<= main_~i~0 31)} is VALID [2022-04-28 02:49:52,596 INFO L290 TraceCheckUtils]: 69: Hoare triple {26845#(<= main_~i~0 31)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26846#(<= main_~i~0 32)} is VALID [2022-04-28 02:49:52,597 INFO L290 TraceCheckUtils]: 70: Hoare triple {26846#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26846#(<= main_~i~0 32)} is VALID [2022-04-28 02:49:52,597 INFO L290 TraceCheckUtils]: 71: Hoare triple {26846#(<= main_~i~0 32)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26847#(<= main_~i~0 33)} is VALID [2022-04-28 02:49:52,597 INFO L290 TraceCheckUtils]: 72: Hoare triple {26847#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26847#(<= main_~i~0 33)} is VALID [2022-04-28 02:49:52,597 INFO L290 TraceCheckUtils]: 73: Hoare triple {26847#(<= main_~i~0 33)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26848#(<= main_~i~0 34)} is VALID [2022-04-28 02:49:52,598 INFO L290 TraceCheckUtils]: 74: Hoare triple {26848#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26848#(<= main_~i~0 34)} is VALID [2022-04-28 02:49:52,598 INFO L290 TraceCheckUtils]: 75: Hoare triple {26848#(<= main_~i~0 34)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26849#(<= main_~i~0 35)} is VALID [2022-04-28 02:49:52,598 INFO L290 TraceCheckUtils]: 76: Hoare triple {26849#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26849#(<= main_~i~0 35)} is VALID [2022-04-28 02:49:52,599 INFO L290 TraceCheckUtils]: 77: Hoare triple {26849#(<= main_~i~0 35)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26850#(<= main_~i~0 36)} is VALID [2022-04-28 02:49:52,599 INFO L290 TraceCheckUtils]: 78: Hoare triple {26850#(<= main_~i~0 36)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26850#(<= main_~i~0 36)} is VALID [2022-04-28 02:49:52,599 INFO L290 TraceCheckUtils]: 79: Hoare triple {26850#(<= main_~i~0 36)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26851#(<= main_~i~0 37)} is VALID [2022-04-28 02:49:52,600 INFO L290 TraceCheckUtils]: 80: Hoare triple {26851#(<= main_~i~0 37)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26851#(<= main_~i~0 37)} is VALID [2022-04-28 02:49:52,600 INFO L290 TraceCheckUtils]: 81: Hoare triple {26851#(<= main_~i~0 37)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26852#(<= main_~i~0 38)} is VALID [2022-04-28 02:49:52,600 INFO L290 TraceCheckUtils]: 82: Hoare triple {26852#(<= main_~i~0 38)} assume !(~i~0 < 1024); {26810#false} is VALID [2022-04-28 02:49:52,600 INFO L290 TraceCheckUtils]: 83: Hoare triple {26810#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {26810#false} is VALID [2022-04-28 02:49:52,600 INFO L272 TraceCheckUtils]: 84: Hoare triple {26810#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {26810#false} is VALID [2022-04-28 02:49:52,600 INFO L290 TraceCheckUtils]: 85: Hoare triple {26810#false} ~cond := #in~cond; {26810#false} is VALID [2022-04-28 02:49:52,600 INFO L290 TraceCheckUtils]: 86: Hoare triple {26810#false} assume 0 == ~cond; {26810#false} is VALID [2022-04-28 02:49:52,600 INFO L290 TraceCheckUtils]: 87: Hoare triple {26810#false} assume !false; {26810#false} is VALID [2022-04-28 02:49:52,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:49:52,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:49:52,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374830890] [2022-04-28 02:49:52,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374830890] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:49:52,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900861021] [2022-04-28 02:49:52,601 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 02:49:52,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:49:52,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:49:52,602 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:49:52,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-04-28 02:49:52,802 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 02:49:52,802 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:49:52,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-28 02:49:52,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:49:52,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:49:53,296 INFO L272 TraceCheckUtils]: 0: Hoare triple {26809#true} call ULTIMATE.init(); {26809#true} is VALID [2022-04-28 02:49:53,296 INFO L290 TraceCheckUtils]: 1: Hoare triple {26809#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {26809#true} is VALID [2022-04-28 02:49:53,296 INFO L290 TraceCheckUtils]: 2: Hoare triple {26809#true} assume true; {26809#true} is VALID [2022-04-28 02:49:53,296 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26809#true} {26809#true} #39#return; {26809#true} is VALID [2022-04-28 02:49:53,296 INFO L272 TraceCheckUtils]: 4: Hoare triple {26809#true} call #t~ret6 := main(); {26809#true} is VALID [2022-04-28 02:49:53,296 INFO L290 TraceCheckUtils]: 5: Hoare triple {26809#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {26872#(<= main_~i~0 0)} is VALID [2022-04-28 02:49:53,297 INFO L290 TraceCheckUtils]: 6: Hoare triple {26872#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26872#(<= main_~i~0 0)} is VALID [2022-04-28 02:49:53,297 INFO L290 TraceCheckUtils]: 7: Hoare triple {26872#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26815#(<= main_~i~0 1)} is VALID [2022-04-28 02:49:53,297 INFO L290 TraceCheckUtils]: 8: Hoare triple {26815#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26815#(<= main_~i~0 1)} is VALID [2022-04-28 02:49:53,298 INFO L290 TraceCheckUtils]: 9: Hoare triple {26815#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26816#(<= main_~i~0 2)} is VALID [2022-04-28 02:49:53,298 INFO L290 TraceCheckUtils]: 10: Hoare triple {26816#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26816#(<= main_~i~0 2)} is VALID [2022-04-28 02:49:53,298 INFO L290 TraceCheckUtils]: 11: Hoare triple {26816#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26817#(<= main_~i~0 3)} is VALID [2022-04-28 02:49:53,299 INFO L290 TraceCheckUtils]: 12: Hoare triple {26817#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26817#(<= main_~i~0 3)} is VALID [2022-04-28 02:49:53,299 INFO L290 TraceCheckUtils]: 13: Hoare triple {26817#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26818#(<= main_~i~0 4)} is VALID [2022-04-28 02:49:53,299 INFO L290 TraceCheckUtils]: 14: Hoare triple {26818#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26818#(<= main_~i~0 4)} is VALID [2022-04-28 02:49:53,299 INFO L290 TraceCheckUtils]: 15: Hoare triple {26818#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26819#(<= main_~i~0 5)} is VALID [2022-04-28 02:49:53,300 INFO L290 TraceCheckUtils]: 16: Hoare triple {26819#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26819#(<= main_~i~0 5)} is VALID [2022-04-28 02:49:53,300 INFO L290 TraceCheckUtils]: 17: Hoare triple {26819#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26820#(<= main_~i~0 6)} is VALID [2022-04-28 02:49:53,300 INFO L290 TraceCheckUtils]: 18: Hoare triple {26820#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26820#(<= main_~i~0 6)} is VALID [2022-04-28 02:49:53,301 INFO L290 TraceCheckUtils]: 19: Hoare triple {26820#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26821#(<= main_~i~0 7)} is VALID [2022-04-28 02:49:53,301 INFO L290 TraceCheckUtils]: 20: Hoare triple {26821#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26821#(<= main_~i~0 7)} is VALID [2022-04-28 02:49:53,301 INFO L290 TraceCheckUtils]: 21: Hoare triple {26821#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26822#(<= main_~i~0 8)} is VALID [2022-04-28 02:49:53,302 INFO L290 TraceCheckUtils]: 22: Hoare triple {26822#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26822#(<= main_~i~0 8)} is VALID [2022-04-28 02:49:53,302 INFO L290 TraceCheckUtils]: 23: Hoare triple {26822#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26823#(<= main_~i~0 9)} is VALID [2022-04-28 02:49:53,302 INFO L290 TraceCheckUtils]: 24: Hoare triple {26823#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26823#(<= main_~i~0 9)} is VALID [2022-04-28 02:49:53,303 INFO L290 TraceCheckUtils]: 25: Hoare triple {26823#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26824#(<= main_~i~0 10)} is VALID [2022-04-28 02:49:53,303 INFO L290 TraceCheckUtils]: 26: Hoare triple {26824#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26824#(<= main_~i~0 10)} is VALID [2022-04-28 02:49:53,303 INFO L290 TraceCheckUtils]: 27: Hoare triple {26824#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26825#(<= main_~i~0 11)} is VALID [2022-04-28 02:49:53,303 INFO L290 TraceCheckUtils]: 28: Hoare triple {26825#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26825#(<= main_~i~0 11)} is VALID [2022-04-28 02:49:53,304 INFO L290 TraceCheckUtils]: 29: Hoare triple {26825#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26826#(<= main_~i~0 12)} is VALID [2022-04-28 02:49:53,304 INFO L290 TraceCheckUtils]: 30: Hoare triple {26826#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26826#(<= main_~i~0 12)} is VALID [2022-04-28 02:49:53,304 INFO L290 TraceCheckUtils]: 31: Hoare triple {26826#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26827#(<= main_~i~0 13)} is VALID [2022-04-28 02:49:53,305 INFO L290 TraceCheckUtils]: 32: Hoare triple {26827#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26827#(<= main_~i~0 13)} is VALID [2022-04-28 02:49:53,305 INFO L290 TraceCheckUtils]: 33: Hoare triple {26827#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26828#(<= main_~i~0 14)} is VALID [2022-04-28 02:49:53,305 INFO L290 TraceCheckUtils]: 34: Hoare triple {26828#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26828#(<= main_~i~0 14)} is VALID [2022-04-28 02:49:53,306 INFO L290 TraceCheckUtils]: 35: Hoare triple {26828#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26829#(<= main_~i~0 15)} is VALID [2022-04-28 02:49:53,306 INFO L290 TraceCheckUtils]: 36: Hoare triple {26829#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26829#(<= main_~i~0 15)} is VALID [2022-04-28 02:49:53,306 INFO L290 TraceCheckUtils]: 37: Hoare triple {26829#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26830#(<= main_~i~0 16)} is VALID [2022-04-28 02:49:53,306 INFO L290 TraceCheckUtils]: 38: Hoare triple {26830#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26830#(<= main_~i~0 16)} is VALID [2022-04-28 02:49:53,307 INFO L290 TraceCheckUtils]: 39: Hoare triple {26830#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26831#(<= main_~i~0 17)} is VALID [2022-04-28 02:49:53,307 INFO L290 TraceCheckUtils]: 40: Hoare triple {26831#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26831#(<= main_~i~0 17)} is VALID [2022-04-28 02:49:53,307 INFO L290 TraceCheckUtils]: 41: Hoare triple {26831#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26832#(<= main_~i~0 18)} is VALID [2022-04-28 02:49:53,308 INFO L290 TraceCheckUtils]: 42: Hoare triple {26832#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26832#(<= main_~i~0 18)} is VALID [2022-04-28 02:49:53,308 INFO L290 TraceCheckUtils]: 43: Hoare triple {26832#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26833#(<= main_~i~0 19)} is VALID [2022-04-28 02:49:53,308 INFO L290 TraceCheckUtils]: 44: Hoare triple {26833#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26833#(<= main_~i~0 19)} is VALID [2022-04-28 02:49:53,309 INFO L290 TraceCheckUtils]: 45: Hoare triple {26833#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26834#(<= main_~i~0 20)} is VALID [2022-04-28 02:49:53,309 INFO L290 TraceCheckUtils]: 46: Hoare triple {26834#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26834#(<= main_~i~0 20)} is VALID [2022-04-28 02:49:53,309 INFO L290 TraceCheckUtils]: 47: Hoare triple {26834#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26835#(<= main_~i~0 21)} is VALID [2022-04-28 02:49:53,310 INFO L290 TraceCheckUtils]: 48: Hoare triple {26835#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26835#(<= main_~i~0 21)} is VALID [2022-04-28 02:49:53,310 INFO L290 TraceCheckUtils]: 49: Hoare triple {26835#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26836#(<= main_~i~0 22)} is VALID [2022-04-28 02:49:53,310 INFO L290 TraceCheckUtils]: 50: Hoare triple {26836#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26836#(<= main_~i~0 22)} is VALID [2022-04-28 02:49:53,311 INFO L290 TraceCheckUtils]: 51: Hoare triple {26836#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26837#(<= main_~i~0 23)} is VALID [2022-04-28 02:49:53,311 INFO L290 TraceCheckUtils]: 52: Hoare triple {26837#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26837#(<= main_~i~0 23)} is VALID [2022-04-28 02:49:53,311 INFO L290 TraceCheckUtils]: 53: Hoare triple {26837#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26838#(<= main_~i~0 24)} is VALID [2022-04-28 02:49:53,311 INFO L290 TraceCheckUtils]: 54: Hoare triple {26838#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26838#(<= main_~i~0 24)} is VALID [2022-04-28 02:49:53,312 INFO L290 TraceCheckUtils]: 55: Hoare triple {26838#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26839#(<= main_~i~0 25)} is VALID [2022-04-28 02:49:53,312 INFO L290 TraceCheckUtils]: 56: Hoare triple {26839#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26839#(<= main_~i~0 25)} is VALID [2022-04-28 02:49:53,312 INFO L290 TraceCheckUtils]: 57: Hoare triple {26839#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26840#(<= main_~i~0 26)} is VALID [2022-04-28 02:49:53,313 INFO L290 TraceCheckUtils]: 58: Hoare triple {26840#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26840#(<= main_~i~0 26)} is VALID [2022-04-28 02:49:53,313 INFO L290 TraceCheckUtils]: 59: Hoare triple {26840#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26841#(<= main_~i~0 27)} is VALID [2022-04-28 02:49:53,313 INFO L290 TraceCheckUtils]: 60: Hoare triple {26841#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26841#(<= main_~i~0 27)} is VALID [2022-04-28 02:49:53,314 INFO L290 TraceCheckUtils]: 61: Hoare triple {26841#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26842#(<= main_~i~0 28)} is VALID [2022-04-28 02:49:53,314 INFO L290 TraceCheckUtils]: 62: Hoare triple {26842#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26842#(<= main_~i~0 28)} is VALID [2022-04-28 02:49:53,314 INFO L290 TraceCheckUtils]: 63: Hoare triple {26842#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26843#(<= main_~i~0 29)} is VALID [2022-04-28 02:49:53,314 INFO L290 TraceCheckUtils]: 64: Hoare triple {26843#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26843#(<= main_~i~0 29)} is VALID [2022-04-28 02:49:53,315 INFO L290 TraceCheckUtils]: 65: Hoare triple {26843#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26844#(<= main_~i~0 30)} is VALID [2022-04-28 02:49:53,315 INFO L290 TraceCheckUtils]: 66: Hoare triple {26844#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26844#(<= main_~i~0 30)} is VALID [2022-04-28 02:49:53,315 INFO L290 TraceCheckUtils]: 67: Hoare triple {26844#(<= main_~i~0 30)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26845#(<= main_~i~0 31)} is VALID [2022-04-28 02:49:53,316 INFO L290 TraceCheckUtils]: 68: Hoare triple {26845#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26845#(<= main_~i~0 31)} is VALID [2022-04-28 02:49:53,316 INFO L290 TraceCheckUtils]: 69: Hoare triple {26845#(<= main_~i~0 31)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26846#(<= main_~i~0 32)} is VALID [2022-04-28 02:49:53,316 INFO L290 TraceCheckUtils]: 70: Hoare triple {26846#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26846#(<= main_~i~0 32)} is VALID [2022-04-28 02:49:53,317 INFO L290 TraceCheckUtils]: 71: Hoare triple {26846#(<= main_~i~0 32)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26847#(<= main_~i~0 33)} is VALID [2022-04-28 02:49:53,317 INFO L290 TraceCheckUtils]: 72: Hoare triple {26847#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26847#(<= main_~i~0 33)} is VALID [2022-04-28 02:49:53,317 INFO L290 TraceCheckUtils]: 73: Hoare triple {26847#(<= main_~i~0 33)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26848#(<= main_~i~0 34)} is VALID [2022-04-28 02:49:53,318 INFO L290 TraceCheckUtils]: 74: Hoare triple {26848#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26848#(<= main_~i~0 34)} is VALID [2022-04-28 02:49:53,318 INFO L290 TraceCheckUtils]: 75: Hoare triple {26848#(<= main_~i~0 34)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26849#(<= main_~i~0 35)} is VALID [2022-04-28 02:49:53,318 INFO L290 TraceCheckUtils]: 76: Hoare triple {26849#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26849#(<= main_~i~0 35)} is VALID [2022-04-28 02:49:53,319 INFO L290 TraceCheckUtils]: 77: Hoare triple {26849#(<= main_~i~0 35)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26850#(<= main_~i~0 36)} is VALID [2022-04-28 02:49:53,319 INFO L290 TraceCheckUtils]: 78: Hoare triple {26850#(<= main_~i~0 36)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26850#(<= main_~i~0 36)} is VALID [2022-04-28 02:49:53,319 INFO L290 TraceCheckUtils]: 79: Hoare triple {26850#(<= main_~i~0 36)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26851#(<= main_~i~0 37)} is VALID [2022-04-28 02:49:53,319 INFO L290 TraceCheckUtils]: 80: Hoare triple {26851#(<= main_~i~0 37)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26851#(<= main_~i~0 37)} is VALID [2022-04-28 02:49:53,320 INFO L290 TraceCheckUtils]: 81: Hoare triple {26851#(<= main_~i~0 37)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26852#(<= main_~i~0 38)} is VALID [2022-04-28 02:49:53,320 INFO L290 TraceCheckUtils]: 82: Hoare triple {26852#(<= main_~i~0 38)} assume !(~i~0 < 1024); {26810#false} is VALID [2022-04-28 02:49:53,320 INFO L290 TraceCheckUtils]: 83: Hoare triple {26810#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {26810#false} is VALID [2022-04-28 02:49:53,320 INFO L272 TraceCheckUtils]: 84: Hoare triple {26810#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {26810#false} is VALID [2022-04-28 02:49:53,320 INFO L290 TraceCheckUtils]: 85: Hoare triple {26810#false} ~cond := #in~cond; {26810#false} is VALID [2022-04-28 02:49:53,320 INFO L290 TraceCheckUtils]: 86: Hoare triple {26810#false} assume 0 == ~cond; {26810#false} is VALID [2022-04-28 02:49:53,320 INFO L290 TraceCheckUtils]: 87: Hoare triple {26810#false} assume !false; {26810#false} is VALID [2022-04-28 02:49:53,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:49:53,321 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:49:55,209 INFO L290 TraceCheckUtils]: 87: Hoare triple {26810#false} assume !false; {26810#false} is VALID [2022-04-28 02:49:55,209 INFO L290 TraceCheckUtils]: 86: Hoare triple {26810#false} assume 0 == ~cond; {26810#false} is VALID [2022-04-28 02:49:55,209 INFO L290 TraceCheckUtils]: 85: Hoare triple {26810#false} ~cond := #in~cond; {26810#false} is VALID [2022-04-28 02:49:55,209 INFO L272 TraceCheckUtils]: 84: Hoare triple {26810#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {26810#false} is VALID [2022-04-28 02:49:55,209 INFO L290 TraceCheckUtils]: 83: Hoare triple {26810#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {26810#false} is VALID [2022-04-28 02:49:55,209 INFO L290 TraceCheckUtils]: 82: Hoare triple {27134#(< main_~i~0 1024)} assume !(~i~0 < 1024); {26810#false} is VALID [2022-04-28 02:49:55,210 INFO L290 TraceCheckUtils]: 81: Hoare triple {27138#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27134#(< main_~i~0 1024)} is VALID [2022-04-28 02:49:55,210 INFO L290 TraceCheckUtils]: 80: Hoare triple {27138#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {27138#(< main_~i~0 1023)} is VALID [2022-04-28 02:49:55,210 INFO L290 TraceCheckUtils]: 79: Hoare triple {27145#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27138#(< main_~i~0 1023)} is VALID [2022-04-28 02:49:55,211 INFO L290 TraceCheckUtils]: 78: Hoare triple {27145#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {27145#(< main_~i~0 1022)} is VALID [2022-04-28 02:49:55,211 INFO L290 TraceCheckUtils]: 77: Hoare triple {27152#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27145#(< main_~i~0 1022)} is VALID [2022-04-28 02:49:55,211 INFO L290 TraceCheckUtils]: 76: Hoare triple {27152#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {27152#(< main_~i~0 1021)} is VALID [2022-04-28 02:49:55,212 INFO L290 TraceCheckUtils]: 75: Hoare triple {27159#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27152#(< main_~i~0 1021)} is VALID [2022-04-28 02:49:55,212 INFO L290 TraceCheckUtils]: 74: Hoare triple {27159#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {27159#(< main_~i~0 1020)} is VALID [2022-04-28 02:49:55,212 INFO L290 TraceCheckUtils]: 73: Hoare triple {27166#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27159#(< main_~i~0 1020)} is VALID [2022-04-28 02:49:55,213 INFO L290 TraceCheckUtils]: 72: Hoare triple {27166#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {27166#(< main_~i~0 1019)} is VALID [2022-04-28 02:49:55,213 INFO L290 TraceCheckUtils]: 71: Hoare triple {27173#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27166#(< main_~i~0 1019)} is VALID [2022-04-28 02:49:55,214 INFO L290 TraceCheckUtils]: 70: Hoare triple {27173#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {27173#(< main_~i~0 1018)} is VALID [2022-04-28 02:49:55,214 INFO L290 TraceCheckUtils]: 69: Hoare triple {27180#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27173#(< main_~i~0 1018)} is VALID [2022-04-28 02:49:55,214 INFO L290 TraceCheckUtils]: 68: Hoare triple {27180#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {27180#(< main_~i~0 1017)} is VALID [2022-04-28 02:49:55,215 INFO L290 TraceCheckUtils]: 67: Hoare triple {27187#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27180#(< main_~i~0 1017)} is VALID [2022-04-28 02:49:55,215 INFO L290 TraceCheckUtils]: 66: Hoare triple {27187#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {27187#(< main_~i~0 1016)} is VALID [2022-04-28 02:49:55,215 INFO L290 TraceCheckUtils]: 65: Hoare triple {27194#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27187#(< main_~i~0 1016)} is VALID [2022-04-28 02:49:55,216 INFO L290 TraceCheckUtils]: 64: Hoare triple {27194#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {27194#(< main_~i~0 1015)} is VALID [2022-04-28 02:49:55,216 INFO L290 TraceCheckUtils]: 63: Hoare triple {27201#(< main_~i~0 1014)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27194#(< main_~i~0 1015)} is VALID [2022-04-28 02:49:55,216 INFO L290 TraceCheckUtils]: 62: Hoare triple {27201#(< main_~i~0 1014)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {27201#(< main_~i~0 1014)} is VALID [2022-04-28 02:49:55,217 INFO L290 TraceCheckUtils]: 61: Hoare triple {27208#(< main_~i~0 1013)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27201#(< main_~i~0 1014)} is VALID [2022-04-28 02:49:55,217 INFO L290 TraceCheckUtils]: 60: Hoare triple {27208#(< main_~i~0 1013)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {27208#(< main_~i~0 1013)} is VALID [2022-04-28 02:49:55,217 INFO L290 TraceCheckUtils]: 59: Hoare triple {27215#(< main_~i~0 1012)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27208#(< main_~i~0 1013)} is VALID [2022-04-28 02:49:55,218 INFO L290 TraceCheckUtils]: 58: Hoare triple {27215#(< main_~i~0 1012)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {27215#(< main_~i~0 1012)} is VALID [2022-04-28 02:49:55,218 INFO L290 TraceCheckUtils]: 57: Hoare triple {27222#(< main_~i~0 1011)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27215#(< main_~i~0 1012)} is VALID [2022-04-28 02:49:55,218 INFO L290 TraceCheckUtils]: 56: Hoare triple {27222#(< main_~i~0 1011)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {27222#(< main_~i~0 1011)} is VALID [2022-04-28 02:49:55,219 INFO L290 TraceCheckUtils]: 55: Hoare triple {27229#(< main_~i~0 1010)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27222#(< main_~i~0 1011)} is VALID [2022-04-28 02:49:55,219 INFO L290 TraceCheckUtils]: 54: Hoare triple {27229#(< main_~i~0 1010)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {27229#(< main_~i~0 1010)} is VALID [2022-04-28 02:49:55,219 INFO L290 TraceCheckUtils]: 53: Hoare triple {27236#(< main_~i~0 1009)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27229#(< main_~i~0 1010)} is VALID [2022-04-28 02:49:55,219 INFO L290 TraceCheckUtils]: 52: Hoare triple {27236#(< main_~i~0 1009)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {27236#(< main_~i~0 1009)} is VALID [2022-04-28 02:49:55,220 INFO L290 TraceCheckUtils]: 51: Hoare triple {27243#(< main_~i~0 1008)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27236#(< main_~i~0 1009)} is VALID [2022-04-28 02:49:55,220 INFO L290 TraceCheckUtils]: 50: Hoare triple {27243#(< main_~i~0 1008)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {27243#(< main_~i~0 1008)} is VALID [2022-04-28 02:49:55,220 INFO L290 TraceCheckUtils]: 49: Hoare triple {27250#(< main_~i~0 1007)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27243#(< main_~i~0 1008)} is VALID [2022-04-28 02:49:55,221 INFO L290 TraceCheckUtils]: 48: Hoare triple {27250#(< main_~i~0 1007)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {27250#(< main_~i~0 1007)} is VALID [2022-04-28 02:49:55,221 INFO L290 TraceCheckUtils]: 47: Hoare triple {27257#(< main_~i~0 1006)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27250#(< main_~i~0 1007)} is VALID [2022-04-28 02:49:55,221 INFO L290 TraceCheckUtils]: 46: Hoare triple {27257#(< main_~i~0 1006)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {27257#(< main_~i~0 1006)} is VALID [2022-04-28 02:49:55,222 INFO L290 TraceCheckUtils]: 45: Hoare triple {27264#(< main_~i~0 1005)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27257#(< main_~i~0 1006)} is VALID [2022-04-28 02:49:55,222 INFO L290 TraceCheckUtils]: 44: Hoare triple {27264#(< main_~i~0 1005)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {27264#(< main_~i~0 1005)} is VALID [2022-04-28 02:49:55,222 INFO L290 TraceCheckUtils]: 43: Hoare triple {27271#(< main_~i~0 1004)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27264#(< main_~i~0 1005)} is VALID [2022-04-28 02:49:55,223 INFO L290 TraceCheckUtils]: 42: Hoare triple {27271#(< main_~i~0 1004)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {27271#(< main_~i~0 1004)} is VALID [2022-04-28 02:49:55,223 INFO L290 TraceCheckUtils]: 41: Hoare triple {27278#(< main_~i~0 1003)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27271#(< main_~i~0 1004)} is VALID [2022-04-28 02:49:55,223 INFO L290 TraceCheckUtils]: 40: Hoare triple {27278#(< main_~i~0 1003)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {27278#(< main_~i~0 1003)} is VALID [2022-04-28 02:49:55,224 INFO L290 TraceCheckUtils]: 39: Hoare triple {27285#(< main_~i~0 1002)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27278#(< main_~i~0 1003)} is VALID [2022-04-28 02:49:55,224 INFO L290 TraceCheckUtils]: 38: Hoare triple {27285#(< main_~i~0 1002)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {27285#(< main_~i~0 1002)} is VALID [2022-04-28 02:49:55,224 INFO L290 TraceCheckUtils]: 37: Hoare triple {27292#(< main_~i~0 1001)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27285#(< main_~i~0 1002)} is VALID [2022-04-28 02:49:55,224 INFO L290 TraceCheckUtils]: 36: Hoare triple {27292#(< main_~i~0 1001)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {27292#(< main_~i~0 1001)} is VALID [2022-04-28 02:49:55,225 INFO L290 TraceCheckUtils]: 35: Hoare triple {27299#(< main_~i~0 1000)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27292#(< main_~i~0 1001)} is VALID [2022-04-28 02:49:55,225 INFO L290 TraceCheckUtils]: 34: Hoare triple {27299#(< main_~i~0 1000)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {27299#(< main_~i~0 1000)} is VALID [2022-04-28 02:49:55,225 INFO L290 TraceCheckUtils]: 33: Hoare triple {27306#(< main_~i~0 999)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27299#(< main_~i~0 1000)} is VALID [2022-04-28 02:49:55,226 INFO L290 TraceCheckUtils]: 32: Hoare triple {27306#(< main_~i~0 999)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {27306#(< main_~i~0 999)} is VALID [2022-04-28 02:49:55,226 INFO L290 TraceCheckUtils]: 31: Hoare triple {27313#(< main_~i~0 998)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27306#(< main_~i~0 999)} is VALID [2022-04-28 02:49:55,226 INFO L290 TraceCheckUtils]: 30: Hoare triple {27313#(< main_~i~0 998)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {27313#(< main_~i~0 998)} is VALID [2022-04-28 02:49:55,227 INFO L290 TraceCheckUtils]: 29: Hoare triple {27320#(< main_~i~0 997)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27313#(< main_~i~0 998)} is VALID [2022-04-28 02:49:55,227 INFO L290 TraceCheckUtils]: 28: Hoare triple {27320#(< main_~i~0 997)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {27320#(< main_~i~0 997)} is VALID [2022-04-28 02:49:55,227 INFO L290 TraceCheckUtils]: 27: Hoare triple {27327#(< main_~i~0 996)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27320#(< main_~i~0 997)} is VALID [2022-04-28 02:49:55,227 INFO L290 TraceCheckUtils]: 26: Hoare triple {27327#(< main_~i~0 996)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {27327#(< main_~i~0 996)} is VALID [2022-04-28 02:49:55,228 INFO L290 TraceCheckUtils]: 25: Hoare triple {27334#(< main_~i~0 995)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27327#(< main_~i~0 996)} is VALID [2022-04-28 02:49:55,228 INFO L290 TraceCheckUtils]: 24: Hoare triple {27334#(< main_~i~0 995)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {27334#(< main_~i~0 995)} is VALID [2022-04-28 02:49:55,228 INFO L290 TraceCheckUtils]: 23: Hoare triple {27341#(< main_~i~0 994)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27334#(< main_~i~0 995)} is VALID [2022-04-28 02:49:55,229 INFO L290 TraceCheckUtils]: 22: Hoare triple {27341#(< main_~i~0 994)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {27341#(< main_~i~0 994)} is VALID [2022-04-28 02:49:55,229 INFO L290 TraceCheckUtils]: 21: Hoare triple {27348#(< main_~i~0 993)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27341#(< main_~i~0 994)} is VALID [2022-04-28 02:49:55,229 INFO L290 TraceCheckUtils]: 20: Hoare triple {27348#(< main_~i~0 993)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {27348#(< main_~i~0 993)} is VALID [2022-04-28 02:49:55,230 INFO L290 TraceCheckUtils]: 19: Hoare triple {27355#(< main_~i~0 992)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27348#(< main_~i~0 993)} is VALID [2022-04-28 02:49:55,230 INFO L290 TraceCheckUtils]: 18: Hoare triple {27355#(< main_~i~0 992)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {27355#(< main_~i~0 992)} is VALID [2022-04-28 02:49:55,230 INFO L290 TraceCheckUtils]: 17: Hoare triple {27362#(< main_~i~0 991)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27355#(< main_~i~0 992)} is VALID [2022-04-28 02:49:55,231 INFO L290 TraceCheckUtils]: 16: Hoare triple {27362#(< main_~i~0 991)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {27362#(< main_~i~0 991)} is VALID [2022-04-28 02:49:55,231 INFO L290 TraceCheckUtils]: 15: Hoare triple {27369#(< main_~i~0 990)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27362#(< main_~i~0 991)} is VALID [2022-04-28 02:49:55,231 INFO L290 TraceCheckUtils]: 14: Hoare triple {27369#(< main_~i~0 990)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {27369#(< main_~i~0 990)} is VALID [2022-04-28 02:49:55,232 INFO L290 TraceCheckUtils]: 13: Hoare triple {27376#(< main_~i~0 989)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27369#(< main_~i~0 990)} is VALID [2022-04-28 02:49:55,232 INFO L290 TraceCheckUtils]: 12: Hoare triple {27376#(< main_~i~0 989)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {27376#(< main_~i~0 989)} is VALID [2022-04-28 02:49:55,232 INFO L290 TraceCheckUtils]: 11: Hoare triple {27383#(< main_~i~0 988)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27376#(< main_~i~0 989)} is VALID [2022-04-28 02:49:55,232 INFO L290 TraceCheckUtils]: 10: Hoare triple {27383#(< main_~i~0 988)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {27383#(< main_~i~0 988)} is VALID [2022-04-28 02:49:55,233 INFO L290 TraceCheckUtils]: 9: Hoare triple {27390#(< main_~i~0 987)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27383#(< main_~i~0 988)} is VALID [2022-04-28 02:49:55,233 INFO L290 TraceCheckUtils]: 8: Hoare triple {27390#(< main_~i~0 987)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {27390#(< main_~i~0 987)} is VALID [2022-04-28 02:49:55,233 INFO L290 TraceCheckUtils]: 7: Hoare triple {27397#(< main_~i~0 986)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27390#(< main_~i~0 987)} is VALID [2022-04-28 02:49:55,234 INFO L290 TraceCheckUtils]: 6: Hoare triple {27397#(< main_~i~0 986)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {27397#(< main_~i~0 986)} is VALID [2022-04-28 02:49:55,234 INFO L290 TraceCheckUtils]: 5: Hoare triple {26809#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {27397#(< main_~i~0 986)} is VALID [2022-04-28 02:49:55,234 INFO L272 TraceCheckUtils]: 4: Hoare triple {26809#true} call #t~ret6 := main(); {26809#true} is VALID [2022-04-28 02:49:55,234 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26809#true} {26809#true} #39#return; {26809#true} is VALID [2022-04-28 02:49:55,234 INFO L290 TraceCheckUtils]: 2: Hoare triple {26809#true} assume true; {26809#true} is VALID [2022-04-28 02:49:55,234 INFO L290 TraceCheckUtils]: 1: Hoare triple {26809#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {26809#true} is VALID [2022-04-28 02:49:55,234 INFO L272 TraceCheckUtils]: 0: Hoare triple {26809#true} call ULTIMATE.init(); {26809#true} is VALID [2022-04-28 02:49:55,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:49:55,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1900861021] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:49:55,235 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:49:55,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 41, 41] total 82 [2022-04-28 02:49:55,235 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:49:55,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1557409643] [2022-04-28 02:49:55,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1557409643] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:49:55,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:49:55,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2022-04-28 02:49:55,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614410933] [2022-04-28 02:49:55,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:49:55,236 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.0) internal successors, (84), 41 states have internal predecessors, (84), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 88 [2022-04-28 02:49:55,236 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:49:55,236 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 42 states, 42 states have (on average 2.0) internal successors, (84), 41 states have internal predecessors, (84), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:49:55,294 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:49:55,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-04-28 02:49:55,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:49:55,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-04-28 02:49:55,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3242, Invalid=3400, Unknown=0, NotChecked=0, Total=6642 [2022-04-28 02:49:55,296 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand has 42 states, 42 states have (on average 2.0) internal successors, (84), 41 states have internal predecessors, (84), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:49:56,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:49:56,515 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2022-04-28 02:49:56,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-04-28 02:49:56,515 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.0) internal successors, (84), 41 states have internal predecessors, (84), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 88 [2022-04-28 02:49:56,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:49:56,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 2.0) internal successors, (84), 41 states have internal predecessors, (84), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:49:56,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 98 transitions. [2022-04-28 02:49:56,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 2.0) internal successors, (84), 41 states have internal predecessors, (84), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:49:56,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 98 transitions. [2022-04-28 02:49:56,516 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 98 transitions. [2022-04-28 02:49:56,585 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:49:56,586 INFO L225 Difference]: With dead ends: 98 [2022-04-28 02:49:56,586 INFO L226 Difference]: Without dead ends: 92 [2022-04-28 02:49:56,587 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 968 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=6402, Invalid=8118, Unknown=0, NotChecked=0, Total=14520 [2022-04-28 02:49:56,588 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 86 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:49:56,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 44 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:49:56,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-04-28 02:49:56,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2022-04-28 02:49:56,919 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:49:56,919 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand has 91 states, 86 states have (on average 1.0116279069767442) internal successors, (87), 86 states have internal predecessors, (87), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:49:56,919 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand has 91 states, 86 states have (on average 1.0116279069767442) internal successors, (87), 86 states have internal predecessors, (87), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:49:56,919 INFO L87 Difference]: Start difference. First operand 92 states. Second operand has 91 states, 86 states have (on average 1.0116279069767442) internal successors, (87), 86 states have internal predecessors, (87), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:49:56,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:49:56,920 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2022-04-28 02:49:56,920 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2022-04-28 02:49:56,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:49:56,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:49:56,921 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 86 states have (on average 1.0116279069767442) internal successors, (87), 86 states have internal predecessors, (87), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 92 states. [2022-04-28 02:49:56,921 INFO L87 Difference]: Start difference. First operand has 91 states, 86 states have (on average 1.0116279069767442) internal successors, (87), 86 states have internal predecessors, (87), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 92 states. [2022-04-28 02:49:56,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:49:56,922 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2022-04-28 02:49:56,922 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2022-04-28 02:49:56,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:49:56,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:49:56,922 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:49:56,922 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:49:56,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 86 states have (on average 1.0116279069767442) internal successors, (87), 86 states have internal predecessors, (87), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:49:56,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2022-04-28 02:49:56,923 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 88 [2022-04-28 02:49:56,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:49:56,924 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2022-04-28 02:49:56,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.0) internal successors, (84), 41 states have internal predecessors, (84), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:49:56,924 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 91 transitions. [2022-04-28 02:49:57,025 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:49:57,025 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2022-04-28 02:49:57,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-04-28 02:49:57,025 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:49:57,025 INFO L195 NwaCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:49:57,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-04-28 02:49:57,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-04-28 02:49:57,226 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:49:57,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:49:57,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1818146744, now seen corresponding path program 77 times [2022-04-28 02:49:57,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:49:57,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [557514212] [2022-04-28 02:49:57,229 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:49:57,229 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:49:57,229 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:49:57,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1818146744, now seen corresponding path program 78 times [2022-04-28 02:49:57,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:49:57,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55846158] [2022-04-28 02:49:57,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:49:57,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:49:57,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:49:57,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:49:57,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:49:57,900 INFO L290 TraceCheckUtils]: 0: Hoare triple {28106#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {28061#true} is VALID [2022-04-28 02:49:57,900 INFO L290 TraceCheckUtils]: 1: Hoare triple {28061#true} assume true; {28061#true} is VALID [2022-04-28 02:49:57,900 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28061#true} {28061#true} #39#return; {28061#true} is VALID [2022-04-28 02:49:57,901 INFO L272 TraceCheckUtils]: 0: Hoare triple {28061#true} call ULTIMATE.init(); {28106#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:49:57,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {28106#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {28061#true} is VALID [2022-04-28 02:49:57,901 INFO L290 TraceCheckUtils]: 2: Hoare triple {28061#true} assume true; {28061#true} is VALID [2022-04-28 02:49:57,901 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28061#true} {28061#true} #39#return; {28061#true} is VALID [2022-04-28 02:49:57,901 INFO L272 TraceCheckUtils]: 4: Hoare triple {28061#true} call #t~ret6 := main(); {28061#true} is VALID [2022-04-28 02:49:57,901 INFO L290 TraceCheckUtils]: 5: Hoare triple {28061#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {28066#(= main_~i~0 0)} is VALID [2022-04-28 02:49:57,902 INFO L290 TraceCheckUtils]: 6: Hoare triple {28066#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28066#(= main_~i~0 0)} is VALID [2022-04-28 02:49:57,902 INFO L290 TraceCheckUtils]: 7: Hoare triple {28066#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28067#(<= main_~i~0 1)} is VALID [2022-04-28 02:49:57,902 INFO L290 TraceCheckUtils]: 8: Hoare triple {28067#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28067#(<= main_~i~0 1)} is VALID [2022-04-28 02:49:57,903 INFO L290 TraceCheckUtils]: 9: Hoare triple {28067#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28068#(<= main_~i~0 2)} is VALID [2022-04-28 02:49:57,903 INFO L290 TraceCheckUtils]: 10: Hoare triple {28068#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28068#(<= main_~i~0 2)} is VALID [2022-04-28 02:49:57,904 INFO L290 TraceCheckUtils]: 11: Hoare triple {28068#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28069#(<= main_~i~0 3)} is VALID [2022-04-28 02:49:57,904 INFO L290 TraceCheckUtils]: 12: Hoare triple {28069#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28069#(<= main_~i~0 3)} is VALID [2022-04-28 02:49:57,904 INFO L290 TraceCheckUtils]: 13: Hoare triple {28069#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28070#(<= main_~i~0 4)} is VALID [2022-04-28 02:49:57,905 INFO L290 TraceCheckUtils]: 14: Hoare triple {28070#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28070#(<= main_~i~0 4)} is VALID [2022-04-28 02:49:57,905 INFO L290 TraceCheckUtils]: 15: Hoare triple {28070#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28071#(<= main_~i~0 5)} is VALID [2022-04-28 02:49:57,906 INFO L290 TraceCheckUtils]: 16: Hoare triple {28071#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28071#(<= main_~i~0 5)} is VALID [2022-04-28 02:49:57,906 INFO L290 TraceCheckUtils]: 17: Hoare triple {28071#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28072#(<= main_~i~0 6)} is VALID [2022-04-28 02:49:57,906 INFO L290 TraceCheckUtils]: 18: Hoare triple {28072#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28072#(<= main_~i~0 6)} is VALID [2022-04-28 02:49:57,907 INFO L290 TraceCheckUtils]: 19: Hoare triple {28072#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28073#(<= main_~i~0 7)} is VALID [2022-04-28 02:49:57,907 INFO L290 TraceCheckUtils]: 20: Hoare triple {28073#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28073#(<= main_~i~0 7)} is VALID [2022-04-28 02:49:57,908 INFO L290 TraceCheckUtils]: 21: Hoare triple {28073#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28074#(<= main_~i~0 8)} is VALID [2022-04-28 02:49:57,908 INFO L290 TraceCheckUtils]: 22: Hoare triple {28074#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28074#(<= main_~i~0 8)} is VALID [2022-04-28 02:49:57,908 INFO L290 TraceCheckUtils]: 23: Hoare triple {28074#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28075#(<= main_~i~0 9)} is VALID [2022-04-28 02:49:57,909 INFO L290 TraceCheckUtils]: 24: Hoare triple {28075#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28075#(<= main_~i~0 9)} is VALID [2022-04-28 02:49:57,909 INFO L290 TraceCheckUtils]: 25: Hoare triple {28075#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28076#(<= main_~i~0 10)} is VALID [2022-04-28 02:49:57,909 INFO L290 TraceCheckUtils]: 26: Hoare triple {28076#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28076#(<= main_~i~0 10)} is VALID [2022-04-28 02:49:57,910 INFO L290 TraceCheckUtils]: 27: Hoare triple {28076#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28077#(<= main_~i~0 11)} is VALID [2022-04-28 02:49:57,910 INFO L290 TraceCheckUtils]: 28: Hoare triple {28077#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28077#(<= main_~i~0 11)} is VALID [2022-04-28 02:49:57,911 INFO L290 TraceCheckUtils]: 29: Hoare triple {28077#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28078#(<= main_~i~0 12)} is VALID [2022-04-28 02:49:57,911 INFO L290 TraceCheckUtils]: 30: Hoare triple {28078#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28078#(<= main_~i~0 12)} is VALID [2022-04-28 02:49:57,911 INFO L290 TraceCheckUtils]: 31: Hoare triple {28078#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28079#(<= main_~i~0 13)} is VALID [2022-04-28 02:49:57,912 INFO L290 TraceCheckUtils]: 32: Hoare triple {28079#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28079#(<= main_~i~0 13)} is VALID [2022-04-28 02:49:57,912 INFO L290 TraceCheckUtils]: 33: Hoare triple {28079#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28080#(<= main_~i~0 14)} is VALID [2022-04-28 02:49:57,912 INFO L290 TraceCheckUtils]: 34: Hoare triple {28080#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28080#(<= main_~i~0 14)} is VALID [2022-04-28 02:49:57,913 INFO L290 TraceCheckUtils]: 35: Hoare triple {28080#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28081#(<= main_~i~0 15)} is VALID [2022-04-28 02:49:57,913 INFO L290 TraceCheckUtils]: 36: Hoare triple {28081#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28081#(<= main_~i~0 15)} is VALID [2022-04-28 02:49:57,914 INFO L290 TraceCheckUtils]: 37: Hoare triple {28081#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28082#(<= main_~i~0 16)} is VALID [2022-04-28 02:49:57,914 INFO L290 TraceCheckUtils]: 38: Hoare triple {28082#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28082#(<= main_~i~0 16)} is VALID [2022-04-28 02:49:57,914 INFO L290 TraceCheckUtils]: 39: Hoare triple {28082#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28083#(<= main_~i~0 17)} is VALID [2022-04-28 02:49:57,915 INFO L290 TraceCheckUtils]: 40: Hoare triple {28083#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28083#(<= main_~i~0 17)} is VALID [2022-04-28 02:49:57,915 INFO L290 TraceCheckUtils]: 41: Hoare triple {28083#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28084#(<= main_~i~0 18)} is VALID [2022-04-28 02:49:57,916 INFO L290 TraceCheckUtils]: 42: Hoare triple {28084#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28084#(<= main_~i~0 18)} is VALID [2022-04-28 02:49:57,916 INFO L290 TraceCheckUtils]: 43: Hoare triple {28084#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28085#(<= main_~i~0 19)} is VALID [2022-04-28 02:49:57,916 INFO L290 TraceCheckUtils]: 44: Hoare triple {28085#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28085#(<= main_~i~0 19)} is VALID [2022-04-28 02:49:57,917 INFO L290 TraceCheckUtils]: 45: Hoare triple {28085#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28086#(<= main_~i~0 20)} is VALID [2022-04-28 02:49:57,917 INFO L290 TraceCheckUtils]: 46: Hoare triple {28086#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28086#(<= main_~i~0 20)} is VALID [2022-04-28 02:49:57,918 INFO L290 TraceCheckUtils]: 47: Hoare triple {28086#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28087#(<= main_~i~0 21)} is VALID [2022-04-28 02:49:57,918 INFO L290 TraceCheckUtils]: 48: Hoare triple {28087#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28087#(<= main_~i~0 21)} is VALID [2022-04-28 02:49:57,918 INFO L290 TraceCheckUtils]: 49: Hoare triple {28087#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28088#(<= main_~i~0 22)} is VALID [2022-04-28 02:49:57,919 INFO L290 TraceCheckUtils]: 50: Hoare triple {28088#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28088#(<= main_~i~0 22)} is VALID [2022-04-28 02:49:57,919 INFO L290 TraceCheckUtils]: 51: Hoare triple {28088#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28089#(<= main_~i~0 23)} is VALID [2022-04-28 02:49:57,919 INFO L290 TraceCheckUtils]: 52: Hoare triple {28089#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28089#(<= main_~i~0 23)} is VALID [2022-04-28 02:49:57,920 INFO L290 TraceCheckUtils]: 53: Hoare triple {28089#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28090#(<= main_~i~0 24)} is VALID [2022-04-28 02:49:57,920 INFO L290 TraceCheckUtils]: 54: Hoare triple {28090#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28090#(<= main_~i~0 24)} is VALID [2022-04-28 02:49:57,920 INFO L290 TraceCheckUtils]: 55: Hoare triple {28090#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28091#(<= main_~i~0 25)} is VALID [2022-04-28 02:49:57,921 INFO L290 TraceCheckUtils]: 56: Hoare triple {28091#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28091#(<= main_~i~0 25)} is VALID [2022-04-28 02:49:57,921 INFO L290 TraceCheckUtils]: 57: Hoare triple {28091#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28092#(<= main_~i~0 26)} is VALID [2022-04-28 02:49:57,921 INFO L290 TraceCheckUtils]: 58: Hoare triple {28092#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28092#(<= main_~i~0 26)} is VALID [2022-04-28 02:49:57,922 INFO L290 TraceCheckUtils]: 59: Hoare triple {28092#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28093#(<= main_~i~0 27)} is VALID [2022-04-28 02:49:57,922 INFO L290 TraceCheckUtils]: 60: Hoare triple {28093#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28093#(<= main_~i~0 27)} is VALID [2022-04-28 02:49:57,922 INFO L290 TraceCheckUtils]: 61: Hoare triple {28093#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28094#(<= main_~i~0 28)} is VALID [2022-04-28 02:49:57,923 INFO L290 TraceCheckUtils]: 62: Hoare triple {28094#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28094#(<= main_~i~0 28)} is VALID [2022-04-28 02:49:57,923 INFO L290 TraceCheckUtils]: 63: Hoare triple {28094#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28095#(<= main_~i~0 29)} is VALID [2022-04-28 02:49:57,923 INFO L290 TraceCheckUtils]: 64: Hoare triple {28095#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28095#(<= main_~i~0 29)} is VALID [2022-04-28 02:49:57,924 INFO L290 TraceCheckUtils]: 65: Hoare triple {28095#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28096#(<= main_~i~0 30)} is VALID [2022-04-28 02:49:57,924 INFO L290 TraceCheckUtils]: 66: Hoare triple {28096#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28096#(<= main_~i~0 30)} is VALID [2022-04-28 02:49:57,924 INFO L290 TraceCheckUtils]: 67: Hoare triple {28096#(<= main_~i~0 30)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28097#(<= main_~i~0 31)} is VALID [2022-04-28 02:49:57,924 INFO L290 TraceCheckUtils]: 68: Hoare triple {28097#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28097#(<= main_~i~0 31)} is VALID [2022-04-28 02:49:57,925 INFO L290 TraceCheckUtils]: 69: Hoare triple {28097#(<= main_~i~0 31)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28098#(<= main_~i~0 32)} is VALID [2022-04-28 02:49:57,925 INFO L290 TraceCheckUtils]: 70: Hoare triple {28098#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28098#(<= main_~i~0 32)} is VALID [2022-04-28 02:49:57,925 INFO L290 TraceCheckUtils]: 71: Hoare triple {28098#(<= main_~i~0 32)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28099#(<= main_~i~0 33)} is VALID [2022-04-28 02:49:57,926 INFO L290 TraceCheckUtils]: 72: Hoare triple {28099#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28099#(<= main_~i~0 33)} is VALID [2022-04-28 02:49:57,926 INFO L290 TraceCheckUtils]: 73: Hoare triple {28099#(<= main_~i~0 33)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28100#(<= main_~i~0 34)} is VALID [2022-04-28 02:49:57,926 INFO L290 TraceCheckUtils]: 74: Hoare triple {28100#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28100#(<= main_~i~0 34)} is VALID [2022-04-28 02:49:57,927 INFO L290 TraceCheckUtils]: 75: Hoare triple {28100#(<= main_~i~0 34)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28101#(<= main_~i~0 35)} is VALID [2022-04-28 02:49:57,927 INFO L290 TraceCheckUtils]: 76: Hoare triple {28101#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28101#(<= main_~i~0 35)} is VALID [2022-04-28 02:49:57,927 INFO L290 TraceCheckUtils]: 77: Hoare triple {28101#(<= main_~i~0 35)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28102#(<= main_~i~0 36)} is VALID [2022-04-28 02:49:57,927 INFO L290 TraceCheckUtils]: 78: Hoare triple {28102#(<= main_~i~0 36)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28102#(<= main_~i~0 36)} is VALID [2022-04-28 02:49:57,928 INFO L290 TraceCheckUtils]: 79: Hoare triple {28102#(<= main_~i~0 36)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28103#(<= main_~i~0 37)} is VALID [2022-04-28 02:49:57,928 INFO L290 TraceCheckUtils]: 80: Hoare triple {28103#(<= main_~i~0 37)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28103#(<= main_~i~0 37)} is VALID [2022-04-28 02:49:57,928 INFO L290 TraceCheckUtils]: 81: Hoare triple {28103#(<= main_~i~0 37)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28104#(<= main_~i~0 38)} is VALID [2022-04-28 02:49:57,929 INFO L290 TraceCheckUtils]: 82: Hoare triple {28104#(<= main_~i~0 38)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28104#(<= main_~i~0 38)} is VALID [2022-04-28 02:49:57,929 INFO L290 TraceCheckUtils]: 83: Hoare triple {28104#(<= main_~i~0 38)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28105#(<= main_~i~0 39)} is VALID [2022-04-28 02:49:57,929 INFO L290 TraceCheckUtils]: 84: Hoare triple {28105#(<= main_~i~0 39)} assume !(~i~0 < 1024); {28062#false} is VALID [2022-04-28 02:49:57,929 INFO L290 TraceCheckUtils]: 85: Hoare triple {28062#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {28062#false} is VALID [2022-04-28 02:49:57,929 INFO L272 TraceCheckUtils]: 86: Hoare triple {28062#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {28062#false} is VALID [2022-04-28 02:49:57,930 INFO L290 TraceCheckUtils]: 87: Hoare triple {28062#false} ~cond := #in~cond; {28062#false} is VALID [2022-04-28 02:49:57,930 INFO L290 TraceCheckUtils]: 88: Hoare triple {28062#false} assume 0 == ~cond; {28062#false} is VALID [2022-04-28 02:49:57,930 INFO L290 TraceCheckUtils]: 89: Hoare triple {28062#false} assume !false; {28062#false} is VALID [2022-04-28 02:49:57,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:49:57,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:49:57,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55846158] [2022-04-28 02:49:57,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55846158] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:49:57,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [275968657] [2022-04-28 02:49:57,930 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 02:49:57,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:49:57,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:49:57,931 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:49:57,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-04-28 02:50:14,567 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 40 check-sat command(s) [2022-04-28 02:50:14,567 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:50:14,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-28 02:50:14,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:50:14,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:50:15,116 INFO L272 TraceCheckUtils]: 0: Hoare triple {28061#true} call ULTIMATE.init(); {28061#true} is VALID [2022-04-28 02:50:15,116 INFO L290 TraceCheckUtils]: 1: Hoare triple {28061#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {28061#true} is VALID [2022-04-28 02:50:15,116 INFO L290 TraceCheckUtils]: 2: Hoare triple {28061#true} assume true; {28061#true} is VALID [2022-04-28 02:50:15,117 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28061#true} {28061#true} #39#return; {28061#true} is VALID [2022-04-28 02:50:15,117 INFO L272 TraceCheckUtils]: 4: Hoare triple {28061#true} call #t~ret6 := main(); {28061#true} is VALID [2022-04-28 02:50:15,122 INFO L290 TraceCheckUtils]: 5: Hoare triple {28061#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {28125#(<= main_~i~0 0)} is VALID [2022-04-28 02:50:15,122 INFO L290 TraceCheckUtils]: 6: Hoare triple {28125#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28125#(<= main_~i~0 0)} is VALID [2022-04-28 02:50:15,122 INFO L290 TraceCheckUtils]: 7: Hoare triple {28125#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28067#(<= main_~i~0 1)} is VALID [2022-04-28 02:50:15,123 INFO L290 TraceCheckUtils]: 8: Hoare triple {28067#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28067#(<= main_~i~0 1)} is VALID [2022-04-28 02:50:15,123 INFO L290 TraceCheckUtils]: 9: Hoare triple {28067#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28068#(<= main_~i~0 2)} is VALID [2022-04-28 02:50:15,123 INFO L290 TraceCheckUtils]: 10: Hoare triple {28068#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28068#(<= main_~i~0 2)} is VALID [2022-04-28 02:50:15,124 INFO L290 TraceCheckUtils]: 11: Hoare triple {28068#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28069#(<= main_~i~0 3)} is VALID [2022-04-28 02:50:15,124 INFO L290 TraceCheckUtils]: 12: Hoare triple {28069#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28069#(<= main_~i~0 3)} is VALID [2022-04-28 02:50:15,124 INFO L290 TraceCheckUtils]: 13: Hoare triple {28069#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28070#(<= main_~i~0 4)} is VALID [2022-04-28 02:50:15,124 INFO L290 TraceCheckUtils]: 14: Hoare triple {28070#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28070#(<= main_~i~0 4)} is VALID [2022-04-28 02:50:15,125 INFO L290 TraceCheckUtils]: 15: Hoare triple {28070#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28071#(<= main_~i~0 5)} is VALID [2022-04-28 02:50:15,125 INFO L290 TraceCheckUtils]: 16: Hoare triple {28071#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28071#(<= main_~i~0 5)} is VALID [2022-04-28 02:50:15,125 INFO L290 TraceCheckUtils]: 17: Hoare triple {28071#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28072#(<= main_~i~0 6)} is VALID [2022-04-28 02:50:15,126 INFO L290 TraceCheckUtils]: 18: Hoare triple {28072#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28072#(<= main_~i~0 6)} is VALID [2022-04-28 02:50:15,126 INFO L290 TraceCheckUtils]: 19: Hoare triple {28072#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28073#(<= main_~i~0 7)} is VALID [2022-04-28 02:50:15,126 INFO L290 TraceCheckUtils]: 20: Hoare triple {28073#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28073#(<= main_~i~0 7)} is VALID [2022-04-28 02:50:15,127 INFO L290 TraceCheckUtils]: 21: Hoare triple {28073#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28074#(<= main_~i~0 8)} is VALID [2022-04-28 02:50:15,127 INFO L290 TraceCheckUtils]: 22: Hoare triple {28074#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28074#(<= main_~i~0 8)} is VALID [2022-04-28 02:50:15,127 INFO L290 TraceCheckUtils]: 23: Hoare triple {28074#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28075#(<= main_~i~0 9)} is VALID [2022-04-28 02:50:15,128 INFO L290 TraceCheckUtils]: 24: Hoare triple {28075#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28075#(<= main_~i~0 9)} is VALID [2022-04-28 02:50:15,128 INFO L290 TraceCheckUtils]: 25: Hoare triple {28075#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28076#(<= main_~i~0 10)} is VALID [2022-04-28 02:50:15,128 INFO L290 TraceCheckUtils]: 26: Hoare triple {28076#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28076#(<= main_~i~0 10)} is VALID [2022-04-28 02:50:15,128 INFO L290 TraceCheckUtils]: 27: Hoare triple {28076#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28077#(<= main_~i~0 11)} is VALID [2022-04-28 02:50:15,129 INFO L290 TraceCheckUtils]: 28: Hoare triple {28077#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28077#(<= main_~i~0 11)} is VALID [2022-04-28 02:50:15,129 INFO L290 TraceCheckUtils]: 29: Hoare triple {28077#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28078#(<= main_~i~0 12)} is VALID [2022-04-28 02:50:15,129 INFO L290 TraceCheckUtils]: 30: Hoare triple {28078#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28078#(<= main_~i~0 12)} is VALID [2022-04-28 02:50:15,130 INFO L290 TraceCheckUtils]: 31: Hoare triple {28078#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28079#(<= main_~i~0 13)} is VALID [2022-04-28 02:50:15,130 INFO L290 TraceCheckUtils]: 32: Hoare triple {28079#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28079#(<= main_~i~0 13)} is VALID [2022-04-28 02:50:15,130 INFO L290 TraceCheckUtils]: 33: Hoare triple {28079#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28080#(<= main_~i~0 14)} is VALID [2022-04-28 02:50:15,131 INFO L290 TraceCheckUtils]: 34: Hoare triple {28080#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28080#(<= main_~i~0 14)} is VALID [2022-04-28 02:50:15,131 INFO L290 TraceCheckUtils]: 35: Hoare triple {28080#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28081#(<= main_~i~0 15)} is VALID [2022-04-28 02:50:15,131 INFO L290 TraceCheckUtils]: 36: Hoare triple {28081#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28081#(<= main_~i~0 15)} is VALID [2022-04-28 02:50:15,132 INFO L290 TraceCheckUtils]: 37: Hoare triple {28081#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28082#(<= main_~i~0 16)} is VALID [2022-04-28 02:50:15,132 INFO L290 TraceCheckUtils]: 38: Hoare triple {28082#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28082#(<= main_~i~0 16)} is VALID [2022-04-28 02:50:15,132 INFO L290 TraceCheckUtils]: 39: Hoare triple {28082#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28083#(<= main_~i~0 17)} is VALID [2022-04-28 02:50:15,132 INFO L290 TraceCheckUtils]: 40: Hoare triple {28083#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28083#(<= main_~i~0 17)} is VALID [2022-04-28 02:50:15,133 INFO L290 TraceCheckUtils]: 41: Hoare triple {28083#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28084#(<= main_~i~0 18)} is VALID [2022-04-28 02:50:15,133 INFO L290 TraceCheckUtils]: 42: Hoare triple {28084#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28084#(<= main_~i~0 18)} is VALID [2022-04-28 02:50:15,133 INFO L290 TraceCheckUtils]: 43: Hoare triple {28084#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28085#(<= main_~i~0 19)} is VALID [2022-04-28 02:50:15,134 INFO L290 TraceCheckUtils]: 44: Hoare triple {28085#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28085#(<= main_~i~0 19)} is VALID [2022-04-28 02:50:15,134 INFO L290 TraceCheckUtils]: 45: Hoare triple {28085#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28086#(<= main_~i~0 20)} is VALID [2022-04-28 02:50:15,134 INFO L290 TraceCheckUtils]: 46: Hoare triple {28086#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28086#(<= main_~i~0 20)} is VALID [2022-04-28 02:50:15,135 INFO L290 TraceCheckUtils]: 47: Hoare triple {28086#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28087#(<= main_~i~0 21)} is VALID [2022-04-28 02:50:15,135 INFO L290 TraceCheckUtils]: 48: Hoare triple {28087#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28087#(<= main_~i~0 21)} is VALID [2022-04-28 02:50:15,135 INFO L290 TraceCheckUtils]: 49: Hoare triple {28087#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28088#(<= main_~i~0 22)} is VALID [2022-04-28 02:50:15,136 INFO L290 TraceCheckUtils]: 50: Hoare triple {28088#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28088#(<= main_~i~0 22)} is VALID [2022-04-28 02:50:15,136 INFO L290 TraceCheckUtils]: 51: Hoare triple {28088#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28089#(<= main_~i~0 23)} is VALID [2022-04-28 02:50:15,136 INFO L290 TraceCheckUtils]: 52: Hoare triple {28089#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28089#(<= main_~i~0 23)} is VALID [2022-04-28 02:50:15,136 INFO L290 TraceCheckUtils]: 53: Hoare triple {28089#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28090#(<= main_~i~0 24)} is VALID [2022-04-28 02:50:15,137 INFO L290 TraceCheckUtils]: 54: Hoare triple {28090#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28090#(<= main_~i~0 24)} is VALID [2022-04-28 02:50:15,137 INFO L290 TraceCheckUtils]: 55: Hoare triple {28090#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28091#(<= main_~i~0 25)} is VALID [2022-04-28 02:50:15,137 INFO L290 TraceCheckUtils]: 56: Hoare triple {28091#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28091#(<= main_~i~0 25)} is VALID [2022-04-28 02:50:15,138 INFO L290 TraceCheckUtils]: 57: Hoare triple {28091#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28092#(<= main_~i~0 26)} is VALID [2022-04-28 02:50:15,138 INFO L290 TraceCheckUtils]: 58: Hoare triple {28092#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28092#(<= main_~i~0 26)} is VALID [2022-04-28 02:50:15,138 INFO L290 TraceCheckUtils]: 59: Hoare triple {28092#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28093#(<= main_~i~0 27)} is VALID [2022-04-28 02:50:15,139 INFO L290 TraceCheckUtils]: 60: Hoare triple {28093#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28093#(<= main_~i~0 27)} is VALID [2022-04-28 02:50:15,139 INFO L290 TraceCheckUtils]: 61: Hoare triple {28093#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28094#(<= main_~i~0 28)} is VALID [2022-04-28 02:50:15,139 INFO L290 TraceCheckUtils]: 62: Hoare triple {28094#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28094#(<= main_~i~0 28)} is VALID [2022-04-28 02:50:15,140 INFO L290 TraceCheckUtils]: 63: Hoare triple {28094#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28095#(<= main_~i~0 29)} is VALID [2022-04-28 02:50:15,140 INFO L290 TraceCheckUtils]: 64: Hoare triple {28095#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28095#(<= main_~i~0 29)} is VALID [2022-04-28 02:50:15,140 INFO L290 TraceCheckUtils]: 65: Hoare triple {28095#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28096#(<= main_~i~0 30)} is VALID [2022-04-28 02:50:15,140 INFO L290 TraceCheckUtils]: 66: Hoare triple {28096#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28096#(<= main_~i~0 30)} is VALID [2022-04-28 02:50:15,141 INFO L290 TraceCheckUtils]: 67: Hoare triple {28096#(<= main_~i~0 30)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28097#(<= main_~i~0 31)} is VALID [2022-04-28 02:50:15,141 INFO L290 TraceCheckUtils]: 68: Hoare triple {28097#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28097#(<= main_~i~0 31)} is VALID [2022-04-28 02:50:15,141 INFO L290 TraceCheckUtils]: 69: Hoare triple {28097#(<= main_~i~0 31)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28098#(<= main_~i~0 32)} is VALID [2022-04-28 02:50:15,142 INFO L290 TraceCheckUtils]: 70: Hoare triple {28098#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28098#(<= main_~i~0 32)} is VALID [2022-04-28 02:50:15,142 INFO L290 TraceCheckUtils]: 71: Hoare triple {28098#(<= main_~i~0 32)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28099#(<= main_~i~0 33)} is VALID [2022-04-28 02:50:15,142 INFO L290 TraceCheckUtils]: 72: Hoare triple {28099#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28099#(<= main_~i~0 33)} is VALID [2022-04-28 02:50:15,143 INFO L290 TraceCheckUtils]: 73: Hoare triple {28099#(<= main_~i~0 33)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28100#(<= main_~i~0 34)} is VALID [2022-04-28 02:50:15,143 INFO L290 TraceCheckUtils]: 74: Hoare triple {28100#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28100#(<= main_~i~0 34)} is VALID [2022-04-28 02:50:15,143 INFO L290 TraceCheckUtils]: 75: Hoare triple {28100#(<= main_~i~0 34)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28101#(<= main_~i~0 35)} is VALID [2022-04-28 02:50:15,143 INFO L290 TraceCheckUtils]: 76: Hoare triple {28101#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28101#(<= main_~i~0 35)} is VALID [2022-04-28 02:50:15,144 INFO L290 TraceCheckUtils]: 77: Hoare triple {28101#(<= main_~i~0 35)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28102#(<= main_~i~0 36)} is VALID [2022-04-28 02:50:15,144 INFO L290 TraceCheckUtils]: 78: Hoare triple {28102#(<= main_~i~0 36)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28102#(<= main_~i~0 36)} is VALID [2022-04-28 02:50:15,144 INFO L290 TraceCheckUtils]: 79: Hoare triple {28102#(<= main_~i~0 36)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28103#(<= main_~i~0 37)} is VALID [2022-04-28 02:50:15,145 INFO L290 TraceCheckUtils]: 80: Hoare triple {28103#(<= main_~i~0 37)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28103#(<= main_~i~0 37)} is VALID [2022-04-28 02:50:15,145 INFO L290 TraceCheckUtils]: 81: Hoare triple {28103#(<= main_~i~0 37)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28104#(<= main_~i~0 38)} is VALID [2022-04-28 02:50:15,145 INFO L290 TraceCheckUtils]: 82: Hoare triple {28104#(<= main_~i~0 38)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28104#(<= main_~i~0 38)} is VALID [2022-04-28 02:50:15,146 INFO L290 TraceCheckUtils]: 83: Hoare triple {28104#(<= main_~i~0 38)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28105#(<= main_~i~0 39)} is VALID [2022-04-28 02:50:15,146 INFO L290 TraceCheckUtils]: 84: Hoare triple {28105#(<= main_~i~0 39)} assume !(~i~0 < 1024); {28062#false} is VALID [2022-04-28 02:50:15,146 INFO L290 TraceCheckUtils]: 85: Hoare triple {28062#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {28062#false} is VALID [2022-04-28 02:50:15,146 INFO L272 TraceCheckUtils]: 86: Hoare triple {28062#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {28062#false} is VALID [2022-04-28 02:50:15,146 INFO L290 TraceCheckUtils]: 87: Hoare triple {28062#false} ~cond := #in~cond; {28062#false} is VALID [2022-04-28 02:50:15,146 INFO L290 TraceCheckUtils]: 88: Hoare triple {28062#false} assume 0 == ~cond; {28062#false} is VALID [2022-04-28 02:50:15,146 INFO L290 TraceCheckUtils]: 89: Hoare triple {28062#false} assume !false; {28062#false} is VALID [2022-04-28 02:50:15,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:50:15,147 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:50:17,110 INFO L290 TraceCheckUtils]: 89: Hoare triple {28062#false} assume !false; {28062#false} is VALID [2022-04-28 02:50:17,110 INFO L290 TraceCheckUtils]: 88: Hoare triple {28062#false} assume 0 == ~cond; {28062#false} is VALID [2022-04-28 02:50:17,111 INFO L290 TraceCheckUtils]: 87: Hoare triple {28062#false} ~cond := #in~cond; {28062#false} is VALID [2022-04-28 02:50:17,111 INFO L272 TraceCheckUtils]: 86: Hoare triple {28062#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {28062#false} is VALID [2022-04-28 02:50:17,111 INFO L290 TraceCheckUtils]: 85: Hoare triple {28062#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {28062#false} is VALID [2022-04-28 02:50:17,111 INFO L290 TraceCheckUtils]: 84: Hoare triple {28393#(< main_~i~0 1024)} assume !(~i~0 < 1024); {28062#false} is VALID [2022-04-28 02:50:17,111 INFO L290 TraceCheckUtils]: 83: Hoare triple {28397#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28393#(< main_~i~0 1024)} is VALID [2022-04-28 02:50:17,112 INFO L290 TraceCheckUtils]: 82: Hoare triple {28397#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28397#(< main_~i~0 1023)} is VALID [2022-04-28 02:50:17,112 INFO L290 TraceCheckUtils]: 81: Hoare triple {28404#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28397#(< main_~i~0 1023)} is VALID [2022-04-28 02:50:17,112 INFO L290 TraceCheckUtils]: 80: Hoare triple {28404#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28404#(< main_~i~0 1022)} is VALID [2022-04-28 02:50:17,112 INFO L290 TraceCheckUtils]: 79: Hoare triple {28411#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28404#(< main_~i~0 1022)} is VALID [2022-04-28 02:50:17,113 INFO L290 TraceCheckUtils]: 78: Hoare triple {28411#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28411#(< main_~i~0 1021)} is VALID [2022-04-28 02:50:17,113 INFO L290 TraceCheckUtils]: 77: Hoare triple {28418#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28411#(< main_~i~0 1021)} is VALID [2022-04-28 02:50:17,113 INFO L290 TraceCheckUtils]: 76: Hoare triple {28418#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28418#(< main_~i~0 1020)} is VALID [2022-04-28 02:50:17,114 INFO L290 TraceCheckUtils]: 75: Hoare triple {28425#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28418#(< main_~i~0 1020)} is VALID [2022-04-28 02:50:17,114 INFO L290 TraceCheckUtils]: 74: Hoare triple {28425#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28425#(< main_~i~0 1019)} is VALID [2022-04-28 02:50:17,114 INFO L290 TraceCheckUtils]: 73: Hoare triple {28432#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28425#(< main_~i~0 1019)} is VALID [2022-04-28 02:50:17,115 INFO L290 TraceCheckUtils]: 72: Hoare triple {28432#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28432#(< main_~i~0 1018)} is VALID [2022-04-28 02:50:17,115 INFO L290 TraceCheckUtils]: 71: Hoare triple {28439#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28432#(< main_~i~0 1018)} is VALID [2022-04-28 02:50:17,115 INFO L290 TraceCheckUtils]: 70: Hoare triple {28439#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28439#(< main_~i~0 1017)} is VALID [2022-04-28 02:50:17,116 INFO L290 TraceCheckUtils]: 69: Hoare triple {28446#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28439#(< main_~i~0 1017)} is VALID [2022-04-28 02:50:17,116 INFO L290 TraceCheckUtils]: 68: Hoare triple {28446#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28446#(< main_~i~0 1016)} is VALID [2022-04-28 02:50:17,116 INFO L290 TraceCheckUtils]: 67: Hoare triple {28453#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28446#(< main_~i~0 1016)} is VALID [2022-04-28 02:50:17,116 INFO L290 TraceCheckUtils]: 66: Hoare triple {28453#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28453#(< main_~i~0 1015)} is VALID [2022-04-28 02:50:17,117 INFO L290 TraceCheckUtils]: 65: Hoare triple {28460#(< main_~i~0 1014)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28453#(< main_~i~0 1015)} is VALID [2022-04-28 02:50:17,117 INFO L290 TraceCheckUtils]: 64: Hoare triple {28460#(< main_~i~0 1014)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28460#(< main_~i~0 1014)} is VALID [2022-04-28 02:50:17,117 INFO L290 TraceCheckUtils]: 63: Hoare triple {28467#(< main_~i~0 1013)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28460#(< main_~i~0 1014)} is VALID [2022-04-28 02:50:17,118 INFO L290 TraceCheckUtils]: 62: Hoare triple {28467#(< main_~i~0 1013)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28467#(< main_~i~0 1013)} is VALID [2022-04-28 02:50:17,118 INFO L290 TraceCheckUtils]: 61: Hoare triple {28474#(< main_~i~0 1012)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28467#(< main_~i~0 1013)} is VALID [2022-04-28 02:50:17,118 INFO L290 TraceCheckUtils]: 60: Hoare triple {28474#(< main_~i~0 1012)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28474#(< main_~i~0 1012)} is VALID [2022-04-28 02:50:17,119 INFO L290 TraceCheckUtils]: 59: Hoare triple {28481#(< main_~i~0 1011)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28474#(< main_~i~0 1012)} is VALID [2022-04-28 02:50:17,119 INFO L290 TraceCheckUtils]: 58: Hoare triple {28481#(< main_~i~0 1011)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28481#(< main_~i~0 1011)} is VALID [2022-04-28 02:50:17,119 INFO L290 TraceCheckUtils]: 57: Hoare triple {28488#(< main_~i~0 1010)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28481#(< main_~i~0 1011)} is VALID [2022-04-28 02:50:17,120 INFO L290 TraceCheckUtils]: 56: Hoare triple {28488#(< main_~i~0 1010)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28488#(< main_~i~0 1010)} is VALID [2022-04-28 02:50:17,120 INFO L290 TraceCheckUtils]: 55: Hoare triple {28495#(< main_~i~0 1009)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28488#(< main_~i~0 1010)} is VALID [2022-04-28 02:50:17,120 INFO L290 TraceCheckUtils]: 54: Hoare triple {28495#(< main_~i~0 1009)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28495#(< main_~i~0 1009)} is VALID [2022-04-28 02:50:17,120 INFO L290 TraceCheckUtils]: 53: Hoare triple {28502#(< main_~i~0 1008)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28495#(< main_~i~0 1009)} is VALID [2022-04-28 02:50:17,121 INFO L290 TraceCheckUtils]: 52: Hoare triple {28502#(< main_~i~0 1008)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28502#(< main_~i~0 1008)} is VALID [2022-04-28 02:50:17,121 INFO L290 TraceCheckUtils]: 51: Hoare triple {28509#(< main_~i~0 1007)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28502#(< main_~i~0 1008)} is VALID [2022-04-28 02:50:17,121 INFO L290 TraceCheckUtils]: 50: Hoare triple {28509#(< main_~i~0 1007)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28509#(< main_~i~0 1007)} is VALID [2022-04-28 02:50:17,122 INFO L290 TraceCheckUtils]: 49: Hoare triple {28516#(< main_~i~0 1006)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28509#(< main_~i~0 1007)} is VALID [2022-04-28 02:50:17,122 INFO L290 TraceCheckUtils]: 48: Hoare triple {28516#(< main_~i~0 1006)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28516#(< main_~i~0 1006)} is VALID [2022-04-28 02:50:17,122 INFO L290 TraceCheckUtils]: 47: Hoare triple {28523#(< main_~i~0 1005)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28516#(< main_~i~0 1006)} is VALID [2022-04-28 02:50:17,123 INFO L290 TraceCheckUtils]: 46: Hoare triple {28523#(< main_~i~0 1005)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28523#(< main_~i~0 1005)} is VALID [2022-04-28 02:50:17,123 INFO L290 TraceCheckUtils]: 45: Hoare triple {28530#(< main_~i~0 1004)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28523#(< main_~i~0 1005)} is VALID [2022-04-28 02:50:17,123 INFO L290 TraceCheckUtils]: 44: Hoare triple {28530#(< main_~i~0 1004)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28530#(< main_~i~0 1004)} is VALID [2022-04-28 02:50:17,124 INFO L290 TraceCheckUtils]: 43: Hoare triple {28537#(< main_~i~0 1003)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28530#(< main_~i~0 1004)} is VALID [2022-04-28 02:50:17,124 INFO L290 TraceCheckUtils]: 42: Hoare triple {28537#(< main_~i~0 1003)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28537#(< main_~i~0 1003)} is VALID [2022-04-28 02:50:17,124 INFO L290 TraceCheckUtils]: 41: Hoare triple {28544#(< main_~i~0 1002)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28537#(< main_~i~0 1003)} is VALID [2022-04-28 02:50:17,124 INFO L290 TraceCheckUtils]: 40: Hoare triple {28544#(< main_~i~0 1002)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28544#(< main_~i~0 1002)} is VALID [2022-04-28 02:50:17,125 INFO L290 TraceCheckUtils]: 39: Hoare triple {28551#(< main_~i~0 1001)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28544#(< main_~i~0 1002)} is VALID [2022-04-28 02:50:17,125 INFO L290 TraceCheckUtils]: 38: Hoare triple {28551#(< main_~i~0 1001)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28551#(< main_~i~0 1001)} is VALID [2022-04-28 02:50:17,125 INFO L290 TraceCheckUtils]: 37: Hoare triple {28558#(< main_~i~0 1000)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28551#(< main_~i~0 1001)} is VALID [2022-04-28 02:50:17,126 INFO L290 TraceCheckUtils]: 36: Hoare triple {28558#(< main_~i~0 1000)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28558#(< main_~i~0 1000)} is VALID [2022-04-28 02:50:17,126 INFO L290 TraceCheckUtils]: 35: Hoare triple {28565#(< main_~i~0 999)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28558#(< main_~i~0 1000)} is VALID [2022-04-28 02:50:17,126 INFO L290 TraceCheckUtils]: 34: Hoare triple {28565#(< main_~i~0 999)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28565#(< main_~i~0 999)} is VALID [2022-04-28 02:50:17,127 INFO L290 TraceCheckUtils]: 33: Hoare triple {28572#(< main_~i~0 998)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28565#(< main_~i~0 999)} is VALID [2022-04-28 02:50:17,127 INFO L290 TraceCheckUtils]: 32: Hoare triple {28572#(< main_~i~0 998)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28572#(< main_~i~0 998)} is VALID [2022-04-28 02:50:17,127 INFO L290 TraceCheckUtils]: 31: Hoare triple {28579#(< main_~i~0 997)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28572#(< main_~i~0 998)} is VALID [2022-04-28 02:50:17,128 INFO L290 TraceCheckUtils]: 30: Hoare triple {28579#(< main_~i~0 997)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28579#(< main_~i~0 997)} is VALID [2022-04-28 02:50:17,128 INFO L290 TraceCheckUtils]: 29: Hoare triple {28586#(< main_~i~0 996)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28579#(< main_~i~0 997)} is VALID [2022-04-28 02:50:17,128 INFO L290 TraceCheckUtils]: 28: Hoare triple {28586#(< main_~i~0 996)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28586#(< main_~i~0 996)} is VALID [2022-04-28 02:50:17,129 INFO L290 TraceCheckUtils]: 27: Hoare triple {28593#(< main_~i~0 995)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28586#(< main_~i~0 996)} is VALID [2022-04-28 02:50:17,129 INFO L290 TraceCheckUtils]: 26: Hoare triple {28593#(< main_~i~0 995)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28593#(< main_~i~0 995)} is VALID [2022-04-28 02:50:17,129 INFO L290 TraceCheckUtils]: 25: Hoare triple {28600#(< main_~i~0 994)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28593#(< main_~i~0 995)} is VALID [2022-04-28 02:50:17,129 INFO L290 TraceCheckUtils]: 24: Hoare triple {28600#(< main_~i~0 994)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28600#(< main_~i~0 994)} is VALID [2022-04-28 02:50:17,130 INFO L290 TraceCheckUtils]: 23: Hoare triple {28607#(< main_~i~0 993)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28600#(< main_~i~0 994)} is VALID [2022-04-28 02:50:17,130 INFO L290 TraceCheckUtils]: 22: Hoare triple {28607#(< main_~i~0 993)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28607#(< main_~i~0 993)} is VALID [2022-04-28 02:50:17,130 INFO L290 TraceCheckUtils]: 21: Hoare triple {28614#(< main_~i~0 992)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28607#(< main_~i~0 993)} is VALID [2022-04-28 02:50:17,131 INFO L290 TraceCheckUtils]: 20: Hoare triple {28614#(< main_~i~0 992)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28614#(< main_~i~0 992)} is VALID [2022-04-28 02:50:17,131 INFO L290 TraceCheckUtils]: 19: Hoare triple {28621#(< main_~i~0 991)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28614#(< main_~i~0 992)} is VALID [2022-04-28 02:50:17,131 INFO L290 TraceCheckUtils]: 18: Hoare triple {28621#(< main_~i~0 991)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28621#(< main_~i~0 991)} is VALID [2022-04-28 02:50:17,132 INFO L290 TraceCheckUtils]: 17: Hoare triple {28628#(< main_~i~0 990)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28621#(< main_~i~0 991)} is VALID [2022-04-28 02:50:17,132 INFO L290 TraceCheckUtils]: 16: Hoare triple {28628#(< main_~i~0 990)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28628#(< main_~i~0 990)} is VALID [2022-04-28 02:50:17,132 INFO L290 TraceCheckUtils]: 15: Hoare triple {28635#(< main_~i~0 989)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28628#(< main_~i~0 990)} is VALID [2022-04-28 02:50:17,132 INFO L290 TraceCheckUtils]: 14: Hoare triple {28635#(< main_~i~0 989)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28635#(< main_~i~0 989)} is VALID [2022-04-28 02:50:17,133 INFO L290 TraceCheckUtils]: 13: Hoare triple {28642#(< main_~i~0 988)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28635#(< main_~i~0 989)} is VALID [2022-04-28 02:50:17,133 INFO L290 TraceCheckUtils]: 12: Hoare triple {28642#(< main_~i~0 988)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28642#(< main_~i~0 988)} is VALID [2022-04-28 02:50:17,133 INFO L290 TraceCheckUtils]: 11: Hoare triple {28649#(< main_~i~0 987)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28642#(< main_~i~0 988)} is VALID [2022-04-28 02:50:17,134 INFO L290 TraceCheckUtils]: 10: Hoare triple {28649#(< main_~i~0 987)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28649#(< main_~i~0 987)} is VALID [2022-04-28 02:50:17,134 INFO L290 TraceCheckUtils]: 9: Hoare triple {28656#(< main_~i~0 986)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28649#(< main_~i~0 987)} is VALID [2022-04-28 02:50:17,134 INFO L290 TraceCheckUtils]: 8: Hoare triple {28656#(< main_~i~0 986)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28656#(< main_~i~0 986)} is VALID [2022-04-28 02:50:17,135 INFO L290 TraceCheckUtils]: 7: Hoare triple {28663#(< main_~i~0 985)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28656#(< main_~i~0 986)} is VALID [2022-04-28 02:50:17,135 INFO L290 TraceCheckUtils]: 6: Hoare triple {28663#(< main_~i~0 985)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28663#(< main_~i~0 985)} is VALID [2022-04-28 02:50:17,135 INFO L290 TraceCheckUtils]: 5: Hoare triple {28061#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {28663#(< main_~i~0 985)} is VALID [2022-04-28 02:50:17,135 INFO L272 TraceCheckUtils]: 4: Hoare triple {28061#true} call #t~ret6 := main(); {28061#true} is VALID [2022-04-28 02:50:17,135 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28061#true} {28061#true} #39#return; {28061#true} is VALID [2022-04-28 02:50:17,135 INFO L290 TraceCheckUtils]: 2: Hoare triple {28061#true} assume true; {28061#true} is VALID [2022-04-28 02:50:17,136 INFO L290 TraceCheckUtils]: 1: Hoare triple {28061#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {28061#true} is VALID [2022-04-28 02:50:17,136 INFO L272 TraceCheckUtils]: 0: Hoare triple {28061#true} call ULTIMATE.init(); {28061#true} is VALID [2022-04-28 02:50:17,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:50:17,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [275968657] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:50:17,136 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:50:17,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 42, 42] total 84 [2022-04-28 02:50:17,136 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:50:17,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [557514212] [2022-04-28 02:50:17,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [557514212] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:50:17,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:50:17,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2022-04-28 02:50:17,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148852928] [2022-04-28 02:50:17,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:50:17,137 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.0) internal successors, (86), 42 states have internal predecessors, (86), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 90 [2022-04-28 02:50:17,137 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:50:17,137 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 43 states, 43 states have (on average 2.0) internal successors, (86), 42 states have internal predecessors, (86), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:50:17,192 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:50:17,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-04-28 02:50:17,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:50:17,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-04-28 02:50:17,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3405, Invalid=3567, Unknown=0, NotChecked=0, Total=6972 [2022-04-28 02:50:17,194 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand has 43 states, 43 states have (on average 2.0) internal successors, (86), 42 states have internal predecessors, (86), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:50:18,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:50:18,474 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2022-04-28 02:50:18,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-04-28 02:50:18,474 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.0) internal successors, (86), 42 states have internal predecessors, (86), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 90 [2022-04-28 02:50:18,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:50:18,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 2.0) internal successors, (86), 42 states have internal predecessors, (86), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:50:18,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 100 transitions. [2022-04-28 02:50:18,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 2.0) internal successors, (86), 42 states have internal predecessors, (86), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:50:18,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 100 transitions. [2022-04-28 02:50:18,476 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 100 transitions. [2022-04-28 02:50:18,548 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:50:18,549 INFO L225 Difference]: With dead ends: 100 [2022-04-28 02:50:18,549 INFO L226 Difference]: Without dead ends: 94 [2022-04-28 02:50:18,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1013 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=6726, Invalid=8526, Unknown=0, NotChecked=0, Total=15252 [2022-04-28 02:50:18,551 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 88 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:50:18,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 29 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:50:18,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-28 02:50:18,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2022-04-28 02:50:18,897 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:50:18,897 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 93 states, 88 states have (on average 1.0113636363636365) internal successors, (89), 88 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:50:18,897 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 93 states, 88 states have (on average 1.0113636363636365) internal successors, (89), 88 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:50:18,897 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 93 states, 88 states have (on average 1.0113636363636365) internal successors, (89), 88 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:50:18,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:50:18,898 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2022-04-28 02:50:18,898 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2022-04-28 02:50:18,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:50:18,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:50:18,898 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 88 states have (on average 1.0113636363636365) internal successors, (89), 88 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 94 states. [2022-04-28 02:50:18,898 INFO L87 Difference]: Start difference. First operand has 93 states, 88 states have (on average 1.0113636363636365) internal successors, (89), 88 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 94 states. [2022-04-28 02:50:18,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:50:18,899 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2022-04-28 02:50:18,899 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2022-04-28 02:50:18,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:50:18,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:50:18,899 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:50:18,899 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:50:18,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 88 states have (on average 1.0113636363636365) internal successors, (89), 88 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:50:18,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2022-04-28 02:50:18,900 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 90 [2022-04-28 02:50:18,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:50:18,900 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2022-04-28 02:50:18,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.0) internal successors, (86), 42 states have internal predecessors, (86), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:50:18,900 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 93 states and 93 transitions. [2022-04-28 02:50:18,996 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:50:18,996 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2022-04-28 02:50:18,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-04-28 02:50:18,996 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:50:18,997 INFO L195 NwaCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:50:19,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-04-28 02:50:19,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-04-28 02:50:19,203 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:50:19,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:50:19,204 INFO L85 PathProgramCache]: Analyzing trace with hash -61419062, now seen corresponding path program 79 times [2022-04-28 02:50:19,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:50:19,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [928963187] [2022-04-28 02:50:19,206 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:50:19,206 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:50:19,206 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:50:19,206 INFO L85 PathProgramCache]: Analyzing trace with hash -61419062, now seen corresponding path program 80 times [2022-04-28 02:50:19,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:50:19,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811657723] [2022-04-28 02:50:19,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:50:19,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:50:19,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:50:19,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:50:19,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:50:19,960 INFO L290 TraceCheckUtils]: 0: Hoare triple {29387#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {29341#true} is VALID [2022-04-28 02:50:19,961 INFO L290 TraceCheckUtils]: 1: Hoare triple {29341#true} assume true; {29341#true} is VALID [2022-04-28 02:50:19,961 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29341#true} {29341#true} #39#return; {29341#true} is VALID [2022-04-28 02:50:19,961 INFO L272 TraceCheckUtils]: 0: Hoare triple {29341#true} call ULTIMATE.init(); {29387#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:50:19,961 INFO L290 TraceCheckUtils]: 1: Hoare triple {29387#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {29341#true} is VALID [2022-04-28 02:50:19,961 INFO L290 TraceCheckUtils]: 2: Hoare triple {29341#true} assume true; {29341#true} is VALID [2022-04-28 02:50:19,961 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29341#true} {29341#true} #39#return; {29341#true} is VALID [2022-04-28 02:50:19,961 INFO L272 TraceCheckUtils]: 4: Hoare triple {29341#true} call #t~ret6 := main(); {29341#true} is VALID [2022-04-28 02:50:19,962 INFO L290 TraceCheckUtils]: 5: Hoare triple {29341#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {29346#(= main_~i~0 0)} is VALID [2022-04-28 02:50:19,962 INFO L290 TraceCheckUtils]: 6: Hoare triple {29346#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29346#(= main_~i~0 0)} is VALID [2022-04-28 02:50:19,962 INFO L290 TraceCheckUtils]: 7: Hoare triple {29346#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29347#(<= main_~i~0 1)} is VALID [2022-04-28 02:50:19,962 INFO L290 TraceCheckUtils]: 8: Hoare triple {29347#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29347#(<= main_~i~0 1)} is VALID [2022-04-28 02:50:19,963 INFO L290 TraceCheckUtils]: 9: Hoare triple {29347#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29348#(<= main_~i~0 2)} is VALID [2022-04-28 02:50:19,963 INFO L290 TraceCheckUtils]: 10: Hoare triple {29348#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29348#(<= main_~i~0 2)} is VALID [2022-04-28 02:50:19,963 INFO L290 TraceCheckUtils]: 11: Hoare triple {29348#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29349#(<= main_~i~0 3)} is VALID [2022-04-28 02:50:19,964 INFO L290 TraceCheckUtils]: 12: Hoare triple {29349#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29349#(<= main_~i~0 3)} is VALID [2022-04-28 02:50:19,964 INFO L290 TraceCheckUtils]: 13: Hoare triple {29349#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29350#(<= main_~i~0 4)} is VALID [2022-04-28 02:50:19,964 INFO L290 TraceCheckUtils]: 14: Hoare triple {29350#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29350#(<= main_~i~0 4)} is VALID [2022-04-28 02:50:19,965 INFO L290 TraceCheckUtils]: 15: Hoare triple {29350#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29351#(<= main_~i~0 5)} is VALID [2022-04-28 02:50:19,965 INFO L290 TraceCheckUtils]: 16: Hoare triple {29351#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29351#(<= main_~i~0 5)} is VALID [2022-04-28 02:50:19,965 INFO L290 TraceCheckUtils]: 17: Hoare triple {29351#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29352#(<= main_~i~0 6)} is VALID [2022-04-28 02:50:19,965 INFO L290 TraceCheckUtils]: 18: Hoare triple {29352#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29352#(<= main_~i~0 6)} is VALID [2022-04-28 02:50:19,966 INFO L290 TraceCheckUtils]: 19: Hoare triple {29352#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29353#(<= main_~i~0 7)} is VALID [2022-04-28 02:50:19,966 INFO L290 TraceCheckUtils]: 20: Hoare triple {29353#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29353#(<= main_~i~0 7)} is VALID [2022-04-28 02:50:19,966 INFO L290 TraceCheckUtils]: 21: Hoare triple {29353#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29354#(<= main_~i~0 8)} is VALID [2022-04-28 02:50:19,967 INFO L290 TraceCheckUtils]: 22: Hoare triple {29354#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29354#(<= main_~i~0 8)} is VALID [2022-04-28 02:50:19,967 INFO L290 TraceCheckUtils]: 23: Hoare triple {29354#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29355#(<= main_~i~0 9)} is VALID [2022-04-28 02:50:19,967 INFO L290 TraceCheckUtils]: 24: Hoare triple {29355#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29355#(<= main_~i~0 9)} is VALID [2022-04-28 02:50:19,968 INFO L290 TraceCheckUtils]: 25: Hoare triple {29355#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29356#(<= main_~i~0 10)} is VALID [2022-04-28 02:50:19,968 INFO L290 TraceCheckUtils]: 26: Hoare triple {29356#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29356#(<= main_~i~0 10)} is VALID [2022-04-28 02:50:19,968 INFO L290 TraceCheckUtils]: 27: Hoare triple {29356#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29357#(<= main_~i~0 11)} is VALID [2022-04-28 02:50:19,968 INFO L290 TraceCheckUtils]: 28: Hoare triple {29357#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29357#(<= main_~i~0 11)} is VALID [2022-04-28 02:50:19,969 INFO L290 TraceCheckUtils]: 29: Hoare triple {29357#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29358#(<= main_~i~0 12)} is VALID [2022-04-28 02:50:19,969 INFO L290 TraceCheckUtils]: 30: Hoare triple {29358#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29358#(<= main_~i~0 12)} is VALID [2022-04-28 02:50:19,969 INFO L290 TraceCheckUtils]: 31: Hoare triple {29358#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29359#(<= main_~i~0 13)} is VALID [2022-04-28 02:50:19,970 INFO L290 TraceCheckUtils]: 32: Hoare triple {29359#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29359#(<= main_~i~0 13)} is VALID [2022-04-28 02:50:19,970 INFO L290 TraceCheckUtils]: 33: Hoare triple {29359#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29360#(<= main_~i~0 14)} is VALID [2022-04-28 02:50:19,970 INFO L290 TraceCheckUtils]: 34: Hoare triple {29360#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29360#(<= main_~i~0 14)} is VALID [2022-04-28 02:50:19,971 INFO L290 TraceCheckUtils]: 35: Hoare triple {29360#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29361#(<= main_~i~0 15)} is VALID [2022-04-28 02:50:19,971 INFO L290 TraceCheckUtils]: 36: Hoare triple {29361#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29361#(<= main_~i~0 15)} is VALID [2022-04-28 02:50:19,971 INFO L290 TraceCheckUtils]: 37: Hoare triple {29361#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29362#(<= main_~i~0 16)} is VALID [2022-04-28 02:50:19,972 INFO L290 TraceCheckUtils]: 38: Hoare triple {29362#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29362#(<= main_~i~0 16)} is VALID [2022-04-28 02:50:19,972 INFO L290 TraceCheckUtils]: 39: Hoare triple {29362#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29363#(<= main_~i~0 17)} is VALID [2022-04-28 02:50:19,972 INFO L290 TraceCheckUtils]: 40: Hoare triple {29363#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29363#(<= main_~i~0 17)} is VALID [2022-04-28 02:50:19,972 INFO L290 TraceCheckUtils]: 41: Hoare triple {29363#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29364#(<= main_~i~0 18)} is VALID [2022-04-28 02:50:19,973 INFO L290 TraceCheckUtils]: 42: Hoare triple {29364#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29364#(<= main_~i~0 18)} is VALID [2022-04-28 02:50:19,973 INFO L290 TraceCheckUtils]: 43: Hoare triple {29364#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29365#(<= main_~i~0 19)} is VALID [2022-04-28 02:50:19,973 INFO L290 TraceCheckUtils]: 44: Hoare triple {29365#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29365#(<= main_~i~0 19)} is VALID [2022-04-28 02:50:19,974 INFO L290 TraceCheckUtils]: 45: Hoare triple {29365#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29366#(<= main_~i~0 20)} is VALID [2022-04-28 02:50:19,974 INFO L290 TraceCheckUtils]: 46: Hoare triple {29366#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29366#(<= main_~i~0 20)} is VALID [2022-04-28 02:50:19,974 INFO L290 TraceCheckUtils]: 47: Hoare triple {29366#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29367#(<= main_~i~0 21)} is VALID [2022-04-28 02:50:19,975 INFO L290 TraceCheckUtils]: 48: Hoare triple {29367#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29367#(<= main_~i~0 21)} is VALID [2022-04-28 02:50:19,975 INFO L290 TraceCheckUtils]: 49: Hoare triple {29367#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29368#(<= main_~i~0 22)} is VALID [2022-04-28 02:50:19,975 INFO L290 TraceCheckUtils]: 50: Hoare triple {29368#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29368#(<= main_~i~0 22)} is VALID [2022-04-28 02:50:19,975 INFO L290 TraceCheckUtils]: 51: Hoare triple {29368#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29369#(<= main_~i~0 23)} is VALID [2022-04-28 02:50:19,976 INFO L290 TraceCheckUtils]: 52: Hoare triple {29369#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29369#(<= main_~i~0 23)} is VALID [2022-04-28 02:50:19,976 INFO L290 TraceCheckUtils]: 53: Hoare triple {29369#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29370#(<= main_~i~0 24)} is VALID [2022-04-28 02:50:19,976 INFO L290 TraceCheckUtils]: 54: Hoare triple {29370#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29370#(<= main_~i~0 24)} is VALID [2022-04-28 02:50:19,977 INFO L290 TraceCheckUtils]: 55: Hoare triple {29370#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29371#(<= main_~i~0 25)} is VALID [2022-04-28 02:50:19,977 INFO L290 TraceCheckUtils]: 56: Hoare triple {29371#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29371#(<= main_~i~0 25)} is VALID [2022-04-28 02:50:19,977 INFO L290 TraceCheckUtils]: 57: Hoare triple {29371#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29372#(<= main_~i~0 26)} is VALID [2022-04-28 02:50:19,978 INFO L290 TraceCheckUtils]: 58: Hoare triple {29372#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29372#(<= main_~i~0 26)} is VALID [2022-04-28 02:50:19,978 INFO L290 TraceCheckUtils]: 59: Hoare triple {29372#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29373#(<= main_~i~0 27)} is VALID [2022-04-28 02:50:19,978 INFO L290 TraceCheckUtils]: 60: Hoare triple {29373#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29373#(<= main_~i~0 27)} is VALID [2022-04-28 02:50:19,978 INFO L290 TraceCheckUtils]: 61: Hoare triple {29373#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29374#(<= main_~i~0 28)} is VALID [2022-04-28 02:50:19,979 INFO L290 TraceCheckUtils]: 62: Hoare triple {29374#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29374#(<= main_~i~0 28)} is VALID [2022-04-28 02:50:19,979 INFO L290 TraceCheckUtils]: 63: Hoare triple {29374#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29375#(<= main_~i~0 29)} is VALID [2022-04-28 02:50:19,979 INFO L290 TraceCheckUtils]: 64: Hoare triple {29375#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29375#(<= main_~i~0 29)} is VALID [2022-04-28 02:50:19,980 INFO L290 TraceCheckUtils]: 65: Hoare triple {29375#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29376#(<= main_~i~0 30)} is VALID [2022-04-28 02:50:19,980 INFO L290 TraceCheckUtils]: 66: Hoare triple {29376#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29376#(<= main_~i~0 30)} is VALID [2022-04-28 02:50:19,980 INFO L290 TraceCheckUtils]: 67: Hoare triple {29376#(<= main_~i~0 30)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29377#(<= main_~i~0 31)} is VALID [2022-04-28 02:50:19,981 INFO L290 TraceCheckUtils]: 68: Hoare triple {29377#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29377#(<= main_~i~0 31)} is VALID [2022-04-28 02:50:19,981 INFO L290 TraceCheckUtils]: 69: Hoare triple {29377#(<= main_~i~0 31)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29378#(<= main_~i~0 32)} is VALID [2022-04-28 02:50:19,981 INFO L290 TraceCheckUtils]: 70: Hoare triple {29378#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29378#(<= main_~i~0 32)} is VALID [2022-04-28 02:50:19,982 INFO L290 TraceCheckUtils]: 71: Hoare triple {29378#(<= main_~i~0 32)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29379#(<= main_~i~0 33)} is VALID [2022-04-28 02:50:19,982 INFO L290 TraceCheckUtils]: 72: Hoare triple {29379#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29379#(<= main_~i~0 33)} is VALID [2022-04-28 02:50:19,982 INFO L290 TraceCheckUtils]: 73: Hoare triple {29379#(<= main_~i~0 33)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29380#(<= main_~i~0 34)} is VALID [2022-04-28 02:50:19,982 INFO L290 TraceCheckUtils]: 74: Hoare triple {29380#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29380#(<= main_~i~0 34)} is VALID [2022-04-28 02:50:19,983 INFO L290 TraceCheckUtils]: 75: Hoare triple {29380#(<= main_~i~0 34)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29381#(<= main_~i~0 35)} is VALID [2022-04-28 02:50:19,983 INFO L290 TraceCheckUtils]: 76: Hoare triple {29381#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29381#(<= main_~i~0 35)} is VALID [2022-04-28 02:50:19,983 INFO L290 TraceCheckUtils]: 77: Hoare triple {29381#(<= main_~i~0 35)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29382#(<= main_~i~0 36)} is VALID [2022-04-28 02:50:19,984 INFO L290 TraceCheckUtils]: 78: Hoare triple {29382#(<= main_~i~0 36)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29382#(<= main_~i~0 36)} is VALID [2022-04-28 02:50:19,984 INFO L290 TraceCheckUtils]: 79: Hoare triple {29382#(<= main_~i~0 36)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29383#(<= main_~i~0 37)} is VALID [2022-04-28 02:50:19,984 INFO L290 TraceCheckUtils]: 80: Hoare triple {29383#(<= main_~i~0 37)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29383#(<= main_~i~0 37)} is VALID [2022-04-28 02:50:19,985 INFO L290 TraceCheckUtils]: 81: Hoare triple {29383#(<= main_~i~0 37)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29384#(<= main_~i~0 38)} is VALID [2022-04-28 02:50:19,985 INFO L290 TraceCheckUtils]: 82: Hoare triple {29384#(<= main_~i~0 38)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29384#(<= main_~i~0 38)} is VALID [2022-04-28 02:50:19,985 INFO L290 TraceCheckUtils]: 83: Hoare triple {29384#(<= main_~i~0 38)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29385#(<= main_~i~0 39)} is VALID [2022-04-28 02:50:19,985 INFO L290 TraceCheckUtils]: 84: Hoare triple {29385#(<= main_~i~0 39)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29385#(<= main_~i~0 39)} is VALID [2022-04-28 02:50:19,986 INFO L290 TraceCheckUtils]: 85: Hoare triple {29385#(<= main_~i~0 39)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29386#(<= main_~i~0 40)} is VALID [2022-04-28 02:50:19,986 INFO L290 TraceCheckUtils]: 86: Hoare triple {29386#(<= main_~i~0 40)} assume !(~i~0 < 1024); {29342#false} is VALID [2022-04-28 02:50:19,986 INFO L290 TraceCheckUtils]: 87: Hoare triple {29342#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {29342#false} is VALID [2022-04-28 02:50:19,986 INFO L272 TraceCheckUtils]: 88: Hoare triple {29342#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {29342#false} is VALID [2022-04-28 02:50:19,986 INFO L290 TraceCheckUtils]: 89: Hoare triple {29342#false} ~cond := #in~cond; {29342#false} is VALID [2022-04-28 02:50:19,986 INFO L290 TraceCheckUtils]: 90: Hoare triple {29342#false} assume 0 == ~cond; {29342#false} is VALID [2022-04-28 02:50:19,986 INFO L290 TraceCheckUtils]: 91: Hoare triple {29342#false} assume !false; {29342#false} is VALID [2022-04-28 02:50:19,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:50:19,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:50:19,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811657723] [2022-04-28 02:50:19,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811657723] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:50:19,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390636558] [2022-04-28 02:50:19,987 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:50:19,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:50:19,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:50:19,988 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:50:19,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-04-28 02:50:20,186 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:50:20,186 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:50:20,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 42 conjunts are in the unsatisfiable core [2022-04-28 02:50:20,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:50:20,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:50:20,731 INFO L272 TraceCheckUtils]: 0: Hoare triple {29341#true} call ULTIMATE.init(); {29341#true} is VALID [2022-04-28 02:50:20,732 INFO L290 TraceCheckUtils]: 1: Hoare triple {29341#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {29341#true} is VALID [2022-04-28 02:50:20,732 INFO L290 TraceCheckUtils]: 2: Hoare triple {29341#true} assume true; {29341#true} is VALID [2022-04-28 02:50:20,732 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29341#true} {29341#true} #39#return; {29341#true} is VALID [2022-04-28 02:50:20,732 INFO L272 TraceCheckUtils]: 4: Hoare triple {29341#true} call #t~ret6 := main(); {29341#true} is VALID [2022-04-28 02:50:20,733 INFO L290 TraceCheckUtils]: 5: Hoare triple {29341#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {29406#(<= main_~i~0 0)} is VALID [2022-04-28 02:50:20,733 INFO L290 TraceCheckUtils]: 6: Hoare triple {29406#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29406#(<= main_~i~0 0)} is VALID [2022-04-28 02:50:20,734 INFO L290 TraceCheckUtils]: 7: Hoare triple {29406#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29347#(<= main_~i~0 1)} is VALID [2022-04-28 02:50:20,734 INFO L290 TraceCheckUtils]: 8: Hoare triple {29347#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29347#(<= main_~i~0 1)} is VALID [2022-04-28 02:50:20,734 INFO L290 TraceCheckUtils]: 9: Hoare triple {29347#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29348#(<= main_~i~0 2)} is VALID [2022-04-28 02:50:20,735 INFO L290 TraceCheckUtils]: 10: Hoare triple {29348#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29348#(<= main_~i~0 2)} is VALID [2022-04-28 02:50:20,735 INFO L290 TraceCheckUtils]: 11: Hoare triple {29348#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29349#(<= main_~i~0 3)} is VALID [2022-04-28 02:50:20,735 INFO L290 TraceCheckUtils]: 12: Hoare triple {29349#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29349#(<= main_~i~0 3)} is VALID [2022-04-28 02:50:20,735 INFO L290 TraceCheckUtils]: 13: Hoare triple {29349#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29350#(<= main_~i~0 4)} is VALID [2022-04-28 02:50:20,736 INFO L290 TraceCheckUtils]: 14: Hoare triple {29350#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29350#(<= main_~i~0 4)} is VALID [2022-04-28 02:50:20,736 INFO L290 TraceCheckUtils]: 15: Hoare triple {29350#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29351#(<= main_~i~0 5)} is VALID [2022-04-28 02:50:20,736 INFO L290 TraceCheckUtils]: 16: Hoare triple {29351#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29351#(<= main_~i~0 5)} is VALID [2022-04-28 02:50:20,737 INFO L290 TraceCheckUtils]: 17: Hoare triple {29351#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29352#(<= main_~i~0 6)} is VALID [2022-04-28 02:50:20,737 INFO L290 TraceCheckUtils]: 18: Hoare triple {29352#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29352#(<= main_~i~0 6)} is VALID [2022-04-28 02:50:20,737 INFO L290 TraceCheckUtils]: 19: Hoare triple {29352#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29353#(<= main_~i~0 7)} is VALID [2022-04-28 02:50:20,738 INFO L290 TraceCheckUtils]: 20: Hoare triple {29353#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29353#(<= main_~i~0 7)} is VALID [2022-04-28 02:50:20,738 INFO L290 TraceCheckUtils]: 21: Hoare triple {29353#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29354#(<= main_~i~0 8)} is VALID [2022-04-28 02:50:20,738 INFO L290 TraceCheckUtils]: 22: Hoare triple {29354#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29354#(<= main_~i~0 8)} is VALID [2022-04-28 02:50:20,739 INFO L290 TraceCheckUtils]: 23: Hoare triple {29354#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29355#(<= main_~i~0 9)} is VALID [2022-04-28 02:50:20,739 INFO L290 TraceCheckUtils]: 24: Hoare triple {29355#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29355#(<= main_~i~0 9)} is VALID [2022-04-28 02:50:20,739 INFO L290 TraceCheckUtils]: 25: Hoare triple {29355#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29356#(<= main_~i~0 10)} is VALID [2022-04-28 02:50:20,739 INFO L290 TraceCheckUtils]: 26: Hoare triple {29356#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29356#(<= main_~i~0 10)} is VALID [2022-04-28 02:50:20,740 INFO L290 TraceCheckUtils]: 27: Hoare triple {29356#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29357#(<= main_~i~0 11)} is VALID [2022-04-28 02:50:20,740 INFO L290 TraceCheckUtils]: 28: Hoare triple {29357#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29357#(<= main_~i~0 11)} is VALID [2022-04-28 02:50:20,740 INFO L290 TraceCheckUtils]: 29: Hoare triple {29357#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29358#(<= main_~i~0 12)} is VALID [2022-04-28 02:50:20,741 INFO L290 TraceCheckUtils]: 30: Hoare triple {29358#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29358#(<= main_~i~0 12)} is VALID [2022-04-28 02:50:20,741 INFO L290 TraceCheckUtils]: 31: Hoare triple {29358#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29359#(<= main_~i~0 13)} is VALID [2022-04-28 02:50:20,741 INFO L290 TraceCheckUtils]: 32: Hoare triple {29359#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29359#(<= main_~i~0 13)} is VALID [2022-04-28 02:50:20,742 INFO L290 TraceCheckUtils]: 33: Hoare triple {29359#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29360#(<= main_~i~0 14)} is VALID [2022-04-28 02:50:20,742 INFO L290 TraceCheckUtils]: 34: Hoare triple {29360#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29360#(<= main_~i~0 14)} is VALID [2022-04-28 02:50:20,742 INFO L290 TraceCheckUtils]: 35: Hoare triple {29360#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29361#(<= main_~i~0 15)} is VALID [2022-04-28 02:50:20,743 INFO L290 TraceCheckUtils]: 36: Hoare triple {29361#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29361#(<= main_~i~0 15)} is VALID [2022-04-28 02:50:20,743 INFO L290 TraceCheckUtils]: 37: Hoare triple {29361#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29362#(<= main_~i~0 16)} is VALID [2022-04-28 02:50:20,743 INFO L290 TraceCheckUtils]: 38: Hoare triple {29362#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29362#(<= main_~i~0 16)} is VALID [2022-04-28 02:50:20,743 INFO L290 TraceCheckUtils]: 39: Hoare triple {29362#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29363#(<= main_~i~0 17)} is VALID [2022-04-28 02:50:20,744 INFO L290 TraceCheckUtils]: 40: Hoare triple {29363#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29363#(<= main_~i~0 17)} is VALID [2022-04-28 02:50:20,744 INFO L290 TraceCheckUtils]: 41: Hoare triple {29363#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29364#(<= main_~i~0 18)} is VALID [2022-04-28 02:50:20,744 INFO L290 TraceCheckUtils]: 42: Hoare triple {29364#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29364#(<= main_~i~0 18)} is VALID [2022-04-28 02:50:20,745 INFO L290 TraceCheckUtils]: 43: Hoare triple {29364#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29365#(<= main_~i~0 19)} is VALID [2022-04-28 02:50:20,745 INFO L290 TraceCheckUtils]: 44: Hoare triple {29365#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29365#(<= main_~i~0 19)} is VALID [2022-04-28 02:50:20,745 INFO L290 TraceCheckUtils]: 45: Hoare triple {29365#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29366#(<= main_~i~0 20)} is VALID [2022-04-28 02:50:20,746 INFO L290 TraceCheckUtils]: 46: Hoare triple {29366#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29366#(<= main_~i~0 20)} is VALID [2022-04-28 02:50:20,746 INFO L290 TraceCheckUtils]: 47: Hoare triple {29366#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29367#(<= main_~i~0 21)} is VALID [2022-04-28 02:50:20,746 INFO L290 TraceCheckUtils]: 48: Hoare triple {29367#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29367#(<= main_~i~0 21)} is VALID [2022-04-28 02:50:20,747 INFO L290 TraceCheckUtils]: 49: Hoare triple {29367#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29368#(<= main_~i~0 22)} is VALID [2022-04-28 02:50:20,747 INFO L290 TraceCheckUtils]: 50: Hoare triple {29368#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29368#(<= main_~i~0 22)} is VALID [2022-04-28 02:50:20,747 INFO L290 TraceCheckUtils]: 51: Hoare triple {29368#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29369#(<= main_~i~0 23)} is VALID [2022-04-28 02:50:20,747 INFO L290 TraceCheckUtils]: 52: Hoare triple {29369#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29369#(<= main_~i~0 23)} is VALID [2022-04-28 02:50:20,748 INFO L290 TraceCheckUtils]: 53: Hoare triple {29369#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29370#(<= main_~i~0 24)} is VALID [2022-04-28 02:50:20,748 INFO L290 TraceCheckUtils]: 54: Hoare triple {29370#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29370#(<= main_~i~0 24)} is VALID [2022-04-28 02:50:20,748 INFO L290 TraceCheckUtils]: 55: Hoare triple {29370#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29371#(<= main_~i~0 25)} is VALID [2022-04-28 02:50:20,749 INFO L290 TraceCheckUtils]: 56: Hoare triple {29371#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29371#(<= main_~i~0 25)} is VALID [2022-04-28 02:50:20,749 INFO L290 TraceCheckUtils]: 57: Hoare triple {29371#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29372#(<= main_~i~0 26)} is VALID [2022-04-28 02:50:20,749 INFO L290 TraceCheckUtils]: 58: Hoare triple {29372#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29372#(<= main_~i~0 26)} is VALID [2022-04-28 02:50:20,750 INFO L290 TraceCheckUtils]: 59: Hoare triple {29372#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29373#(<= main_~i~0 27)} is VALID [2022-04-28 02:50:20,750 INFO L290 TraceCheckUtils]: 60: Hoare triple {29373#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29373#(<= main_~i~0 27)} is VALID [2022-04-28 02:50:20,750 INFO L290 TraceCheckUtils]: 61: Hoare triple {29373#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29374#(<= main_~i~0 28)} is VALID [2022-04-28 02:50:20,750 INFO L290 TraceCheckUtils]: 62: Hoare triple {29374#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29374#(<= main_~i~0 28)} is VALID [2022-04-28 02:50:20,751 INFO L290 TraceCheckUtils]: 63: Hoare triple {29374#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29375#(<= main_~i~0 29)} is VALID [2022-04-28 02:50:20,751 INFO L290 TraceCheckUtils]: 64: Hoare triple {29375#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29375#(<= main_~i~0 29)} is VALID [2022-04-28 02:50:20,751 INFO L290 TraceCheckUtils]: 65: Hoare triple {29375#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29376#(<= main_~i~0 30)} is VALID [2022-04-28 02:50:20,752 INFO L290 TraceCheckUtils]: 66: Hoare triple {29376#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29376#(<= main_~i~0 30)} is VALID [2022-04-28 02:50:20,752 INFO L290 TraceCheckUtils]: 67: Hoare triple {29376#(<= main_~i~0 30)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29377#(<= main_~i~0 31)} is VALID [2022-04-28 02:50:20,752 INFO L290 TraceCheckUtils]: 68: Hoare triple {29377#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29377#(<= main_~i~0 31)} is VALID [2022-04-28 02:50:20,753 INFO L290 TraceCheckUtils]: 69: Hoare triple {29377#(<= main_~i~0 31)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29378#(<= main_~i~0 32)} is VALID [2022-04-28 02:50:20,753 INFO L290 TraceCheckUtils]: 70: Hoare triple {29378#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29378#(<= main_~i~0 32)} is VALID [2022-04-28 02:50:20,753 INFO L290 TraceCheckUtils]: 71: Hoare triple {29378#(<= main_~i~0 32)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29379#(<= main_~i~0 33)} is VALID [2022-04-28 02:50:20,754 INFO L290 TraceCheckUtils]: 72: Hoare triple {29379#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29379#(<= main_~i~0 33)} is VALID [2022-04-28 02:50:20,754 INFO L290 TraceCheckUtils]: 73: Hoare triple {29379#(<= main_~i~0 33)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29380#(<= main_~i~0 34)} is VALID [2022-04-28 02:50:20,754 INFO L290 TraceCheckUtils]: 74: Hoare triple {29380#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29380#(<= main_~i~0 34)} is VALID [2022-04-28 02:50:20,754 INFO L290 TraceCheckUtils]: 75: Hoare triple {29380#(<= main_~i~0 34)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29381#(<= main_~i~0 35)} is VALID [2022-04-28 02:50:20,755 INFO L290 TraceCheckUtils]: 76: Hoare triple {29381#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29381#(<= main_~i~0 35)} is VALID [2022-04-28 02:50:20,755 INFO L290 TraceCheckUtils]: 77: Hoare triple {29381#(<= main_~i~0 35)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29382#(<= main_~i~0 36)} is VALID [2022-04-28 02:50:20,755 INFO L290 TraceCheckUtils]: 78: Hoare triple {29382#(<= main_~i~0 36)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29382#(<= main_~i~0 36)} is VALID [2022-04-28 02:50:20,756 INFO L290 TraceCheckUtils]: 79: Hoare triple {29382#(<= main_~i~0 36)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29383#(<= main_~i~0 37)} is VALID [2022-04-28 02:50:20,756 INFO L290 TraceCheckUtils]: 80: Hoare triple {29383#(<= main_~i~0 37)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29383#(<= main_~i~0 37)} is VALID [2022-04-28 02:50:20,756 INFO L290 TraceCheckUtils]: 81: Hoare triple {29383#(<= main_~i~0 37)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29384#(<= main_~i~0 38)} is VALID [2022-04-28 02:50:20,757 INFO L290 TraceCheckUtils]: 82: Hoare triple {29384#(<= main_~i~0 38)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29384#(<= main_~i~0 38)} is VALID [2022-04-28 02:50:20,757 INFO L290 TraceCheckUtils]: 83: Hoare triple {29384#(<= main_~i~0 38)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29385#(<= main_~i~0 39)} is VALID [2022-04-28 02:50:20,757 INFO L290 TraceCheckUtils]: 84: Hoare triple {29385#(<= main_~i~0 39)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29385#(<= main_~i~0 39)} is VALID [2022-04-28 02:50:20,757 INFO L290 TraceCheckUtils]: 85: Hoare triple {29385#(<= main_~i~0 39)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29386#(<= main_~i~0 40)} is VALID [2022-04-28 02:50:20,758 INFO L290 TraceCheckUtils]: 86: Hoare triple {29386#(<= main_~i~0 40)} assume !(~i~0 < 1024); {29342#false} is VALID [2022-04-28 02:50:20,758 INFO L290 TraceCheckUtils]: 87: Hoare triple {29342#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {29342#false} is VALID [2022-04-28 02:50:20,758 INFO L272 TraceCheckUtils]: 88: Hoare triple {29342#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {29342#false} is VALID [2022-04-28 02:50:20,758 INFO L290 TraceCheckUtils]: 89: Hoare triple {29342#false} ~cond := #in~cond; {29342#false} is VALID [2022-04-28 02:50:20,758 INFO L290 TraceCheckUtils]: 90: Hoare triple {29342#false} assume 0 == ~cond; {29342#false} is VALID [2022-04-28 02:50:20,758 INFO L290 TraceCheckUtils]: 91: Hoare triple {29342#false} assume !false; {29342#false} is VALID [2022-04-28 02:50:20,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:50:20,758 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:50:22,813 INFO L290 TraceCheckUtils]: 91: Hoare triple {29342#false} assume !false; {29342#false} is VALID [2022-04-28 02:50:22,813 INFO L290 TraceCheckUtils]: 90: Hoare triple {29342#false} assume 0 == ~cond; {29342#false} is VALID [2022-04-28 02:50:22,813 INFO L290 TraceCheckUtils]: 89: Hoare triple {29342#false} ~cond := #in~cond; {29342#false} is VALID [2022-04-28 02:50:22,813 INFO L272 TraceCheckUtils]: 88: Hoare triple {29342#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {29342#false} is VALID [2022-04-28 02:50:22,813 INFO L290 TraceCheckUtils]: 87: Hoare triple {29342#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {29342#false} is VALID [2022-04-28 02:50:22,814 INFO L290 TraceCheckUtils]: 86: Hoare triple {29680#(< main_~i~0 1024)} assume !(~i~0 < 1024); {29342#false} is VALID [2022-04-28 02:50:22,814 INFO L290 TraceCheckUtils]: 85: Hoare triple {29684#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29680#(< main_~i~0 1024)} is VALID [2022-04-28 02:50:22,814 INFO L290 TraceCheckUtils]: 84: Hoare triple {29684#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29684#(< main_~i~0 1023)} is VALID [2022-04-28 02:50:22,815 INFO L290 TraceCheckUtils]: 83: Hoare triple {29691#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29684#(< main_~i~0 1023)} is VALID [2022-04-28 02:50:22,815 INFO L290 TraceCheckUtils]: 82: Hoare triple {29691#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29691#(< main_~i~0 1022)} is VALID [2022-04-28 02:50:22,815 INFO L290 TraceCheckUtils]: 81: Hoare triple {29698#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29691#(< main_~i~0 1022)} is VALID [2022-04-28 02:50:22,815 INFO L290 TraceCheckUtils]: 80: Hoare triple {29698#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29698#(< main_~i~0 1021)} is VALID [2022-04-28 02:50:22,816 INFO L290 TraceCheckUtils]: 79: Hoare triple {29705#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29698#(< main_~i~0 1021)} is VALID [2022-04-28 02:50:22,816 INFO L290 TraceCheckUtils]: 78: Hoare triple {29705#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29705#(< main_~i~0 1020)} is VALID [2022-04-28 02:50:22,816 INFO L290 TraceCheckUtils]: 77: Hoare triple {29712#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29705#(< main_~i~0 1020)} is VALID [2022-04-28 02:50:22,817 INFO L290 TraceCheckUtils]: 76: Hoare triple {29712#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29712#(< main_~i~0 1019)} is VALID [2022-04-28 02:50:22,817 INFO L290 TraceCheckUtils]: 75: Hoare triple {29719#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29712#(< main_~i~0 1019)} is VALID [2022-04-28 02:50:22,817 INFO L290 TraceCheckUtils]: 74: Hoare triple {29719#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29719#(< main_~i~0 1018)} is VALID [2022-04-28 02:50:22,818 INFO L290 TraceCheckUtils]: 73: Hoare triple {29726#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29719#(< main_~i~0 1018)} is VALID [2022-04-28 02:50:22,818 INFO L290 TraceCheckUtils]: 72: Hoare triple {29726#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29726#(< main_~i~0 1017)} is VALID [2022-04-28 02:50:22,818 INFO L290 TraceCheckUtils]: 71: Hoare triple {29733#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29726#(< main_~i~0 1017)} is VALID [2022-04-28 02:50:22,819 INFO L290 TraceCheckUtils]: 70: Hoare triple {29733#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29733#(< main_~i~0 1016)} is VALID [2022-04-28 02:50:22,819 INFO L290 TraceCheckUtils]: 69: Hoare triple {29740#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29733#(< main_~i~0 1016)} is VALID [2022-04-28 02:50:22,819 INFO L290 TraceCheckUtils]: 68: Hoare triple {29740#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29740#(< main_~i~0 1015)} is VALID [2022-04-28 02:50:22,819 INFO L290 TraceCheckUtils]: 67: Hoare triple {29747#(< main_~i~0 1014)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29740#(< main_~i~0 1015)} is VALID [2022-04-28 02:50:22,820 INFO L290 TraceCheckUtils]: 66: Hoare triple {29747#(< main_~i~0 1014)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29747#(< main_~i~0 1014)} is VALID [2022-04-28 02:50:22,820 INFO L290 TraceCheckUtils]: 65: Hoare triple {29754#(< main_~i~0 1013)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29747#(< main_~i~0 1014)} is VALID [2022-04-28 02:50:22,820 INFO L290 TraceCheckUtils]: 64: Hoare triple {29754#(< main_~i~0 1013)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29754#(< main_~i~0 1013)} is VALID [2022-04-28 02:50:22,821 INFO L290 TraceCheckUtils]: 63: Hoare triple {29761#(< main_~i~0 1012)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29754#(< main_~i~0 1013)} is VALID [2022-04-28 02:50:22,821 INFO L290 TraceCheckUtils]: 62: Hoare triple {29761#(< main_~i~0 1012)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29761#(< main_~i~0 1012)} is VALID [2022-04-28 02:50:22,821 INFO L290 TraceCheckUtils]: 61: Hoare triple {29768#(< main_~i~0 1011)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29761#(< main_~i~0 1012)} is VALID [2022-04-28 02:50:22,822 INFO L290 TraceCheckUtils]: 60: Hoare triple {29768#(< main_~i~0 1011)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29768#(< main_~i~0 1011)} is VALID [2022-04-28 02:50:22,822 INFO L290 TraceCheckUtils]: 59: Hoare triple {29775#(< main_~i~0 1010)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29768#(< main_~i~0 1011)} is VALID [2022-04-28 02:50:22,822 INFO L290 TraceCheckUtils]: 58: Hoare triple {29775#(< main_~i~0 1010)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29775#(< main_~i~0 1010)} is VALID [2022-04-28 02:50:22,823 INFO L290 TraceCheckUtils]: 57: Hoare triple {29782#(< main_~i~0 1009)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29775#(< main_~i~0 1010)} is VALID [2022-04-28 02:50:22,823 INFO L290 TraceCheckUtils]: 56: Hoare triple {29782#(< main_~i~0 1009)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29782#(< main_~i~0 1009)} is VALID [2022-04-28 02:50:22,823 INFO L290 TraceCheckUtils]: 55: Hoare triple {29789#(< main_~i~0 1008)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29782#(< main_~i~0 1009)} is VALID [2022-04-28 02:50:22,823 INFO L290 TraceCheckUtils]: 54: Hoare triple {29789#(< main_~i~0 1008)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29789#(< main_~i~0 1008)} is VALID [2022-04-28 02:50:22,824 INFO L290 TraceCheckUtils]: 53: Hoare triple {29796#(< main_~i~0 1007)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29789#(< main_~i~0 1008)} is VALID [2022-04-28 02:50:22,824 INFO L290 TraceCheckUtils]: 52: Hoare triple {29796#(< main_~i~0 1007)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29796#(< main_~i~0 1007)} is VALID [2022-04-28 02:50:22,824 INFO L290 TraceCheckUtils]: 51: Hoare triple {29803#(< main_~i~0 1006)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29796#(< main_~i~0 1007)} is VALID [2022-04-28 02:50:22,825 INFO L290 TraceCheckUtils]: 50: Hoare triple {29803#(< main_~i~0 1006)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29803#(< main_~i~0 1006)} is VALID [2022-04-28 02:50:22,825 INFO L290 TraceCheckUtils]: 49: Hoare triple {29810#(< main_~i~0 1005)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29803#(< main_~i~0 1006)} is VALID [2022-04-28 02:50:22,825 INFO L290 TraceCheckUtils]: 48: Hoare triple {29810#(< main_~i~0 1005)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29810#(< main_~i~0 1005)} is VALID [2022-04-28 02:50:22,826 INFO L290 TraceCheckUtils]: 47: Hoare triple {29817#(< main_~i~0 1004)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29810#(< main_~i~0 1005)} is VALID [2022-04-28 02:50:22,826 INFO L290 TraceCheckUtils]: 46: Hoare triple {29817#(< main_~i~0 1004)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29817#(< main_~i~0 1004)} is VALID [2022-04-28 02:50:22,826 INFO L290 TraceCheckUtils]: 45: Hoare triple {29824#(< main_~i~0 1003)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29817#(< main_~i~0 1004)} is VALID [2022-04-28 02:50:22,827 INFO L290 TraceCheckUtils]: 44: Hoare triple {29824#(< main_~i~0 1003)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29824#(< main_~i~0 1003)} is VALID [2022-04-28 02:50:22,827 INFO L290 TraceCheckUtils]: 43: Hoare triple {29831#(< main_~i~0 1002)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29824#(< main_~i~0 1003)} is VALID [2022-04-28 02:50:22,827 INFO L290 TraceCheckUtils]: 42: Hoare triple {29831#(< main_~i~0 1002)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29831#(< main_~i~0 1002)} is VALID [2022-04-28 02:50:22,828 INFO L290 TraceCheckUtils]: 41: Hoare triple {29838#(< main_~i~0 1001)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29831#(< main_~i~0 1002)} is VALID [2022-04-28 02:50:22,828 INFO L290 TraceCheckUtils]: 40: Hoare triple {29838#(< main_~i~0 1001)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29838#(< main_~i~0 1001)} is VALID [2022-04-28 02:50:22,828 INFO L290 TraceCheckUtils]: 39: Hoare triple {29845#(< main_~i~0 1000)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29838#(< main_~i~0 1001)} is VALID [2022-04-28 02:50:22,828 INFO L290 TraceCheckUtils]: 38: Hoare triple {29845#(< main_~i~0 1000)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29845#(< main_~i~0 1000)} is VALID [2022-04-28 02:50:22,829 INFO L290 TraceCheckUtils]: 37: Hoare triple {29852#(< main_~i~0 999)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29845#(< main_~i~0 1000)} is VALID [2022-04-28 02:50:22,829 INFO L290 TraceCheckUtils]: 36: Hoare triple {29852#(< main_~i~0 999)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29852#(< main_~i~0 999)} is VALID [2022-04-28 02:50:22,829 INFO L290 TraceCheckUtils]: 35: Hoare triple {29859#(< main_~i~0 998)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29852#(< main_~i~0 999)} is VALID [2022-04-28 02:50:22,830 INFO L290 TraceCheckUtils]: 34: Hoare triple {29859#(< main_~i~0 998)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29859#(< main_~i~0 998)} is VALID [2022-04-28 02:50:22,830 INFO L290 TraceCheckUtils]: 33: Hoare triple {29866#(< main_~i~0 997)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29859#(< main_~i~0 998)} is VALID [2022-04-28 02:50:22,830 INFO L290 TraceCheckUtils]: 32: Hoare triple {29866#(< main_~i~0 997)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29866#(< main_~i~0 997)} is VALID [2022-04-28 02:50:22,831 INFO L290 TraceCheckUtils]: 31: Hoare triple {29873#(< main_~i~0 996)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29866#(< main_~i~0 997)} is VALID [2022-04-28 02:50:22,831 INFO L290 TraceCheckUtils]: 30: Hoare triple {29873#(< main_~i~0 996)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29873#(< main_~i~0 996)} is VALID [2022-04-28 02:50:22,831 INFO L290 TraceCheckUtils]: 29: Hoare triple {29880#(< main_~i~0 995)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29873#(< main_~i~0 996)} is VALID [2022-04-28 02:50:22,832 INFO L290 TraceCheckUtils]: 28: Hoare triple {29880#(< main_~i~0 995)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29880#(< main_~i~0 995)} is VALID [2022-04-28 02:50:22,832 INFO L290 TraceCheckUtils]: 27: Hoare triple {29887#(< main_~i~0 994)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29880#(< main_~i~0 995)} is VALID [2022-04-28 02:50:22,832 INFO L290 TraceCheckUtils]: 26: Hoare triple {29887#(< main_~i~0 994)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29887#(< main_~i~0 994)} is VALID [2022-04-28 02:50:22,833 INFO L290 TraceCheckUtils]: 25: Hoare triple {29894#(< main_~i~0 993)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29887#(< main_~i~0 994)} is VALID [2022-04-28 02:50:22,833 INFO L290 TraceCheckUtils]: 24: Hoare triple {29894#(< main_~i~0 993)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29894#(< main_~i~0 993)} is VALID [2022-04-28 02:50:22,833 INFO L290 TraceCheckUtils]: 23: Hoare triple {29901#(< main_~i~0 992)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29894#(< main_~i~0 993)} is VALID [2022-04-28 02:50:22,833 INFO L290 TraceCheckUtils]: 22: Hoare triple {29901#(< main_~i~0 992)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29901#(< main_~i~0 992)} is VALID [2022-04-28 02:50:22,834 INFO L290 TraceCheckUtils]: 21: Hoare triple {29908#(< main_~i~0 991)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29901#(< main_~i~0 992)} is VALID [2022-04-28 02:50:22,834 INFO L290 TraceCheckUtils]: 20: Hoare triple {29908#(< main_~i~0 991)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29908#(< main_~i~0 991)} is VALID [2022-04-28 02:50:22,834 INFO L290 TraceCheckUtils]: 19: Hoare triple {29915#(< main_~i~0 990)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29908#(< main_~i~0 991)} is VALID [2022-04-28 02:50:22,835 INFO L290 TraceCheckUtils]: 18: Hoare triple {29915#(< main_~i~0 990)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29915#(< main_~i~0 990)} is VALID [2022-04-28 02:50:22,835 INFO L290 TraceCheckUtils]: 17: Hoare triple {29922#(< main_~i~0 989)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29915#(< main_~i~0 990)} is VALID [2022-04-28 02:50:22,835 INFO L290 TraceCheckUtils]: 16: Hoare triple {29922#(< main_~i~0 989)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29922#(< main_~i~0 989)} is VALID [2022-04-28 02:50:22,836 INFO L290 TraceCheckUtils]: 15: Hoare triple {29929#(< main_~i~0 988)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29922#(< main_~i~0 989)} is VALID [2022-04-28 02:50:22,836 INFO L290 TraceCheckUtils]: 14: Hoare triple {29929#(< main_~i~0 988)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29929#(< main_~i~0 988)} is VALID [2022-04-28 02:50:22,836 INFO L290 TraceCheckUtils]: 13: Hoare triple {29936#(< main_~i~0 987)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29929#(< main_~i~0 988)} is VALID [2022-04-28 02:50:22,836 INFO L290 TraceCheckUtils]: 12: Hoare triple {29936#(< main_~i~0 987)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29936#(< main_~i~0 987)} is VALID [2022-04-28 02:50:22,837 INFO L290 TraceCheckUtils]: 11: Hoare triple {29943#(< main_~i~0 986)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29936#(< main_~i~0 987)} is VALID [2022-04-28 02:50:22,837 INFO L290 TraceCheckUtils]: 10: Hoare triple {29943#(< main_~i~0 986)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29943#(< main_~i~0 986)} is VALID [2022-04-28 02:50:22,837 INFO L290 TraceCheckUtils]: 9: Hoare triple {29950#(< main_~i~0 985)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29943#(< main_~i~0 986)} is VALID [2022-04-28 02:50:22,838 INFO L290 TraceCheckUtils]: 8: Hoare triple {29950#(< main_~i~0 985)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29950#(< main_~i~0 985)} is VALID [2022-04-28 02:50:22,838 INFO L290 TraceCheckUtils]: 7: Hoare triple {29957#(< main_~i~0 984)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29950#(< main_~i~0 985)} is VALID [2022-04-28 02:50:22,838 INFO L290 TraceCheckUtils]: 6: Hoare triple {29957#(< main_~i~0 984)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29957#(< main_~i~0 984)} is VALID [2022-04-28 02:50:22,839 INFO L290 TraceCheckUtils]: 5: Hoare triple {29341#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {29957#(< main_~i~0 984)} is VALID [2022-04-28 02:50:22,839 INFO L272 TraceCheckUtils]: 4: Hoare triple {29341#true} call #t~ret6 := main(); {29341#true} is VALID [2022-04-28 02:50:22,839 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29341#true} {29341#true} #39#return; {29341#true} is VALID [2022-04-28 02:50:22,839 INFO L290 TraceCheckUtils]: 2: Hoare triple {29341#true} assume true; {29341#true} is VALID [2022-04-28 02:50:22,839 INFO L290 TraceCheckUtils]: 1: Hoare triple {29341#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {29341#true} is VALID [2022-04-28 02:50:22,839 INFO L272 TraceCheckUtils]: 0: Hoare triple {29341#true} call ULTIMATE.init(); {29341#true} is VALID [2022-04-28 02:50:22,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:50:22,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1390636558] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:50:22,839 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:50:22,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 43, 43] total 86 [2022-04-28 02:50:22,840 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:50:22,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [928963187] [2022-04-28 02:50:22,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [928963187] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:50:22,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:50:22,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2022-04-28 02:50:22,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409090832] [2022-04-28 02:50:22,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:50:22,840 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.0) internal successors, (88), 43 states have internal predecessors, (88), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2022-04-28 02:50:22,840 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:50:22,841 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 44 states, 44 states have (on average 2.0) internal successors, (88), 43 states have internal predecessors, (88), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:50:22,897 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:50:22,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-04-28 02:50:22,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:50:22,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-04-28 02:50:22,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3572, Invalid=3738, Unknown=0, NotChecked=0, Total=7310 [2022-04-28 02:50:22,899 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand has 44 states, 44 states have (on average 2.0) internal successors, (88), 43 states have internal predecessors, (88), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:50:24,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:50:24,229 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2022-04-28 02:50:24,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-04-28 02:50:24,229 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.0) internal successors, (88), 43 states have internal predecessors, (88), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2022-04-28 02:50:24,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:50:24,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 2.0) internal successors, (88), 43 states have internal predecessors, (88), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:50:24,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 102 transitions. [2022-04-28 02:50:24,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 2.0) internal successors, (88), 43 states have internal predecessors, (88), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:50:24,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 102 transitions. [2022-04-28 02:50:24,231 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 102 transitions. [2022-04-28 02:50:24,303 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:50:24,304 INFO L225 Difference]: With dead ends: 102 [2022-04-28 02:50:24,304 INFO L226 Difference]: Without dead ends: 96 [2022-04-28 02:50:24,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1059 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=7058, Invalid=8944, Unknown=0, NotChecked=0, Total=16002 [2022-04-28 02:50:24,305 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 90 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:50:24,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 39 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:50:24,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-28 02:50:24,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2022-04-28 02:50:24,675 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:50:24,675 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand has 95 states, 90 states have (on average 1.011111111111111) internal successors, (91), 90 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:50:24,675 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand has 95 states, 90 states have (on average 1.011111111111111) internal successors, (91), 90 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:50:24,675 INFO L87 Difference]: Start difference. First operand 96 states. Second operand has 95 states, 90 states have (on average 1.011111111111111) internal successors, (91), 90 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:50:24,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:50:24,676 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2022-04-28 02:50:24,676 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2022-04-28 02:50:24,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:50:24,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:50:24,676 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 90 states have (on average 1.011111111111111) internal successors, (91), 90 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 96 states. [2022-04-28 02:50:24,676 INFO L87 Difference]: Start difference. First operand has 95 states, 90 states have (on average 1.011111111111111) internal successors, (91), 90 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 96 states. [2022-04-28 02:50:24,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:50:24,677 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2022-04-28 02:50:24,677 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2022-04-28 02:50:24,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:50:24,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:50:24,678 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:50:24,678 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:50:24,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 90 states have (on average 1.011111111111111) internal successors, (91), 90 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:50:24,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2022-04-28 02:50:24,679 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 92 [2022-04-28 02:50:24,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:50:24,679 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2022-04-28 02:50:24,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.0) internal successors, (88), 43 states have internal predecessors, (88), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:50:24,679 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 95 states and 95 transitions. [2022-04-28 02:50:24,802 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:50:24,802 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2022-04-28 02:50:24,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-04-28 02:50:24,803 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:50:24,803 INFO L195 NwaCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:50:24,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2022-04-28 02:50:25,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2022-04-28 02:50:25,003 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:50:25,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:50:25,004 INFO L85 PathProgramCache]: Analyzing trace with hash 231736012, now seen corresponding path program 81 times [2022-04-28 02:50:25,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:50:25,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1503183719] [2022-04-28 02:50:25,008 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:50:25,008 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:50:25,008 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:50:25,008 INFO L85 PathProgramCache]: Analyzing trace with hash 231736012, now seen corresponding path program 82 times [2022-04-28 02:50:25,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:50:25,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566941345] [2022-04-28 02:50:25,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:50:25,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:50:25,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:50:25,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:50:25,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:50:25,747 INFO L290 TraceCheckUtils]: 0: Hoare triple {30696#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {30649#true} is VALID [2022-04-28 02:50:25,747 INFO L290 TraceCheckUtils]: 1: Hoare triple {30649#true} assume true; {30649#true} is VALID [2022-04-28 02:50:25,747 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30649#true} {30649#true} #39#return; {30649#true} is VALID [2022-04-28 02:50:25,748 INFO L272 TraceCheckUtils]: 0: Hoare triple {30649#true} call ULTIMATE.init(); {30696#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:50:25,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {30696#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {30649#true} is VALID [2022-04-28 02:50:25,748 INFO L290 TraceCheckUtils]: 2: Hoare triple {30649#true} assume true; {30649#true} is VALID [2022-04-28 02:50:25,748 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30649#true} {30649#true} #39#return; {30649#true} is VALID [2022-04-28 02:50:25,748 INFO L272 TraceCheckUtils]: 4: Hoare triple {30649#true} call #t~ret6 := main(); {30649#true} is VALID [2022-04-28 02:50:25,748 INFO L290 TraceCheckUtils]: 5: Hoare triple {30649#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {30654#(= main_~i~0 0)} is VALID [2022-04-28 02:50:25,748 INFO L290 TraceCheckUtils]: 6: Hoare triple {30654#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30654#(= main_~i~0 0)} is VALID [2022-04-28 02:50:25,749 INFO L290 TraceCheckUtils]: 7: Hoare triple {30654#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30655#(<= main_~i~0 1)} is VALID [2022-04-28 02:50:25,749 INFO L290 TraceCheckUtils]: 8: Hoare triple {30655#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30655#(<= main_~i~0 1)} is VALID [2022-04-28 02:50:25,749 INFO L290 TraceCheckUtils]: 9: Hoare triple {30655#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30656#(<= main_~i~0 2)} is VALID [2022-04-28 02:50:25,749 INFO L290 TraceCheckUtils]: 10: Hoare triple {30656#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30656#(<= main_~i~0 2)} is VALID [2022-04-28 02:50:25,750 INFO L290 TraceCheckUtils]: 11: Hoare triple {30656#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30657#(<= main_~i~0 3)} is VALID [2022-04-28 02:50:25,750 INFO L290 TraceCheckUtils]: 12: Hoare triple {30657#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30657#(<= main_~i~0 3)} is VALID [2022-04-28 02:50:25,750 INFO L290 TraceCheckUtils]: 13: Hoare triple {30657#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30658#(<= main_~i~0 4)} is VALID [2022-04-28 02:50:25,751 INFO L290 TraceCheckUtils]: 14: Hoare triple {30658#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30658#(<= main_~i~0 4)} is VALID [2022-04-28 02:50:25,751 INFO L290 TraceCheckUtils]: 15: Hoare triple {30658#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30659#(<= main_~i~0 5)} is VALID [2022-04-28 02:50:25,751 INFO L290 TraceCheckUtils]: 16: Hoare triple {30659#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30659#(<= main_~i~0 5)} is VALID [2022-04-28 02:50:25,752 INFO L290 TraceCheckUtils]: 17: Hoare triple {30659#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30660#(<= main_~i~0 6)} is VALID [2022-04-28 02:50:25,752 INFO L290 TraceCheckUtils]: 18: Hoare triple {30660#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30660#(<= main_~i~0 6)} is VALID [2022-04-28 02:50:25,752 INFO L290 TraceCheckUtils]: 19: Hoare triple {30660#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30661#(<= main_~i~0 7)} is VALID [2022-04-28 02:50:25,752 INFO L290 TraceCheckUtils]: 20: Hoare triple {30661#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30661#(<= main_~i~0 7)} is VALID [2022-04-28 02:50:25,753 INFO L290 TraceCheckUtils]: 21: Hoare triple {30661#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30662#(<= main_~i~0 8)} is VALID [2022-04-28 02:50:25,753 INFO L290 TraceCheckUtils]: 22: Hoare triple {30662#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30662#(<= main_~i~0 8)} is VALID [2022-04-28 02:50:25,753 INFO L290 TraceCheckUtils]: 23: Hoare triple {30662#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30663#(<= main_~i~0 9)} is VALID [2022-04-28 02:50:25,754 INFO L290 TraceCheckUtils]: 24: Hoare triple {30663#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30663#(<= main_~i~0 9)} is VALID [2022-04-28 02:50:25,754 INFO L290 TraceCheckUtils]: 25: Hoare triple {30663#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30664#(<= main_~i~0 10)} is VALID [2022-04-28 02:50:25,754 INFO L290 TraceCheckUtils]: 26: Hoare triple {30664#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30664#(<= main_~i~0 10)} is VALID [2022-04-28 02:50:25,755 INFO L290 TraceCheckUtils]: 27: Hoare triple {30664#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30665#(<= main_~i~0 11)} is VALID [2022-04-28 02:50:25,755 INFO L290 TraceCheckUtils]: 28: Hoare triple {30665#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30665#(<= main_~i~0 11)} is VALID [2022-04-28 02:50:25,755 INFO L290 TraceCheckUtils]: 29: Hoare triple {30665#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30666#(<= main_~i~0 12)} is VALID [2022-04-28 02:50:25,755 INFO L290 TraceCheckUtils]: 30: Hoare triple {30666#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30666#(<= main_~i~0 12)} is VALID [2022-04-28 02:50:25,756 INFO L290 TraceCheckUtils]: 31: Hoare triple {30666#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30667#(<= main_~i~0 13)} is VALID [2022-04-28 02:50:25,756 INFO L290 TraceCheckUtils]: 32: Hoare triple {30667#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30667#(<= main_~i~0 13)} is VALID [2022-04-28 02:50:25,756 INFO L290 TraceCheckUtils]: 33: Hoare triple {30667#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30668#(<= main_~i~0 14)} is VALID [2022-04-28 02:50:25,757 INFO L290 TraceCheckUtils]: 34: Hoare triple {30668#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30668#(<= main_~i~0 14)} is VALID [2022-04-28 02:50:25,757 INFO L290 TraceCheckUtils]: 35: Hoare triple {30668#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30669#(<= main_~i~0 15)} is VALID [2022-04-28 02:50:25,757 INFO L290 TraceCheckUtils]: 36: Hoare triple {30669#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30669#(<= main_~i~0 15)} is VALID [2022-04-28 02:50:25,758 INFO L290 TraceCheckUtils]: 37: Hoare triple {30669#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30670#(<= main_~i~0 16)} is VALID [2022-04-28 02:50:25,758 INFO L290 TraceCheckUtils]: 38: Hoare triple {30670#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30670#(<= main_~i~0 16)} is VALID [2022-04-28 02:50:25,758 INFO L290 TraceCheckUtils]: 39: Hoare triple {30670#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30671#(<= main_~i~0 17)} is VALID [2022-04-28 02:50:25,758 INFO L290 TraceCheckUtils]: 40: Hoare triple {30671#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30671#(<= main_~i~0 17)} is VALID [2022-04-28 02:50:25,759 INFO L290 TraceCheckUtils]: 41: Hoare triple {30671#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30672#(<= main_~i~0 18)} is VALID [2022-04-28 02:50:25,759 INFO L290 TraceCheckUtils]: 42: Hoare triple {30672#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30672#(<= main_~i~0 18)} is VALID [2022-04-28 02:50:25,759 INFO L290 TraceCheckUtils]: 43: Hoare triple {30672#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30673#(<= main_~i~0 19)} is VALID [2022-04-28 02:50:25,760 INFO L290 TraceCheckUtils]: 44: Hoare triple {30673#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30673#(<= main_~i~0 19)} is VALID [2022-04-28 02:50:25,760 INFO L290 TraceCheckUtils]: 45: Hoare triple {30673#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30674#(<= main_~i~0 20)} is VALID [2022-04-28 02:50:25,760 INFO L290 TraceCheckUtils]: 46: Hoare triple {30674#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30674#(<= main_~i~0 20)} is VALID [2022-04-28 02:50:25,761 INFO L290 TraceCheckUtils]: 47: Hoare triple {30674#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30675#(<= main_~i~0 21)} is VALID [2022-04-28 02:50:25,761 INFO L290 TraceCheckUtils]: 48: Hoare triple {30675#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30675#(<= main_~i~0 21)} is VALID [2022-04-28 02:50:25,761 INFO L290 TraceCheckUtils]: 49: Hoare triple {30675#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30676#(<= main_~i~0 22)} is VALID [2022-04-28 02:50:25,761 INFO L290 TraceCheckUtils]: 50: Hoare triple {30676#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30676#(<= main_~i~0 22)} is VALID [2022-04-28 02:50:25,762 INFO L290 TraceCheckUtils]: 51: Hoare triple {30676#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30677#(<= main_~i~0 23)} is VALID [2022-04-28 02:50:25,762 INFO L290 TraceCheckUtils]: 52: Hoare triple {30677#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30677#(<= main_~i~0 23)} is VALID [2022-04-28 02:50:25,762 INFO L290 TraceCheckUtils]: 53: Hoare triple {30677#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30678#(<= main_~i~0 24)} is VALID [2022-04-28 02:50:25,763 INFO L290 TraceCheckUtils]: 54: Hoare triple {30678#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30678#(<= main_~i~0 24)} is VALID [2022-04-28 02:50:25,763 INFO L290 TraceCheckUtils]: 55: Hoare triple {30678#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30679#(<= main_~i~0 25)} is VALID [2022-04-28 02:50:25,763 INFO L290 TraceCheckUtils]: 56: Hoare triple {30679#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30679#(<= main_~i~0 25)} is VALID [2022-04-28 02:50:25,764 INFO L290 TraceCheckUtils]: 57: Hoare triple {30679#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30680#(<= main_~i~0 26)} is VALID [2022-04-28 02:50:25,764 INFO L290 TraceCheckUtils]: 58: Hoare triple {30680#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30680#(<= main_~i~0 26)} is VALID [2022-04-28 02:50:25,764 INFO L290 TraceCheckUtils]: 59: Hoare triple {30680#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30681#(<= main_~i~0 27)} is VALID [2022-04-28 02:50:25,764 INFO L290 TraceCheckUtils]: 60: Hoare triple {30681#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30681#(<= main_~i~0 27)} is VALID [2022-04-28 02:50:25,765 INFO L290 TraceCheckUtils]: 61: Hoare triple {30681#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30682#(<= main_~i~0 28)} is VALID [2022-04-28 02:50:25,765 INFO L290 TraceCheckUtils]: 62: Hoare triple {30682#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30682#(<= main_~i~0 28)} is VALID [2022-04-28 02:50:25,765 INFO L290 TraceCheckUtils]: 63: Hoare triple {30682#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30683#(<= main_~i~0 29)} is VALID [2022-04-28 02:50:25,766 INFO L290 TraceCheckUtils]: 64: Hoare triple {30683#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30683#(<= main_~i~0 29)} is VALID [2022-04-28 02:50:25,766 INFO L290 TraceCheckUtils]: 65: Hoare triple {30683#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30684#(<= main_~i~0 30)} is VALID [2022-04-28 02:50:25,766 INFO L290 TraceCheckUtils]: 66: Hoare triple {30684#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30684#(<= main_~i~0 30)} is VALID [2022-04-28 02:50:25,767 INFO L290 TraceCheckUtils]: 67: Hoare triple {30684#(<= main_~i~0 30)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30685#(<= main_~i~0 31)} is VALID [2022-04-28 02:50:25,767 INFO L290 TraceCheckUtils]: 68: Hoare triple {30685#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30685#(<= main_~i~0 31)} is VALID [2022-04-28 02:50:25,767 INFO L290 TraceCheckUtils]: 69: Hoare triple {30685#(<= main_~i~0 31)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30686#(<= main_~i~0 32)} is VALID [2022-04-28 02:50:25,767 INFO L290 TraceCheckUtils]: 70: Hoare triple {30686#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30686#(<= main_~i~0 32)} is VALID [2022-04-28 02:50:25,768 INFO L290 TraceCheckUtils]: 71: Hoare triple {30686#(<= main_~i~0 32)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30687#(<= main_~i~0 33)} is VALID [2022-04-28 02:50:25,768 INFO L290 TraceCheckUtils]: 72: Hoare triple {30687#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30687#(<= main_~i~0 33)} is VALID [2022-04-28 02:50:25,768 INFO L290 TraceCheckUtils]: 73: Hoare triple {30687#(<= main_~i~0 33)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30688#(<= main_~i~0 34)} is VALID [2022-04-28 02:50:25,769 INFO L290 TraceCheckUtils]: 74: Hoare triple {30688#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30688#(<= main_~i~0 34)} is VALID [2022-04-28 02:50:25,769 INFO L290 TraceCheckUtils]: 75: Hoare triple {30688#(<= main_~i~0 34)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30689#(<= main_~i~0 35)} is VALID [2022-04-28 02:50:25,769 INFO L290 TraceCheckUtils]: 76: Hoare triple {30689#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30689#(<= main_~i~0 35)} is VALID [2022-04-28 02:50:25,770 INFO L290 TraceCheckUtils]: 77: Hoare triple {30689#(<= main_~i~0 35)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30690#(<= main_~i~0 36)} is VALID [2022-04-28 02:50:25,770 INFO L290 TraceCheckUtils]: 78: Hoare triple {30690#(<= main_~i~0 36)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30690#(<= main_~i~0 36)} is VALID [2022-04-28 02:50:25,770 INFO L290 TraceCheckUtils]: 79: Hoare triple {30690#(<= main_~i~0 36)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30691#(<= main_~i~0 37)} is VALID [2022-04-28 02:50:25,770 INFO L290 TraceCheckUtils]: 80: Hoare triple {30691#(<= main_~i~0 37)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30691#(<= main_~i~0 37)} is VALID [2022-04-28 02:50:25,771 INFO L290 TraceCheckUtils]: 81: Hoare triple {30691#(<= main_~i~0 37)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30692#(<= main_~i~0 38)} is VALID [2022-04-28 02:50:25,771 INFO L290 TraceCheckUtils]: 82: Hoare triple {30692#(<= main_~i~0 38)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30692#(<= main_~i~0 38)} is VALID [2022-04-28 02:50:25,771 INFO L290 TraceCheckUtils]: 83: Hoare triple {30692#(<= main_~i~0 38)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30693#(<= main_~i~0 39)} is VALID [2022-04-28 02:50:25,772 INFO L290 TraceCheckUtils]: 84: Hoare triple {30693#(<= main_~i~0 39)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30693#(<= main_~i~0 39)} is VALID [2022-04-28 02:50:25,772 INFO L290 TraceCheckUtils]: 85: Hoare triple {30693#(<= main_~i~0 39)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30694#(<= main_~i~0 40)} is VALID [2022-04-28 02:50:25,772 INFO L290 TraceCheckUtils]: 86: Hoare triple {30694#(<= main_~i~0 40)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30694#(<= main_~i~0 40)} is VALID [2022-04-28 02:50:25,773 INFO L290 TraceCheckUtils]: 87: Hoare triple {30694#(<= main_~i~0 40)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30695#(<= main_~i~0 41)} is VALID [2022-04-28 02:50:25,773 INFO L290 TraceCheckUtils]: 88: Hoare triple {30695#(<= main_~i~0 41)} assume !(~i~0 < 1024); {30650#false} is VALID [2022-04-28 02:50:25,773 INFO L290 TraceCheckUtils]: 89: Hoare triple {30650#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {30650#false} is VALID [2022-04-28 02:50:25,773 INFO L272 TraceCheckUtils]: 90: Hoare triple {30650#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {30650#false} is VALID [2022-04-28 02:50:25,773 INFO L290 TraceCheckUtils]: 91: Hoare triple {30650#false} ~cond := #in~cond; {30650#false} is VALID [2022-04-28 02:50:25,773 INFO L290 TraceCheckUtils]: 92: Hoare triple {30650#false} assume 0 == ~cond; {30650#false} is VALID [2022-04-28 02:50:25,773 INFO L290 TraceCheckUtils]: 93: Hoare triple {30650#false} assume !false; {30650#false} is VALID [2022-04-28 02:50:25,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:50:25,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:50:25,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566941345] [2022-04-28 02:50:25,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566941345] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:50:25,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284461694] [2022-04-28 02:50:25,774 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 02:50:25,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:50:25,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:50:25,775 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:50:25,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-04-28 02:50:25,980 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 02:50:25,980 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:50:25,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-28 02:50:26,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:50:26,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:50:26,509 INFO L272 TraceCheckUtils]: 0: Hoare triple {30649#true} call ULTIMATE.init(); {30649#true} is VALID [2022-04-28 02:50:26,510 INFO L290 TraceCheckUtils]: 1: Hoare triple {30649#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {30649#true} is VALID [2022-04-28 02:50:26,510 INFO L290 TraceCheckUtils]: 2: Hoare triple {30649#true} assume true; {30649#true} is VALID [2022-04-28 02:50:26,510 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30649#true} {30649#true} #39#return; {30649#true} is VALID [2022-04-28 02:50:26,510 INFO L272 TraceCheckUtils]: 4: Hoare triple {30649#true} call #t~ret6 := main(); {30649#true} is VALID [2022-04-28 02:50:26,510 INFO L290 TraceCheckUtils]: 5: Hoare triple {30649#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {30715#(<= main_~i~0 0)} is VALID [2022-04-28 02:50:26,510 INFO L290 TraceCheckUtils]: 6: Hoare triple {30715#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30715#(<= main_~i~0 0)} is VALID [2022-04-28 02:50:26,511 INFO L290 TraceCheckUtils]: 7: Hoare triple {30715#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30655#(<= main_~i~0 1)} is VALID [2022-04-28 02:50:26,511 INFO L290 TraceCheckUtils]: 8: Hoare triple {30655#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30655#(<= main_~i~0 1)} is VALID [2022-04-28 02:50:26,511 INFO L290 TraceCheckUtils]: 9: Hoare triple {30655#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30656#(<= main_~i~0 2)} is VALID [2022-04-28 02:50:26,512 INFO L290 TraceCheckUtils]: 10: Hoare triple {30656#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30656#(<= main_~i~0 2)} is VALID [2022-04-28 02:50:26,512 INFO L290 TraceCheckUtils]: 11: Hoare triple {30656#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30657#(<= main_~i~0 3)} is VALID [2022-04-28 02:50:26,512 INFO L290 TraceCheckUtils]: 12: Hoare triple {30657#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30657#(<= main_~i~0 3)} is VALID [2022-04-28 02:50:26,513 INFO L290 TraceCheckUtils]: 13: Hoare triple {30657#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30658#(<= main_~i~0 4)} is VALID [2022-04-28 02:50:26,513 INFO L290 TraceCheckUtils]: 14: Hoare triple {30658#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30658#(<= main_~i~0 4)} is VALID [2022-04-28 02:50:26,513 INFO L290 TraceCheckUtils]: 15: Hoare triple {30658#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30659#(<= main_~i~0 5)} is VALID [2022-04-28 02:50:26,513 INFO L290 TraceCheckUtils]: 16: Hoare triple {30659#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30659#(<= main_~i~0 5)} is VALID [2022-04-28 02:50:26,514 INFO L290 TraceCheckUtils]: 17: Hoare triple {30659#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30660#(<= main_~i~0 6)} is VALID [2022-04-28 02:50:26,514 INFO L290 TraceCheckUtils]: 18: Hoare triple {30660#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30660#(<= main_~i~0 6)} is VALID [2022-04-28 02:50:26,514 INFO L290 TraceCheckUtils]: 19: Hoare triple {30660#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30661#(<= main_~i~0 7)} is VALID [2022-04-28 02:50:26,515 INFO L290 TraceCheckUtils]: 20: Hoare triple {30661#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30661#(<= main_~i~0 7)} is VALID [2022-04-28 02:50:26,515 INFO L290 TraceCheckUtils]: 21: Hoare triple {30661#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30662#(<= main_~i~0 8)} is VALID [2022-04-28 02:50:26,515 INFO L290 TraceCheckUtils]: 22: Hoare triple {30662#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30662#(<= main_~i~0 8)} is VALID [2022-04-28 02:50:26,516 INFO L290 TraceCheckUtils]: 23: Hoare triple {30662#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30663#(<= main_~i~0 9)} is VALID [2022-04-28 02:50:26,516 INFO L290 TraceCheckUtils]: 24: Hoare triple {30663#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30663#(<= main_~i~0 9)} is VALID [2022-04-28 02:50:26,516 INFO L290 TraceCheckUtils]: 25: Hoare triple {30663#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30664#(<= main_~i~0 10)} is VALID [2022-04-28 02:50:26,516 INFO L290 TraceCheckUtils]: 26: Hoare triple {30664#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30664#(<= main_~i~0 10)} is VALID [2022-04-28 02:50:26,517 INFO L290 TraceCheckUtils]: 27: Hoare triple {30664#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30665#(<= main_~i~0 11)} is VALID [2022-04-28 02:50:26,517 INFO L290 TraceCheckUtils]: 28: Hoare triple {30665#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30665#(<= main_~i~0 11)} is VALID [2022-04-28 02:50:26,517 INFO L290 TraceCheckUtils]: 29: Hoare triple {30665#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30666#(<= main_~i~0 12)} is VALID [2022-04-28 02:50:26,518 INFO L290 TraceCheckUtils]: 30: Hoare triple {30666#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30666#(<= main_~i~0 12)} is VALID [2022-04-28 02:50:26,518 INFO L290 TraceCheckUtils]: 31: Hoare triple {30666#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30667#(<= main_~i~0 13)} is VALID [2022-04-28 02:50:26,518 INFO L290 TraceCheckUtils]: 32: Hoare triple {30667#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30667#(<= main_~i~0 13)} is VALID [2022-04-28 02:50:26,519 INFO L290 TraceCheckUtils]: 33: Hoare triple {30667#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30668#(<= main_~i~0 14)} is VALID [2022-04-28 02:50:26,519 INFO L290 TraceCheckUtils]: 34: Hoare triple {30668#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30668#(<= main_~i~0 14)} is VALID [2022-04-28 02:50:26,519 INFO L290 TraceCheckUtils]: 35: Hoare triple {30668#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30669#(<= main_~i~0 15)} is VALID [2022-04-28 02:50:26,520 INFO L290 TraceCheckUtils]: 36: Hoare triple {30669#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30669#(<= main_~i~0 15)} is VALID [2022-04-28 02:50:26,520 INFO L290 TraceCheckUtils]: 37: Hoare triple {30669#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30670#(<= main_~i~0 16)} is VALID [2022-04-28 02:50:26,520 INFO L290 TraceCheckUtils]: 38: Hoare triple {30670#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30670#(<= main_~i~0 16)} is VALID [2022-04-28 02:50:26,520 INFO L290 TraceCheckUtils]: 39: Hoare triple {30670#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30671#(<= main_~i~0 17)} is VALID [2022-04-28 02:50:26,521 INFO L290 TraceCheckUtils]: 40: Hoare triple {30671#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30671#(<= main_~i~0 17)} is VALID [2022-04-28 02:50:26,521 INFO L290 TraceCheckUtils]: 41: Hoare triple {30671#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30672#(<= main_~i~0 18)} is VALID [2022-04-28 02:50:26,521 INFO L290 TraceCheckUtils]: 42: Hoare triple {30672#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30672#(<= main_~i~0 18)} is VALID [2022-04-28 02:50:26,522 INFO L290 TraceCheckUtils]: 43: Hoare triple {30672#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30673#(<= main_~i~0 19)} is VALID [2022-04-28 02:50:26,522 INFO L290 TraceCheckUtils]: 44: Hoare triple {30673#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30673#(<= main_~i~0 19)} is VALID [2022-04-28 02:50:26,522 INFO L290 TraceCheckUtils]: 45: Hoare triple {30673#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30674#(<= main_~i~0 20)} is VALID [2022-04-28 02:50:26,523 INFO L290 TraceCheckUtils]: 46: Hoare triple {30674#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30674#(<= main_~i~0 20)} is VALID [2022-04-28 02:50:26,523 INFO L290 TraceCheckUtils]: 47: Hoare triple {30674#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30675#(<= main_~i~0 21)} is VALID [2022-04-28 02:50:26,523 INFO L290 TraceCheckUtils]: 48: Hoare triple {30675#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30675#(<= main_~i~0 21)} is VALID [2022-04-28 02:50:26,524 INFO L290 TraceCheckUtils]: 49: Hoare triple {30675#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30676#(<= main_~i~0 22)} is VALID [2022-04-28 02:50:26,524 INFO L290 TraceCheckUtils]: 50: Hoare triple {30676#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30676#(<= main_~i~0 22)} is VALID [2022-04-28 02:50:26,524 INFO L290 TraceCheckUtils]: 51: Hoare triple {30676#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30677#(<= main_~i~0 23)} is VALID [2022-04-28 02:50:26,524 INFO L290 TraceCheckUtils]: 52: Hoare triple {30677#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30677#(<= main_~i~0 23)} is VALID [2022-04-28 02:50:26,525 INFO L290 TraceCheckUtils]: 53: Hoare triple {30677#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30678#(<= main_~i~0 24)} is VALID [2022-04-28 02:50:26,525 INFO L290 TraceCheckUtils]: 54: Hoare triple {30678#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30678#(<= main_~i~0 24)} is VALID [2022-04-28 02:50:26,525 INFO L290 TraceCheckUtils]: 55: Hoare triple {30678#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30679#(<= main_~i~0 25)} is VALID [2022-04-28 02:50:26,526 INFO L290 TraceCheckUtils]: 56: Hoare triple {30679#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30679#(<= main_~i~0 25)} is VALID [2022-04-28 02:50:26,526 INFO L290 TraceCheckUtils]: 57: Hoare triple {30679#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30680#(<= main_~i~0 26)} is VALID [2022-04-28 02:50:26,526 INFO L290 TraceCheckUtils]: 58: Hoare triple {30680#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30680#(<= main_~i~0 26)} is VALID [2022-04-28 02:50:26,527 INFO L290 TraceCheckUtils]: 59: Hoare triple {30680#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30681#(<= main_~i~0 27)} is VALID [2022-04-28 02:50:26,527 INFO L290 TraceCheckUtils]: 60: Hoare triple {30681#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30681#(<= main_~i~0 27)} is VALID [2022-04-28 02:50:26,527 INFO L290 TraceCheckUtils]: 61: Hoare triple {30681#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30682#(<= main_~i~0 28)} is VALID [2022-04-28 02:50:26,528 INFO L290 TraceCheckUtils]: 62: Hoare triple {30682#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30682#(<= main_~i~0 28)} is VALID [2022-04-28 02:50:26,528 INFO L290 TraceCheckUtils]: 63: Hoare triple {30682#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30683#(<= main_~i~0 29)} is VALID [2022-04-28 02:50:26,528 INFO L290 TraceCheckUtils]: 64: Hoare triple {30683#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30683#(<= main_~i~0 29)} is VALID [2022-04-28 02:50:26,529 INFO L290 TraceCheckUtils]: 65: Hoare triple {30683#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30684#(<= main_~i~0 30)} is VALID [2022-04-28 02:50:26,529 INFO L290 TraceCheckUtils]: 66: Hoare triple {30684#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30684#(<= main_~i~0 30)} is VALID [2022-04-28 02:50:26,529 INFO L290 TraceCheckUtils]: 67: Hoare triple {30684#(<= main_~i~0 30)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30685#(<= main_~i~0 31)} is VALID [2022-04-28 02:50:26,529 INFO L290 TraceCheckUtils]: 68: Hoare triple {30685#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30685#(<= main_~i~0 31)} is VALID [2022-04-28 02:50:26,530 INFO L290 TraceCheckUtils]: 69: Hoare triple {30685#(<= main_~i~0 31)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30686#(<= main_~i~0 32)} is VALID [2022-04-28 02:50:26,530 INFO L290 TraceCheckUtils]: 70: Hoare triple {30686#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30686#(<= main_~i~0 32)} is VALID [2022-04-28 02:50:26,530 INFO L290 TraceCheckUtils]: 71: Hoare triple {30686#(<= main_~i~0 32)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30687#(<= main_~i~0 33)} is VALID [2022-04-28 02:50:26,531 INFO L290 TraceCheckUtils]: 72: Hoare triple {30687#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30687#(<= main_~i~0 33)} is VALID [2022-04-28 02:50:26,531 INFO L290 TraceCheckUtils]: 73: Hoare triple {30687#(<= main_~i~0 33)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30688#(<= main_~i~0 34)} is VALID [2022-04-28 02:50:26,531 INFO L290 TraceCheckUtils]: 74: Hoare triple {30688#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30688#(<= main_~i~0 34)} is VALID [2022-04-28 02:50:26,532 INFO L290 TraceCheckUtils]: 75: Hoare triple {30688#(<= main_~i~0 34)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30689#(<= main_~i~0 35)} is VALID [2022-04-28 02:50:26,532 INFO L290 TraceCheckUtils]: 76: Hoare triple {30689#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30689#(<= main_~i~0 35)} is VALID [2022-04-28 02:50:26,532 INFO L290 TraceCheckUtils]: 77: Hoare triple {30689#(<= main_~i~0 35)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30690#(<= main_~i~0 36)} is VALID [2022-04-28 02:50:26,532 INFO L290 TraceCheckUtils]: 78: Hoare triple {30690#(<= main_~i~0 36)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30690#(<= main_~i~0 36)} is VALID [2022-04-28 02:50:26,533 INFO L290 TraceCheckUtils]: 79: Hoare triple {30690#(<= main_~i~0 36)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30691#(<= main_~i~0 37)} is VALID [2022-04-28 02:50:26,533 INFO L290 TraceCheckUtils]: 80: Hoare triple {30691#(<= main_~i~0 37)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30691#(<= main_~i~0 37)} is VALID [2022-04-28 02:50:26,533 INFO L290 TraceCheckUtils]: 81: Hoare triple {30691#(<= main_~i~0 37)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30692#(<= main_~i~0 38)} is VALID [2022-04-28 02:50:26,534 INFO L290 TraceCheckUtils]: 82: Hoare triple {30692#(<= main_~i~0 38)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30692#(<= main_~i~0 38)} is VALID [2022-04-28 02:50:26,534 INFO L290 TraceCheckUtils]: 83: Hoare triple {30692#(<= main_~i~0 38)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30693#(<= main_~i~0 39)} is VALID [2022-04-28 02:50:26,534 INFO L290 TraceCheckUtils]: 84: Hoare triple {30693#(<= main_~i~0 39)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30693#(<= main_~i~0 39)} is VALID [2022-04-28 02:50:26,535 INFO L290 TraceCheckUtils]: 85: Hoare triple {30693#(<= main_~i~0 39)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30694#(<= main_~i~0 40)} is VALID [2022-04-28 02:50:26,535 INFO L290 TraceCheckUtils]: 86: Hoare triple {30694#(<= main_~i~0 40)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30694#(<= main_~i~0 40)} is VALID [2022-04-28 02:50:26,535 INFO L290 TraceCheckUtils]: 87: Hoare triple {30694#(<= main_~i~0 40)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30695#(<= main_~i~0 41)} is VALID [2022-04-28 02:50:26,536 INFO L290 TraceCheckUtils]: 88: Hoare triple {30695#(<= main_~i~0 41)} assume !(~i~0 < 1024); {30650#false} is VALID [2022-04-28 02:50:26,536 INFO L290 TraceCheckUtils]: 89: Hoare triple {30650#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {30650#false} is VALID [2022-04-28 02:50:26,536 INFO L272 TraceCheckUtils]: 90: Hoare triple {30650#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {30650#false} is VALID [2022-04-28 02:50:26,536 INFO L290 TraceCheckUtils]: 91: Hoare triple {30650#false} ~cond := #in~cond; {30650#false} is VALID [2022-04-28 02:50:26,536 INFO L290 TraceCheckUtils]: 92: Hoare triple {30650#false} assume 0 == ~cond; {30650#false} is VALID [2022-04-28 02:50:26,536 INFO L290 TraceCheckUtils]: 93: Hoare triple {30650#false} assume !false; {30650#false} is VALID [2022-04-28 02:50:26,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:50:26,536 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:50:28,683 INFO L290 TraceCheckUtils]: 93: Hoare triple {30650#false} assume !false; {30650#false} is VALID [2022-04-28 02:50:28,683 INFO L290 TraceCheckUtils]: 92: Hoare triple {30650#false} assume 0 == ~cond; {30650#false} is VALID [2022-04-28 02:50:28,683 INFO L290 TraceCheckUtils]: 91: Hoare triple {30650#false} ~cond := #in~cond; {30650#false} is VALID [2022-04-28 02:50:28,683 INFO L272 TraceCheckUtils]: 90: Hoare triple {30650#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {30650#false} is VALID [2022-04-28 02:50:28,683 INFO L290 TraceCheckUtils]: 89: Hoare triple {30650#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {30650#false} is VALID [2022-04-28 02:50:28,683 INFO L290 TraceCheckUtils]: 88: Hoare triple {30995#(< main_~i~0 1024)} assume !(~i~0 < 1024); {30650#false} is VALID [2022-04-28 02:50:28,684 INFO L290 TraceCheckUtils]: 87: Hoare triple {30999#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30995#(< main_~i~0 1024)} is VALID [2022-04-28 02:50:28,684 INFO L290 TraceCheckUtils]: 86: Hoare triple {30999#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30999#(< main_~i~0 1023)} is VALID [2022-04-28 02:50:28,684 INFO L290 TraceCheckUtils]: 85: Hoare triple {31006#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30999#(< main_~i~0 1023)} is VALID [2022-04-28 02:50:28,684 INFO L290 TraceCheckUtils]: 84: Hoare triple {31006#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31006#(< main_~i~0 1022)} is VALID [2022-04-28 02:50:28,685 INFO L290 TraceCheckUtils]: 83: Hoare triple {31013#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31006#(< main_~i~0 1022)} is VALID [2022-04-28 02:50:28,685 INFO L290 TraceCheckUtils]: 82: Hoare triple {31013#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31013#(< main_~i~0 1021)} is VALID [2022-04-28 02:50:28,685 INFO L290 TraceCheckUtils]: 81: Hoare triple {31020#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31013#(< main_~i~0 1021)} is VALID [2022-04-28 02:50:28,686 INFO L290 TraceCheckUtils]: 80: Hoare triple {31020#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31020#(< main_~i~0 1020)} is VALID [2022-04-28 02:50:28,686 INFO L290 TraceCheckUtils]: 79: Hoare triple {31027#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31020#(< main_~i~0 1020)} is VALID [2022-04-28 02:50:28,686 INFO L290 TraceCheckUtils]: 78: Hoare triple {31027#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31027#(< main_~i~0 1019)} is VALID [2022-04-28 02:50:28,687 INFO L290 TraceCheckUtils]: 77: Hoare triple {31034#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31027#(< main_~i~0 1019)} is VALID [2022-04-28 02:50:28,687 INFO L290 TraceCheckUtils]: 76: Hoare triple {31034#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31034#(< main_~i~0 1018)} is VALID [2022-04-28 02:50:28,687 INFO L290 TraceCheckUtils]: 75: Hoare triple {31041#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31034#(< main_~i~0 1018)} is VALID [2022-04-28 02:50:28,688 INFO L290 TraceCheckUtils]: 74: Hoare triple {31041#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31041#(< main_~i~0 1017)} is VALID [2022-04-28 02:50:28,688 INFO L290 TraceCheckUtils]: 73: Hoare triple {31048#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31041#(< main_~i~0 1017)} is VALID [2022-04-28 02:50:28,688 INFO L290 TraceCheckUtils]: 72: Hoare triple {31048#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31048#(< main_~i~0 1016)} is VALID [2022-04-28 02:50:28,689 INFO L290 TraceCheckUtils]: 71: Hoare triple {31055#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31048#(< main_~i~0 1016)} is VALID [2022-04-28 02:50:28,689 INFO L290 TraceCheckUtils]: 70: Hoare triple {31055#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31055#(< main_~i~0 1015)} is VALID [2022-04-28 02:50:28,689 INFO L290 TraceCheckUtils]: 69: Hoare triple {31062#(< main_~i~0 1014)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31055#(< main_~i~0 1015)} is VALID [2022-04-28 02:50:28,689 INFO L290 TraceCheckUtils]: 68: Hoare triple {31062#(< main_~i~0 1014)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31062#(< main_~i~0 1014)} is VALID [2022-04-28 02:50:28,690 INFO L290 TraceCheckUtils]: 67: Hoare triple {31069#(< main_~i~0 1013)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31062#(< main_~i~0 1014)} is VALID [2022-04-28 02:50:28,690 INFO L290 TraceCheckUtils]: 66: Hoare triple {31069#(< main_~i~0 1013)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31069#(< main_~i~0 1013)} is VALID [2022-04-28 02:50:28,690 INFO L290 TraceCheckUtils]: 65: Hoare triple {31076#(< main_~i~0 1012)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31069#(< main_~i~0 1013)} is VALID [2022-04-28 02:50:28,691 INFO L290 TraceCheckUtils]: 64: Hoare triple {31076#(< main_~i~0 1012)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31076#(< main_~i~0 1012)} is VALID [2022-04-28 02:50:28,691 INFO L290 TraceCheckUtils]: 63: Hoare triple {31083#(< main_~i~0 1011)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31076#(< main_~i~0 1012)} is VALID [2022-04-28 02:50:28,691 INFO L290 TraceCheckUtils]: 62: Hoare triple {31083#(< main_~i~0 1011)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31083#(< main_~i~0 1011)} is VALID [2022-04-28 02:50:28,692 INFO L290 TraceCheckUtils]: 61: Hoare triple {31090#(< main_~i~0 1010)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31083#(< main_~i~0 1011)} is VALID [2022-04-28 02:50:28,692 INFO L290 TraceCheckUtils]: 60: Hoare triple {31090#(< main_~i~0 1010)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31090#(< main_~i~0 1010)} is VALID [2022-04-28 02:50:28,692 INFO L290 TraceCheckUtils]: 59: Hoare triple {31097#(< main_~i~0 1009)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31090#(< main_~i~0 1010)} is VALID [2022-04-28 02:50:28,693 INFO L290 TraceCheckUtils]: 58: Hoare triple {31097#(< main_~i~0 1009)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31097#(< main_~i~0 1009)} is VALID [2022-04-28 02:50:28,693 INFO L290 TraceCheckUtils]: 57: Hoare triple {31104#(< main_~i~0 1008)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31097#(< main_~i~0 1009)} is VALID [2022-04-28 02:50:28,693 INFO L290 TraceCheckUtils]: 56: Hoare triple {31104#(< main_~i~0 1008)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31104#(< main_~i~0 1008)} is VALID [2022-04-28 02:50:28,694 INFO L290 TraceCheckUtils]: 55: Hoare triple {31111#(< main_~i~0 1007)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31104#(< main_~i~0 1008)} is VALID [2022-04-28 02:50:28,694 INFO L290 TraceCheckUtils]: 54: Hoare triple {31111#(< main_~i~0 1007)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31111#(< main_~i~0 1007)} is VALID [2022-04-28 02:50:28,694 INFO L290 TraceCheckUtils]: 53: Hoare triple {31118#(< main_~i~0 1006)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31111#(< main_~i~0 1007)} is VALID [2022-04-28 02:50:28,694 INFO L290 TraceCheckUtils]: 52: Hoare triple {31118#(< main_~i~0 1006)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31118#(< main_~i~0 1006)} is VALID [2022-04-28 02:50:28,695 INFO L290 TraceCheckUtils]: 51: Hoare triple {31125#(< main_~i~0 1005)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31118#(< main_~i~0 1006)} is VALID [2022-04-28 02:50:28,695 INFO L290 TraceCheckUtils]: 50: Hoare triple {31125#(< main_~i~0 1005)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31125#(< main_~i~0 1005)} is VALID [2022-04-28 02:50:28,695 INFO L290 TraceCheckUtils]: 49: Hoare triple {31132#(< main_~i~0 1004)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31125#(< main_~i~0 1005)} is VALID [2022-04-28 02:50:28,696 INFO L290 TraceCheckUtils]: 48: Hoare triple {31132#(< main_~i~0 1004)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31132#(< main_~i~0 1004)} is VALID [2022-04-28 02:50:28,696 INFO L290 TraceCheckUtils]: 47: Hoare triple {31139#(< main_~i~0 1003)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31132#(< main_~i~0 1004)} is VALID [2022-04-28 02:50:28,696 INFO L290 TraceCheckUtils]: 46: Hoare triple {31139#(< main_~i~0 1003)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31139#(< main_~i~0 1003)} is VALID [2022-04-28 02:50:28,697 INFO L290 TraceCheckUtils]: 45: Hoare triple {31146#(< main_~i~0 1002)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31139#(< main_~i~0 1003)} is VALID [2022-04-28 02:50:28,697 INFO L290 TraceCheckUtils]: 44: Hoare triple {31146#(< main_~i~0 1002)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31146#(< main_~i~0 1002)} is VALID [2022-04-28 02:50:28,697 INFO L290 TraceCheckUtils]: 43: Hoare triple {31153#(< main_~i~0 1001)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31146#(< main_~i~0 1002)} is VALID [2022-04-28 02:50:28,697 INFO L290 TraceCheckUtils]: 42: Hoare triple {31153#(< main_~i~0 1001)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31153#(< main_~i~0 1001)} is VALID [2022-04-28 02:50:28,698 INFO L290 TraceCheckUtils]: 41: Hoare triple {31160#(< main_~i~0 1000)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31153#(< main_~i~0 1001)} is VALID [2022-04-28 02:50:28,698 INFO L290 TraceCheckUtils]: 40: Hoare triple {31160#(< main_~i~0 1000)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31160#(< main_~i~0 1000)} is VALID [2022-04-28 02:50:28,698 INFO L290 TraceCheckUtils]: 39: Hoare triple {31167#(< main_~i~0 999)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31160#(< main_~i~0 1000)} is VALID [2022-04-28 02:50:28,699 INFO L290 TraceCheckUtils]: 38: Hoare triple {31167#(< main_~i~0 999)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31167#(< main_~i~0 999)} is VALID [2022-04-28 02:50:28,699 INFO L290 TraceCheckUtils]: 37: Hoare triple {31174#(< main_~i~0 998)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31167#(< main_~i~0 999)} is VALID [2022-04-28 02:50:28,699 INFO L290 TraceCheckUtils]: 36: Hoare triple {31174#(< main_~i~0 998)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31174#(< main_~i~0 998)} is VALID [2022-04-28 02:50:28,700 INFO L290 TraceCheckUtils]: 35: Hoare triple {31181#(< main_~i~0 997)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31174#(< main_~i~0 998)} is VALID [2022-04-28 02:50:28,700 INFO L290 TraceCheckUtils]: 34: Hoare triple {31181#(< main_~i~0 997)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31181#(< main_~i~0 997)} is VALID [2022-04-28 02:50:28,700 INFO L290 TraceCheckUtils]: 33: Hoare triple {31188#(< main_~i~0 996)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31181#(< main_~i~0 997)} is VALID [2022-04-28 02:50:28,701 INFO L290 TraceCheckUtils]: 32: Hoare triple {31188#(< main_~i~0 996)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31188#(< main_~i~0 996)} is VALID [2022-04-28 02:50:28,701 INFO L290 TraceCheckUtils]: 31: Hoare triple {31195#(< main_~i~0 995)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31188#(< main_~i~0 996)} is VALID [2022-04-28 02:50:28,701 INFO L290 TraceCheckUtils]: 30: Hoare triple {31195#(< main_~i~0 995)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31195#(< main_~i~0 995)} is VALID [2022-04-28 02:50:28,702 INFO L290 TraceCheckUtils]: 29: Hoare triple {31202#(< main_~i~0 994)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31195#(< main_~i~0 995)} is VALID [2022-04-28 02:50:28,702 INFO L290 TraceCheckUtils]: 28: Hoare triple {31202#(< main_~i~0 994)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31202#(< main_~i~0 994)} is VALID [2022-04-28 02:50:28,702 INFO L290 TraceCheckUtils]: 27: Hoare triple {31209#(< main_~i~0 993)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31202#(< main_~i~0 994)} is VALID [2022-04-28 02:50:28,702 INFO L290 TraceCheckUtils]: 26: Hoare triple {31209#(< main_~i~0 993)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31209#(< main_~i~0 993)} is VALID [2022-04-28 02:50:28,703 INFO L290 TraceCheckUtils]: 25: Hoare triple {31216#(< main_~i~0 992)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31209#(< main_~i~0 993)} is VALID [2022-04-28 02:50:28,703 INFO L290 TraceCheckUtils]: 24: Hoare triple {31216#(< main_~i~0 992)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31216#(< main_~i~0 992)} is VALID [2022-04-28 02:50:28,703 INFO L290 TraceCheckUtils]: 23: Hoare triple {31223#(< main_~i~0 991)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31216#(< main_~i~0 992)} is VALID [2022-04-28 02:50:28,704 INFO L290 TraceCheckUtils]: 22: Hoare triple {31223#(< main_~i~0 991)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31223#(< main_~i~0 991)} is VALID [2022-04-28 02:50:28,704 INFO L290 TraceCheckUtils]: 21: Hoare triple {31230#(< main_~i~0 990)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31223#(< main_~i~0 991)} is VALID [2022-04-28 02:50:28,704 INFO L290 TraceCheckUtils]: 20: Hoare triple {31230#(< main_~i~0 990)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31230#(< main_~i~0 990)} is VALID [2022-04-28 02:50:28,705 INFO L290 TraceCheckUtils]: 19: Hoare triple {31237#(< main_~i~0 989)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31230#(< main_~i~0 990)} is VALID [2022-04-28 02:50:28,705 INFO L290 TraceCheckUtils]: 18: Hoare triple {31237#(< main_~i~0 989)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31237#(< main_~i~0 989)} is VALID [2022-04-28 02:50:28,705 INFO L290 TraceCheckUtils]: 17: Hoare triple {31244#(< main_~i~0 988)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31237#(< main_~i~0 989)} is VALID [2022-04-28 02:50:28,706 INFO L290 TraceCheckUtils]: 16: Hoare triple {31244#(< main_~i~0 988)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31244#(< main_~i~0 988)} is VALID [2022-04-28 02:50:28,706 INFO L290 TraceCheckUtils]: 15: Hoare triple {31251#(< main_~i~0 987)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31244#(< main_~i~0 988)} is VALID [2022-04-28 02:50:28,706 INFO L290 TraceCheckUtils]: 14: Hoare triple {31251#(< main_~i~0 987)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31251#(< main_~i~0 987)} is VALID [2022-04-28 02:50:28,707 INFO L290 TraceCheckUtils]: 13: Hoare triple {31258#(< main_~i~0 986)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31251#(< main_~i~0 987)} is VALID [2022-04-28 02:50:28,707 INFO L290 TraceCheckUtils]: 12: Hoare triple {31258#(< main_~i~0 986)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31258#(< main_~i~0 986)} is VALID [2022-04-28 02:50:28,707 INFO L290 TraceCheckUtils]: 11: Hoare triple {31265#(< main_~i~0 985)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31258#(< main_~i~0 986)} is VALID [2022-04-28 02:50:28,707 INFO L290 TraceCheckUtils]: 10: Hoare triple {31265#(< main_~i~0 985)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31265#(< main_~i~0 985)} is VALID [2022-04-28 02:50:28,708 INFO L290 TraceCheckUtils]: 9: Hoare triple {31272#(< main_~i~0 984)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31265#(< main_~i~0 985)} is VALID [2022-04-28 02:50:28,708 INFO L290 TraceCheckUtils]: 8: Hoare triple {31272#(< main_~i~0 984)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31272#(< main_~i~0 984)} is VALID [2022-04-28 02:50:28,708 INFO L290 TraceCheckUtils]: 7: Hoare triple {31279#(< main_~i~0 983)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31272#(< main_~i~0 984)} is VALID [2022-04-28 02:50:28,709 INFO L290 TraceCheckUtils]: 6: Hoare triple {31279#(< main_~i~0 983)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31279#(< main_~i~0 983)} is VALID [2022-04-28 02:50:28,709 INFO L290 TraceCheckUtils]: 5: Hoare triple {30649#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {31279#(< main_~i~0 983)} is VALID [2022-04-28 02:50:28,709 INFO L272 TraceCheckUtils]: 4: Hoare triple {30649#true} call #t~ret6 := main(); {30649#true} is VALID [2022-04-28 02:50:28,709 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30649#true} {30649#true} #39#return; {30649#true} is VALID [2022-04-28 02:50:28,709 INFO L290 TraceCheckUtils]: 2: Hoare triple {30649#true} assume true; {30649#true} is VALID [2022-04-28 02:50:28,709 INFO L290 TraceCheckUtils]: 1: Hoare triple {30649#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {30649#true} is VALID [2022-04-28 02:50:28,709 INFO L272 TraceCheckUtils]: 0: Hoare triple {30649#true} call ULTIMATE.init(); {30649#true} is VALID [2022-04-28 02:50:28,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:50:28,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284461694] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:50:28,710 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:50:28,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 44, 44] total 88 [2022-04-28 02:50:28,710 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:50:28,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1503183719] [2022-04-28 02:50:28,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1503183719] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:50:28,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:50:28,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2022-04-28 02:50:28,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485034246] [2022-04-28 02:50:28,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:50:28,711 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.0) internal successors, (90), 44 states have internal predecessors, (90), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 94 [2022-04-28 02:50:28,711 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:50:28,711 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 45 states, 45 states have (on average 2.0) internal successors, (90), 44 states have internal predecessors, (90), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:50:28,769 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:50:28,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-04-28 02:50:28,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:50:28,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-04-28 02:50:28,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3743, Invalid=3913, Unknown=0, NotChecked=0, Total=7656 [2022-04-28 02:50:28,770 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand has 45 states, 45 states have (on average 2.0) internal successors, (90), 44 states have internal predecessors, (90), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:50:30,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:50:30,136 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2022-04-28 02:50:30,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-04-28 02:50:30,136 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.0) internal successors, (90), 44 states have internal predecessors, (90), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 94 [2022-04-28 02:50:30,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:50:30,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 2.0) internal successors, (90), 44 states have internal predecessors, (90), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:50:30,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 104 transitions. [2022-04-28 02:50:30,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 2.0) internal successors, (90), 44 states have internal predecessors, (90), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:50:30,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 104 transitions. [2022-04-28 02:50:30,138 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 104 transitions. [2022-04-28 02:50:30,211 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:50:30,212 INFO L225 Difference]: With dead ends: 104 [2022-04-28 02:50:30,212 INFO L226 Difference]: Without dead ends: 98 [2022-04-28 02:50:30,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1106 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=7398, Invalid=9372, Unknown=0, NotChecked=0, Total=16770 [2022-04-28 02:50:30,213 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 92 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:50:30,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 24 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:50:30,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-04-28 02:50:30,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2022-04-28 02:50:30,596 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:50:30,596 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand has 97 states, 92 states have (on average 1.0108695652173914) internal successors, (93), 92 states have internal predecessors, (93), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:50:30,596 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand has 97 states, 92 states have (on average 1.0108695652173914) internal successors, (93), 92 states have internal predecessors, (93), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:50:30,596 INFO L87 Difference]: Start difference. First operand 98 states. Second operand has 97 states, 92 states have (on average 1.0108695652173914) internal successors, (93), 92 states have internal predecessors, (93), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:50:30,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:50:30,597 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2022-04-28 02:50:30,597 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2022-04-28 02:50:30,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:50:30,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:50:30,598 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 92 states have (on average 1.0108695652173914) internal successors, (93), 92 states have internal predecessors, (93), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 98 states. [2022-04-28 02:50:30,598 INFO L87 Difference]: Start difference. First operand has 97 states, 92 states have (on average 1.0108695652173914) internal successors, (93), 92 states have internal predecessors, (93), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 98 states. [2022-04-28 02:50:30,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:50:30,599 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2022-04-28 02:50:30,599 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2022-04-28 02:50:30,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:50:30,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:50:30,599 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:50:30,599 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:50:30,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 92 states have (on average 1.0108695652173914) internal successors, (93), 92 states have internal predecessors, (93), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:50:30,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2022-04-28 02:50:30,600 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 94 [2022-04-28 02:50:30,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:50:30,601 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2022-04-28 02:50:30,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.0) internal successors, (90), 44 states have internal predecessors, (90), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:50:30,601 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 97 states and 97 transitions. [2022-04-28 02:50:30,744 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:50:30,744 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2022-04-28 02:50:30,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-04-28 02:50:30,744 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:50:30,744 INFO L195 NwaCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:50:30,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2022-04-28 02:50:30,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:50:30,969 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:50:30,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:50:30,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1514079410, now seen corresponding path program 83 times [2022-04-28 02:50:30,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:50:30,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [455551606] [2022-04-28 02:50:30,973 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:50:30,973 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:50:30,973 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:50:30,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1514079410, now seen corresponding path program 84 times [2022-04-28 02:50:30,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:50:30,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129491106] [2022-04-28 02:50:30,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:50:30,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:50:31,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:50:31,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:50:31,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:50:31,852 INFO L290 TraceCheckUtils]: 0: Hoare triple {32033#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {31985#true} is VALID [2022-04-28 02:50:31,852 INFO L290 TraceCheckUtils]: 1: Hoare triple {31985#true} assume true; {31985#true} is VALID [2022-04-28 02:50:31,852 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31985#true} {31985#true} #39#return; {31985#true} is VALID [2022-04-28 02:50:31,853 INFO L272 TraceCheckUtils]: 0: Hoare triple {31985#true} call ULTIMATE.init(); {32033#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:50:31,853 INFO L290 TraceCheckUtils]: 1: Hoare triple {32033#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {31985#true} is VALID [2022-04-28 02:50:31,853 INFO L290 TraceCheckUtils]: 2: Hoare triple {31985#true} assume true; {31985#true} is VALID [2022-04-28 02:50:31,853 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31985#true} {31985#true} #39#return; {31985#true} is VALID [2022-04-28 02:50:31,853 INFO L272 TraceCheckUtils]: 4: Hoare triple {31985#true} call #t~ret6 := main(); {31985#true} is VALID [2022-04-28 02:50:31,854 INFO L290 TraceCheckUtils]: 5: Hoare triple {31985#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {31990#(= main_~i~0 0)} is VALID [2022-04-28 02:50:31,854 INFO L290 TraceCheckUtils]: 6: Hoare triple {31990#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31990#(= main_~i~0 0)} is VALID [2022-04-28 02:50:31,854 INFO L290 TraceCheckUtils]: 7: Hoare triple {31990#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31991#(<= main_~i~0 1)} is VALID [2022-04-28 02:50:31,855 INFO L290 TraceCheckUtils]: 8: Hoare triple {31991#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31991#(<= main_~i~0 1)} is VALID [2022-04-28 02:50:31,855 INFO L290 TraceCheckUtils]: 9: Hoare triple {31991#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31992#(<= main_~i~0 2)} is VALID [2022-04-28 02:50:31,856 INFO L290 TraceCheckUtils]: 10: Hoare triple {31992#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31992#(<= main_~i~0 2)} is VALID [2022-04-28 02:50:31,856 INFO L290 TraceCheckUtils]: 11: Hoare triple {31992#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31993#(<= main_~i~0 3)} is VALID [2022-04-28 02:50:31,856 INFO L290 TraceCheckUtils]: 12: Hoare triple {31993#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31993#(<= main_~i~0 3)} is VALID [2022-04-28 02:50:31,857 INFO L290 TraceCheckUtils]: 13: Hoare triple {31993#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31994#(<= main_~i~0 4)} is VALID [2022-04-28 02:50:31,857 INFO L290 TraceCheckUtils]: 14: Hoare triple {31994#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31994#(<= main_~i~0 4)} is VALID [2022-04-28 02:50:31,858 INFO L290 TraceCheckUtils]: 15: Hoare triple {31994#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31995#(<= main_~i~0 5)} is VALID [2022-04-28 02:50:31,858 INFO L290 TraceCheckUtils]: 16: Hoare triple {31995#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31995#(<= main_~i~0 5)} is VALID [2022-04-28 02:50:31,858 INFO L290 TraceCheckUtils]: 17: Hoare triple {31995#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31996#(<= main_~i~0 6)} is VALID [2022-04-28 02:50:31,859 INFO L290 TraceCheckUtils]: 18: Hoare triple {31996#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31996#(<= main_~i~0 6)} is VALID [2022-04-28 02:50:31,859 INFO L290 TraceCheckUtils]: 19: Hoare triple {31996#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31997#(<= main_~i~0 7)} is VALID [2022-04-28 02:50:31,860 INFO L290 TraceCheckUtils]: 20: Hoare triple {31997#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31997#(<= main_~i~0 7)} is VALID [2022-04-28 02:50:31,860 INFO L290 TraceCheckUtils]: 21: Hoare triple {31997#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31998#(<= main_~i~0 8)} is VALID [2022-04-28 02:50:31,860 INFO L290 TraceCheckUtils]: 22: Hoare triple {31998#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31998#(<= main_~i~0 8)} is VALID [2022-04-28 02:50:31,861 INFO L290 TraceCheckUtils]: 23: Hoare triple {31998#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31999#(<= main_~i~0 9)} is VALID [2022-04-28 02:50:31,861 INFO L290 TraceCheckUtils]: 24: Hoare triple {31999#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31999#(<= main_~i~0 9)} is VALID [2022-04-28 02:50:31,862 INFO L290 TraceCheckUtils]: 25: Hoare triple {31999#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32000#(<= main_~i~0 10)} is VALID [2022-04-28 02:50:31,862 INFO L290 TraceCheckUtils]: 26: Hoare triple {32000#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32000#(<= main_~i~0 10)} is VALID [2022-04-28 02:50:31,862 INFO L290 TraceCheckUtils]: 27: Hoare triple {32000#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32001#(<= main_~i~0 11)} is VALID [2022-04-28 02:50:31,863 INFO L290 TraceCheckUtils]: 28: Hoare triple {32001#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32001#(<= main_~i~0 11)} is VALID [2022-04-28 02:50:31,863 INFO L290 TraceCheckUtils]: 29: Hoare triple {32001#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32002#(<= main_~i~0 12)} is VALID [2022-04-28 02:50:31,863 INFO L290 TraceCheckUtils]: 30: Hoare triple {32002#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32002#(<= main_~i~0 12)} is VALID [2022-04-28 02:50:31,864 INFO L290 TraceCheckUtils]: 31: Hoare triple {32002#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32003#(<= main_~i~0 13)} is VALID [2022-04-28 02:50:31,864 INFO L290 TraceCheckUtils]: 32: Hoare triple {32003#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32003#(<= main_~i~0 13)} is VALID [2022-04-28 02:50:31,865 INFO L290 TraceCheckUtils]: 33: Hoare triple {32003#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32004#(<= main_~i~0 14)} is VALID [2022-04-28 02:50:31,865 INFO L290 TraceCheckUtils]: 34: Hoare triple {32004#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32004#(<= main_~i~0 14)} is VALID [2022-04-28 02:50:31,865 INFO L290 TraceCheckUtils]: 35: Hoare triple {32004#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32005#(<= main_~i~0 15)} is VALID [2022-04-28 02:50:31,866 INFO L290 TraceCheckUtils]: 36: Hoare triple {32005#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32005#(<= main_~i~0 15)} is VALID [2022-04-28 02:50:31,866 INFO L290 TraceCheckUtils]: 37: Hoare triple {32005#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32006#(<= main_~i~0 16)} is VALID [2022-04-28 02:50:31,866 INFO L290 TraceCheckUtils]: 38: Hoare triple {32006#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32006#(<= main_~i~0 16)} is VALID [2022-04-28 02:50:31,867 INFO L290 TraceCheckUtils]: 39: Hoare triple {32006#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32007#(<= main_~i~0 17)} is VALID [2022-04-28 02:50:31,867 INFO L290 TraceCheckUtils]: 40: Hoare triple {32007#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32007#(<= main_~i~0 17)} is VALID [2022-04-28 02:50:31,868 INFO L290 TraceCheckUtils]: 41: Hoare triple {32007#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32008#(<= main_~i~0 18)} is VALID [2022-04-28 02:50:31,868 INFO L290 TraceCheckUtils]: 42: Hoare triple {32008#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32008#(<= main_~i~0 18)} is VALID [2022-04-28 02:50:31,868 INFO L290 TraceCheckUtils]: 43: Hoare triple {32008#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32009#(<= main_~i~0 19)} is VALID [2022-04-28 02:50:31,869 INFO L290 TraceCheckUtils]: 44: Hoare triple {32009#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32009#(<= main_~i~0 19)} is VALID [2022-04-28 02:50:31,869 INFO L290 TraceCheckUtils]: 45: Hoare triple {32009#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32010#(<= main_~i~0 20)} is VALID [2022-04-28 02:50:31,870 INFO L290 TraceCheckUtils]: 46: Hoare triple {32010#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32010#(<= main_~i~0 20)} is VALID [2022-04-28 02:50:31,870 INFO L290 TraceCheckUtils]: 47: Hoare triple {32010#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32011#(<= main_~i~0 21)} is VALID [2022-04-28 02:50:31,870 INFO L290 TraceCheckUtils]: 48: Hoare triple {32011#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32011#(<= main_~i~0 21)} is VALID [2022-04-28 02:50:31,871 INFO L290 TraceCheckUtils]: 49: Hoare triple {32011#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32012#(<= main_~i~0 22)} is VALID [2022-04-28 02:50:31,871 INFO L290 TraceCheckUtils]: 50: Hoare triple {32012#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32012#(<= main_~i~0 22)} is VALID [2022-04-28 02:50:31,872 INFO L290 TraceCheckUtils]: 51: Hoare triple {32012#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32013#(<= main_~i~0 23)} is VALID [2022-04-28 02:50:31,872 INFO L290 TraceCheckUtils]: 52: Hoare triple {32013#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32013#(<= main_~i~0 23)} is VALID [2022-04-28 02:50:31,872 INFO L290 TraceCheckUtils]: 53: Hoare triple {32013#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32014#(<= main_~i~0 24)} is VALID [2022-04-28 02:50:31,873 INFO L290 TraceCheckUtils]: 54: Hoare triple {32014#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32014#(<= main_~i~0 24)} is VALID [2022-04-28 02:50:31,873 INFO L290 TraceCheckUtils]: 55: Hoare triple {32014#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32015#(<= main_~i~0 25)} is VALID [2022-04-28 02:50:31,873 INFO L290 TraceCheckUtils]: 56: Hoare triple {32015#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32015#(<= main_~i~0 25)} is VALID [2022-04-28 02:50:31,874 INFO L290 TraceCheckUtils]: 57: Hoare triple {32015#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32016#(<= main_~i~0 26)} is VALID [2022-04-28 02:50:31,874 INFO L290 TraceCheckUtils]: 58: Hoare triple {32016#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32016#(<= main_~i~0 26)} is VALID [2022-04-28 02:50:31,875 INFO L290 TraceCheckUtils]: 59: Hoare triple {32016#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32017#(<= main_~i~0 27)} is VALID [2022-04-28 02:50:31,875 INFO L290 TraceCheckUtils]: 60: Hoare triple {32017#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32017#(<= main_~i~0 27)} is VALID [2022-04-28 02:50:31,875 INFO L290 TraceCheckUtils]: 61: Hoare triple {32017#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32018#(<= main_~i~0 28)} is VALID [2022-04-28 02:50:31,876 INFO L290 TraceCheckUtils]: 62: Hoare triple {32018#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32018#(<= main_~i~0 28)} is VALID [2022-04-28 02:50:31,876 INFO L290 TraceCheckUtils]: 63: Hoare triple {32018#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32019#(<= main_~i~0 29)} is VALID [2022-04-28 02:50:31,876 INFO L290 TraceCheckUtils]: 64: Hoare triple {32019#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32019#(<= main_~i~0 29)} is VALID [2022-04-28 02:50:31,877 INFO L290 TraceCheckUtils]: 65: Hoare triple {32019#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32020#(<= main_~i~0 30)} is VALID [2022-04-28 02:50:31,877 INFO L290 TraceCheckUtils]: 66: Hoare triple {32020#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32020#(<= main_~i~0 30)} is VALID [2022-04-28 02:50:31,878 INFO L290 TraceCheckUtils]: 67: Hoare triple {32020#(<= main_~i~0 30)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32021#(<= main_~i~0 31)} is VALID [2022-04-28 02:50:31,878 INFO L290 TraceCheckUtils]: 68: Hoare triple {32021#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32021#(<= main_~i~0 31)} is VALID [2022-04-28 02:50:31,878 INFO L290 TraceCheckUtils]: 69: Hoare triple {32021#(<= main_~i~0 31)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32022#(<= main_~i~0 32)} is VALID [2022-04-28 02:50:31,879 INFO L290 TraceCheckUtils]: 70: Hoare triple {32022#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32022#(<= main_~i~0 32)} is VALID [2022-04-28 02:50:31,879 INFO L290 TraceCheckUtils]: 71: Hoare triple {32022#(<= main_~i~0 32)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32023#(<= main_~i~0 33)} is VALID [2022-04-28 02:50:31,879 INFO L290 TraceCheckUtils]: 72: Hoare triple {32023#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32023#(<= main_~i~0 33)} is VALID [2022-04-28 02:50:31,880 INFO L290 TraceCheckUtils]: 73: Hoare triple {32023#(<= main_~i~0 33)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32024#(<= main_~i~0 34)} is VALID [2022-04-28 02:50:31,880 INFO L290 TraceCheckUtils]: 74: Hoare triple {32024#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32024#(<= main_~i~0 34)} is VALID [2022-04-28 02:50:31,881 INFO L290 TraceCheckUtils]: 75: Hoare triple {32024#(<= main_~i~0 34)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32025#(<= main_~i~0 35)} is VALID [2022-04-28 02:50:31,881 INFO L290 TraceCheckUtils]: 76: Hoare triple {32025#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32025#(<= main_~i~0 35)} is VALID [2022-04-28 02:50:31,881 INFO L290 TraceCheckUtils]: 77: Hoare triple {32025#(<= main_~i~0 35)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32026#(<= main_~i~0 36)} is VALID [2022-04-28 02:50:31,882 INFO L290 TraceCheckUtils]: 78: Hoare triple {32026#(<= main_~i~0 36)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32026#(<= main_~i~0 36)} is VALID [2022-04-28 02:50:31,882 INFO L290 TraceCheckUtils]: 79: Hoare triple {32026#(<= main_~i~0 36)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32027#(<= main_~i~0 37)} is VALID [2022-04-28 02:50:31,883 INFO L290 TraceCheckUtils]: 80: Hoare triple {32027#(<= main_~i~0 37)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32027#(<= main_~i~0 37)} is VALID [2022-04-28 02:50:31,883 INFO L290 TraceCheckUtils]: 81: Hoare triple {32027#(<= main_~i~0 37)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32028#(<= main_~i~0 38)} is VALID [2022-04-28 02:50:31,883 INFO L290 TraceCheckUtils]: 82: Hoare triple {32028#(<= main_~i~0 38)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32028#(<= main_~i~0 38)} is VALID [2022-04-28 02:50:31,884 INFO L290 TraceCheckUtils]: 83: Hoare triple {32028#(<= main_~i~0 38)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32029#(<= main_~i~0 39)} is VALID [2022-04-28 02:50:31,884 INFO L290 TraceCheckUtils]: 84: Hoare triple {32029#(<= main_~i~0 39)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32029#(<= main_~i~0 39)} is VALID [2022-04-28 02:50:31,885 INFO L290 TraceCheckUtils]: 85: Hoare triple {32029#(<= main_~i~0 39)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32030#(<= main_~i~0 40)} is VALID [2022-04-28 02:50:31,885 INFO L290 TraceCheckUtils]: 86: Hoare triple {32030#(<= main_~i~0 40)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32030#(<= main_~i~0 40)} is VALID [2022-04-28 02:50:31,885 INFO L290 TraceCheckUtils]: 87: Hoare triple {32030#(<= main_~i~0 40)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32031#(<= main_~i~0 41)} is VALID [2022-04-28 02:50:31,886 INFO L290 TraceCheckUtils]: 88: Hoare triple {32031#(<= main_~i~0 41)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32031#(<= main_~i~0 41)} is VALID [2022-04-28 02:50:31,886 INFO L290 TraceCheckUtils]: 89: Hoare triple {32031#(<= main_~i~0 41)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32032#(<= main_~i~0 42)} is VALID [2022-04-28 02:50:31,886 INFO L290 TraceCheckUtils]: 90: Hoare triple {32032#(<= main_~i~0 42)} assume !(~i~0 < 1024); {31986#false} is VALID [2022-04-28 02:50:31,887 INFO L290 TraceCheckUtils]: 91: Hoare triple {31986#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {31986#false} is VALID [2022-04-28 02:50:31,887 INFO L272 TraceCheckUtils]: 92: Hoare triple {31986#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {31986#false} is VALID [2022-04-28 02:50:31,887 INFO L290 TraceCheckUtils]: 93: Hoare triple {31986#false} ~cond := #in~cond; {31986#false} is VALID [2022-04-28 02:50:31,887 INFO L290 TraceCheckUtils]: 94: Hoare triple {31986#false} assume 0 == ~cond; {31986#false} is VALID [2022-04-28 02:50:31,887 INFO L290 TraceCheckUtils]: 95: Hoare triple {31986#false} assume !false; {31986#false} is VALID [2022-04-28 02:50:31,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:50:31,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:50:31,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129491106] [2022-04-28 02:50:31,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129491106] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:50:31,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116508502] [2022-04-28 02:50:31,888 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 02:50:31,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:50:31,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:50:31,889 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:50:31,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-04-28 02:51:20,464 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2022-04-28 02:51:20,464 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:51:20,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-28 02:51:20,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:51:20,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:51:21,107 INFO L272 TraceCheckUtils]: 0: Hoare triple {31985#true} call ULTIMATE.init(); {31985#true} is VALID [2022-04-28 02:51:21,108 INFO L290 TraceCheckUtils]: 1: Hoare triple {31985#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {31985#true} is VALID [2022-04-28 02:51:21,108 INFO L290 TraceCheckUtils]: 2: Hoare triple {31985#true} assume true; {31985#true} is VALID [2022-04-28 02:51:21,108 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31985#true} {31985#true} #39#return; {31985#true} is VALID [2022-04-28 02:51:21,108 INFO L272 TraceCheckUtils]: 4: Hoare triple {31985#true} call #t~ret6 := main(); {31985#true} is VALID [2022-04-28 02:51:21,109 INFO L290 TraceCheckUtils]: 5: Hoare triple {31985#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {32052#(<= main_~i~0 0)} is VALID [2022-04-28 02:51:21,109 INFO L290 TraceCheckUtils]: 6: Hoare triple {32052#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32052#(<= main_~i~0 0)} is VALID [2022-04-28 02:51:21,110 INFO L290 TraceCheckUtils]: 7: Hoare triple {32052#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31991#(<= main_~i~0 1)} is VALID [2022-04-28 02:51:21,110 INFO L290 TraceCheckUtils]: 8: Hoare triple {31991#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31991#(<= main_~i~0 1)} is VALID [2022-04-28 02:51:21,110 INFO L290 TraceCheckUtils]: 9: Hoare triple {31991#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31992#(<= main_~i~0 2)} is VALID [2022-04-28 02:51:21,110 INFO L290 TraceCheckUtils]: 10: Hoare triple {31992#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31992#(<= main_~i~0 2)} is VALID [2022-04-28 02:51:21,111 INFO L290 TraceCheckUtils]: 11: Hoare triple {31992#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31993#(<= main_~i~0 3)} is VALID [2022-04-28 02:51:21,111 INFO L290 TraceCheckUtils]: 12: Hoare triple {31993#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31993#(<= main_~i~0 3)} is VALID [2022-04-28 02:51:21,111 INFO L290 TraceCheckUtils]: 13: Hoare triple {31993#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31994#(<= main_~i~0 4)} is VALID [2022-04-28 02:51:21,112 INFO L290 TraceCheckUtils]: 14: Hoare triple {31994#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31994#(<= main_~i~0 4)} is VALID [2022-04-28 02:51:21,112 INFO L290 TraceCheckUtils]: 15: Hoare triple {31994#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31995#(<= main_~i~0 5)} is VALID [2022-04-28 02:51:21,112 INFO L290 TraceCheckUtils]: 16: Hoare triple {31995#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31995#(<= main_~i~0 5)} is VALID [2022-04-28 02:51:21,113 INFO L290 TraceCheckUtils]: 17: Hoare triple {31995#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31996#(<= main_~i~0 6)} is VALID [2022-04-28 02:51:21,113 INFO L290 TraceCheckUtils]: 18: Hoare triple {31996#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31996#(<= main_~i~0 6)} is VALID [2022-04-28 02:51:21,113 INFO L290 TraceCheckUtils]: 19: Hoare triple {31996#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31997#(<= main_~i~0 7)} is VALID [2022-04-28 02:51:21,113 INFO L290 TraceCheckUtils]: 20: Hoare triple {31997#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31997#(<= main_~i~0 7)} is VALID [2022-04-28 02:51:21,114 INFO L290 TraceCheckUtils]: 21: Hoare triple {31997#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31998#(<= main_~i~0 8)} is VALID [2022-04-28 02:51:21,114 INFO L290 TraceCheckUtils]: 22: Hoare triple {31998#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31998#(<= main_~i~0 8)} is VALID [2022-04-28 02:51:21,114 INFO L290 TraceCheckUtils]: 23: Hoare triple {31998#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31999#(<= main_~i~0 9)} is VALID [2022-04-28 02:51:21,115 INFO L290 TraceCheckUtils]: 24: Hoare triple {31999#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31999#(<= main_~i~0 9)} is VALID [2022-04-28 02:51:21,115 INFO L290 TraceCheckUtils]: 25: Hoare triple {31999#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32000#(<= main_~i~0 10)} is VALID [2022-04-28 02:51:21,115 INFO L290 TraceCheckUtils]: 26: Hoare triple {32000#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32000#(<= main_~i~0 10)} is VALID [2022-04-28 02:51:21,116 INFO L290 TraceCheckUtils]: 27: Hoare triple {32000#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32001#(<= main_~i~0 11)} is VALID [2022-04-28 02:51:21,116 INFO L290 TraceCheckUtils]: 28: Hoare triple {32001#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32001#(<= main_~i~0 11)} is VALID [2022-04-28 02:51:21,116 INFO L290 TraceCheckUtils]: 29: Hoare triple {32001#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32002#(<= main_~i~0 12)} is VALID [2022-04-28 02:51:21,116 INFO L290 TraceCheckUtils]: 30: Hoare triple {32002#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32002#(<= main_~i~0 12)} is VALID [2022-04-28 02:51:21,117 INFO L290 TraceCheckUtils]: 31: Hoare triple {32002#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32003#(<= main_~i~0 13)} is VALID [2022-04-28 02:51:21,117 INFO L290 TraceCheckUtils]: 32: Hoare triple {32003#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32003#(<= main_~i~0 13)} is VALID [2022-04-28 02:51:21,117 INFO L290 TraceCheckUtils]: 33: Hoare triple {32003#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32004#(<= main_~i~0 14)} is VALID [2022-04-28 02:51:21,118 INFO L290 TraceCheckUtils]: 34: Hoare triple {32004#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32004#(<= main_~i~0 14)} is VALID [2022-04-28 02:51:21,118 INFO L290 TraceCheckUtils]: 35: Hoare triple {32004#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32005#(<= main_~i~0 15)} is VALID [2022-04-28 02:51:21,118 INFO L290 TraceCheckUtils]: 36: Hoare triple {32005#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32005#(<= main_~i~0 15)} is VALID [2022-04-28 02:51:21,119 INFO L290 TraceCheckUtils]: 37: Hoare triple {32005#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32006#(<= main_~i~0 16)} is VALID [2022-04-28 02:51:21,119 INFO L290 TraceCheckUtils]: 38: Hoare triple {32006#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32006#(<= main_~i~0 16)} is VALID [2022-04-28 02:51:21,119 INFO L290 TraceCheckUtils]: 39: Hoare triple {32006#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32007#(<= main_~i~0 17)} is VALID [2022-04-28 02:51:21,119 INFO L290 TraceCheckUtils]: 40: Hoare triple {32007#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32007#(<= main_~i~0 17)} is VALID [2022-04-28 02:51:21,120 INFO L290 TraceCheckUtils]: 41: Hoare triple {32007#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32008#(<= main_~i~0 18)} is VALID [2022-04-28 02:51:21,120 INFO L290 TraceCheckUtils]: 42: Hoare triple {32008#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32008#(<= main_~i~0 18)} is VALID [2022-04-28 02:51:21,120 INFO L290 TraceCheckUtils]: 43: Hoare triple {32008#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32009#(<= main_~i~0 19)} is VALID [2022-04-28 02:51:21,121 INFO L290 TraceCheckUtils]: 44: Hoare triple {32009#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32009#(<= main_~i~0 19)} is VALID [2022-04-28 02:51:21,121 INFO L290 TraceCheckUtils]: 45: Hoare triple {32009#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32010#(<= main_~i~0 20)} is VALID [2022-04-28 02:51:21,121 INFO L290 TraceCheckUtils]: 46: Hoare triple {32010#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32010#(<= main_~i~0 20)} is VALID [2022-04-28 02:51:21,122 INFO L290 TraceCheckUtils]: 47: Hoare triple {32010#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32011#(<= main_~i~0 21)} is VALID [2022-04-28 02:51:21,122 INFO L290 TraceCheckUtils]: 48: Hoare triple {32011#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32011#(<= main_~i~0 21)} is VALID [2022-04-28 02:51:21,122 INFO L290 TraceCheckUtils]: 49: Hoare triple {32011#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32012#(<= main_~i~0 22)} is VALID [2022-04-28 02:51:21,122 INFO L290 TraceCheckUtils]: 50: Hoare triple {32012#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32012#(<= main_~i~0 22)} is VALID [2022-04-28 02:51:21,123 INFO L290 TraceCheckUtils]: 51: Hoare triple {32012#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32013#(<= main_~i~0 23)} is VALID [2022-04-28 02:51:21,123 INFO L290 TraceCheckUtils]: 52: Hoare triple {32013#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32013#(<= main_~i~0 23)} is VALID [2022-04-28 02:51:21,123 INFO L290 TraceCheckUtils]: 53: Hoare triple {32013#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32014#(<= main_~i~0 24)} is VALID [2022-04-28 02:51:21,124 INFO L290 TraceCheckUtils]: 54: Hoare triple {32014#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32014#(<= main_~i~0 24)} is VALID [2022-04-28 02:51:21,124 INFO L290 TraceCheckUtils]: 55: Hoare triple {32014#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32015#(<= main_~i~0 25)} is VALID [2022-04-28 02:51:21,124 INFO L290 TraceCheckUtils]: 56: Hoare triple {32015#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32015#(<= main_~i~0 25)} is VALID [2022-04-28 02:51:21,125 INFO L290 TraceCheckUtils]: 57: Hoare triple {32015#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32016#(<= main_~i~0 26)} is VALID [2022-04-28 02:51:21,125 INFO L290 TraceCheckUtils]: 58: Hoare triple {32016#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32016#(<= main_~i~0 26)} is VALID [2022-04-28 02:51:21,125 INFO L290 TraceCheckUtils]: 59: Hoare triple {32016#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32017#(<= main_~i~0 27)} is VALID [2022-04-28 02:51:21,126 INFO L290 TraceCheckUtils]: 60: Hoare triple {32017#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32017#(<= main_~i~0 27)} is VALID [2022-04-28 02:51:21,126 INFO L290 TraceCheckUtils]: 61: Hoare triple {32017#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32018#(<= main_~i~0 28)} is VALID [2022-04-28 02:51:21,126 INFO L290 TraceCheckUtils]: 62: Hoare triple {32018#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32018#(<= main_~i~0 28)} is VALID [2022-04-28 02:51:21,127 INFO L290 TraceCheckUtils]: 63: Hoare triple {32018#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32019#(<= main_~i~0 29)} is VALID [2022-04-28 02:51:21,127 INFO L290 TraceCheckUtils]: 64: Hoare triple {32019#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32019#(<= main_~i~0 29)} is VALID [2022-04-28 02:51:21,127 INFO L290 TraceCheckUtils]: 65: Hoare triple {32019#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32020#(<= main_~i~0 30)} is VALID [2022-04-28 02:51:21,127 INFO L290 TraceCheckUtils]: 66: Hoare triple {32020#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32020#(<= main_~i~0 30)} is VALID [2022-04-28 02:51:21,128 INFO L290 TraceCheckUtils]: 67: Hoare triple {32020#(<= main_~i~0 30)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32021#(<= main_~i~0 31)} is VALID [2022-04-28 02:51:21,128 INFO L290 TraceCheckUtils]: 68: Hoare triple {32021#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32021#(<= main_~i~0 31)} is VALID [2022-04-28 02:51:21,128 INFO L290 TraceCheckUtils]: 69: Hoare triple {32021#(<= main_~i~0 31)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32022#(<= main_~i~0 32)} is VALID [2022-04-28 02:51:21,129 INFO L290 TraceCheckUtils]: 70: Hoare triple {32022#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32022#(<= main_~i~0 32)} is VALID [2022-04-28 02:51:21,129 INFO L290 TraceCheckUtils]: 71: Hoare triple {32022#(<= main_~i~0 32)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32023#(<= main_~i~0 33)} is VALID [2022-04-28 02:51:21,129 INFO L290 TraceCheckUtils]: 72: Hoare triple {32023#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32023#(<= main_~i~0 33)} is VALID [2022-04-28 02:51:21,130 INFO L290 TraceCheckUtils]: 73: Hoare triple {32023#(<= main_~i~0 33)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32024#(<= main_~i~0 34)} is VALID [2022-04-28 02:51:21,130 INFO L290 TraceCheckUtils]: 74: Hoare triple {32024#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32024#(<= main_~i~0 34)} is VALID [2022-04-28 02:51:21,130 INFO L290 TraceCheckUtils]: 75: Hoare triple {32024#(<= main_~i~0 34)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32025#(<= main_~i~0 35)} is VALID [2022-04-28 02:51:21,130 INFO L290 TraceCheckUtils]: 76: Hoare triple {32025#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32025#(<= main_~i~0 35)} is VALID [2022-04-28 02:51:21,131 INFO L290 TraceCheckUtils]: 77: Hoare triple {32025#(<= main_~i~0 35)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32026#(<= main_~i~0 36)} is VALID [2022-04-28 02:51:21,131 INFO L290 TraceCheckUtils]: 78: Hoare triple {32026#(<= main_~i~0 36)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32026#(<= main_~i~0 36)} is VALID [2022-04-28 02:51:21,131 INFO L290 TraceCheckUtils]: 79: Hoare triple {32026#(<= main_~i~0 36)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32027#(<= main_~i~0 37)} is VALID [2022-04-28 02:51:21,132 INFO L290 TraceCheckUtils]: 80: Hoare triple {32027#(<= main_~i~0 37)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32027#(<= main_~i~0 37)} is VALID [2022-04-28 02:51:21,132 INFO L290 TraceCheckUtils]: 81: Hoare triple {32027#(<= main_~i~0 37)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32028#(<= main_~i~0 38)} is VALID [2022-04-28 02:51:21,132 INFO L290 TraceCheckUtils]: 82: Hoare triple {32028#(<= main_~i~0 38)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32028#(<= main_~i~0 38)} is VALID [2022-04-28 02:51:21,133 INFO L290 TraceCheckUtils]: 83: Hoare triple {32028#(<= main_~i~0 38)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32029#(<= main_~i~0 39)} is VALID [2022-04-28 02:51:21,133 INFO L290 TraceCheckUtils]: 84: Hoare triple {32029#(<= main_~i~0 39)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32029#(<= main_~i~0 39)} is VALID [2022-04-28 02:51:21,133 INFO L290 TraceCheckUtils]: 85: Hoare triple {32029#(<= main_~i~0 39)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32030#(<= main_~i~0 40)} is VALID [2022-04-28 02:51:21,133 INFO L290 TraceCheckUtils]: 86: Hoare triple {32030#(<= main_~i~0 40)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32030#(<= main_~i~0 40)} is VALID [2022-04-28 02:51:21,134 INFO L290 TraceCheckUtils]: 87: Hoare triple {32030#(<= main_~i~0 40)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32031#(<= main_~i~0 41)} is VALID [2022-04-28 02:51:21,134 INFO L290 TraceCheckUtils]: 88: Hoare triple {32031#(<= main_~i~0 41)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32031#(<= main_~i~0 41)} is VALID [2022-04-28 02:51:21,134 INFO L290 TraceCheckUtils]: 89: Hoare triple {32031#(<= main_~i~0 41)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32032#(<= main_~i~0 42)} is VALID [2022-04-28 02:51:21,135 INFO L290 TraceCheckUtils]: 90: Hoare triple {32032#(<= main_~i~0 42)} assume !(~i~0 < 1024); {31986#false} is VALID [2022-04-28 02:51:21,135 INFO L290 TraceCheckUtils]: 91: Hoare triple {31986#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {31986#false} is VALID [2022-04-28 02:51:21,135 INFO L272 TraceCheckUtils]: 92: Hoare triple {31986#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {31986#false} is VALID [2022-04-28 02:51:21,135 INFO L290 TraceCheckUtils]: 93: Hoare triple {31986#false} ~cond := #in~cond; {31986#false} is VALID [2022-04-28 02:51:21,135 INFO L290 TraceCheckUtils]: 94: Hoare triple {31986#false} assume 0 == ~cond; {31986#false} is VALID [2022-04-28 02:51:21,135 INFO L290 TraceCheckUtils]: 95: Hoare triple {31986#false} assume !false; {31986#false} is VALID [2022-04-28 02:51:21,135 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:51:21,135 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:51:23,468 INFO L290 TraceCheckUtils]: 95: Hoare triple {31986#false} assume !false; {31986#false} is VALID [2022-04-28 02:51:23,468 INFO L290 TraceCheckUtils]: 94: Hoare triple {31986#false} assume 0 == ~cond; {31986#false} is VALID [2022-04-28 02:51:23,469 INFO L290 TraceCheckUtils]: 93: Hoare triple {31986#false} ~cond := #in~cond; {31986#false} is VALID [2022-04-28 02:51:23,469 INFO L272 TraceCheckUtils]: 92: Hoare triple {31986#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {31986#false} is VALID [2022-04-28 02:51:23,469 INFO L290 TraceCheckUtils]: 91: Hoare triple {31986#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {31986#false} is VALID [2022-04-28 02:51:23,469 INFO L290 TraceCheckUtils]: 90: Hoare triple {32338#(< main_~i~0 1024)} assume !(~i~0 < 1024); {31986#false} is VALID [2022-04-28 02:51:23,469 INFO L290 TraceCheckUtils]: 89: Hoare triple {32342#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32338#(< main_~i~0 1024)} is VALID [2022-04-28 02:51:23,469 INFO L290 TraceCheckUtils]: 88: Hoare triple {32342#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32342#(< main_~i~0 1023)} is VALID [2022-04-28 02:51:23,470 INFO L290 TraceCheckUtils]: 87: Hoare triple {32349#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32342#(< main_~i~0 1023)} is VALID [2022-04-28 02:51:23,470 INFO L290 TraceCheckUtils]: 86: Hoare triple {32349#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32349#(< main_~i~0 1022)} is VALID [2022-04-28 02:51:23,470 INFO L290 TraceCheckUtils]: 85: Hoare triple {32356#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32349#(< main_~i~0 1022)} is VALID [2022-04-28 02:51:23,471 INFO L290 TraceCheckUtils]: 84: Hoare triple {32356#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32356#(< main_~i~0 1021)} is VALID [2022-04-28 02:51:23,471 INFO L290 TraceCheckUtils]: 83: Hoare triple {32363#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32356#(< main_~i~0 1021)} is VALID [2022-04-28 02:51:23,471 INFO L290 TraceCheckUtils]: 82: Hoare triple {32363#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32363#(< main_~i~0 1020)} is VALID [2022-04-28 02:51:23,472 INFO L290 TraceCheckUtils]: 81: Hoare triple {32370#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32363#(< main_~i~0 1020)} is VALID [2022-04-28 02:51:23,472 INFO L290 TraceCheckUtils]: 80: Hoare triple {32370#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32370#(< main_~i~0 1019)} is VALID [2022-04-28 02:51:23,472 INFO L290 TraceCheckUtils]: 79: Hoare triple {32377#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32370#(< main_~i~0 1019)} is VALID [2022-04-28 02:51:23,473 INFO L290 TraceCheckUtils]: 78: Hoare triple {32377#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32377#(< main_~i~0 1018)} is VALID [2022-04-28 02:51:23,473 INFO L290 TraceCheckUtils]: 77: Hoare triple {32384#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32377#(< main_~i~0 1018)} is VALID [2022-04-28 02:51:23,473 INFO L290 TraceCheckUtils]: 76: Hoare triple {32384#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32384#(< main_~i~0 1017)} is VALID [2022-04-28 02:51:23,474 INFO L290 TraceCheckUtils]: 75: Hoare triple {32391#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32384#(< main_~i~0 1017)} is VALID [2022-04-28 02:51:23,474 INFO L290 TraceCheckUtils]: 74: Hoare triple {32391#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32391#(< main_~i~0 1016)} is VALID [2022-04-28 02:51:23,474 INFO L290 TraceCheckUtils]: 73: Hoare triple {32398#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32391#(< main_~i~0 1016)} is VALID [2022-04-28 02:51:23,474 INFO L290 TraceCheckUtils]: 72: Hoare triple {32398#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32398#(< main_~i~0 1015)} is VALID [2022-04-28 02:51:23,475 INFO L290 TraceCheckUtils]: 71: Hoare triple {32405#(< main_~i~0 1014)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32398#(< main_~i~0 1015)} is VALID [2022-04-28 02:51:23,475 INFO L290 TraceCheckUtils]: 70: Hoare triple {32405#(< main_~i~0 1014)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32405#(< main_~i~0 1014)} is VALID [2022-04-28 02:51:23,475 INFO L290 TraceCheckUtils]: 69: Hoare triple {32412#(< main_~i~0 1013)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32405#(< main_~i~0 1014)} is VALID [2022-04-28 02:51:23,476 INFO L290 TraceCheckUtils]: 68: Hoare triple {32412#(< main_~i~0 1013)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32412#(< main_~i~0 1013)} is VALID [2022-04-28 02:51:23,476 INFO L290 TraceCheckUtils]: 67: Hoare triple {32419#(< main_~i~0 1012)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32412#(< main_~i~0 1013)} is VALID [2022-04-28 02:51:23,476 INFO L290 TraceCheckUtils]: 66: Hoare triple {32419#(< main_~i~0 1012)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32419#(< main_~i~0 1012)} is VALID [2022-04-28 02:51:23,477 INFO L290 TraceCheckUtils]: 65: Hoare triple {32426#(< main_~i~0 1011)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32419#(< main_~i~0 1012)} is VALID [2022-04-28 02:51:23,477 INFO L290 TraceCheckUtils]: 64: Hoare triple {32426#(< main_~i~0 1011)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32426#(< main_~i~0 1011)} is VALID [2022-04-28 02:51:23,477 INFO L290 TraceCheckUtils]: 63: Hoare triple {32433#(< main_~i~0 1010)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32426#(< main_~i~0 1011)} is VALID [2022-04-28 02:51:23,477 INFO L290 TraceCheckUtils]: 62: Hoare triple {32433#(< main_~i~0 1010)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32433#(< main_~i~0 1010)} is VALID [2022-04-28 02:51:23,478 INFO L290 TraceCheckUtils]: 61: Hoare triple {32440#(< main_~i~0 1009)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32433#(< main_~i~0 1010)} is VALID [2022-04-28 02:51:23,478 INFO L290 TraceCheckUtils]: 60: Hoare triple {32440#(< main_~i~0 1009)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32440#(< main_~i~0 1009)} is VALID [2022-04-28 02:51:23,478 INFO L290 TraceCheckUtils]: 59: Hoare triple {32447#(< main_~i~0 1008)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32440#(< main_~i~0 1009)} is VALID [2022-04-28 02:51:23,479 INFO L290 TraceCheckUtils]: 58: Hoare triple {32447#(< main_~i~0 1008)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32447#(< main_~i~0 1008)} is VALID [2022-04-28 02:51:23,479 INFO L290 TraceCheckUtils]: 57: Hoare triple {32454#(< main_~i~0 1007)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32447#(< main_~i~0 1008)} is VALID [2022-04-28 02:51:23,479 INFO L290 TraceCheckUtils]: 56: Hoare triple {32454#(< main_~i~0 1007)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32454#(< main_~i~0 1007)} is VALID [2022-04-28 02:51:23,480 INFO L290 TraceCheckUtils]: 55: Hoare triple {32461#(< main_~i~0 1006)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32454#(< main_~i~0 1007)} is VALID [2022-04-28 02:51:23,480 INFO L290 TraceCheckUtils]: 54: Hoare triple {32461#(< main_~i~0 1006)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32461#(< main_~i~0 1006)} is VALID [2022-04-28 02:51:23,480 INFO L290 TraceCheckUtils]: 53: Hoare triple {32468#(< main_~i~0 1005)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32461#(< main_~i~0 1006)} is VALID [2022-04-28 02:51:23,481 INFO L290 TraceCheckUtils]: 52: Hoare triple {32468#(< main_~i~0 1005)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32468#(< main_~i~0 1005)} is VALID [2022-04-28 02:51:23,481 INFO L290 TraceCheckUtils]: 51: Hoare triple {32475#(< main_~i~0 1004)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32468#(< main_~i~0 1005)} is VALID [2022-04-28 02:51:23,481 INFO L290 TraceCheckUtils]: 50: Hoare triple {32475#(< main_~i~0 1004)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32475#(< main_~i~0 1004)} is VALID [2022-04-28 02:51:23,482 INFO L290 TraceCheckUtils]: 49: Hoare triple {32482#(< main_~i~0 1003)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32475#(< main_~i~0 1004)} is VALID [2022-04-28 02:51:23,482 INFO L290 TraceCheckUtils]: 48: Hoare triple {32482#(< main_~i~0 1003)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32482#(< main_~i~0 1003)} is VALID [2022-04-28 02:51:23,482 INFO L290 TraceCheckUtils]: 47: Hoare triple {32489#(< main_~i~0 1002)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32482#(< main_~i~0 1003)} is VALID [2022-04-28 02:51:23,482 INFO L290 TraceCheckUtils]: 46: Hoare triple {32489#(< main_~i~0 1002)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32489#(< main_~i~0 1002)} is VALID [2022-04-28 02:51:23,483 INFO L290 TraceCheckUtils]: 45: Hoare triple {32496#(< main_~i~0 1001)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32489#(< main_~i~0 1002)} is VALID [2022-04-28 02:51:23,483 INFO L290 TraceCheckUtils]: 44: Hoare triple {32496#(< main_~i~0 1001)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32496#(< main_~i~0 1001)} is VALID [2022-04-28 02:51:23,483 INFO L290 TraceCheckUtils]: 43: Hoare triple {32503#(< main_~i~0 1000)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32496#(< main_~i~0 1001)} is VALID [2022-04-28 02:51:23,484 INFO L290 TraceCheckUtils]: 42: Hoare triple {32503#(< main_~i~0 1000)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32503#(< main_~i~0 1000)} is VALID [2022-04-28 02:51:23,484 INFO L290 TraceCheckUtils]: 41: Hoare triple {32510#(< main_~i~0 999)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32503#(< main_~i~0 1000)} is VALID [2022-04-28 02:51:23,484 INFO L290 TraceCheckUtils]: 40: Hoare triple {32510#(< main_~i~0 999)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32510#(< main_~i~0 999)} is VALID [2022-04-28 02:51:23,485 INFO L290 TraceCheckUtils]: 39: Hoare triple {32517#(< main_~i~0 998)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32510#(< main_~i~0 999)} is VALID [2022-04-28 02:51:23,485 INFO L290 TraceCheckUtils]: 38: Hoare triple {32517#(< main_~i~0 998)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32517#(< main_~i~0 998)} is VALID [2022-04-28 02:51:23,485 INFO L290 TraceCheckUtils]: 37: Hoare triple {32524#(< main_~i~0 997)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32517#(< main_~i~0 998)} is VALID [2022-04-28 02:51:23,485 INFO L290 TraceCheckUtils]: 36: Hoare triple {32524#(< main_~i~0 997)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32524#(< main_~i~0 997)} is VALID [2022-04-28 02:51:23,486 INFO L290 TraceCheckUtils]: 35: Hoare triple {32531#(< main_~i~0 996)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32524#(< main_~i~0 997)} is VALID [2022-04-28 02:51:23,486 INFO L290 TraceCheckUtils]: 34: Hoare triple {32531#(< main_~i~0 996)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32531#(< main_~i~0 996)} is VALID [2022-04-28 02:51:23,486 INFO L290 TraceCheckUtils]: 33: Hoare triple {32538#(< main_~i~0 995)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32531#(< main_~i~0 996)} is VALID [2022-04-28 02:51:23,487 INFO L290 TraceCheckUtils]: 32: Hoare triple {32538#(< main_~i~0 995)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32538#(< main_~i~0 995)} is VALID [2022-04-28 02:51:23,487 INFO L290 TraceCheckUtils]: 31: Hoare triple {32545#(< main_~i~0 994)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32538#(< main_~i~0 995)} is VALID [2022-04-28 02:51:23,487 INFO L290 TraceCheckUtils]: 30: Hoare triple {32545#(< main_~i~0 994)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32545#(< main_~i~0 994)} is VALID [2022-04-28 02:51:23,488 INFO L290 TraceCheckUtils]: 29: Hoare triple {32552#(< main_~i~0 993)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32545#(< main_~i~0 994)} is VALID [2022-04-28 02:51:23,488 INFO L290 TraceCheckUtils]: 28: Hoare triple {32552#(< main_~i~0 993)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32552#(< main_~i~0 993)} is VALID [2022-04-28 02:51:23,488 INFO L290 TraceCheckUtils]: 27: Hoare triple {32559#(< main_~i~0 992)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32552#(< main_~i~0 993)} is VALID [2022-04-28 02:51:23,488 INFO L290 TraceCheckUtils]: 26: Hoare triple {32559#(< main_~i~0 992)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32559#(< main_~i~0 992)} is VALID [2022-04-28 02:51:23,489 INFO L290 TraceCheckUtils]: 25: Hoare triple {32566#(< main_~i~0 991)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32559#(< main_~i~0 992)} is VALID [2022-04-28 02:51:23,489 INFO L290 TraceCheckUtils]: 24: Hoare triple {32566#(< main_~i~0 991)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32566#(< main_~i~0 991)} is VALID [2022-04-28 02:51:23,489 INFO L290 TraceCheckUtils]: 23: Hoare triple {32573#(< main_~i~0 990)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32566#(< main_~i~0 991)} is VALID [2022-04-28 02:51:23,490 INFO L290 TraceCheckUtils]: 22: Hoare triple {32573#(< main_~i~0 990)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32573#(< main_~i~0 990)} is VALID [2022-04-28 02:51:23,490 INFO L290 TraceCheckUtils]: 21: Hoare triple {32580#(< main_~i~0 989)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32573#(< main_~i~0 990)} is VALID [2022-04-28 02:51:23,490 INFO L290 TraceCheckUtils]: 20: Hoare triple {32580#(< main_~i~0 989)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32580#(< main_~i~0 989)} is VALID [2022-04-28 02:51:23,491 INFO L290 TraceCheckUtils]: 19: Hoare triple {32587#(< main_~i~0 988)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32580#(< main_~i~0 989)} is VALID [2022-04-28 02:51:23,491 INFO L290 TraceCheckUtils]: 18: Hoare triple {32587#(< main_~i~0 988)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32587#(< main_~i~0 988)} is VALID [2022-04-28 02:51:23,491 INFO L290 TraceCheckUtils]: 17: Hoare triple {32594#(< main_~i~0 987)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32587#(< main_~i~0 988)} is VALID [2022-04-28 02:51:23,491 INFO L290 TraceCheckUtils]: 16: Hoare triple {32594#(< main_~i~0 987)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32594#(< main_~i~0 987)} is VALID [2022-04-28 02:51:23,492 INFO L290 TraceCheckUtils]: 15: Hoare triple {32601#(< main_~i~0 986)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32594#(< main_~i~0 987)} is VALID [2022-04-28 02:51:23,492 INFO L290 TraceCheckUtils]: 14: Hoare triple {32601#(< main_~i~0 986)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32601#(< main_~i~0 986)} is VALID [2022-04-28 02:51:23,492 INFO L290 TraceCheckUtils]: 13: Hoare triple {32608#(< main_~i~0 985)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32601#(< main_~i~0 986)} is VALID [2022-04-28 02:51:23,493 INFO L290 TraceCheckUtils]: 12: Hoare triple {32608#(< main_~i~0 985)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32608#(< main_~i~0 985)} is VALID [2022-04-28 02:51:23,493 INFO L290 TraceCheckUtils]: 11: Hoare triple {32615#(< main_~i~0 984)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32608#(< main_~i~0 985)} is VALID [2022-04-28 02:51:23,493 INFO L290 TraceCheckUtils]: 10: Hoare triple {32615#(< main_~i~0 984)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32615#(< main_~i~0 984)} is VALID [2022-04-28 02:51:23,494 INFO L290 TraceCheckUtils]: 9: Hoare triple {32622#(< main_~i~0 983)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32615#(< main_~i~0 984)} is VALID [2022-04-28 02:51:23,494 INFO L290 TraceCheckUtils]: 8: Hoare triple {32622#(< main_~i~0 983)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32622#(< main_~i~0 983)} is VALID [2022-04-28 02:51:23,494 INFO L290 TraceCheckUtils]: 7: Hoare triple {32629#(< main_~i~0 982)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32622#(< main_~i~0 983)} is VALID [2022-04-28 02:51:23,495 INFO L290 TraceCheckUtils]: 6: Hoare triple {32629#(< main_~i~0 982)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32629#(< main_~i~0 982)} is VALID [2022-04-28 02:51:23,495 INFO L290 TraceCheckUtils]: 5: Hoare triple {31985#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {32629#(< main_~i~0 982)} is VALID [2022-04-28 02:51:23,495 INFO L272 TraceCheckUtils]: 4: Hoare triple {31985#true} call #t~ret6 := main(); {31985#true} is VALID [2022-04-28 02:51:23,495 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31985#true} {31985#true} #39#return; {31985#true} is VALID [2022-04-28 02:51:23,495 INFO L290 TraceCheckUtils]: 2: Hoare triple {31985#true} assume true; {31985#true} is VALID [2022-04-28 02:51:23,495 INFO L290 TraceCheckUtils]: 1: Hoare triple {31985#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {31985#true} is VALID [2022-04-28 02:51:23,495 INFO L272 TraceCheckUtils]: 0: Hoare triple {31985#true} call ULTIMATE.init(); {31985#true} is VALID [2022-04-28 02:51:23,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:51:23,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [116508502] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:51:23,496 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:51:23,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 45, 45] total 90 [2022-04-28 02:51:23,496 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:51:23,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [455551606] [2022-04-28 02:51:23,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [455551606] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:51:23,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:51:23,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2022-04-28 02:51:23,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664991679] [2022-04-28 02:51:23,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:51:23,497 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.0) internal successors, (92), 45 states have internal predecessors, (92), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 96 [2022-04-28 02:51:23,497 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:51:23,497 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 46 states, 46 states have (on average 2.0) internal successors, (92), 45 states have internal predecessors, (92), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:51:23,580 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:51:23,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-04-28 02:51:23,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:51:23,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-04-28 02:51:23,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3918, Invalid=4092, Unknown=0, NotChecked=0, Total=8010 [2022-04-28 02:51:23,581 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand has 46 states, 46 states have (on average 2.0) internal successors, (92), 45 states have internal predecessors, (92), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:51:25,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:51:25,059 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2022-04-28 02:51:25,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-04-28 02:51:25,060 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.0) internal successors, (92), 45 states have internal predecessors, (92), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 96 [2022-04-28 02:51:25,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:51:25,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 2.0) internal successors, (92), 45 states have internal predecessors, (92), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:51:25,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 106 transitions. [2022-04-28 02:51:25,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 2.0) internal successors, (92), 45 states have internal predecessors, (92), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:51:25,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 106 transitions. [2022-04-28 02:51:25,061 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 106 transitions. [2022-04-28 02:51:25,136 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:51:25,136 INFO L225 Difference]: With dead ends: 106 [2022-04-28 02:51:25,136 INFO L226 Difference]: Without dead ends: 100 [2022-04-28 02:51:25,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1154 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=7746, Invalid=9810, Unknown=0, NotChecked=0, Total=17556 [2022-04-28 02:51:25,138 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 94 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:51:25,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 44 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:51:25,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-28 02:51:25,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2022-04-28 02:51:25,551 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:51:25,551 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand has 99 states, 94 states have (on average 1.0106382978723405) internal successors, (95), 94 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:51:25,551 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand has 99 states, 94 states have (on average 1.0106382978723405) internal successors, (95), 94 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:51:25,553 INFO L87 Difference]: Start difference. First operand 100 states. Second operand has 99 states, 94 states have (on average 1.0106382978723405) internal successors, (95), 94 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:51:25,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:51:25,554 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2022-04-28 02:51:25,554 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2022-04-28 02:51:25,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:51:25,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:51:25,554 INFO L74 IsIncluded]: Start isIncluded. First operand has 99 states, 94 states have (on average 1.0106382978723405) internal successors, (95), 94 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 100 states. [2022-04-28 02:51:25,554 INFO L87 Difference]: Start difference. First operand has 99 states, 94 states have (on average 1.0106382978723405) internal successors, (95), 94 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 100 states. [2022-04-28 02:51:25,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:51:25,555 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2022-04-28 02:51:25,555 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2022-04-28 02:51:25,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:51:25,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:51:25,555 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:51:25,555 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:51:25,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 94 states have (on average 1.0106382978723405) internal successors, (95), 94 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:51:25,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2022-04-28 02:51:25,556 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 96 [2022-04-28 02:51:25,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:51:25,557 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2022-04-28 02:51:25,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 2.0) internal successors, (92), 45 states have internal predecessors, (92), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:51:25,557 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 99 states and 99 transitions. [2022-04-28 02:51:25,665 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:51:25,665 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2022-04-28 02:51:25,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-04-28 02:51:25,665 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:51:25,665 INFO L195 NwaCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:51:25,698 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-28 02:51:25,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:51:25,866 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:51:25,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:51:25,866 INFO L85 PathProgramCache]: Analyzing trace with hash 89512784, now seen corresponding path program 85 times [2022-04-28 02:51:25,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:51:25,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [444448124] [2022-04-28 02:51:25,869 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:51:25,869 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:51:25,869 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:51:25,869 INFO L85 PathProgramCache]: Analyzing trace with hash 89512784, now seen corresponding path program 86 times [2022-04-28 02:51:25,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:51:25,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058503882] [2022-04-28 02:51:25,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:51:25,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:51:25,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:51:26,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:51:26,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:51:26,662 INFO L290 TraceCheckUtils]: 0: Hoare triple {33398#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {33349#true} is VALID [2022-04-28 02:51:26,662 INFO L290 TraceCheckUtils]: 1: Hoare triple {33349#true} assume true; {33349#true} is VALID [2022-04-28 02:51:26,662 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33349#true} {33349#true} #39#return; {33349#true} is VALID [2022-04-28 02:51:26,663 INFO L272 TraceCheckUtils]: 0: Hoare triple {33349#true} call ULTIMATE.init(); {33398#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:51:26,663 INFO L290 TraceCheckUtils]: 1: Hoare triple {33398#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {33349#true} is VALID [2022-04-28 02:51:26,663 INFO L290 TraceCheckUtils]: 2: Hoare triple {33349#true} assume true; {33349#true} is VALID [2022-04-28 02:51:26,663 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33349#true} {33349#true} #39#return; {33349#true} is VALID [2022-04-28 02:51:26,663 INFO L272 TraceCheckUtils]: 4: Hoare triple {33349#true} call #t~ret6 := main(); {33349#true} is VALID [2022-04-28 02:51:26,663 INFO L290 TraceCheckUtils]: 5: Hoare triple {33349#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {33354#(= main_~i~0 0)} is VALID [2022-04-28 02:51:26,663 INFO L290 TraceCheckUtils]: 6: Hoare triple {33354#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33354#(= main_~i~0 0)} is VALID [2022-04-28 02:51:26,664 INFO L290 TraceCheckUtils]: 7: Hoare triple {33354#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33355#(<= main_~i~0 1)} is VALID [2022-04-28 02:51:26,664 INFO L290 TraceCheckUtils]: 8: Hoare triple {33355#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33355#(<= main_~i~0 1)} is VALID [2022-04-28 02:51:26,664 INFO L290 TraceCheckUtils]: 9: Hoare triple {33355#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33356#(<= main_~i~0 2)} is VALID [2022-04-28 02:51:26,664 INFO L290 TraceCheckUtils]: 10: Hoare triple {33356#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33356#(<= main_~i~0 2)} is VALID [2022-04-28 02:51:26,665 INFO L290 TraceCheckUtils]: 11: Hoare triple {33356#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33357#(<= main_~i~0 3)} is VALID [2022-04-28 02:51:26,665 INFO L290 TraceCheckUtils]: 12: Hoare triple {33357#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33357#(<= main_~i~0 3)} is VALID [2022-04-28 02:51:26,665 INFO L290 TraceCheckUtils]: 13: Hoare triple {33357#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33358#(<= main_~i~0 4)} is VALID [2022-04-28 02:51:26,666 INFO L290 TraceCheckUtils]: 14: Hoare triple {33358#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33358#(<= main_~i~0 4)} is VALID [2022-04-28 02:51:26,666 INFO L290 TraceCheckUtils]: 15: Hoare triple {33358#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33359#(<= main_~i~0 5)} is VALID [2022-04-28 02:51:26,666 INFO L290 TraceCheckUtils]: 16: Hoare triple {33359#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33359#(<= main_~i~0 5)} is VALID [2022-04-28 02:51:26,667 INFO L290 TraceCheckUtils]: 17: Hoare triple {33359#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33360#(<= main_~i~0 6)} is VALID [2022-04-28 02:51:26,667 INFO L290 TraceCheckUtils]: 18: Hoare triple {33360#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33360#(<= main_~i~0 6)} is VALID [2022-04-28 02:51:26,667 INFO L290 TraceCheckUtils]: 19: Hoare triple {33360#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33361#(<= main_~i~0 7)} is VALID [2022-04-28 02:51:26,668 INFO L290 TraceCheckUtils]: 20: Hoare triple {33361#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33361#(<= main_~i~0 7)} is VALID [2022-04-28 02:51:26,668 INFO L290 TraceCheckUtils]: 21: Hoare triple {33361#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33362#(<= main_~i~0 8)} is VALID [2022-04-28 02:51:26,668 INFO L290 TraceCheckUtils]: 22: Hoare triple {33362#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33362#(<= main_~i~0 8)} is VALID [2022-04-28 02:51:26,668 INFO L290 TraceCheckUtils]: 23: Hoare triple {33362#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33363#(<= main_~i~0 9)} is VALID [2022-04-28 02:51:26,669 INFO L290 TraceCheckUtils]: 24: Hoare triple {33363#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33363#(<= main_~i~0 9)} is VALID [2022-04-28 02:51:26,669 INFO L290 TraceCheckUtils]: 25: Hoare triple {33363#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33364#(<= main_~i~0 10)} is VALID [2022-04-28 02:51:26,669 INFO L290 TraceCheckUtils]: 26: Hoare triple {33364#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33364#(<= main_~i~0 10)} is VALID [2022-04-28 02:51:26,670 INFO L290 TraceCheckUtils]: 27: Hoare triple {33364#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33365#(<= main_~i~0 11)} is VALID [2022-04-28 02:51:26,670 INFO L290 TraceCheckUtils]: 28: Hoare triple {33365#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33365#(<= main_~i~0 11)} is VALID [2022-04-28 02:51:26,670 INFO L290 TraceCheckUtils]: 29: Hoare triple {33365#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33366#(<= main_~i~0 12)} is VALID [2022-04-28 02:51:26,671 INFO L290 TraceCheckUtils]: 30: Hoare triple {33366#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33366#(<= main_~i~0 12)} is VALID [2022-04-28 02:51:26,671 INFO L290 TraceCheckUtils]: 31: Hoare triple {33366#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33367#(<= main_~i~0 13)} is VALID [2022-04-28 02:51:26,671 INFO L290 TraceCheckUtils]: 32: Hoare triple {33367#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33367#(<= main_~i~0 13)} is VALID [2022-04-28 02:51:26,672 INFO L290 TraceCheckUtils]: 33: Hoare triple {33367#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33368#(<= main_~i~0 14)} is VALID [2022-04-28 02:51:26,672 INFO L290 TraceCheckUtils]: 34: Hoare triple {33368#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33368#(<= main_~i~0 14)} is VALID [2022-04-28 02:51:26,672 INFO L290 TraceCheckUtils]: 35: Hoare triple {33368#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33369#(<= main_~i~0 15)} is VALID [2022-04-28 02:51:26,672 INFO L290 TraceCheckUtils]: 36: Hoare triple {33369#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33369#(<= main_~i~0 15)} is VALID [2022-04-28 02:51:26,673 INFO L290 TraceCheckUtils]: 37: Hoare triple {33369#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33370#(<= main_~i~0 16)} is VALID [2022-04-28 02:51:26,673 INFO L290 TraceCheckUtils]: 38: Hoare triple {33370#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33370#(<= main_~i~0 16)} is VALID [2022-04-28 02:51:26,673 INFO L290 TraceCheckUtils]: 39: Hoare triple {33370#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33371#(<= main_~i~0 17)} is VALID [2022-04-28 02:51:26,674 INFO L290 TraceCheckUtils]: 40: Hoare triple {33371#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33371#(<= main_~i~0 17)} is VALID [2022-04-28 02:51:26,674 INFO L290 TraceCheckUtils]: 41: Hoare triple {33371#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33372#(<= main_~i~0 18)} is VALID [2022-04-28 02:51:26,674 INFO L290 TraceCheckUtils]: 42: Hoare triple {33372#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33372#(<= main_~i~0 18)} is VALID [2022-04-28 02:51:26,675 INFO L290 TraceCheckUtils]: 43: Hoare triple {33372#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33373#(<= main_~i~0 19)} is VALID [2022-04-28 02:51:26,675 INFO L290 TraceCheckUtils]: 44: Hoare triple {33373#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33373#(<= main_~i~0 19)} is VALID [2022-04-28 02:51:26,675 INFO L290 TraceCheckUtils]: 45: Hoare triple {33373#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33374#(<= main_~i~0 20)} is VALID [2022-04-28 02:51:26,676 INFO L290 TraceCheckUtils]: 46: Hoare triple {33374#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33374#(<= main_~i~0 20)} is VALID [2022-04-28 02:51:26,676 INFO L290 TraceCheckUtils]: 47: Hoare triple {33374#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33375#(<= main_~i~0 21)} is VALID [2022-04-28 02:51:26,676 INFO L290 TraceCheckUtils]: 48: Hoare triple {33375#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33375#(<= main_~i~0 21)} is VALID [2022-04-28 02:51:26,677 INFO L290 TraceCheckUtils]: 49: Hoare triple {33375#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33376#(<= main_~i~0 22)} is VALID [2022-04-28 02:51:26,677 INFO L290 TraceCheckUtils]: 50: Hoare triple {33376#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33376#(<= main_~i~0 22)} is VALID [2022-04-28 02:51:26,677 INFO L290 TraceCheckUtils]: 51: Hoare triple {33376#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33377#(<= main_~i~0 23)} is VALID [2022-04-28 02:51:26,677 INFO L290 TraceCheckUtils]: 52: Hoare triple {33377#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33377#(<= main_~i~0 23)} is VALID [2022-04-28 02:51:26,678 INFO L290 TraceCheckUtils]: 53: Hoare triple {33377#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33378#(<= main_~i~0 24)} is VALID [2022-04-28 02:51:26,678 INFO L290 TraceCheckUtils]: 54: Hoare triple {33378#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33378#(<= main_~i~0 24)} is VALID [2022-04-28 02:51:26,679 INFO L290 TraceCheckUtils]: 55: Hoare triple {33378#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33379#(<= main_~i~0 25)} is VALID [2022-04-28 02:51:26,679 INFO L290 TraceCheckUtils]: 56: Hoare triple {33379#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33379#(<= main_~i~0 25)} is VALID [2022-04-28 02:51:26,679 INFO L290 TraceCheckUtils]: 57: Hoare triple {33379#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33380#(<= main_~i~0 26)} is VALID [2022-04-28 02:51:26,680 INFO L290 TraceCheckUtils]: 58: Hoare triple {33380#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33380#(<= main_~i~0 26)} is VALID [2022-04-28 02:51:26,680 INFO L290 TraceCheckUtils]: 59: Hoare triple {33380#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33381#(<= main_~i~0 27)} is VALID [2022-04-28 02:51:26,680 INFO L290 TraceCheckUtils]: 60: Hoare triple {33381#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33381#(<= main_~i~0 27)} is VALID [2022-04-28 02:51:26,681 INFO L290 TraceCheckUtils]: 61: Hoare triple {33381#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33382#(<= main_~i~0 28)} is VALID [2022-04-28 02:51:26,681 INFO L290 TraceCheckUtils]: 62: Hoare triple {33382#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33382#(<= main_~i~0 28)} is VALID [2022-04-28 02:51:26,681 INFO L290 TraceCheckUtils]: 63: Hoare triple {33382#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33383#(<= main_~i~0 29)} is VALID [2022-04-28 02:51:26,681 INFO L290 TraceCheckUtils]: 64: Hoare triple {33383#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33383#(<= main_~i~0 29)} is VALID [2022-04-28 02:51:26,682 INFO L290 TraceCheckUtils]: 65: Hoare triple {33383#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33384#(<= main_~i~0 30)} is VALID [2022-04-28 02:51:26,682 INFO L290 TraceCheckUtils]: 66: Hoare triple {33384#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33384#(<= main_~i~0 30)} is VALID [2022-04-28 02:51:26,682 INFO L290 TraceCheckUtils]: 67: Hoare triple {33384#(<= main_~i~0 30)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33385#(<= main_~i~0 31)} is VALID [2022-04-28 02:51:26,683 INFO L290 TraceCheckUtils]: 68: Hoare triple {33385#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33385#(<= main_~i~0 31)} is VALID [2022-04-28 02:51:26,683 INFO L290 TraceCheckUtils]: 69: Hoare triple {33385#(<= main_~i~0 31)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33386#(<= main_~i~0 32)} is VALID [2022-04-28 02:51:26,683 INFO L290 TraceCheckUtils]: 70: Hoare triple {33386#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33386#(<= main_~i~0 32)} is VALID [2022-04-28 02:51:26,684 INFO L290 TraceCheckUtils]: 71: Hoare triple {33386#(<= main_~i~0 32)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33387#(<= main_~i~0 33)} is VALID [2022-04-28 02:51:26,684 INFO L290 TraceCheckUtils]: 72: Hoare triple {33387#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33387#(<= main_~i~0 33)} is VALID [2022-04-28 02:51:26,684 INFO L290 TraceCheckUtils]: 73: Hoare triple {33387#(<= main_~i~0 33)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33388#(<= main_~i~0 34)} is VALID [2022-04-28 02:51:26,684 INFO L290 TraceCheckUtils]: 74: Hoare triple {33388#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33388#(<= main_~i~0 34)} is VALID [2022-04-28 02:51:26,685 INFO L290 TraceCheckUtils]: 75: Hoare triple {33388#(<= main_~i~0 34)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33389#(<= main_~i~0 35)} is VALID [2022-04-28 02:51:26,685 INFO L290 TraceCheckUtils]: 76: Hoare triple {33389#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33389#(<= main_~i~0 35)} is VALID [2022-04-28 02:51:26,685 INFO L290 TraceCheckUtils]: 77: Hoare triple {33389#(<= main_~i~0 35)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33390#(<= main_~i~0 36)} is VALID [2022-04-28 02:51:26,686 INFO L290 TraceCheckUtils]: 78: Hoare triple {33390#(<= main_~i~0 36)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33390#(<= main_~i~0 36)} is VALID [2022-04-28 02:51:26,686 INFO L290 TraceCheckUtils]: 79: Hoare triple {33390#(<= main_~i~0 36)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33391#(<= main_~i~0 37)} is VALID [2022-04-28 02:51:26,686 INFO L290 TraceCheckUtils]: 80: Hoare triple {33391#(<= main_~i~0 37)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33391#(<= main_~i~0 37)} is VALID [2022-04-28 02:51:26,687 INFO L290 TraceCheckUtils]: 81: Hoare triple {33391#(<= main_~i~0 37)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33392#(<= main_~i~0 38)} is VALID [2022-04-28 02:51:26,687 INFO L290 TraceCheckUtils]: 82: Hoare triple {33392#(<= main_~i~0 38)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33392#(<= main_~i~0 38)} is VALID [2022-04-28 02:51:26,687 INFO L290 TraceCheckUtils]: 83: Hoare triple {33392#(<= main_~i~0 38)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33393#(<= main_~i~0 39)} is VALID [2022-04-28 02:51:26,687 INFO L290 TraceCheckUtils]: 84: Hoare triple {33393#(<= main_~i~0 39)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33393#(<= main_~i~0 39)} is VALID [2022-04-28 02:51:26,688 INFO L290 TraceCheckUtils]: 85: Hoare triple {33393#(<= main_~i~0 39)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33394#(<= main_~i~0 40)} is VALID [2022-04-28 02:51:26,688 INFO L290 TraceCheckUtils]: 86: Hoare triple {33394#(<= main_~i~0 40)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33394#(<= main_~i~0 40)} is VALID [2022-04-28 02:51:26,688 INFO L290 TraceCheckUtils]: 87: Hoare triple {33394#(<= main_~i~0 40)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33395#(<= main_~i~0 41)} is VALID [2022-04-28 02:51:26,689 INFO L290 TraceCheckUtils]: 88: Hoare triple {33395#(<= main_~i~0 41)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33395#(<= main_~i~0 41)} is VALID [2022-04-28 02:51:26,689 INFO L290 TraceCheckUtils]: 89: Hoare triple {33395#(<= main_~i~0 41)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33396#(<= main_~i~0 42)} is VALID [2022-04-28 02:51:26,689 INFO L290 TraceCheckUtils]: 90: Hoare triple {33396#(<= main_~i~0 42)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33396#(<= main_~i~0 42)} is VALID [2022-04-28 02:51:26,690 INFO L290 TraceCheckUtils]: 91: Hoare triple {33396#(<= main_~i~0 42)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33397#(<= main_~i~0 43)} is VALID [2022-04-28 02:51:26,690 INFO L290 TraceCheckUtils]: 92: Hoare triple {33397#(<= main_~i~0 43)} assume !(~i~0 < 1024); {33350#false} is VALID [2022-04-28 02:51:26,690 INFO L290 TraceCheckUtils]: 93: Hoare triple {33350#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {33350#false} is VALID [2022-04-28 02:51:26,690 INFO L272 TraceCheckUtils]: 94: Hoare triple {33350#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {33350#false} is VALID [2022-04-28 02:51:26,690 INFO L290 TraceCheckUtils]: 95: Hoare triple {33350#false} ~cond := #in~cond; {33350#false} is VALID [2022-04-28 02:51:26,690 INFO L290 TraceCheckUtils]: 96: Hoare triple {33350#false} assume 0 == ~cond; {33350#false} is VALID [2022-04-28 02:51:26,690 INFO L290 TraceCheckUtils]: 97: Hoare triple {33350#false} assume !false; {33350#false} is VALID [2022-04-28 02:51:26,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:51:26,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:51:26,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058503882] [2022-04-28 02:51:26,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058503882] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:51:26,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [750194906] [2022-04-28 02:51:26,691 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:51:26,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:51:26,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:51:26,696 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:51:26,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-04-28 02:51:26,923 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:51:26,923 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:51:26,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-28 02:51:26,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:51:26,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:51:27,507 INFO L272 TraceCheckUtils]: 0: Hoare triple {33349#true} call ULTIMATE.init(); {33349#true} is VALID [2022-04-28 02:51:27,508 INFO L290 TraceCheckUtils]: 1: Hoare triple {33349#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {33349#true} is VALID [2022-04-28 02:51:27,508 INFO L290 TraceCheckUtils]: 2: Hoare triple {33349#true} assume true; {33349#true} is VALID [2022-04-28 02:51:27,508 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33349#true} {33349#true} #39#return; {33349#true} is VALID [2022-04-28 02:51:27,508 INFO L272 TraceCheckUtils]: 4: Hoare triple {33349#true} call #t~ret6 := main(); {33349#true} is VALID [2022-04-28 02:51:27,508 INFO L290 TraceCheckUtils]: 5: Hoare triple {33349#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {33417#(<= main_~i~0 0)} is VALID [2022-04-28 02:51:27,509 INFO L290 TraceCheckUtils]: 6: Hoare triple {33417#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33417#(<= main_~i~0 0)} is VALID [2022-04-28 02:51:27,509 INFO L290 TraceCheckUtils]: 7: Hoare triple {33417#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33355#(<= main_~i~0 1)} is VALID [2022-04-28 02:51:27,509 INFO L290 TraceCheckUtils]: 8: Hoare triple {33355#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33355#(<= main_~i~0 1)} is VALID [2022-04-28 02:51:27,510 INFO L290 TraceCheckUtils]: 9: Hoare triple {33355#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33356#(<= main_~i~0 2)} is VALID [2022-04-28 02:51:27,510 INFO L290 TraceCheckUtils]: 10: Hoare triple {33356#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33356#(<= main_~i~0 2)} is VALID [2022-04-28 02:51:27,510 INFO L290 TraceCheckUtils]: 11: Hoare triple {33356#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33357#(<= main_~i~0 3)} is VALID [2022-04-28 02:51:27,510 INFO L290 TraceCheckUtils]: 12: Hoare triple {33357#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33357#(<= main_~i~0 3)} is VALID [2022-04-28 02:51:27,511 INFO L290 TraceCheckUtils]: 13: Hoare triple {33357#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33358#(<= main_~i~0 4)} is VALID [2022-04-28 02:51:27,511 INFO L290 TraceCheckUtils]: 14: Hoare triple {33358#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33358#(<= main_~i~0 4)} is VALID [2022-04-28 02:51:27,511 INFO L290 TraceCheckUtils]: 15: Hoare triple {33358#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33359#(<= main_~i~0 5)} is VALID [2022-04-28 02:51:27,512 INFO L290 TraceCheckUtils]: 16: Hoare triple {33359#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33359#(<= main_~i~0 5)} is VALID [2022-04-28 02:51:27,512 INFO L290 TraceCheckUtils]: 17: Hoare triple {33359#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33360#(<= main_~i~0 6)} is VALID [2022-04-28 02:51:27,512 INFO L290 TraceCheckUtils]: 18: Hoare triple {33360#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33360#(<= main_~i~0 6)} is VALID [2022-04-28 02:51:27,513 INFO L290 TraceCheckUtils]: 19: Hoare triple {33360#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33361#(<= main_~i~0 7)} is VALID [2022-04-28 02:51:27,513 INFO L290 TraceCheckUtils]: 20: Hoare triple {33361#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33361#(<= main_~i~0 7)} is VALID [2022-04-28 02:51:27,513 INFO L290 TraceCheckUtils]: 21: Hoare triple {33361#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33362#(<= main_~i~0 8)} is VALID [2022-04-28 02:51:27,514 INFO L290 TraceCheckUtils]: 22: Hoare triple {33362#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33362#(<= main_~i~0 8)} is VALID [2022-04-28 02:51:27,514 INFO L290 TraceCheckUtils]: 23: Hoare triple {33362#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33363#(<= main_~i~0 9)} is VALID [2022-04-28 02:51:27,514 INFO L290 TraceCheckUtils]: 24: Hoare triple {33363#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33363#(<= main_~i~0 9)} is VALID [2022-04-28 02:51:27,515 INFO L290 TraceCheckUtils]: 25: Hoare triple {33363#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33364#(<= main_~i~0 10)} is VALID [2022-04-28 02:51:27,515 INFO L290 TraceCheckUtils]: 26: Hoare triple {33364#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33364#(<= main_~i~0 10)} is VALID [2022-04-28 02:51:27,515 INFO L290 TraceCheckUtils]: 27: Hoare triple {33364#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33365#(<= main_~i~0 11)} is VALID [2022-04-28 02:51:27,515 INFO L290 TraceCheckUtils]: 28: Hoare triple {33365#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33365#(<= main_~i~0 11)} is VALID [2022-04-28 02:51:27,516 INFO L290 TraceCheckUtils]: 29: Hoare triple {33365#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33366#(<= main_~i~0 12)} is VALID [2022-04-28 02:51:27,516 INFO L290 TraceCheckUtils]: 30: Hoare triple {33366#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33366#(<= main_~i~0 12)} is VALID [2022-04-28 02:51:27,516 INFO L290 TraceCheckUtils]: 31: Hoare triple {33366#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33367#(<= main_~i~0 13)} is VALID [2022-04-28 02:51:27,517 INFO L290 TraceCheckUtils]: 32: Hoare triple {33367#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33367#(<= main_~i~0 13)} is VALID [2022-04-28 02:51:27,517 INFO L290 TraceCheckUtils]: 33: Hoare triple {33367#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33368#(<= main_~i~0 14)} is VALID [2022-04-28 02:51:27,517 INFO L290 TraceCheckUtils]: 34: Hoare triple {33368#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33368#(<= main_~i~0 14)} is VALID [2022-04-28 02:51:27,518 INFO L290 TraceCheckUtils]: 35: Hoare triple {33368#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33369#(<= main_~i~0 15)} is VALID [2022-04-28 02:51:27,518 INFO L290 TraceCheckUtils]: 36: Hoare triple {33369#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33369#(<= main_~i~0 15)} is VALID [2022-04-28 02:51:27,518 INFO L290 TraceCheckUtils]: 37: Hoare triple {33369#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33370#(<= main_~i~0 16)} is VALID [2022-04-28 02:51:27,519 INFO L290 TraceCheckUtils]: 38: Hoare triple {33370#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33370#(<= main_~i~0 16)} is VALID [2022-04-28 02:51:27,519 INFO L290 TraceCheckUtils]: 39: Hoare triple {33370#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33371#(<= main_~i~0 17)} is VALID [2022-04-28 02:51:27,519 INFO L290 TraceCheckUtils]: 40: Hoare triple {33371#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33371#(<= main_~i~0 17)} is VALID [2022-04-28 02:51:27,520 INFO L290 TraceCheckUtils]: 41: Hoare triple {33371#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33372#(<= main_~i~0 18)} is VALID [2022-04-28 02:51:27,520 INFO L290 TraceCheckUtils]: 42: Hoare triple {33372#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33372#(<= main_~i~0 18)} is VALID [2022-04-28 02:51:27,520 INFO L290 TraceCheckUtils]: 43: Hoare triple {33372#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33373#(<= main_~i~0 19)} is VALID [2022-04-28 02:51:27,520 INFO L290 TraceCheckUtils]: 44: Hoare triple {33373#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33373#(<= main_~i~0 19)} is VALID [2022-04-28 02:51:27,521 INFO L290 TraceCheckUtils]: 45: Hoare triple {33373#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33374#(<= main_~i~0 20)} is VALID [2022-04-28 02:51:27,521 INFO L290 TraceCheckUtils]: 46: Hoare triple {33374#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33374#(<= main_~i~0 20)} is VALID [2022-04-28 02:51:27,521 INFO L290 TraceCheckUtils]: 47: Hoare triple {33374#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33375#(<= main_~i~0 21)} is VALID [2022-04-28 02:51:27,522 INFO L290 TraceCheckUtils]: 48: Hoare triple {33375#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33375#(<= main_~i~0 21)} is VALID [2022-04-28 02:51:27,522 INFO L290 TraceCheckUtils]: 49: Hoare triple {33375#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33376#(<= main_~i~0 22)} is VALID [2022-04-28 02:51:27,522 INFO L290 TraceCheckUtils]: 50: Hoare triple {33376#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33376#(<= main_~i~0 22)} is VALID [2022-04-28 02:51:27,523 INFO L290 TraceCheckUtils]: 51: Hoare triple {33376#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33377#(<= main_~i~0 23)} is VALID [2022-04-28 02:51:27,523 INFO L290 TraceCheckUtils]: 52: Hoare triple {33377#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33377#(<= main_~i~0 23)} is VALID [2022-04-28 02:51:27,523 INFO L290 TraceCheckUtils]: 53: Hoare triple {33377#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33378#(<= main_~i~0 24)} is VALID [2022-04-28 02:51:27,524 INFO L290 TraceCheckUtils]: 54: Hoare triple {33378#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33378#(<= main_~i~0 24)} is VALID [2022-04-28 02:51:27,524 INFO L290 TraceCheckUtils]: 55: Hoare triple {33378#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33379#(<= main_~i~0 25)} is VALID [2022-04-28 02:51:27,524 INFO L290 TraceCheckUtils]: 56: Hoare triple {33379#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33379#(<= main_~i~0 25)} is VALID [2022-04-28 02:51:27,525 INFO L290 TraceCheckUtils]: 57: Hoare triple {33379#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33380#(<= main_~i~0 26)} is VALID [2022-04-28 02:51:27,525 INFO L290 TraceCheckUtils]: 58: Hoare triple {33380#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33380#(<= main_~i~0 26)} is VALID [2022-04-28 02:51:27,525 INFO L290 TraceCheckUtils]: 59: Hoare triple {33380#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33381#(<= main_~i~0 27)} is VALID [2022-04-28 02:51:27,526 INFO L290 TraceCheckUtils]: 60: Hoare triple {33381#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33381#(<= main_~i~0 27)} is VALID [2022-04-28 02:51:27,526 INFO L290 TraceCheckUtils]: 61: Hoare triple {33381#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33382#(<= main_~i~0 28)} is VALID [2022-04-28 02:51:27,526 INFO L290 TraceCheckUtils]: 62: Hoare triple {33382#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33382#(<= main_~i~0 28)} is VALID [2022-04-28 02:51:27,527 INFO L290 TraceCheckUtils]: 63: Hoare triple {33382#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33383#(<= main_~i~0 29)} is VALID [2022-04-28 02:51:27,527 INFO L290 TraceCheckUtils]: 64: Hoare triple {33383#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33383#(<= main_~i~0 29)} is VALID [2022-04-28 02:51:27,527 INFO L290 TraceCheckUtils]: 65: Hoare triple {33383#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33384#(<= main_~i~0 30)} is VALID [2022-04-28 02:51:27,527 INFO L290 TraceCheckUtils]: 66: Hoare triple {33384#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33384#(<= main_~i~0 30)} is VALID [2022-04-28 02:51:27,528 INFO L290 TraceCheckUtils]: 67: Hoare triple {33384#(<= main_~i~0 30)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33385#(<= main_~i~0 31)} is VALID [2022-04-28 02:51:27,528 INFO L290 TraceCheckUtils]: 68: Hoare triple {33385#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33385#(<= main_~i~0 31)} is VALID [2022-04-28 02:51:27,528 INFO L290 TraceCheckUtils]: 69: Hoare triple {33385#(<= main_~i~0 31)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33386#(<= main_~i~0 32)} is VALID [2022-04-28 02:51:27,529 INFO L290 TraceCheckUtils]: 70: Hoare triple {33386#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33386#(<= main_~i~0 32)} is VALID [2022-04-28 02:51:27,529 INFO L290 TraceCheckUtils]: 71: Hoare triple {33386#(<= main_~i~0 32)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33387#(<= main_~i~0 33)} is VALID [2022-04-28 02:51:27,529 INFO L290 TraceCheckUtils]: 72: Hoare triple {33387#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33387#(<= main_~i~0 33)} is VALID [2022-04-28 02:51:27,530 INFO L290 TraceCheckUtils]: 73: Hoare triple {33387#(<= main_~i~0 33)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33388#(<= main_~i~0 34)} is VALID [2022-04-28 02:51:27,530 INFO L290 TraceCheckUtils]: 74: Hoare triple {33388#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33388#(<= main_~i~0 34)} is VALID [2022-04-28 02:51:27,530 INFO L290 TraceCheckUtils]: 75: Hoare triple {33388#(<= main_~i~0 34)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33389#(<= main_~i~0 35)} is VALID [2022-04-28 02:51:27,531 INFO L290 TraceCheckUtils]: 76: Hoare triple {33389#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33389#(<= main_~i~0 35)} is VALID [2022-04-28 02:51:27,531 INFO L290 TraceCheckUtils]: 77: Hoare triple {33389#(<= main_~i~0 35)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33390#(<= main_~i~0 36)} is VALID [2022-04-28 02:51:27,531 INFO L290 TraceCheckUtils]: 78: Hoare triple {33390#(<= main_~i~0 36)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33390#(<= main_~i~0 36)} is VALID [2022-04-28 02:51:27,532 INFO L290 TraceCheckUtils]: 79: Hoare triple {33390#(<= main_~i~0 36)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33391#(<= main_~i~0 37)} is VALID [2022-04-28 02:51:27,532 INFO L290 TraceCheckUtils]: 80: Hoare triple {33391#(<= main_~i~0 37)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33391#(<= main_~i~0 37)} is VALID [2022-04-28 02:51:27,532 INFO L290 TraceCheckUtils]: 81: Hoare triple {33391#(<= main_~i~0 37)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33392#(<= main_~i~0 38)} is VALID [2022-04-28 02:51:27,533 INFO L290 TraceCheckUtils]: 82: Hoare triple {33392#(<= main_~i~0 38)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33392#(<= main_~i~0 38)} is VALID [2022-04-28 02:51:27,533 INFO L290 TraceCheckUtils]: 83: Hoare triple {33392#(<= main_~i~0 38)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33393#(<= main_~i~0 39)} is VALID [2022-04-28 02:51:27,533 INFO L290 TraceCheckUtils]: 84: Hoare triple {33393#(<= main_~i~0 39)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33393#(<= main_~i~0 39)} is VALID [2022-04-28 02:51:27,534 INFO L290 TraceCheckUtils]: 85: Hoare triple {33393#(<= main_~i~0 39)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33394#(<= main_~i~0 40)} is VALID [2022-04-28 02:51:27,534 INFO L290 TraceCheckUtils]: 86: Hoare triple {33394#(<= main_~i~0 40)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33394#(<= main_~i~0 40)} is VALID [2022-04-28 02:51:27,534 INFO L290 TraceCheckUtils]: 87: Hoare triple {33394#(<= main_~i~0 40)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33395#(<= main_~i~0 41)} is VALID [2022-04-28 02:51:27,534 INFO L290 TraceCheckUtils]: 88: Hoare triple {33395#(<= main_~i~0 41)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33395#(<= main_~i~0 41)} is VALID [2022-04-28 02:51:27,535 INFO L290 TraceCheckUtils]: 89: Hoare triple {33395#(<= main_~i~0 41)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33396#(<= main_~i~0 42)} is VALID [2022-04-28 02:51:27,535 INFO L290 TraceCheckUtils]: 90: Hoare triple {33396#(<= main_~i~0 42)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33396#(<= main_~i~0 42)} is VALID [2022-04-28 02:51:27,535 INFO L290 TraceCheckUtils]: 91: Hoare triple {33396#(<= main_~i~0 42)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33397#(<= main_~i~0 43)} is VALID [2022-04-28 02:51:27,536 INFO L290 TraceCheckUtils]: 92: Hoare triple {33397#(<= main_~i~0 43)} assume !(~i~0 < 1024); {33350#false} is VALID [2022-04-28 02:51:27,536 INFO L290 TraceCheckUtils]: 93: Hoare triple {33350#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {33350#false} is VALID [2022-04-28 02:51:27,536 INFO L272 TraceCheckUtils]: 94: Hoare triple {33350#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {33350#false} is VALID [2022-04-28 02:51:27,536 INFO L290 TraceCheckUtils]: 95: Hoare triple {33350#false} ~cond := #in~cond; {33350#false} is VALID [2022-04-28 02:51:27,536 INFO L290 TraceCheckUtils]: 96: Hoare triple {33350#false} assume 0 == ~cond; {33350#false} is VALID [2022-04-28 02:51:27,536 INFO L290 TraceCheckUtils]: 97: Hoare triple {33350#false} assume !false; {33350#false} is VALID [2022-04-28 02:51:27,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:51:27,536 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:51:29,917 INFO L290 TraceCheckUtils]: 97: Hoare triple {33350#false} assume !false; {33350#false} is VALID [2022-04-28 02:51:29,917 INFO L290 TraceCheckUtils]: 96: Hoare triple {33350#false} assume 0 == ~cond; {33350#false} is VALID [2022-04-28 02:51:29,917 INFO L290 TraceCheckUtils]: 95: Hoare triple {33350#false} ~cond := #in~cond; {33350#false} is VALID [2022-04-28 02:51:29,917 INFO L272 TraceCheckUtils]: 94: Hoare triple {33350#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {33350#false} is VALID [2022-04-28 02:51:29,917 INFO L290 TraceCheckUtils]: 93: Hoare triple {33350#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {33350#false} is VALID [2022-04-28 02:51:29,917 INFO L290 TraceCheckUtils]: 92: Hoare triple {33709#(< main_~i~0 1024)} assume !(~i~0 < 1024); {33350#false} is VALID [2022-04-28 02:51:29,918 INFO L290 TraceCheckUtils]: 91: Hoare triple {33713#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33709#(< main_~i~0 1024)} is VALID [2022-04-28 02:51:29,918 INFO L290 TraceCheckUtils]: 90: Hoare triple {33713#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33713#(< main_~i~0 1023)} is VALID [2022-04-28 02:51:29,918 INFO L290 TraceCheckUtils]: 89: Hoare triple {33720#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33713#(< main_~i~0 1023)} is VALID [2022-04-28 02:51:29,919 INFO L290 TraceCheckUtils]: 88: Hoare triple {33720#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33720#(< main_~i~0 1022)} is VALID [2022-04-28 02:51:29,919 INFO L290 TraceCheckUtils]: 87: Hoare triple {33727#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33720#(< main_~i~0 1022)} is VALID [2022-04-28 02:51:29,919 INFO L290 TraceCheckUtils]: 86: Hoare triple {33727#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33727#(< main_~i~0 1021)} is VALID [2022-04-28 02:51:29,920 INFO L290 TraceCheckUtils]: 85: Hoare triple {33734#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33727#(< main_~i~0 1021)} is VALID [2022-04-28 02:51:29,920 INFO L290 TraceCheckUtils]: 84: Hoare triple {33734#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33734#(< main_~i~0 1020)} is VALID [2022-04-28 02:51:29,920 INFO L290 TraceCheckUtils]: 83: Hoare triple {33741#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33734#(< main_~i~0 1020)} is VALID [2022-04-28 02:51:29,921 INFO L290 TraceCheckUtils]: 82: Hoare triple {33741#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33741#(< main_~i~0 1019)} is VALID [2022-04-28 02:51:29,921 INFO L290 TraceCheckUtils]: 81: Hoare triple {33748#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33741#(< main_~i~0 1019)} is VALID [2022-04-28 02:51:29,921 INFO L290 TraceCheckUtils]: 80: Hoare triple {33748#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33748#(< main_~i~0 1018)} is VALID [2022-04-28 02:51:29,922 INFO L290 TraceCheckUtils]: 79: Hoare triple {33755#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33748#(< main_~i~0 1018)} is VALID [2022-04-28 02:51:29,922 INFO L290 TraceCheckUtils]: 78: Hoare triple {33755#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33755#(< main_~i~0 1017)} is VALID [2022-04-28 02:51:29,922 INFO L290 TraceCheckUtils]: 77: Hoare triple {33762#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33755#(< main_~i~0 1017)} is VALID [2022-04-28 02:51:29,922 INFO L290 TraceCheckUtils]: 76: Hoare triple {33762#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33762#(< main_~i~0 1016)} is VALID [2022-04-28 02:51:29,923 INFO L290 TraceCheckUtils]: 75: Hoare triple {33769#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33762#(< main_~i~0 1016)} is VALID [2022-04-28 02:51:29,923 INFO L290 TraceCheckUtils]: 74: Hoare triple {33769#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33769#(< main_~i~0 1015)} is VALID [2022-04-28 02:51:29,923 INFO L290 TraceCheckUtils]: 73: Hoare triple {33776#(< main_~i~0 1014)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33769#(< main_~i~0 1015)} is VALID [2022-04-28 02:51:29,924 INFO L290 TraceCheckUtils]: 72: Hoare triple {33776#(< main_~i~0 1014)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33776#(< main_~i~0 1014)} is VALID [2022-04-28 02:51:29,924 INFO L290 TraceCheckUtils]: 71: Hoare triple {33783#(< main_~i~0 1013)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33776#(< main_~i~0 1014)} is VALID [2022-04-28 02:51:29,924 INFO L290 TraceCheckUtils]: 70: Hoare triple {33783#(< main_~i~0 1013)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33783#(< main_~i~0 1013)} is VALID [2022-04-28 02:51:29,925 INFO L290 TraceCheckUtils]: 69: Hoare triple {33790#(< main_~i~0 1012)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33783#(< main_~i~0 1013)} is VALID [2022-04-28 02:51:29,925 INFO L290 TraceCheckUtils]: 68: Hoare triple {33790#(< main_~i~0 1012)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33790#(< main_~i~0 1012)} is VALID [2022-04-28 02:51:29,925 INFO L290 TraceCheckUtils]: 67: Hoare triple {33797#(< main_~i~0 1011)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33790#(< main_~i~0 1012)} is VALID [2022-04-28 02:51:29,925 INFO L290 TraceCheckUtils]: 66: Hoare triple {33797#(< main_~i~0 1011)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33797#(< main_~i~0 1011)} is VALID [2022-04-28 02:51:29,926 INFO L290 TraceCheckUtils]: 65: Hoare triple {33804#(< main_~i~0 1010)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33797#(< main_~i~0 1011)} is VALID [2022-04-28 02:51:29,926 INFO L290 TraceCheckUtils]: 64: Hoare triple {33804#(< main_~i~0 1010)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33804#(< main_~i~0 1010)} is VALID [2022-04-28 02:51:29,926 INFO L290 TraceCheckUtils]: 63: Hoare triple {33811#(< main_~i~0 1009)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33804#(< main_~i~0 1010)} is VALID [2022-04-28 02:51:29,927 INFO L290 TraceCheckUtils]: 62: Hoare triple {33811#(< main_~i~0 1009)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33811#(< main_~i~0 1009)} is VALID [2022-04-28 02:51:29,927 INFO L290 TraceCheckUtils]: 61: Hoare triple {33818#(< main_~i~0 1008)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33811#(< main_~i~0 1009)} is VALID [2022-04-28 02:51:29,927 INFO L290 TraceCheckUtils]: 60: Hoare triple {33818#(< main_~i~0 1008)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33818#(< main_~i~0 1008)} is VALID [2022-04-28 02:51:29,928 INFO L290 TraceCheckUtils]: 59: Hoare triple {33825#(< main_~i~0 1007)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33818#(< main_~i~0 1008)} is VALID [2022-04-28 02:51:29,928 INFO L290 TraceCheckUtils]: 58: Hoare triple {33825#(< main_~i~0 1007)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33825#(< main_~i~0 1007)} is VALID [2022-04-28 02:51:29,928 INFO L290 TraceCheckUtils]: 57: Hoare triple {33832#(< main_~i~0 1006)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33825#(< main_~i~0 1007)} is VALID [2022-04-28 02:51:29,929 INFO L290 TraceCheckUtils]: 56: Hoare triple {33832#(< main_~i~0 1006)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33832#(< main_~i~0 1006)} is VALID [2022-04-28 02:51:29,929 INFO L290 TraceCheckUtils]: 55: Hoare triple {33839#(< main_~i~0 1005)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33832#(< main_~i~0 1006)} is VALID [2022-04-28 02:51:29,929 INFO L290 TraceCheckUtils]: 54: Hoare triple {33839#(< main_~i~0 1005)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33839#(< main_~i~0 1005)} is VALID [2022-04-28 02:51:29,930 INFO L290 TraceCheckUtils]: 53: Hoare triple {33846#(< main_~i~0 1004)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33839#(< main_~i~0 1005)} is VALID [2022-04-28 02:51:29,930 INFO L290 TraceCheckUtils]: 52: Hoare triple {33846#(< main_~i~0 1004)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33846#(< main_~i~0 1004)} is VALID [2022-04-28 02:51:29,930 INFO L290 TraceCheckUtils]: 51: Hoare triple {33853#(< main_~i~0 1003)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33846#(< main_~i~0 1004)} is VALID [2022-04-28 02:51:29,930 INFO L290 TraceCheckUtils]: 50: Hoare triple {33853#(< main_~i~0 1003)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33853#(< main_~i~0 1003)} is VALID [2022-04-28 02:51:29,931 INFO L290 TraceCheckUtils]: 49: Hoare triple {33860#(< main_~i~0 1002)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33853#(< main_~i~0 1003)} is VALID [2022-04-28 02:51:29,931 INFO L290 TraceCheckUtils]: 48: Hoare triple {33860#(< main_~i~0 1002)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33860#(< main_~i~0 1002)} is VALID [2022-04-28 02:51:29,931 INFO L290 TraceCheckUtils]: 47: Hoare triple {33867#(< main_~i~0 1001)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33860#(< main_~i~0 1002)} is VALID [2022-04-28 02:51:29,932 INFO L290 TraceCheckUtils]: 46: Hoare triple {33867#(< main_~i~0 1001)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33867#(< main_~i~0 1001)} is VALID [2022-04-28 02:51:29,932 INFO L290 TraceCheckUtils]: 45: Hoare triple {33874#(< main_~i~0 1000)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33867#(< main_~i~0 1001)} is VALID [2022-04-28 02:51:29,932 INFO L290 TraceCheckUtils]: 44: Hoare triple {33874#(< main_~i~0 1000)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33874#(< main_~i~0 1000)} is VALID [2022-04-28 02:51:29,933 INFO L290 TraceCheckUtils]: 43: Hoare triple {33881#(< main_~i~0 999)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33874#(< main_~i~0 1000)} is VALID [2022-04-28 02:51:29,933 INFO L290 TraceCheckUtils]: 42: Hoare triple {33881#(< main_~i~0 999)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33881#(< main_~i~0 999)} is VALID [2022-04-28 02:51:29,933 INFO L290 TraceCheckUtils]: 41: Hoare triple {33888#(< main_~i~0 998)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33881#(< main_~i~0 999)} is VALID [2022-04-28 02:51:29,933 INFO L290 TraceCheckUtils]: 40: Hoare triple {33888#(< main_~i~0 998)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33888#(< main_~i~0 998)} is VALID [2022-04-28 02:51:29,934 INFO L290 TraceCheckUtils]: 39: Hoare triple {33895#(< main_~i~0 997)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33888#(< main_~i~0 998)} is VALID [2022-04-28 02:51:29,934 INFO L290 TraceCheckUtils]: 38: Hoare triple {33895#(< main_~i~0 997)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33895#(< main_~i~0 997)} is VALID [2022-04-28 02:51:29,934 INFO L290 TraceCheckUtils]: 37: Hoare triple {33902#(< main_~i~0 996)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33895#(< main_~i~0 997)} is VALID [2022-04-28 02:51:29,935 INFO L290 TraceCheckUtils]: 36: Hoare triple {33902#(< main_~i~0 996)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33902#(< main_~i~0 996)} is VALID [2022-04-28 02:51:29,935 INFO L290 TraceCheckUtils]: 35: Hoare triple {33909#(< main_~i~0 995)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33902#(< main_~i~0 996)} is VALID [2022-04-28 02:51:29,935 INFO L290 TraceCheckUtils]: 34: Hoare triple {33909#(< main_~i~0 995)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33909#(< main_~i~0 995)} is VALID [2022-04-28 02:51:29,936 INFO L290 TraceCheckUtils]: 33: Hoare triple {33916#(< main_~i~0 994)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33909#(< main_~i~0 995)} is VALID [2022-04-28 02:51:29,936 INFO L290 TraceCheckUtils]: 32: Hoare triple {33916#(< main_~i~0 994)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33916#(< main_~i~0 994)} is VALID [2022-04-28 02:51:29,936 INFO L290 TraceCheckUtils]: 31: Hoare triple {33923#(< main_~i~0 993)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33916#(< main_~i~0 994)} is VALID [2022-04-28 02:51:29,937 INFO L290 TraceCheckUtils]: 30: Hoare triple {33923#(< main_~i~0 993)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33923#(< main_~i~0 993)} is VALID [2022-04-28 02:51:29,937 INFO L290 TraceCheckUtils]: 29: Hoare triple {33930#(< main_~i~0 992)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33923#(< main_~i~0 993)} is VALID [2022-04-28 02:51:29,938 INFO L290 TraceCheckUtils]: 28: Hoare triple {33930#(< main_~i~0 992)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33930#(< main_~i~0 992)} is VALID [2022-04-28 02:51:29,938 INFO L290 TraceCheckUtils]: 27: Hoare triple {33937#(< main_~i~0 991)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33930#(< main_~i~0 992)} is VALID [2022-04-28 02:51:29,939 INFO L290 TraceCheckUtils]: 26: Hoare triple {33937#(< main_~i~0 991)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33937#(< main_~i~0 991)} is VALID [2022-04-28 02:51:29,939 INFO L290 TraceCheckUtils]: 25: Hoare triple {33944#(< main_~i~0 990)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33937#(< main_~i~0 991)} is VALID [2022-04-28 02:51:29,939 INFO L290 TraceCheckUtils]: 24: Hoare triple {33944#(< main_~i~0 990)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33944#(< main_~i~0 990)} is VALID [2022-04-28 02:51:29,939 INFO L290 TraceCheckUtils]: 23: Hoare triple {33951#(< main_~i~0 989)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33944#(< main_~i~0 990)} is VALID [2022-04-28 02:51:29,940 INFO L290 TraceCheckUtils]: 22: Hoare triple {33951#(< main_~i~0 989)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33951#(< main_~i~0 989)} is VALID [2022-04-28 02:51:29,940 INFO L290 TraceCheckUtils]: 21: Hoare triple {33958#(< main_~i~0 988)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33951#(< main_~i~0 989)} is VALID [2022-04-28 02:51:29,940 INFO L290 TraceCheckUtils]: 20: Hoare triple {33958#(< main_~i~0 988)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33958#(< main_~i~0 988)} is VALID [2022-04-28 02:51:29,941 INFO L290 TraceCheckUtils]: 19: Hoare triple {33965#(< main_~i~0 987)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33958#(< main_~i~0 988)} is VALID [2022-04-28 02:51:29,941 INFO L290 TraceCheckUtils]: 18: Hoare triple {33965#(< main_~i~0 987)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33965#(< main_~i~0 987)} is VALID [2022-04-28 02:51:29,941 INFO L290 TraceCheckUtils]: 17: Hoare triple {33972#(< main_~i~0 986)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33965#(< main_~i~0 987)} is VALID [2022-04-28 02:51:29,942 INFO L290 TraceCheckUtils]: 16: Hoare triple {33972#(< main_~i~0 986)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33972#(< main_~i~0 986)} is VALID [2022-04-28 02:51:29,942 INFO L290 TraceCheckUtils]: 15: Hoare triple {33979#(< main_~i~0 985)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33972#(< main_~i~0 986)} is VALID [2022-04-28 02:51:29,942 INFO L290 TraceCheckUtils]: 14: Hoare triple {33979#(< main_~i~0 985)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33979#(< main_~i~0 985)} is VALID [2022-04-28 02:51:29,943 INFO L290 TraceCheckUtils]: 13: Hoare triple {33986#(< main_~i~0 984)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33979#(< main_~i~0 985)} is VALID [2022-04-28 02:51:29,943 INFO L290 TraceCheckUtils]: 12: Hoare triple {33986#(< main_~i~0 984)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33986#(< main_~i~0 984)} is VALID [2022-04-28 02:51:29,943 INFO L290 TraceCheckUtils]: 11: Hoare triple {33993#(< main_~i~0 983)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33986#(< main_~i~0 984)} is VALID [2022-04-28 02:51:29,943 INFO L290 TraceCheckUtils]: 10: Hoare triple {33993#(< main_~i~0 983)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33993#(< main_~i~0 983)} is VALID [2022-04-28 02:51:29,944 INFO L290 TraceCheckUtils]: 9: Hoare triple {34000#(< main_~i~0 982)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33993#(< main_~i~0 983)} is VALID [2022-04-28 02:51:29,944 INFO L290 TraceCheckUtils]: 8: Hoare triple {34000#(< main_~i~0 982)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34000#(< main_~i~0 982)} is VALID [2022-04-28 02:51:29,944 INFO L290 TraceCheckUtils]: 7: Hoare triple {34007#(< main_~i~0 981)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34000#(< main_~i~0 982)} is VALID [2022-04-28 02:51:29,945 INFO L290 TraceCheckUtils]: 6: Hoare triple {34007#(< main_~i~0 981)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34007#(< main_~i~0 981)} is VALID [2022-04-28 02:51:29,945 INFO L290 TraceCheckUtils]: 5: Hoare triple {33349#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {34007#(< main_~i~0 981)} is VALID [2022-04-28 02:51:29,945 INFO L272 TraceCheckUtils]: 4: Hoare triple {33349#true} call #t~ret6 := main(); {33349#true} is VALID [2022-04-28 02:51:29,945 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33349#true} {33349#true} #39#return; {33349#true} is VALID [2022-04-28 02:51:29,945 INFO L290 TraceCheckUtils]: 2: Hoare triple {33349#true} assume true; {33349#true} is VALID [2022-04-28 02:51:29,945 INFO L290 TraceCheckUtils]: 1: Hoare triple {33349#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {33349#true} is VALID [2022-04-28 02:51:29,945 INFO L272 TraceCheckUtils]: 0: Hoare triple {33349#true} call ULTIMATE.init(); {33349#true} is VALID [2022-04-28 02:51:29,946 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:51:29,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [750194906] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:51:29,946 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:51:29,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 46, 46] total 92 [2022-04-28 02:51:29,946 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:51:29,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [444448124] [2022-04-28 02:51:29,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [444448124] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:51:29,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:51:29,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2022-04-28 02:51:29,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973338471] [2022-04-28 02:51:29,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:51:29,947 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.0) internal successors, (94), 46 states have internal predecessors, (94), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2022-04-28 02:51:29,947 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:51:29,947 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 47 states, 47 states have (on average 2.0) internal successors, (94), 46 states have internal predecessors, (94), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:51:30,008 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:51:30,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-04-28 02:51:30,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:51:30,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-04-28 02:51:30,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4097, Invalid=4275, Unknown=0, NotChecked=0, Total=8372 [2022-04-28 02:51:30,010 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand has 47 states, 47 states have (on average 2.0) internal successors, (94), 46 states have internal predecessors, (94), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:51:31,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:51:31,502 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2022-04-28 02:51:31,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-04-28 02:51:31,502 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.0) internal successors, (94), 46 states have internal predecessors, (94), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2022-04-28 02:51:31,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:51:31,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 2.0) internal successors, (94), 46 states have internal predecessors, (94), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:51:31,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 108 transitions. [2022-04-28 02:51:31,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 2.0) internal successors, (94), 46 states have internal predecessors, (94), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:51:31,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 108 transitions. [2022-04-28 02:51:31,503 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 108 transitions. [2022-04-28 02:51:31,581 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:51:31,582 INFO L225 Difference]: With dead ends: 108 [2022-04-28 02:51:31,582 INFO L226 Difference]: Without dead ends: 102 [2022-04-28 02:51:31,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1203 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=8102, Invalid=10258, Unknown=0, NotChecked=0, Total=18360 [2022-04-28 02:51:31,584 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 96 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:51:31,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 39 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:51:31,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-04-28 02:51:32,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2022-04-28 02:51:32,003 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:51:32,003 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand has 101 states, 96 states have (on average 1.0104166666666667) internal successors, (97), 96 states have internal predecessors, (97), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:51:32,003 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand has 101 states, 96 states have (on average 1.0104166666666667) internal successors, (97), 96 states have internal predecessors, (97), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:51:32,003 INFO L87 Difference]: Start difference. First operand 102 states. Second operand has 101 states, 96 states have (on average 1.0104166666666667) internal successors, (97), 96 states have internal predecessors, (97), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:51:32,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:51:32,004 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2022-04-28 02:51:32,004 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2022-04-28 02:51:32,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:51:32,005 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:51:32,005 INFO L74 IsIncluded]: Start isIncluded. First operand has 101 states, 96 states have (on average 1.0104166666666667) internal successors, (97), 96 states have internal predecessors, (97), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 102 states. [2022-04-28 02:51:32,005 INFO L87 Difference]: Start difference. First operand has 101 states, 96 states have (on average 1.0104166666666667) internal successors, (97), 96 states have internal predecessors, (97), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 102 states. [2022-04-28 02:51:32,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:51:32,006 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2022-04-28 02:51:32,006 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2022-04-28 02:51:32,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:51:32,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:51:32,006 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:51:32,006 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:51:32,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 96 states have (on average 1.0104166666666667) internal successors, (97), 96 states have internal predecessors, (97), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:51:32,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2022-04-28 02:51:32,008 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 98 [2022-04-28 02:51:32,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:51:32,008 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2022-04-28 02:51:32,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 2.0) internal successors, (94), 46 states have internal predecessors, (94), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:51:32,008 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 101 states and 101 transitions. [2022-04-28 02:51:32,135 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:51:32,135 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2022-04-28 02:51:32,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-04-28 02:51:32,136 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:51:32,136 INFO L195 NwaCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:51:32,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2022-04-28 02:51:32,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2022-04-28 02:51:32,359 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:51:32,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:51:32,360 INFO L85 PathProgramCache]: Analyzing trace with hash -751648046, now seen corresponding path program 87 times [2022-04-28 02:51:32,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:51:32,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1672968226] [2022-04-28 02:51:32,363 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:51:32,363 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:51:32,363 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:51:32,363 INFO L85 PathProgramCache]: Analyzing trace with hash -751648046, now seen corresponding path program 88 times [2022-04-28 02:51:32,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:51:32,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737221510] [2022-04-28 02:51:32,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:51:32,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:51:32,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:51:33,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:51:33,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:51:33,184 INFO L290 TraceCheckUtils]: 0: Hoare triple {34791#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {34741#true} is VALID [2022-04-28 02:51:33,184 INFO L290 TraceCheckUtils]: 1: Hoare triple {34741#true} assume true; {34741#true} is VALID [2022-04-28 02:51:33,184 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34741#true} {34741#true} #39#return; {34741#true} is VALID [2022-04-28 02:51:33,184 INFO L272 TraceCheckUtils]: 0: Hoare triple {34741#true} call ULTIMATE.init(); {34791#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:51:33,185 INFO L290 TraceCheckUtils]: 1: Hoare triple {34791#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {34741#true} is VALID [2022-04-28 02:51:33,185 INFO L290 TraceCheckUtils]: 2: Hoare triple {34741#true} assume true; {34741#true} is VALID [2022-04-28 02:51:33,185 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34741#true} {34741#true} #39#return; {34741#true} is VALID [2022-04-28 02:51:33,185 INFO L272 TraceCheckUtils]: 4: Hoare triple {34741#true} call #t~ret6 := main(); {34741#true} is VALID [2022-04-28 02:51:33,185 INFO L290 TraceCheckUtils]: 5: Hoare triple {34741#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {34746#(= main_~i~0 0)} is VALID [2022-04-28 02:51:33,185 INFO L290 TraceCheckUtils]: 6: Hoare triple {34746#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34746#(= main_~i~0 0)} is VALID [2022-04-28 02:51:33,185 INFO L290 TraceCheckUtils]: 7: Hoare triple {34746#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34747#(<= main_~i~0 1)} is VALID [2022-04-28 02:51:33,186 INFO L290 TraceCheckUtils]: 8: Hoare triple {34747#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34747#(<= main_~i~0 1)} is VALID [2022-04-28 02:51:33,186 INFO L290 TraceCheckUtils]: 9: Hoare triple {34747#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34748#(<= main_~i~0 2)} is VALID [2022-04-28 02:51:33,186 INFO L290 TraceCheckUtils]: 10: Hoare triple {34748#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34748#(<= main_~i~0 2)} is VALID [2022-04-28 02:51:33,187 INFO L290 TraceCheckUtils]: 11: Hoare triple {34748#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34749#(<= main_~i~0 3)} is VALID [2022-04-28 02:51:33,187 INFO L290 TraceCheckUtils]: 12: Hoare triple {34749#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34749#(<= main_~i~0 3)} is VALID [2022-04-28 02:51:33,187 INFO L290 TraceCheckUtils]: 13: Hoare triple {34749#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34750#(<= main_~i~0 4)} is VALID [2022-04-28 02:51:33,187 INFO L290 TraceCheckUtils]: 14: Hoare triple {34750#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34750#(<= main_~i~0 4)} is VALID [2022-04-28 02:51:33,188 INFO L290 TraceCheckUtils]: 15: Hoare triple {34750#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34751#(<= main_~i~0 5)} is VALID [2022-04-28 02:51:33,188 INFO L290 TraceCheckUtils]: 16: Hoare triple {34751#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34751#(<= main_~i~0 5)} is VALID [2022-04-28 02:51:33,188 INFO L290 TraceCheckUtils]: 17: Hoare triple {34751#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34752#(<= main_~i~0 6)} is VALID [2022-04-28 02:51:33,189 INFO L290 TraceCheckUtils]: 18: Hoare triple {34752#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34752#(<= main_~i~0 6)} is VALID [2022-04-28 02:51:33,189 INFO L290 TraceCheckUtils]: 19: Hoare triple {34752#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34753#(<= main_~i~0 7)} is VALID [2022-04-28 02:51:33,189 INFO L290 TraceCheckUtils]: 20: Hoare triple {34753#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34753#(<= main_~i~0 7)} is VALID [2022-04-28 02:51:33,190 INFO L290 TraceCheckUtils]: 21: Hoare triple {34753#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34754#(<= main_~i~0 8)} is VALID [2022-04-28 02:51:33,190 INFO L290 TraceCheckUtils]: 22: Hoare triple {34754#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34754#(<= main_~i~0 8)} is VALID [2022-04-28 02:51:33,190 INFO L290 TraceCheckUtils]: 23: Hoare triple {34754#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34755#(<= main_~i~0 9)} is VALID [2022-04-28 02:51:33,190 INFO L290 TraceCheckUtils]: 24: Hoare triple {34755#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34755#(<= main_~i~0 9)} is VALID [2022-04-28 02:51:33,191 INFO L290 TraceCheckUtils]: 25: Hoare triple {34755#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34756#(<= main_~i~0 10)} is VALID [2022-04-28 02:51:33,191 INFO L290 TraceCheckUtils]: 26: Hoare triple {34756#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34756#(<= main_~i~0 10)} is VALID [2022-04-28 02:51:33,191 INFO L290 TraceCheckUtils]: 27: Hoare triple {34756#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34757#(<= main_~i~0 11)} is VALID [2022-04-28 02:51:33,192 INFO L290 TraceCheckUtils]: 28: Hoare triple {34757#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34757#(<= main_~i~0 11)} is VALID [2022-04-28 02:51:33,192 INFO L290 TraceCheckUtils]: 29: Hoare triple {34757#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34758#(<= main_~i~0 12)} is VALID [2022-04-28 02:51:33,192 INFO L290 TraceCheckUtils]: 30: Hoare triple {34758#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34758#(<= main_~i~0 12)} is VALID [2022-04-28 02:51:33,193 INFO L290 TraceCheckUtils]: 31: Hoare triple {34758#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34759#(<= main_~i~0 13)} is VALID [2022-04-28 02:51:33,193 INFO L290 TraceCheckUtils]: 32: Hoare triple {34759#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34759#(<= main_~i~0 13)} is VALID [2022-04-28 02:51:33,193 INFO L290 TraceCheckUtils]: 33: Hoare triple {34759#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34760#(<= main_~i~0 14)} is VALID [2022-04-28 02:51:33,193 INFO L290 TraceCheckUtils]: 34: Hoare triple {34760#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34760#(<= main_~i~0 14)} is VALID [2022-04-28 02:51:33,194 INFO L290 TraceCheckUtils]: 35: Hoare triple {34760#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34761#(<= main_~i~0 15)} is VALID [2022-04-28 02:51:33,194 INFO L290 TraceCheckUtils]: 36: Hoare triple {34761#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34761#(<= main_~i~0 15)} is VALID [2022-04-28 02:51:33,194 INFO L290 TraceCheckUtils]: 37: Hoare triple {34761#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34762#(<= main_~i~0 16)} is VALID [2022-04-28 02:51:33,195 INFO L290 TraceCheckUtils]: 38: Hoare triple {34762#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34762#(<= main_~i~0 16)} is VALID [2022-04-28 02:51:33,195 INFO L290 TraceCheckUtils]: 39: Hoare triple {34762#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34763#(<= main_~i~0 17)} is VALID [2022-04-28 02:51:33,195 INFO L290 TraceCheckUtils]: 40: Hoare triple {34763#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34763#(<= main_~i~0 17)} is VALID [2022-04-28 02:51:33,196 INFO L290 TraceCheckUtils]: 41: Hoare triple {34763#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34764#(<= main_~i~0 18)} is VALID [2022-04-28 02:51:33,196 INFO L290 TraceCheckUtils]: 42: Hoare triple {34764#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34764#(<= main_~i~0 18)} is VALID [2022-04-28 02:51:33,196 INFO L290 TraceCheckUtils]: 43: Hoare triple {34764#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34765#(<= main_~i~0 19)} is VALID [2022-04-28 02:51:33,196 INFO L290 TraceCheckUtils]: 44: Hoare triple {34765#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34765#(<= main_~i~0 19)} is VALID [2022-04-28 02:51:33,197 INFO L290 TraceCheckUtils]: 45: Hoare triple {34765#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34766#(<= main_~i~0 20)} is VALID [2022-04-28 02:51:33,197 INFO L290 TraceCheckUtils]: 46: Hoare triple {34766#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34766#(<= main_~i~0 20)} is VALID [2022-04-28 02:51:33,197 INFO L290 TraceCheckUtils]: 47: Hoare triple {34766#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34767#(<= main_~i~0 21)} is VALID [2022-04-28 02:51:33,198 INFO L290 TraceCheckUtils]: 48: Hoare triple {34767#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34767#(<= main_~i~0 21)} is VALID [2022-04-28 02:51:33,198 INFO L290 TraceCheckUtils]: 49: Hoare triple {34767#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34768#(<= main_~i~0 22)} is VALID [2022-04-28 02:51:33,198 INFO L290 TraceCheckUtils]: 50: Hoare triple {34768#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34768#(<= main_~i~0 22)} is VALID [2022-04-28 02:51:33,199 INFO L290 TraceCheckUtils]: 51: Hoare triple {34768#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34769#(<= main_~i~0 23)} is VALID [2022-04-28 02:51:33,199 INFO L290 TraceCheckUtils]: 52: Hoare triple {34769#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34769#(<= main_~i~0 23)} is VALID [2022-04-28 02:51:33,199 INFO L290 TraceCheckUtils]: 53: Hoare triple {34769#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34770#(<= main_~i~0 24)} is VALID [2022-04-28 02:51:33,199 INFO L290 TraceCheckUtils]: 54: Hoare triple {34770#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34770#(<= main_~i~0 24)} is VALID [2022-04-28 02:51:33,200 INFO L290 TraceCheckUtils]: 55: Hoare triple {34770#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34771#(<= main_~i~0 25)} is VALID [2022-04-28 02:51:33,200 INFO L290 TraceCheckUtils]: 56: Hoare triple {34771#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34771#(<= main_~i~0 25)} is VALID [2022-04-28 02:51:33,200 INFO L290 TraceCheckUtils]: 57: Hoare triple {34771#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34772#(<= main_~i~0 26)} is VALID [2022-04-28 02:51:33,201 INFO L290 TraceCheckUtils]: 58: Hoare triple {34772#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34772#(<= main_~i~0 26)} is VALID [2022-04-28 02:51:33,201 INFO L290 TraceCheckUtils]: 59: Hoare triple {34772#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34773#(<= main_~i~0 27)} is VALID [2022-04-28 02:51:33,201 INFO L290 TraceCheckUtils]: 60: Hoare triple {34773#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34773#(<= main_~i~0 27)} is VALID [2022-04-28 02:51:33,202 INFO L290 TraceCheckUtils]: 61: Hoare triple {34773#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34774#(<= main_~i~0 28)} is VALID [2022-04-28 02:51:33,202 INFO L290 TraceCheckUtils]: 62: Hoare triple {34774#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34774#(<= main_~i~0 28)} is VALID [2022-04-28 02:51:33,202 INFO L290 TraceCheckUtils]: 63: Hoare triple {34774#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34775#(<= main_~i~0 29)} is VALID [2022-04-28 02:51:33,202 INFO L290 TraceCheckUtils]: 64: Hoare triple {34775#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34775#(<= main_~i~0 29)} is VALID [2022-04-28 02:51:33,203 INFO L290 TraceCheckUtils]: 65: Hoare triple {34775#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34776#(<= main_~i~0 30)} is VALID [2022-04-28 02:51:33,203 INFO L290 TraceCheckUtils]: 66: Hoare triple {34776#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34776#(<= main_~i~0 30)} is VALID [2022-04-28 02:51:33,203 INFO L290 TraceCheckUtils]: 67: Hoare triple {34776#(<= main_~i~0 30)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34777#(<= main_~i~0 31)} is VALID [2022-04-28 02:51:33,204 INFO L290 TraceCheckUtils]: 68: Hoare triple {34777#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34777#(<= main_~i~0 31)} is VALID [2022-04-28 02:51:33,204 INFO L290 TraceCheckUtils]: 69: Hoare triple {34777#(<= main_~i~0 31)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34778#(<= main_~i~0 32)} is VALID [2022-04-28 02:51:33,204 INFO L290 TraceCheckUtils]: 70: Hoare triple {34778#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34778#(<= main_~i~0 32)} is VALID [2022-04-28 02:51:33,205 INFO L290 TraceCheckUtils]: 71: Hoare triple {34778#(<= main_~i~0 32)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34779#(<= main_~i~0 33)} is VALID [2022-04-28 02:51:33,205 INFO L290 TraceCheckUtils]: 72: Hoare triple {34779#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34779#(<= main_~i~0 33)} is VALID [2022-04-28 02:51:33,205 INFO L290 TraceCheckUtils]: 73: Hoare triple {34779#(<= main_~i~0 33)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34780#(<= main_~i~0 34)} is VALID [2022-04-28 02:51:33,205 INFO L290 TraceCheckUtils]: 74: Hoare triple {34780#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34780#(<= main_~i~0 34)} is VALID [2022-04-28 02:51:33,206 INFO L290 TraceCheckUtils]: 75: Hoare triple {34780#(<= main_~i~0 34)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34781#(<= main_~i~0 35)} is VALID [2022-04-28 02:51:33,206 INFO L290 TraceCheckUtils]: 76: Hoare triple {34781#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34781#(<= main_~i~0 35)} is VALID [2022-04-28 02:51:33,206 INFO L290 TraceCheckUtils]: 77: Hoare triple {34781#(<= main_~i~0 35)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34782#(<= main_~i~0 36)} is VALID [2022-04-28 02:51:33,207 INFO L290 TraceCheckUtils]: 78: Hoare triple {34782#(<= main_~i~0 36)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34782#(<= main_~i~0 36)} is VALID [2022-04-28 02:51:33,207 INFO L290 TraceCheckUtils]: 79: Hoare triple {34782#(<= main_~i~0 36)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34783#(<= main_~i~0 37)} is VALID [2022-04-28 02:51:33,207 INFO L290 TraceCheckUtils]: 80: Hoare triple {34783#(<= main_~i~0 37)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34783#(<= main_~i~0 37)} is VALID [2022-04-28 02:51:33,208 INFO L290 TraceCheckUtils]: 81: Hoare triple {34783#(<= main_~i~0 37)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34784#(<= main_~i~0 38)} is VALID [2022-04-28 02:51:33,208 INFO L290 TraceCheckUtils]: 82: Hoare triple {34784#(<= main_~i~0 38)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34784#(<= main_~i~0 38)} is VALID [2022-04-28 02:51:33,208 INFO L290 TraceCheckUtils]: 83: Hoare triple {34784#(<= main_~i~0 38)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34785#(<= main_~i~0 39)} is VALID [2022-04-28 02:51:33,208 INFO L290 TraceCheckUtils]: 84: Hoare triple {34785#(<= main_~i~0 39)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34785#(<= main_~i~0 39)} is VALID [2022-04-28 02:51:33,209 INFO L290 TraceCheckUtils]: 85: Hoare triple {34785#(<= main_~i~0 39)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34786#(<= main_~i~0 40)} is VALID [2022-04-28 02:51:33,209 INFO L290 TraceCheckUtils]: 86: Hoare triple {34786#(<= main_~i~0 40)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34786#(<= main_~i~0 40)} is VALID [2022-04-28 02:51:33,209 INFO L290 TraceCheckUtils]: 87: Hoare triple {34786#(<= main_~i~0 40)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34787#(<= main_~i~0 41)} is VALID [2022-04-28 02:51:33,210 INFO L290 TraceCheckUtils]: 88: Hoare triple {34787#(<= main_~i~0 41)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34787#(<= main_~i~0 41)} is VALID [2022-04-28 02:51:33,210 INFO L290 TraceCheckUtils]: 89: Hoare triple {34787#(<= main_~i~0 41)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34788#(<= main_~i~0 42)} is VALID [2022-04-28 02:51:33,210 INFO L290 TraceCheckUtils]: 90: Hoare triple {34788#(<= main_~i~0 42)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34788#(<= main_~i~0 42)} is VALID [2022-04-28 02:51:33,211 INFO L290 TraceCheckUtils]: 91: Hoare triple {34788#(<= main_~i~0 42)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34789#(<= main_~i~0 43)} is VALID [2022-04-28 02:51:33,211 INFO L290 TraceCheckUtils]: 92: Hoare triple {34789#(<= main_~i~0 43)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34789#(<= main_~i~0 43)} is VALID [2022-04-28 02:51:33,211 INFO L290 TraceCheckUtils]: 93: Hoare triple {34789#(<= main_~i~0 43)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34790#(<= main_~i~0 44)} is VALID [2022-04-28 02:51:33,211 INFO L290 TraceCheckUtils]: 94: Hoare triple {34790#(<= main_~i~0 44)} assume !(~i~0 < 1024); {34742#false} is VALID [2022-04-28 02:51:33,212 INFO L290 TraceCheckUtils]: 95: Hoare triple {34742#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {34742#false} is VALID [2022-04-28 02:51:33,212 INFO L272 TraceCheckUtils]: 96: Hoare triple {34742#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {34742#false} is VALID [2022-04-28 02:51:33,212 INFO L290 TraceCheckUtils]: 97: Hoare triple {34742#false} ~cond := #in~cond; {34742#false} is VALID [2022-04-28 02:51:33,212 INFO L290 TraceCheckUtils]: 98: Hoare triple {34742#false} assume 0 == ~cond; {34742#false} is VALID [2022-04-28 02:51:33,212 INFO L290 TraceCheckUtils]: 99: Hoare triple {34742#false} assume !false; {34742#false} is VALID [2022-04-28 02:51:33,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:51:33,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:51:33,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737221510] [2022-04-28 02:51:33,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737221510] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:51:33,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231566446] [2022-04-28 02:51:33,213 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 02:51:33,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:51:33,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:51:33,216 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:51:33,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-04-28 02:51:33,459 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 02:51:33,459 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:51:33,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 46 conjunts are in the unsatisfiable core [2022-04-28 02:51:33,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:51:33,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:51:34,040 INFO L272 TraceCheckUtils]: 0: Hoare triple {34741#true} call ULTIMATE.init(); {34741#true} is VALID [2022-04-28 02:51:34,040 INFO L290 TraceCheckUtils]: 1: Hoare triple {34741#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {34741#true} is VALID [2022-04-28 02:51:34,041 INFO L290 TraceCheckUtils]: 2: Hoare triple {34741#true} assume true; {34741#true} is VALID [2022-04-28 02:51:34,041 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34741#true} {34741#true} #39#return; {34741#true} is VALID [2022-04-28 02:51:34,041 INFO L272 TraceCheckUtils]: 4: Hoare triple {34741#true} call #t~ret6 := main(); {34741#true} is VALID [2022-04-28 02:51:34,041 INFO L290 TraceCheckUtils]: 5: Hoare triple {34741#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {34810#(<= main_~i~0 0)} is VALID [2022-04-28 02:51:34,041 INFO L290 TraceCheckUtils]: 6: Hoare triple {34810#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34810#(<= main_~i~0 0)} is VALID [2022-04-28 02:51:34,042 INFO L290 TraceCheckUtils]: 7: Hoare triple {34810#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34747#(<= main_~i~0 1)} is VALID [2022-04-28 02:51:34,042 INFO L290 TraceCheckUtils]: 8: Hoare triple {34747#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34747#(<= main_~i~0 1)} is VALID [2022-04-28 02:51:34,042 INFO L290 TraceCheckUtils]: 9: Hoare triple {34747#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34748#(<= main_~i~0 2)} is VALID [2022-04-28 02:51:34,043 INFO L290 TraceCheckUtils]: 10: Hoare triple {34748#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34748#(<= main_~i~0 2)} is VALID [2022-04-28 02:51:34,043 INFO L290 TraceCheckUtils]: 11: Hoare triple {34748#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34749#(<= main_~i~0 3)} is VALID [2022-04-28 02:51:34,043 INFO L290 TraceCheckUtils]: 12: Hoare triple {34749#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34749#(<= main_~i~0 3)} is VALID [2022-04-28 02:51:34,043 INFO L290 TraceCheckUtils]: 13: Hoare triple {34749#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34750#(<= main_~i~0 4)} is VALID [2022-04-28 02:51:34,044 INFO L290 TraceCheckUtils]: 14: Hoare triple {34750#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34750#(<= main_~i~0 4)} is VALID [2022-04-28 02:51:34,044 INFO L290 TraceCheckUtils]: 15: Hoare triple {34750#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34751#(<= main_~i~0 5)} is VALID [2022-04-28 02:51:34,044 INFO L290 TraceCheckUtils]: 16: Hoare triple {34751#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34751#(<= main_~i~0 5)} is VALID [2022-04-28 02:51:34,045 INFO L290 TraceCheckUtils]: 17: Hoare triple {34751#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34752#(<= main_~i~0 6)} is VALID [2022-04-28 02:51:34,045 INFO L290 TraceCheckUtils]: 18: Hoare triple {34752#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34752#(<= main_~i~0 6)} is VALID [2022-04-28 02:51:34,045 INFO L290 TraceCheckUtils]: 19: Hoare triple {34752#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34753#(<= main_~i~0 7)} is VALID [2022-04-28 02:51:34,046 INFO L290 TraceCheckUtils]: 20: Hoare triple {34753#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34753#(<= main_~i~0 7)} is VALID [2022-04-28 02:51:34,046 INFO L290 TraceCheckUtils]: 21: Hoare triple {34753#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34754#(<= main_~i~0 8)} is VALID [2022-04-28 02:51:34,046 INFO L290 TraceCheckUtils]: 22: Hoare triple {34754#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34754#(<= main_~i~0 8)} is VALID [2022-04-28 02:51:34,047 INFO L290 TraceCheckUtils]: 23: Hoare triple {34754#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34755#(<= main_~i~0 9)} is VALID [2022-04-28 02:51:34,047 INFO L290 TraceCheckUtils]: 24: Hoare triple {34755#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34755#(<= main_~i~0 9)} is VALID [2022-04-28 02:51:34,047 INFO L290 TraceCheckUtils]: 25: Hoare triple {34755#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34756#(<= main_~i~0 10)} is VALID [2022-04-28 02:51:34,047 INFO L290 TraceCheckUtils]: 26: Hoare triple {34756#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34756#(<= main_~i~0 10)} is VALID [2022-04-28 02:51:34,048 INFO L290 TraceCheckUtils]: 27: Hoare triple {34756#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34757#(<= main_~i~0 11)} is VALID [2022-04-28 02:51:34,048 INFO L290 TraceCheckUtils]: 28: Hoare triple {34757#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34757#(<= main_~i~0 11)} is VALID [2022-04-28 02:51:34,048 INFO L290 TraceCheckUtils]: 29: Hoare triple {34757#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34758#(<= main_~i~0 12)} is VALID [2022-04-28 02:51:34,049 INFO L290 TraceCheckUtils]: 30: Hoare triple {34758#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34758#(<= main_~i~0 12)} is VALID [2022-04-28 02:51:34,049 INFO L290 TraceCheckUtils]: 31: Hoare triple {34758#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34759#(<= main_~i~0 13)} is VALID [2022-04-28 02:51:34,049 INFO L290 TraceCheckUtils]: 32: Hoare triple {34759#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34759#(<= main_~i~0 13)} is VALID [2022-04-28 02:51:34,050 INFO L290 TraceCheckUtils]: 33: Hoare triple {34759#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34760#(<= main_~i~0 14)} is VALID [2022-04-28 02:51:34,050 INFO L290 TraceCheckUtils]: 34: Hoare triple {34760#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34760#(<= main_~i~0 14)} is VALID [2022-04-28 02:51:34,050 INFO L290 TraceCheckUtils]: 35: Hoare triple {34760#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34761#(<= main_~i~0 15)} is VALID [2022-04-28 02:51:34,061 INFO L290 TraceCheckUtils]: 36: Hoare triple {34761#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34761#(<= main_~i~0 15)} is VALID [2022-04-28 02:51:34,061 INFO L290 TraceCheckUtils]: 37: Hoare triple {34761#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34762#(<= main_~i~0 16)} is VALID [2022-04-28 02:51:34,062 INFO L290 TraceCheckUtils]: 38: Hoare triple {34762#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34762#(<= main_~i~0 16)} is VALID [2022-04-28 02:51:34,062 INFO L290 TraceCheckUtils]: 39: Hoare triple {34762#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34763#(<= main_~i~0 17)} is VALID [2022-04-28 02:51:34,062 INFO L290 TraceCheckUtils]: 40: Hoare triple {34763#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34763#(<= main_~i~0 17)} is VALID [2022-04-28 02:51:34,063 INFO L290 TraceCheckUtils]: 41: Hoare triple {34763#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34764#(<= main_~i~0 18)} is VALID [2022-04-28 02:51:34,063 INFO L290 TraceCheckUtils]: 42: Hoare triple {34764#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34764#(<= main_~i~0 18)} is VALID [2022-04-28 02:51:34,063 INFO L290 TraceCheckUtils]: 43: Hoare triple {34764#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34765#(<= main_~i~0 19)} is VALID [2022-04-28 02:51:34,064 INFO L290 TraceCheckUtils]: 44: Hoare triple {34765#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34765#(<= main_~i~0 19)} is VALID [2022-04-28 02:51:34,064 INFO L290 TraceCheckUtils]: 45: Hoare triple {34765#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34766#(<= main_~i~0 20)} is VALID [2022-04-28 02:51:34,064 INFO L290 TraceCheckUtils]: 46: Hoare triple {34766#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34766#(<= main_~i~0 20)} is VALID [2022-04-28 02:51:34,065 INFO L290 TraceCheckUtils]: 47: Hoare triple {34766#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34767#(<= main_~i~0 21)} is VALID [2022-04-28 02:51:34,065 INFO L290 TraceCheckUtils]: 48: Hoare triple {34767#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34767#(<= main_~i~0 21)} is VALID [2022-04-28 02:51:34,065 INFO L290 TraceCheckUtils]: 49: Hoare triple {34767#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34768#(<= main_~i~0 22)} is VALID [2022-04-28 02:51:34,065 INFO L290 TraceCheckUtils]: 50: Hoare triple {34768#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34768#(<= main_~i~0 22)} is VALID [2022-04-28 02:51:34,066 INFO L290 TraceCheckUtils]: 51: Hoare triple {34768#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34769#(<= main_~i~0 23)} is VALID [2022-04-28 02:51:34,066 INFO L290 TraceCheckUtils]: 52: Hoare triple {34769#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34769#(<= main_~i~0 23)} is VALID [2022-04-28 02:51:34,066 INFO L290 TraceCheckUtils]: 53: Hoare triple {34769#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34770#(<= main_~i~0 24)} is VALID [2022-04-28 02:51:34,067 INFO L290 TraceCheckUtils]: 54: Hoare triple {34770#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34770#(<= main_~i~0 24)} is VALID [2022-04-28 02:51:34,067 INFO L290 TraceCheckUtils]: 55: Hoare triple {34770#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34771#(<= main_~i~0 25)} is VALID [2022-04-28 02:51:34,067 INFO L290 TraceCheckUtils]: 56: Hoare triple {34771#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34771#(<= main_~i~0 25)} is VALID [2022-04-28 02:51:34,068 INFO L290 TraceCheckUtils]: 57: Hoare triple {34771#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34772#(<= main_~i~0 26)} is VALID [2022-04-28 02:51:34,068 INFO L290 TraceCheckUtils]: 58: Hoare triple {34772#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34772#(<= main_~i~0 26)} is VALID [2022-04-28 02:51:34,068 INFO L290 TraceCheckUtils]: 59: Hoare triple {34772#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34773#(<= main_~i~0 27)} is VALID [2022-04-28 02:51:34,069 INFO L290 TraceCheckUtils]: 60: Hoare triple {34773#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34773#(<= main_~i~0 27)} is VALID [2022-04-28 02:51:34,069 INFO L290 TraceCheckUtils]: 61: Hoare triple {34773#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34774#(<= main_~i~0 28)} is VALID [2022-04-28 02:51:34,069 INFO L290 TraceCheckUtils]: 62: Hoare triple {34774#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34774#(<= main_~i~0 28)} is VALID [2022-04-28 02:51:34,069 INFO L290 TraceCheckUtils]: 63: Hoare triple {34774#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34775#(<= main_~i~0 29)} is VALID [2022-04-28 02:51:34,070 INFO L290 TraceCheckUtils]: 64: Hoare triple {34775#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34775#(<= main_~i~0 29)} is VALID [2022-04-28 02:51:34,070 INFO L290 TraceCheckUtils]: 65: Hoare triple {34775#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34776#(<= main_~i~0 30)} is VALID [2022-04-28 02:51:34,070 INFO L290 TraceCheckUtils]: 66: Hoare triple {34776#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34776#(<= main_~i~0 30)} is VALID [2022-04-28 02:51:34,071 INFO L290 TraceCheckUtils]: 67: Hoare triple {34776#(<= main_~i~0 30)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34777#(<= main_~i~0 31)} is VALID [2022-04-28 02:51:34,071 INFO L290 TraceCheckUtils]: 68: Hoare triple {34777#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34777#(<= main_~i~0 31)} is VALID [2022-04-28 02:51:34,071 INFO L290 TraceCheckUtils]: 69: Hoare triple {34777#(<= main_~i~0 31)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34778#(<= main_~i~0 32)} is VALID [2022-04-28 02:51:34,072 INFO L290 TraceCheckUtils]: 70: Hoare triple {34778#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34778#(<= main_~i~0 32)} is VALID [2022-04-28 02:51:34,072 INFO L290 TraceCheckUtils]: 71: Hoare triple {34778#(<= main_~i~0 32)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34779#(<= main_~i~0 33)} is VALID [2022-04-28 02:51:34,072 INFO L290 TraceCheckUtils]: 72: Hoare triple {34779#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34779#(<= main_~i~0 33)} is VALID [2022-04-28 02:51:34,073 INFO L290 TraceCheckUtils]: 73: Hoare triple {34779#(<= main_~i~0 33)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34780#(<= main_~i~0 34)} is VALID [2022-04-28 02:51:34,073 INFO L290 TraceCheckUtils]: 74: Hoare triple {34780#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34780#(<= main_~i~0 34)} is VALID [2022-04-28 02:51:34,073 INFO L290 TraceCheckUtils]: 75: Hoare triple {34780#(<= main_~i~0 34)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34781#(<= main_~i~0 35)} is VALID [2022-04-28 02:51:34,073 INFO L290 TraceCheckUtils]: 76: Hoare triple {34781#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34781#(<= main_~i~0 35)} is VALID [2022-04-28 02:51:34,074 INFO L290 TraceCheckUtils]: 77: Hoare triple {34781#(<= main_~i~0 35)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34782#(<= main_~i~0 36)} is VALID [2022-04-28 02:51:34,074 INFO L290 TraceCheckUtils]: 78: Hoare triple {34782#(<= main_~i~0 36)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34782#(<= main_~i~0 36)} is VALID [2022-04-28 02:51:34,074 INFO L290 TraceCheckUtils]: 79: Hoare triple {34782#(<= main_~i~0 36)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34783#(<= main_~i~0 37)} is VALID [2022-04-28 02:51:34,075 INFO L290 TraceCheckUtils]: 80: Hoare triple {34783#(<= main_~i~0 37)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34783#(<= main_~i~0 37)} is VALID [2022-04-28 02:51:34,075 INFO L290 TraceCheckUtils]: 81: Hoare triple {34783#(<= main_~i~0 37)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34784#(<= main_~i~0 38)} is VALID [2022-04-28 02:51:34,075 INFO L290 TraceCheckUtils]: 82: Hoare triple {34784#(<= main_~i~0 38)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34784#(<= main_~i~0 38)} is VALID [2022-04-28 02:51:34,076 INFO L290 TraceCheckUtils]: 83: Hoare triple {34784#(<= main_~i~0 38)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34785#(<= main_~i~0 39)} is VALID [2022-04-28 02:51:34,076 INFO L290 TraceCheckUtils]: 84: Hoare triple {34785#(<= main_~i~0 39)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34785#(<= main_~i~0 39)} is VALID [2022-04-28 02:51:34,076 INFO L290 TraceCheckUtils]: 85: Hoare triple {34785#(<= main_~i~0 39)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34786#(<= main_~i~0 40)} is VALID [2022-04-28 02:51:34,076 INFO L290 TraceCheckUtils]: 86: Hoare triple {34786#(<= main_~i~0 40)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34786#(<= main_~i~0 40)} is VALID [2022-04-28 02:51:34,077 INFO L290 TraceCheckUtils]: 87: Hoare triple {34786#(<= main_~i~0 40)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34787#(<= main_~i~0 41)} is VALID [2022-04-28 02:51:34,077 INFO L290 TraceCheckUtils]: 88: Hoare triple {34787#(<= main_~i~0 41)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34787#(<= main_~i~0 41)} is VALID [2022-04-28 02:51:34,077 INFO L290 TraceCheckUtils]: 89: Hoare triple {34787#(<= main_~i~0 41)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34788#(<= main_~i~0 42)} is VALID [2022-04-28 02:51:34,078 INFO L290 TraceCheckUtils]: 90: Hoare triple {34788#(<= main_~i~0 42)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34788#(<= main_~i~0 42)} is VALID [2022-04-28 02:51:34,078 INFO L290 TraceCheckUtils]: 91: Hoare triple {34788#(<= main_~i~0 42)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34789#(<= main_~i~0 43)} is VALID [2022-04-28 02:51:34,078 INFO L290 TraceCheckUtils]: 92: Hoare triple {34789#(<= main_~i~0 43)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34789#(<= main_~i~0 43)} is VALID [2022-04-28 02:51:34,079 INFO L290 TraceCheckUtils]: 93: Hoare triple {34789#(<= main_~i~0 43)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34790#(<= main_~i~0 44)} is VALID [2022-04-28 02:51:34,079 INFO L290 TraceCheckUtils]: 94: Hoare triple {34790#(<= main_~i~0 44)} assume !(~i~0 < 1024); {34742#false} is VALID [2022-04-28 02:51:34,079 INFO L290 TraceCheckUtils]: 95: Hoare triple {34742#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {34742#false} is VALID [2022-04-28 02:51:34,079 INFO L272 TraceCheckUtils]: 96: Hoare triple {34742#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {34742#false} is VALID [2022-04-28 02:51:34,079 INFO L290 TraceCheckUtils]: 97: Hoare triple {34742#false} ~cond := #in~cond; {34742#false} is VALID [2022-04-28 02:51:34,079 INFO L290 TraceCheckUtils]: 98: Hoare triple {34742#false} assume 0 == ~cond; {34742#false} is VALID [2022-04-28 02:51:34,079 INFO L290 TraceCheckUtils]: 99: Hoare triple {34742#false} assume !false; {34742#false} is VALID [2022-04-28 02:51:34,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:51:34,080 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:51:36,587 INFO L290 TraceCheckUtils]: 99: Hoare triple {34742#false} assume !false; {34742#false} is VALID [2022-04-28 02:51:36,588 INFO L290 TraceCheckUtils]: 98: Hoare triple {34742#false} assume 0 == ~cond; {34742#false} is VALID [2022-04-28 02:51:36,588 INFO L290 TraceCheckUtils]: 97: Hoare triple {34742#false} ~cond := #in~cond; {34742#false} is VALID [2022-04-28 02:51:36,588 INFO L272 TraceCheckUtils]: 96: Hoare triple {34742#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {34742#false} is VALID [2022-04-28 02:51:36,588 INFO L290 TraceCheckUtils]: 95: Hoare triple {34742#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {34742#false} is VALID [2022-04-28 02:51:36,588 INFO L290 TraceCheckUtils]: 94: Hoare triple {35108#(< main_~i~0 1024)} assume !(~i~0 < 1024); {34742#false} is VALID [2022-04-28 02:51:36,589 INFO L290 TraceCheckUtils]: 93: Hoare triple {35112#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35108#(< main_~i~0 1024)} is VALID [2022-04-28 02:51:36,589 INFO L290 TraceCheckUtils]: 92: Hoare triple {35112#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35112#(< main_~i~0 1023)} is VALID [2022-04-28 02:51:36,589 INFO L290 TraceCheckUtils]: 91: Hoare triple {35119#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35112#(< main_~i~0 1023)} is VALID [2022-04-28 02:51:36,590 INFO L290 TraceCheckUtils]: 90: Hoare triple {35119#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35119#(< main_~i~0 1022)} is VALID [2022-04-28 02:51:36,590 INFO L290 TraceCheckUtils]: 89: Hoare triple {35126#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35119#(< main_~i~0 1022)} is VALID [2022-04-28 02:51:36,591 INFO L290 TraceCheckUtils]: 88: Hoare triple {35126#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35126#(< main_~i~0 1021)} is VALID [2022-04-28 02:51:36,591 INFO L290 TraceCheckUtils]: 87: Hoare triple {35133#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35126#(< main_~i~0 1021)} is VALID [2022-04-28 02:51:36,591 INFO L290 TraceCheckUtils]: 86: Hoare triple {35133#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35133#(< main_~i~0 1020)} is VALID [2022-04-28 02:51:36,592 INFO L290 TraceCheckUtils]: 85: Hoare triple {35140#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35133#(< main_~i~0 1020)} is VALID [2022-04-28 02:51:36,592 INFO L290 TraceCheckUtils]: 84: Hoare triple {35140#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35140#(< main_~i~0 1019)} is VALID [2022-04-28 02:51:36,593 INFO L290 TraceCheckUtils]: 83: Hoare triple {35147#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35140#(< main_~i~0 1019)} is VALID [2022-04-28 02:51:36,593 INFO L290 TraceCheckUtils]: 82: Hoare triple {35147#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35147#(< main_~i~0 1018)} is VALID [2022-04-28 02:51:36,593 INFO L290 TraceCheckUtils]: 81: Hoare triple {35154#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35147#(< main_~i~0 1018)} is VALID [2022-04-28 02:51:36,594 INFO L290 TraceCheckUtils]: 80: Hoare triple {35154#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35154#(< main_~i~0 1017)} is VALID [2022-04-28 02:51:36,594 INFO L290 TraceCheckUtils]: 79: Hoare triple {35161#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35154#(< main_~i~0 1017)} is VALID [2022-04-28 02:51:36,594 INFO L290 TraceCheckUtils]: 78: Hoare triple {35161#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35161#(< main_~i~0 1016)} is VALID [2022-04-28 02:51:36,595 INFO L290 TraceCheckUtils]: 77: Hoare triple {35168#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35161#(< main_~i~0 1016)} is VALID [2022-04-28 02:51:36,595 INFO L290 TraceCheckUtils]: 76: Hoare triple {35168#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35168#(< main_~i~0 1015)} is VALID [2022-04-28 02:51:36,596 INFO L290 TraceCheckUtils]: 75: Hoare triple {35175#(< main_~i~0 1014)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35168#(< main_~i~0 1015)} is VALID [2022-04-28 02:51:36,596 INFO L290 TraceCheckUtils]: 74: Hoare triple {35175#(< main_~i~0 1014)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35175#(< main_~i~0 1014)} is VALID [2022-04-28 02:51:36,597 INFO L290 TraceCheckUtils]: 73: Hoare triple {35182#(< main_~i~0 1013)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35175#(< main_~i~0 1014)} is VALID [2022-04-28 02:51:36,597 INFO L290 TraceCheckUtils]: 72: Hoare triple {35182#(< main_~i~0 1013)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35182#(< main_~i~0 1013)} is VALID [2022-04-28 02:51:36,597 INFO L290 TraceCheckUtils]: 71: Hoare triple {35189#(< main_~i~0 1012)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35182#(< main_~i~0 1013)} is VALID [2022-04-28 02:51:36,598 INFO L290 TraceCheckUtils]: 70: Hoare triple {35189#(< main_~i~0 1012)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35189#(< main_~i~0 1012)} is VALID [2022-04-28 02:51:36,598 INFO L290 TraceCheckUtils]: 69: Hoare triple {35196#(< main_~i~0 1011)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35189#(< main_~i~0 1012)} is VALID [2022-04-28 02:51:36,598 INFO L290 TraceCheckUtils]: 68: Hoare triple {35196#(< main_~i~0 1011)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35196#(< main_~i~0 1011)} is VALID [2022-04-28 02:51:36,599 INFO L290 TraceCheckUtils]: 67: Hoare triple {35203#(< main_~i~0 1010)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35196#(< main_~i~0 1011)} is VALID [2022-04-28 02:51:36,599 INFO L290 TraceCheckUtils]: 66: Hoare triple {35203#(< main_~i~0 1010)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35203#(< main_~i~0 1010)} is VALID [2022-04-28 02:51:36,600 INFO L290 TraceCheckUtils]: 65: Hoare triple {35210#(< main_~i~0 1009)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35203#(< main_~i~0 1010)} is VALID [2022-04-28 02:51:36,600 INFO L290 TraceCheckUtils]: 64: Hoare triple {35210#(< main_~i~0 1009)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35210#(< main_~i~0 1009)} is VALID [2022-04-28 02:51:36,600 INFO L290 TraceCheckUtils]: 63: Hoare triple {35217#(< main_~i~0 1008)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35210#(< main_~i~0 1009)} is VALID [2022-04-28 02:51:36,601 INFO L290 TraceCheckUtils]: 62: Hoare triple {35217#(< main_~i~0 1008)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35217#(< main_~i~0 1008)} is VALID [2022-04-28 02:51:36,601 INFO L290 TraceCheckUtils]: 61: Hoare triple {35224#(< main_~i~0 1007)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35217#(< main_~i~0 1008)} is VALID [2022-04-28 02:51:36,601 INFO L290 TraceCheckUtils]: 60: Hoare triple {35224#(< main_~i~0 1007)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35224#(< main_~i~0 1007)} is VALID [2022-04-28 02:51:36,602 INFO L290 TraceCheckUtils]: 59: Hoare triple {35231#(< main_~i~0 1006)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35224#(< main_~i~0 1007)} is VALID [2022-04-28 02:51:36,602 INFO L290 TraceCheckUtils]: 58: Hoare triple {35231#(< main_~i~0 1006)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35231#(< main_~i~0 1006)} is VALID [2022-04-28 02:51:36,603 INFO L290 TraceCheckUtils]: 57: Hoare triple {35238#(< main_~i~0 1005)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35231#(< main_~i~0 1006)} is VALID [2022-04-28 02:51:36,603 INFO L290 TraceCheckUtils]: 56: Hoare triple {35238#(< main_~i~0 1005)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35238#(< main_~i~0 1005)} is VALID [2022-04-28 02:51:36,604 INFO L290 TraceCheckUtils]: 55: Hoare triple {35245#(< main_~i~0 1004)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35238#(< main_~i~0 1005)} is VALID [2022-04-28 02:51:36,604 INFO L290 TraceCheckUtils]: 54: Hoare triple {35245#(< main_~i~0 1004)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35245#(< main_~i~0 1004)} is VALID [2022-04-28 02:51:36,604 INFO L290 TraceCheckUtils]: 53: Hoare triple {35252#(< main_~i~0 1003)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35245#(< main_~i~0 1004)} is VALID [2022-04-28 02:51:36,605 INFO L290 TraceCheckUtils]: 52: Hoare triple {35252#(< main_~i~0 1003)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35252#(< main_~i~0 1003)} is VALID [2022-04-28 02:51:36,605 INFO L290 TraceCheckUtils]: 51: Hoare triple {35259#(< main_~i~0 1002)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35252#(< main_~i~0 1003)} is VALID [2022-04-28 02:51:36,605 INFO L290 TraceCheckUtils]: 50: Hoare triple {35259#(< main_~i~0 1002)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35259#(< main_~i~0 1002)} is VALID [2022-04-28 02:51:36,606 INFO L290 TraceCheckUtils]: 49: Hoare triple {35266#(< main_~i~0 1001)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35259#(< main_~i~0 1002)} is VALID [2022-04-28 02:51:36,606 INFO L290 TraceCheckUtils]: 48: Hoare triple {35266#(< main_~i~0 1001)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35266#(< main_~i~0 1001)} is VALID [2022-04-28 02:51:36,607 INFO L290 TraceCheckUtils]: 47: Hoare triple {35273#(< main_~i~0 1000)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35266#(< main_~i~0 1001)} is VALID [2022-04-28 02:51:36,607 INFO L290 TraceCheckUtils]: 46: Hoare triple {35273#(< main_~i~0 1000)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35273#(< main_~i~0 1000)} is VALID [2022-04-28 02:51:36,607 INFO L290 TraceCheckUtils]: 45: Hoare triple {35280#(< main_~i~0 999)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35273#(< main_~i~0 1000)} is VALID [2022-04-28 02:51:36,608 INFO L290 TraceCheckUtils]: 44: Hoare triple {35280#(< main_~i~0 999)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35280#(< main_~i~0 999)} is VALID [2022-04-28 02:51:36,608 INFO L290 TraceCheckUtils]: 43: Hoare triple {35287#(< main_~i~0 998)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35280#(< main_~i~0 999)} is VALID [2022-04-28 02:51:36,609 INFO L290 TraceCheckUtils]: 42: Hoare triple {35287#(< main_~i~0 998)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35287#(< main_~i~0 998)} is VALID [2022-04-28 02:51:36,609 INFO L290 TraceCheckUtils]: 41: Hoare triple {35294#(< main_~i~0 997)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35287#(< main_~i~0 998)} is VALID [2022-04-28 02:51:36,609 INFO L290 TraceCheckUtils]: 40: Hoare triple {35294#(< main_~i~0 997)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35294#(< main_~i~0 997)} is VALID [2022-04-28 02:51:36,610 INFO L290 TraceCheckUtils]: 39: Hoare triple {35301#(< main_~i~0 996)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35294#(< main_~i~0 997)} is VALID [2022-04-28 02:51:36,610 INFO L290 TraceCheckUtils]: 38: Hoare triple {35301#(< main_~i~0 996)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35301#(< main_~i~0 996)} is VALID [2022-04-28 02:51:36,611 INFO L290 TraceCheckUtils]: 37: Hoare triple {35308#(< main_~i~0 995)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35301#(< main_~i~0 996)} is VALID [2022-04-28 02:51:36,611 INFO L290 TraceCheckUtils]: 36: Hoare triple {35308#(< main_~i~0 995)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35308#(< main_~i~0 995)} is VALID [2022-04-28 02:51:36,611 INFO L290 TraceCheckUtils]: 35: Hoare triple {35315#(< main_~i~0 994)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35308#(< main_~i~0 995)} is VALID [2022-04-28 02:51:36,612 INFO L290 TraceCheckUtils]: 34: Hoare triple {35315#(< main_~i~0 994)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35315#(< main_~i~0 994)} is VALID [2022-04-28 02:51:36,612 INFO L290 TraceCheckUtils]: 33: Hoare triple {35322#(< main_~i~0 993)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35315#(< main_~i~0 994)} is VALID [2022-04-28 02:51:36,612 INFO L290 TraceCheckUtils]: 32: Hoare triple {35322#(< main_~i~0 993)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35322#(< main_~i~0 993)} is VALID [2022-04-28 02:51:36,613 INFO L290 TraceCheckUtils]: 31: Hoare triple {35329#(< main_~i~0 992)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35322#(< main_~i~0 993)} is VALID [2022-04-28 02:51:36,613 INFO L290 TraceCheckUtils]: 30: Hoare triple {35329#(< main_~i~0 992)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35329#(< main_~i~0 992)} is VALID [2022-04-28 02:51:36,614 INFO L290 TraceCheckUtils]: 29: Hoare triple {35336#(< main_~i~0 991)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35329#(< main_~i~0 992)} is VALID [2022-04-28 02:51:36,614 INFO L290 TraceCheckUtils]: 28: Hoare triple {35336#(< main_~i~0 991)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35336#(< main_~i~0 991)} is VALID [2022-04-28 02:51:36,615 INFO L290 TraceCheckUtils]: 27: Hoare triple {35343#(< main_~i~0 990)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35336#(< main_~i~0 991)} is VALID [2022-04-28 02:51:36,615 INFO L290 TraceCheckUtils]: 26: Hoare triple {35343#(< main_~i~0 990)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35343#(< main_~i~0 990)} is VALID [2022-04-28 02:51:36,615 INFO L290 TraceCheckUtils]: 25: Hoare triple {35350#(< main_~i~0 989)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35343#(< main_~i~0 990)} is VALID [2022-04-28 02:51:36,616 INFO L290 TraceCheckUtils]: 24: Hoare triple {35350#(< main_~i~0 989)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35350#(< main_~i~0 989)} is VALID [2022-04-28 02:51:36,616 INFO L290 TraceCheckUtils]: 23: Hoare triple {35357#(< main_~i~0 988)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35350#(< main_~i~0 989)} is VALID [2022-04-28 02:51:36,616 INFO L290 TraceCheckUtils]: 22: Hoare triple {35357#(< main_~i~0 988)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35357#(< main_~i~0 988)} is VALID [2022-04-28 02:51:36,617 INFO L290 TraceCheckUtils]: 21: Hoare triple {35364#(< main_~i~0 987)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35357#(< main_~i~0 988)} is VALID [2022-04-28 02:51:36,617 INFO L290 TraceCheckUtils]: 20: Hoare triple {35364#(< main_~i~0 987)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35364#(< main_~i~0 987)} is VALID [2022-04-28 02:51:36,618 INFO L290 TraceCheckUtils]: 19: Hoare triple {35371#(< main_~i~0 986)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35364#(< main_~i~0 987)} is VALID [2022-04-28 02:51:36,618 INFO L290 TraceCheckUtils]: 18: Hoare triple {35371#(< main_~i~0 986)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35371#(< main_~i~0 986)} is VALID [2022-04-28 02:51:36,618 INFO L290 TraceCheckUtils]: 17: Hoare triple {35378#(< main_~i~0 985)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35371#(< main_~i~0 986)} is VALID [2022-04-28 02:51:36,619 INFO L290 TraceCheckUtils]: 16: Hoare triple {35378#(< main_~i~0 985)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35378#(< main_~i~0 985)} is VALID [2022-04-28 02:51:36,619 INFO L290 TraceCheckUtils]: 15: Hoare triple {35385#(< main_~i~0 984)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35378#(< main_~i~0 985)} is VALID [2022-04-28 02:51:36,620 INFO L290 TraceCheckUtils]: 14: Hoare triple {35385#(< main_~i~0 984)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35385#(< main_~i~0 984)} is VALID [2022-04-28 02:51:36,620 INFO L290 TraceCheckUtils]: 13: Hoare triple {35392#(< main_~i~0 983)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35385#(< main_~i~0 984)} is VALID [2022-04-28 02:51:36,620 INFO L290 TraceCheckUtils]: 12: Hoare triple {35392#(< main_~i~0 983)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35392#(< main_~i~0 983)} is VALID [2022-04-28 02:51:36,621 INFO L290 TraceCheckUtils]: 11: Hoare triple {35399#(< main_~i~0 982)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35392#(< main_~i~0 983)} is VALID [2022-04-28 02:51:36,621 INFO L290 TraceCheckUtils]: 10: Hoare triple {35399#(< main_~i~0 982)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35399#(< main_~i~0 982)} is VALID [2022-04-28 02:51:36,622 INFO L290 TraceCheckUtils]: 9: Hoare triple {35406#(< main_~i~0 981)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35399#(< main_~i~0 982)} is VALID [2022-04-28 02:51:36,622 INFO L290 TraceCheckUtils]: 8: Hoare triple {35406#(< main_~i~0 981)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35406#(< main_~i~0 981)} is VALID [2022-04-28 02:51:36,623 INFO L290 TraceCheckUtils]: 7: Hoare triple {35413#(< main_~i~0 980)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35406#(< main_~i~0 981)} is VALID [2022-04-28 02:51:36,623 INFO L290 TraceCheckUtils]: 6: Hoare triple {35413#(< main_~i~0 980)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35413#(< main_~i~0 980)} is VALID [2022-04-28 02:51:36,623 INFO L290 TraceCheckUtils]: 5: Hoare triple {34741#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {35413#(< main_~i~0 980)} is VALID [2022-04-28 02:51:36,624 INFO L272 TraceCheckUtils]: 4: Hoare triple {34741#true} call #t~ret6 := main(); {34741#true} is VALID [2022-04-28 02:51:36,624 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34741#true} {34741#true} #39#return; {34741#true} is VALID [2022-04-28 02:51:36,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {34741#true} assume true; {34741#true} is VALID [2022-04-28 02:51:36,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {34741#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {34741#true} is VALID [2022-04-28 02:51:36,624 INFO L272 TraceCheckUtils]: 0: Hoare triple {34741#true} call ULTIMATE.init(); {34741#true} is VALID [2022-04-28 02:51:36,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:51:36,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231566446] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:51:36,625 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:51:36,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 47, 47] total 94 [2022-04-28 02:51:36,625 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:51:36,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1672968226] [2022-04-28 02:51:36,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1672968226] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:51:36,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:51:36,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2022-04-28 02:51:36,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800701305] [2022-04-28 02:51:36,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:51:36,626 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.0) internal successors, (96), 47 states have internal predecessors, (96), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 100 [2022-04-28 02:51:36,626 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:51:36,626 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 48 states, 48 states have (on average 2.0) internal successors, (96), 47 states have internal predecessors, (96), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:51:36,690 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:51:36,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-04-28 02:51:36,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:51:36,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-04-28 02:51:36,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4280, Invalid=4462, Unknown=0, NotChecked=0, Total=8742 [2022-04-28 02:51:36,692 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand has 48 states, 48 states have (on average 2.0) internal successors, (96), 47 states have internal predecessors, (96), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:51:38,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:51:38,251 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2022-04-28 02:51:38,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-04-28 02:51:38,251 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.0) internal successors, (96), 47 states have internal predecessors, (96), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 100 [2022-04-28 02:51:38,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:51:38,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 2.0) internal successors, (96), 47 states have internal predecessors, (96), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:51:38,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 110 transitions. [2022-04-28 02:51:38,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 2.0) internal successors, (96), 47 states have internal predecessors, (96), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:51:38,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 110 transitions. [2022-04-28 02:51:38,253 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 110 transitions. [2022-04-28 02:51:38,358 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:51:38,359 INFO L225 Difference]: With dead ends: 110 [2022-04-28 02:51:38,359 INFO L226 Difference]: Without dead ends: 104 [2022-04-28 02:51:38,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1253 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=8466, Invalid=10716, Unknown=0, NotChecked=0, Total=19182 [2022-04-28 02:51:38,361 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 98 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:51:38,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 29 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:51:38,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-04-28 02:51:38,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2022-04-28 02:51:38,802 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:51:38,802 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand has 103 states, 98 states have (on average 1.010204081632653) internal successors, (99), 98 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:51:38,802 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand has 103 states, 98 states have (on average 1.010204081632653) internal successors, (99), 98 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:51:38,802 INFO L87 Difference]: Start difference. First operand 104 states. Second operand has 103 states, 98 states have (on average 1.010204081632653) internal successors, (99), 98 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:51:38,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:51:38,803 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2022-04-28 02:51:38,803 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2022-04-28 02:51:38,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:51:38,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:51:38,803 INFO L74 IsIncluded]: Start isIncluded. First operand has 103 states, 98 states have (on average 1.010204081632653) internal successors, (99), 98 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 104 states. [2022-04-28 02:51:38,803 INFO L87 Difference]: Start difference. First operand has 103 states, 98 states have (on average 1.010204081632653) internal successors, (99), 98 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 104 states. [2022-04-28 02:51:38,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:51:38,804 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2022-04-28 02:51:38,804 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2022-04-28 02:51:38,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:51:38,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:51:38,804 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:51:38,804 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:51:38,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 98 states have (on average 1.010204081632653) internal successors, (99), 98 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:51:38,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2022-04-28 02:51:38,805 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 100 [2022-04-28 02:51:38,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:51:38,805 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2022-04-28 02:51:38,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 2.0) internal successors, (96), 47 states have internal predecessors, (96), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:51:38,806 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 103 states and 103 transitions. [2022-04-28 02:51:38,920 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:51:38,920 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2022-04-28 02:51:38,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-04-28 02:51:38,921 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:51:38,921 INFO L195 NwaCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:51:38,938 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-28 02:51:39,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-04-28 02:51:39,121 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:51:39,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:51:39,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1653354028, now seen corresponding path program 89 times [2022-04-28 02:51:39,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:51:39,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [978300245] [2022-04-28 02:51:39,127 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:51:39,127 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:51:39,127 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:51:39,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1653354028, now seen corresponding path program 90 times [2022-04-28 02:51:39,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:51:39,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931867835] [2022-04-28 02:51:39,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:51:39,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:51:39,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:51:39,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:51:39,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:51:39,967 INFO L290 TraceCheckUtils]: 0: Hoare triple {36212#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {36161#true} is VALID [2022-04-28 02:51:39,967 INFO L290 TraceCheckUtils]: 1: Hoare triple {36161#true} assume true; {36161#true} is VALID [2022-04-28 02:51:39,968 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36161#true} {36161#true} #39#return; {36161#true} is VALID [2022-04-28 02:51:39,968 INFO L272 TraceCheckUtils]: 0: Hoare triple {36161#true} call ULTIMATE.init(); {36212#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:51:39,968 INFO L290 TraceCheckUtils]: 1: Hoare triple {36212#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {36161#true} is VALID [2022-04-28 02:51:39,968 INFO L290 TraceCheckUtils]: 2: Hoare triple {36161#true} assume true; {36161#true} is VALID [2022-04-28 02:51:39,968 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36161#true} {36161#true} #39#return; {36161#true} is VALID [2022-04-28 02:51:39,968 INFO L272 TraceCheckUtils]: 4: Hoare triple {36161#true} call #t~ret6 := main(); {36161#true} is VALID [2022-04-28 02:51:39,968 INFO L290 TraceCheckUtils]: 5: Hoare triple {36161#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {36166#(= main_~i~0 0)} is VALID [2022-04-28 02:51:39,969 INFO L290 TraceCheckUtils]: 6: Hoare triple {36166#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36166#(= main_~i~0 0)} is VALID [2022-04-28 02:51:39,969 INFO L290 TraceCheckUtils]: 7: Hoare triple {36166#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36167#(<= main_~i~0 1)} is VALID [2022-04-28 02:51:39,969 INFO L290 TraceCheckUtils]: 8: Hoare triple {36167#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36167#(<= main_~i~0 1)} is VALID [2022-04-28 02:51:39,970 INFO L290 TraceCheckUtils]: 9: Hoare triple {36167#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36168#(<= main_~i~0 2)} is VALID [2022-04-28 02:51:39,970 INFO L290 TraceCheckUtils]: 10: Hoare triple {36168#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36168#(<= main_~i~0 2)} is VALID [2022-04-28 02:51:39,970 INFO L290 TraceCheckUtils]: 11: Hoare triple {36168#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36169#(<= main_~i~0 3)} is VALID [2022-04-28 02:51:39,970 INFO L290 TraceCheckUtils]: 12: Hoare triple {36169#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36169#(<= main_~i~0 3)} is VALID [2022-04-28 02:51:39,971 INFO L290 TraceCheckUtils]: 13: Hoare triple {36169#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36170#(<= main_~i~0 4)} is VALID [2022-04-28 02:51:39,971 INFO L290 TraceCheckUtils]: 14: Hoare triple {36170#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36170#(<= main_~i~0 4)} is VALID [2022-04-28 02:51:39,971 INFO L290 TraceCheckUtils]: 15: Hoare triple {36170#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36171#(<= main_~i~0 5)} is VALID [2022-04-28 02:51:39,972 INFO L290 TraceCheckUtils]: 16: Hoare triple {36171#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36171#(<= main_~i~0 5)} is VALID [2022-04-28 02:51:39,972 INFO L290 TraceCheckUtils]: 17: Hoare triple {36171#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36172#(<= main_~i~0 6)} is VALID [2022-04-28 02:51:39,972 INFO L290 TraceCheckUtils]: 18: Hoare triple {36172#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36172#(<= main_~i~0 6)} is VALID [2022-04-28 02:51:39,973 INFO L290 TraceCheckUtils]: 19: Hoare triple {36172#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36173#(<= main_~i~0 7)} is VALID [2022-04-28 02:51:39,973 INFO L290 TraceCheckUtils]: 20: Hoare triple {36173#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36173#(<= main_~i~0 7)} is VALID [2022-04-28 02:51:39,973 INFO L290 TraceCheckUtils]: 21: Hoare triple {36173#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36174#(<= main_~i~0 8)} is VALID [2022-04-28 02:51:39,973 INFO L290 TraceCheckUtils]: 22: Hoare triple {36174#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36174#(<= main_~i~0 8)} is VALID [2022-04-28 02:51:39,974 INFO L290 TraceCheckUtils]: 23: Hoare triple {36174#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36175#(<= main_~i~0 9)} is VALID [2022-04-28 02:51:39,974 INFO L290 TraceCheckUtils]: 24: Hoare triple {36175#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36175#(<= main_~i~0 9)} is VALID [2022-04-28 02:51:39,974 INFO L290 TraceCheckUtils]: 25: Hoare triple {36175#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36176#(<= main_~i~0 10)} is VALID [2022-04-28 02:51:39,975 INFO L290 TraceCheckUtils]: 26: Hoare triple {36176#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36176#(<= main_~i~0 10)} is VALID [2022-04-28 02:51:39,975 INFO L290 TraceCheckUtils]: 27: Hoare triple {36176#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36177#(<= main_~i~0 11)} is VALID [2022-04-28 02:51:39,975 INFO L290 TraceCheckUtils]: 28: Hoare triple {36177#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36177#(<= main_~i~0 11)} is VALID [2022-04-28 02:51:39,976 INFO L290 TraceCheckUtils]: 29: Hoare triple {36177#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36178#(<= main_~i~0 12)} is VALID [2022-04-28 02:51:39,976 INFO L290 TraceCheckUtils]: 30: Hoare triple {36178#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36178#(<= main_~i~0 12)} is VALID [2022-04-28 02:51:39,976 INFO L290 TraceCheckUtils]: 31: Hoare triple {36178#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36179#(<= main_~i~0 13)} is VALID [2022-04-28 02:51:39,977 INFO L290 TraceCheckUtils]: 32: Hoare triple {36179#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36179#(<= main_~i~0 13)} is VALID [2022-04-28 02:51:39,977 INFO L290 TraceCheckUtils]: 33: Hoare triple {36179#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36180#(<= main_~i~0 14)} is VALID [2022-04-28 02:51:39,977 INFO L290 TraceCheckUtils]: 34: Hoare triple {36180#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36180#(<= main_~i~0 14)} is VALID [2022-04-28 02:51:39,977 INFO L290 TraceCheckUtils]: 35: Hoare triple {36180#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36181#(<= main_~i~0 15)} is VALID [2022-04-28 02:51:39,978 INFO L290 TraceCheckUtils]: 36: Hoare triple {36181#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36181#(<= main_~i~0 15)} is VALID [2022-04-28 02:51:39,978 INFO L290 TraceCheckUtils]: 37: Hoare triple {36181#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36182#(<= main_~i~0 16)} is VALID [2022-04-28 02:51:39,978 INFO L290 TraceCheckUtils]: 38: Hoare triple {36182#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36182#(<= main_~i~0 16)} is VALID [2022-04-28 02:51:39,979 INFO L290 TraceCheckUtils]: 39: Hoare triple {36182#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36183#(<= main_~i~0 17)} is VALID [2022-04-28 02:51:39,979 INFO L290 TraceCheckUtils]: 40: Hoare triple {36183#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36183#(<= main_~i~0 17)} is VALID [2022-04-28 02:51:39,979 INFO L290 TraceCheckUtils]: 41: Hoare triple {36183#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36184#(<= main_~i~0 18)} is VALID [2022-04-28 02:51:39,980 INFO L290 TraceCheckUtils]: 42: Hoare triple {36184#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36184#(<= main_~i~0 18)} is VALID [2022-04-28 02:51:39,980 INFO L290 TraceCheckUtils]: 43: Hoare triple {36184#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36185#(<= main_~i~0 19)} is VALID [2022-04-28 02:51:39,980 INFO L290 TraceCheckUtils]: 44: Hoare triple {36185#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36185#(<= main_~i~0 19)} is VALID [2022-04-28 02:51:39,981 INFO L290 TraceCheckUtils]: 45: Hoare triple {36185#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36186#(<= main_~i~0 20)} is VALID [2022-04-28 02:51:39,981 INFO L290 TraceCheckUtils]: 46: Hoare triple {36186#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36186#(<= main_~i~0 20)} is VALID [2022-04-28 02:51:39,981 INFO L290 TraceCheckUtils]: 47: Hoare triple {36186#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36187#(<= main_~i~0 21)} is VALID [2022-04-28 02:51:39,981 INFO L290 TraceCheckUtils]: 48: Hoare triple {36187#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36187#(<= main_~i~0 21)} is VALID [2022-04-28 02:51:39,982 INFO L290 TraceCheckUtils]: 49: Hoare triple {36187#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36188#(<= main_~i~0 22)} is VALID [2022-04-28 02:51:39,982 INFO L290 TraceCheckUtils]: 50: Hoare triple {36188#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36188#(<= main_~i~0 22)} is VALID [2022-04-28 02:51:39,982 INFO L290 TraceCheckUtils]: 51: Hoare triple {36188#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36189#(<= main_~i~0 23)} is VALID [2022-04-28 02:51:39,983 INFO L290 TraceCheckUtils]: 52: Hoare triple {36189#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36189#(<= main_~i~0 23)} is VALID [2022-04-28 02:51:39,983 INFO L290 TraceCheckUtils]: 53: Hoare triple {36189#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36190#(<= main_~i~0 24)} is VALID [2022-04-28 02:51:39,983 INFO L290 TraceCheckUtils]: 54: Hoare triple {36190#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36190#(<= main_~i~0 24)} is VALID [2022-04-28 02:51:39,984 INFO L290 TraceCheckUtils]: 55: Hoare triple {36190#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36191#(<= main_~i~0 25)} is VALID [2022-04-28 02:51:39,984 INFO L290 TraceCheckUtils]: 56: Hoare triple {36191#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36191#(<= main_~i~0 25)} is VALID [2022-04-28 02:51:39,984 INFO L290 TraceCheckUtils]: 57: Hoare triple {36191#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36192#(<= main_~i~0 26)} is VALID [2022-04-28 02:51:39,984 INFO L290 TraceCheckUtils]: 58: Hoare triple {36192#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36192#(<= main_~i~0 26)} is VALID [2022-04-28 02:51:39,985 INFO L290 TraceCheckUtils]: 59: Hoare triple {36192#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36193#(<= main_~i~0 27)} is VALID [2022-04-28 02:51:39,985 INFO L290 TraceCheckUtils]: 60: Hoare triple {36193#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36193#(<= main_~i~0 27)} is VALID [2022-04-28 02:51:39,985 INFO L290 TraceCheckUtils]: 61: Hoare triple {36193#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36194#(<= main_~i~0 28)} is VALID [2022-04-28 02:51:39,986 INFO L290 TraceCheckUtils]: 62: Hoare triple {36194#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36194#(<= main_~i~0 28)} is VALID [2022-04-28 02:51:39,986 INFO L290 TraceCheckUtils]: 63: Hoare triple {36194#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36195#(<= main_~i~0 29)} is VALID [2022-04-28 02:51:39,986 INFO L290 TraceCheckUtils]: 64: Hoare triple {36195#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36195#(<= main_~i~0 29)} is VALID [2022-04-28 02:51:39,987 INFO L290 TraceCheckUtils]: 65: Hoare triple {36195#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36196#(<= main_~i~0 30)} is VALID [2022-04-28 02:51:39,987 INFO L290 TraceCheckUtils]: 66: Hoare triple {36196#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36196#(<= main_~i~0 30)} is VALID [2022-04-28 02:51:39,987 INFO L290 TraceCheckUtils]: 67: Hoare triple {36196#(<= main_~i~0 30)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36197#(<= main_~i~0 31)} is VALID [2022-04-28 02:51:39,988 INFO L290 TraceCheckUtils]: 68: Hoare triple {36197#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36197#(<= main_~i~0 31)} is VALID [2022-04-28 02:51:39,988 INFO L290 TraceCheckUtils]: 69: Hoare triple {36197#(<= main_~i~0 31)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36198#(<= main_~i~0 32)} is VALID [2022-04-28 02:51:39,988 INFO L290 TraceCheckUtils]: 70: Hoare triple {36198#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36198#(<= main_~i~0 32)} is VALID [2022-04-28 02:51:39,989 INFO L290 TraceCheckUtils]: 71: Hoare triple {36198#(<= main_~i~0 32)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36199#(<= main_~i~0 33)} is VALID [2022-04-28 02:51:39,989 INFO L290 TraceCheckUtils]: 72: Hoare triple {36199#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36199#(<= main_~i~0 33)} is VALID [2022-04-28 02:51:39,989 INFO L290 TraceCheckUtils]: 73: Hoare triple {36199#(<= main_~i~0 33)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36200#(<= main_~i~0 34)} is VALID [2022-04-28 02:51:39,989 INFO L290 TraceCheckUtils]: 74: Hoare triple {36200#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36200#(<= main_~i~0 34)} is VALID [2022-04-28 02:51:39,990 INFO L290 TraceCheckUtils]: 75: Hoare triple {36200#(<= main_~i~0 34)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36201#(<= main_~i~0 35)} is VALID [2022-04-28 02:51:39,990 INFO L290 TraceCheckUtils]: 76: Hoare triple {36201#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36201#(<= main_~i~0 35)} is VALID [2022-04-28 02:51:39,990 INFO L290 TraceCheckUtils]: 77: Hoare triple {36201#(<= main_~i~0 35)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36202#(<= main_~i~0 36)} is VALID [2022-04-28 02:51:39,991 INFO L290 TraceCheckUtils]: 78: Hoare triple {36202#(<= main_~i~0 36)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36202#(<= main_~i~0 36)} is VALID [2022-04-28 02:51:39,991 INFO L290 TraceCheckUtils]: 79: Hoare triple {36202#(<= main_~i~0 36)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36203#(<= main_~i~0 37)} is VALID [2022-04-28 02:51:39,991 INFO L290 TraceCheckUtils]: 80: Hoare triple {36203#(<= main_~i~0 37)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36203#(<= main_~i~0 37)} is VALID [2022-04-28 02:51:39,992 INFO L290 TraceCheckUtils]: 81: Hoare triple {36203#(<= main_~i~0 37)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36204#(<= main_~i~0 38)} is VALID [2022-04-28 02:51:39,992 INFO L290 TraceCheckUtils]: 82: Hoare triple {36204#(<= main_~i~0 38)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36204#(<= main_~i~0 38)} is VALID [2022-04-28 02:51:39,992 INFO L290 TraceCheckUtils]: 83: Hoare triple {36204#(<= main_~i~0 38)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36205#(<= main_~i~0 39)} is VALID [2022-04-28 02:51:39,992 INFO L290 TraceCheckUtils]: 84: Hoare triple {36205#(<= main_~i~0 39)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36205#(<= main_~i~0 39)} is VALID [2022-04-28 02:51:39,993 INFO L290 TraceCheckUtils]: 85: Hoare triple {36205#(<= main_~i~0 39)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36206#(<= main_~i~0 40)} is VALID [2022-04-28 02:51:39,993 INFO L290 TraceCheckUtils]: 86: Hoare triple {36206#(<= main_~i~0 40)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36206#(<= main_~i~0 40)} is VALID [2022-04-28 02:51:39,993 INFO L290 TraceCheckUtils]: 87: Hoare triple {36206#(<= main_~i~0 40)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36207#(<= main_~i~0 41)} is VALID [2022-04-28 02:51:39,994 INFO L290 TraceCheckUtils]: 88: Hoare triple {36207#(<= main_~i~0 41)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36207#(<= main_~i~0 41)} is VALID [2022-04-28 02:51:39,994 INFO L290 TraceCheckUtils]: 89: Hoare triple {36207#(<= main_~i~0 41)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36208#(<= main_~i~0 42)} is VALID [2022-04-28 02:51:39,994 INFO L290 TraceCheckUtils]: 90: Hoare triple {36208#(<= main_~i~0 42)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36208#(<= main_~i~0 42)} is VALID [2022-04-28 02:51:39,995 INFO L290 TraceCheckUtils]: 91: Hoare triple {36208#(<= main_~i~0 42)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36209#(<= main_~i~0 43)} is VALID [2022-04-28 02:51:39,995 INFO L290 TraceCheckUtils]: 92: Hoare triple {36209#(<= main_~i~0 43)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36209#(<= main_~i~0 43)} is VALID [2022-04-28 02:51:39,995 INFO L290 TraceCheckUtils]: 93: Hoare triple {36209#(<= main_~i~0 43)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36210#(<= main_~i~0 44)} is VALID [2022-04-28 02:51:39,996 INFO L290 TraceCheckUtils]: 94: Hoare triple {36210#(<= main_~i~0 44)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36210#(<= main_~i~0 44)} is VALID [2022-04-28 02:51:39,996 INFO L290 TraceCheckUtils]: 95: Hoare triple {36210#(<= main_~i~0 44)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36211#(<= main_~i~0 45)} is VALID [2022-04-28 02:51:39,996 INFO L290 TraceCheckUtils]: 96: Hoare triple {36211#(<= main_~i~0 45)} assume !(~i~0 < 1024); {36162#false} is VALID [2022-04-28 02:51:39,996 INFO L290 TraceCheckUtils]: 97: Hoare triple {36162#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {36162#false} is VALID [2022-04-28 02:51:39,996 INFO L272 TraceCheckUtils]: 98: Hoare triple {36162#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {36162#false} is VALID [2022-04-28 02:51:39,996 INFO L290 TraceCheckUtils]: 99: Hoare triple {36162#false} ~cond := #in~cond; {36162#false} is VALID [2022-04-28 02:51:39,996 INFO L290 TraceCheckUtils]: 100: Hoare triple {36162#false} assume 0 == ~cond; {36162#false} is VALID [2022-04-28 02:51:39,996 INFO L290 TraceCheckUtils]: 101: Hoare triple {36162#false} assume !false; {36162#false} is VALID [2022-04-28 02:51:39,997 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:51:39,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:51:39,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931867835] [2022-04-28 02:51:39,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931867835] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:51:39,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [895236294] [2022-04-28 02:51:39,997 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 02:51:39,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:51:39,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:51:39,998 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:51:40,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-04-28 02:56:45,956 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 46 check-sat command(s) [2022-04-28 02:56:45,956 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:56:46,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-28 02:56:46,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:46,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:56:46,804 INFO L272 TraceCheckUtils]: 0: Hoare triple {36161#true} call ULTIMATE.init(); {36161#true} is VALID [2022-04-28 02:56:46,804 INFO L290 TraceCheckUtils]: 1: Hoare triple {36161#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {36161#true} is VALID [2022-04-28 02:56:46,804 INFO L290 TraceCheckUtils]: 2: Hoare triple {36161#true} assume true; {36161#true} is VALID [2022-04-28 02:56:46,804 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36161#true} {36161#true} #39#return; {36161#true} is VALID [2022-04-28 02:56:46,804 INFO L272 TraceCheckUtils]: 4: Hoare triple {36161#true} call #t~ret6 := main(); {36161#true} is VALID [2022-04-28 02:56:46,805 INFO L290 TraceCheckUtils]: 5: Hoare triple {36161#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {36231#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:46,805 INFO L290 TraceCheckUtils]: 6: Hoare triple {36231#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36231#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:46,805 INFO L290 TraceCheckUtils]: 7: Hoare triple {36231#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36167#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:46,805 INFO L290 TraceCheckUtils]: 8: Hoare triple {36167#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36167#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:46,806 INFO L290 TraceCheckUtils]: 9: Hoare triple {36167#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36168#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:46,806 INFO L290 TraceCheckUtils]: 10: Hoare triple {36168#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36168#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:46,806 INFO L290 TraceCheckUtils]: 11: Hoare triple {36168#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36169#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:46,807 INFO L290 TraceCheckUtils]: 12: Hoare triple {36169#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36169#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:46,807 INFO L290 TraceCheckUtils]: 13: Hoare triple {36169#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36170#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:46,807 INFO L290 TraceCheckUtils]: 14: Hoare triple {36170#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36170#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:46,808 INFO L290 TraceCheckUtils]: 15: Hoare triple {36170#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36171#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:46,808 INFO L290 TraceCheckUtils]: 16: Hoare triple {36171#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36171#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:46,808 INFO L290 TraceCheckUtils]: 17: Hoare triple {36171#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36172#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:46,809 INFO L290 TraceCheckUtils]: 18: Hoare triple {36172#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36172#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:46,809 INFO L290 TraceCheckUtils]: 19: Hoare triple {36172#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36173#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:46,809 INFO L290 TraceCheckUtils]: 20: Hoare triple {36173#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36173#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:46,810 INFO L290 TraceCheckUtils]: 21: Hoare triple {36173#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36174#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:46,810 INFO L290 TraceCheckUtils]: 22: Hoare triple {36174#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36174#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:46,810 INFO L290 TraceCheckUtils]: 23: Hoare triple {36174#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36175#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:46,811 INFO L290 TraceCheckUtils]: 24: Hoare triple {36175#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36175#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:46,811 INFO L290 TraceCheckUtils]: 25: Hoare triple {36175#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36176#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:46,811 INFO L290 TraceCheckUtils]: 26: Hoare triple {36176#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36176#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:46,812 INFO L290 TraceCheckUtils]: 27: Hoare triple {36176#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36177#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:46,812 INFO L290 TraceCheckUtils]: 28: Hoare triple {36177#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36177#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:46,812 INFO L290 TraceCheckUtils]: 29: Hoare triple {36177#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36178#(<= main_~i~0 12)} is VALID [2022-04-28 02:56:46,812 INFO L290 TraceCheckUtils]: 30: Hoare triple {36178#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36178#(<= main_~i~0 12)} is VALID [2022-04-28 02:56:46,813 INFO L290 TraceCheckUtils]: 31: Hoare triple {36178#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36179#(<= main_~i~0 13)} is VALID [2022-04-28 02:56:46,813 INFO L290 TraceCheckUtils]: 32: Hoare triple {36179#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36179#(<= main_~i~0 13)} is VALID [2022-04-28 02:56:46,813 INFO L290 TraceCheckUtils]: 33: Hoare triple {36179#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36180#(<= main_~i~0 14)} is VALID [2022-04-28 02:56:46,814 INFO L290 TraceCheckUtils]: 34: Hoare triple {36180#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36180#(<= main_~i~0 14)} is VALID [2022-04-28 02:56:46,814 INFO L290 TraceCheckUtils]: 35: Hoare triple {36180#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36181#(<= main_~i~0 15)} is VALID [2022-04-28 02:56:46,814 INFO L290 TraceCheckUtils]: 36: Hoare triple {36181#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36181#(<= main_~i~0 15)} is VALID [2022-04-28 02:56:46,815 INFO L290 TraceCheckUtils]: 37: Hoare triple {36181#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36182#(<= main_~i~0 16)} is VALID [2022-04-28 02:56:46,815 INFO L290 TraceCheckUtils]: 38: Hoare triple {36182#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36182#(<= main_~i~0 16)} is VALID [2022-04-28 02:56:46,815 INFO L290 TraceCheckUtils]: 39: Hoare triple {36182#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36183#(<= main_~i~0 17)} is VALID [2022-04-28 02:56:46,815 INFO L290 TraceCheckUtils]: 40: Hoare triple {36183#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36183#(<= main_~i~0 17)} is VALID [2022-04-28 02:56:46,816 INFO L290 TraceCheckUtils]: 41: Hoare triple {36183#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36184#(<= main_~i~0 18)} is VALID [2022-04-28 02:56:46,816 INFO L290 TraceCheckUtils]: 42: Hoare triple {36184#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36184#(<= main_~i~0 18)} is VALID [2022-04-28 02:56:46,816 INFO L290 TraceCheckUtils]: 43: Hoare triple {36184#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36185#(<= main_~i~0 19)} is VALID [2022-04-28 02:56:46,817 INFO L290 TraceCheckUtils]: 44: Hoare triple {36185#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36185#(<= main_~i~0 19)} is VALID [2022-04-28 02:56:46,817 INFO L290 TraceCheckUtils]: 45: Hoare triple {36185#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36186#(<= main_~i~0 20)} is VALID [2022-04-28 02:56:46,817 INFO L290 TraceCheckUtils]: 46: Hoare triple {36186#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36186#(<= main_~i~0 20)} is VALID [2022-04-28 02:56:46,818 INFO L290 TraceCheckUtils]: 47: Hoare triple {36186#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36187#(<= main_~i~0 21)} is VALID [2022-04-28 02:56:46,818 INFO L290 TraceCheckUtils]: 48: Hoare triple {36187#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36187#(<= main_~i~0 21)} is VALID [2022-04-28 02:56:46,818 INFO L290 TraceCheckUtils]: 49: Hoare triple {36187#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36188#(<= main_~i~0 22)} is VALID [2022-04-28 02:56:46,819 INFO L290 TraceCheckUtils]: 50: Hoare triple {36188#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36188#(<= main_~i~0 22)} is VALID [2022-04-28 02:56:46,819 INFO L290 TraceCheckUtils]: 51: Hoare triple {36188#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36189#(<= main_~i~0 23)} is VALID [2022-04-28 02:56:46,819 INFO L290 TraceCheckUtils]: 52: Hoare triple {36189#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36189#(<= main_~i~0 23)} is VALID [2022-04-28 02:56:46,820 INFO L290 TraceCheckUtils]: 53: Hoare triple {36189#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36190#(<= main_~i~0 24)} is VALID [2022-04-28 02:56:46,820 INFO L290 TraceCheckUtils]: 54: Hoare triple {36190#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36190#(<= main_~i~0 24)} is VALID [2022-04-28 02:56:46,820 INFO L290 TraceCheckUtils]: 55: Hoare triple {36190#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36191#(<= main_~i~0 25)} is VALID [2022-04-28 02:56:46,820 INFO L290 TraceCheckUtils]: 56: Hoare triple {36191#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36191#(<= main_~i~0 25)} is VALID [2022-04-28 02:56:46,821 INFO L290 TraceCheckUtils]: 57: Hoare triple {36191#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36192#(<= main_~i~0 26)} is VALID [2022-04-28 02:56:46,821 INFO L290 TraceCheckUtils]: 58: Hoare triple {36192#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36192#(<= main_~i~0 26)} is VALID [2022-04-28 02:56:46,821 INFO L290 TraceCheckUtils]: 59: Hoare triple {36192#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36193#(<= main_~i~0 27)} is VALID [2022-04-28 02:56:46,822 INFO L290 TraceCheckUtils]: 60: Hoare triple {36193#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36193#(<= main_~i~0 27)} is VALID [2022-04-28 02:56:46,822 INFO L290 TraceCheckUtils]: 61: Hoare triple {36193#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36194#(<= main_~i~0 28)} is VALID [2022-04-28 02:56:46,822 INFO L290 TraceCheckUtils]: 62: Hoare triple {36194#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36194#(<= main_~i~0 28)} is VALID [2022-04-28 02:56:46,823 INFO L290 TraceCheckUtils]: 63: Hoare triple {36194#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36195#(<= main_~i~0 29)} is VALID [2022-04-28 02:56:46,823 INFO L290 TraceCheckUtils]: 64: Hoare triple {36195#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36195#(<= main_~i~0 29)} is VALID [2022-04-28 02:56:46,823 INFO L290 TraceCheckUtils]: 65: Hoare triple {36195#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36196#(<= main_~i~0 30)} is VALID [2022-04-28 02:56:46,824 INFO L290 TraceCheckUtils]: 66: Hoare triple {36196#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36196#(<= main_~i~0 30)} is VALID [2022-04-28 02:56:46,824 INFO L290 TraceCheckUtils]: 67: Hoare triple {36196#(<= main_~i~0 30)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36197#(<= main_~i~0 31)} is VALID [2022-04-28 02:56:46,824 INFO L290 TraceCheckUtils]: 68: Hoare triple {36197#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36197#(<= main_~i~0 31)} is VALID [2022-04-28 02:56:46,824 INFO L290 TraceCheckUtils]: 69: Hoare triple {36197#(<= main_~i~0 31)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36198#(<= main_~i~0 32)} is VALID [2022-04-28 02:56:46,825 INFO L290 TraceCheckUtils]: 70: Hoare triple {36198#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36198#(<= main_~i~0 32)} is VALID [2022-04-28 02:56:46,825 INFO L290 TraceCheckUtils]: 71: Hoare triple {36198#(<= main_~i~0 32)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36199#(<= main_~i~0 33)} is VALID [2022-04-28 02:56:46,825 INFO L290 TraceCheckUtils]: 72: Hoare triple {36199#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36199#(<= main_~i~0 33)} is VALID [2022-04-28 02:56:46,826 INFO L290 TraceCheckUtils]: 73: Hoare triple {36199#(<= main_~i~0 33)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36200#(<= main_~i~0 34)} is VALID [2022-04-28 02:56:46,826 INFO L290 TraceCheckUtils]: 74: Hoare triple {36200#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36200#(<= main_~i~0 34)} is VALID [2022-04-28 02:56:46,826 INFO L290 TraceCheckUtils]: 75: Hoare triple {36200#(<= main_~i~0 34)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36201#(<= main_~i~0 35)} is VALID [2022-04-28 02:56:46,827 INFO L290 TraceCheckUtils]: 76: Hoare triple {36201#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36201#(<= main_~i~0 35)} is VALID [2022-04-28 02:56:46,827 INFO L290 TraceCheckUtils]: 77: Hoare triple {36201#(<= main_~i~0 35)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36202#(<= main_~i~0 36)} is VALID [2022-04-28 02:56:46,827 INFO L290 TraceCheckUtils]: 78: Hoare triple {36202#(<= main_~i~0 36)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36202#(<= main_~i~0 36)} is VALID [2022-04-28 02:56:46,828 INFO L290 TraceCheckUtils]: 79: Hoare triple {36202#(<= main_~i~0 36)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36203#(<= main_~i~0 37)} is VALID [2022-04-28 02:56:46,828 INFO L290 TraceCheckUtils]: 80: Hoare triple {36203#(<= main_~i~0 37)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36203#(<= main_~i~0 37)} is VALID [2022-04-28 02:56:46,828 INFO L290 TraceCheckUtils]: 81: Hoare triple {36203#(<= main_~i~0 37)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36204#(<= main_~i~0 38)} is VALID [2022-04-28 02:56:46,828 INFO L290 TraceCheckUtils]: 82: Hoare triple {36204#(<= main_~i~0 38)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36204#(<= main_~i~0 38)} is VALID [2022-04-28 02:56:46,829 INFO L290 TraceCheckUtils]: 83: Hoare triple {36204#(<= main_~i~0 38)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36205#(<= main_~i~0 39)} is VALID [2022-04-28 02:56:46,829 INFO L290 TraceCheckUtils]: 84: Hoare triple {36205#(<= main_~i~0 39)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36205#(<= main_~i~0 39)} is VALID [2022-04-28 02:56:46,829 INFO L290 TraceCheckUtils]: 85: Hoare triple {36205#(<= main_~i~0 39)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36206#(<= main_~i~0 40)} is VALID [2022-04-28 02:56:46,830 INFO L290 TraceCheckUtils]: 86: Hoare triple {36206#(<= main_~i~0 40)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36206#(<= main_~i~0 40)} is VALID [2022-04-28 02:56:46,830 INFO L290 TraceCheckUtils]: 87: Hoare triple {36206#(<= main_~i~0 40)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36207#(<= main_~i~0 41)} is VALID [2022-04-28 02:56:46,830 INFO L290 TraceCheckUtils]: 88: Hoare triple {36207#(<= main_~i~0 41)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36207#(<= main_~i~0 41)} is VALID [2022-04-28 02:56:46,831 INFO L290 TraceCheckUtils]: 89: Hoare triple {36207#(<= main_~i~0 41)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36208#(<= main_~i~0 42)} is VALID [2022-04-28 02:56:46,831 INFO L290 TraceCheckUtils]: 90: Hoare triple {36208#(<= main_~i~0 42)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36208#(<= main_~i~0 42)} is VALID [2022-04-28 02:56:46,831 INFO L290 TraceCheckUtils]: 91: Hoare triple {36208#(<= main_~i~0 42)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36209#(<= main_~i~0 43)} is VALID [2022-04-28 02:56:46,832 INFO L290 TraceCheckUtils]: 92: Hoare triple {36209#(<= main_~i~0 43)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36209#(<= main_~i~0 43)} is VALID [2022-04-28 02:56:46,832 INFO L290 TraceCheckUtils]: 93: Hoare triple {36209#(<= main_~i~0 43)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36210#(<= main_~i~0 44)} is VALID [2022-04-28 02:56:46,832 INFO L290 TraceCheckUtils]: 94: Hoare triple {36210#(<= main_~i~0 44)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36210#(<= main_~i~0 44)} is VALID [2022-04-28 02:56:46,833 INFO L290 TraceCheckUtils]: 95: Hoare triple {36210#(<= main_~i~0 44)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36211#(<= main_~i~0 45)} is VALID [2022-04-28 02:56:46,833 INFO L290 TraceCheckUtils]: 96: Hoare triple {36211#(<= main_~i~0 45)} assume !(~i~0 < 1024); {36162#false} is VALID [2022-04-28 02:56:46,833 INFO L290 TraceCheckUtils]: 97: Hoare triple {36162#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {36162#false} is VALID [2022-04-28 02:56:46,833 INFO L272 TraceCheckUtils]: 98: Hoare triple {36162#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {36162#false} is VALID [2022-04-28 02:56:46,833 INFO L290 TraceCheckUtils]: 99: Hoare triple {36162#false} ~cond := #in~cond; {36162#false} is VALID [2022-04-28 02:56:46,833 INFO L290 TraceCheckUtils]: 100: Hoare triple {36162#false} assume 0 == ~cond; {36162#false} is VALID [2022-04-28 02:56:46,833 INFO L290 TraceCheckUtils]: 101: Hoare triple {36162#false} assume !false; {36162#false} is VALID [2022-04-28 02:56:46,833 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:56:46,833 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:56:49,366 INFO L290 TraceCheckUtils]: 101: Hoare triple {36162#false} assume !false; {36162#false} is VALID [2022-04-28 02:56:49,366 INFO L290 TraceCheckUtils]: 100: Hoare triple {36162#false} assume 0 == ~cond; {36162#false} is VALID [2022-04-28 02:56:49,366 INFO L290 TraceCheckUtils]: 99: Hoare triple {36162#false} ~cond := #in~cond; {36162#false} is VALID [2022-04-28 02:56:49,366 INFO L272 TraceCheckUtils]: 98: Hoare triple {36162#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {36162#false} is VALID [2022-04-28 02:56:49,366 INFO L290 TraceCheckUtils]: 97: Hoare triple {36162#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {36162#false} is VALID [2022-04-28 02:56:49,367 INFO L290 TraceCheckUtils]: 96: Hoare triple {36535#(< main_~i~0 1024)} assume !(~i~0 < 1024); {36162#false} is VALID [2022-04-28 02:56:49,367 INFO L290 TraceCheckUtils]: 95: Hoare triple {36539#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36535#(< main_~i~0 1024)} is VALID [2022-04-28 02:56:49,367 INFO L290 TraceCheckUtils]: 94: Hoare triple {36539#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36539#(< main_~i~0 1023)} is VALID [2022-04-28 02:56:49,368 INFO L290 TraceCheckUtils]: 93: Hoare triple {36546#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36539#(< main_~i~0 1023)} is VALID [2022-04-28 02:56:49,368 INFO L290 TraceCheckUtils]: 92: Hoare triple {36546#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36546#(< main_~i~0 1022)} is VALID [2022-04-28 02:56:49,368 INFO L290 TraceCheckUtils]: 91: Hoare triple {36553#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36546#(< main_~i~0 1022)} is VALID [2022-04-28 02:56:49,369 INFO L290 TraceCheckUtils]: 90: Hoare triple {36553#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36553#(< main_~i~0 1021)} is VALID [2022-04-28 02:56:49,369 INFO L290 TraceCheckUtils]: 89: Hoare triple {36560#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36553#(< main_~i~0 1021)} is VALID [2022-04-28 02:56:49,369 INFO L290 TraceCheckUtils]: 88: Hoare triple {36560#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36560#(< main_~i~0 1020)} is VALID [2022-04-28 02:56:49,370 INFO L290 TraceCheckUtils]: 87: Hoare triple {36567#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36560#(< main_~i~0 1020)} is VALID [2022-04-28 02:56:49,370 INFO L290 TraceCheckUtils]: 86: Hoare triple {36567#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36567#(< main_~i~0 1019)} is VALID [2022-04-28 02:56:49,370 INFO L290 TraceCheckUtils]: 85: Hoare triple {36574#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36567#(< main_~i~0 1019)} is VALID [2022-04-28 02:56:49,370 INFO L290 TraceCheckUtils]: 84: Hoare triple {36574#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36574#(< main_~i~0 1018)} is VALID [2022-04-28 02:56:49,371 INFO L290 TraceCheckUtils]: 83: Hoare triple {36581#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36574#(< main_~i~0 1018)} is VALID [2022-04-28 02:56:49,371 INFO L290 TraceCheckUtils]: 82: Hoare triple {36581#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36581#(< main_~i~0 1017)} is VALID [2022-04-28 02:56:49,371 INFO L290 TraceCheckUtils]: 81: Hoare triple {36588#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36581#(< main_~i~0 1017)} is VALID [2022-04-28 02:56:49,372 INFO L290 TraceCheckUtils]: 80: Hoare triple {36588#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36588#(< main_~i~0 1016)} is VALID [2022-04-28 02:56:49,372 INFO L290 TraceCheckUtils]: 79: Hoare triple {36595#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36588#(< main_~i~0 1016)} is VALID [2022-04-28 02:56:49,372 INFO L290 TraceCheckUtils]: 78: Hoare triple {36595#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36595#(< main_~i~0 1015)} is VALID [2022-04-28 02:56:49,373 INFO L290 TraceCheckUtils]: 77: Hoare triple {36602#(< main_~i~0 1014)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36595#(< main_~i~0 1015)} is VALID [2022-04-28 02:56:49,373 INFO L290 TraceCheckUtils]: 76: Hoare triple {36602#(< main_~i~0 1014)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36602#(< main_~i~0 1014)} is VALID [2022-04-28 02:56:49,373 INFO L290 TraceCheckUtils]: 75: Hoare triple {36609#(< main_~i~0 1013)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36602#(< main_~i~0 1014)} is VALID [2022-04-28 02:56:49,373 INFO L290 TraceCheckUtils]: 74: Hoare triple {36609#(< main_~i~0 1013)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36609#(< main_~i~0 1013)} is VALID [2022-04-28 02:56:49,374 INFO L290 TraceCheckUtils]: 73: Hoare triple {36616#(< main_~i~0 1012)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36609#(< main_~i~0 1013)} is VALID [2022-04-28 02:56:49,374 INFO L290 TraceCheckUtils]: 72: Hoare triple {36616#(< main_~i~0 1012)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36616#(< main_~i~0 1012)} is VALID [2022-04-28 02:56:49,374 INFO L290 TraceCheckUtils]: 71: Hoare triple {36623#(< main_~i~0 1011)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36616#(< main_~i~0 1012)} is VALID [2022-04-28 02:56:49,375 INFO L290 TraceCheckUtils]: 70: Hoare triple {36623#(< main_~i~0 1011)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36623#(< main_~i~0 1011)} is VALID [2022-04-28 02:56:49,375 INFO L290 TraceCheckUtils]: 69: Hoare triple {36630#(< main_~i~0 1010)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36623#(< main_~i~0 1011)} is VALID [2022-04-28 02:56:49,375 INFO L290 TraceCheckUtils]: 68: Hoare triple {36630#(< main_~i~0 1010)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36630#(< main_~i~0 1010)} is VALID [2022-04-28 02:56:49,376 INFO L290 TraceCheckUtils]: 67: Hoare triple {36637#(< main_~i~0 1009)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36630#(< main_~i~0 1010)} is VALID [2022-04-28 02:56:49,376 INFO L290 TraceCheckUtils]: 66: Hoare triple {36637#(< main_~i~0 1009)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36637#(< main_~i~0 1009)} is VALID [2022-04-28 02:56:49,376 INFO L290 TraceCheckUtils]: 65: Hoare triple {36644#(< main_~i~0 1008)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36637#(< main_~i~0 1009)} is VALID [2022-04-28 02:56:49,377 INFO L290 TraceCheckUtils]: 64: Hoare triple {36644#(< main_~i~0 1008)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36644#(< main_~i~0 1008)} is VALID [2022-04-28 02:56:49,377 INFO L290 TraceCheckUtils]: 63: Hoare triple {36651#(< main_~i~0 1007)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36644#(< main_~i~0 1008)} is VALID [2022-04-28 02:56:49,377 INFO L290 TraceCheckUtils]: 62: Hoare triple {36651#(< main_~i~0 1007)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36651#(< main_~i~0 1007)} is VALID [2022-04-28 02:56:49,378 INFO L290 TraceCheckUtils]: 61: Hoare triple {36658#(< main_~i~0 1006)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36651#(< main_~i~0 1007)} is VALID [2022-04-28 02:56:49,378 INFO L290 TraceCheckUtils]: 60: Hoare triple {36658#(< main_~i~0 1006)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36658#(< main_~i~0 1006)} is VALID [2022-04-28 02:56:49,378 INFO L290 TraceCheckUtils]: 59: Hoare triple {36665#(< main_~i~0 1005)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36658#(< main_~i~0 1006)} is VALID [2022-04-28 02:56:49,378 INFO L290 TraceCheckUtils]: 58: Hoare triple {36665#(< main_~i~0 1005)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36665#(< main_~i~0 1005)} is VALID [2022-04-28 02:56:49,379 INFO L290 TraceCheckUtils]: 57: Hoare triple {36672#(< main_~i~0 1004)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36665#(< main_~i~0 1005)} is VALID [2022-04-28 02:56:49,379 INFO L290 TraceCheckUtils]: 56: Hoare triple {36672#(< main_~i~0 1004)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36672#(< main_~i~0 1004)} is VALID [2022-04-28 02:56:49,379 INFO L290 TraceCheckUtils]: 55: Hoare triple {36679#(< main_~i~0 1003)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36672#(< main_~i~0 1004)} is VALID [2022-04-28 02:56:49,380 INFO L290 TraceCheckUtils]: 54: Hoare triple {36679#(< main_~i~0 1003)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36679#(< main_~i~0 1003)} is VALID [2022-04-28 02:56:49,380 INFO L290 TraceCheckUtils]: 53: Hoare triple {36686#(< main_~i~0 1002)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36679#(< main_~i~0 1003)} is VALID [2022-04-28 02:56:49,380 INFO L290 TraceCheckUtils]: 52: Hoare triple {36686#(< main_~i~0 1002)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36686#(< main_~i~0 1002)} is VALID [2022-04-28 02:56:49,381 INFO L290 TraceCheckUtils]: 51: Hoare triple {36693#(< main_~i~0 1001)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36686#(< main_~i~0 1002)} is VALID [2022-04-28 02:56:49,381 INFO L290 TraceCheckUtils]: 50: Hoare triple {36693#(< main_~i~0 1001)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36693#(< main_~i~0 1001)} is VALID [2022-04-28 02:56:49,381 INFO L290 TraceCheckUtils]: 49: Hoare triple {36700#(< main_~i~0 1000)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36693#(< main_~i~0 1001)} is VALID [2022-04-28 02:56:49,382 INFO L290 TraceCheckUtils]: 48: Hoare triple {36700#(< main_~i~0 1000)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36700#(< main_~i~0 1000)} is VALID [2022-04-28 02:56:49,382 INFO L290 TraceCheckUtils]: 47: Hoare triple {36707#(< main_~i~0 999)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36700#(< main_~i~0 1000)} is VALID [2022-04-28 02:56:49,382 INFO L290 TraceCheckUtils]: 46: Hoare triple {36707#(< main_~i~0 999)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36707#(< main_~i~0 999)} is VALID [2022-04-28 02:56:49,382 INFO L290 TraceCheckUtils]: 45: Hoare triple {36714#(< main_~i~0 998)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36707#(< main_~i~0 999)} is VALID [2022-04-28 02:56:49,383 INFO L290 TraceCheckUtils]: 44: Hoare triple {36714#(< main_~i~0 998)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36714#(< main_~i~0 998)} is VALID [2022-04-28 02:56:49,383 INFO L290 TraceCheckUtils]: 43: Hoare triple {36721#(< main_~i~0 997)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36714#(< main_~i~0 998)} is VALID [2022-04-28 02:56:49,383 INFO L290 TraceCheckUtils]: 42: Hoare triple {36721#(< main_~i~0 997)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36721#(< main_~i~0 997)} is VALID [2022-04-28 02:56:49,384 INFO L290 TraceCheckUtils]: 41: Hoare triple {36728#(< main_~i~0 996)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36721#(< main_~i~0 997)} is VALID [2022-04-28 02:56:49,384 INFO L290 TraceCheckUtils]: 40: Hoare triple {36728#(< main_~i~0 996)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36728#(< main_~i~0 996)} is VALID [2022-04-28 02:56:49,384 INFO L290 TraceCheckUtils]: 39: Hoare triple {36735#(< main_~i~0 995)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36728#(< main_~i~0 996)} is VALID [2022-04-28 02:56:49,385 INFO L290 TraceCheckUtils]: 38: Hoare triple {36735#(< main_~i~0 995)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36735#(< main_~i~0 995)} is VALID [2022-04-28 02:56:49,385 INFO L290 TraceCheckUtils]: 37: Hoare triple {36742#(< main_~i~0 994)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36735#(< main_~i~0 995)} is VALID [2022-04-28 02:56:49,385 INFO L290 TraceCheckUtils]: 36: Hoare triple {36742#(< main_~i~0 994)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36742#(< main_~i~0 994)} is VALID [2022-04-28 02:56:49,386 INFO L290 TraceCheckUtils]: 35: Hoare triple {36749#(< main_~i~0 993)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36742#(< main_~i~0 994)} is VALID [2022-04-28 02:56:49,386 INFO L290 TraceCheckUtils]: 34: Hoare triple {36749#(< main_~i~0 993)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36749#(< main_~i~0 993)} is VALID [2022-04-28 02:56:49,386 INFO L290 TraceCheckUtils]: 33: Hoare triple {36756#(< main_~i~0 992)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36749#(< main_~i~0 993)} is VALID [2022-04-28 02:56:49,386 INFO L290 TraceCheckUtils]: 32: Hoare triple {36756#(< main_~i~0 992)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36756#(< main_~i~0 992)} is VALID [2022-04-28 02:56:49,387 INFO L290 TraceCheckUtils]: 31: Hoare triple {36763#(< main_~i~0 991)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36756#(< main_~i~0 992)} is VALID [2022-04-28 02:56:49,387 INFO L290 TraceCheckUtils]: 30: Hoare triple {36763#(< main_~i~0 991)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36763#(< main_~i~0 991)} is VALID [2022-04-28 02:56:49,387 INFO L290 TraceCheckUtils]: 29: Hoare triple {36770#(< main_~i~0 990)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36763#(< main_~i~0 991)} is VALID [2022-04-28 02:56:49,388 INFO L290 TraceCheckUtils]: 28: Hoare triple {36770#(< main_~i~0 990)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36770#(< main_~i~0 990)} is VALID [2022-04-28 02:56:49,388 INFO L290 TraceCheckUtils]: 27: Hoare triple {36777#(< main_~i~0 989)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36770#(< main_~i~0 990)} is VALID [2022-04-28 02:56:49,388 INFO L290 TraceCheckUtils]: 26: Hoare triple {36777#(< main_~i~0 989)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36777#(< main_~i~0 989)} is VALID [2022-04-28 02:56:49,389 INFO L290 TraceCheckUtils]: 25: Hoare triple {36784#(< main_~i~0 988)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36777#(< main_~i~0 989)} is VALID [2022-04-28 02:56:49,389 INFO L290 TraceCheckUtils]: 24: Hoare triple {36784#(< main_~i~0 988)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36784#(< main_~i~0 988)} is VALID [2022-04-28 02:56:49,389 INFO L290 TraceCheckUtils]: 23: Hoare triple {36791#(< main_~i~0 987)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36784#(< main_~i~0 988)} is VALID [2022-04-28 02:56:49,390 INFO L290 TraceCheckUtils]: 22: Hoare triple {36791#(< main_~i~0 987)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36791#(< main_~i~0 987)} is VALID [2022-04-28 02:56:49,390 INFO L290 TraceCheckUtils]: 21: Hoare triple {36798#(< main_~i~0 986)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36791#(< main_~i~0 987)} is VALID [2022-04-28 02:56:49,390 INFO L290 TraceCheckUtils]: 20: Hoare triple {36798#(< main_~i~0 986)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36798#(< main_~i~0 986)} is VALID [2022-04-28 02:56:49,391 INFO L290 TraceCheckUtils]: 19: Hoare triple {36805#(< main_~i~0 985)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36798#(< main_~i~0 986)} is VALID [2022-04-28 02:56:49,391 INFO L290 TraceCheckUtils]: 18: Hoare triple {36805#(< main_~i~0 985)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36805#(< main_~i~0 985)} is VALID [2022-04-28 02:56:49,391 INFO L290 TraceCheckUtils]: 17: Hoare triple {36812#(< main_~i~0 984)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36805#(< main_~i~0 985)} is VALID [2022-04-28 02:56:49,391 INFO L290 TraceCheckUtils]: 16: Hoare triple {36812#(< main_~i~0 984)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36812#(< main_~i~0 984)} is VALID [2022-04-28 02:56:49,392 INFO L290 TraceCheckUtils]: 15: Hoare triple {36819#(< main_~i~0 983)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36812#(< main_~i~0 984)} is VALID [2022-04-28 02:56:49,392 INFO L290 TraceCheckUtils]: 14: Hoare triple {36819#(< main_~i~0 983)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36819#(< main_~i~0 983)} is VALID [2022-04-28 02:56:49,392 INFO L290 TraceCheckUtils]: 13: Hoare triple {36826#(< main_~i~0 982)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36819#(< main_~i~0 983)} is VALID [2022-04-28 02:56:49,393 INFO L290 TraceCheckUtils]: 12: Hoare triple {36826#(< main_~i~0 982)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36826#(< main_~i~0 982)} is VALID [2022-04-28 02:56:49,393 INFO L290 TraceCheckUtils]: 11: Hoare triple {36833#(< main_~i~0 981)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36826#(< main_~i~0 982)} is VALID [2022-04-28 02:56:49,393 INFO L290 TraceCheckUtils]: 10: Hoare triple {36833#(< main_~i~0 981)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36833#(< main_~i~0 981)} is VALID [2022-04-28 02:56:49,394 INFO L290 TraceCheckUtils]: 9: Hoare triple {36840#(< main_~i~0 980)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36833#(< main_~i~0 981)} is VALID [2022-04-28 02:56:49,394 INFO L290 TraceCheckUtils]: 8: Hoare triple {36840#(< main_~i~0 980)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36840#(< main_~i~0 980)} is VALID [2022-04-28 02:56:49,394 INFO L290 TraceCheckUtils]: 7: Hoare triple {36847#(< main_~i~0 979)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36840#(< main_~i~0 980)} is VALID [2022-04-28 02:56:49,394 INFO L290 TraceCheckUtils]: 6: Hoare triple {36847#(< main_~i~0 979)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36847#(< main_~i~0 979)} is VALID [2022-04-28 02:56:49,395 INFO L290 TraceCheckUtils]: 5: Hoare triple {36161#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {36847#(< main_~i~0 979)} is VALID [2022-04-28 02:56:49,395 INFO L272 TraceCheckUtils]: 4: Hoare triple {36161#true} call #t~ret6 := main(); {36161#true} is VALID [2022-04-28 02:56:49,395 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36161#true} {36161#true} #39#return; {36161#true} is VALID [2022-04-28 02:56:49,395 INFO L290 TraceCheckUtils]: 2: Hoare triple {36161#true} assume true; {36161#true} is VALID [2022-04-28 02:56:49,395 INFO L290 TraceCheckUtils]: 1: Hoare triple {36161#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {36161#true} is VALID [2022-04-28 02:56:49,395 INFO L272 TraceCheckUtils]: 0: Hoare triple {36161#true} call ULTIMATE.init(); {36161#true} is VALID [2022-04-28 02:56:49,395 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:56:49,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [895236294] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:56:49,396 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:56:49,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 48, 48] total 96 [2022-04-28 02:56:49,396 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:56:49,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [978300245] [2022-04-28 02:56:49,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [978300245] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:49,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:49,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [49] imperfect sequences [] total 49 [2022-04-28 02:56:49,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250825421] [2022-04-28 02:56:49,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:56:49,396 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.0) internal successors, (98), 48 states have internal predecessors, (98), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 102 [2022-04-28 02:56:49,396 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:56:49,397 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 49 states, 49 states have (on average 2.0) internal successors, (98), 48 states have internal predecessors, (98), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:49,460 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:49,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-04-28 02:56:49,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:49,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-04-28 02:56:49,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4467, Invalid=4653, Unknown=0, NotChecked=0, Total=9120 [2022-04-28 02:56:49,461 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand has 49 states, 49 states have (on average 2.0) internal successors, (98), 48 states have internal predecessors, (98), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:51,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:51,092 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2022-04-28 02:56:51,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-04-28 02:56:51,092 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.0) internal successors, (98), 48 states have internal predecessors, (98), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 102 [2022-04-28 02:56:51,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:56:51,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 2.0) internal successors, (98), 48 states have internal predecessors, (98), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:51,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 112 transitions. [2022-04-28 02:56:51,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 2.0) internal successors, (98), 48 states have internal predecessors, (98), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:51,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 112 transitions. [2022-04-28 02:56:51,094 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 112 transitions. [2022-04-28 02:56:51,206 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:51,208 INFO L225 Difference]: With dead ends: 112 [2022-04-28 02:56:51,208 INFO L226 Difference]: Without dead ends: 106 [2022-04-28 02:56:51,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1304 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=8838, Invalid=11184, Unknown=0, NotChecked=0, Total=20022 [2022-04-28 02:56:51,210 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 100 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:56:51,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 44 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:56:51,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-04-28 02:56:51,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2022-04-28 02:56:51,789 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:56:51,790 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand has 105 states, 100 states have (on average 1.01) internal successors, (101), 100 states have internal predecessors, (101), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:51,790 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand has 105 states, 100 states have (on average 1.01) internal successors, (101), 100 states have internal predecessors, (101), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:51,790 INFO L87 Difference]: Start difference. First operand 106 states. Second operand has 105 states, 100 states have (on average 1.01) internal successors, (101), 100 states have internal predecessors, (101), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:51,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:51,791 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2022-04-28 02:56:51,791 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2022-04-28 02:56:51,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:51,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:51,792 INFO L74 IsIncluded]: Start isIncluded. First operand has 105 states, 100 states have (on average 1.01) internal successors, (101), 100 states have internal predecessors, (101), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 106 states. [2022-04-28 02:56:51,792 INFO L87 Difference]: Start difference. First operand has 105 states, 100 states have (on average 1.01) internal successors, (101), 100 states have internal predecessors, (101), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 106 states. [2022-04-28 02:56:51,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:51,793 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2022-04-28 02:56:51,793 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2022-04-28 02:56:51,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:51,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:51,793 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:56:51,793 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:56:51,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 100 states have (on average 1.01) internal successors, (101), 100 states have internal predecessors, (101), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:51,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2022-04-28 02:56:51,795 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 102 [2022-04-28 02:56:51,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:56:51,795 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2022-04-28 02:56:51,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 2.0) internal successors, (98), 48 states have internal predecessors, (98), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:51,795 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 105 states and 105 transitions. [2022-04-28 02:56:51,948 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:51,949 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2022-04-28 02:56:51,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-04-28 02:56:51,949 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:56:51,949 INFO L195 NwaCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:56:52,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2022-04-28 02:56:52,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-04-28 02:56:52,150 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:56:52,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:56:52,150 INFO L85 PathProgramCache]: Analyzing trace with hash -609408938, now seen corresponding path program 91 times [2022-04-28 02:56:52,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:52,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [609214809] [2022-04-28 02:56:52,152 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:56:52,152 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:56:52,152 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:56:52,152 INFO L85 PathProgramCache]: Analyzing trace with hash -609408938, now seen corresponding path program 92 times [2022-04-28 02:56:52,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:52,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837318404] [2022-04-28 02:56:52,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:52,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:52,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:53,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:56:53,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:53,038 INFO L290 TraceCheckUtils]: 0: Hoare triple {37661#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {37609#true} is VALID [2022-04-28 02:56:53,038 INFO L290 TraceCheckUtils]: 1: Hoare triple {37609#true} assume true; {37609#true} is VALID [2022-04-28 02:56:53,038 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37609#true} {37609#true} #39#return; {37609#true} is VALID [2022-04-28 02:56:53,038 INFO L272 TraceCheckUtils]: 0: Hoare triple {37609#true} call ULTIMATE.init(); {37661#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:56:53,038 INFO L290 TraceCheckUtils]: 1: Hoare triple {37661#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {37609#true} is VALID [2022-04-28 02:56:53,039 INFO L290 TraceCheckUtils]: 2: Hoare triple {37609#true} assume true; {37609#true} is VALID [2022-04-28 02:56:53,039 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37609#true} {37609#true} #39#return; {37609#true} is VALID [2022-04-28 02:56:53,039 INFO L272 TraceCheckUtils]: 4: Hoare triple {37609#true} call #t~ret6 := main(); {37609#true} is VALID [2022-04-28 02:56:53,039 INFO L290 TraceCheckUtils]: 5: Hoare triple {37609#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {37614#(= main_~i~0 0)} is VALID [2022-04-28 02:56:53,039 INFO L290 TraceCheckUtils]: 6: Hoare triple {37614#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37614#(= main_~i~0 0)} is VALID [2022-04-28 02:56:53,039 INFO L290 TraceCheckUtils]: 7: Hoare triple {37614#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37615#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:53,040 INFO L290 TraceCheckUtils]: 8: Hoare triple {37615#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37615#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:53,040 INFO L290 TraceCheckUtils]: 9: Hoare triple {37615#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37616#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:53,040 INFO L290 TraceCheckUtils]: 10: Hoare triple {37616#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37616#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:53,041 INFO L290 TraceCheckUtils]: 11: Hoare triple {37616#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37617#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:53,041 INFO L290 TraceCheckUtils]: 12: Hoare triple {37617#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37617#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:53,041 INFO L290 TraceCheckUtils]: 13: Hoare triple {37617#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37618#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:53,042 INFO L290 TraceCheckUtils]: 14: Hoare triple {37618#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37618#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:53,042 INFO L290 TraceCheckUtils]: 15: Hoare triple {37618#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37619#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:53,042 INFO L290 TraceCheckUtils]: 16: Hoare triple {37619#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37619#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:53,042 INFO L290 TraceCheckUtils]: 17: Hoare triple {37619#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37620#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:53,043 INFO L290 TraceCheckUtils]: 18: Hoare triple {37620#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37620#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:53,043 INFO L290 TraceCheckUtils]: 19: Hoare triple {37620#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37621#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:53,043 INFO L290 TraceCheckUtils]: 20: Hoare triple {37621#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37621#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:53,044 INFO L290 TraceCheckUtils]: 21: Hoare triple {37621#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37622#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:53,044 INFO L290 TraceCheckUtils]: 22: Hoare triple {37622#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37622#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:53,044 INFO L290 TraceCheckUtils]: 23: Hoare triple {37622#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37623#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:53,045 INFO L290 TraceCheckUtils]: 24: Hoare triple {37623#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37623#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:53,045 INFO L290 TraceCheckUtils]: 25: Hoare triple {37623#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37624#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:53,045 INFO L290 TraceCheckUtils]: 26: Hoare triple {37624#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37624#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:53,046 INFO L290 TraceCheckUtils]: 27: Hoare triple {37624#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37625#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:53,046 INFO L290 TraceCheckUtils]: 28: Hoare triple {37625#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37625#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:53,046 INFO L290 TraceCheckUtils]: 29: Hoare triple {37625#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37626#(<= main_~i~0 12)} is VALID [2022-04-28 02:56:53,046 INFO L290 TraceCheckUtils]: 30: Hoare triple {37626#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37626#(<= main_~i~0 12)} is VALID [2022-04-28 02:56:53,047 INFO L290 TraceCheckUtils]: 31: Hoare triple {37626#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37627#(<= main_~i~0 13)} is VALID [2022-04-28 02:56:53,047 INFO L290 TraceCheckUtils]: 32: Hoare triple {37627#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37627#(<= main_~i~0 13)} is VALID [2022-04-28 02:56:53,047 INFO L290 TraceCheckUtils]: 33: Hoare triple {37627#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37628#(<= main_~i~0 14)} is VALID [2022-04-28 02:56:53,048 INFO L290 TraceCheckUtils]: 34: Hoare triple {37628#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37628#(<= main_~i~0 14)} is VALID [2022-04-28 02:56:53,048 INFO L290 TraceCheckUtils]: 35: Hoare triple {37628#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37629#(<= main_~i~0 15)} is VALID [2022-04-28 02:56:53,048 INFO L290 TraceCheckUtils]: 36: Hoare triple {37629#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37629#(<= main_~i~0 15)} is VALID [2022-04-28 02:56:53,049 INFO L290 TraceCheckUtils]: 37: Hoare triple {37629#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37630#(<= main_~i~0 16)} is VALID [2022-04-28 02:56:53,049 INFO L290 TraceCheckUtils]: 38: Hoare triple {37630#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37630#(<= main_~i~0 16)} is VALID [2022-04-28 02:56:53,049 INFO L290 TraceCheckUtils]: 39: Hoare triple {37630#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37631#(<= main_~i~0 17)} is VALID [2022-04-28 02:56:53,049 INFO L290 TraceCheckUtils]: 40: Hoare triple {37631#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37631#(<= main_~i~0 17)} is VALID [2022-04-28 02:56:53,050 INFO L290 TraceCheckUtils]: 41: Hoare triple {37631#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37632#(<= main_~i~0 18)} is VALID [2022-04-28 02:56:53,050 INFO L290 TraceCheckUtils]: 42: Hoare triple {37632#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37632#(<= main_~i~0 18)} is VALID [2022-04-28 02:56:53,050 INFO L290 TraceCheckUtils]: 43: Hoare triple {37632#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37633#(<= main_~i~0 19)} is VALID [2022-04-28 02:56:53,051 INFO L290 TraceCheckUtils]: 44: Hoare triple {37633#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37633#(<= main_~i~0 19)} is VALID [2022-04-28 02:56:53,051 INFO L290 TraceCheckUtils]: 45: Hoare triple {37633#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37634#(<= main_~i~0 20)} is VALID [2022-04-28 02:56:53,051 INFO L290 TraceCheckUtils]: 46: Hoare triple {37634#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37634#(<= main_~i~0 20)} is VALID [2022-04-28 02:56:53,052 INFO L290 TraceCheckUtils]: 47: Hoare triple {37634#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37635#(<= main_~i~0 21)} is VALID [2022-04-28 02:56:53,052 INFO L290 TraceCheckUtils]: 48: Hoare triple {37635#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37635#(<= main_~i~0 21)} is VALID [2022-04-28 02:56:53,052 INFO L290 TraceCheckUtils]: 49: Hoare triple {37635#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37636#(<= main_~i~0 22)} is VALID [2022-04-28 02:56:53,053 INFO L290 TraceCheckUtils]: 50: Hoare triple {37636#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37636#(<= main_~i~0 22)} is VALID [2022-04-28 02:56:53,053 INFO L290 TraceCheckUtils]: 51: Hoare triple {37636#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37637#(<= main_~i~0 23)} is VALID [2022-04-28 02:56:53,053 INFO L290 TraceCheckUtils]: 52: Hoare triple {37637#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37637#(<= main_~i~0 23)} is VALID [2022-04-28 02:56:53,054 INFO L290 TraceCheckUtils]: 53: Hoare triple {37637#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37638#(<= main_~i~0 24)} is VALID [2022-04-28 02:56:53,054 INFO L290 TraceCheckUtils]: 54: Hoare triple {37638#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37638#(<= main_~i~0 24)} is VALID [2022-04-28 02:56:53,054 INFO L290 TraceCheckUtils]: 55: Hoare triple {37638#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37639#(<= main_~i~0 25)} is VALID [2022-04-28 02:56:53,054 INFO L290 TraceCheckUtils]: 56: Hoare triple {37639#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37639#(<= main_~i~0 25)} is VALID [2022-04-28 02:56:53,055 INFO L290 TraceCheckUtils]: 57: Hoare triple {37639#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37640#(<= main_~i~0 26)} is VALID [2022-04-28 02:56:53,055 INFO L290 TraceCheckUtils]: 58: Hoare triple {37640#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37640#(<= main_~i~0 26)} is VALID [2022-04-28 02:56:53,055 INFO L290 TraceCheckUtils]: 59: Hoare triple {37640#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37641#(<= main_~i~0 27)} is VALID [2022-04-28 02:56:53,056 INFO L290 TraceCheckUtils]: 60: Hoare triple {37641#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37641#(<= main_~i~0 27)} is VALID [2022-04-28 02:56:53,056 INFO L290 TraceCheckUtils]: 61: Hoare triple {37641#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37642#(<= main_~i~0 28)} is VALID [2022-04-28 02:56:53,056 INFO L290 TraceCheckUtils]: 62: Hoare triple {37642#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37642#(<= main_~i~0 28)} is VALID [2022-04-28 02:56:53,057 INFO L290 TraceCheckUtils]: 63: Hoare triple {37642#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37643#(<= main_~i~0 29)} is VALID [2022-04-28 02:56:53,057 INFO L290 TraceCheckUtils]: 64: Hoare triple {37643#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37643#(<= main_~i~0 29)} is VALID [2022-04-28 02:56:53,057 INFO L290 TraceCheckUtils]: 65: Hoare triple {37643#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37644#(<= main_~i~0 30)} is VALID [2022-04-28 02:56:53,057 INFO L290 TraceCheckUtils]: 66: Hoare triple {37644#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37644#(<= main_~i~0 30)} is VALID [2022-04-28 02:56:53,058 INFO L290 TraceCheckUtils]: 67: Hoare triple {37644#(<= main_~i~0 30)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37645#(<= main_~i~0 31)} is VALID [2022-04-28 02:56:53,058 INFO L290 TraceCheckUtils]: 68: Hoare triple {37645#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37645#(<= main_~i~0 31)} is VALID [2022-04-28 02:56:53,058 INFO L290 TraceCheckUtils]: 69: Hoare triple {37645#(<= main_~i~0 31)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37646#(<= main_~i~0 32)} is VALID [2022-04-28 02:56:53,059 INFO L290 TraceCheckUtils]: 70: Hoare triple {37646#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37646#(<= main_~i~0 32)} is VALID [2022-04-28 02:56:53,059 INFO L290 TraceCheckUtils]: 71: Hoare triple {37646#(<= main_~i~0 32)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37647#(<= main_~i~0 33)} is VALID [2022-04-28 02:56:53,059 INFO L290 TraceCheckUtils]: 72: Hoare triple {37647#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37647#(<= main_~i~0 33)} is VALID [2022-04-28 02:56:53,060 INFO L290 TraceCheckUtils]: 73: Hoare triple {37647#(<= main_~i~0 33)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37648#(<= main_~i~0 34)} is VALID [2022-04-28 02:56:53,060 INFO L290 TraceCheckUtils]: 74: Hoare triple {37648#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37648#(<= main_~i~0 34)} is VALID [2022-04-28 02:56:53,060 INFO L290 TraceCheckUtils]: 75: Hoare triple {37648#(<= main_~i~0 34)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37649#(<= main_~i~0 35)} is VALID [2022-04-28 02:56:53,060 INFO L290 TraceCheckUtils]: 76: Hoare triple {37649#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37649#(<= main_~i~0 35)} is VALID [2022-04-28 02:56:53,061 INFO L290 TraceCheckUtils]: 77: Hoare triple {37649#(<= main_~i~0 35)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37650#(<= main_~i~0 36)} is VALID [2022-04-28 02:56:53,061 INFO L290 TraceCheckUtils]: 78: Hoare triple {37650#(<= main_~i~0 36)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37650#(<= main_~i~0 36)} is VALID [2022-04-28 02:56:53,061 INFO L290 TraceCheckUtils]: 79: Hoare triple {37650#(<= main_~i~0 36)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37651#(<= main_~i~0 37)} is VALID [2022-04-28 02:56:53,062 INFO L290 TraceCheckUtils]: 80: Hoare triple {37651#(<= main_~i~0 37)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37651#(<= main_~i~0 37)} is VALID [2022-04-28 02:56:53,062 INFO L290 TraceCheckUtils]: 81: Hoare triple {37651#(<= main_~i~0 37)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37652#(<= main_~i~0 38)} is VALID [2022-04-28 02:56:53,062 INFO L290 TraceCheckUtils]: 82: Hoare triple {37652#(<= main_~i~0 38)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37652#(<= main_~i~0 38)} is VALID [2022-04-28 02:56:53,063 INFO L290 TraceCheckUtils]: 83: Hoare triple {37652#(<= main_~i~0 38)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37653#(<= main_~i~0 39)} is VALID [2022-04-28 02:56:53,063 INFO L290 TraceCheckUtils]: 84: Hoare triple {37653#(<= main_~i~0 39)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37653#(<= main_~i~0 39)} is VALID [2022-04-28 02:56:53,063 INFO L290 TraceCheckUtils]: 85: Hoare triple {37653#(<= main_~i~0 39)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37654#(<= main_~i~0 40)} is VALID [2022-04-28 02:56:53,064 INFO L290 TraceCheckUtils]: 86: Hoare triple {37654#(<= main_~i~0 40)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37654#(<= main_~i~0 40)} is VALID [2022-04-28 02:56:53,064 INFO L290 TraceCheckUtils]: 87: Hoare triple {37654#(<= main_~i~0 40)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37655#(<= main_~i~0 41)} is VALID [2022-04-28 02:56:53,064 INFO L290 TraceCheckUtils]: 88: Hoare triple {37655#(<= main_~i~0 41)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37655#(<= main_~i~0 41)} is VALID [2022-04-28 02:56:53,064 INFO L290 TraceCheckUtils]: 89: Hoare triple {37655#(<= main_~i~0 41)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37656#(<= main_~i~0 42)} is VALID [2022-04-28 02:56:53,065 INFO L290 TraceCheckUtils]: 90: Hoare triple {37656#(<= main_~i~0 42)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37656#(<= main_~i~0 42)} is VALID [2022-04-28 02:56:53,065 INFO L290 TraceCheckUtils]: 91: Hoare triple {37656#(<= main_~i~0 42)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37657#(<= main_~i~0 43)} is VALID [2022-04-28 02:56:53,065 INFO L290 TraceCheckUtils]: 92: Hoare triple {37657#(<= main_~i~0 43)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37657#(<= main_~i~0 43)} is VALID [2022-04-28 02:56:53,066 INFO L290 TraceCheckUtils]: 93: Hoare triple {37657#(<= main_~i~0 43)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37658#(<= main_~i~0 44)} is VALID [2022-04-28 02:56:53,066 INFO L290 TraceCheckUtils]: 94: Hoare triple {37658#(<= main_~i~0 44)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37658#(<= main_~i~0 44)} is VALID [2022-04-28 02:56:53,066 INFO L290 TraceCheckUtils]: 95: Hoare triple {37658#(<= main_~i~0 44)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37659#(<= main_~i~0 45)} is VALID [2022-04-28 02:56:53,067 INFO L290 TraceCheckUtils]: 96: Hoare triple {37659#(<= main_~i~0 45)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37659#(<= main_~i~0 45)} is VALID [2022-04-28 02:56:53,067 INFO L290 TraceCheckUtils]: 97: Hoare triple {37659#(<= main_~i~0 45)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37660#(<= main_~i~0 46)} is VALID [2022-04-28 02:56:53,067 INFO L290 TraceCheckUtils]: 98: Hoare triple {37660#(<= main_~i~0 46)} assume !(~i~0 < 1024); {37610#false} is VALID [2022-04-28 02:56:53,067 INFO L290 TraceCheckUtils]: 99: Hoare triple {37610#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {37610#false} is VALID [2022-04-28 02:56:53,067 INFO L272 TraceCheckUtils]: 100: Hoare triple {37610#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {37610#false} is VALID [2022-04-28 02:56:53,067 INFO L290 TraceCheckUtils]: 101: Hoare triple {37610#false} ~cond := #in~cond; {37610#false} is VALID [2022-04-28 02:56:53,067 INFO L290 TraceCheckUtils]: 102: Hoare triple {37610#false} assume 0 == ~cond; {37610#false} is VALID [2022-04-28 02:56:53,068 INFO L290 TraceCheckUtils]: 103: Hoare triple {37610#false} assume !false; {37610#false} is VALID [2022-04-28 02:56:53,068 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:56:53,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:56:53,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837318404] [2022-04-28 02:56:53,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837318404] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:56:53,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1267883124] [2022-04-28 02:56:53,068 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:56:53,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:53,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:56:53,069 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:56:53,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-04-28 02:56:53,315 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:56:53,315 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:56:53,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-28 02:56:53,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:53,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:56:53,918 INFO L272 TraceCheckUtils]: 0: Hoare triple {37609#true} call ULTIMATE.init(); {37609#true} is VALID [2022-04-28 02:56:53,919 INFO L290 TraceCheckUtils]: 1: Hoare triple {37609#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {37609#true} is VALID [2022-04-28 02:56:53,919 INFO L290 TraceCheckUtils]: 2: Hoare triple {37609#true} assume true; {37609#true} is VALID [2022-04-28 02:56:53,919 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37609#true} {37609#true} #39#return; {37609#true} is VALID [2022-04-28 02:56:53,919 INFO L272 TraceCheckUtils]: 4: Hoare triple {37609#true} call #t~ret6 := main(); {37609#true} is VALID [2022-04-28 02:56:53,919 INFO L290 TraceCheckUtils]: 5: Hoare triple {37609#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {37680#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:53,919 INFO L290 TraceCheckUtils]: 6: Hoare triple {37680#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37680#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:53,920 INFO L290 TraceCheckUtils]: 7: Hoare triple {37680#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37615#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:53,920 INFO L290 TraceCheckUtils]: 8: Hoare triple {37615#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37615#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:53,920 INFO L290 TraceCheckUtils]: 9: Hoare triple {37615#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37616#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:53,921 INFO L290 TraceCheckUtils]: 10: Hoare triple {37616#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37616#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:53,921 INFO L290 TraceCheckUtils]: 11: Hoare triple {37616#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37617#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:53,921 INFO L290 TraceCheckUtils]: 12: Hoare triple {37617#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37617#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:53,922 INFO L290 TraceCheckUtils]: 13: Hoare triple {37617#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37618#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:53,922 INFO L290 TraceCheckUtils]: 14: Hoare triple {37618#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37618#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:53,922 INFO L290 TraceCheckUtils]: 15: Hoare triple {37618#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37619#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:53,923 INFO L290 TraceCheckUtils]: 16: Hoare triple {37619#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37619#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:53,923 INFO L290 TraceCheckUtils]: 17: Hoare triple {37619#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37620#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:53,923 INFO L290 TraceCheckUtils]: 18: Hoare triple {37620#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37620#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:53,924 INFO L290 TraceCheckUtils]: 19: Hoare triple {37620#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37621#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:53,924 INFO L290 TraceCheckUtils]: 20: Hoare triple {37621#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37621#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:53,924 INFO L290 TraceCheckUtils]: 21: Hoare triple {37621#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37622#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:53,924 INFO L290 TraceCheckUtils]: 22: Hoare triple {37622#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37622#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:53,925 INFO L290 TraceCheckUtils]: 23: Hoare triple {37622#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37623#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:53,925 INFO L290 TraceCheckUtils]: 24: Hoare triple {37623#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37623#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:53,925 INFO L290 TraceCheckUtils]: 25: Hoare triple {37623#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37624#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:53,926 INFO L290 TraceCheckUtils]: 26: Hoare triple {37624#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37624#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:53,926 INFO L290 TraceCheckUtils]: 27: Hoare triple {37624#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37625#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:53,926 INFO L290 TraceCheckUtils]: 28: Hoare triple {37625#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37625#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:53,927 INFO L290 TraceCheckUtils]: 29: Hoare triple {37625#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37626#(<= main_~i~0 12)} is VALID [2022-04-28 02:56:53,927 INFO L290 TraceCheckUtils]: 30: Hoare triple {37626#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37626#(<= main_~i~0 12)} is VALID [2022-04-28 02:56:53,927 INFO L290 TraceCheckUtils]: 31: Hoare triple {37626#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37627#(<= main_~i~0 13)} is VALID [2022-04-28 02:56:53,928 INFO L290 TraceCheckUtils]: 32: Hoare triple {37627#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37627#(<= main_~i~0 13)} is VALID [2022-04-28 02:56:53,928 INFO L290 TraceCheckUtils]: 33: Hoare triple {37627#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37628#(<= main_~i~0 14)} is VALID [2022-04-28 02:56:53,928 INFO L290 TraceCheckUtils]: 34: Hoare triple {37628#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37628#(<= main_~i~0 14)} is VALID [2022-04-28 02:56:53,929 INFO L290 TraceCheckUtils]: 35: Hoare triple {37628#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37629#(<= main_~i~0 15)} is VALID [2022-04-28 02:56:53,929 INFO L290 TraceCheckUtils]: 36: Hoare triple {37629#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37629#(<= main_~i~0 15)} is VALID [2022-04-28 02:56:53,929 INFO L290 TraceCheckUtils]: 37: Hoare triple {37629#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37630#(<= main_~i~0 16)} is VALID [2022-04-28 02:56:53,929 INFO L290 TraceCheckUtils]: 38: Hoare triple {37630#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37630#(<= main_~i~0 16)} is VALID [2022-04-28 02:56:53,930 INFO L290 TraceCheckUtils]: 39: Hoare triple {37630#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37631#(<= main_~i~0 17)} is VALID [2022-04-28 02:56:53,930 INFO L290 TraceCheckUtils]: 40: Hoare triple {37631#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37631#(<= main_~i~0 17)} is VALID [2022-04-28 02:56:53,930 INFO L290 TraceCheckUtils]: 41: Hoare triple {37631#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37632#(<= main_~i~0 18)} is VALID [2022-04-28 02:56:53,931 INFO L290 TraceCheckUtils]: 42: Hoare triple {37632#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37632#(<= main_~i~0 18)} is VALID [2022-04-28 02:56:53,931 INFO L290 TraceCheckUtils]: 43: Hoare triple {37632#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37633#(<= main_~i~0 19)} is VALID [2022-04-28 02:56:53,931 INFO L290 TraceCheckUtils]: 44: Hoare triple {37633#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37633#(<= main_~i~0 19)} is VALID [2022-04-28 02:56:53,932 INFO L290 TraceCheckUtils]: 45: Hoare triple {37633#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37634#(<= main_~i~0 20)} is VALID [2022-04-28 02:56:53,932 INFO L290 TraceCheckUtils]: 46: Hoare triple {37634#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37634#(<= main_~i~0 20)} is VALID [2022-04-28 02:56:53,932 INFO L290 TraceCheckUtils]: 47: Hoare triple {37634#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37635#(<= main_~i~0 21)} is VALID [2022-04-28 02:56:53,932 INFO L290 TraceCheckUtils]: 48: Hoare triple {37635#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37635#(<= main_~i~0 21)} is VALID [2022-04-28 02:56:53,933 INFO L290 TraceCheckUtils]: 49: Hoare triple {37635#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37636#(<= main_~i~0 22)} is VALID [2022-04-28 02:56:53,933 INFO L290 TraceCheckUtils]: 50: Hoare triple {37636#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37636#(<= main_~i~0 22)} is VALID [2022-04-28 02:56:53,933 INFO L290 TraceCheckUtils]: 51: Hoare triple {37636#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37637#(<= main_~i~0 23)} is VALID [2022-04-28 02:56:53,934 INFO L290 TraceCheckUtils]: 52: Hoare triple {37637#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37637#(<= main_~i~0 23)} is VALID [2022-04-28 02:56:53,934 INFO L290 TraceCheckUtils]: 53: Hoare triple {37637#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37638#(<= main_~i~0 24)} is VALID [2022-04-28 02:56:53,934 INFO L290 TraceCheckUtils]: 54: Hoare triple {37638#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37638#(<= main_~i~0 24)} is VALID [2022-04-28 02:56:53,935 INFO L290 TraceCheckUtils]: 55: Hoare triple {37638#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37639#(<= main_~i~0 25)} is VALID [2022-04-28 02:56:53,935 INFO L290 TraceCheckUtils]: 56: Hoare triple {37639#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37639#(<= main_~i~0 25)} is VALID [2022-04-28 02:56:53,935 INFO L290 TraceCheckUtils]: 57: Hoare triple {37639#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37640#(<= main_~i~0 26)} is VALID [2022-04-28 02:56:53,936 INFO L290 TraceCheckUtils]: 58: Hoare triple {37640#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37640#(<= main_~i~0 26)} is VALID [2022-04-28 02:56:53,936 INFO L290 TraceCheckUtils]: 59: Hoare triple {37640#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37641#(<= main_~i~0 27)} is VALID [2022-04-28 02:56:53,936 INFO L290 TraceCheckUtils]: 60: Hoare triple {37641#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37641#(<= main_~i~0 27)} is VALID [2022-04-28 02:56:53,936 INFO L290 TraceCheckUtils]: 61: Hoare triple {37641#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37642#(<= main_~i~0 28)} is VALID [2022-04-28 02:56:53,937 INFO L290 TraceCheckUtils]: 62: Hoare triple {37642#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37642#(<= main_~i~0 28)} is VALID [2022-04-28 02:56:53,937 INFO L290 TraceCheckUtils]: 63: Hoare triple {37642#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37643#(<= main_~i~0 29)} is VALID [2022-04-28 02:56:53,937 INFO L290 TraceCheckUtils]: 64: Hoare triple {37643#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37643#(<= main_~i~0 29)} is VALID [2022-04-28 02:56:53,938 INFO L290 TraceCheckUtils]: 65: Hoare triple {37643#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37644#(<= main_~i~0 30)} is VALID [2022-04-28 02:56:53,938 INFO L290 TraceCheckUtils]: 66: Hoare triple {37644#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37644#(<= main_~i~0 30)} is VALID [2022-04-28 02:56:53,938 INFO L290 TraceCheckUtils]: 67: Hoare triple {37644#(<= main_~i~0 30)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37645#(<= main_~i~0 31)} is VALID [2022-04-28 02:56:53,939 INFO L290 TraceCheckUtils]: 68: Hoare triple {37645#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37645#(<= main_~i~0 31)} is VALID [2022-04-28 02:56:53,939 INFO L290 TraceCheckUtils]: 69: Hoare triple {37645#(<= main_~i~0 31)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37646#(<= main_~i~0 32)} is VALID [2022-04-28 02:56:53,939 INFO L290 TraceCheckUtils]: 70: Hoare triple {37646#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37646#(<= main_~i~0 32)} is VALID [2022-04-28 02:56:53,940 INFO L290 TraceCheckUtils]: 71: Hoare triple {37646#(<= main_~i~0 32)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37647#(<= main_~i~0 33)} is VALID [2022-04-28 02:56:53,940 INFO L290 TraceCheckUtils]: 72: Hoare triple {37647#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37647#(<= main_~i~0 33)} is VALID [2022-04-28 02:56:53,940 INFO L290 TraceCheckUtils]: 73: Hoare triple {37647#(<= main_~i~0 33)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37648#(<= main_~i~0 34)} is VALID [2022-04-28 02:56:53,940 INFO L290 TraceCheckUtils]: 74: Hoare triple {37648#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37648#(<= main_~i~0 34)} is VALID [2022-04-28 02:56:53,941 INFO L290 TraceCheckUtils]: 75: Hoare triple {37648#(<= main_~i~0 34)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37649#(<= main_~i~0 35)} is VALID [2022-04-28 02:56:53,941 INFO L290 TraceCheckUtils]: 76: Hoare triple {37649#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37649#(<= main_~i~0 35)} is VALID [2022-04-28 02:56:53,941 INFO L290 TraceCheckUtils]: 77: Hoare triple {37649#(<= main_~i~0 35)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37650#(<= main_~i~0 36)} is VALID [2022-04-28 02:56:53,942 INFO L290 TraceCheckUtils]: 78: Hoare triple {37650#(<= main_~i~0 36)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37650#(<= main_~i~0 36)} is VALID [2022-04-28 02:56:53,942 INFO L290 TraceCheckUtils]: 79: Hoare triple {37650#(<= main_~i~0 36)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37651#(<= main_~i~0 37)} is VALID [2022-04-28 02:56:53,942 INFO L290 TraceCheckUtils]: 80: Hoare triple {37651#(<= main_~i~0 37)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37651#(<= main_~i~0 37)} is VALID [2022-04-28 02:56:53,943 INFO L290 TraceCheckUtils]: 81: Hoare triple {37651#(<= main_~i~0 37)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37652#(<= main_~i~0 38)} is VALID [2022-04-28 02:56:53,943 INFO L290 TraceCheckUtils]: 82: Hoare triple {37652#(<= main_~i~0 38)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37652#(<= main_~i~0 38)} is VALID [2022-04-28 02:56:53,943 INFO L290 TraceCheckUtils]: 83: Hoare triple {37652#(<= main_~i~0 38)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37653#(<= main_~i~0 39)} is VALID [2022-04-28 02:56:53,943 INFO L290 TraceCheckUtils]: 84: Hoare triple {37653#(<= main_~i~0 39)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37653#(<= main_~i~0 39)} is VALID [2022-04-28 02:56:53,944 INFO L290 TraceCheckUtils]: 85: Hoare triple {37653#(<= main_~i~0 39)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37654#(<= main_~i~0 40)} is VALID [2022-04-28 02:56:53,944 INFO L290 TraceCheckUtils]: 86: Hoare triple {37654#(<= main_~i~0 40)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37654#(<= main_~i~0 40)} is VALID [2022-04-28 02:56:53,944 INFO L290 TraceCheckUtils]: 87: Hoare triple {37654#(<= main_~i~0 40)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37655#(<= main_~i~0 41)} is VALID [2022-04-28 02:56:53,945 INFO L290 TraceCheckUtils]: 88: Hoare triple {37655#(<= main_~i~0 41)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37655#(<= main_~i~0 41)} is VALID [2022-04-28 02:56:53,945 INFO L290 TraceCheckUtils]: 89: Hoare triple {37655#(<= main_~i~0 41)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37656#(<= main_~i~0 42)} is VALID [2022-04-28 02:56:53,945 INFO L290 TraceCheckUtils]: 90: Hoare triple {37656#(<= main_~i~0 42)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37656#(<= main_~i~0 42)} is VALID [2022-04-28 02:56:53,946 INFO L290 TraceCheckUtils]: 91: Hoare triple {37656#(<= main_~i~0 42)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37657#(<= main_~i~0 43)} is VALID [2022-04-28 02:56:53,946 INFO L290 TraceCheckUtils]: 92: Hoare triple {37657#(<= main_~i~0 43)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37657#(<= main_~i~0 43)} is VALID [2022-04-28 02:56:53,946 INFO L290 TraceCheckUtils]: 93: Hoare triple {37657#(<= main_~i~0 43)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37658#(<= main_~i~0 44)} is VALID [2022-04-28 02:56:53,946 INFO L290 TraceCheckUtils]: 94: Hoare triple {37658#(<= main_~i~0 44)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37658#(<= main_~i~0 44)} is VALID [2022-04-28 02:56:53,947 INFO L290 TraceCheckUtils]: 95: Hoare triple {37658#(<= main_~i~0 44)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37659#(<= main_~i~0 45)} is VALID [2022-04-28 02:56:53,947 INFO L290 TraceCheckUtils]: 96: Hoare triple {37659#(<= main_~i~0 45)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37659#(<= main_~i~0 45)} is VALID [2022-04-28 02:56:53,947 INFO L290 TraceCheckUtils]: 97: Hoare triple {37659#(<= main_~i~0 45)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37660#(<= main_~i~0 46)} is VALID [2022-04-28 02:56:53,948 INFO L290 TraceCheckUtils]: 98: Hoare triple {37660#(<= main_~i~0 46)} assume !(~i~0 < 1024); {37610#false} is VALID [2022-04-28 02:56:53,948 INFO L290 TraceCheckUtils]: 99: Hoare triple {37610#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {37610#false} is VALID [2022-04-28 02:56:53,948 INFO L272 TraceCheckUtils]: 100: Hoare triple {37610#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {37610#false} is VALID [2022-04-28 02:56:53,948 INFO L290 TraceCheckUtils]: 101: Hoare triple {37610#false} ~cond := #in~cond; {37610#false} is VALID [2022-04-28 02:56:53,948 INFO L290 TraceCheckUtils]: 102: Hoare triple {37610#false} assume 0 == ~cond; {37610#false} is VALID [2022-04-28 02:56:53,948 INFO L290 TraceCheckUtils]: 103: Hoare triple {37610#false} assume !false; {37610#false} is VALID [2022-04-28 02:56:53,948 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:56:53,948 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:56:56,563 INFO L290 TraceCheckUtils]: 103: Hoare triple {37610#false} assume !false; {37610#false} is VALID [2022-04-28 02:56:56,563 INFO L290 TraceCheckUtils]: 102: Hoare triple {37610#false} assume 0 == ~cond; {37610#false} is VALID [2022-04-28 02:56:56,563 INFO L290 TraceCheckUtils]: 101: Hoare triple {37610#false} ~cond := #in~cond; {37610#false} is VALID [2022-04-28 02:56:56,563 INFO L272 TraceCheckUtils]: 100: Hoare triple {37610#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {37610#false} is VALID [2022-04-28 02:56:56,563 INFO L290 TraceCheckUtils]: 99: Hoare triple {37610#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {37610#false} is VALID [2022-04-28 02:56:56,564 INFO L290 TraceCheckUtils]: 98: Hoare triple {37990#(< main_~i~0 1024)} assume !(~i~0 < 1024); {37610#false} is VALID [2022-04-28 02:56:56,564 INFO L290 TraceCheckUtils]: 97: Hoare triple {37994#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37990#(< main_~i~0 1024)} is VALID [2022-04-28 02:56:56,565 INFO L290 TraceCheckUtils]: 96: Hoare triple {37994#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37994#(< main_~i~0 1023)} is VALID [2022-04-28 02:56:56,565 INFO L290 TraceCheckUtils]: 95: Hoare triple {38001#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37994#(< main_~i~0 1023)} is VALID [2022-04-28 02:56:56,565 INFO L290 TraceCheckUtils]: 94: Hoare triple {38001#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38001#(< main_~i~0 1022)} is VALID [2022-04-28 02:56:56,566 INFO L290 TraceCheckUtils]: 93: Hoare triple {38008#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38001#(< main_~i~0 1022)} is VALID [2022-04-28 02:56:56,566 INFO L290 TraceCheckUtils]: 92: Hoare triple {38008#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38008#(< main_~i~0 1021)} is VALID [2022-04-28 02:56:56,567 INFO L290 TraceCheckUtils]: 91: Hoare triple {38015#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38008#(< main_~i~0 1021)} is VALID [2022-04-28 02:56:56,567 INFO L290 TraceCheckUtils]: 90: Hoare triple {38015#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38015#(< main_~i~0 1020)} is VALID [2022-04-28 02:56:56,567 INFO L290 TraceCheckUtils]: 89: Hoare triple {38022#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38015#(< main_~i~0 1020)} is VALID [2022-04-28 02:56:56,568 INFO L290 TraceCheckUtils]: 88: Hoare triple {38022#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38022#(< main_~i~0 1019)} is VALID [2022-04-28 02:56:56,568 INFO L290 TraceCheckUtils]: 87: Hoare triple {38029#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38022#(< main_~i~0 1019)} is VALID [2022-04-28 02:56:56,569 INFO L290 TraceCheckUtils]: 86: Hoare triple {38029#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38029#(< main_~i~0 1018)} is VALID [2022-04-28 02:56:56,569 INFO L290 TraceCheckUtils]: 85: Hoare triple {38036#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38029#(< main_~i~0 1018)} is VALID [2022-04-28 02:56:56,569 INFO L290 TraceCheckUtils]: 84: Hoare triple {38036#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38036#(< main_~i~0 1017)} is VALID [2022-04-28 02:56:56,570 INFO L290 TraceCheckUtils]: 83: Hoare triple {38043#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38036#(< main_~i~0 1017)} is VALID [2022-04-28 02:56:56,570 INFO L290 TraceCheckUtils]: 82: Hoare triple {38043#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38043#(< main_~i~0 1016)} is VALID [2022-04-28 02:56:56,571 INFO L290 TraceCheckUtils]: 81: Hoare triple {38050#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38043#(< main_~i~0 1016)} is VALID [2022-04-28 02:56:56,571 INFO L290 TraceCheckUtils]: 80: Hoare triple {38050#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38050#(< main_~i~0 1015)} is VALID [2022-04-28 02:56:56,571 INFO L290 TraceCheckUtils]: 79: Hoare triple {38057#(< main_~i~0 1014)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38050#(< main_~i~0 1015)} is VALID [2022-04-28 02:56:56,572 INFO L290 TraceCheckUtils]: 78: Hoare triple {38057#(< main_~i~0 1014)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38057#(< main_~i~0 1014)} is VALID [2022-04-28 02:56:56,572 INFO L290 TraceCheckUtils]: 77: Hoare triple {38064#(< main_~i~0 1013)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38057#(< main_~i~0 1014)} is VALID [2022-04-28 02:56:56,572 INFO L290 TraceCheckUtils]: 76: Hoare triple {38064#(< main_~i~0 1013)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38064#(< main_~i~0 1013)} is VALID [2022-04-28 02:56:56,573 INFO L290 TraceCheckUtils]: 75: Hoare triple {38071#(< main_~i~0 1012)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38064#(< main_~i~0 1013)} is VALID [2022-04-28 02:56:56,573 INFO L290 TraceCheckUtils]: 74: Hoare triple {38071#(< main_~i~0 1012)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38071#(< main_~i~0 1012)} is VALID [2022-04-28 02:56:56,574 INFO L290 TraceCheckUtils]: 73: Hoare triple {38078#(< main_~i~0 1011)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38071#(< main_~i~0 1012)} is VALID [2022-04-28 02:56:56,574 INFO L290 TraceCheckUtils]: 72: Hoare triple {38078#(< main_~i~0 1011)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38078#(< main_~i~0 1011)} is VALID [2022-04-28 02:56:56,574 INFO L290 TraceCheckUtils]: 71: Hoare triple {38085#(< main_~i~0 1010)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38078#(< main_~i~0 1011)} is VALID [2022-04-28 02:56:56,575 INFO L290 TraceCheckUtils]: 70: Hoare triple {38085#(< main_~i~0 1010)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38085#(< main_~i~0 1010)} is VALID [2022-04-28 02:56:56,575 INFO L290 TraceCheckUtils]: 69: Hoare triple {38092#(< main_~i~0 1009)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38085#(< main_~i~0 1010)} is VALID [2022-04-28 02:56:56,576 INFO L290 TraceCheckUtils]: 68: Hoare triple {38092#(< main_~i~0 1009)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38092#(< main_~i~0 1009)} is VALID [2022-04-28 02:56:56,576 INFO L290 TraceCheckUtils]: 67: Hoare triple {38099#(< main_~i~0 1008)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38092#(< main_~i~0 1009)} is VALID [2022-04-28 02:56:56,576 INFO L290 TraceCheckUtils]: 66: Hoare triple {38099#(< main_~i~0 1008)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38099#(< main_~i~0 1008)} is VALID [2022-04-28 02:56:56,577 INFO L290 TraceCheckUtils]: 65: Hoare triple {38106#(< main_~i~0 1007)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38099#(< main_~i~0 1008)} is VALID [2022-04-28 02:56:56,577 INFO L290 TraceCheckUtils]: 64: Hoare triple {38106#(< main_~i~0 1007)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38106#(< main_~i~0 1007)} is VALID [2022-04-28 02:56:56,578 INFO L290 TraceCheckUtils]: 63: Hoare triple {38113#(< main_~i~0 1006)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38106#(< main_~i~0 1007)} is VALID [2022-04-28 02:56:56,578 INFO L290 TraceCheckUtils]: 62: Hoare triple {38113#(< main_~i~0 1006)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38113#(< main_~i~0 1006)} is VALID [2022-04-28 02:56:56,579 INFO L290 TraceCheckUtils]: 61: Hoare triple {38120#(< main_~i~0 1005)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38113#(< main_~i~0 1006)} is VALID [2022-04-28 02:56:56,579 INFO L290 TraceCheckUtils]: 60: Hoare triple {38120#(< main_~i~0 1005)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38120#(< main_~i~0 1005)} is VALID [2022-04-28 02:56:56,579 INFO L290 TraceCheckUtils]: 59: Hoare triple {38127#(< main_~i~0 1004)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38120#(< main_~i~0 1005)} is VALID [2022-04-28 02:56:56,580 INFO L290 TraceCheckUtils]: 58: Hoare triple {38127#(< main_~i~0 1004)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38127#(< main_~i~0 1004)} is VALID [2022-04-28 02:56:56,580 INFO L290 TraceCheckUtils]: 57: Hoare triple {38134#(< main_~i~0 1003)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38127#(< main_~i~0 1004)} is VALID [2022-04-28 02:56:56,580 INFO L290 TraceCheckUtils]: 56: Hoare triple {38134#(< main_~i~0 1003)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38134#(< main_~i~0 1003)} is VALID [2022-04-28 02:56:56,581 INFO L290 TraceCheckUtils]: 55: Hoare triple {38141#(< main_~i~0 1002)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38134#(< main_~i~0 1003)} is VALID [2022-04-28 02:56:56,581 INFO L290 TraceCheckUtils]: 54: Hoare triple {38141#(< main_~i~0 1002)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38141#(< main_~i~0 1002)} is VALID [2022-04-28 02:56:56,581 INFO L290 TraceCheckUtils]: 53: Hoare triple {38148#(< main_~i~0 1001)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38141#(< main_~i~0 1002)} is VALID [2022-04-28 02:56:56,581 INFO L290 TraceCheckUtils]: 52: Hoare triple {38148#(< main_~i~0 1001)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38148#(< main_~i~0 1001)} is VALID [2022-04-28 02:56:56,582 INFO L290 TraceCheckUtils]: 51: Hoare triple {38155#(< main_~i~0 1000)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38148#(< main_~i~0 1001)} is VALID [2022-04-28 02:56:56,582 INFO L290 TraceCheckUtils]: 50: Hoare triple {38155#(< main_~i~0 1000)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38155#(< main_~i~0 1000)} is VALID [2022-04-28 02:56:56,582 INFO L290 TraceCheckUtils]: 49: Hoare triple {38162#(< main_~i~0 999)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38155#(< main_~i~0 1000)} is VALID [2022-04-28 02:56:56,583 INFO L290 TraceCheckUtils]: 48: Hoare triple {38162#(< main_~i~0 999)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38162#(< main_~i~0 999)} is VALID [2022-04-28 02:56:56,583 INFO L290 TraceCheckUtils]: 47: Hoare triple {38169#(< main_~i~0 998)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38162#(< main_~i~0 999)} is VALID [2022-04-28 02:56:56,583 INFO L290 TraceCheckUtils]: 46: Hoare triple {38169#(< main_~i~0 998)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38169#(< main_~i~0 998)} is VALID [2022-04-28 02:56:56,584 INFO L290 TraceCheckUtils]: 45: Hoare triple {38176#(< main_~i~0 997)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38169#(< main_~i~0 998)} is VALID [2022-04-28 02:56:56,584 INFO L290 TraceCheckUtils]: 44: Hoare triple {38176#(< main_~i~0 997)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38176#(< main_~i~0 997)} is VALID [2022-04-28 02:56:56,584 INFO L290 TraceCheckUtils]: 43: Hoare triple {38183#(< main_~i~0 996)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38176#(< main_~i~0 997)} is VALID [2022-04-28 02:56:56,585 INFO L290 TraceCheckUtils]: 42: Hoare triple {38183#(< main_~i~0 996)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38183#(< main_~i~0 996)} is VALID [2022-04-28 02:56:56,585 INFO L290 TraceCheckUtils]: 41: Hoare triple {38190#(< main_~i~0 995)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38183#(< main_~i~0 996)} is VALID [2022-04-28 02:56:56,585 INFO L290 TraceCheckUtils]: 40: Hoare triple {38190#(< main_~i~0 995)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38190#(< main_~i~0 995)} is VALID [2022-04-28 02:56:56,586 INFO L290 TraceCheckUtils]: 39: Hoare triple {38197#(< main_~i~0 994)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38190#(< main_~i~0 995)} is VALID [2022-04-28 02:56:56,586 INFO L290 TraceCheckUtils]: 38: Hoare triple {38197#(< main_~i~0 994)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38197#(< main_~i~0 994)} is VALID [2022-04-28 02:56:56,586 INFO L290 TraceCheckUtils]: 37: Hoare triple {38204#(< main_~i~0 993)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38197#(< main_~i~0 994)} is VALID [2022-04-28 02:56:56,586 INFO L290 TraceCheckUtils]: 36: Hoare triple {38204#(< main_~i~0 993)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38204#(< main_~i~0 993)} is VALID [2022-04-28 02:56:56,587 INFO L290 TraceCheckUtils]: 35: Hoare triple {38211#(< main_~i~0 992)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38204#(< main_~i~0 993)} is VALID [2022-04-28 02:56:56,587 INFO L290 TraceCheckUtils]: 34: Hoare triple {38211#(< main_~i~0 992)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38211#(< main_~i~0 992)} is VALID [2022-04-28 02:56:56,587 INFO L290 TraceCheckUtils]: 33: Hoare triple {38218#(< main_~i~0 991)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38211#(< main_~i~0 992)} is VALID [2022-04-28 02:56:56,588 INFO L290 TraceCheckUtils]: 32: Hoare triple {38218#(< main_~i~0 991)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38218#(< main_~i~0 991)} is VALID [2022-04-28 02:56:56,588 INFO L290 TraceCheckUtils]: 31: Hoare triple {38225#(< main_~i~0 990)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38218#(< main_~i~0 991)} is VALID [2022-04-28 02:56:56,588 INFO L290 TraceCheckUtils]: 30: Hoare triple {38225#(< main_~i~0 990)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38225#(< main_~i~0 990)} is VALID [2022-04-28 02:56:56,589 INFO L290 TraceCheckUtils]: 29: Hoare triple {38232#(< main_~i~0 989)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38225#(< main_~i~0 990)} is VALID [2022-04-28 02:56:56,589 INFO L290 TraceCheckUtils]: 28: Hoare triple {38232#(< main_~i~0 989)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38232#(< main_~i~0 989)} is VALID [2022-04-28 02:56:56,589 INFO L290 TraceCheckUtils]: 27: Hoare triple {38239#(< main_~i~0 988)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38232#(< main_~i~0 989)} is VALID [2022-04-28 02:56:56,590 INFO L290 TraceCheckUtils]: 26: Hoare triple {38239#(< main_~i~0 988)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38239#(< main_~i~0 988)} is VALID [2022-04-28 02:56:56,590 INFO L290 TraceCheckUtils]: 25: Hoare triple {38246#(< main_~i~0 987)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38239#(< main_~i~0 988)} is VALID [2022-04-28 02:56:56,590 INFO L290 TraceCheckUtils]: 24: Hoare triple {38246#(< main_~i~0 987)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38246#(< main_~i~0 987)} is VALID [2022-04-28 02:56:56,590 INFO L290 TraceCheckUtils]: 23: Hoare triple {38253#(< main_~i~0 986)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38246#(< main_~i~0 987)} is VALID [2022-04-28 02:56:56,591 INFO L290 TraceCheckUtils]: 22: Hoare triple {38253#(< main_~i~0 986)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38253#(< main_~i~0 986)} is VALID [2022-04-28 02:56:56,591 INFO L290 TraceCheckUtils]: 21: Hoare triple {38260#(< main_~i~0 985)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38253#(< main_~i~0 986)} is VALID [2022-04-28 02:56:56,591 INFO L290 TraceCheckUtils]: 20: Hoare triple {38260#(< main_~i~0 985)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38260#(< main_~i~0 985)} is VALID [2022-04-28 02:56:56,592 INFO L290 TraceCheckUtils]: 19: Hoare triple {38267#(< main_~i~0 984)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38260#(< main_~i~0 985)} is VALID [2022-04-28 02:56:56,592 INFO L290 TraceCheckUtils]: 18: Hoare triple {38267#(< main_~i~0 984)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38267#(< main_~i~0 984)} is VALID [2022-04-28 02:56:56,592 INFO L290 TraceCheckUtils]: 17: Hoare triple {38274#(< main_~i~0 983)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38267#(< main_~i~0 984)} is VALID [2022-04-28 02:56:56,593 INFO L290 TraceCheckUtils]: 16: Hoare triple {38274#(< main_~i~0 983)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38274#(< main_~i~0 983)} is VALID [2022-04-28 02:56:56,593 INFO L290 TraceCheckUtils]: 15: Hoare triple {38281#(< main_~i~0 982)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38274#(< main_~i~0 983)} is VALID [2022-04-28 02:56:56,593 INFO L290 TraceCheckUtils]: 14: Hoare triple {38281#(< main_~i~0 982)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38281#(< main_~i~0 982)} is VALID [2022-04-28 02:56:56,594 INFO L290 TraceCheckUtils]: 13: Hoare triple {38288#(< main_~i~0 981)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38281#(< main_~i~0 982)} is VALID [2022-04-28 02:56:56,594 INFO L290 TraceCheckUtils]: 12: Hoare triple {38288#(< main_~i~0 981)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38288#(< main_~i~0 981)} is VALID [2022-04-28 02:56:56,594 INFO L290 TraceCheckUtils]: 11: Hoare triple {38295#(< main_~i~0 980)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38288#(< main_~i~0 981)} is VALID [2022-04-28 02:56:56,594 INFO L290 TraceCheckUtils]: 10: Hoare triple {38295#(< main_~i~0 980)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38295#(< main_~i~0 980)} is VALID [2022-04-28 02:56:56,595 INFO L290 TraceCheckUtils]: 9: Hoare triple {38302#(< main_~i~0 979)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38295#(< main_~i~0 980)} is VALID [2022-04-28 02:56:56,595 INFO L290 TraceCheckUtils]: 8: Hoare triple {38302#(< main_~i~0 979)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38302#(< main_~i~0 979)} is VALID [2022-04-28 02:56:56,595 INFO L290 TraceCheckUtils]: 7: Hoare triple {38309#(< main_~i~0 978)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38302#(< main_~i~0 979)} is VALID [2022-04-28 02:56:56,596 INFO L290 TraceCheckUtils]: 6: Hoare triple {38309#(< main_~i~0 978)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38309#(< main_~i~0 978)} is VALID [2022-04-28 02:56:56,596 INFO L290 TraceCheckUtils]: 5: Hoare triple {37609#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {38309#(< main_~i~0 978)} is VALID [2022-04-28 02:56:56,596 INFO L272 TraceCheckUtils]: 4: Hoare triple {37609#true} call #t~ret6 := main(); {37609#true} is VALID [2022-04-28 02:56:56,596 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37609#true} {37609#true} #39#return; {37609#true} is VALID [2022-04-28 02:56:56,596 INFO L290 TraceCheckUtils]: 2: Hoare triple {37609#true} assume true; {37609#true} is VALID [2022-04-28 02:56:56,596 INFO L290 TraceCheckUtils]: 1: Hoare triple {37609#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {37609#true} is VALID [2022-04-28 02:56:56,596 INFO L272 TraceCheckUtils]: 0: Hoare triple {37609#true} call ULTIMATE.init(); {37609#true} is VALID [2022-04-28 02:56:56,597 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:56:56,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1267883124] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:56:56,597 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:56:56,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 49, 49] total 98 [2022-04-28 02:56:56,597 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:56:56,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [609214809] [2022-04-28 02:56:56,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [609214809] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:56,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:56,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [50] imperfect sequences [] total 50 [2022-04-28 02:56:56,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386026164] [2022-04-28 02:56:56,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:56:56,598 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.0) internal successors, (100), 49 states have internal predecessors, (100), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 104 [2022-04-28 02:56:56,598 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:56:56,598 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 50 states, 50 states have (on average 2.0) internal successors, (100), 49 states have internal predecessors, (100), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:56,662 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:56,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-04-28 02:56:56,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:56,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-04-28 02:56:56,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4658, Invalid=4848, Unknown=0, NotChecked=0, Total=9506 [2022-04-28 02:56:56,663 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand has 50 states, 50 states have (on average 2.0) internal successors, (100), 49 states have internal predecessors, (100), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:58,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:58,306 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2022-04-28 02:56:58,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-04-28 02:56:58,307 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.0) internal successors, (100), 49 states have internal predecessors, (100), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 104 [2022-04-28 02:56:58,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:56:58,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 2.0) internal successors, (100), 49 states have internal predecessors, (100), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:58,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 114 transitions. [2022-04-28 02:56:58,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 2.0) internal successors, (100), 49 states have internal predecessors, (100), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:58,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 114 transitions. [2022-04-28 02:56:58,309 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 114 transitions. [2022-04-28 02:56:58,392 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:58,393 INFO L225 Difference]: With dead ends: 114 [2022-04-28 02:56:58,393 INFO L226 Difference]: Without dead ends: 108 [2022-04-28 02:56:58,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1356 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=9218, Invalid=11662, Unknown=0, NotChecked=0, Total=20880 [2022-04-28 02:56:58,395 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 102 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:56:58,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 29 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:56:58,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-04-28 02:56:58,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2022-04-28 02:56:58,870 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:56:58,870 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand has 107 states, 102 states have (on average 1.0098039215686274) internal successors, (103), 102 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:58,870 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand has 107 states, 102 states have (on average 1.0098039215686274) internal successors, (103), 102 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:58,870 INFO L87 Difference]: Start difference. First operand 108 states. Second operand has 107 states, 102 states have (on average 1.0098039215686274) internal successors, (103), 102 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:58,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:58,871 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2022-04-28 02:56:58,871 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2022-04-28 02:56:58,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:58,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:58,871 INFO L74 IsIncluded]: Start isIncluded. First operand has 107 states, 102 states have (on average 1.0098039215686274) internal successors, (103), 102 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 108 states. [2022-04-28 02:56:58,871 INFO L87 Difference]: Start difference. First operand has 107 states, 102 states have (on average 1.0098039215686274) internal successors, (103), 102 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 108 states. [2022-04-28 02:56:58,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:58,872 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2022-04-28 02:56:58,872 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2022-04-28 02:56:58,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:58,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:58,872 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:56:58,872 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:56:58,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 102 states have (on average 1.0098039215686274) internal successors, (103), 102 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:58,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2022-04-28 02:56:58,873 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 104 [2022-04-28 02:56:58,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:56:58,873 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2022-04-28 02:56:58,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.0) internal successors, (100), 49 states have internal predecessors, (100), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:58,874 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 107 states and 107 transitions. [2022-04-28 02:56:58,995 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:58,995 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2022-04-28 02:56:58,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-04-28 02:56:58,996 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:56:58,996 INFO L195 NwaCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:56:59,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Ended with exit code 0 [2022-04-28 02:56:59,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:59,196 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:56:59,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:56:59,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1894442584, now seen corresponding path program 93 times [2022-04-28 02:56:59,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:59,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [951307180] [2022-04-28 02:56:59,198 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:56:59,198 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:56:59,198 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:56:59,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1894442584, now seen corresponding path program 94 times [2022-04-28 02:56:59,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:59,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778876783] [2022-04-28 02:56:59,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:59,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:59,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:00,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:57:00,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:00,100 INFO L290 TraceCheckUtils]: 0: Hoare triple {39138#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {39085#true} is VALID [2022-04-28 02:57:00,100 INFO L290 TraceCheckUtils]: 1: Hoare triple {39085#true} assume true; {39085#true} is VALID [2022-04-28 02:57:00,100 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {39085#true} {39085#true} #39#return; {39085#true} is VALID [2022-04-28 02:57:00,101 INFO L272 TraceCheckUtils]: 0: Hoare triple {39085#true} call ULTIMATE.init(); {39138#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:57:00,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {39138#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {39085#true} is VALID [2022-04-28 02:57:00,101 INFO L290 TraceCheckUtils]: 2: Hoare triple {39085#true} assume true; {39085#true} is VALID [2022-04-28 02:57:00,101 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39085#true} {39085#true} #39#return; {39085#true} is VALID [2022-04-28 02:57:00,101 INFO L272 TraceCheckUtils]: 4: Hoare triple {39085#true} call #t~ret6 := main(); {39085#true} is VALID [2022-04-28 02:57:00,101 INFO L290 TraceCheckUtils]: 5: Hoare triple {39085#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {39090#(= main_~i~0 0)} is VALID [2022-04-28 02:57:00,101 INFO L290 TraceCheckUtils]: 6: Hoare triple {39090#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39090#(= main_~i~0 0)} is VALID [2022-04-28 02:57:00,102 INFO L290 TraceCheckUtils]: 7: Hoare triple {39090#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39091#(<= main_~i~0 1)} is VALID [2022-04-28 02:57:00,102 INFO L290 TraceCheckUtils]: 8: Hoare triple {39091#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39091#(<= main_~i~0 1)} is VALID [2022-04-28 02:57:00,102 INFO L290 TraceCheckUtils]: 9: Hoare triple {39091#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39092#(<= main_~i~0 2)} is VALID [2022-04-28 02:57:00,103 INFO L290 TraceCheckUtils]: 10: Hoare triple {39092#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39092#(<= main_~i~0 2)} is VALID [2022-04-28 02:57:00,103 INFO L290 TraceCheckUtils]: 11: Hoare triple {39092#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39093#(<= main_~i~0 3)} is VALID [2022-04-28 02:57:00,103 INFO L290 TraceCheckUtils]: 12: Hoare triple {39093#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39093#(<= main_~i~0 3)} is VALID [2022-04-28 02:57:00,103 INFO L290 TraceCheckUtils]: 13: Hoare triple {39093#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39094#(<= main_~i~0 4)} is VALID [2022-04-28 02:57:00,104 INFO L290 TraceCheckUtils]: 14: Hoare triple {39094#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39094#(<= main_~i~0 4)} is VALID [2022-04-28 02:57:00,104 INFO L290 TraceCheckUtils]: 15: Hoare triple {39094#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39095#(<= main_~i~0 5)} is VALID [2022-04-28 02:57:00,104 INFO L290 TraceCheckUtils]: 16: Hoare triple {39095#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39095#(<= main_~i~0 5)} is VALID [2022-04-28 02:57:00,105 INFO L290 TraceCheckUtils]: 17: Hoare triple {39095#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39096#(<= main_~i~0 6)} is VALID [2022-04-28 02:57:00,105 INFO L290 TraceCheckUtils]: 18: Hoare triple {39096#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39096#(<= main_~i~0 6)} is VALID [2022-04-28 02:57:00,105 INFO L290 TraceCheckUtils]: 19: Hoare triple {39096#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39097#(<= main_~i~0 7)} is VALID [2022-04-28 02:57:00,106 INFO L290 TraceCheckUtils]: 20: Hoare triple {39097#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39097#(<= main_~i~0 7)} is VALID [2022-04-28 02:57:00,106 INFO L290 TraceCheckUtils]: 21: Hoare triple {39097#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39098#(<= main_~i~0 8)} is VALID [2022-04-28 02:57:00,106 INFO L290 TraceCheckUtils]: 22: Hoare triple {39098#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39098#(<= main_~i~0 8)} is VALID [2022-04-28 02:57:00,107 INFO L290 TraceCheckUtils]: 23: Hoare triple {39098#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39099#(<= main_~i~0 9)} is VALID [2022-04-28 02:57:00,107 INFO L290 TraceCheckUtils]: 24: Hoare triple {39099#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39099#(<= main_~i~0 9)} is VALID [2022-04-28 02:57:00,107 INFO L290 TraceCheckUtils]: 25: Hoare triple {39099#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39100#(<= main_~i~0 10)} is VALID [2022-04-28 02:57:00,107 INFO L290 TraceCheckUtils]: 26: Hoare triple {39100#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39100#(<= main_~i~0 10)} is VALID [2022-04-28 02:57:00,108 INFO L290 TraceCheckUtils]: 27: Hoare triple {39100#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39101#(<= main_~i~0 11)} is VALID [2022-04-28 02:57:00,108 INFO L290 TraceCheckUtils]: 28: Hoare triple {39101#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39101#(<= main_~i~0 11)} is VALID [2022-04-28 02:57:00,108 INFO L290 TraceCheckUtils]: 29: Hoare triple {39101#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39102#(<= main_~i~0 12)} is VALID [2022-04-28 02:57:00,109 INFO L290 TraceCheckUtils]: 30: Hoare triple {39102#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39102#(<= main_~i~0 12)} is VALID [2022-04-28 02:57:00,109 INFO L290 TraceCheckUtils]: 31: Hoare triple {39102#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39103#(<= main_~i~0 13)} is VALID [2022-04-28 02:57:00,109 INFO L290 TraceCheckUtils]: 32: Hoare triple {39103#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39103#(<= main_~i~0 13)} is VALID [2022-04-28 02:57:00,110 INFO L290 TraceCheckUtils]: 33: Hoare triple {39103#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39104#(<= main_~i~0 14)} is VALID [2022-04-28 02:57:00,110 INFO L290 TraceCheckUtils]: 34: Hoare triple {39104#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39104#(<= main_~i~0 14)} is VALID [2022-04-28 02:57:00,110 INFO L290 TraceCheckUtils]: 35: Hoare triple {39104#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39105#(<= main_~i~0 15)} is VALID [2022-04-28 02:57:00,110 INFO L290 TraceCheckUtils]: 36: Hoare triple {39105#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39105#(<= main_~i~0 15)} is VALID [2022-04-28 02:57:00,111 INFO L290 TraceCheckUtils]: 37: Hoare triple {39105#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39106#(<= main_~i~0 16)} is VALID [2022-04-28 02:57:00,111 INFO L290 TraceCheckUtils]: 38: Hoare triple {39106#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39106#(<= main_~i~0 16)} is VALID [2022-04-28 02:57:00,111 INFO L290 TraceCheckUtils]: 39: Hoare triple {39106#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39107#(<= main_~i~0 17)} is VALID [2022-04-28 02:57:00,112 INFO L290 TraceCheckUtils]: 40: Hoare triple {39107#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39107#(<= main_~i~0 17)} is VALID [2022-04-28 02:57:00,112 INFO L290 TraceCheckUtils]: 41: Hoare triple {39107#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39108#(<= main_~i~0 18)} is VALID [2022-04-28 02:57:00,112 INFO L290 TraceCheckUtils]: 42: Hoare triple {39108#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39108#(<= main_~i~0 18)} is VALID [2022-04-28 02:57:00,113 INFO L290 TraceCheckUtils]: 43: Hoare triple {39108#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39109#(<= main_~i~0 19)} is VALID [2022-04-28 02:57:00,113 INFO L290 TraceCheckUtils]: 44: Hoare triple {39109#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39109#(<= main_~i~0 19)} is VALID [2022-04-28 02:57:00,113 INFO L290 TraceCheckUtils]: 45: Hoare triple {39109#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39110#(<= main_~i~0 20)} is VALID [2022-04-28 02:57:00,113 INFO L290 TraceCheckUtils]: 46: Hoare triple {39110#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39110#(<= main_~i~0 20)} is VALID [2022-04-28 02:57:00,114 INFO L290 TraceCheckUtils]: 47: Hoare triple {39110#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39111#(<= main_~i~0 21)} is VALID [2022-04-28 02:57:00,114 INFO L290 TraceCheckUtils]: 48: Hoare triple {39111#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39111#(<= main_~i~0 21)} is VALID [2022-04-28 02:57:00,114 INFO L290 TraceCheckUtils]: 49: Hoare triple {39111#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39112#(<= main_~i~0 22)} is VALID [2022-04-28 02:57:00,115 INFO L290 TraceCheckUtils]: 50: Hoare triple {39112#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39112#(<= main_~i~0 22)} is VALID [2022-04-28 02:57:00,115 INFO L290 TraceCheckUtils]: 51: Hoare triple {39112#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39113#(<= main_~i~0 23)} is VALID [2022-04-28 02:57:00,115 INFO L290 TraceCheckUtils]: 52: Hoare triple {39113#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39113#(<= main_~i~0 23)} is VALID [2022-04-28 02:57:00,116 INFO L290 TraceCheckUtils]: 53: Hoare triple {39113#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39114#(<= main_~i~0 24)} is VALID [2022-04-28 02:57:00,116 INFO L290 TraceCheckUtils]: 54: Hoare triple {39114#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39114#(<= main_~i~0 24)} is VALID [2022-04-28 02:57:00,116 INFO L290 TraceCheckUtils]: 55: Hoare triple {39114#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39115#(<= main_~i~0 25)} is VALID [2022-04-28 02:57:00,116 INFO L290 TraceCheckUtils]: 56: Hoare triple {39115#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39115#(<= main_~i~0 25)} is VALID [2022-04-28 02:57:00,117 INFO L290 TraceCheckUtils]: 57: Hoare triple {39115#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39116#(<= main_~i~0 26)} is VALID [2022-04-28 02:57:00,117 INFO L290 TraceCheckUtils]: 58: Hoare triple {39116#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39116#(<= main_~i~0 26)} is VALID [2022-04-28 02:57:00,117 INFO L290 TraceCheckUtils]: 59: Hoare triple {39116#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39117#(<= main_~i~0 27)} is VALID [2022-04-28 02:57:00,118 INFO L290 TraceCheckUtils]: 60: Hoare triple {39117#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39117#(<= main_~i~0 27)} is VALID [2022-04-28 02:57:00,118 INFO L290 TraceCheckUtils]: 61: Hoare triple {39117#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39118#(<= main_~i~0 28)} is VALID [2022-04-28 02:57:00,118 INFO L290 TraceCheckUtils]: 62: Hoare triple {39118#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39118#(<= main_~i~0 28)} is VALID [2022-04-28 02:57:00,119 INFO L290 TraceCheckUtils]: 63: Hoare triple {39118#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39119#(<= main_~i~0 29)} is VALID [2022-04-28 02:57:00,119 INFO L290 TraceCheckUtils]: 64: Hoare triple {39119#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39119#(<= main_~i~0 29)} is VALID [2022-04-28 02:57:00,119 INFO L290 TraceCheckUtils]: 65: Hoare triple {39119#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39120#(<= main_~i~0 30)} is VALID [2022-04-28 02:57:00,120 INFO L290 TraceCheckUtils]: 66: Hoare triple {39120#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39120#(<= main_~i~0 30)} is VALID [2022-04-28 02:57:00,120 INFO L290 TraceCheckUtils]: 67: Hoare triple {39120#(<= main_~i~0 30)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39121#(<= main_~i~0 31)} is VALID [2022-04-28 02:57:00,120 INFO L290 TraceCheckUtils]: 68: Hoare triple {39121#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39121#(<= main_~i~0 31)} is VALID [2022-04-28 02:57:00,120 INFO L290 TraceCheckUtils]: 69: Hoare triple {39121#(<= main_~i~0 31)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39122#(<= main_~i~0 32)} is VALID [2022-04-28 02:57:00,121 INFO L290 TraceCheckUtils]: 70: Hoare triple {39122#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39122#(<= main_~i~0 32)} is VALID [2022-04-28 02:57:00,121 INFO L290 TraceCheckUtils]: 71: Hoare triple {39122#(<= main_~i~0 32)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39123#(<= main_~i~0 33)} is VALID [2022-04-28 02:57:00,121 INFO L290 TraceCheckUtils]: 72: Hoare triple {39123#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39123#(<= main_~i~0 33)} is VALID [2022-04-28 02:57:00,122 INFO L290 TraceCheckUtils]: 73: Hoare triple {39123#(<= main_~i~0 33)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39124#(<= main_~i~0 34)} is VALID [2022-04-28 02:57:00,122 INFO L290 TraceCheckUtils]: 74: Hoare triple {39124#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39124#(<= main_~i~0 34)} is VALID [2022-04-28 02:57:00,122 INFO L290 TraceCheckUtils]: 75: Hoare triple {39124#(<= main_~i~0 34)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39125#(<= main_~i~0 35)} is VALID [2022-04-28 02:57:00,123 INFO L290 TraceCheckUtils]: 76: Hoare triple {39125#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39125#(<= main_~i~0 35)} is VALID [2022-04-28 02:57:00,123 INFO L290 TraceCheckUtils]: 77: Hoare triple {39125#(<= main_~i~0 35)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39126#(<= main_~i~0 36)} is VALID [2022-04-28 02:57:00,123 INFO L290 TraceCheckUtils]: 78: Hoare triple {39126#(<= main_~i~0 36)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39126#(<= main_~i~0 36)} is VALID [2022-04-28 02:57:00,124 INFO L290 TraceCheckUtils]: 79: Hoare triple {39126#(<= main_~i~0 36)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39127#(<= main_~i~0 37)} is VALID [2022-04-28 02:57:00,124 INFO L290 TraceCheckUtils]: 80: Hoare triple {39127#(<= main_~i~0 37)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39127#(<= main_~i~0 37)} is VALID [2022-04-28 02:57:00,124 INFO L290 TraceCheckUtils]: 81: Hoare triple {39127#(<= main_~i~0 37)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39128#(<= main_~i~0 38)} is VALID [2022-04-28 02:57:00,124 INFO L290 TraceCheckUtils]: 82: Hoare triple {39128#(<= main_~i~0 38)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39128#(<= main_~i~0 38)} is VALID [2022-04-28 02:57:00,125 INFO L290 TraceCheckUtils]: 83: Hoare triple {39128#(<= main_~i~0 38)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39129#(<= main_~i~0 39)} is VALID [2022-04-28 02:57:00,125 INFO L290 TraceCheckUtils]: 84: Hoare triple {39129#(<= main_~i~0 39)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39129#(<= main_~i~0 39)} is VALID [2022-04-28 02:57:00,125 INFO L290 TraceCheckUtils]: 85: Hoare triple {39129#(<= main_~i~0 39)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39130#(<= main_~i~0 40)} is VALID [2022-04-28 02:57:00,126 INFO L290 TraceCheckUtils]: 86: Hoare triple {39130#(<= main_~i~0 40)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39130#(<= main_~i~0 40)} is VALID [2022-04-28 02:57:00,126 INFO L290 TraceCheckUtils]: 87: Hoare triple {39130#(<= main_~i~0 40)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39131#(<= main_~i~0 41)} is VALID [2022-04-28 02:57:00,126 INFO L290 TraceCheckUtils]: 88: Hoare triple {39131#(<= main_~i~0 41)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39131#(<= main_~i~0 41)} is VALID [2022-04-28 02:57:00,127 INFO L290 TraceCheckUtils]: 89: Hoare triple {39131#(<= main_~i~0 41)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39132#(<= main_~i~0 42)} is VALID [2022-04-28 02:57:00,127 INFO L290 TraceCheckUtils]: 90: Hoare triple {39132#(<= main_~i~0 42)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39132#(<= main_~i~0 42)} is VALID [2022-04-28 02:57:00,127 INFO L290 TraceCheckUtils]: 91: Hoare triple {39132#(<= main_~i~0 42)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39133#(<= main_~i~0 43)} is VALID [2022-04-28 02:57:00,127 INFO L290 TraceCheckUtils]: 92: Hoare triple {39133#(<= main_~i~0 43)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39133#(<= main_~i~0 43)} is VALID [2022-04-28 02:57:00,128 INFO L290 TraceCheckUtils]: 93: Hoare triple {39133#(<= main_~i~0 43)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39134#(<= main_~i~0 44)} is VALID [2022-04-28 02:57:00,128 INFO L290 TraceCheckUtils]: 94: Hoare triple {39134#(<= main_~i~0 44)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39134#(<= main_~i~0 44)} is VALID [2022-04-28 02:57:00,128 INFO L290 TraceCheckUtils]: 95: Hoare triple {39134#(<= main_~i~0 44)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39135#(<= main_~i~0 45)} is VALID [2022-04-28 02:57:00,129 INFO L290 TraceCheckUtils]: 96: Hoare triple {39135#(<= main_~i~0 45)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39135#(<= main_~i~0 45)} is VALID [2022-04-28 02:57:00,129 INFO L290 TraceCheckUtils]: 97: Hoare triple {39135#(<= main_~i~0 45)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39136#(<= main_~i~0 46)} is VALID [2022-04-28 02:57:00,129 INFO L290 TraceCheckUtils]: 98: Hoare triple {39136#(<= main_~i~0 46)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39136#(<= main_~i~0 46)} is VALID [2022-04-28 02:57:00,130 INFO L290 TraceCheckUtils]: 99: Hoare triple {39136#(<= main_~i~0 46)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39137#(<= main_~i~0 47)} is VALID [2022-04-28 02:57:00,130 INFO L290 TraceCheckUtils]: 100: Hoare triple {39137#(<= main_~i~0 47)} assume !(~i~0 < 1024); {39086#false} is VALID [2022-04-28 02:57:00,130 INFO L290 TraceCheckUtils]: 101: Hoare triple {39086#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {39086#false} is VALID [2022-04-28 02:57:00,130 INFO L272 TraceCheckUtils]: 102: Hoare triple {39086#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {39086#false} is VALID [2022-04-28 02:57:00,130 INFO L290 TraceCheckUtils]: 103: Hoare triple {39086#false} ~cond := #in~cond; {39086#false} is VALID [2022-04-28 02:57:00,130 INFO L290 TraceCheckUtils]: 104: Hoare triple {39086#false} assume 0 == ~cond; {39086#false} is VALID [2022-04-28 02:57:00,130 INFO L290 TraceCheckUtils]: 105: Hoare triple {39086#false} assume !false; {39086#false} is VALID [2022-04-28 02:57:00,130 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:57:00,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:57:00,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778876783] [2022-04-28 02:57:00,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778876783] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:57:00,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939533079] [2022-04-28 02:57:00,131 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 02:57:00,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:57:00,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:57:00,132 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:57:00,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-04-28 02:57:00,384 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 02:57:00,384 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:57:00,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 49 conjunts are in the unsatisfiable core [2022-04-28 02:57:00,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:00,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:57:01,039 INFO L272 TraceCheckUtils]: 0: Hoare triple {39085#true} call ULTIMATE.init(); {39085#true} is VALID [2022-04-28 02:57:01,039 INFO L290 TraceCheckUtils]: 1: Hoare triple {39085#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {39085#true} is VALID [2022-04-28 02:57:01,039 INFO L290 TraceCheckUtils]: 2: Hoare triple {39085#true} assume true; {39085#true} is VALID [2022-04-28 02:57:01,039 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39085#true} {39085#true} #39#return; {39085#true} is VALID [2022-04-28 02:57:01,039 INFO L272 TraceCheckUtils]: 4: Hoare triple {39085#true} call #t~ret6 := main(); {39085#true} is VALID [2022-04-28 02:57:01,040 INFO L290 TraceCheckUtils]: 5: Hoare triple {39085#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {39157#(<= main_~i~0 0)} is VALID [2022-04-28 02:57:01,040 INFO L290 TraceCheckUtils]: 6: Hoare triple {39157#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39157#(<= main_~i~0 0)} is VALID [2022-04-28 02:57:01,040 INFO L290 TraceCheckUtils]: 7: Hoare triple {39157#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39091#(<= main_~i~0 1)} is VALID [2022-04-28 02:57:01,040 INFO L290 TraceCheckUtils]: 8: Hoare triple {39091#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39091#(<= main_~i~0 1)} is VALID [2022-04-28 02:57:01,041 INFO L290 TraceCheckUtils]: 9: Hoare triple {39091#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39092#(<= main_~i~0 2)} is VALID [2022-04-28 02:57:01,041 INFO L290 TraceCheckUtils]: 10: Hoare triple {39092#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39092#(<= main_~i~0 2)} is VALID [2022-04-28 02:57:01,041 INFO L290 TraceCheckUtils]: 11: Hoare triple {39092#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39093#(<= main_~i~0 3)} is VALID [2022-04-28 02:57:01,042 INFO L290 TraceCheckUtils]: 12: Hoare triple {39093#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39093#(<= main_~i~0 3)} is VALID [2022-04-28 02:57:01,042 INFO L290 TraceCheckUtils]: 13: Hoare triple {39093#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39094#(<= main_~i~0 4)} is VALID [2022-04-28 02:57:01,042 INFO L290 TraceCheckUtils]: 14: Hoare triple {39094#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39094#(<= main_~i~0 4)} is VALID [2022-04-28 02:57:01,043 INFO L290 TraceCheckUtils]: 15: Hoare triple {39094#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39095#(<= main_~i~0 5)} is VALID [2022-04-28 02:57:01,043 INFO L290 TraceCheckUtils]: 16: Hoare triple {39095#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39095#(<= main_~i~0 5)} is VALID [2022-04-28 02:57:01,043 INFO L290 TraceCheckUtils]: 17: Hoare triple {39095#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39096#(<= main_~i~0 6)} is VALID [2022-04-28 02:57:01,043 INFO L290 TraceCheckUtils]: 18: Hoare triple {39096#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39096#(<= main_~i~0 6)} is VALID [2022-04-28 02:57:01,044 INFO L290 TraceCheckUtils]: 19: Hoare triple {39096#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39097#(<= main_~i~0 7)} is VALID [2022-04-28 02:57:01,044 INFO L290 TraceCheckUtils]: 20: Hoare triple {39097#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39097#(<= main_~i~0 7)} is VALID [2022-04-28 02:57:01,044 INFO L290 TraceCheckUtils]: 21: Hoare triple {39097#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39098#(<= main_~i~0 8)} is VALID [2022-04-28 02:57:01,045 INFO L290 TraceCheckUtils]: 22: Hoare triple {39098#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39098#(<= main_~i~0 8)} is VALID [2022-04-28 02:57:01,045 INFO L290 TraceCheckUtils]: 23: Hoare triple {39098#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39099#(<= main_~i~0 9)} is VALID [2022-04-28 02:57:01,045 INFO L290 TraceCheckUtils]: 24: Hoare triple {39099#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39099#(<= main_~i~0 9)} is VALID [2022-04-28 02:57:01,046 INFO L290 TraceCheckUtils]: 25: Hoare triple {39099#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39100#(<= main_~i~0 10)} is VALID [2022-04-28 02:57:01,046 INFO L290 TraceCheckUtils]: 26: Hoare triple {39100#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39100#(<= main_~i~0 10)} is VALID [2022-04-28 02:57:01,046 INFO L290 TraceCheckUtils]: 27: Hoare triple {39100#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39101#(<= main_~i~0 11)} is VALID [2022-04-28 02:57:01,046 INFO L290 TraceCheckUtils]: 28: Hoare triple {39101#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39101#(<= main_~i~0 11)} is VALID [2022-04-28 02:57:01,047 INFO L290 TraceCheckUtils]: 29: Hoare triple {39101#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39102#(<= main_~i~0 12)} is VALID [2022-04-28 02:57:01,047 INFO L290 TraceCheckUtils]: 30: Hoare triple {39102#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39102#(<= main_~i~0 12)} is VALID [2022-04-28 02:57:01,047 INFO L290 TraceCheckUtils]: 31: Hoare triple {39102#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39103#(<= main_~i~0 13)} is VALID [2022-04-28 02:57:01,048 INFO L290 TraceCheckUtils]: 32: Hoare triple {39103#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39103#(<= main_~i~0 13)} is VALID [2022-04-28 02:57:01,048 INFO L290 TraceCheckUtils]: 33: Hoare triple {39103#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39104#(<= main_~i~0 14)} is VALID [2022-04-28 02:57:01,048 INFO L290 TraceCheckUtils]: 34: Hoare triple {39104#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39104#(<= main_~i~0 14)} is VALID [2022-04-28 02:57:01,049 INFO L290 TraceCheckUtils]: 35: Hoare triple {39104#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39105#(<= main_~i~0 15)} is VALID [2022-04-28 02:57:01,049 INFO L290 TraceCheckUtils]: 36: Hoare triple {39105#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39105#(<= main_~i~0 15)} is VALID [2022-04-28 02:57:01,049 INFO L290 TraceCheckUtils]: 37: Hoare triple {39105#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39106#(<= main_~i~0 16)} is VALID [2022-04-28 02:57:01,050 INFO L290 TraceCheckUtils]: 38: Hoare triple {39106#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39106#(<= main_~i~0 16)} is VALID [2022-04-28 02:57:01,050 INFO L290 TraceCheckUtils]: 39: Hoare triple {39106#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39107#(<= main_~i~0 17)} is VALID [2022-04-28 02:57:01,050 INFO L290 TraceCheckUtils]: 40: Hoare triple {39107#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39107#(<= main_~i~0 17)} is VALID [2022-04-28 02:57:01,051 INFO L290 TraceCheckUtils]: 41: Hoare triple {39107#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39108#(<= main_~i~0 18)} is VALID [2022-04-28 02:57:01,051 INFO L290 TraceCheckUtils]: 42: Hoare triple {39108#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39108#(<= main_~i~0 18)} is VALID [2022-04-28 02:57:01,051 INFO L290 TraceCheckUtils]: 43: Hoare triple {39108#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39109#(<= main_~i~0 19)} is VALID [2022-04-28 02:57:01,051 INFO L290 TraceCheckUtils]: 44: Hoare triple {39109#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39109#(<= main_~i~0 19)} is VALID [2022-04-28 02:57:01,052 INFO L290 TraceCheckUtils]: 45: Hoare triple {39109#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39110#(<= main_~i~0 20)} is VALID [2022-04-28 02:57:01,052 INFO L290 TraceCheckUtils]: 46: Hoare triple {39110#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39110#(<= main_~i~0 20)} is VALID [2022-04-28 02:57:01,052 INFO L290 TraceCheckUtils]: 47: Hoare triple {39110#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39111#(<= main_~i~0 21)} is VALID [2022-04-28 02:57:01,053 INFO L290 TraceCheckUtils]: 48: Hoare triple {39111#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39111#(<= main_~i~0 21)} is VALID [2022-04-28 02:57:01,053 INFO L290 TraceCheckUtils]: 49: Hoare triple {39111#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39112#(<= main_~i~0 22)} is VALID [2022-04-28 02:57:01,053 INFO L290 TraceCheckUtils]: 50: Hoare triple {39112#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39112#(<= main_~i~0 22)} is VALID [2022-04-28 02:57:01,054 INFO L290 TraceCheckUtils]: 51: Hoare triple {39112#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39113#(<= main_~i~0 23)} is VALID [2022-04-28 02:57:01,054 INFO L290 TraceCheckUtils]: 52: Hoare triple {39113#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39113#(<= main_~i~0 23)} is VALID [2022-04-28 02:57:01,054 INFO L290 TraceCheckUtils]: 53: Hoare triple {39113#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39114#(<= main_~i~0 24)} is VALID [2022-04-28 02:57:01,054 INFO L290 TraceCheckUtils]: 54: Hoare triple {39114#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39114#(<= main_~i~0 24)} is VALID [2022-04-28 02:57:01,055 INFO L290 TraceCheckUtils]: 55: Hoare triple {39114#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39115#(<= main_~i~0 25)} is VALID [2022-04-28 02:57:01,055 INFO L290 TraceCheckUtils]: 56: Hoare triple {39115#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39115#(<= main_~i~0 25)} is VALID [2022-04-28 02:57:01,055 INFO L290 TraceCheckUtils]: 57: Hoare triple {39115#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39116#(<= main_~i~0 26)} is VALID [2022-04-28 02:57:01,056 INFO L290 TraceCheckUtils]: 58: Hoare triple {39116#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39116#(<= main_~i~0 26)} is VALID [2022-04-28 02:57:01,056 INFO L290 TraceCheckUtils]: 59: Hoare triple {39116#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39117#(<= main_~i~0 27)} is VALID [2022-04-28 02:57:01,056 INFO L290 TraceCheckUtils]: 60: Hoare triple {39117#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39117#(<= main_~i~0 27)} is VALID [2022-04-28 02:57:01,057 INFO L290 TraceCheckUtils]: 61: Hoare triple {39117#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39118#(<= main_~i~0 28)} is VALID [2022-04-28 02:57:01,057 INFO L290 TraceCheckUtils]: 62: Hoare triple {39118#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39118#(<= main_~i~0 28)} is VALID [2022-04-28 02:57:01,057 INFO L290 TraceCheckUtils]: 63: Hoare triple {39118#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39119#(<= main_~i~0 29)} is VALID [2022-04-28 02:57:01,057 INFO L290 TraceCheckUtils]: 64: Hoare triple {39119#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39119#(<= main_~i~0 29)} is VALID [2022-04-28 02:57:01,058 INFO L290 TraceCheckUtils]: 65: Hoare triple {39119#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39120#(<= main_~i~0 30)} is VALID [2022-04-28 02:57:01,058 INFO L290 TraceCheckUtils]: 66: Hoare triple {39120#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39120#(<= main_~i~0 30)} is VALID [2022-04-28 02:57:01,058 INFO L290 TraceCheckUtils]: 67: Hoare triple {39120#(<= main_~i~0 30)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39121#(<= main_~i~0 31)} is VALID [2022-04-28 02:57:01,059 INFO L290 TraceCheckUtils]: 68: Hoare triple {39121#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39121#(<= main_~i~0 31)} is VALID [2022-04-28 02:57:01,059 INFO L290 TraceCheckUtils]: 69: Hoare triple {39121#(<= main_~i~0 31)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39122#(<= main_~i~0 32)} is VALID [2022-04-28 02:57:01,059 INFO L290 TraceCheckUtils]: 70: Hoare triple {39122#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39122#(<= main_~i~0 32)} is VALID [2022-04-28 02:57:01,060 INFO L290 TraceCheckUtils]: 71: Hoare triple {39122#(<= main_~i~0 32)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39123#(<= main_~i~0 33)} is VALID [2022-04-28 02:57:01,060 INFO L290 TraceCheckUtils]: 72: Hoare triple {39123#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39123#(<= main_~i~0 33)} is VALID [2022-04-28 02:57:01,060 INFO L290 TraceCheckUtils]: 73: Hoare triple {39123#(<= main_~i~0 33)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39124#(<= main_~i~0 34)} is VALID [2022-04-28 02:57:01,061 INFO L290 TraceCheckUtils]: 74: Hoare triple {39124#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39124#(<= main_~i~0 34)} is VALID [2022-04-28 02:57:01,061 INFO L290 TraceCheckUtils]: 75: Hoare triple {39124#(<= main_~i~0 34)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39125#(<= main_~i~0 35)} is VALID [2022-04-28 02:57:01,061 INFO L290 TraceCheckUtils]: 76: Hoare triple {39125#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39125#(<= main_~i~0 35)} is VALID [2022-04-28 02:57:01,061 INFO L290 TraceCheckUtils]: 77: Hoare triple {39125#(<= main_~i~0 35)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39126#(<= main_~i~0 36)} is VALID [2022-04-28 02:57:01,062 INFO L290 TraceCheckUtils]: 78: Hoare triple {39126#(<= main_~i~0 36)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39126#(<= main_~i~0 36)} is VALID [2022-04-28 02:57:01,062 INFO L290 TraceCheckUtils]: 79: Hoare triple {39126#(<= main_~i~0 36)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39127#(<= main_~i~0 37)} is VALID [2022-04-28 02:57:01,062 INFO L290 TraceCheckUtils]: 80: Hoare triple {39127#(<= main_~i~0 37)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39127#(<= main_~i~0 37)} is VALID [2022-04-28 02:57:01,063 INFO L290 TraceCheckUtils]: 81: Hoare triple {39127#(<= main_~i~0 37)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39128#(<= main_~i~0 38)} is VALID [2022-04-28 02:57:01,063 INFO L290 TraceCheckUtils]: 82: Hoare triple {39128#(<= main_~i~0 38)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39128#(<= main_~i~0 38)} is VALID [2022-04-28 02:57:01,063 INFO L290 TraceCheckUtils]: 83: Hoare triple {39128#(<= main_~i~0 38)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39129#(<= main_~i~0 39)} is VALID [2022-04-28 02:57:01,064 INFO L290 TraceCheckUtils]: 84: Hoare triple {39129#(<= main_~i~0 39)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39129#(<= main_~i~0 39)} is VALID [2022-04-28 02:57:01,064 INFO L290 TraceCheckUtils]: 85: Hoare triple {39129#(<= main_~i~0 39)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39130#(<= main_~i~0 40)} is VALID [2022-04-28 02:57:01,064 INFO L290 TraceCheckUtils]: 86: Hoare triple {39130#(<= main_~i~0 40)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39130#(<= main_~i~0 40)} is VALID [2022-04-28 02:57:01,065 INFO L290 TraceCheckUtils]: 87: Hoare triple {39130#(<= main_~i~0 40)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39131#(<= main_~i~0 41)} is VALID [2022-04-28 02:57:01,065 INFO L290 TraceCheckUtils]: 88: Hoare triple {39131#(<= main_~i~0 41)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39131#(<= main_~i~0 41)} is VALID [2022-04-28 02:57:01,065 INFO L290 TraceCheckUtils]: 89: Hoare triple {39131#(<= main_~i~0 41)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39132#(<= main_~i~0 42)} is VALID [2022-04-28 02:57:01,065 INFO L290 TraceCheckUtils]: 90: Hoare triple {39132#(<= main_~i~0 42)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39132#(<= main_~i~0 42)} is VALID [2022-04-28 02:57:01,066 INFO L290 TraceCheckUtils]: 91: Hoare triple {39132#(<= main_~i~0 42)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39133#(<= main_~i~0 43)} is VALID [2022-04-28 02:57:01,066 INFO L290 TraceCheckUtils]: 92: Hoare triple {39133#(<= main_~i~0 43)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39133#(<= main_~i~0 43)} is VALID [2022-04-28 02:57:01,066 INFO L290 TraceCheckUtils]: 93: Hoare triple {39133#(<= main_~i~0 43)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39134#(<= main_~i~0 44)} is VALID [2022-04-28 02:57:01,067 INFO L290 TraceCheckUtils]: 94: Hoare triple {39134#(<= main_~i~0 44)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39134#(<= main_~i~0 44)} is VALID [2022-04-28 02:57:01,067 INFO L290 TraceCheckUtils]: 95: Hoare triple {39134#(<= main_~i~0 44)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39135#(<= main_~i~0 45)} is VALID [2022-04-28 02:57:01,067 INFO L290 TraceCheckUtils]: 96: Hoare triple {39135#(<= main_~i~0 45)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39135#(<= main_~i~0 45)} is VALID [2022-04-28 02:57:01,068 INFO L290 TraceCheckUtils]: 97: Hoare triple {39135#(<= main_~i~0 45)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39136#(<= main_~i~0 46)} is VALID [2022-04-28 02:57:01,068 INFO L290 TraceCheckUtils]: 98: Hoare triple {39136#(<= main_~i~0 46)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39136#(<= main_~i~0 46)} is VALID [2022-04-28 02:57:01,068 INFO L290 TraceCheckUtils]: 99: Hoare triple {39136#(<= main_~i~0 46)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39137#(<= main_~i~0 47)} is VALID [2022-04-28 02:57:01,068 INFO L290 TraceCheckUtils]: 100: Hoare triple {39137#(<= main_~i~0 47)} assume !(~i~0 < 1024); {39086#false} is VALID [2022-04-28 02:57:01,069 INFO L290 TraceCheckUtils]: 101: Hoare triple {39086#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {39086#false} is VALID [2022-04-28 02:57:01,069 INFO L272 TraceCheckUtils]: 102: Hoare triple {39086#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {39086#false} is VALID [2022-04-28 02:57:01,069 INFO L290 TraceCheckUtils]: 103: Hoare triple {39086#false} ~cond := #in~cond; {39086#false} is VALID [2022-04-28 02:57:01,069 INFO L290 TraceCheckUtils]: 104: Hoare triple {39086#false} assume 0 == ~cond; {39086#false} is VALID [2022-04-28 02:57:01,069 INFO L290 TraceCheckUtils]: 105: Hoare triple {39086#false} assume !false; {39086#false} is VALID [2022-04-28 02:57:01,069 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:57:01,069 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:57:03,771 INFO L290 TraceCheckUtils]: 105: Hoare triple {39086#false} assume !false; {39086#false} is VALID [2022-04-28 02:57:03,771 INFO L290 TraceCheckUtils]: 104: Hoare triple {39086#false} assume 0 == ~cond; {39086#false} is VALID [2022-04-28 02:57:03,771 INFO L290 TraceCheckUtils]: 103: Hoare triple {39086#false} ~cond := #in~cond; {39086#false} is VALID [2022-04-28 02:57:03,771 INFO L272 TraceCheckUtils]: 102: Hoare triple {39086#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {39086#false} is VALID [2022-04-28 02:57:03,771 INFO L290 TraceCheckUtils]: 101: Hoare triple {39086#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {39086#false} is VALID [2022-04-28 02:57:03,772 INFO L290 TraceCheckUtils]: 100: Hoare triple {39473#(< main_~i~0 1024)} assume !(~i~0 < 1024); {39086#false} is VALID [2022-04-28 02:57:03,772 INFO L290 TraceCheckUtils]: 99: Hoare triple {39477#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39473#(< main_~i~0 1024)} is VALID [2022-04-28 02:57:03,772 INFO L290 TraceCheckUtils]: 98: Hoare triple {39477#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39477#(< main_~i~0 1023)} is VALID [2022-04-28 02:57:03,773 INFO L290 TraceCheckUtils]: 97: Hoare triple {39484#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39477#(< main_~i~0 1023)} is VALID [2022-04-28 02:57:03,773 INFO L290 TraceCheckUtils]: 96: Hoare triple {39484#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39484#(< main_~i~0 1022)} is VALID [2022-04-28 02:57:03,773 INFO L290 TraceCheckUtils]: 95: Hoare triple {39491#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39484#(< main_~i~0 1022)} is VALID [2022-04-28 02:57:03,774 INFO L290 TraceCheckUtils]: 94: Hoare triple {39491#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39491#(< main_~i~0 1021)} is VALID [2022-04-28 02:57:03,774 INFO L290 TraceCheckUtils]: 93: Hoare triple {39498#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39491#(< main_~i~0 1021)} is VALID [2022-04-28 02:57:03,774 INFO L290 TraceCheckUtils]: 92: Hoare triple {39498#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39498#(< main_~i~0 1020)} is VALID [2022-04-28 02:57:03,775 INFO L290 TraceCheckUtils]: 91: Hoare triple {39505#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39498#(< main_~i~0 1020)} is VALID [2022-04-28 02:57:03,775 INFO L290 TraceCheckUtils]: 90: Hoare triple {39505#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39505#(< main_~i~0 1019)} is VALID [2022-04-28 02:57:03,775 INFO L290 TraceCheckUtils]: 89: Hoare triple {39512#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39505#(< main_~i~0 1019)} is VALID [2022-04-28 02:57:03,775 INFO L290 TraceCheckUtils]: 88: Hoare triple {39512#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39512#(< main_~i~0 1018)} is VALID [2022-04-28 02:57:03,776 INFO L290 TraceCheckUtils]: 87: Hoare triple {39519#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39512#(< main_~i~0 1018)} is VALID [2022-04-28 02:57:03,776 INFO L290 TraceCheckUtils]: 86: Hoare triple {39519#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39519#(< main_~i~0 1017)} is VALID [2022-04-28 02:57:03,776 INFO L290 TraceCheckUtils]: 85: Hoare triple {39526#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39519#(< main_~i~0 1017)} is VALID [2022-04-28 02:57:03,777 INFO L290 TraceCheckUtils]: 84: Hoare triple {39526#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39526#(< main_~i~0 1016)} is VALID [2022-04-28 02:57:03,777 INFO L290 TraceCheckUtils]: 83: Hoare triple {39533#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39526#(< main_~i~0 1016)} is VALID [2022-04-28 02:57:03,777 INFO L290 TraceCheckUtils]: 82: Hoare triple {39533#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39533#(< main_~i~0 1015)} is VALID [2022-04-28 02:57:03,778 INFO L290 TraceCheckUtils]: 81: Hoare triple {39540#(< main_~i~0 1014)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39533#(< main_~i~0 1015)} is VALID [2022-04-28 02:57:03,778 INFO L290 TraceCheckUtils]: 80: Hoare triple {39540#(< main_~i~0 1014)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39540#(< main_~i~0 1014)} is VALID [2022-04-28 02:57:03,778 INFO L290 TraceCheckUtils]: 79: Hoare triple {39547#(< main_~i~0 1013)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39540#(< main_~i~0 1014)} is VALID [2022-04-28 02:57:03,779 INFO L290 TraceCheckUtils]: 78: Hoare triple {39547#(< main_~i~0 1013)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39547#(< main_~i~0 1013)} is VALID [2022-04-28 02:57:03,779 INFO L290 TraceCheckUtils]: 77: Hoare triple {39554#(< main_~i~0 1012)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39547#(< main_~i~0 1013)} is VALID [2022-04-28 02:57:03,779 INFO L290 TraceCheckUtils]: 76: Hoare triple {39554#(< main_~i~0 1012)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39554#(< main_~i~0 1012)} is VALID [2022-04-28 02:57:03,780 INFO L290 TraceCheckUtils]: 75: Hoare triple {39561#(< main_~i~0 1011)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39554#(< main_~i~0 1012)} is VALID [2022-04-28 02:57:03,780 INFO L290 TraceCheckUtils]: 74: Hoare triple {39561#(< main_~i~0 1011)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39561#(< main_~i~0 1011)} is VALID [2022-04-28 02:57:03,780 INFO L290 TraceCheckUtils]: 73: Hoare triple {39568#(< main_~i~0 1010)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39561#(< main_~i~0 1011)} is VALID [2022-04-28 02:57:03,780 INFO L290 TraceCheckUtils]: 72: Hoare triple {39568#(< main_~i~0 1010)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39568#(< main_~i~0 1010)} is VALID [2022-04-28 02:57:03,781 INFO L290 TraceCheckUtils]: 71: Hoare triple {39575#(< main_~i~0 1009)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39568#(< main_~i~0 1010)} is VALID [2022-04-28 02:57:03,781 INFO L290 TraceCheckUtils]: 70: Hoare triple {39575#(< main_~i~0 1009)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39575#(< main_~i~0 1009)} is VALID [2022-04-28 02:57:03,781 INFO L290 TraceCheckUtils]: 69: Hoare triple {39582#(< main_~i~0 1008)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39575#(< main_~i~0 1009)} is VALID [2022-04-28 02:57:03,782 INFO L290 TraceCheckUtils]: 68: Hoare triple {39582#(< main_~i~0 1008)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39582#(< main_~i~0 1008)} is VALID [2022-04-28 02:57:03,782 INFO L290 TraceCheckUtils]: 67: Hoare triple {39589#(< main_~i~0 1007)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39582#(< main_~i~0 1008)} is VALID [2022-04-28 02:57:03,782 INFO L290 TraceCheckUtils]: 66: Hoare triple {39589#(< main_~i~0 1007)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39589#(< main_~i~0 1007)} is VALID [2022-04-28 02:57:03,783 INFO L290 TraceCheckUtils]: 65: Hoare triple {39596#(< main_~i~0 1006)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39589#(< main_~i~0 1007)} is VALID [2022-04-28 02:57:03,783 INFO L290 TraceCheckUtils]: 64: Hoare triple {39596#(< main_~i~0 1006)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39596#(< main_~i~0 1006)} is VALID [2022-04-28 02:57:03,783 INFO L290 TraceCheckUtils]: 63: Hoare triple {39603#(< main_~i~0 1005)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39596#(< main_~i~0 1006)} is VALID [2022-04-28 02:57:03,784 INFO L290 TraceCheckUtils]: 62: Hoare triple {39603#(< main_~i~0 1005)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39603#(< main_~i~0 1005)} is VALID [2022-04-28 02:57:03,784 INFO L290 TraceCheckUtils]: 61: Hoare triple {39610#(< main_~i~0 1004)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39603#(< main_~i~0 1005)} is VALID [2022-04-28 02:57:03,784 INFO L290 TraceCheckUtils]: 60: Hoare triple {39610#(< main_~i~0 1004)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39610#(< main_~i~0 1004)} is VALID [2022-04-28 02:57:03,785 INFO L290 TraceCheckUtils]: 59: Hoare triple {39617#(< main_~i~0 1003)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39610#(< main_~i~0 1004)} is VALID [2022-04-28 02:57:03,785 INFO L290 TraceCheckUtils]: 58: Hoare triple {39617#(< main_~i~0 1003)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39617#(< main_~i~0 1003)} is VALID [2022-04-28 02:57:03,785 INFO L290 TraceCheckUtils]: 57: Hoare triple {39624#(< main_~i~0 1002)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39617#(< main_~i~0 1003)} is VALID [2022-04-28 02:57:03,785 INFO L290 TraceCheckUtils]: 56: Hoare triple {39624#(< main_~i~0 1002)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39624#(< main_~i~0 1002)} is VALID [2022-04-28 02:57:03,786 INFO L290 TraceCheckUtils]: 55: Hoare triple {39631#(< main_~i~0 1001)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39624#(< main_~i~0 1002)} is VALID [2022-04-28 02:57:03,786 INFO L290 TraceCheckUtils]: 54: Hoare triple {39631#(< main_~i~0 1001)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39631#(< main_~i~0 1001)} is VALID [2022-04-28 02:57:03,786 INFO L290 TraceCheckUtils]: 53: Hoare triple {39638#(< main_~i~0 1000)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39631#(< main_~i~0 1001)} is VALID [2022-04-28 02:57:03,787 INFO L290 TraceCheckUtils]: 52: Hoare triple {39638#(< main_~i~0 1000)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39638#(< main_~i~0 1000)} is VALID [2022-04-28 02:57:03,787 INFO L290 TraceCheckUtils]: 51: Hoare triple {39645#(< main_~i~0 999)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39638#(< main_~i~0 1000)} is VALID [2022-04-28 02:57:03,787 INFO L290 TraceCheckUtils]: 50: Hoare triple {39645#(< main_~i~0 999)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39645#(< main_~i~0 999)} is VALID [2022-04-28 02:57:03,788 INFO L290 TraceCheckUtils]: 49: Hoare triple {39652#(< main_~i~0 998)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39645#(< main_~i~0 999)} is VALID [2022-04-28 02:57:03,788 INFO L290 TraceCheckUtils]: 48: Hoare triple {39652#(< main_~i~0 998)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39652#(< main_~i~0 998)} is VALID [2022-04-28 02:57:03,788 INFO L290 TraceCheckUtils]: 47: Hoare triple {39659#(< main_~i~0 997)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39652#(< main_~i~0 998)} is VALID [2022-04-28 02:57:03,789 INFO L290 TraceCheckUtils]: 46: Hoare triple {39659#(< main_~i~0 997)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39659#(< main_~i~0 997)} is VALID [2022-04-28 02:57:03,789 INFO L290 TraceCheckUtils]: 45: Hoare triple {39666#(< main_~i~0 996)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39659#(< main_~i~0 997)} is VALID [2022-04-28 02:57:03,789 INFO L290 TraceCheckUtils]: 44: Hoare triple {39666#(< main_~i~0 996)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39666#(< main_~i~0 996)} is VALID [2022-04-28 02:57:03,790 INFO L290 TraceCheckUtils]: 43: Hoare triple {39673#(< main_~i~0 995)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39666#(< main_~i~0 996)} is VALID [2022-04-28 02:57:03,790 INFO L290 TraceCheckUtils]: 42: Hoare triple {39673#(< main_~i~0 995)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39673#(< main_~i~0 995)} is VALID [2022-04-28 02:57:03,790 INFO L290 TraceCheckUtils]: 41: Hoare triple {39680#(< main_~i~0 994)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39673#(< main_~i~0 995)} is VALID [2022-04-28 02:57:03,790 INFO L290 TraceCheckUtils]: 40: Hoare triple {39680#(< main_~i~0 994)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39680#(< main_~i~0 994)} is VALID [2022-04-28 02:57:03,791 INFO L290 TraceCheckUtils]: 39: Hoare triple {39687#(< main_~i~0 993)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39680#(< main_~i~0 994)} is VALID [2022-04-28 02:57:03,791 INFO L290 TraceCheckUtils]: 38: Hoare triple {39687#(< main_~i~0 993)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39687#(< main_~i~0 993)} is VALID [2022-04-28 02:57:03,791 INFO L290 TraceCheckUtils]: 37: Hoare triple {39694#(< main_~i~0 992)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39687#(< main_~i~0 993)} is VALID [2022-04-28 02:57:03,792 INFO L290 TraceCheckUtils]: 36: Hoare triple {39694#(< main_~i~0 992)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39694#(< main_~i~0 992)} is VALID [2022-04-28 02:57:03,792 INFO L290 TraceCheckUtils]: 35: Hoare triple {39701#(< main_~i~0 991)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39694#(< main_~i~0 992)} is VALID [2022-04-28 02:57:03,792 INFO L290 TraceCheckUtils]: 34: Hoare triple {39701#(< main_~i~0 991)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39701#(< main_~i~0 991)} is VALID [2022-04-28 02:57:03,793 INFO L290 TraceCheckUtils]: 33: Hoare triple {39708#(< main_~i~0 990)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39701#(< main_~i~0 991)} is VALID [2022-04-28 02:57:03,793 INFO L290 TraceCheckUtils]: 32: Hoare triple {39708#(< main_~i~0 990)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39708#(< main_~i~0 990)} is VALID [2022-04-28 02:57:03,793 INFO L290 TraceCheckUtils]: 31: Hoare triple {39715#(< main_~i~0 989)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39708#(< main_~i~0 990)} is VALID [2022-04-28 02:57:03,793 INFO L290 TraceCheckUtils]: 30: Hoare triple {39715#(< main_~i~0 989)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39715#(< main_~i~0 989)} is VALID [2022-04-28 02:57:03,794 INFO L290 TraceCheckUtils]: 29: Hoare triple {39722#(< main_~i~0 988)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39715#(< main_~i~0 989)} is VALID [2022-04-28 02:57:03,794 INFO L290 TraceCheckUtils]: 28: Hoare triple {39722#(< main_~i~0 988)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39722#(< main_~i~0 988)} is VALID [2022-04-28 02:57:03,794 INFO L290 TraceCheckUtils]: 27: Hoare triple {39729#(< main_~i~0 987)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39722#(< main_~i~0 988)} is VALID [2022-04-28 02:57:03,795 INFO L290 TraceCheckUtils]: 26: Hoare triple {39729#(< main_~i~0 987)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39729#(< main_~i~0 987)} is VALID [2022-04-28 02:57:03,795 INFO L290 TraceCheckUtils]: 25: Hoare triple {39736#(< main_~i~0 986)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39729#(< main_~i~0 987)} is VALID [2022-04-28 02:57:03,795 INFO L290 TraceCheckUtils]: 24: Hoare triple {39736#(< main_~i~0 986)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39736#(< main_~i~0 986)} is VALID [2022-04-28 02:57:03,796 INFO L290 TraceCheckUtils]: 23: Hoare triple {39743#(< main_~i~0 985)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39736#(< main_~i~0 986)} is VALID [2022-04-28 02:57:03,796 INFO L290 TraceCheckUtils]: 22: Hoare triple {39743#(< main_~i~0 985)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39743#(< main_~i~0 985)} is VALID [2022-04-28 02:57:03,796 INFO L290 TraceCheckUtils]: 21: Hoare triple {39750#(< main_~i~0 984)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39743#(< main_~i~0 985)} is VALID [2022-04-28 02:57:03,797 INFO L290 TraceCheckUtils]: 20: Hoare triple {39750#(< main_~i~0 984)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39750#(< main_~i~0 984)} is VALID [2022-04-28 02:57:03,797 INFO L290 TraceCheckUtils]: 19: Hoare triple {39757#(< main_~i~0 983)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39750#(< main_~i~0 984)} is VALID [2022-04-28 02:57:03,797 INFO L290 TraceCheckUtils]: 18: Hoare triple {39757#(< main_~i~0 983)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39757#(< main_~i~0 983)} is VALID [2022-04-28 02:57:03,798 INFO L290 TraceCheckUtils]: 17: Hoare triple {39764#(< main_~i~0 982)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39757#(< main_~i~0 983)} is VALID [2022-04-28 02:57:03,798 INFO L290 TraceCheckUtils]: 16: Hoare triple {39764#(< main_~i~0 982)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39764#(< main_~i~0 982)} is VALID [2022-04-28 02:57:03,798 INFO L290 TraceCheckUtils]: 15: Hoare triple {39771#(< main_~i~0 981)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39764#(< main_~i~0 982)} is VALID [2022-04-28 02:57:03,798 INFO L290 TraceCheckUtils]: 14: Hoare triple {39771#(< main_~i~0 981)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39771#(< main_~i~0 981)} is VALID [2022-04-28 02:57:03,799 INFO L290 TraceCheckUtils]: 13: Hoare triple {39778#(< main_~i~0 980)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39771#(< main_~i~0 981)} is VALID [2022-04-28 02:57:03,799 INFO L290 TraceCheckUtils]: 12: Hoare triple {39778#(< main_~i~0 980)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39778#(< main_~i~0 980)} is VALID [2022-04-28 02:57:03,799 INFO L290 TraceCheckUtils]: 11: Hoare triple {39785#(< main_~i~0 979)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39778#(< main_~i~0 980)} is VALID [2022-04-28 02:57:03,800 INFO L290 TraceCheckUtils]: 10: Hoare triple {39785#(< main_~i~0 979)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39785#(< main_~i~0 979)} is VALID [2022-04-28 02:57:03,800 INFO L290 TraceCheckUtils]: 9: Hoare triple {39792#(< main_~i~0 978)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39785#(< main_~i~0 979)} is VALID [2022-04-28 02:57:03,800 INFO L290 TraceCheckUtils]: 8: Hoare triple {39792#(< main_~i~0 978)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39792#(< main_~i~0 978)} is VALID [2022-04-28 02:57:03,801 INFO L290 TraceCheckUtils]: 7: Hoare triple {39799#(< main_~i~0 977)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39792#(< main_~i~0 978)} is VALID [2022-04-28 02:57:03,801 INFO L290 TraceCheckUtils]: 6: Hoare triple {39799#(< main_~i~0 977)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39799#(< main_~i~0 977)} is VALID [2022-04-28 02:57:03,801 INFO L290 TraceCheckUtils]: 5: Hoare triple {39085#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {39799#(< main_~i~0 977)} is VALID [2022-04-28 02:57:03,801 INFO L272 TraceCheckUtils]: 4: Hoare triple {39085#true} call #t~ret6 := main(); {39085#true} is VALID [2022-04-28 02:57:03,802 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39085#true} {39085#true} #39#return; {39085#true} is VALID [2022-04-28 02:57:03,802 INFO L290 TraceCheckUtils]: 2: Hoare triple {39085#true} assume true; {39085#true} is VALID [2022-04-28 02:57:03,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {39085#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {39085#true} is VALID [2022-04-28 02:57:03,802 INFO L272 TraceCheckUtils]: 0: Hoare triple {39085#true} call ULTIMATE.init(); {39085#true} is VALID [2022-04-28 02:57:03,802 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:57:03,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939533079] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:57:03,802 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:57:03,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 50, 50] total 100 [2022-04-28 02:57:03,802 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:57:03,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [951307180] [2022-04-28 02:57:03,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [951307180] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:57:03,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:57:03,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [51] imperfect sequences [] total 51 [2022-04-28 02:57:03,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765782126] [2022-04-28 02:57:03,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:57:03,803 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 2.0) internal successors, (102), 50 states have internal predecessors, (102), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 106 [2022-04-28 02:57:03,803 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:57:03,803 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 51 states, 51 states have (on average 2.0) internal successors, (102), 50 states have internal predecessors, (102), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:03,870 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:03,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-04-28 02:57:03,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:03,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-04-28 02:57:03,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4853, Invalid=5047, Unknown=0, NotChecked=0, Total=9900 [2022-04-28 02:57:03,872 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand has 51 states, 51 states have (on average 2.0) internal successors, (102), 50 states have internal predecessors, (102), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:05,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:05,630 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2022-04-28 02:57:05,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-04-28 02:57:05,630 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 2.0) internal successors, (102), 50 states have internal predecessors, (102), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 106 [2022-04-28 02:57:05,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:57:05,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 2.0) internal successors, (102), 50 states have internal predecessors, (102), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:05,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 116 transitions. [2022-04-28 02:57:05,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 2.0) internal successors, (102), 50 states have internal predecessors, (102), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:05,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 116 transitions. [2022-04-28 02:57:05,632 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 116 transitions. [2022-04-28 02:57:05,717 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:05,718 INFO L225 Difference]: With dead ends: 116 [2022-04-28 02:57:05,718 INFO L226 Difference]: Without dead ends: 110 [2022-04-28 02:57:05,719 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1409 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=9606, Invalid=12150, Unknown=0, NotChecked=0, Total=21756 [2022-04-28 02:57:05,720 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 104 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:57:05,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 44 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:57:05,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-04-28 02:57:06,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2022-04-28 02:57:06,254 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:57:06,255 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand has 109 states, 104 states have (on average 1.0096153846153846) internal successors, (105), 104 states have internal predecessors, (105), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:06,255 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand has 109 states, 104 states have (on average 1.0096153846153846) internal successors, (105), 104 states have internal predecessors, (105), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:06,255 INFO L87 Difference]: Start difference. First operand 110 states. Second operand has 109 states, 104 states have (on average 1.0096153846153846) internal successors, (105), 104 states have internal predecessors, (105), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:06,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:06,256 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2022-04-28 02:57:06,256 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2022-04-28 02:57:06,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:06,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:06,256 INFO L74 IsIncluded]: Start isIncluded. First operand has 109 states, 104 states have (on average 1.0096153846153846) internal successors, (105), 104 states have internal predecessors, (105), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 110 states. [2022-04-28 02:57:06,256 INFO L87 Difference]: Start difference. First operand has 109 states, 104 states have (on average 1.0096153846153846) internal successors, (105), 104 states have internal predecessors, (105), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 110 states. [2022-04-28 02:57:06,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:06,260 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2022-04-28 02:57:06,260 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2022-04-28 02:57:06,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:06,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:06,260 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:57:06,260 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:57:06,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 104 states have (on average 1.0096153846153846) internal successors, (105), 104 states have internal predecessors, (105), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:06,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2022-04-28 02:57:06,262 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 106 [2022-04-28 02:57:06,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:57:06,262 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2022-04-28 02:57:06,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 2.0) internal successors, (102), 50 states have internal predecessors, (102), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:06,262 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 109 states and 109 transitions. [2022-04-28 02:57:06,394 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:06,394 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2022-04-28 02:57:06,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-04-28 02:57:06,395 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:57:06,395 INFO L195 NwaCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:57:06,411 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Ended with exit code 0 [2022-04-28 02:57:06,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-04-28 02:57:06,595 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:57:06,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:57:06,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1380897830, now seen corresponding path program 95 times [2022-04-28 02:57:06,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:06,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [363121383] [2022-04-28 02:57:06,597 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:57:06,597 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:57:06,597 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:57:06,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1380897830, now seen corresponding path program 96 times [2022-04-28 02:57:06,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:57:06,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448755000] [2022-04-28 02:57:06,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:57:06,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:57:06,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:07,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:57:07,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:07,550 INFO L290 TraceCheckUtils]: 0: Hoare triple {40643#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {40589#true} is VALID [2022-04-28 02:57:07,550 INFO L290 TraceCheckUtils]: 1: Hoare triple {40589#true} assume true; {40589#true} is VALID [2022-04-28 02:57:07,550 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40589#true} {40589#true} #39#return; {40589#true} is VALID [2022-04-28 02:57:07,551 INFO L272 TraceCheckUtils]: 0: Hoare triple {40589#true} call ULTIMATE.init(); {40643#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:57:07,551 INFO L290 TraceCheckUtils]: 1: Hoare triple {40643#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {40589#true} is VALID [2022-04-28 02:57:07,551 INFO L290 TraceCheckUtils]: 2: Hoare triple {40589#true} assume true; {40589#true} is VALID [2022-04-28 02:57:07,551 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40589#true} {40589#true} #39#return; {40589#true} is VALID [2022-04-28 02:57:07,551 INFO L272 TraceCheckUtils]: 4: Hoare triple {40589#true} call #t~ret6 := main(); {40589#true} is VALID [2022-04-28 02:57:07,551 INFO L290 TraceCheckUtils]: 5: Hoare triple {40589#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {40594#(= main_~i~0 0)} is VALID [2022-04-28 02:57:07,551 INFO L290 TraceCheckUtils]: 6: Hoare triple {40594#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40594#(= main_~i~0 0)} is VALID [2022-04-28 02:57:07,552 INFO L290 TraceCheckUtils]: 7: Hoare triple {40594#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40595#(<= main_~i~0 1)} is VALID [2022-04-28 02:57:07,552 INFO L290 TraceCheckUtils]: 8: Hoare triple {40595#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40595#(<= main_~i~0 1)} is VALID [2022-04-28 02:57:07,552 INFO L290 TraceCheckUtils]: 9: Hoare triple {40595#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40596#(<= main_~i~0 2)} is VALID [2022-04-28 02:57:07,553 INFO L290 TraceCheckUtils]: 10: Hoare triple {40596#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40596#(<= main_~i~0 2)} is VALID [2022-04-28 02:57:07,553 INFO L290 TraceCheckUtils]: 11: Hoare triple {40596#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40597#(<= main_~i~0 3)} is VALID [2022-04-28 02:57:07,553 INFO L290 TraceCheckUtils]: 12: Hoare triple {40597#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40597#(<= main_~i~0 3)} is VALID [2022-04-28 02:57:07,553 INFO L290 TraceCheckUtils]: 13: Hoare triple {40597#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40598#(<= main_~i~0 4)} is VALID [2022-04-28 02:57:07,554 INFO L290 TraceCheckUtils]: 14: Hoare triple {40598#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40598#(<= main_~i~0 4)} is VALID [2022-04-28 02:57:07,554 INFO L290 TraceCheckUtils]: 15: Hoare triple {40598#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40599#(<= main_~i~0 5)} is VALID [2022-04-28 02:57:07,554 INFO L290 TraceCheckUtils]: 16: Hoare triple {40599#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40599#(<= main_~i~0 5)} is VALID [2022-04-28 02:57:07,555 INFO L290 TraceCheckUtils]: 17: Hoare triple {40599#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40600#(<= main_~i~0 6)} is VALID [2022-04-28 02:57:07,555 INFO L290 TraceCheckUtils]: 18: Hoare triple {40600#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40600#(<= main_~i~0 6)} is VALID [2022-04-28 02:57:07,555 INFO L290 TraceCheckUtils]: 19: Hoare triple {40600#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40601#(<= main_~i~0 7)} is VALID [2022-04-28 02:57:07,556 INFO L290 TraceCheckUtils]: 20: Hoare triple {40601#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40601#(<= main_~i~0 7)} is VALID [2022-04-28 02:57:07,556 INFO L290 TraceCheckUtils]: 21: Hoare triple {40601#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40602#(<= main_~i~0 8)} is VALID [2022-04-28 02:57:07,556 INFO L290 TraceCheckUtils]: 22: Hoare triple {40602#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40602#(<= main_~i~0 8)} is VALID [2022-04-28 02:57:07,557 INFO L290 TraceCheckUtils]: 23: Hoare triple {40602#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40603#(<= main_~i~0 9)} is VALID [2022-04-28 02:57:07,557 INFO L290 TraceCheckUtils]: 24: Hoare triple {40603#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40603#(<= main_~i~0 9)} is VALID [2022-04-28 02:57:07,557 INFO L290 TraceCheckUtils]: 25: Hoare triple {40603#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40604#(<= main_~i~0 10)} is VALID [2022-04-28 02:57:07,557 INFO L290 TraceCheckUtils]: 26: Hoare triple {40604#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40604#(<= main_~i~0 10)} is VALID [2022-04-28 02:57:07,558 INFO L290 TraceCheckUtils]: 27: Hoare triple {40604#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40605#(<= main_~i~0 11)} is VALID [2022-04-28 02:57:07,558 INFO L290 TraceCheckUtils]: 28: Hoare triple {40605#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40605#(<= main_~i~0 11)} is VALID [2022-04-28 02:57:07,558 INFO L290 TraceCheckUtils]: 29: Hoare triple {40605#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40606#(<= main_~i~0 12)} is VALID [2022-04-28 02:57:07,559 INFO L290 TraceCheckUtils]: 30: Hoare triple {40606#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40606#(<= main_~i~0 12)} is VALID [2022-04-28 02:57:07,559 INFO L290 TraceCheckUtils]: 31: Hoare triple {40606#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40607#(<= main_~i~0 13)} is VALID [2022-04-28 02:57:07,559 INFO L290 TraceCheckUtils]: 32: Hoare triple {40607#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40607#(<= main_~i~0 13)} is VALID [2022-04-28 02:57:07,560 INFO L290 TraceCheckUtils]: 33: Hoare triple {40607#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40608#(<= main_~i~0 14)} is VALID [2022-04-28 02:57:07,560 INFO L290 TraceCheckUtils]: 34: Hoare triple {40608#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40608#(<= main_~i~0 14)} is VALID [2022-04-28 02:57:07,560 INFO L290 TraceCheckUtils]: 35: Hoare triple {40608#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40609#(<= main_~i~0 15)} is VALID [2022-04-28 02:57:07,561 INFO L290 TraceCheckUtils]: 36: Hoare triple {40609#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40609#(<= main_~i~0 15)} is VALID [2022-04-28 02:57:07,561 INFO L290 TraceCheckUtils]: 37: Hoare triple {40609#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40610#(<= main_~i~0 16)} is VALID [2022-04-28 02:57:07,561 INFO L290 TraceCheckUtils]: 38: Hoare triple {40610#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40610#(<= main_~i~0 16)} is VALID [2022-04-28 02:57:07,561 INFO L290 TraceCheckUtils]: 39: Hoare triple {40610#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40611#(<= main_~i~0 17)} is VALID [2022-04-28 02:57:07,562 INFO L290 TraceCheckUtils]: 40: Hoare triple {40611#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40611#(<= main_~i~0 17)} is VALID [2022-04-28 02:57:07,562 INFO L290 TraceCheckUtils]: 41: Hoare triple {40611#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40612#(<= main_~i~0 18)} is VALID [2022-04-28 02:57:07,562 INFO L290 TraceCheckUtils]: 42: Hoare triple {40612#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40612#(<= main_~i~0 18)} is VALID [2022-04-28 02:57:07,563 INFO L290 TraceCheckUtils]: 43: Hoare triple {40612#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40613#(<= main_~i~0 19)} is VALID [2022-04-28 02:57:07,563 INFO L290 TraceCheckUtils]: 44: Hoare triple {40613#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40613#(<= main_~i~0 19)} is VALID [2022-04-28 02:57:07,563 INFO L290 TraceCheckUtils]: 45: Hoare triple {40613#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40614#(<= main_~i~0 20)} is VALID [2022-04-28 02:57:07,564 INFO L290 TraceCheckUtils]: 46: Hoare triple {40614#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40614#(<= main_~i~0 20)} is VALID [2022-04-28 02:57:07,564 INFO L290 TraceCheckUtils]: 47: Hoare triple {40614#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40615#(<= main_~i~0 21)} is VALID [2022-04-28 02:57:07,564 INFO L290 TraceCheckUtils]: 48: Hoare triple {40615#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40615#(<= main_~i~0 21)} is VALID [2022-04-28 02:57:07,565 INFO L290 TraceCheckUtils]: 49: Hoare triple {40615#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40616#(<= main_~i~0 22)} is VALID [2022-04-28 02:57:07,565 INFO L290 TraceCheckUtils]: 50: Hoare triple {40616#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40616#(<= main_~i~0 22)} is VALID [2022-04-28 02:57:07,565 INFO L290 TraceCheckUtils]: 51: Hoare triple {40616#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40617#(<= main_~i~0 23)} is VALID [2022-04-28 02:57:07,565 INFO L290 TraceCheckUtils]: 52: Hoare triple {40617#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40617#(<= main_~i~0 23)} is VALID [2022-04-28 02:57:07,566 INFO L290 TraceCheckUtils]: 53: Hoare triple {40617#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40618#(<= main_~i~0 24)} is VALID [2022-04-28 02:57:07,566 INFO L290 TraceCheckUtils]: 54: Hoare triple {40618#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40618#(<= main_~i~0 24)} is VALID [2022-04-28 02:57:07,566 INFO L290 TraceCheckUtils]: 55: Hoare triple {40618#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40619#(<= main_~i~0 25)} is VALID [2022-04-28 02:57:07,567 INFO L290 TraceCheckUtils]: 56: Hoare triple {40619#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40619#(<= main_~i~0 25)} is VALID [2022-04-28 02:57:07,567 INFO L290 TraceCheckUtils]: 57: Hoare triple {40619#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40620#(<= main_~i~0 26)} is VALID [2022-04-28 02:57:07,567 INFO L290 TraceCheckUtils]: 58: Hoare triple {40620#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40620#(<= main_~i~0 26)} is VALID [2022-04-28 02:57:07,568 INFO L290 TraceCheckUtils]: 59: Hoare triple {40620#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40621#(<= main_~i~0 27)} is VALID [2022-04-28 02:57:07,568 INFO L290 TraceCheckUtils]: 60: Hoare triple {40621#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40621#(<= main_~i~0 27)} is VALID [2022-04-28 02:57:07,568 INFO L290 TraceCheckUtils]: 61: Hoare triple {40621#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40622#(<= main_~i~0 28)} is VALID [2022-04-28 02:57:07,569 INFO L290 TraceCheckUtils]: 62: Hoare triple {40622#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40622#(<= main_~i~0 28)} is VALID [2022-04-28 02:57:07,569 INFO L290 TraceCheckUtils]: 63: Hoare triple {40622#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40623#(<= main_~i~0 29)} is VALID [2022-04-28 02:57:07,569 INFO L290 TraceCheckUtils]: 64: Hoare triple {40623#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40623#(<= main_~i~0 29)} is VALID [2022-04-28 02:57:07,569 INFO L290 TraceCheckUtils]: 65: Hoare triple {40623#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40624#(<= main_~i~0 30)} is VALID [2022-04-28 02:57:07,570 INFO L290 TraceCheckUtils]: 66: Hoare triple {40624#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40624#(<= main_~i~0 30)} is VALID [2022-04-28 02:57:07,570 INFO L290 TraceCheckUtils]: 67: Hoare triple {40624#(<= main_~i~0 30)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40625#(<= main_~i~0 31)} is VALID [2022-04-28 02:57:07,570 INFO L290 TraceCheckUtils]: 68: Hoare triple {40625#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40625#(<= main_~i~0 31)} is VALID [2022-04-28 02:57:07,571 INFO L290 TraceCheckUtils]: 69: Hoare triple {40625#(<= main_~i~0 31)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40626#(<= main_~i~0 32)} is VALID [2022-04-28 02:57:07,571 INFO L290 TraceCheckUtils]: 70: Hoare triple {40626#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40626#(<= main_~i~0 32)} is VALID [2022-04-28 02:57:07,571 INFO L290 TraceCheckUtils]: 71: Hoare triple {40626#(<= main_~i~0 32)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40627#(<= main_~i~0 33)} is VALID [2022-04-28 02:57:07,572 INFO L290 TraceCheckUtils]: 72: Hoare triple {40627#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40627#(<= main_~i~0 33)} is VALID [2022-04-28 02:57:07,572 INFO L290 TraceCheckUtils]: 73: Hoare triple {40627#(<= main_~i~0 33)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40628#(<= main_~i~0 34)} is VALID [2022-04-28 02:57:07,572 INFO L290 TraceCheckUtils]: 74: Hoare triple {40628#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40628#(<= main_~i~0 34)} is VALID [2022-04-28 02:57:07,573 INFO L290 TraceCheckUtils]: 75: Hoare triple {40628#(<= main_~i~0 34)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40629#(<= main_~i~0 35)} is VALID [2022-04-28 02:57:07,573 INFO L290 TraceCheckUtils]: 76: Hoare triple {40629#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40629#(<= main_~i~0 35)} is VALID [2022-04-28 02:57:07,573 INFO L290 TraceCheckUtils]: 77: Hoare triple {40629#(<= main_~i~0 35)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40630#(<= main_~i~0 36)} is VALID [2022-04-28 02:57:07,573 INFO L290 TraceCheckUtils]: 78: Hoare triple {40630#(<= main_~i~0 36)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40630#(<= main_~i~0 36)} is VALID [2022-04-28 02:57:07,574 INFO L290 TraceCheckUtils]: 79: Hoare triple {40630#(<= main_~i~0 36)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40631#(<= main_~i~0 37)} is VALID [2022-04-28 02:57:07,574 INFO L290 TraceCheckUtils]: 80: Hoare triple {40631#(<= main_~i~0 37)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40631#(<= main_~i~0 37)} is VALID [2022-04-28 02:57:07,574 INFO L290 TraceCheckUtils]: 81: Hoare triple {40631#(<= main_~i~0 37)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40632#(<= main_~i~0 38)} is VALID [2022-04-28 02:57:07,575 INFO L290 TraceCheckUtils]: 82: Hoare triple {40632#(<= main_~i~0 38)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40632#(<= main_~i~0 38)} is VALID [2022-04-28 02:57:07,575 INFO L290 TraceCheckUtils]: 83: Hoare triple {40632#(<= main_~i~0 38)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40633#(<= main_~i~0 39)} is VALID [2022-04-28 02:57:07,575 INFO L290 TraceCheckUtils]: 84: Hoare triple {40633#(<= main_~i~0 39)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40633#(<= main_~i~0 39)} is VALID [2022-04-28 02:57:07,576 INFO L290 TraceCheckUtils]: 85: Hoare triple {40633#(<= main_~i~0 39)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40634#(<= main_~i~0 40)} is VALID [2022-04-28 02:57:07,576 INFO L290 TraceCheckUtils]: 86: Hoare triple {40634#(<= main_~i~0 40)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40634#(<= main_~i~0 40)} is VALID [2022-04-28 02:57:07,576 INFO L290 TraceCheckUtils]: 87: Hoare triple {40634#(<= main_~i~0 40)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40635#(<= main_~i~0 41)} is VALID [2022-04-28 02:57:07,576 INFO L290 TraceCheckUtils]: 88: Hoare triple {40635#(<= main_~i~0 41)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40635#(<= main_~i~0 41)} is VALID [2022-04-28 02:57:07,577 INFO L290 TraceCheckUtils]: 89: Hoare triple {40635#(<= main_~i~0 41)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40636#(<= main_~i~0 42)} is VALID [2022-04-28 02:57:07,577 INFO L290 TraceCheckUtils]: 90: Hoare triple {40636#(<= main_~i~0 42)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40636#(<= main_~i~0 42)} is VALID [2022-04-28 02:57:07,577 INFO L290 TraceCheckUtils]: 91: Hoare triple {40636#(<= main_~i~0 42)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40637#(<= main_~i~0 43)} is VALID [2022-04-28 02:57:07,578 INFO L290 TraceCheckUtils]: 92: Hoare triple {40637#(<= main_~i~0 43)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40637#(<= main_~i~0 43)} is VALID [2022-04-28 02:57:07,578 INFO L290 TraceCheckUtils]: 93: Hoare triple {40637#(<= main_~i~0 43)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40638#(<= main_~i~0 44)} is VALID [2022-04-28 02:57:07,578 INFO L290 TraceCheckUtils]: 94: Hoare triple {40638#(<= main_~i~0 44)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40638#(<= main_~i~0 44)} is VALID [2022-04-28 02:57:07,579 INFO L290 TraceCheckUtils]: 95: Hoare triple {40638#(<= main_~i~0 44)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40639#(<= main_~i~0 45)} is VALID [2022-04-28 02:57:07,579 INFO L290 TraceCheckUtils]: 96: Hoare triple {40639#(<= main_~i~0 45)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40639#(<= main_~i~0 45)} is VALID [2022-04-28 02:57:07,579 INFO L290 TraceCheckUtils]: 97: Hoare triple {40639#(<= main_~i~0 45)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40640#(<= main_~i~0 46)} is VALID [2022-04-28 02:57:07,579 INFO L290 TraceCheckUtils]: 98: Hoare triple {40640#(<= main_~i~0 46)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40640#(<= main_~i~0 46)} is VALID [2022-04-28 02:57:07,580 INFO L290 TraceCheckUtils]: 99: Hoare triple {40640#(<= main_~i~0 46)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40641#(<= main_~i~0 47)} is VALID [2022-04-28 02:57:07,580 INFO L290 TraceCheckUtils]: 100: Hoare triple {40641#(<= main_~i~0 47)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40641#(<= main_~i~0 47)} is VALID [2022-04-28 02:57:07,580 INFO L290 TraceCheckUtils]: 101: Hoare triple {40641#(<= main_~i~0 47)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40642#(<= main_~i~0 48)} is VALID [2022-04-28 02:57:07,581 INFO L290 TraceCheckUtils]: 102: Hoare triple {40642#(<= main_~i~0 48)} assume !(~i~0 < 1024); {40590#false} is VALID [2022-04-28 02:57:07,581 INFO L290 TraceCheckUtils]: 103: Hoare triple {40590#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {40590#false} is VALID [2022-04-28 02:57:07,581 INFO L272 TraceCheckUtils]: 104: Hoare triple {40590#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {40590#false} is VALID [2022-04-28 02:57:07,581 INFO L290 TraceCheckUtils]: 105: Hoare triple {40590#false} ~cond := #in~cond; {40590#false} is VALID [2022-04-28 02:57:07,581 INFO L290 TraceCheckUtils]: 106: Hoare triple {40590#false} assume 0 == ~cond; {40590#false} is VALID [2022-04-28 02:57:07,581 INFO L290 TraceCheckUtils]: 107: Hoare triple {40590#false} assume !false; {40590#false} is VALID [2022-04-28 02:57:07,581 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:57:07,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:57:07,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448755000] [2022-04-28 02:57:07,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448755000] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:57:07,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900298085] [2022-04-28 02:57:07,582 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 02:57:07,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:57:07,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:57:07,583 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:57:07,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-04-28 02:59:04,619 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2022-04-28 02:59:04,620 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:59:04,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 50 conjunts are in the unsatisfiable core [2022-04-28 02:59:04,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:59:04,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:59:05,357 INFO L272 TraceCheckUtils]: 0: Hoare triple {40589#true} call ULTIMATE.init(); {40589#true} is VALID [2022-04-28 02:59:05,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {40589#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {40589#true} is VALID [2022-04-28 02:59:05,357 INFO L290 TraceCheckUtils]: 2: Hoare triple {40589#true} assume true; {40589#true} is VALID [2022-04-28 02:59:05,357 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40589#true} {40589#true} #39#return; {40589#true} is VALID [2022-04-28 02:59:05,357 INFO L272 TraceCheckUtils]: 4: Hoare triple {40589#true} call #t~ret6 := main(); {40589#true} is VALID [2022-04-28 02:59:05,357 INFO L290 TraceCheckUtils]: 5: Hoare triple {40589#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {40662#(<= main_~i~0 0)} is VALID [2022-04-28 02:59:05,358 INFO L290 TraceCheckUtils]: 6: Hoare triple {40662#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40662#(<= main_~i~0 0)} is VALID [2022-04-28 02:59:05,358 INFO L290 TraceCheckUtils]: 7: Hoare triple {40662#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40595#(<= main_~i~0 1)} is VALID [2022-04-28 02:59:05,358 INFO L290 TraceCheckUtils]: 8: Hoare triple {40595#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40595#(<= main_~i~0 1)} is VALID [2022-04-28 02:59:05,359 INFO L290 TraceCheckUtils]: 9: Hoare triple {40595#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40596#(<= main_~i~0 2)} is VALID [2022-04-28 02:59:05,359 INFO L290 TraceCheckUtils]: 10: Hoare triple {40596#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40596#(<= main_~i~0 2)} is VALID [2022-04-28 02:59:05,359 INFO L290 TraceCheckUtils]: 11: Hoare triple {40596#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40597#(<= main_~i~0 3)} is VALID [2022-04-28 02:59:05,360 INFO L290 TraceCheckUtils]: 12: Hoare triple {40597#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40597#(<= main_~i~0 3)} is VALID [2022-04-28 02:59:05,360 INFO L290 TraceCheckUtils]: 13: Hoare triple {40597#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40598#(<= main_~i~0 4)} is VALID [2022-04-28 02:59:05,360 INFO L290 TraceCheckUtils]: 14: Hoare triple {40598#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40598#(<= main_~i~0 4)} is VALID [2022-04-28 02:59:05,360 INFO L290 TraceCheckUtils]: 15: Hoare triple {40598#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40599#(<= main_~i~0 5)} is VALID [2022-04-28 02:59:05,361 INFO L290 TraceCheckUtils]: 16: Hoare triple {40599#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40599#(<= main_~i~0 5)} is VALID [2022-04-28 02:59:05,361 INFO L290 TraceCheckUtils]: 17: Hoare triple {40599#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40600#(<= main_~i~0 6)} is VALID [2022-04-28 02:59:05,361 INFO L290 TraceCheckUtils]: 18: Hoare triple {40600#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40600#(<= main_~i~0 6)} is VALID [2022-04-28 02:59:05,362 INFO L290 TraceCheckUtils]: 19: Hoare triple {40600#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40601#(<= main_~i~0 7)} is VALID [2022-04-28 02:59:05,362 INFO L290 TraceCheckUtils]: 20: Hoare triple {40601#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40601#(<= main_~i~0 7)} is VALID [2022-04-28 02:59:05,362 INFO L290 TraceCheckUtils]: 21: Hoare triple {40601#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40602#(<= main_~i~0 8)} is VALID [2022-04-28 02:59:05,363 INFO L290 TraceCheckUtils]: 22: Hoare triple {40602#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40602#(<= main_~i~0 8)} is VALID [2022-04-28 02:59:05,363 INFO L290 TraceCheckUtils]: 23: Hoare triple {40602#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40603#(<= main_~i~0 9)} is VALID [2022-04-28 02:59:05,363 INFO L290 TraceCheckUtils]: 24: Hoare triple {40603#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40603#(<= main_~i~0 9)} is VALID [2022-04-28 02:59:05,363 INFO L290 TraceCheckUtils]: 25: Hoare triple {40603#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40604#(<= main_~i~0 10)} is VALID [2022-04-28 02:59:05,364 INFO L290 TraceCheckUtils]: 26: Hoare triple {40604#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40604#(<= main_~i~0 10)} is VALID [2022-04-28 02:59:05,364 INFO L290 TraceCheckUtils]: 27: Hoare triple {40604#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40605#(<= main_~i~0 11)} is VALID [2022-04-28 02:59:05,364 INFO L290 TraceCheckUtils]: 28: Hoare triple {40605#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40605#(<= main_~i~0 11)} is VALID [2022-04-28 02:59:05,365 INFO L290 TraceCheckUtils]: 29: Hoare triple {40605#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40606#(<= main_~i~0 12)} is VALID [2022-04-28 02:59:05,365 INFO L290 TraceCheckUtils]: 30: Hoare triple {40606#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40606#(<= main_~i~0 12)} is VALID [2022-04-28 02:59:05,365 INFO L290 TraceCheckUtils]: 31: Hoare triple {40606#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40607#(<= main_~i~0 13)} is VALID [2022-04-28 02:59:05,366 INFO L290 TraceCheckUtils]: 32: Hoare triple {40607#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40607#(<= main_~i~0 13)} is VALID [2022-04-28 02:59:05,366 INFO L290 TraceCheckUtils]: 33: Hoare triple {40607#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40608#(<= main_~i~0 14)} is VALID [2022-04-28 02:59:05,366 INFO L290 TraceCheckUtils]: 34: Hoare triple {40608#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40608#(<= main_~i~0 14)} is VALID [2022-04-28 02:59:05,367 INFO L290 TraceCheckUtils]: 35: Hoare triple {40608#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40609#(<= main_~i~0 15)} is VALID [2022-04-28 02:59:05,367 INFO L290 TraceCheckUtils]: 36: Hoare triple {40609#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40609#(<= main_~i~0 15)} is VALID [2022-04-28 02:59:05,367 INFO L290 TraceCheckUtils]: 37: Hoare triple {40609#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40610#(<= main_~i~0 16)} is VALID [2022-04-28 02:59:05,367 INFO L290 TraceCheckUtils]: 38: Hoare triple {40610#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40610#(<= main_~i~0 16)} is VALID [2022-04-28 02:59:05,368 INFO L290 TraceCheckUtils]: 39: Hoare triple {40610#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40611#(<= main_~i~0 17)} is VALID [2022-04-28 02:59:05,368 INFO L290 TraceCheckUtils]: 40: Hoare triple {40611#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40611#(<= main_~i~0 17)} is VALID [2022-04-28 02:59:05,368 INFO L290 TraceCheckUtils]: 41: Hoare triple {40611#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40612#(<= main_~i~0 18)} is VALID [2022-04-28 02:59:05,369 INFO L290 TraceCheckUtils]: 42: Hoare triple {40612#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40612#(<= main_~i~0 18)} is VALID [2022-04-28 02:59:05,369 INFO L290 TraceCheckUtils]: 43: Hoare triple {40612#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40613#(<= main_~i~0 19)} is VALID [2022-04-28 02:59:05,369 INFO L290 TraceCheckUtils]: 44: Hoare triple {40613#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40613#(<= main_~i~0 19)} is VALID [2022-04-28 02:59:05,370 INFO L290 TraceCheckUtils]: 45: Hoare triple {40613#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40614#(<= main_~i~0 20)} is VALID [2022-04-28 02:59:05,370 INFO L290 TraceCheckUtils]: 46: Hoare triple {40614#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40614#(<= main_~i~0 20)} is VALID [2022-04-28 02:59:05,370 INFO L290 TraceCheckUtils]: 47: Hoare triple {40614#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40615#(<= main_~i~0 21)} is VALID [2022-04-28 02:59:05,370 INFO L290 TraceCheckUtils]: 48: Hoare triple {40615#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40615#(<= main_~i~0 21)} is VALID [2022-04-28 02:59:05,371 INFO L290 TraceCheckUtils]: 49: Hoare triple {40615#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40616#(<= main_~i~0 22)} is VALID [2022-04-28 02:59:05,371 INFO L290 TraceCheckUtils]: 50: Hoare triple {40616#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40616#(<= main_~i~0 22)} is VALID [2022-04-28 02:59:05,371 INFO L290 TraceCheckUtils]: 51: Hoare triple {40616#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40617#(<= main_~i~0 23)} is VALID [2022-04-28 02:59:05,372 INFO L290 TraceCheckUtils]: 52: Hoare triple {40617#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40617#(<= main_~i~0 23)} is VALID [2022-04-28 02:59:05,372 INFO L290 TraceCheckUtils]: 53: Hoare triple {40617#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40618#(<= main_~i~0 24)} is VALID [2022-04-28 02:59:05,372 INFO L290 TraceCheckUtils]: 54: Hoare triple {40618#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40618#(<= main_~i~0 24)} is VALID [2022-04-28 02:59:05,373 INFO L290 TraceCheckUtils]: 55: Hoare triple {40618#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40619#(<= main_~i~0 25)} is VALID [2022-04-28 02:59:05,373 INFO L290 TraceCheckUtils]: 56: Hoare triple {40619#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40619#(<= main_~i~0 25)} is VALID [2022-04-28 02:59:05,373 INFO L290 TraceCheckUtils]: 57: Hoare triple {40619#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40620#(<= main_~i~0 26)} is VALID [2022-04-28 02:59:05,374 INFO L290 TraceCheckUtils]: 58: Hoare triple {40620#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40620#(<= main_~i~0 26)} is VALID [2022-04-28 02:59:05,374 INFO L290 TraceCheckUtils]: 59: Hoare triple {40620#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40621#(<= main_~i~0 27)} is VALID [2022-04-28 02:59:05,375 INFO L290 TraceCheckUtils]: 60: Hoare triple {40621#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40621#(<= main_~i~0 27)} is VALID [2022-04-28 02:59:05,375 INFO L290 TraceCheckUtils]: 61: Hoare triple {40621#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40622#(<= main_~i~0 28)} is VALID [2022-04-28 02:59:05,375 INFO L290 TraceCheckUtils]: 62: Hoare triple {40622#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40622#(<= main_~i~0 28)} is VALID [2022-04-28 02:59:05,376 INFO L290 TraceCheckUtils]: 63: Hoare triple {40622#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40623#(<= main_~i~0 29)} is VALID [2022-04-28 02:59:05,376 INFO L290 TraceCheckUtils]: 64: Hoare triple {40623#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40623#(<= main_~i~0 29)} is VALID [2022-04-28 02:59:05,376 INFO L290 TraceCheckUtils]: 65: Hoare triple {40623#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40624#(<= main_~i~0 30)} is VALID [2022-04-28 02:59:05,377 INFO L290 TraceCheckUtils]: 66: Hoare triple {40624#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40624#(<= main_~i~0 30)} is VALID [2022-04-28 02:59:05,377 INFO L290 TraceCheckUtils]: 67: Hoare triple {40624#(<= main_~i~0 30)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40625#(<= main_~i~0 31)} is VALID [2022-04-28 02:59:05,377 INFO L290 TraceCheckUtils]: 68: Hoare triple {40625#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40625#(<= main_~i~0 31)} is VALID [2022-04-28 02:59:05,378 INFO L290 TraceCheckUtils]: 69: Hoare triple {40625#(<= main_~i~0 31)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40626#(<= main_~i~0 32)} is VALID [2022-04-28 02:59:05,378 INFO L290 TraceCheckUtils]: 70: Hoare triple {40626#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40626#(<= main_~i~0 32)} is VALID [2022-04-28 02:59:05,378 INFO L290 TraceCheckUtils]: 71: Hoare triple {40626#(<= main_~i~0 32)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40627#(<= main_~i~0 33)} is VALID [2022-04-28 02:59:05,378 INFO L290 TraceCheckUtils]: 72: Hoare triple {40627#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40627#(<= main_~i~0 33)} is VALID [2022-04-28 02:59:05,379 INFO L290 TraceCheckUtils]: 73: Hoare triple {40627#(<= main_~i~0 33)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40628#(<= main_~i~0 34)} is VALID [2022-04-28 02:59:05,379 INFO L290 TraceCheckUtils]: 74: Hoare triple {40628#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40628#(<= main_~i~0 34)} is VALID [2022-04-28 02:59:05,380 INFO L290 TraceCheckUtils]: 75: Hoare triple {40628#(<= main_~i~0 34)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40629#(<= main_~i~0 35)} is VALID [2022-04-28 02:59:05,380 INFO L290 TraceCheckUtils]: 76: Hoare triple {40629#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40629#(<= main_~i~0 35)} is VALID [2022-04-28 02:59:05,380 INFO L290 TraceCheckUtils]: 77: Hoare triple {40629#(<= main_~i~0 35)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40630#(<= main_~i~0 36)} is VALID [2022-04-28 02:59:05,380 INFO L290 TraceCheckUtils]: 78: Hoare triple {40630#(<= main_~i~0 36)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40630#(<= main_~i~0 36)} is VALID [2022-04-28 02:59:05,381 INFO L290 TraceCheckUtils]: 79: Hoare triple {40630#(<= main_~i~0 36)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40631#(<= main_~i~0 37)} is VALID [2022-04-28 02:59:05,381 INFO L290 TraceCheckUtils]: 80: Hoare triple {40631#(<= main_~i~0 37)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40631#(<= main_~i~0 37)} is VALID [2022-04-28 02:59:05,381 INFO L290 TraceCheckUtils]: 81: Hoare triple {40631#(<= main_~i~0 37)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40632#(<= main_~i~0 38)} is VALID [2022-04-28 02:59:05,382 INFO L290 TraceCheckUtils]: 82: Hoare triple {40632#(<= main_~i~0 38)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40632#(<= main_~i~0 38)} is VALID [2022-04-28 02:59:05,382 INFO L290 TraceCheckUtils]: 83: Hoare triple {40632#(<= main_~i~0 38)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40633#(<= main_~i~0 39)} is VALID [2022-04-28 02:59:05,382 INFO L290 TraceCheckUtils]: 84: Hoare triple {40633#(<= main_~i~0 39)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40633#(<= main_~i~0 39)} is VALID [2022-04-28 02:59:05,383 INFO L290 TraceCheckUtils]: 85: Hoare triple {40633#(<= main_~i~0 39)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40634#(<= main_~i~0 40)} is VALID [2022-04-28 02:59:05,383 INFO L290 TraceCheckUtils]: 86: Hoare triple {40634#(<= main_~i~0 40)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40634#(<= main_~i~0 40)} is VALID [2022-04-28 02:59:05,383 INFO L290 TraceCheckUtils]: 87: Hoare triple {40634#(<= main_~i~0 40)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40635#(<= main_~i~0 41)} is VALID [2022-04-28 02:59:05,384 INFO L290 TraceCheckUtils]: 88: Hoare triple {40635#(<= main_~i~0 41)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40635#(<= main_~i~0 41)} is VALID [2022-04-28 02:59:05,384 INFO L290 TraceCheckUtils]: 89: Hoare triple {40635#(<= main_~i~0 41)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40636#(<= main_~i~0 42)} is VALID [2022-04-28 02:59:05,384 INFO L290 TraceCheckUtils]: 90: Hoare triple {40636#(<= main_~i~0 42)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40636#(<= main_~i~0 42)} is VALID [2022-04-28 02:59:05,385 INFO L290 TraceCheckUtils]: 91: Hoare triple {40636#(<= main_~i~0 42)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40637#(<= main_~i~0 43)} is VALID [2022-04-28 02:59:05,385 INFO L290 TraceCheckUtils]: 92: Hoare triple {40637#(<= main_~i~0 43)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40637#(<= main_~i~0 43)} is VALID [2022-04-28 02:59:05,385 INFO L290 TraceCheckUtils]: 93: Hoare triple {40637#(<= main_~i~0 43)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40638#(<= main_~i~0 44)} is VALID [2022-04-28 02:59:05,385 INFO L290 TraceCheckUtils]: 94: Hoare triple {40638#(<= main_~i~0 44)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40638#(<= main_~i~0 44)} is VALID [2022-04-28 02:59:05,386 INFO L290 TraceCheckUtils]: 95: Hoare triple {40638#(<= main_~i~0 44)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40639#(<= main_~i~0 45)} is VALID [2022-04-28 02:59:05,386 INFO L290 TraceCheckUtils]: 96: Hoare triple {40639#(<= main_~i~0 45)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40639#(<= main_~i~0 45)} is VALID [2022-04-28 02:59:05,386 INFO L290 TraceCheckUtils]: 97: Hoare triple {40639#(<= main_~i~0 45)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40640#(<= main_~i~0 46)} is VALID [2022-04-28 02:59:05,387 INFO L290 TraceCheckUtils]: 98: Hoare triple {40640#(<= main_~i~0 46)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40640#(<= main_~i~0 46)} is VALID [2022-04-28 02:59:05,387 INFO L290 TraceCheckUtils]: 99: Hoare triple {40640#(<= main_~i~0 46)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40641#(<= main_~i~0 47)} is VALID [2022-04-28 02:59:05,387 INFO L290 TraceCheckUtils]: 100: Hoare triple {40641#(<= main_~i~0 47)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40641#(<= main_~i~0 47)} is VALID [2022-04-28 02:59:05,388 INFO L290 TraceCheckUtils]: 101: Hoare triple {40641#(<= main_~i~0 47)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40642#(<= main_~i~0 48)} is VALID [2022-04-28 02:59:05,388 INFO L290 TraceCheckUtils]: 102: Hoare triple {40642#(<= main_~i~0 48)} assume !(~i~0 < 1024); {40590#false} is VALID [2022-04-28 02:59:05,388 INFO L290 TraceCheckUtils]: 103: Hoare triple {40590#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {40590#false} is VALID [2022-04-28 02:59:05,388 INFO L272 TraceCheckUtils]: 104: Hoare triple {40590#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {40590#false} is VALID [2022-04-28 02:59:05,388 INFO L290 TraceCheckUtils]: 105: Hoare triple {40590#false} ~cond := #in~cond; {40590#false} is VALID [2022-04-28 02:59:05,388 INFO L290 TraceCheckUtils]: 106: Hoare triple {40590#false} assume 0 == ~cond; {40590#false} is VALID [2022-04-28 02:59:05,388 INFO L290 TraceCheckUtils]: 107: Hoare triple {40590#false} assume !false; {40590#false} is VALID [2022-04-28 02:59:05,388 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:59:05,389 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:59:08,214 INFO L290 TraceCheckUtils]: 107: Hoare triple {40590#false} assume !false; {40590#false} is VALID [2022-04-28 02:59:08,214 INFO L290 TraceCheckUtils]: 106: Hoare triple {40590#false} assume 0 == ~cond; {40590#false} is VALID [2022-04-28 02:59:08,214 INFO L290 TraceCheckUtils]: 105: Hoare triple {40590#false} ~cond := #in~cond; {40590#false} is VALID [2022-04-28 02:59:08,214 INFO L272 TraceCheckUtils]: 104: Hoare triple {40590#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {40590#false} is VALID [2022-04-28 02:59:08,214 INFO L290 TraceCheckUtils]: 103: Hoare triple {40590#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {40590#false} is VALID [2022-04-28 02:59:08,214 INFO L290 TraceCheckUtils]: 102: Hoare triple {40984#(< main_~i~0 1024)} assume !(~i~0 < 1024); {40590#false} is VALID [2022-04-28 02:59:08,215 INFO L290 TraceCheckUtils]: 101: Hoare triple {40988#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40984#(< main_~i~0 1024)} is VALID [2022-04-28 02:59:08,215 INFO L290 TraceCheckUtils]: 100: Hoare triple {40988#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40988#(< main_~i~0 1023)} is VALID [2022-04-28 02:59:08,215 INFO L290 TraceCheckUtils]: 99: Hoare triple {40995#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40988#(< main_~i~0 1023)} is VALID [2022-04-28 02:59:08,215 INFO L290 TraceCheckUtils]: 98: Hoare triple {40995#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40995#(< main_~i~0 1022)} is VALID [2022-04-28 02:59:08,216 INFO L290 TraceCheckUtils]: 97: Hoare triple {41002#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40995#(< main_~i~0 1022)} is VALID [2022-04-28 02:59:08,216 INFO L290 TraceCheckUtils]: 96: Hoare triple {41002#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41002#(< main_~i~0 1021)} is VALID [2022-04-28 02:59:08,216 INFO L290 TraceCheckUtils]: 95: Hoare triple {41009#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41002#(< main_~i~0 1021)} is VALID [2022-04-28 02:59:08,217 INFO L290 TraceCheckUtils]: 94: Hoare triple {41009#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41009#(< main_~i~0 1020)} is VALID [2022-04-28 02:59:08,217 INFO L290 TraceCheckUtils]: 93: Hoare triple {41016#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41009#(< main_~i~0 1020)} is VALID [2022-04-28 02:59:08,217 INFO L290 TraceCheckUtils]: 92: Hoare triple {41016#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41016#(< main_~i~0 1019)} is VALID [2022-04-28 02:59:08,218 INFO L290 TraceCheckUtils]: 91: Hoare triple {41023#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41016#(< main_~i~0 1019)} is VALID [2022-04-28 02:59:08,218 INFO L290 TraceCheckUtils]: 90: Hoare triple {41023#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41023#(< main_~i~0 1018)} is VALID [2022-04-28 02:59:08,218 INFO L290 TraceCheckUtils]: 89: Hoare triple {41030#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41023#(< main_~i~0 1018)} is VALID [2022-04-28 02:59:08,219 INFO L290 TraceCheckUtils]: 88: Hoare triple {41030#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41030#(< main_~i~0 1017)} is VALID [2022-04-28 02:59:08,219 INFO L290 TraceCheckUtils]: 87: Hoare triple {41037#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41030#(< main_~i~0 1017)} is VALID [2022-04-28 02:59:08,219 INFO L290 TraceCheckUtils]: 86: Hoare triple {41037#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41037#(< main_~i~0 1016)} is VALID [2022-04-28 02:59:08,220 INFO L290 TraceCheckUtils]: 85: Hoare triple {41044#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41037#(< main_~i~0 1016)} is VALID [2022-04-28 02:59:08,220 INFO L290 TraceCheckUtils]: 84: Hoare triple {41044#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41044#(< main_~i~0 1015)} is VALID [2022-04-28 02:59:08,220 INFO L290 TraceCheckUtils]: 83: Hoare triple {41051#(< main_~i~0 1014)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41044#(< main_~i~0 1015)} is VALID [2022-04-28 02:59:08,220 INFO L290 TraceCheckUtils]: 82: Hoare triple {41051#(< main_~i~0 1014)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41051#(< main_~i~0 1014)} is VALID [2022-04-28 02:59:08,221 INFO L290 TraceCheckUtils]: 81: Hoare triple {41058#(< main_~i~0 1013)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41051#(< main_~i~0 1014)} is VALID [2022-04-28 02:59:08,221 INFO L290 TraceCheckUtils]: 80: Hoare triple {41058#(< main_~i~0 1013)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41058#(< main_~i~0 1013)} is VALID [2022-04-28 02:59:08,221 INFO L290 TraceCheckUtils]: 79: Hoare triple {41065#(< main_~i~0 1012)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41058#(< main_~i~0 1013)} is VALID [2022-04-28 02:59:08,222 INFO L290 TraceCheckUtils]: 78: Hoare triple {41065#(< main_~i~0 1012)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41065#(< main_~i~0 1012)} is VALID [2022-04-28 02:59:08,222 INFO L290 TraceCheckUtils]: 77: Hoare triple {41072#(< main_~i~0 1011)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41065#(< main_~i~0 1012)} is VALID [2022-04-28 02:59:08,222 INFO L290 TraceCheckUtils]: 76: Hoare triple {41072#(< main_~i~0 1011)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41072#(< main_~i~0 1011)} is VALID [2022-04-28 02:59:08,223 INFO L290 TraceCheckUtils]: 75: Hoare triple {41079#(< main_~i~0 1010)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41072#(< main_~i~0 1011)} is VALID [2022-04-28 02:59:08,223 INFO L290 TraceCheckUtils]: 74: Hoare triple {41079#(< main_~i~0 1010)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41079#(< main_~i~0 1010)} is VALID [2022-04-28 02:59:08,223 INFO L290 TraceCheckUtils]: 73: Hoare triple {41086#(< main_~i~0 1009)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41079#(< main_~i~0 1010)} is VALID [2022-04-28 02:59:08,224 INFO L290 TraceCheckUtils]: 72: Hoare triple {41086#(< main_~i~0 1009)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41086#(< main_~i~0 1009)} is VALID [2022-04-28 02:59:08,224 INFO L290 TraceCheckUtils]: 71: Hoare triple {41093#(< main_~i~0 1008)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41086#(< main_~i~0 1009)} is VALID [2022-04-28 02:59:08,224 INFO L290 TraceCheckUtils]: 70: Hoare triple {41093#(< main_~i~0 1008)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41093#(< main_~i~0 1008)} is VALID [2022-04-28 02:59:08,225 INFO L290 TraceCheckUtils]: 69: Hoare triple {41100#(< main_~i~0 1007)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41093#(< main_~i~0 1008)} is VALID [2022-04-28 02:59:08,225 INFO L290 TraceCheckUtils]: 68: Hoare triple {41100#(< main_~i~0 1007)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41100#(< main_~i~0 1007)} is VALID [2022-04-28 02:59:08,225 INFO L290 TraceCheckUtils]: 67: Hoare triple {41107#(< main_~i~0 1006)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41100#(< main_~i~0 1007)} is VALID [2022-04-28 02:59:08,225 INFO L290 TraceCheckUtils]: 66: Hoare triple {41107#(< main_~i~0 1006)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41107#(< main_~i~0 1006)} is VALID [2022-04-28 02:59:08,226 INFO L290 TraceCheckUtils]: 65: Hoare triple {41114#(< main_~i~0 1005)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41107#(< main_~i~0 1006)} is VALID [2022-04-28 02:59:08,226 INFO L290 TraceCheckUtils]: 64: Hoare triple {41114#(< main_~i~0 1005)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41114#(< main_~i~0 1005)} is VALID [2022-04-28 02:59:08,226 INFO L290 TraceCheckUtils]: 63: Hoare triple {41121#(< main_~i~0 1004)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41114#(< main_~i~0 1005)} is VALID [2022-04-28 02:59:08,227 INFO L290 TraceCheckUtils]: 62: Hoare triple {41121#(< main_~i~0 1004)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41121#(< main_~i~0 1004)} is VALID [2022-04-28 02:59:08,227 INFO L290 TraceCheckUtils]: 61: Hoare triple {41128#(< main_~i~0 1003)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41121#(< main_~i~0 1004)} is VALID [2022-04-28 02:59:08,227 INFO L290 TraceCheckUtils]: 60: Hoare triple {41128#(< main_~i~0 1003)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41128#(< main_~i~0 1003)} is VALID [2022-04-28 02:59:08,228 INFO L290 TraceCheckUtils]: 59: Hoare triple {41135#(< main_~i~0 1002)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41128#(< main_~i~0 1003)} is VALID [2022-04-28 02:59:08,228 INFO L290 TraceCheckUtils]: 58: Hoare triple {41135#(< main_~i~0 1002)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41135#(< main_~i~0 1002)} is VALID [2022-04-28 02:59:08,228 INFO L290 TraceCheckUtils]: 57: Hoare triple {41142#(< main_~i~0 1001)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41135#(< main_~i~0 1002)} is VALID [2022-04-28 02:59:08,229 INFO L290 TraceCheckUtils]: 56: Hoare triple {41142#(< main_~i~0 1001)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41142#(< main_~i~0 1001)} is VALID [2022-04-28 02:59:08,229 INFO L290 TraceCheckUtils]: 55: Hoare triple {41149#(< main_~i~0 1000)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41142#(< main_~i~0 1001)} is VALID [2022-04-28 02:59:08,229 INFO L290 TraceCheckUtils]: 54: Hoare triple {41149#(< main_~i~0 1000)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41149#(< main_~i~0 1000)} is VALID [2022-04-28 02:59:08,230 INFO L290 TraceCheckUtils]: 53: Hoare triple {41156#(< main_~i~0 999)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41149#(< main_~i~0 1000)} is VALID [2022-04-28 02:59:08,230 INFO L290 TraceCheckUtils]: 52: Hoare triple {41156#(< main_~i~0 999)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41156#(< main_~i~0 999)} is VALID [2022-04-28 02:59:08,230 INFO L290 TraceCheckUtils]: 51: Hoare triple {41163#(< main_~i~0 998)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41156#(< main_~i~0 999)} is VALID [2022-04-28 02:59:08,230 INFO L290 TraceCheckUtils]: 50: Hoare triple {41163#(< main_~i~0 998)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41163#(< main_~i~0 998)} is VALID [2022-04-28 02:59:08,231 INFO L290 TraceCheckUtils]: 49: Hoare triple {41170#(< main_~i~0 997)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41163#(< main_~i~0 998)} is VALID [2022-04-28 02:59:08,231 INFO L290 TraceCheckUtils]: 48: Hoare triple {41170#(< main_~i~0 997)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41170#(< main_~i~0 997)} is VALID [2022-04-28 02:59:08,231 INFO L290 TraceCheckUtils]: 47: Hoare triple {41177#(< main_~i~0 996)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41170#(< main_~i~0 997)} is VALID [2022-04-28 02:59:08,232 INFO L290 TraceCheckUtils]: 46: Hoare triple {41177#(< main_~i~0 996)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41177#(< main_~i~0 996)} is VALID [2022-04-28 02:59:08,232 INFO L290 TraceCheckUtils]: 45: Hoare triple {41184#(< main_~i~0 995)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41177#(< main_~i~0 996)} is VALID [2022-04-28 02:59:08,232 INFO L290 TraceCheckUtils]: 44: Hoare triple {41184#(< main_~i~0 995)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41184#(< main_~i~0 995)} is VALID [2022-04-28 02:59:08,233 INFO L290 TraceCheckUtils]: 43: Hoare triple {41191#(< main_~i~0 994)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41184#(< main_~i~0 995)} is VALID [2022-04-28 02:59:08,233 INFO L290 TraceCheckUtils]: 42: Hoare triple {41191#(< main_~i~0 994)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41191#(< main_~i~0 994)} is VALID [2022-04-28 02:59:08,233 INFO L290 TraceCheckUtils]: 41: Hoare triple {41198#(< main_~i~0 993)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41191#(< main_~i~0 994)} is VALID [2022-04-28 02:59:08,234 INFO L290 TraceCheckUtils]: 40: Hoare triple {41198#(< main_~i~0 993)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41198#(< main_~i~0 993)} is VALID [2022-04-28 02:59:08,234 INFO L290 TraceCheckUtils]: 39: Hoare triple {41205#(< main_~i~0 992)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41198#(< main_~i~0 993)} is VALID [2022-04-28 02:59:08,234 INFO L290 TraceCheckUtils]: 38: Hoare triple {41205#(< main_~i~0 992)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41205#(< main_~i~0 992)} is VALID [2022-04-28 02:59:08,235 INFO L290 TraceCheckUtils]: 37: Hoare triple {41212#(< main_~i~0 991)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41205#(< main_~i~0 992)} is VALID [2022-04-28 02:59:08,235 INFO L290 TraceCheckUtils]: 36: Hoare triple {41212#(< main_~i~0 991)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41212#(< main_~i~0 991)} is VALID [2022-04-28 02:59:08,235 INFO L290 TraceCheckUtils]: 35: Hoare triple {41219#(< main_~i~0 990)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41212#(< main_~i~0 991)} is VALID [2022-04-28 02:59:08,235 INFO L290 TraceCheckUtils]: 34: Hoare triple {41219#(< main_~i~0 990)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41219#(< main_~i~0 990)} is VALID [2022-04-28 02:59:08,236 INFO L290 TraceCheckUtils]: 33: Hoare triple {41226#(< main_~i~0 989)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41219#(< main_~i~0 990)} is VALID [2022-04-28 02:59:08,236 INFO L290 TraceCheckUtils]: 32: Hoare triple {41226#(< main_~i~0 989)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41226#(< main_~i~0 989)} is VALID [2022-04-28 02:59:08,236 INFO L290 TraceCheckUtils]: 31: Hoare triple {41233#(< main_~i~0 988)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41226#(< main_~i~0 989)} is VALID [2022-04-28 02:59:08,237 INFO L290 TraceCheckUtils]: 30: Hoare triple {41233#(< main_~i~0 988)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41233#(< main_~i~0 988)} is VALID [2022-04-28 02:59:08,237 INFO L290 TraceCheckUtils]: 29: Hoare triple {41240#(< main_~i~0 987)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41233#(< main_~i~0 988)} is VALID [2022-04-28 02:59:08,237 INFO L290 TraceCheckUtils]: 28: Hoare triple {41240#(< main_~i~0 987)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41240#(< main_~i~0 987)} is VALID [2022-04-28 02:59:08,238 INFO L290 TraceCheckUtils]: 27: Hoare triple {41247#(< main_~i~0 986)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41240#(< main_~i~0 987)} is VALID [2022-04-28 02:59:08,238 INFO L290 TraceCheckUtils]: 26: Hoare triple {41247#(< main_~i~0 986)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41247#(< main_~i~0 986)} is VALID [2022-04-28 02:59:08,238 INFO L290 TraceCheckUtils]: 25: Hoare triple {41254#(< main_~i~0 985)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41247#(< main_~i~0 986)} is VALID [2022-04-28 02:59:08,239 INFO L290 TraceCheckUtils]: 24: Hoare triple {41254#(< main_~i~0 985)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41254#(< main_~i~0 985)} is VALID [2022-04-28 02:59:08,239 INFO L290 TraceCheckUtils]: 23: Hoare triple {41261#(< main_~i~0 984)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41254#(< main_~i~0 985)} is VALID [2022-04-28 02:59:08,239 INFO L290 TraceCheckUtils]: 22: Hoare triple {41261#(< main_~i~0 984)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41261#(< main_~i~0 984)} is VALID [2022-04-28 02:59:08,240 INFO L290 TraceCheckUtils]: 21: Hoare triple {41268#(< main_~i~0 983)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41261#(< main_~i~0 984)} is VALID [2022-04-28 02:59:08,240 INFO L290 TraceCheckUtils]: 20: Hoare triple {41268#(< main_~i~0 983)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41268#(< main_~i~0 983)} is VALID [2022-04-28 02:59:08,240 INFO L290 TraceCheckUtils]: 19: Hoare triple {41275#(< main_~i~0 982)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41268#(< main_~i~0 983)} is VALID [2022-04-28 02:59:08,240 INFO L290 TraceCheckUtils]: 18: Hoare triple {41275#(< main_~i~0 982)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41275#(< main_~i~0 982)} is VALID [2022-04-28 02:59:08,241 INFO L290 TraceCheckUtils]: 17: Hoare triple {41282#(< main_~i~0 981)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41275#(< main_~i~0 982)} is VALID [2022-04-28 02:59:08,241 INFO L290 TraceCheckUtils]: 16: Hoare triple {41282#(< main_~i~0 981)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41282#(< main_~i~0 981)} is VALID [2022-04-28 02:59:08,241 INFO L290 TraceCheckUtils]: 15: Hoare triple {41289#(< main_~i~0 980)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41282#(< main_~i~0 981)} is VALID [2022-04-28 02:59:08,242 INFO L290 TraceCheckUtils]: 14: Hoare triple {41289#(< main_~i~0 980)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41289#(< main_~i~0 980)} is VALID [2022-04-28 02:59:08,242 INFO L290 TraceCheckUtils]: 13: Hoare triple {41296#(< main_~i~0 979)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41289#(< main_~i~0 980)} is VALID [2022-04-28 02:59:08,242 INFO L290 TraceCheckUtils]: 12: Hoare triple {41296#(< main_~i~0 979)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41296#(< main_~i~0 979)} is VALID [2022-04-28 02:59:08,243 INFO L290 TraceCheckUtils]: 11: Hoare triple {41303#(< main_~i~0 978)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41296#(< main_~i~0 979)} is VALID [2022-04-28 02:59:08,243 INFO L290 TraceCheckUtils]: 10: Hoare triple {41303#(< main_~i~0 978)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41303#(< main_~i~0 978)} is VALID [2022-04-28 02:59:08,243 INFO L290 TraceCheckUtils]: 9: Hoare triple {41310#(< main_~i~0 977)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41303#(< main_~i~0 978)} is VALID [2022-04-28 02:59:08,244 INFO L290 TraceCheckUtils]: 8: Hoare triple {41310#(< main_~i~0 977)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41310#(< main_~i~0 977)} is VALID [2022-04-28 02:59:08,244 INFO L290 TraceCheckUtils]: 7: Hoare triple {41317#(< main_~i~0 976)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41310#(< main_~i~0 977)} is VALID [2022-04-28 02:59:08,244 INFO L290 TraceCheckUtils]: 6: Hoare triple {41317#(< main_~i~0 976)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41317#(< main_~i~0 976)} is VALID [2022-04-28 02:59:08,245 INFO L290 TraceCheckUtils]: 5: Hoare triple {40589#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {41317#(< main_~i~0 976)} is VALID [2022-04-28 02:59:08,245 INFO L272 TraceCheckUtils]: 4: Hoare triple {40589#true} call #t~ret6 := main(); {40589#true} is VALID [2022-04-28 02:59:08,245 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40589#true} {40589#true} #39#return; {40589#true} is VALID [2022-04-28 02:59:08,245 INFO L290 TraceCheckUtils]: 2: Hoare triple {40589#true} assume true; {40589#true} is VALID [2022-04-28 02:59:08,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {40589#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {40589#true} is VALID [2022-04-28 02:59:08,245 INFO L272 TraceCheckUtils]: 0: Hoare triple {40589#true} call ULTIMATE.init(); {40589#true} is VALID [2022-04-28 02:59:08,245 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:59:08,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [900298085] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:59:08,245 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:59:08,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 51, 51] total 102 [2022-04-28 02:59:08,245 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:59:08,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [363121383] [2022-04-28 02:59:08,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [363121383] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:59:08,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:59:08,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2022-04-28 02:59:08,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063764920] [2022-04-28 02:59:08,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:59:08,246 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 2.0) internal successors, (104), 51 states have internal predecessors, (104), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 108 [2022-04-28 02:59:08,246 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:59:08,246 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 52 states, 52 states have (on average 2.0) internal successors, (104), 51 states have internal predecessors, (104), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:08,313 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:59:08,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-04-28 02:59:08,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:59:08,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-04-28 02:59:08,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5052, Invalid=5250, Unknown=0, NotChecked=0, Total=10302 [2022-04-28 02:59:08,315 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand has 52 states, 52 states have (on average 2.0) internal successors, (104), 51 states have internal predecessors, (104), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:10,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:59:10,094 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2022-04-28 02:59:10,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-04-28 02:59:10,095 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 2.0) internal successors, (104), 51 states have internal predecessors, (104), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 108 [2022-04-28 02:59:10,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:59:10,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 2.0) internal successors, (104), 51 states have internal predecessors, (104), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:10,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 118 transitions. [2022-04-28 02:59:10,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 2.0) internal successors, (104), 51 states have internal predecessors, (104), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:10,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 118 transitions. [2022-04-28 02:59:10,096 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 118 transitions. [2022-04-28 02:59:10,186 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:59:10,187 INFO L225 Difference]: With dead ends: 118 [2022-04-28 02:59:10,187 INFO L226 Difference]: Without dead ends: 112 [2022-04-28 02:59:10,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1463 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=10002, Invalid=12648, Unknown=0, NotChecked=0, Total=22650 [2022-04-28 02:59:10,189 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 106 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:59:10,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 39 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:59:10,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-04-28 02:59:10,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2022-04-28 02:59:10,710 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:59:10,711 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand has 111 states, 106 states have (on average 1.009433962264151) internal successors, (107), 106 states have internal predecessors, (107), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:10,711 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand has 111 states, 106 states have (on average 1.009433962264151) internal successors, (107), 106 states have internal predecessors, (107), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:10,711 INFO L87 Difference]: Start difference. First operand 112 states. Second operand has 111 states, 106 states have (on average 1.009433962264151) internal successors, (107), 106 states have internal predecessors, (107), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:10,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:59:10,712 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2022-04-28 02:59:10,712 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2022-04-28 02:59:10,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:59:10,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:59:10,712 INFO L74 IsIncluded]: Start isIncluded. First operand has 111 states, 106 states have (on average 1.009433962264151) internal successors, (107), 106 states have internal predecessors, (107), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 112 states. [2022-04-28 02:59:10,712 INFO L87 Difference]: Start difference. First operand has 111 states, 106 states have (on average 1.009433962264151) internal successors, (107), 106 states have internal predecessors, (107), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 112 states. [2022-04-28 02:59:10,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:59:10,713 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2022-04-28 02:59:10,713 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2022-04-28 02:59:10,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:59:10,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:59:10,714 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:59:10,714 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:59:10,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 106 states have (on average 1.009433962264151) internal successors, (107), 106 states have internal predecessors, (107), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:10,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2022-04-28 02:59:10,715 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 108 [2022-04-28 02:59:10,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:59:10,715 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2022-04-28 02:59:10,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 2.0) internal successors, (104), 51 states have internal predecessors, (104), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:10,715 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 111 states and 111 transitions. [2022-04-28 02:59:10,855 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:59:10,856 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2022-04-28 02:59:10,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-04-28 02:59:10,856 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:59:10,856 INFO L195 NwaCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:59:10,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Ended with exit code 0 [2022-04-28 02:59:11,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-04-28 02:59:11,058 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:59:11,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:59:11,058 INFO L85 PathProgramCache]: Analyzing trace with hash -772007716, now seen corresponding path program 97 times [2022-04-28 02:59:11,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:59:11,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2114421408] [2022-04-28 02:59:11,060 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:59:11,060 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:59:11,060 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:59:11,060 INFO L85 PathProgramCache]: Analyzing trace with hash -772007716, now seen corresponding path program 98 times [2022-04-28 02:59:11,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:59:11,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320073794] [2022-04-28 02:59:11,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:59:11,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:59:11,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:59:12,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:59:12,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:59:12,037 INFO L290 TraceCheckUtils]: 0: Hoare triple {42176#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {42121#true} is VALID [2022-04-28 02:59:12,038 INFO L290 TraceCheckUtils]: 1: Hoare triple {42121#true} assume true; {42121#true} is VALID [2022-04-28 02:59:12,038 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42121#true} {42121#true} #39#return; {42121#true} is VALID [2022-04-28 02:59:12,038 INFO L272 TraceCheckUtils]: 0: Hoare triple {42121#true} call ULTIMATE.init(); {42176#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:59:12,038 INFO L290 TraceCheckUtils]: 1: Hoare triple {42176#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {42121#true} is VALID [2022-04-28 02:59:12,038 INFO L290 TraceCheckUtils]: 2: Hoare triple {42121#true} assume true; {42121#true} is VALID [2022-04-28 02:59:12,038 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42121#true} {42121#true} #39#return; {42121#true} is VALID [2022-04-28 02:59:12,038 INFO L272 TraceCheckUtils]: 4: Hoare triple {42121#true} call #t~ret6 := main(); {42121#true} is VALID [2022-04-28 02:59:12,038 INFO L290 TraceCheckUtils]: 5: Hoare triple {42121#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {42126#(= main_~i~0 0)} is VALID [2022-04-28 02:59:12,039 INFO L290 TraceCheckUtils]: 6: Hoare triple {42126#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42126#(= main_~i~0 0)} is VALID [2022-04-28 02:59:12,039 INFO L290 TraceCheckUtils]: 7: Hoare triple {42126#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42127#(<= main_~i~0 1)} is VALID [2022-04-28 02:59:12,039 INFO L290 TraceCheckUtils]: 8: Hoare triple {42127#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42127#(<= main_~i~0 1)} is VALID [2022-04-28 02:59:12,040 INFO L290 TraceCheckUtils]: 9: Hoare triple {42127#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42128#(<= main_~i~0 2)} is VALID [2022-04-28 02:59:12,040 INFO L290 TraceCheckUtils]: 10: Hoare triple {42128#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42128#(<= main_~i~0 2)} is VALID [2022-04-28 02:59:12,040 INFO L290 TraceCheckUtils]: 11: Hoare triple {42128#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42129#(<= main_~i~0 3)} is VALID [2022-04-28 02:59:12,040 INFO L290 TraceCheckUtils]: 12: Hoare triple {42129#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42129#(<= main_~i~0 3)} is VALID [2022-04-28 02:59:12,041 INFO L290 TraceCheckUtils]: 13: Hoare triple {42129#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42130#(<= main_~i~0 4)} is VALID [2022-04-28 02:59:12,041 INFO L290 TraceCheckUtils]: 14: Hoare triple {42130#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42130#(<= main_~i~0 4)} is VALID [2022-04-28 02:59:12,041 INFO L290 TraceCheckUtils]: 15: Hoare triple {42130#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42131#(<= main_~i~0 5)} is VALID [2022-04-28 02:59:12,042 INFO L290 TraceCheckUtils]: 16: Hoare triple {42131#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42131#(<= main_~i~0 5)} is VALID [2022-04-28 02:59:12,042 INFO L290 TraceCheckUtils]: 17: Hoare triple {42131#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42132#(<= main_~i~0 6)} is VALID [2022-04-28 02:59:12,042 INFO L290 TraceCheckUtils]: 18: Hoare triple {42132#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42132#(<= main_~i~0 6)} is VALID [2022-04-28 02:59:12,043 INFO L290 TraceCheckUtils]: 19: Hoare triple {42132#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42133#(<= main_~i~0 7)} is VALID [2022-04-28 02:59:12,043 INFO L290 TraceCheckUtils]: 20: Hoare triple {42133#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42133#(<= main_~i~0 7)} is VALID [2022-04-28 02:59:12,043 INFO L290 TraceCheckUtils]: 21: Hoare triple {42133#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42134#(<= main_~i~0 8)} is VALID [2022-04-28 02:59:12,044 INFO L290 TraceCheckUtils]: 22: Hoare triple {42134#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42134#(<= main_~i~0 8)} is VALID [2022-04-28 02:59:12,044 INFO L290 TraceCheckUtils]: 23: Hoare triple {42134#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42135#(<= main_~i~0 9)} is VALID [2022-04-28 02:59:12,044 INFO L290 TraceCheckUtils]: 24: Hoare triple {42135#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42135#(<= main_~i~0 9)} is VALID [2022-04-28 02:59:12,045 INFO L290 TraceCheckUtils]: 25: Hoare triple {42135#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42136#(<= main_~i~0 10)} is VALID [2022-04-28 02:59:12,045 INFO L290 TraceCheckUtils]: 26: Hoare triple {42136#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42136#(<= main_~i~0 10)} is VALID [2022-04-28 02:59:12,045 INFO L290 TraceCheckUtils]: 27: Hoare triple {42136#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42137#(<= main_~i~0 11)} is VALID [2022-04-28 02:59:12,045 INFO L290 TraceCheckUtils]: 28: Hoare triple {42137#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42137#(<= main_~i~0 11)} is VALID [2022-04-28 02:59:12,046 INFO L290 TraceCheckUtils]: 29: Hoare triple {42137#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42138#(<= main_~i~0 12)} is VALID [2022-04-28 02:59:12,046 INFO L290 TraceCheckUtils]: 30: Hoare triple {42138#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42138#(<= main_~i~0 12)} is VALID [2022-04-28 02:59:12,046 INFO L290 TraceCheckUtils]: 31: Hoare triple {42138#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42139#(<= main_~i~0 13)} is VALID [2022-04-28 02:59:12,047 INFO L290 TraceCheckUtils]: 32: Hoare triple {42139#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42139#(<= main_~i~0 13)} is VALID [2022-04-28 02:59:12,047 INFO L290 TraceCheckUtils]: 33: Hoare triple {42139#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42140#(<= main_~i~0 14)} is VALID [2022-04-28 02:59:12,047 INFO L290 TraceCheckUtils]: 34: Hoare triple {42140#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42140#(<= main_~i~0 14)} is VALID [2022-04-28 02:59:12,048 INFO L290 TraceCheckUtils]: 35: Hoare triple {42140#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42141#(<= main_~i~0 15)} is VALID [2022-04-28 02:59:12,048 INFO L290 TraceCheckUtils]: 36: Hoare triple {42141#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42141#(<= main_~i~0 15)} is VALID [2022-04-28 02:59:12,048 INFO L290 TraceCheckUtils]: 37: Hoare triple {42141#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42142#(<= main_~i~0 16)} is VALID [2022-04-28 02:59:12,048 INFO L290 TraceCheckUtils]: 38: Hoare triple {42142#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42142#(<= main_~i~0 16)} is VALID [2022-04-28 02:59:12,049 INFO L290 TraceCheckUtils]: 39: Hoare triple {42142#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42143#(<= main_~i~0 17)} is VALID [2022-04-28 02:59:12,049 INFO L290 TraceCheckUtils]: 40: Hoare triple {42143#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42143#(<= main_~i~0 17)} is VALID [2022-04-28 02:59:12,049 INFO L290 TraceCheckUtils]: 41: Hoare triple {42143#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42144#(<= main_~i~0 18)} is VALID [2022-04-28 02:59:12,050 INFO L290 TraceCheckUtils]: 42: Hoare triple {42144#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42144#(<= main_~i~0 18)} is VALID [2022-04-28 02:59:12,050 INFO L290 TraceCheckUtils]: 43: Hoare triple {42144#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42145#(<= main_~i~0 19)} is VALID [2022-04-28 02:59:12,050 INFO L290 TraceCheckUtils]: 44: Hoare triple {42145#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42145#(<= main_~i~0 19)} is VALID [2022-04-28 02:59:12,051 INFO L290 TraceCheckUtils]: 45: Hoare triple {42145#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42146#(<= main_~i~0 20)} is VALID [2022-04-28 02:59:12,051 INFO L290 TraceCheckUtils]: 46: Hoare triple {42146#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42146#(<= main_~i~0 20)} is VALID [2022-04-28 02:59:12,051 INFO L290 TraceCheckUtils]: 47: Hoare triple {42146#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42147#(<= main_~i~0 21)} is VALID [2022-04-28 02:59:12,052 INFO L290 TraceCheckUtils]: 48: Hoare triple {42147#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42147#(<= main_~i~0 21)} is VALID [2022-04-28 02:59:12,052 INFO L290 TraceCheckUtils]: 49: Hoare triple {42147#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42148#(<= main_~i~0 22)} is VALID [2022-04-28 02:59:12,052 INFO L290 TraceCheckUtils]: 50: Hoare triple {42148#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42148#(<= main_~i~0 22)} is VALID [2022-04-28 02:59:12,052 INFO L290 TraceCheckUtils]: 51: Hoare triple {42148#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42149#(<= main_~i~0 23)} is VALID [2022-04-28 02:59:12,053 INFO L290 TraceCheckUtils]: 52: Hoare triple {42149#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42149#(<= main_~i~0 23)} is VALID [2022-04-28 02:59:12,053 INFO L290 TraceCheckUtils]: 53: Hoare triple {42149#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42150#(<= main_~i~0 24)} is VALID [2022-04-28 02:59:12,053 INFO L290 TraceCheckUtils]: 54: Hoare triple {42150#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42150#(<= main_~i~0 24)} is VALID [2022-04-28 02:59:12,054 INFO L290 TraceCheckUtils]: 55: Hoare triple {42150#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42151#(<= main_~i~0 25)} is VALID [2022-04-28 02:59:12,054 INFO L290 TraceCheckUtils]: 56: Hoare triple {42151#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42151#(<= main_~i~0 25)} is VALID [2022-04-28 02:59:12,054 INFO L290 TraceCheckUtils]: 57: Hoare triple {42151#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42152#(<= main_~i~0 26)} is VALID [2022-04-28 02:59:12,055 INFO L290 TraceCheckUtils]: 58: Hoare triple {42152#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42152#(<= main_~i~0 26)} is VALID [2022-04-28 02:59:12,055 INFO L290 TraceCheckUtils]: 59: Hoare triple {42152#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42153#(<= main_~i~0 27)} is VALID [2022-04-28 02:59:12,055 INFO L290 TraceCheckUtils]: 60: Hoare triple {42153#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42153#(<= main_~i~0 27)} is VALID [2022-04-28 02:59:12,056 INFO L290 TraceCheckUtils]: 61: Hoare triple {42153#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42154#(<= main_~i~0 28)} is VALID [2022-04-28 02:59:12,056 INFO L290 TraceCheckUtils]: 62: Hoare triple {42154#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42154#(<= main_~i~0 28)} is VALID [2022-04-28 02:59:12,056 INFO L290 TraceCheckUtils]: 63: Hoare triple {42154#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42155#(<= main_~i~0 29)} is VALID [2022-04-28 02:59:12,056 INFO L290 TraceCheckUtils]: 64: Hoare triple {42155#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42155#(<= main_~i~0 29)} is VALID [2022-04-28 02:59:12,057 INFO L290 TraceCheckUtils]: 65: Hoare triple {42155#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42156#(<= main_~i~0 30)} is VALID [2022-04-28 02:59:12,057 INFO L290 TraceCheckUtils]: 66: Hoare triple {42156#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42156#(<= main_~i~0 30)} is VALID [2022-04-28 02:59:12,057 INFO L290 TraceCheckUtils]: 67: Hoare triple {42156#(<= main_~i~0 30)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42157#(<= main_~i~0 31)} is VALID [2022-04-28 02:59:12,058 INFO L290 TraceCheckUtils]: 68: Hoare triple {42157#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42157#(<= main_~i~0 31)} is VALID [2022-04-28 02:59:12,058 INFO L290 TraceCheckUtils]: 69: Hoare triple {42157#(<= main_~i~0 31)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42158#(<= main_~i~0 32)} is VALID [2022-04-28 02:59:12,058 INFO L290 TraceCheckUtils]: 70: Hoare triple {42158#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42158#(<= main_~i~0 32)} is VALID [2022-04-28 02:59:12,059 INFO L290 TraceCheckUtils]: 71: Hoare triple {42158#(<= main_~i~0 32)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42159#(<= main_~i~0 33)} is VALID [2022-04-28 02:59:12,059 INFO L290 TraceCheckUtils]: 72: Hoare triple {42159#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42159#(<= main_~i~0 33)} is VALID [2022-04-28 02:59:12,059 INFO L290 TraceCheckUtils]: 73: Hoare triple {42159#(<= main_~i~0 33)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42160#(<= main_~i~0 34)} is VALID [2022-04-28 02:59:12,060 INFO L290 TraceCheckUtils]: 74: Hoare triple {42160#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42160#(<= main_~i~0 34)} is VALID [2022-04-28 02:59:12,060 INFO L290 TraceCheckUtils]: 75: Hoare triple {42160#(<= main_~i~0 34)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42161#(<= main_~i~0 35)} is VALID [2022-04-28 02:59:12,060 INFO L290 TraceCheckUtils]: 76: Hoare triple {42161#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42161#(<= main_~i~0 35)} is VALID [2022-04-28 02:59:12,060 INFO L290 TraceCheckUtils]: 77: Hoare triple {42161#(<= main_~i~0 35)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42162#(<= main_~i~0 36)} is VALID [2022-04-28 02:59:12,061 INFO L290 TraceCheckUtils]: 78: Hoare triple {42162#(<= main_~i~0 36)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42162#(<= main_~i~0 36)} is VALID [2022-04-28 02:59:12,061 INFO L290 TraceCheckUtils]: 79: Hoare triple {42162#(<= main_~i~0 36)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42163#(<= main_~i~0 37)} is VALID [2022-04-28 02:59:12,061 INFO L290 TraceCheckUtils]: 80: Hoare triple {42163#(<= main_~i~0 37)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42163#(<= main_~i~0 37)} is VALID [2022-04-28 02:59:12,062 INFO L290 TraceCheckUtils]: 81: Hoare triple {42163#(<= main_~i~0 37)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42164#(<= main_~i~0 38)} is VALID [2022-04-28 02:59:12,062 INFO L290 TraceCheckUtils]: 82: Hoare triple {42164#(<= main_~i~0 38)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42164#(<= main_~i~0 38)} is VALID [2022-04-28 02:59:12,062 INFO L290 TraceCheckUtils]: 83: Hoare triple {42164#(<= main_~i~0 38)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42165#(<= main_~i~0 39)} is VALID [2022-04-28 02:59:12,063 INFO L290 TraceCheckUtils]: 84: Hoare triple {42165#(<= main_~i~0 39)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42165#(<= main_~i~0 39)} is VALID [2022-04-28 02:59:12,063 INFO L290 TraceCheckUtils]: 85: Hoare triple {42165#(<= main_~i~0 39)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42166#(<= main_~i~0 40)} is VALID [2022-04-28 02:59:12,063 INFO L290 TraceCheckUtils]: 86: Hoare triple {42166#(<= main_~i~0 40)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42166#(<= main_~i~0 40)} is VALID [2022-04-28 02:59:12,064 INFO L290 TraceCheckUtils]: 87: Hoare triple {42166#(<= main_~i~0 40)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42167#(<= main_~i~0 41)} is VALID [2022-04-28 02:59:12,064 INFO L290 TraceCheckUtils]: 88: Hoare triple {42167#(<= main_~i~0 41)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42167#(<= main_~i~0 41)} is VALID [2022-04-28 02:59:12,064 INFO L290 TraceCheckUtils]: 89: Hoare triple {42167#(<= main_~i~0 41)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42168#(<= main_~i~0 42)} is VALID [2022-04-28 02:59:12,064 INFO L290 TraceCheckUtils]: 90: Hoare triple {42168#(<= main_~i~0 42)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42168#(<= main_~i~0 42)} is VALID [2022-04-28 02:59:12,065 INFO L290 TraceCheckUtils]: 91: Hoare triple {42168#(<= main_~i~0 42)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42169#(<= main_~i~0 43)} is VALID [2022-04-28 02:59:12,065 INFO L290 TraceCheckUtils]: 92: Hoare triple {42169#(<= main_~i~0 43)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42169#(<= main_~i~0 43)} is VALID [2022-04-28 02:59:12,065 INFO L290 TraceCheckUtils]: 93: Hoare triple {42169#(<= main_~i~0 43)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42170#(<= main_~i~0 44)} is VALID [2022-04-28 02:59:12,066 INFO L290 TraceCheckUtils]: 94: Hoare triple {42170#(<= main_~i~0 44)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42170#(<= main_~i~0 44)} is VALID [2022-04-28 02:59:12,066 INFO L290 TraceCheckUtils]: 95: Hoare triple {42170#(<= main_~i~0 44)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42171#(<= main_~i~0 45)} is VALID [2022-04-28 02:59:12,066 INFO L290 TraceCheckUtils]: 96: Hoare triple {42171#(<= main_~i~0 45)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42171#(<= main_~i~0 45)} is VALID [2022-04-28 02:59:12,067 INFO L290 TraceCheckUtils]: 97: Hoare triple {42171#(<= main_~i~0 45)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42172#(<= main_~i~0 46)} is VALID [2022-04-28 02:59:12,067 INFO L290 TraceCheckUtils]: 98: Hoare triple {42172#(<= main_~i~0 46)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42172#(<= main_~i~0 46)} is VALID [2022-04-28 02:59:12,067 INFO L290 TraceCheckUtils]: 99: Hoare triple {42172#(<= main_~i~0 46)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42173#(<= main_~i~0 47)} is VALID [2022-04-28 02:59:12,068 INFO L290 TraceCheckUtils]: 100: Hoare triple {42173#(<= main_~i~0 47)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42173#(<= main_~i~0 47)} is VALID [2022-04-28 02:59:12,068 INFO L290 TraceCheckUtils]: 101: Hoare triple {42173#(<= main_~i~0 47)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42174#(<= main_~i~0 48)} is VALID [2022-04-28 02:59:12,068 INFO L290 TraceCheckUtils]: 102: Hoare triple {42174#(<= main_~i~0 48)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42174#(<= main_~i~0 48)} is VALID [2022-04-28 02:59:12,069 INFO L290 TraceCheckUtils]: 103: Hoare triple {42174#(<= main_~i~0 48)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42175#(<= main_~i~0 49)} is VALID [2022-04-28 02:59:12,069 INFO L290 TraceCheckUtils]: 104: Hoare triple {42175#(<= main_~i~0 49)} assume !(~i~0 < 1024); {42122#false} is VALID [2022-04-28 02:59:12,069 INFO L290 TraceCheckUtils]: 105: Hoare triple {42122#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {42122#false} is VALID [2022-04-28 02:59:12,069 INFO L272 TraceCheckUtils]: 106: Hoare triple {42122#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {42122#false} is VALID [2022-04-28 02:59:12,069 INFO L290 TraceCheckUtils]: 107: Hoare triple {42122#false} ~cond := #in~cond; {42122#false} is VALID [2022-04-28 02:59:12,069 INFO L290 TraceCheckUtils]: 108: Hoare triple {42122#false} assume 0 == ~cond; {42122#false} is VALID [2022-04-28 02:59:12,069 INFO L290 TraceCheckUtils]: 109: Hoare triple {42122#false} assume !false; {42122#false} is VALID [2022-04-28 02:59:12,069 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:59:12,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:59:12,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320073794] [2022-04-28 02:59:12,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320073794] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:59:12,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967857967] [2022-04-28 02:59:12,070 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:59:12,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:59:12,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:59:12,071 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:59:12,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-04-28 02:59:12,354 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:59:12,354 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:59:12,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 51 conjunts are in the unsatisfiable core [2022-04-28 02:59:12,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:59:12,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:59:12,991 INFO L272 TraceCheckUtils]: 0: Hoare triple {42121#true} call ULTIMATE.init(); {42121#true} is VALID [2022-04-28 02:59:12,991 INFO L290 TraceCheckUtils]: 1: Hoare triple {42121#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {42121#true} is VALID [2022-04-28 02:59:12,991 INFO L290 TraceCheckUtils]: 2: Hoare triple {42121#true} assume true; {42121#true} is VALID [2022-04-28 02:59:12,991 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42121#true} {42121#true} #39#return; {42121#true} is VALID [2022-04-28 02:59:12,991 INFO L272 TraceCheckUtils]: 4: Hoare triple {42121#true} call #t~ret6 := main(); {42121#true} is VALID [2022-04-28 02:59:12,992 INFO L290 TraceCheckUtils]: 5: Hoare triple {42121#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {42195#(<= main_~i~0 0)} is VALID [2022-04-28 02:59:12,992 INFO L290 TraceCheckUtils]: 6: Hoare triple {42195#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42195#(<= main_~i~0 0)} is VALID [2022-04-28 02:59:12,992 INFO L290 TraceCheckUtils]: 7: Hoare triple {42195#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42127#(<= main_~i~0 1)} is VALID [2022-04-28 02:59:12,992 INFO L290 TraceCheckUtils]: 8: Hoare triple {42127#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42127#(<= main_~i~0 1)} is VALID [2022-04-28 02:59:12,993 INFO L290 TraceCheckUtils]: 9: Hoare triple {42127#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42128#(<= main_~i~0 2)} is VALID [2022-04-28 02:59:12,993 INFO L290 TraceCheckUtils]: 10: Hoare triple {42128#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42128#(<= main_~i~0 2)} is VALID [2022-04-28 02:59:12,993 INFO L290 TraceCheckUtils]: 11: Hoare triple {42128#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42129#(<= main_~i~0 3)} is VALID [2022-04-28 02:59:12,994 INFO L290 TraceCheckUtils]: 12: Hoare triple {42129#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42129#(<= main_~i~0 3)} is VALID [2022-04-28 02:59:12,994 INFO L290 TraceCheckUtils]: 13: Hoare triple {42129#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42130#(<= main_~i~0 4)} is VALID [2022-04-28 02:59:12,994 INFO L290 TraceCheckUtils]: 14: Hoare triple {42130#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42130#(<= main_~i~0 4)} is VALID [2022-04-28 02:59:12,995 INFO L290 TraceCheckUtils]: 15: Hoare triple {42130#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42131#(<= main_~i~0 5)} is VALID [2022-04-28 02:59:12,995 INFO L290 TraceCheckUtils]: 16: Hoare triple {42131#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42131#(<= main_~i~0 5)} is VALID [2022-04-28 02:59:12,995 INFO L290 TraceCheckUtils]: 17: Hoare triple {42131#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42132#(<= main_~i~0 6)} is VALID [2022-04-28 02:59:12,996 INFO L290 TraceCheckUtils]: 18: Hoare triple {42132#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42132#(<= main_~i~0 6)} is VALID [2022-04-28 02:59:12,996 INFO L290 TraceCheckUtils]: 19: Hoare triple {42132#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42133#(<= main_~i~0 7)} is VALID [2022-04-28 02:59:12,996 INFO L290 TraceCheckUtils]: 20: Hoare triple {42133#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42133#(<= main_~i~0 7)} is VALID [2022-04-28 02:59:12,996 INFO L290 TraceCheckUtils]: 21: Hoare triple {42133#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42134#(<= main_~i~0 8)} is VALID [2022-04-28 02:59:12,997 INFO L290 TraceCheckUtils]: 22: Hoare triple {42134#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42134#(<= main_~i~0 8)} is VALID [2022-04-28 02:59:12,997 INFO L290 TraceCheckUtils]: 23: Hoare triple {42134#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42135#(<= main_~i~0 9)} is VALID [2022-04-28 02:59:12,997 INFO L290 TraceCheckUtils]: 24: Hoare triple {42135#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42135#(<= main_~i~0 9)} is VALID [2022-04-28 02:59:12,998 INFO L290 TraceCheckUtils]: 25: Hoare triple {42135#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42136#(<= main_~i~0 10)} is VALID [2022-04-28 02:59:12,998 INFO L290 TraceCheckUtils]: 26: Hoare triple {42136#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42136#(<= main_~i~0 10)} is VALID [2022-04-28 02:59:12,998 INFO L290 TraceCheckUtils]: 27: Hoare triple {42136#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42137#(<= main_~i~0 11)} is VALID [2022-04-28 02:59:12,999 INFO L290 TraceCheckUtils]: 28: Hoare triple {42137#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42137#(<= main_~i~0 11)} is VALID [2022-04-28 02:59:12,999 INFO L290 TraceCheckUtils]: 29: Hoare triple {42137#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42138#(<= main_~i~0 12)} is VALID [2022-04-28 02:59:12,999 INFO L290 TraceCheckUtils]: 30: Hoare triple {42138#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42138#(<= main_~i~0 12)} is VALID [2022-04-28 02:59:13,000 INFO L290 TraceCheckUtils]: 31: Hoare triple {42138#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42139#(<= main_~i~0 13)} is VALID [2022-04-28 02:59:13,000 INFO L290 TraceCheckUtils]: 32: Hoare triple {42139#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42139#(<= main_~i~0 13)} is VALID [2022-04-28 02:59:13,000 INFO L290 TraceCheckUtils]: 33: Hoare triple {42139#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42140#(<= main_~i~0 14)} is VALID [2022-04-28 02:59:13,000 INFO L290 TraceCheckUtils]: 34: Hoare triple {42140#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42140#(<= main_~i~0 14)} is VALID [2022-04-28 02:59:13,001 INFO L290 TraceCheckUtils]: 35: Hoare triple {42140#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42141#(<= main_~i~0 15)} is VALID [2022-04-28 02:59:13,001 INFO L290 TraceCheckUtils]: 36: Hoare triple {42141#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42141#(<= main_~i~0 15)} is VALID [2022-04-28 02:59:13,001 INFO L290 TraceCheckUtils]: 37: Hoare triple {42141#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42142#(<= main_~i~0 16)} is VALID [2022-04-28 02:59:13,002 INFO L290 TraceCheckUtils]: 38: Hoare triple {42142#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42142#(<= main_~i~0 16)} is VALID [2022-04-28 02:59:13,002 INFO L290 TraceCheckUtils]: 39: Hoare triple {42142#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42143#(<= main_~i~0 17)} is VALID [2022-04-28 02:59:13,002 INFO L290 TraceCheckUtils]: 40: Hoare triple {42143#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42143#(<= main_~i~0 17)} is VALID [2022-04-28 02:59:13,003 INFO L290 TraceCheckUtils]: 41: Hoare triple {42143#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42144#(<= main_~i~0 18)} is VALID [2022-04-28 02:59:13,003 INFO L290 TraceCheckUtils]: 42: Hoare triple {42144#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42144#(<= main_~i~0 18)} is VALID [2022-04-28 02:59:13,003 INFO L290 TraceCheckUtils]: 43: Hoare triple {42144#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42145#(<= main_~i~0 19)} is VALID [2022-04-28 02:59:13,004 INFO L290 TraceCheckUtils]: 44: Hoare triple {42145#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42145#(<= main_~i~0 19)} is VALID [2022-04-28 02:59:13,004 INFO L290 TraceCheckUtils]: 45: Hoare triple {42145#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42146#(<= main_~i~0 20)} is VALID [2022-04-28 02:59:13,004 INFO L290 TraceCheckUtils]: 46: Hoare triple {42146#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42146#(<= main_~i~0 20)} is VALID [2022-04-28 02:59:13,005 INFO L290 TraceCheckUtils]: 47: Hoare triple {42146#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42147#(<= main_~i~0 21)} is VALID [2022-04-28 02:59:13,005 INFO L290 TraceCheckUtils]: 48: Hoare triple {42147#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42147#(<= main_~i~0 21)} is VALID [2022-04-28 02:59:13,005 INFO L290 TraceCheckUtils]: 49: Hoare triple {42147#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42148#(<= main_~i~0 22)} is VALID [2022-04-28 02:59:13,005 INFO L290 TraceCheckUtils]: 50: Hoare triple {42148#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42148#(<= main_~i~0 22)} is VALID [2022-04-28 02:59:13,006 INFO L290 TraceCheckUtils]: 51: Hoare triple {42148#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42149#(<= main_~i~0 23)} is VALID [2022-04-28 02:59:13,006 INFO L290 TraceCheckUtils]: 52: Hoare triple {42149#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42149#(<= main_~i~0 23)} is VALID [2022-04-28 02:59:13,006 INFO L290 TraceCheckUtils]: 53: Hoare triple {42149#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42150#(<= main_~i~0 24)} is VALID [2022-04-28 02:59:13,007 INFO L290 TraceCheckUtils]: 54: Hoare triple {42150#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42150#(<= main_~i~0 24)} is VALID [2022-04-28 02:59:13,007 INFO L290 TraceCheckUtils]: 55: Hoare triple {42150#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42151#(<= main_~i~0 25)} is VALID [2022-04-28 02:59:13,007 INFO L290 TraceCheckUtils]: 56: Hoare triple {42151#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42151#(<= main_~i~0 25)} is VALID [2022-04-28 02:59:13,008 INFO L290 TraceCheckUtils]: 57: Hoare triple {42151#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42152#(<= main_~i~0 26)} is VALID [2022-04-28 02:59:13,008 INFO L290 TraceCheckUtils]: 58: Hoare triple {42152#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42152#(<= main_~i~0 26)} is VALID [2022-04-28 02:59:13,008 INFO L290 TraceCheckUtils]: 59: Hoare triple {42152#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42153#(<= main_~i~0 27)} is VALID [2022-04-28 02:59:13,008 INFO L290 TraceCheckUtils]: 60: Hoare triple {42153#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42153#(<= main_~i~0 27)} is VALID [2022-04-28 02:59:13,009 INFO L290 TraceCheckUtils]: 61: Hoare triple {42153#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42154#(<= main_~i~0 28)} is VALID [2022-04-28 02:59:13,009 INFO L290 TraceCheckUtils]: 62: Hoare triple {42154#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42154#(<= main_~i~0 28)} is VALID [2022-04-28 02:59:13,009 INFO L290 TraceCheckUtils]: 63: Hoare triple {42154#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42155#(<= main_~i~0 29)} is VALID [2022-04-28 02:59:13,010 INFO L290 TraceCheckUtils]: 64: Hoare triple {42155#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42155#(<= main_~i~0 29)} is VALID [2022-04-28 02:59:13,010 INFO L290 TraceCheckUtils]: 65: Hoare triple {42155#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42156#(<= main_~i~0 30)} is VALID [2022-04-28 02:59:13,010 INFO L290 TraceCheckUtils]: 66: Hoare triple {42156#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42156#(<= main_~i~0 30)} is VALID [2022-04-28 02:59:13,011 INFO L290 TraceCheckUtils]: 67: Hoare triple {42156#(<= main_~i~0 30)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42157#(<= main_~i~0 31)} is VALID [2022-04-28 02:59:13,011 INFO L290 TraceCheckUtils]: 68: Hoare triple {42157#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42157#(<= main_~i~0 31)} is VALID [2022-04-28 02:59:13,011 INFO L290 TraceCheckUtils]: 69: Hoare triple {42157#(<= main_~i~0 31)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42158#(<= main_~i~0 32)} is VALID [2022-04-28 02:59:13,012 INFO L290 TraceCheckUtils]: 70: Hoare triple {42158#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42158#(<= main_~i~0 32)} is VALID [2022-04-28 02:59:13,012 INFO L290 TraceCheckUtils]: 71: Hoare triple {42158#(<= main_~i~0 32)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42159#(<= main_~i~0 33)} is VALID [2022-04-28 02:59:13,012 INFO L290 TraceCheckUtils]: 72: Hoare triple {42159#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42159#(<= main_~i~0 33)} is VALID [2022-04-28 02:59:13,013 INFO L290 TraceCheckUtils]: 73: Hoare triple {42159#(<= main_~i~0 33)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42160#(<= main_~i~0 34)} is VALID [2022-04-28 02:59:13,013 INFO L290 TraceCheckUtils]: 74: Hoare triple {42160#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42160#(<= main_~i~0 34)} is VALID [2022-04-28 02:59:13,013 INFO L290 TraceCheckUtils]: 75: Hoare triple {42160#(<= main_~i~0 34)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42161#(<= main_~i~0 35)} is VALID [2022-04-28 02:59:13,013 INFO L290 TraceCheckUtils]: 76: Hoare triple {42161#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42161#(<= main_~i~0 35)} is VALID [2022-04-28 02:59:13,014 INFO L290 TraceCheckUtils]: 77: Hoare triple {42161#(<= main_~i~0 35)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42162#(<= main_~i~0 36)} is VALID [2022-04-28 02:59:13,014 INFO L290 TraceCheckUtils]: 78: Hoare triple {42162#(<= main_~i~0 36)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42162#(<= main_~i~0 36)} is VALID [2022-04-28 02:59:13,014 INFO L290 TraceCheckUtils]: 79: Hoare triple {42162#(<= main_~i~0 36)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42163#(<= main_~i~0 37)} is VALID [2022-04-28 02:59:13,015 INFO L290 TraceCheckUtils]: 80: Hoare triple {42163#(<= main_~i~0 37)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42163#(<= main_~i~0 37)} is VALID [2022-04-28 02:59:13,015 INFO L290 TraceCheckUtils]: 81: Hoare triple {42163#(<= main_~i~0 37)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42164#(<= main_~i~0 38)} is VALID [2022-04-28 02:59:13,015 INFO L290 TraceCheckUtils]: 82: Hoare triple {42164#(<= main_~i~0 38)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42164#(<= main_~i~0 38)} is VALID [2022-04-28 02:59:13,016 INFO L290 TraceCheckUtils]: 83: Hoare triple {42164#(<= main_~i~0 38)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42165#(<= main_~i~0 39)} is VALID [2022-04-28 02:59:13,016 INFO L290 TraceCheckUtils]: 84: Hoare triple {42165#(<= main_~i~0 39)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42165#(<= main_~i~0 39)} is VALID [2022-04-28 02:59:13,016 INFO L290 TraceCheckUtils]: 85: Hoare triple {42165#(<= main_~i~0 39)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42166#(<= main_~i~0 40)} is VALID [2022-04-28 02:59:13,017 INFO L290 TraceCheckUtils]: 86: Hoare triple {42166#(<= main_~i~0 40)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42166#(<= main_~i~0 40)} is VALID [2022-04-28 02:59:13,017 INFO L290 TraceCheckUtils]: 87: Hoare triple {42166#(<= main_~i~0 40)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42167#(<= main_~i~0 41)} is VALID [2022-04-28 02:59:13,017 INFO L290 TraceCheckUtils]: 88: Hoare triple {42167#(<= main_~i~0 41)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42167#(<= main_~i~0 41)} is VALID [2022-04-28 02:59:13,017 INFO L290 TraceCheckUtils]: 89: Hoare triple {42167#(<= main_~i~0 41)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42168#(<= main_~i~0 42)} is VALID [2022-04-28 02:59:13,018 INFO L290 TraceCheckUtils]: 90: Hoare triple {42168#(<= main_~i~0 42)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42168#(<= main_~i~0 42)} is VALID [2022-04-28 02:59:13,018 INFO L290 TraceCheckUtils]: 91: Hoare triple {42168#(<= main_~i~0 42)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42169#(<= main_~i~0 43)} is VALID [2022-04-28 02:59:13,018 INFO L290 TraceCheckUtils]: 92: Hoare triple {42169#(<= main_~i~0 43)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42169#(<= main_~i~0 43)} is VALID [2022-04-28 02:59:13,019 INFO L290 TraceCheckUtils]: 93: Hoare triple {42169#(<= main_~i~0 43)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42170#(<= main_~i~0 44)} is VALID [2022-04-28 02:59:13,019 INFO L290 TraceCheckUtils]: 94: Hoare triple {42170#(<= main_~i~0 44)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42170#(<= main_~i~0 44)} is VALID [2022-04-28 02:59:13,019 INFO L290 TraceCheckUtils]: 95: Hoare triple {42170#(<= main_~i~0 44)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42171#(<= main_~i~0 45)} is VALID [2022-04-28 02:59:13,020 INFO L290 TraceCheckUtils]: 96: Hoare triple {42171#(<= main_~i~0 45)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42171#(<= main_~i~0 45)} is VALID [2022-04-28 02:59:13,020 INFO L290 TraceCheckUtils]: 97: Hoare triple {42171#(<= main_~i~0 45)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42172#(<= main_~i~0 46)} is VALID [2022-04-28 02:59:13,020 INFO L290 TraceCheckUtils]: 98: Hoare triple {42172#(<= main_~i~0 46)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42172#(<= main_~i~0 46)} is VALID [2022-04-28 02:59:13,021 INFO L290 TraceCheckUtils]: 99: Hoare triple {42172#(<= main_~i~0 46)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42173#(<= main_~i~0 47)} is VALID [2022-04-28 02:59:13,021 INFO L290 TraceCheckUtils]: 100: Hoare triple {42173#(<= main_~i~0 47)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42173#(<= main_~i~0 47)} is VALID [2022-04-28 02:59:13,021 INFO L290 TraceCheckUtils]: 101: Hoare triple {42173#(<= main_~i~0 47)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42174#(<= main_~i~0 48)} is VALID [2022-04-28 02:59:13,021 INFO L290 TraceCheckUtils]: 102: Hoare triple {42174#(<= main_~i~0 48)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42174#(<= main_~i~0 48)} is VALID [2022-04-28 02:59:13,022 INFO L290 TraceCheckUtils]: 103: Hoare triple {42174#(<= main_~i~0 48)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42175#(<= main_~i~0 49)} is VALID [2022-04-28 02:59:13,022 INFO L290 TraceCheckUtils]: 104: Hoare triple {42175#(<= main_~i~0 49)} assume !(~i~0 < 1024); {42122#false} is VALID [2022-04-28 02:59:13,022 INFO L290 TraceCheckUtils]: 105: Hoare triple {42122#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {42122#false} is VALID [2022-04-28 02:59:13,022 INFO L272 TraceCheckUtils]: 106: Hoare triple {42122#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {42122#false} is VALID [2022-04-28 02:59:13,022 INFO L290 TraceCheckUtils]: 107: Hoare triple {42122#false} ~cond := #in~cond; {42122#false} is VALID [2022-04-28 02:59:13,022 INFO L290 TraceCheckUtils]: 108: Hoare triple {42122#false} assume 0 == ~cond; {42122#false} is VALID [2022-04-28 02:59:13,022 INFO L290 TraceCheckUtils]: 109: Hoare triple {42122#false} assume !false; {42122#false} is VALID [2022-04-28 02:59:13,023 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:59:13,023 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:59:15,947 INFO L290 TraceCheckUtils]: 109: Hoare triple {42122#false} assume !false; {42122#false} is VALID [2022-04-28 02:59:15,947 INFO L290 TraceCheckUtils]: 108: Hoare triple {42122#false} assume 0 == ~cond; {42122#false} is VALID [2022-04-28 02:59:15,947 INFO L290 TraceCheckUtils]: 107: Hoare triple {42122#false} ~cond := #in~cond; {42122#false} is VALID [2022-04-28 02:59:15,947 INFO L272 TraceCheckUtils]: 106: Hoare triple {42122#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {42122#false} is VALID [2022-04-28 02:59:15,947 INFO L290 TraceCheckUtils]: 105: Hoare triple {42122#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {42122#false} is VALID [2022-04-28 02:59:15,948 INFO L290 TraceCheckUtils]: 104: Hoare triple {42523#(< main_~i~0 1024)} assume !(~i~0 < 1024); {42122#false} is VALID [2022-04-28 02:59:15,948 INFO L290 TraceCheckUtils]: 103: Hoare triple {42527#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42523#(< main_~i~0 1024)} is VALID [2022-04-28 02:59:15,948 INFO L290 TraceCheckUtils]: 102: Hoare triple {42527#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42527#(< main_~i~0 1023)} is VALID [2022-04-28 02:59:15,949 INFO L290 TraceCheckUtils]: 101: Hoare triple {42534#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42527#(< main_~i~0 1023)} is VALID [2022-04-28 02:59:15,949 INFO L290 TraceCheckUtils]: 100: Hoare triple {42534#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42534#(< main_~i~0 1022)} is VALID [2022-04-28 02:59:15,949 INFO L290 TraceCheckUtils]: 99: Hoare triple {42541#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42534#(< main_~i~0 1022)} is VALID [2022-04-28 02:59:15,950 INFO L290 TraceCheckUtils]: 98: Hoare triple {42541#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42541#(< main_~i~0 1021)} is VALID [2022-04-28 02:59:15,950 INFO L290 TraceCheckUtils]: 97: Hoare triple {42548#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42541#(< main_~i~0 1021)} is VALID [2022-04-28 02:59:15,950 INFO L290 TraceCheckUtils]: 96: Hoare triple {42548#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42548#(< main_~i~0 1020)} is VALID [2022-04-28 02:59:15,950 INFO L290 TraceCheckUtils]: 95: Hoare triple {42555#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42548#(< main_~i~0 1020)} is VALID [2022-04-28 02:59:15,951 INFO L290 TraceCheckUtils]: 94: Hoare triple {42555#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42555#(< main_~i~0 1019)} is VALID [2022-04-28 02:59:15,951 INFO L290 TraceCheckUtils]: 93: Hoare triple {42562#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42555#(< main_~i~0 1019)} is VALID [2022-04-28 02:59:15,951 INFO L290 TraceCheckUtils]: 92: Hoare triple {42562#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42562#(< main_~i~0 1018)} is VALID [2022-04-28 02:59:15,952 INFO L290 TraceCheckUtils]: 91: Hoare triple {42569#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42562#(< main_~i~0 1018)} is VALID [2022-04-28 02:59:15,952 INFO L290 TraceCheckUtils]: 90: Hoare triple {42569#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42569#(< main_~i~0 1017)} is VALID [2022-04-28 02:59:15,952 INFO L290 TraceCheckUtils]: 89: Hoare triple {42576#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42569#(< main_~i~0 1017)} is VALID [2022-04-28 02:59:15,953 INFO L290 TraceCheckUtils]: 88: Hoare triple {42576#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42576#(< main_~i~0 1016)} is VALID [2022-04-28 02:59:15,953 INFO L290 TraceCheckUtils]: 87: Hoare triple {42583#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42576#(< main_~i~0 1016)} is VALID [2022-04-28 02:59:15,953 INFO L290 TraceCheckUtils]: 86: Hoare triple {42583#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42583#(< main_~i~0 1015)} is VALID [2022-04-28 02:59:15,954 INFO L290 TraceCheckUtils]: 85: Hoare triple {42590#(< main_~i~0 1014)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42583#(< main_~i~0 1015)} is VALID [2022-04-28 02:59:15,954 INFO L290 TraceCheckUtils]: 84: Hoare triple {42590#(< main_~i~0 1014)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42590#(< main_~i~0 1014)} is VALID [2022-04-28 02:59:15,954 INFO L290 TraceCheckUtils]: 83: Hoare triple {42597#(< main_~i~0 1013)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42590#(< main_~i~0 1014)} is VALID [2022-04-28 02:59:15,954 INFO L290 TraceCheckUtils]: 82: Hoare triple {42597#(< main_~i~0 1013)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42597#(< main_~i~0 1013)} is VALID [2022-04-28 02:59:15,955 INFO L290 TraceCheckUtils]: 81: Hoare triple {42604#(< main_~i~0 1012)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42597#(< main_~i~0 1013)} is VALID [2022-04-28 02:59:15,955 INFO L290 TraceCheckUtils]: 80: Hoare triple {42604#(< main_~i~0 1012)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42604#(< main_~i~0 1012)} is VALID [2022-04-28 02:59:15,955 INFO L290 TraceCheckUtils]: 79: Hoare triple {42611#(< main_~i~0 1011)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42604#(< main_~i~0 1012)} is VALID [2022-04-28 02:59:15,956 INFO L290 TraceCheckUtils]: 78: Hoare triple {42611#(< main_~i~0 1011)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42611#(< main_~i~0 1011)} is VALID [2022-04-28 02:59:15,956 INFO L290 TraceCheckUtils]: 77: Hoare triple {42618#(< main_~i~0 1010)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42611#(< main_~i~0 1011)} is VALID [2022-04-28 02:59:15,956 INFO L290 TraceCheckUtils]: 76: Hoare triple {42618#(< main_~i~0 1010)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42618#(< main_~i~0 1010)} is VALID [2022-04-28 02:59:15,957 INFO L290 TraceCheckUtils]: 75: Hoare triple {42625#(< main_~i~0 1009)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42618#(< main_~i~0 1010)} is VALID [2022-04-28 02:59:15,957 INFO L290 TraceCheckUtils]: 74: Hoare triple {42625#(< main_~i~0 1009)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42625#(< main_~i~0 1009)} is VALID [2022-04-28 02:59:15,957 INFO L290 TraceCheckUtils]: 73: Hoare triple {42632#(< main_~i~0 1008)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42625#(< main_~i~0 1009)} is VALID [2022-04-28 02:59:15,958 INFO L290 TraceCheckUtils]: 72: Hoare triple {42632#(< main_~i~0 1008)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42632#(< main_~i~0 1008)} is VALID [2022-04-28 02:59:15,958 INFO L290 TraceCheckUtils]: 71: Hoare triple {42639#(< main_~i~0 1007)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42632#(< main_~i~0 1008)} is VALID [2022-04-28 02:59:15,958 INFO L290 TraceCheckUtils]: 70: Hoare triple {42639#(< main_~i~0 1007)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42639#(< main_~i~0 1007)} is VALID [2022-04-28 02:59:15,959 INFO L290 TraceCheckUtils]: 69: Hoare triple {42646#(< main_~i~0 1006)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42639#(< main_~i~0 1007)} is VALID [2022-04-28 02:59:15,959 INFO L290 TraceCheckUtils]: 68: Hoare triple {42646#(< main_~i~0 1006)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42646#(< main_~i~0 1006)} is VALID [2022-04-28 02:59:15,959 INFO L290 TraceCheckUtils]: 67: Hoare triple {42653#(< main_~i~0 1005)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42646#(< main_~i~0 1006)} is VALID [2022-04-28 02:59:15,959 INFO L290 TraceCheckUtils]: 66: Hoare triple {42653#(< main_~i~0 1005)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42653#(< main_~i~0 1005)} is VALID [2022-04-28 02:59:15,960 INFO L290 TraceCheckUtils]: 65: Hoare triple {42660#(< main_~i~0 1004)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42653#(< main_~i~0 1005)} is VALID [2022-04-28 02:59:15,960 INFO L290 TraceCheckUtils]: 64: Hoare triple {42660#(< main_~i~0 1004)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42660#(< main_~i~0 1004)} is VALID [2022-04-28 02:59:15,960 INFO L290 TraceCheckUtils]: 63: Hoare triple {42667#(< main_~i~0 1003)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42660#(< main_~i~0 1004)} is VALID [2022-04-28 02:59:15,961 INFO L290 TraceCheckUtils]: 62: Hoare triple {42667#(< main_~i~0 1003)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42667#(< main_~i~0 1003)} is VALID [2022-04-28 02:59:15,961 INFO L290 TraceCheckUtils]: 61: Hoare triple {42674#(< main_~i~0 1002)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42667#(< main_~i~0 1003)} is VALID [2022-04-28 02:59:15,961 INFO L290 TraceCheckUtils]: 60: Hoare triple {42674#(< main_~i~0 1002)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42674#(< main_~i~0 1002)} is VALID [2022-04-28 02:59:15,962 INFO L290 TraceCheckUtils]: 59: Hoare triple {42681#(< main_~i~0 1001)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42674#(< main_~i~0 1002)} is VALID [2022-04-28 02:59:15,962 INFO L290 TraceCheckUtils]: 58: Hoare triple {42681#(< main_~i~0 1001)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42681#(< main_~i~0 1001)} is VALID [2022-04-28 02:59:15,962 INFO L290 TraceCheckUtils]: 57: Hoare triple {42688#(< main_~i~0 1000)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42681#(< main_~i~0 1001)} is VALID [2022-04-28 02:59:15,962 INFO L290 TraceCheckUtils]: 56: Hoare triple {42688#(< main_~i~0 1000)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42688#(< main_~i~0 1000)} is VALID [2022-04-28 02:59:15,963 INFO L290 TraceCheckUtils]: 55: Hoare triple {42695#(< main_~i~0 999)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42688#(< main_~i~0 1000)} is VALID [2022-04-28 02:59:15,963 INFO L290 TraceCheckUtils]: 54: Hoare triple {42695#(< main_~i~0 999)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42695#(< main_~i~0 999)} is VALID [2022-04-28 02:59:15,963 INFO L290 TraceCheckUtils]: 53: Hoare triple {42702#(< main_~i~0 998)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42695#(< main_~i~0 999)} is VALID [2022-04-28 02:59:15,964 INFO L290 TraceCheckUtils]: 52: Hoare triple {42702#(< main_~i~0 998)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42702#(< main_~i~0 998)} is VALID [2022-04-28 02:59:15,964 INFO L290 TraceCheckUtils]: 51: Hoare triple {42709#(< main_~i~0 997)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42702#(< main_~i~0 998)} is VALID [2022-04-28 02:59:15,964 INFO L290 TraceCheckUtils]: 50: Hoare triple {42709#(< main_~i~0 997)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42709#(< main_~i~0 997)} is VALID [2022-04-28 02:59:15,965 INFO L290 TraceCheckUtils]: 49: Hoare triple {42716#(< main_~i~0 996)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42709#(< main_~i~0 997)} is VALID [2022-04-28 02:59:15,965 INFO L290 TraceCheckUtils]: 48: Hoare triple {42716#(< main_~i~0 996)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42716#(< main_~i~0 996)} is VALID [2022-04-28 02:59:15,965 INFO L290 TraceCheckUtils]: 47: Hoare triple {42723#(< main_~i~0 995)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42716#(< main_~i~0 996)} is VALID [2022-04-28 02:59:15,966 INFO L290 TraceCheckUtils]: 46: Hoare triple {42723#(< main_~i~0 995)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42723#(< main_~i~0 995)} is VALID [2022-04-28 02:59:15,966 INFO L290 TraceCheckUtils]: 45: Hoare triple {42730#(< main_~i~0 994)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42723#(< main_~i~0 995)} is VALID [2022-04-28 02:59:15,966 INFO L290 TraceCheckUtils]: 44: Hoare triple {42730#(< main_~i~0 994)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42730#(< main_~i~0 994)} is VALID [2022-04-28 02:59:15,967 INFO L290 TraceCheckUtils]: 43: Hoare triple {42737#(< main_~i~0 993)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42730#(< main_~i~0 994)} is VALID [2022-04-28 02:59:15,967 INFO L290 TraceCheckUtils]: 42: Hoare triple {42737#(< main_~i~0 993)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42737#(< main_~i~0 993)} is VALID [2022-04-28 02:59:15,967 INFO L290 TraceCheckUtils]: 41: Hoare triple {42744#(< main_~i~0 992)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42737#(< main_~i~0 993)} is VALID [2022-04-28 02:59:15,967 INFO L290 TraceCheckUtils]: 40: Hoare triple {42744#(< main_~i~0 992)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42744#(< main_~i~0 992)} is VALID [2022-04-28 02:59:15,968 INFO L290 TraceCheckUtils]: 39: Hoare triple {42751#(< main_~i~0 991)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42744#(< main_~i~0 992)} is VALID [2022-04-28 02:59:15,968 INFO L290 TraceCheckUtils]: 38: Hoare triple {42751#(< main_~i~0 991)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42751#(< main_~i~0 991)} is VALID [2022-04-28 02:59:15,968 INFO L290 TraceCheckUtils]: 37: Hoare triple {42758#(< main_~i~0 990)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42751#(< main_~i~0 991)} is VALID [2022-04-28 02:59:15,969 INFO L290 TraceCheckUtils]: 36: Hoare triple {42758#(< main_~i~0 990)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42758#(< main_~i~0 990)} is VALID [2022-04-28 02:59:15,969 INFO L290 TraceCheckUtils]: 35: Hoare triple {42765#(< main_~i~0 989)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42758#(< main_~i~0 990)} is VALID [2022-04-28 02:59:15,969 INFO L290 TraceCheckUtils]: 34: Hoare triple {42765#(< main_~i~0 989)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42765#(< main_~i~0 989)} is VALID [2022-04-28 02:59:15,970 INFO L290 TraceCheckUtils]: 33: Hoare triple {42772#(< main_~i~0 988)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42765#(< main_~i~0 989)} is VALID [2022-04-28 02:59:15,970 INFO L290 TraceCheckUtils]: 32: Hoare triple {42772#(< main_~i~0 988)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42772#(< main_~i~0 988)} is VALID [2022-04-28 02:59:15,970 INFO L290 TraceCheckUtils]: 31: Hoare triple {42779#(< main_~i~0 987)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42772#(< main_~i~0 988)} is VALID [2022-04-28 02:59:15,971 INFO L290 TraceCheckUtils]: 30: Hoare triple {42779#(< main_~i~0 987)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42779#(< main_~i~0 987)} is VALID [2022-04-28 02:59:15,971 INFO L290 TraceCheckUtils]: 29: Hoare triple {42786#(< main_~i~0 986)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42779#(< main_~i~0 987)} is VALID [2022-04-28 02:59:15,971 INFO L290 TraceCheckUtils]: 28: Hoare triple {42786#(< main_~i~0 986)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42786#(< main_~i~0 986)} is VALID [2022-04-28 02:59:15,972 INFO L290 TraceCheckUtils]: 27: Hoare triple {42793#(< main_~i~0 985)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42786#(< main_~i~0 986)} is VALID [2022-04-28 02:59:15,972 INFO L290 TraceCheckUtils]: 26: Hoare triple {42793#(< main_~i~0 985)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42793#(< main_~i~0 985)} is VALID [2022-04-28 02:59:15,972 INFO L290 TraceCheckUtils]: 25: Hoare triple {42800#(< main_~i~0 984)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42793#(< main_~i~0 985)} is VALID [2022-04-28 02:59:15,972 INFO L290 TraceCheckUtils]: 24: Hoare triple {42800#(< main_~i~0 984)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42800#(< main_~i~0 984)} is VALID [2022-04-28 02:59:15,973 INFO L290 TraceCheckUtils]: 23: Hoare triple {42807#(< main_~i~0 983)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42800#(< main_~i~0 984)} is VALID [2022-04-28 02:59:15,973 INFO L290 TraceCheckUtils]: 22: Hoare triple {42807#(< main_~i~0 983)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42807#(< main_~i~0 983)} is VALID [2022-04-28 02:59:15,973 INFO L290 TraceCheckUtils]: 21: Hoare triple {42814#(< main_~i~0 982)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42807#(< main_~i~0 983)} is VALID [2022-04-28 02:59:15,974 INFO L290 TraceCheckUtils]: 20: Hoare triple {42814#(< main_~i~0 982)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42814#(< main_~i~0 982)} is VALID [2022-04-28 02:59:15,974 INFO L290 TraceCheckUtils]: 19: Hoare triple {42821#(< main_~i~0 981)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42814#(< main_~i~0 982)} is VALID [2022-04-28 02:59:15,974 INFO L290 TraceCheckUtils]: 18: Hoare triple {42821#(< main_~i~0 981)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42821#(< main_~i~0 981)} is VALID [2022-04-28 02:59:15,975 INFO L290 TraceCheckUtils]: 17: Hoare triple {42828#(< main_~i~0 980)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42821#(< main_~i~0 981)} is VALID [2022-04-28 02:59:15,975 INFO L290 TraceCheckUtils]: 16: Hoare triple {42828#(< main_~i~0 980)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42828#(< main_~i~0 980)} is VALID [2022-04-28 02:59:15,975 INFO L290 TraceCheckUtils]: 15: Hoare triple {42835#(< main_~i~0 979)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42828#(< main_~i~0 980)} is VALID [2022-04-28 02:59:15,976 INFO L290 TraceCheckUtils]: 14: Hoare triple {42835#(< main_~i~0 979)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42835#(< main_~i~0 979)} is VALID [2022-04-28 02:59:15,976 INFO L290 TraceCheckUtils]: 13: Hoare triple {42842#(< main_~i~0 978)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42835#(< main_~i~0 979)} is VALID [2022-04-28 02:59:15,976 INFO L290 TraceCheckUtils]: 12: Hoare triple {42842#(< main_~i~0 978)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42842#(< main_~i~0 978)} is VALID [2022-04-28 02:59:15,976 INFO L290 TraceCheckUtils]: 11: Hoare triple {42849#(< main_~i~0 977)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42842#(< main_~i~0 978)} is VALID [2022-04-28 02:59:15,977 INFO L290 TraceCheckUtils]: 10: Hoare triple {42849#(< main_~i~0 977)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42849#(< main_~i~0 977)} is VALID [2022-04-28 02:59:15,977 INFO L290 TraceCheckUtils]: 9: Hoare triple {42856#(< main_~i~0 976)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42849#(< main_~i~0 977)} is VALID [2022-04-28 02:59:15,977 INFO L290 TraceCheckUtils]: 8: Hoare triple {42856#(< main_~i~0 976)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42856#(< main_~i~0 976)} is VALID [2022-04-28 02:59:15,978 INFO L290 TraceCheckUtils]: 7: Hoare triple {42863#(< main_~i~0 975)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42856#(< main_~i~0 976)} is VALID [2022-04-28 02:59:15,978 INFO L290 TraceCheckUtils]: 6: Hoare triple {42863#(< main_~i~0 975)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42863#(< main_~i~0 975)} is VALID [2022-04-28 02:59:15,978 INFO L290 TraceCheckUtils]: 5: Hoare triple {42121#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {42863#(< main_~i~0 975)} is VALID [2022-04-28 02:59:15,978 INFO L272 TraceCheckUtils]: 4: Hoare triple {42121#true} call #t~ret6 := main(); {42121#true} is VALID [2022-04-28 02:59:15,979 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42121#true} {42121#true} #39#return; {42121#true} is VALID [2022-04-28 02:59:15,979 INFO L290 TraceCheckUtils]: 2: Hoare triple {42121#true} assume true; {42121#true} is VALID [2022-04-28 02:59:15,979 INFO L290 TraceCheckUtils]: 1: Hoare triple {42121#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {42121#true} is VALID [2022-04-28 02:59:15,979 INFO L272 TraceCheckUtils]: 0: Hoare triple {42121#true} call ULTIMATE.init(); {42121#true} is VALID [2022-04-28 02:59:15,979 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:59:15,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967857967] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:59:15,979 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:59:15,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 52, 52] total 104 [2022-04-28 02:59:15,979 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:59:15,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2114421408] [2022-04-28 02:59:15,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2114421408] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:59:15,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:59:15,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2022-04-28 02:59:15,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737838011] [2022-04-28 02:59:15,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:59:15,980 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 2.0) internal successors, (106), 52 states have internal predecessors, (106), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 110 [2022-04-28 02:59:15,980 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:59:15,980 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 53 states, 53 states have (on average 2.0) internal successors, (106), 52 states have internal predecessors, (106), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:16,048 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:59:16,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-04-28 02:59:16,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:59:16,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-04-28 02:59:16,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5255, Invalid=5457, Unknown=0, NotChecked=0, Total=10712 [2022-04-28 02:59:16,049 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand has 53 states, 53 states have (on average 2.0) internal successors, (106), 52 states have internal predecessors, (106), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:17,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:59:17,915 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2022-04-28 02:59:17,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-04-28 02:59:17,915 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 2.0) internal successors, (106), 52 states have internal predecessors, (106), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 110 [2022-04-28 02:59:17,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:59:17,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 2.0) internal successors, (106), 52 states have internal predecessors, (106), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:17,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 120 transitions. [2022-04-28 02:59:17,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 2.0) internal successors, (106), 52 states have internal predecessors, (106), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:17,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 120 transitions. [2022-04-28 02:59:17,916 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 120 transitions. [2022-04-28 02:59:18,002 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:59:18,003 INFO L225 Difference]: With dead ends: 120 [2022-04-28 02:59:18,003 INFO L226 Difference]: Without dead ends: 114 [2022-04-28 02:59:18,004 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1518 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=10406, Invalid=13156, Unknown=0, NotChecked=0, Total=23562 [2022-04-28 02:59:18,004 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 108 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:59:18,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 39 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:59:18,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-04-28 02:59:18,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2022-04-28 02:59:18,540 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:59:18,540 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand has 113 states, 108 states have (on average 1.0092592592592593) internal successors, (109), 108 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:18,540 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand has 113 states, 108 states have (on average 1.0092592592592593) internal successors, (109), 108 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:18,540 INFO L87 Difference]: Start difference. First operand 114 states. Second operand has 113 states, 108 states have (on average 1.0092592592592593) internal successors, (109), 108 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:18,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:59:18,541 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2022-04-28 02:59:18,541 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2022-04-28 02:59:18,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:59:18,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:59:18,541 INFO L74 IsIncluded]: Start isIncluded. First operand has 113 states, 108 states have (on average 1.0092592592592593) internal successors, (109), 108 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 114 states. [2022-04-28 02:59:18,541 INFO L87 Difference]: Start difference. First operand has 113 states, 108 states have (on average 1.0092592592592593) internal successors, (109), 108 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 114 states. [2022-04-28 02:59:18,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:59:18,542 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2022-04-28 02:59:18,542 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2022-04-28 02:59:18,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:59:18,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:59:18,542 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:59:18,542 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:59:18,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 108 states have (on average 1.0092592592592593) internal successors, (109), 108 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:18,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2022-04-28 02:59:18,543 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 110 [2022-04-28 02:59:18,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:59:18,544 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2022-04-28 02:59:18,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 2.0) internal successors, (106), 52 states have internal predecessors, (106), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:18,544 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 113 states and 113 transitions. [2022-04-28 02:59:18,677 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:59:18,678 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2022-04-28 02:59:18,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-04-28 02:59:18,678 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:59:18,678 INFO L195 NwaCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:59:18,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2022-04-28 02:59:18,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-04-28 02:59:18,879 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:59:18,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:59:18,879 INFO L85 PathProgramCache]: Analyzing trace with hash 255839582, now seen corresponding path program 99 times [2022-04-28 02:59:18,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:59:18,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [728149275] [2022-04-28 02:59:18,881 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:59:18,881 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:59:18,881 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:59:18,881 INFO L85 PathProgramCache]: Analyzing trace with hash 255839582, now seen corresponding path program 100 times [2022-04-28 02:59:18,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:59:18,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411684870] [2022-04-28 02:59:18,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:59:18,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:59:18,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:59:19,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:59:19,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:59:19,862 INFO L290 TraceCheckUtils]: 0: Hoare triple {43737#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {43681#true} is VALID [2022-04-28 02:59:19,862 INFO L290 TraceCheckUtils]: 1: Hoare triple {43681#true} assume true; {43681#true} is VALID [2022-04-28 02:59:19,862 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43681#true} {43681#true} #39#return; {43681#true} is VALID [2022-04-28 02:59:19,863 INFO L272 TraceCheckUtils]: 0: Hoare triple {43681#true} call ULTIMATE.init(); {43737#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:59:19,863 INFO L290 TraceCheckUtils]: 1: Hoare triple {43737#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {43681#true} is VALID [2022-04-28 02:59:19,863 INFO L290 TraceCheckUtils]: 2: Hoare triple {43681#true} assume true; {43681#true} is VALID [2022-04-28 02:59:19,863 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43681#true} {43681#true} #39#return; {43681#true} is VALID [2022-04-28 02:59:19,863 INFO L272 TraceCheckUtils]: 4: Hoare triple {43681#true} call #t~ret6 := main(); {43681#true} is VALID [2022-04-28 02:59:19,863 INFO L290 TraceCheckUtils]: 5: Hoare triple {43681#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {43686#(= main_~i~0 0)} is VALID [2022-04-28 02:59:19,864 INFO L290 TraceCheckUtils]: 6: Hoare triple {43686#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43686#(= main_~i~0 0)} is VALID [2022-04-28 02:59:19,864 INFO L290 TraceCheckUtils]: 7: Hoare triple {43686#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43687#(<= main_~i~0 1)} is VALID [2022-04-28 02:59:19,864 INFO L290 TraceCheckUtils]: 8: Hoare triple {43687#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43687#(<= main_~i~0 1)} is VALID [2022-04-28 02:59:19,864 INFO L290 TraceCheckUtils]: 9: Hoare triple {43687#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43688#(<= main_~i~0 2)} is VALID [2022-04-28 02:59:19,865 INFO L290 TraceCheckUtils]: 10: Hoare triple {43688#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43688#(<= main_~i~0 2)} is VALID [2022-04-28 02:59:19,865 INFO L290 TraceCheckUtils]: 11: Hoare triple {43688#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43689#(<= main_~i~0 3)} is VALID [2022-04-28 02:59:19,865 INFO L290 TraceCheckUtils]: 12: Hoare triple {43689#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43689#(<= main_~i~0 3)} is VALID [2022-04-28 02:59:19,866 INFO L290 TraceCheckUtils]: 13: Hoare triple {43689#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43690#(<= main_~i~0 4)} is VALID [2022-04-28 02:59:19,866 INFO L290 TraceCheckUtils]: 14: Hoare triple {43690#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43690#(<= main_~i~0 4)} is VALID [2022-04-28 02:59:19,866 INFO L290 TraceCheckUtils]: 15: Hoare triple {43690#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43691#(<= main_~i~0 5)} is VALID [2022-04-28 02:59:19,867 INFO L290 TraceCheckUtils]: 16: Hoare triple {43691#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43691#(<= main_~i~0 5)} is VALID [2022-04-28 02:59:19,867 INFO L290 TraceCheckUtils]: 17: Hoare triple {43691#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43692#(<= main_~i~0 6)} is VALID [2022-04-28 02:59:19,867 INFO L290 TraceCheckUtils]: 18: Hoare triple {43692#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43692#(<= main_~i~0 6)} is VALID [2022-04-28 02:59:19,868 INFO L290 TraceCheckUtils]: 19: Hoare triple {43692#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43693#(<= main_~i~0 7)} is VALID [2022-04-28 02:59:19,868 INFO L290 TraceCheckUtils]: 20: Hoare triple {43693#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43693#(<= main_~i~0 7)} is VALID [2022-04-28 02:59:19,868 INFO L290 TraceCheckUtils]: 21: Hoare triple {43693#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43694#(<= main_~i~0 8)} is VALID [2022-04-28 02:59:19,868 INFO L290 TraceCheckUtils]: 22: Hoare triple {43694#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43694#(<= main_~i~0 8)} is VALID [2022-04-28 02:59:19,869 INFO L290 TraceCheckUtils]: 23: Hoare triple {43694#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43695#(<= main_~i~0 9)} is VALID [2022-04-28 02:59:19,869 INFO L290 TraceCheckUtils]: 24: Hoare triple {43695#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43695#(<= main_~i~0 9)} is VALID [2022-04-28 02:59:19,869 INFO L290 TraceCheckUtils]: 25: Hoare triple {43695#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43696#(<= main_~i~0 10)} is VALID [2022-04-28 02:59:19,870 INFO L290 TraceCheckUtils]: 26: Hoare triple {43696#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43696#(<= main_~i~0 10)} is VALID [2022-04-28 02:59:19,870 INFO L290 TraceCheckUtils]: 27: Hoare triple {43696#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43697#(<= main_~i~0 11)} is VALID [2022-04-28 02:59:19,870 INFO L290 TraceCheckUtils]: 28: Hoare triple {43697#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43697#(<= main_~i~0 11)} is VALID [2022-04-28 02:59:19,871 INFO L290 TraceCheckUtils]: 29: Hoare triple {43697#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43698#(<= main_~i~0 12)} is VALID [2022-04-28 02:59:19,871 INFO L290 TraceCheckUtils]: 30: Hoare triple {43698#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43698#(<= main_~i~0 12)} is VALID [2022-04-28 02:59:19,871 INFO L290 TraceCheckUtils]: 31: Hoare triple {43698#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43699#(<= main_~i~0 13)} is VALID [2022-04-28 02:59:19,871 INFO L290 TraceCheckUtils]: 32: Hoare triple {43699#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43699#(<= main_~i~0 13)} is VALID [2022-04-28 02:59:19,872 INFO L290 TraceCheckUtils]: 33: Hoare triple {43699#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43700#(<= main_~i~0 14)} is VALID [2022-04-28 02:59:19,872 INFO L290 TraceCheckUtils]: 34: Hoare triple {43700#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43700#(<= main_~i~0 14)} is VALID [2022-04-28 02:59:19,872 INFO L290 TraceCheckUtils]: 35: Hoare triple {43700#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43701#(<= main_~i~0 15)} is VALID [2022-04-28 02:59:19,873 INFO L290 TraceCheckUtils]: 36: Hoare triple {43701#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43701#(<= main_~i~0 15)} is VALID [2022-04-28 02:59:19,873 INFO L290 TraceCheckUtils]: 37: Hoare triple {43701#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43702#(<= main_~i~0 16)} is VALID [2022-04-28 02:59:19,873 INFO L290 TraceCheckUtils]: 38: Hoare triple {43702#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43702#(<= main_~i~0 16)} is VALID [2022-04-28 02:59:19,874 INFO L290 TraceCheckUtils]: 39: Hoare triple {43702#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43703#(<= main_~i~0 17)} is VALID [2022-04-28 02:59:19,874 INFO L290 TraceCheckUtils]: 40: Hoare triple {43703#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43703#(<= main_~i~0 17)} is VALID [2022-04-28 02:59:19,874 INFO L290 TraceCheckUtils]: 41: Hoare triple {43703#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43704#(<= main_~i~0 18)} is VALID [2022-04-28 02:59:19,874 INFO L290 TraceCheckUtils]: 42: Hoare triple {43704#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43704#(<= main_~i~0 18)} is VALID [2022-04-28 02:59:19,875 INFO L290 TraceCheckUtils]: 43: Hoare triple {43704#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43705#(<= main_~i~0 19)} is VALID [2022-04-28 02:59:19,875 INFO L290 TraceCheckUtils]: 44: Hoare triple {43705#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43705#(<= main_~i~0 19)} is VALID [2022-04-28 02:59:19,875 INFO L290 TraceCheckUtils]: 45: Hoare triple {43705#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43706#(<= main_~i~0 20)} is VALID [2022-04-28 02:59:19,876 INFO L290 TraceCheckUtils]: 46: Hoare triple {43706#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43706#(<= main_~i~0 20)} is VALID [2022-04-28 02:59:19,876 INFO L290 TraceCheckUtils]: 47: Hoare triple {43706#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43707#(<= main_~i~0 21)} is VALID [2022-04-28 02:59:19,876 INFO L290 TraceCheckUtils]: 48: Hoare triple {43707#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43707#(<= main_~i~0 21)} is VALID [2022-04-28 02:59:19,877 INFO L290 TraceCheckUtils]: 49: Hoare triple {43707#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43708#(<= main_~i~0 22)} is VALID [2022-04-28 02:59:19,877 INFO L290 TraceCheckUtils]: 50: Hoare triple {43708#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43708#(<= main_~i~0 22)} is VALID [2022-04-28 02:59:19,877 INFO L290 TraceCheckUtils]: 51: Hoare triple {43708#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43709#(<= main_~i~0 23)} is VALID [2022-04-28 02:59:19,877 INFO L290 TraceCheckUtils]: 52: Hoare triple {43709#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43709#(<= main_~i~0 23)} is VALID [2022-04-28 02:59:19,878 INFO L290 TraceCheckUtils]: 53: Hoare triple {43709#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43710#(<= main_~i~0 24)} is VALID [2022-04-28 02:59:19,878 INFO L290 TraceCheckUtils]: 54: Hoare triple {43710#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43710#(<= main_~i~0 24)} is VALID [2022-04-28 02:59:19,878 INFO L290 TraceCheckUtils]: 55: Hoare triple {43710#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43711#(<= main_~i~0 25)} is VALID [2022-04-28 02:59:19,879 INFO L290 TraceCheckUtils]: 56: Hoare triple {43711#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43711#(<= main_~i~0 25)} is VALID [2022-04-28 02:59:19,879 INFO L290 TraceCheckUtils]: 57: Hoare triple {43711#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43712#(<= main_~i~0 26)} is VALID [2022-04-28 02:59:19,879 INFO L290 TraceCheckUtils]: 58: Hoare triple {43712#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43712#(<= main_~i~0 26)} is VALID [2022-04-28 02:59:19,880 INFO L290 TraceCheckUtils]: 59: Hoare triple {43712#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43713#(<= main_~i~0 27)} is VALID [2022-04-28 02:59:19,880 INFO L290 TraceCheckUtils]: 60: Hoare triple {43713#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43713#(<= main_~i~0 27)} is VALID [2022-04-28 02:59:19,880 INFO L290 TraceCheckUtils]: 61: Hoare triple {43713#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43714#(<= main_~i~0 28)} is VALID [2022-04-28 02:59:19,881 INFO L290 TraceCheckUtils]: 62: Hoare triple {43714#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43714#(<= main_~i~0 28)} is VALID [2022-04-28 02:59:19,881 INFO L290 TraceCheckUtils]: 63: Hoare triple {43714#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43715#(<= main_~i~0 29)} is VALID [2022-04-28 02:59:19,881 INFO L290 TraceCheckUtils]: 64: Hoare triple {43715#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43715#(<= main_~i~0 29)} is VALID [2022-04-28 02:59:19,881 INFO L290 TraceCheckUtils]: 65: Hoare triple {43715#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43716#(<= main_~i~0 30)} is VALID [2022-04-28 02:59:19,882 INFO L290 TraceCheckUtils]: 66: Hoare triple {43716#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43716#(<= main_~i~0 30)} is VALID [2022-04-28 02:59:19,882 INFO L290 TraceCheckUtils]: 67: Hoare triple {43716#(<= main_~i~0 30)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43717#(<= main_~i~0 31)} is VALID [2022-04-28 02:59:19,882 INFO L290 TraceCheckUtils]: 68: Hoare triple {43717#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43717#(<= main_~i~0 31)} is VALID [2022-04-28 02:59:19,883 INFO L290 TraceCheckUtils]: 69: Hoare triple {43717#(<= main_~i~0 31)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43718#(<= main_~i~0 32)} is VALID [2022-04-28 02:59:19,883 INFO L290 TraceCheckUtils]: 70: Hoare triple {43718#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43718#(<= main_~i~0 32)} is VALID [2022-04-28 02:59:19,883 INFO L290 TraceCheckUtils]: 71: Hoare triple {43718#(<= main_~i~0 32)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43719#(<= main_~i~0 33)} is VALID [2022-04-28 02:59:19,884 INFO L290 TraceCheckUtils]: 72: Hoare triple {43719#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43719#(<= main_~i~0 33)} is VALID [2022-04-28 02:59:19,884 INFO L290 TraceCheckUtils]: 73: Hoare triple {43719#(<= main_~i~0 33)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43720#(<= main_~i~0 34)} is VALID [2022-04-28 02:59:19,884 INFO L290 TraceCheckUtils]: 74: Hoare triple {43720#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43720#(<= main_~i~0 34)} is VALID [2022-04-28 02:59:19,884 INFO L290 TraceCheckUtils]: 75: Hoare triple {43720#(<= main_~i~0 34)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43721#(<= main_~i~0 35)} is VALID [2022-04-28 02:59:19,885 INFO L290 TraceCheckUtils]: 76: Hoare triple {43721#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43721#(<= main_~i~0 35)} is VALID [2022-04-28 02:59:19,885 INFO L290 TraceCheckUtils]: 77: Hoare triple {43721#(<= main_~i~0 35)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43722#(<= main_~i~0 36)} is VALID [2022-04-28 02:59:19,885 INFO L290 TraceCheckUtils]: 78: Hoare triple {43722#(<= main_~i~0 36)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43722#(<= main_~i~0 36)} is VALID [2022-04-28 02:59:19,886 INFO L290 TraceCheckUtils]: 79: Hoare triple {43722#(<= main_~i~0 36)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43723#(<= main_~i~0 37)} is VALID [2022-04-28 02:59:19,886 INFO L290 TraceCheckUtils]: 80: Hoare triple {43723#(<= main_~i~0 37)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43723#(<= main_~i~0 37)} is VALID [2022-04-28 02:59:19,886 INFO L290 TraceCheckUtils]: 81: Hoare triple {43723#(<= main_~i~0 37)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43724#(<= main_~i~0 38)} is VALID [2022-04-28 02:59:19,887 INFO L290 TraceCheckUtils]: 82: Hoare triple {43724#(<= main_~i~0 38)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43724#(<= main_~i~0 38)} is VALID [2022-04-28 02:59:19,887 INFO L290 TraceCheckUtils]: 83: Hoare triple {43724#(<= main_~i~0 38)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43725#(<= main_~i~0 39)} is VALID [2022-04-28 02:59:19,887 INFO L290 TraceCheckUtils]: 84: Hoare triple {43725#(<= main_~i~0 39)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43725#(<= main_~i~0 39)} is VALID [2022-04-28 02:59:19,888 INFO L290 TraceCheckUtils]: 85: Hoare triple {43725#(<= main_~i~0 39)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43726#(<= main_~i~0 40)} is VALID [2022-04-28 02:59:19,888 INFO L290 TraceCheckUtils]: 86: Hoare triple {43726#(<= main_~i~0 40)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43726#(<= main_~i~0 40)} is VALID [2022-04-28 02:59:19,888 INFO L290 TraceCheckUtils]: 87: Hoare triple {43726#(<= main_~i~0 40)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43727#(<= main_~i~0 41)} is VALID [2022-04-28 02:59:19,888 INFO L290 TraceCheckUtils]: 88: Hoare triple {43727#(<= main_~i~0 41)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43727#(<= main_~i~0 41)} is VALID [2022-04-28 02:59:19,889 INFO L290 TraceCheckUtils]: 89: Hoare triple {43727#(<= main_~i~0 41)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43728#(<= main_~i~0 42)} is VALID [2022-04-28 02:59:19,889 INFO L290 TraceCheckUtils]: 90: Hoare triple {43728#(<= main_~i~0 42)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43728#(<= main_~i~0 42)} is VALID [2022-04-28 02:59:19,889 INFO L290 TraceCheckUtils]: 91: Hoare triple {43728#(<= main_~i~0 42)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43729#(<= main_~i~0 43)} is VALID [2022-04-28 02:59:19,890 INFO L290 TraceCheckUtils]: 92: Hoare triple {43729#(<= main_~i~0 43)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43729#(<= main_~i~0 43)} is VALID [2022-04-28 02:59:19,890 INFO L290 TraceCheckUtils]: 93: Hoare triple {43729#(<= main_~i~0 43)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43730#(<= main_~i~0 44)} is VALID [2022-04-28 02:59:19,890 INFO L290 TraceCheckUtils]: 94: Hoare triple {43730#(<= main_~i~0 44)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43730#(<= main_~i~0 44)} is VALID [2022-04-28 02:59:19,891 INFO L290 TraceCheckUtils]: 95: Hoare triple {43730#(<= main_~i~0 44)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43731#(<= main_~i~0 45)} is VALID [2022-04-28 02:59:19,891 INFO L290 TraceCheckUtils]: 96: Hoare triple {43731#(<= main_~i~0 45)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43731#(<= main_~i~0 45)} is VALID [2022-04-28 02:59:19,891 INFO L290 TraceCheckUtils]: 97: Hoare triple {43731#(<= main_~i~0 45)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43732#(<= main_~i~0 46)} is VALID [2022-04-28 02:59:19,891 INFO L290 TraceCheckUtils]: 98: Hoare triple {43732#(<= main_~i~0 46)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43732#(<= main_~i~0 46)} is VALID [2022-04-28 02:59:19,892 INFO L290 TraceCheckUtils]: 99: Hoare triple {43732#(<= main_~i~0 46)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43733#(<= main_~i~0 47)} is VALID [2022-04-28 02:59:19,892 INFO L290 TraceCheckUtils]: 100: Hoare triple {43733#(<= main_~i~0 47)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43733#(<= main_~i~0 47)} is VALID [2022-04-28 02:59:19,892 INFO L290 TraceCheckUtils]: 101: Hoare triple {43733#(<= main_~i~0 47)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43734#(<= main_~i~0 48)} is VALID [2022-04-28 02:59:19,893 INFO L290 TraceCheckUtils]: 102: Hoare triple {43734#(<= main_~i~0 48)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43734#(<= main_~i~0 48)} is VALID [2022-04-28 02:59:19,893 INFO L290 TraceCheckUtils]: 103: Hoare triple {43734#(<= main_~i~0 48)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43735#(<= main_~i~0 49)} is VALID [2022-04-28 02:59:19,893 INFO L290 TraceCheckUtils]: 104: Hoare triple {43735#(<= main_~i~0 49)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43735#(<= main_~i~0 49)} is VALID [2022-04-28 02:59:19,894 INFO L290 TraceCheckUtils]: 105: Hoare triple {43735#(<= main_~i~0 49)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43736#(<= main_~i~0 50)} is VALID [2022-04-28 02:59:19,894 INFO L290 TraceCheckUtils]: 106: Hoare triple {43736#(<= main_~i~0 50)} assume !(~i~0 < 1024); {43682#false} is VALID [2022-04-28 02:59:19,894 INFO L290 TraceCheckUtils]: 107: Hoare triple {43682#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {43682#false} is VALID [2022-04-28 02:59:19,894 INFO L272 TraceCheckUtils]: 108: Hoare triple {43682#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {43682#false} is VALID [2022-04-28 02:59:19,894 INFO L290 TraceCheckUtils]: 109: Hoare triple {43682#false} ~cond := #in~cond; {43682#false} is VALID [2022-04-28 02:59:19,894 INFO L290 TraceCheckUtils]: 110: Hoare triple {43682#false} assume 0 == ~cond; {43682#false} is VALID [2022-04-28 02:59:19,894 INFO L290 TraceCheckUtils]: 111: Hoare triple {43682#false} assume !false; {43682#false} is VALID [2022-04-28 02:59:19,894 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:59:19,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:59:19,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411684870] [2022-04-28 02:59:19,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411684870] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:59:19,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175043602] [2022-04-28 02:59:19,895 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 02:59:19,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:59:19,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:59:19,896 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:59:19,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-04-28 02:59:20,225 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 02:59:20,225 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:59:20,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 52 conjunts are in the unsatisfiable core [2022-04-28 02:59:20,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:59:20,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:59:20,876 INFO L272 TraceCheckUtils]: 0: Hoare triple {43681#true} call ULTIMATE.init(); {43681#true} is VALID [2022-04-28 02:59:20,876 INFO L290 TraceCheckUtils]: 1: Hoare triple {43681#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {43681#true} is VALID [2022-04-28 02:59:20,876 INFO L290 TraceCheckUtils]: 2: Hoare triple {43681#true} assume true; {43681#true} is VALID [2022-04-28 02:59:20,876 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43681#true} {43681#true} #39#return; {43681#true} is VALID [2022-04-28 02:59:20,876 INFO L272 TraceCheckUtils]: 4: Hoare triple {43681#true} call #t~ret6 := main(); {43681#true} is VALID [2022-04-28 02:59:20,877 INFO L290 TraceCheckUtils]: 5: Hoare triple {43681#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {43756#(<= main_~i~0 0)} is VALID [2022-04-28 02:59:20,877 INFO L290 TraceCheckUtils]: 6: Hoare triple {43756#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43756#(<= main_~i~0 0)} is VALID [2022-04-28 02:59:20,877 INFO L290 TraceCheckUtils]: 7: Hoare triple {43756#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43687#(<= main_~i~0 1)} is VALID [2022-04-28 02:59:20,877 INFO L290 TraceCheckUtils]: 8: Hoare triple {43687#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43687#(<= main_~i~0 1)} is VALID [2022-04-28 02:59:20,878 INFO L290 TraceCheckUtils]: 9: Hoare triple {43687#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43688#(<= main_~i~0 2)} is VALID [2022-04-28 02:59:20,878 INFO L290 TraceCheckUtils]: 10: Hoare triple {43688#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43688#(<= main_~i~0 2)} is VALID [2022-04-28 02:59:20,878 INFO L290 TraceCheckUtils]: 11: Hoare triple {43688#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43689#(<= main_~i~0 3)} is VALID [2022-04-28 02:59:20,879 INFO L290 TraceCheckUtils]: 12: Hoare triple {43689#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43689#(<= main_~i~0 3)} is VALID [2022-04-28 02:59:20,879 INFO L290 TraceCheckUtils]: 13: Hoare triple {43689#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43690#(<= main_~i~0 4)} is VALID [2022-04-28 02:59:20,879 INFO L290 TraceCheckUtils]: 14: Hoare triple {43690#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43690#(<= main_~i~0 4)} is VALID [2022-04-28 02:59:20,880 INFO L290 TraceCheckUtils]: 15: Hoare triple {43690#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43691#(<= main_~i~0 5)} is VALID [2022-04-28 02:59:20,880 INFO L290 TraceCheckUtils]: 16: Hoare triple {43691#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43691#(<= main_~i~0 5)} is VALID [2022-04-28 02:59:20,880 INFO L290 TraceCheckUtils]: 17: Hoare triple {43691#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43692#(<= main_~i~0 6)} is VALID [2022-04-28 02:59:20,880 INFO L290 TraceCheckUtils]: 18: Hoare triple {43692#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43692#(<= main_~i~0 6)} is VALID [2022-04-28 02:59:20,881 INFO L290 TraceCheckUtils]: 19: Hoare triple {43692#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43693#(<= main_~i~0 7)} is VALID [2022-04-28 02:59:20,881 INFO L290 TraceCheckUtils]: 20: Hoare triple {43693#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43693#(<= main_~i~0 7)} is VALID [2022-04-28 02:59:20,881 INFO L290 TraceCheckUtils]: 21: Hoare triple {43693#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43694#(<= main_~i~0 8)} is VALID [2022-04-28 02:59:20,882 INFO L290 TraceCheckUtils]: 22: Hoare triple {43694#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43694#(<= main_~i~0 8)} is VALID [2022-04-28 02:59:20,882 INFO L290 TraceCheckUtils]: 23: Hoare triple {43694#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43695#(<= main_~i~0 9)} is VALID [2022-04-28 02:59:20,882 INFO L290 TraceCheckUtils]: 24: Hoare triple {43695#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43695#(<= main_~i~0 9)} is VALID [2022-04-28 02:59:20,883 INFO L290 TraceCheckUtils]: 25: Hoare triple {43695#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43696#(<= main_~i~0 10)} is VALID [2022-04-28 02:59:20,883 INFO L290 TraceCheckUtils]: 26: Hoare triple {43696#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43696#(<= main_~i~0 10)} is VALID [2022-04-28 02:59:20,883 INFO L290 TraceCheckUtils]: 27: Hoare triple {43696#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43697#(<= main_~i~0 11)} is VALID [2022-04-28 02:59:20,884 INFO L290 TraceCheckUtils]: 28: Hoare triple {43697#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43697#(<= main_~i~0 11)} is VALID [2022-04-28 02:59:20,884 INFO L290 TraceCheckUtils]: 29: Hoare triple {43697#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43698#(<= main_~i~0 12)} is VALID [2022-04-28 02:59:20,884 INFO L290 TraceCheckUtils]: 30: Hoare triple {43698#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43698#(<= main_~i~0 12)} is VALID [2022-04-28 02:59:20,885 INFO L290 TraceCheckUtils]: 31: Hoare triple {43698#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43699#(<= main_~i~0 13)} is VALID [2022-04-28 02:59:20,885 INFO L290 TraceCheckUtils]: 32: Hoare triple {43699#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43699#(<= main_~i~0 13)} is VALID [2022-04-28 02:59:20,885 INFO L290 TraceCheckUtils]: 33: Hoare triple {43699#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43700#(<= main_~i~0 14)} is VALID [2022-04-28 02:59:20,885 INFO L290 TraceCheckUtils]: 34: Hoare triple {43700#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43700#(<= main_~i~0 14)} is VALID [2022-04-28 02:59:20,886 INFO L290 TraceCheckUtils]: 35: Hoare triple {43700#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43701#(<= main_~i~0 15)} is VALID [2022-04-28 02:59:20,886 INFO L290 TraceCheckUtils]: 36: Hoare triple {43701#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43701#(<= main_~i~0 15)} is VALID [2022-04-28 02:59:20,886 INFO L290 TraceCheckUtils]: 37: Hoare triple {43701#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43702#(<= main_~i~0 16)} is VALID [2022-04-28 02:59:20,887 INFO L290 TraceCheckUtils]: 38: Hoare triple {43702#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43702#(<= main_~i~0 16)} is VALID [2022-04-28 02:59:20,887 INFO L290 TraceCheckUtils]: 39: Hoare triple {43702#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43703#(<= main_~i~0 17)} is VALID [2022-04-28 02:59:20,887 INFO L290 TraceCheckUtils]: 40: Hoare triple {43703#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43703#(<= main_~i~0 17)} is VALID [2022-04-28 02:59:20,888 INFO L290 TraceCheckUtils]: 41: Hoare triple {43703#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43704#(<= main_~i~0 18)} is VALID [2022-04-28 02:59:20,888 INFO L290 TraceCheckUtils]: 42: Hoare triple {43704#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43704#(<= main_~i~0 18)} is VALID [2022-04-28 02:59:20,888 INFO L290 TraceCheckUtils]: 43: Hoare triple {43704#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43705#(<= main_~i~0 19)} is VALID [2022-04-28 02:59:20,889 INFO L290 TraceCheckUtils]: 44: Hoare triple {43705#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43705#(<= main_~i~0 19)} is VALID [2022-04-28 02:59:20,889 INFO L290 TraceCheckUtils]: 45: Hoare triple {43705#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43706#(<= main_~i~0 20)} is VALID [2022-04-28 02:59:20,889 INFO L290 TraceCheckUtils]: 46: Hoare triple {43706#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43706#(<= main_~i~0 20)} is VALID [2022-04-28 02:59:20,889 INFO L290 TraceCheckUtils]: 47: Hoare triple {43706#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43707#(<= main_~i~0 21)} is VALID [2022-04-28 02:59:20,890 INFO L290 TraceCheckUtils]: 48: Hoare triple {43707#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43707#(<= main_~i~0 21)} is VALID [2022-04-28 02:59:20,890 INFO L290 TraceCheckUtils]: 49: Hoare triple {43707#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43708#(<= main_~i~0 22)} is VALID [2022-04-28 02:59:20,890 INFO L290 TraceCheckUtils]: 50: Hoare triple {43708#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43708#(<= main_~i~0 22)} is VALID [2022-04-28 02:59:20,891 INFO L290 TraceCheckUtils]: 51: Hoare triple {43708#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43709#(<= main_~i~0 23)} is VALID [2022-04-28 02:59:20,891 INFO L290 TraceCheckUtils]: 52: Hoare triple {43709#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43709#(<= main_~i~0 23)} is VALID [2022-04-28 02:59:20,891 INFO L290 TraceCheckUtils]: 53: Hoare triple {43709#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43710#(<= main_~i~0 24)} is VALID [2022-04-28 02:59:20,892 INFO L290 TraceCheckUtils]: 54: Hoare triple {43710#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43710#(<= main_~i~0 24)} is VALID [2022-04-28 02:59:20,892 INFO L290 TraceCheckUtils]: 55: Hoare triple {43710#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43711#(<= main_~i~0 25)} is VALID [2022-04-28 02:59:20,892 INFO L290 TraceCheckUtils]: 56: Hoare triple {43711#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43711#(<= main_~i~0 25)} is VALID [2022-04-28 02:59:20,893 INFO L290 TraceCheckUtils]: 57: Hoare triple {43711#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43712#(<= main_~i~0 26)} is VALID [2022-04-28 02:59:20,893 INFO L290 TraceCheckUtils]: 58: Hoare triple {43712#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43712#(<= main_~i~0 26)} is VALID [2022-04-28 02:59:20,893 INFO L290 TraceCheckUtils]: 59: Hoare triple {43712#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43713#(<= main_~i~0 27)} is VALID [2022-04-28 02:59:20,893 INFO L290 TraceCheckUtils]: 60: Hoare triple {43713#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43713#(<= main_~i~0 27)} is VALID [2022-04-28 02:59:20,894 INFO L290 TraceCheckUtils]: 61: Hoare triple {43713#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43714#(<= main_~i~0 28)} is VALID [2022-04-28 02:59:20,894 INFO L290 TraceCheckUtils]: 62: Hoare triple {43714#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43714#(<= main_~i~0 28)} is VALID [2022-04-28 02:59:20,894 INFO L290 TraceCheckUtils]: 63: Hoare triple {43714#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43715#(<= main_~i~0 29)} is VALID [2022-04-28 02:59:20,895 INFO L290 TraceCheckUtils]: 64: Hoare triple {43715#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43715#(<= main_~i~0 29)} is VALID [2022-04-28 02:59:20,895 INFO L290 TraceCheckUtils]: 65: Hoare triple {43715#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43716#(<= main_~i~0 30)} is VALID [2022-04-28 02:59:20,895 INFO L290 TraceCheckUtils]: 66: Hoare triple {43716#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43716#(<= main_~i~0 30)} is VALID [2022-04-28 02:59:20,896 INFO L290 TraceCheckUtils]: 67: Hoare triple {43716#(<= main_~i~0 30)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43717#(<= main_~i~0 31)} is VALID [2022-04-28 02:59:20,896 INFO L290 TraceCheckUtils]: 68: Hoare triple {43717#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43717#(<= main_~i~0 31)} is VALID [2022-04-28 02:59:20,896 INFO L290 TraceCheckUtils]: 69: Hoare triple {43717#(<= main_~i~0 31)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43718#(<= main_~i~0 32)} is VALID [2022-04-28 02:59:20,896 INFO L290 TraceCheckUtils]: 70: Hoare triple {43718#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43718#(<= main_~i~0 32)} is VALID [2022-04-28 02:59:20,897 INFO L290 TraceCheckUtils]: 71: Hoare triple {43718#(<= main_~i~0 32)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43719#(<= main_~i~0 33)} is VALID [2022-04-28 02:59:20,897 INFO L290 TraceCheckUtils]: 72: Hoare triple {43719#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43719#(<= main_~i~0 33)} is VALID [2022-04-28 02:59:20,897 INFO L290 TraceCheckUtils]: 73: Hoare triple {43719#(<= main_~i~0 33)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43720#(<= main_~i~0 34)} is VALID [2022-04-28 02:59:20,898 INFO L290 TraceCheckUtils]: 74: Hoare triple {43720#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43720#(<= main_~i~0 34)} is VALID [2022-04-28 02:59:20,898 INFO L290 TraceCheckUtils]: 75: Hoare triple {43720#(<= main_~i~0 34)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43721#(<= main_~i~0 35)} is VALID [2022-04-28 02:59:20,898 INFO L290 TraceCheckUtils]: 76: Hoare triple {43721#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43721#(<= main_~i~0 35)} is VALID [2022-04-28 02:59:20,899 INFO L290 TraceCheckUtils]: 77: Hoare triple {43721#(<= main_~i~0 35)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43722#(<= main_~i~0 36)} is VALID [2022-04-28 02:59:20,899 INFO L290 TraceCheckUtils]: 78: Hoare triple {43722#(<= main_~i~0 36)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43722#(<= main_~i~0 36)} is VALID [2022-04-28 02:59:20,899 INFO L290 TraceCheckUtils]: 79: Hoare triple {43722#(<= main_~i~0 36)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43723#(<= main_~i~0 37)} is VALID [2022-04-28 02:59:20,900 INFO L290 TraceCheckUtils]: 80: Hoare triple {43723#(<= main_~i~0 37)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43723#(<= main_~i~0 37)} is VALID [2022-04-28 02:59:20,900 INFO L290 TraceCheckUtils]: 81: Hoare triple {43723#(<= main_~i~0 37)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43724#(<= main_~i~0 38)} is VALID [2022-04-28 02:59:20,900 INFO L290 TraceCheckUtils]: 82: Hoare triple {43724#(<= main_~i~0 38)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43724#(<= main_~i~0 38)} is VALID [2022-04-28 02:59:20,901 INFO L290 TraceCheckUtils]: 83: Hoare triple {43724#(<= main_~i~0 38)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43725#(<= main_~i~0 39)} is VALID [2022-04-28 02:59:20,901 INFO L290 TraceCheckUtils]: 84: Hoare triple {43725#(<= main_~i~0 39)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43725#(<= main_~i~0 39)} is VALID [2022-04-28 02:59:20,901 INFO L290 TraceCheckUtils]: 85: Hoare triple {43725#(<= main_~i~0 39)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43726#(<= main_~i~0 40)} is VALID [2022-04-28 02:59:20,901 INFO L290 TraceCheckUtils]: 86: Hoare triple {43726#(<= main_~i~0 40)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43726#(<= main_~i~0 40)} is VALID [2022-04-28 02:59:20,902 INFO L290 TraceCheckUtils]: 87: Hoare triple {43726#(<= main_~i~0 40)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43727#(<= main_~i~0 41)} is VALID [2022-04-28 02:59:20,902 INFO L290 TraceCheckUtils]: 88: Hoare triple {43727#(<= main_~i~0 41)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43727#(<= main_~i~0 41)} is VALID [2022-04-28 02:59:20,902 INFO L290 TraceCheckUtils]: 89: Hoare triple {43727#(<= main_~i~0 41)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43728#(<= main_~i~0 42)} is VALID [2022-04-28 02:59:20,903 INFO L290 TraceCheckUtils]: 90: Hoare triple {43728#(<= main_~i~0 42)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43728#(<= main_~i~0 42)} is VALID [2022-04-28 02:59:20,903 INFO L290 TraceCheckUtils]: 91: Hoare triple {43728#(<= main_~i~0 42)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43729#(<= main_~i~0 43)} is VALID [2022-04-28 02:59:20,903 INFO L290 TraceCheckUtils]: 92: Hoare triple {43729#(<= main_~i~0 43)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43729#(<= main_~i~0 43)} is VALID [2022-04-28 02:59:20,904 INFO L290 TraceCheckUtils]: 93: Hoare triple {43729#(<= main_~i~0 43)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43730#(<= main_~i~0 44)} is VALID [2022-04-28 02:59:20,904 INFO L290 TraceCheckUtils]: 94: Hoare triple {43730#(<= main_~i~0 44)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43730#(<= main_~i~0 44)} is VALID [2022-04-28 02:59:20,904 INFO L290 TraceCheckUtils]: 95: Hoare triple {43730#(<= main_~i~0 44)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43731#(<= main_~i~0 45)} is VALID [2022-04-28 02:59:20,904 INFO L290 TraceCheckUtils]: 96: Hoare triple {43731#(<= main_~i~0 45)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43731#(<= main_~i~0 45)} is VALID [2022-04-28 02:59:20,905 INFO L290 TraceCheckUtils]: 97: Hoare triple {43731#(<= main_~i~0 45)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43732#(<= main_~i~0 46)} is VALID [2022-04-28 02:59:20,905 INFO L290 TraceCheckUtils]: 98: Hoare triple {43732#(<= main_~i~0 46)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43732#(<= main_~i~0 46)} is VALID [2022-04-28 02:59:20,905 INFO L290 TraceCheckUtils]: 99: Hoare triple {43732#(<= main_~i~0 46)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43733#(<= main_~i~0 47)} is VALID [2022-04-28 02:59:20,906 INFO L290 TraceCheckUtils]: 100: Hoare triple {43733#(<= main_~i~0 47)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43733#(<= main_~i~0 47)} is VALID [2022-04-28 02:59:20,906 INFO L290 TraceCheckUtils]: 101: Hoare triple {43733#(<= main_~i~0 47)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43734#(<= main_~i~0 48)} is VALID [2022-04-28 02:59:20,906 INFO L290 TraceCheckUtils]: 102: Hoare triple {43734#(<= main_~i~0 48)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43734#(<= main_~i~0 48)} is VALID [2022-04-28 02:59:20,907 INFO L290 TraceCheckUtils]: 103: Hoare triple {43734#(<= main_~i~0 48)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43735#(<= main_~i~0 49)} is VALID [2022-04-28 02:59:20,907 INFO L290 TraceCheckUtils]: 104: Hoare triple {43735#(<= main_~i~0 49)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43735#(<= main_~i~0 49)} is VALID [2022-04-28 02:59:20,907 INFO L290 TraceCheckUtils]: 105: Hoare triple {43735#(<= main_~i~0 49)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43736#(<= main_~i~0 50)} is VALID [2022-04-28 02:59:20,908 INFO L290 TraceCheckUtils]: 106: Hoare triple {43736#(<= main_~i~0 50)} assume !(~i~0 < 1024); {43682#false} is VALID [2022-04-28 02:59:20,908 INFO L290 TraceCheckUtils]: 107: Hoare triple {43682#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {43682#false} is VALID [2022-04-28 02:59:20,908 INFO L272 TraceCheckUtils]: 108: Hoare triple {43682#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {43682#false} is VALID [2022-04-28 02:59:20,908 INFO L290 TraceCheckUtils]: 109: Hoare triple {43682#false} ~cond := #in~cond; {43682#false} is VALID [2022-04-28 02:59:20,908 INFO L290 TraceCheckUtils]: 110: Hoare triple {43682#false} assume 0 == ~cond; {43682#false} is VALID [2022-04-28 02:59:20,908 INFO L290 TraceCheckUtils]: 111: Hoare triple {43682#false} assume !false; {43682#false} is VALID [2022-04-28 02:59:20,908 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:59:20,908 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:59:23,938 INFO L290 TraceCheckUtils]: 111: Hoare triple {43682#false} assume !false; {43682#false} is VALID [2022-04-28 02:59:23,938 INFO L290 TraceCheckUtils]: 110: Hoare triple {43682#false} assume 0 == ~cond; {43682#false} is VALID [2022-04-28 02:59:23,938 INFO L290 TraceCheckUtils]: 109: Hoare triple {43682#false} ~cond := #in~cond; {43682#false} is VALID [2022-04-28 02:59:23,939 INFO L272 TraceCheckUtils]: 108: Hoare triple {43682#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {43682#false} is VALID [2022-04-28 02:59:23,939 INFO L290 TraceCheckUtils]: 107: Hoare triple {43682#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {43682#false} is VALID [2022-04-28 02:59:23,939 INFO L290 TraceCheckUtils]: 106: Hoare triple {44090#(< main_~i~0 1024)} assume !(~i~0 < 1024); {43682#false} is VALID [2022-04-28 02:59:23,939 INFO L290 TraceCheckUtils]: 105: Hoare triple {44094#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44090#(< main_~i~0 1024)} is VALID [2022-04-28 02:59:23,939 INFO L290 TraceCheckUtils]: 104: Hoare triple {44094#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44094#(< main_~i~0 1023)} is VALID [2022-04-28 02:59:23,940 INFO L290 TraceCheckUtils]: 103: Hoare triple {44101#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44094#(< main_~i~0 1023)} is VALID [2022-04-28 02:59:23,940 INFO L290 TraceCheckUtils]: 102: Hoare triple {44101#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44101#(< main_~i~0 1022)} is VALID [2022-04-28 02:59:23,940 INFO L290 TraceCheckUtils]: 101: Hoare triple {44108#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44101#(< main_~i~0 1022)} is VALID [2022-04-28 02:59:23,941 INFO L290 TraceCheckUtils]: 100: Hoare triple {44108#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44108#(< main_~i~0 1021)} is VALID [2022-04-28 02:59:23,941 INFO L290 TraceCheckUtils]: 99: Hoare triple {44115#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44108#(< main_~i~0 1021)} is VALID [2022-04-28 02:59:23,941 INFO L290 TraceCheckUtils]: 98: Hoare triple {44115#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44115#(< main_~i~0 1020)} is VALID [2022-04-28 02:59:23,942 INFO L290 TraceCheckUtils]: 97: Hoare triple {44122#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44115#(< main_~i~0 1020)} is VALID [2022-04-28 02:59:23,942 INFO L290 TraceCheckUtils]: 96: Hoare triple {44122#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44122#(< main_~i~0 1019)} is VALID [2022-04-28 02:59:23,942 INFO L290 TraceCheckUtils]: 95: Hoare triple {44129#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44122#(< main_~i~0 1019)} is VALID [2022-04-28 02:59:23,943 INFO L290 TraceCheckUtils]: 94: Hoare triple {44129#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44129#(< main_~i~0 1018)} is VALID [2022-04-28 02:59:23,943 INFO L290 TraceCheckUtils]: 93: Hoare triple {44136#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44129#(< main_~i~0 1018)} is VALID [2022-04-28 02:59:23,943 INFO L290 TraceCheckUtils]: 92: Hoare triple {44136#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44136#(< main_~i~0 1017)} is VALID [2022-04-28 02:59:23,944 INFO L290 TraceCheckUtils]: 91: Hoare triple {44143#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44136#(< main_~i~0 1017)} is VALID [2022-04-28 02:59:23,944 INFO L290 TraceCheckUtils]: 90: Hoare triple {44143#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44143#(< main_~i~0 1016)} is VALID [2022-04-28 02:59:23,944 INFO L290 TraceCheckUtils]: 89: Hoare triple {44150#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44143#(< main_~i~0 1016)} is VALID [2022-04-28 02:59:23,945 INFO L290 TraceCheckUtils]: 88: Hoare triple {44150#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44150#(< main_~i~0 1015)} is VALID [2022-04-28 02:59:23,945 INFO L290 TraceCheckUtils]: 87: Hoare triple {44157#(< main_~i~0 1014)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44150#(< main_~i~0 1015)} is VALID [2022-04-28 02:59:23,945 INFO L290 TraceCheckUtils]: 86: Hoare triple {44157#(< main_~i~0 1014)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44157#(< main_~i~0 1014)} is VALID [2022-04-28 02:59:23,946 INFO L290 TraceCheckUtils]: 85: Hoare triple {44164#(< main_~i~0 1013)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44157#(< main_~i~0 1014)} is VALID [2022-04-28 02:59:23,946 INFO L290 TraceCheckUtils]: 84: Hoare triple {44164#(< main_~i~0 1013)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44164#(< main_~i~0 1013)} is VALID [2022-04-28 02:59:23,946 INFO L290 TraceCheckUtils]: 83: Hoare triple {44171#(< main_~i~0 1012)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44164#(< main_~i~0 1013)} is VALID [2022-04-28 02:59:23,946 INFO L290 TraceCheckUtils]: 82: Hoare triple {44171#(< main_~i~0 1012)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44171#(< main_~i~0 1012)} is VALID [2022-04-28 02:59:23,947 INFO L290 TraceCheckUtils]: 81: Hoare triple {44178#(< main_~i~0 1011)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44171#(< main_~i~0 1012)} is VALID [2022-04-28 02:59:23,947 INFO L290 TraceCheckUtils]: 80: Hoare triple {44178#(< main_~i~0 1011)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44178#(< main_~i~0 1011)} is VALID [2022-04-28 02:59:23,947 INFO L290 TraceCheckUtils]: 79: Hoare triple {44185#(< main_~i~0 1010)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44178#(< main_~i~0 1011)} is VALID [2022-04-28 02:59:23,948 INFO L290 TraceCheckUtils]: 78: Hoare triple {44185#(< main_~i~0 1010)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44185#(< main_~i~0 1010)} is VALID [2022-04-28 02:59:23,948 INFO L290 TraceCheckUtils]: 77: Hoare triple {44192#(< main_~i~0 1009)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44185#(< main_~i~0 1010)} is VALID [2022-04-28 02:59:23,948 INFO L290 TraceCheckUtils]: 76: Hoare triple {44192#(< main_~i~0 1009)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44192#(< main_~i~0 1009)} is VALID [2022-04-28 02:59:23,949 INFO L290 TraceCheckUtils]: 75: Hoare triple {44199#(< main_~i~0 1008)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44192#(< main_~i~0 1009)} is VALID [2022-04-28 02:59:23,949 INFO L290 TraceCheckUtils]: 74: Hoare triple {44199#(< main_~i~0 1008)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44199#(< main_~i~0 1008)} is VALID [2022-04-28 02:59:23,949 INFO L290 TraceCheckUtils]: 73: Hoare triple {44206#(< main_~i~0 1007)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44199#(< main_~i~0 1008)} is VALID [2022-04-28 02:59:23,950 INFO L290 TraceCheckUtils]: 72: Hoare triple {44206#(< main_~i~0 1007)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44206#(< main_~i~0 1007)} is VALID [2022-04-28 02:59:23,950 INFO L290 TraceCheckUtils]: 71: Hoare triple {44213#(< main_~i~0 1006)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44206#(< main_~i~0 1007)} is VALID [2022-04-28 02:59:23,950 INFO L290 TraceCheckUtils]: 70: Hoare triple {44213#(< main_~i~0 1006)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44213#(< main_~i~0 1006)} is VALID [2022-04-28 02:59:23,951 INFO L290 TraceCheckUtils]: 69: Hoare triple {44220#(< main_~i~0 1005)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44213#(< main_~i~0 1006)} is VALID [2022-04-28 02:59:23,951 INFO L290 TraceCheckUtils]: 68: Hoare triple {44220#(< main_~i~0 1005)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44220#(< main_~i~0 1005)} is VALID [2022-04-28 02:59:23,951 INFO L290 TraceCheckUtils]: 67: Hoare triple {44227#(< main_~i~0 1004)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44220#(< main_~i~0 1005)} is VALID [2022-04-28 02:59:23,951 INFO L290 TraceCheckUtils]: 66: Hoare triple {44227#(< main_~i~0 1004)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44227#(< main_~i~0 1004)} is VALID [2022-04-28 02:59:23,952 INFO L290 TraceCheckUtils]: 65: Hoare triple {44234#(< main_~i~0 1003)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44227#(< main_~i~0 1004)} is VALID [2022-04-28 02:59:23,952 INFO L290 TraceCheckUtils]: 64: Hoare triple {44234#(< main_~i~0 1003)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44234#(< main_~i~0 1003)} is VALID [2022-04-28 02:59:23,952 INFO L290 TraceCheckUtils]: 63: Hoare triple {44241#(< main_~i~0 1002)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44234#(< main_~i~0 1003)} is VALID [2022-04-28 02:59:23,953 INFO L290 TraceCheckUtils]: 62: Hoare triple {44241#(< main_~i~0 1002)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44241#(< main_~i~0 1002)} is VALID [2022-04-28 02:59:23,953 INFO L290 TraceCheckUtils]: 61: Hoare triple {44248#(< main_~i~0 1001)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44241#(< main_~i~0 1002)} is VALID [2022-04-28 02:59:23,953 INFO L290 TraceCheckUtils]: 60: Hoare triple {44248#(< main_~i~0 1001)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44248#(< main_~i~0 1001)} is VALID [2022-04-28 02:59:23,954 INFO L290 TraceCheckUtils]: 59: Hoare triple {44255#(< main_~i~0 1000)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44248#(< main_~i~0 1001)} is VALID [2022-04-28 02:59:23,954 INFO L290 TraceCheckUtils]: 58: Hoare triple {44255#(< main_~i~0 1000)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44255#(< main_~i~0 1000)} is VALID [2022-04-28 02:59:23,954 INFO L290 TraceCheckUtils]: 57: Hoare triple {44262#(< main_~i~0 999)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44255#(< main_~i~0 1000)} is VALID [2022-04-28 02:59:23,955 INFO L290 TraceCheckUtils]: 56: Hoare triple {44262#(< main_~i~0 999)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44262#(< main_~i~0 999)} is VALID [2022-04-28 02:59:23,955 INFO L290 TraceCheckUtils]: 55: Hoare triple {44269#(< main_~i~0 998)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44262#(< main_~i~0 999)} is VALID [2022-04-28 02:59:23,955 INFO L290 TraceCheckUtils]: 54: Hoare triple {44269#(< main_~i~0 998)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44269#(< main_~i~0 998)} is VALID [2022-04-28 02:59:23,956 INFO L290 TraceCheckUtils]: 53: Hoare triple {44276#(< main_~i~0 997)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44269#(< main_~i~0 998)} is VALID [2022-04-28 02:59:23,956 INFO L290 TraceCheckUtils]: 52: Hoare triple {44276#(< main_~i~0 997)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44276#(< main_~i~0 997)} is VALID [2022-04-28 02:59:23,956 INFO L290 TraceCheckUtils]: 51: Hoare triple {44283#(< main_~i~0 996)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44276#(< main_~i~0 997)} is VALID [2022-04-28 02:59:23,957 INFO L290 TraceCheckUtils]: 50: Hoare triple {44283#(< main_~i~0 996)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44283#(< main_~i~0 996)} is VALID [2022-04-28 02:59:23,957 INFO L290 TraceCheckUtils]: 49: Hoare triple {44290#(< main_~i~0 995)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44283#(< main_~i~0 996)} is VALID [2022-04-28 02:59:23,957 INFO L290 TraceCheckUtils]: 48: Hoare triple {44290#(< main_~i~0 995)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44290#(< main_~i~0 995)} is VALID [2022-04-28 02:59:23,958 INFO L290 TraceCheckUtils]: 47: Hoare triple {44297#(< main_~i~0 994)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44290#(< main_~i~0 995)} is VALID [2022-04-28 02:59:23,958 INFO L290 TraceCheckUtils]: 46: Hoare triple {44297#(< main_~i~0 994)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44297#(< main_~i~0 994)} is VALID [2022-04-28 02:59:23,958 INFO L290 TraceCheckUtils]: 45: Hoare triple {44304#(< main_~i~0 993)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44297#(< main_~i~0 994)} is VALID [2022-04-28 02:59:23,958 INFO L290 TraceCheckUtils]: 44: Hoare triple {44304#(< main_~i~0 993)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44304#(< main_~i~0 993)} is VALID [2022-04-28 02:59:23,959 INFO L290 TraceCheckUtils]: 43: Hoare triple {44311#(< main_~i~0 992)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44304#(< main_~i~0 993)} is VALID [2022-04-28 02:59:23,959 INFO L290 TraceCheckUtils]: 42: Hoare triple {44311#(< main_~i~0 992)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44311#(< main_~i~0 992)} is VALID [2022-04-28 02:59:23,959 INFO L290 TraceCheckUtils]: 41: Hoare triple {44318#(< main_~i~0 991)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44311#(< main_~i~0 992)} is VALID [2022-04-28 02:59:23,960 INFO L290 TraceCheckUtils]: 40: Hoare triple {44318#(< main_~i~0 991)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44318#(< main_~i~0 991)} is VALID [2022-04-28 02:59:23,960 INFO L290 TraceCheckUtils]: 39: Hoare triple {44325#(< main_~i~0 990)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44318#(< main_~i~0 991)} is VALID [2022-04-28 02:59:23,960 INFO L290 TraceCheckUtils]: 38: Hoare triple {44325#(< main_~i~0 990)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44325#(< main_~i~0 990)} is VALID [2022-04-28 02:59:23,961 INFO L290 TraceCheckUtils]: 37: Hoare triple {44332#(< main_~i~0 989)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44325#(< main_~i~0 990)} is VALID [2022-04-28 02:59:23,961 INFO L290 TraceCheckUtils]: 36: Hoare triple {44332#(< main_~i~0 989)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44332#(< main_~i~0 989)} is VALID [2022-04-28 02:59:23,961 INFO L290 TraceCheckUtils]: 35: Hoare triple {44339#(< main_~i~0 988)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44332#(< main_~i~0 989)} is VALID [2022-04-28 02:59:23,962 INFO L290 TraceCheckUtils]: 34: Hoare triple {44339#(< main_~i~0 988)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44339#(< main_~i~0 988)} is VALID [2022-04-28 02:59:23,962 INFO L290 TraceCheckUtils]: 33: Hoare triple {44346#(< main_~i~0 987)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44339#(< main_~i~0 988)} is VALID [2022-04-28 02:59:23,962 INFO L290 TraceCheckUtils]: 32: Hoare triple {44346#(< main_~i~0 987)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44346#(< main_~i~0 987)} is VALID [2022-04-28 02:59:23,963 INFO L290 TraceCheckUtils]: 31: Hoare triple {44353#(< main_~i~0 986)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44346#(< main_~i~0 987)} is VALID [2022-04-28 02:59:23,963 INFO L290 TraceCheckUtils]: 30: Hoare triple {44353#(< main_~i~0 986)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44353#(< main_~i~0 986)} is VALID [2022-04-28 02:59:23,963 INFO L290 TraceCheckUtils]: 29: Hoare triple {44360#(< main_~i~0 985)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44353#(< main_~i~0 986)} is VALID [2022-04-28 02:59:23,963 INFO L290 TraceCheckUtils]: 28: Hoare triple {44360#(< main_~i~0 985)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44360#(< main_~i~0 985)} is VALID [2022-04-28 02:59:23,964 INFO L290 TraceCheckUtils]: 27: Hoare triple {44367#(< main_~i~0 984)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44360#(< main_~i~0 985)} is VALID [2022-04-28 02:59:23,964 INFO L290 TraceCheckUtils]: 26: Hoare triple {44367#(< main_~i~0 984)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44367#(< main_~i~0 984)} is VALID [2022-04-28 02:59:23,964 INFO L290 TraceCheckUtils]: 25: Hoare triple {44374#(< main_~i~0 983)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44367#(< main_~i~0 984)} is VALID [2022-04-28 02:59:23,965 INFO L290 TraceCheckUtils]: 24: Hoare triple {44374#(< main_~i~0 983)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44374#(< main_~i~0 983)} is VALID [2022-04-28 02:59:23,965 INFO L290 TraceCheckUtils]: 23: Hoare triple {44381#(< main_~i~0 982)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44374#(< main_~i~0 983)} is VALID [2022-04-28 02:59:23,965 INFO L290 TraceCheckUtils]: 22: Hoare triple {44381#(< main_~i~0 982)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44381#(< main_~i~0 982)} is VALID [2022-04-28 02:59:23,966 INFO L290 TraceCheckUtils]: 21: Hoare triple {44388#(< main_~i~0 981)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44381#(< main_~i~0 982)} is VALID [2022-04-28 02:59:23,966 INFO L290 TraceCheckUtils]: 20: Hoare triple {44388#(< main_~i~0 981)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44388#(< main_~i~0 981)} is VALID [2022-04-28 02:59:23,966 INFO L290 TraceCheckUtils]: 19: Hoare triple {44395#(< main_~i~0 980)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44388#(< main_~i~0 981)} is VALID [2022-04-28 02:59:23,967 INFO L290 TraceCheckUtils]: 18: Hoare triple {44395#(< main_~i~0 980)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44395#(< main_~i~0 980)} is VALID [2022-04-28 02:59:23,967 INFO L290 TraceCheckUtils]: 17: Hoare triple {44402#(< main_~i~0 979)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44395#(< main_~i~0 980)} is VALID [2022-04-28 02:59:23,967 INFO L290 TraceCheckUtils]: 16: Hoare triple {44402#(< main_~i~0 979)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44402#(< main_~i~0 979)} is VALID [2022-04-28 02:59:23,968 INFO L290 TraceCheckUtils]: 15: Hoare triple {44409#(< main_~i~0 978)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44402#(< main_~i~0 979)} is VALID [2022-04-28 02:59:23,968 INFO L290 TraceCheckUtils]: 14: Hoare triple {44409#(< main_~i~0 978)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44409#(< main_~i~0 978)} is VALID [2022-04-28 02:59:23,968 INFO L290 TraceCheckUtils]: 13: Hoare triple {44416#(< main_~i~0 977)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44409#(< main_~i~0 978)} is VALID [2022-04-28 02:59:23,969 INFO L290 TraceCheckUtils]: 12: Hoare triple {44416#(< main_~i~0 977)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44416#(< main_~i~0 977)} is VALID [2022-04-28 02:59:23,969 INFO L290 TraceCheckUtils]: 11: Hoare triple {44423#(< main_~i~0 976)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44416#(< main_~i~0 977)} is VALID [2022-04-28 02:59:23,969 INFO L290 TraceCheckUtils]: 10: Hoare triple {44423#(< main_~i~0 976)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44423#(< main_~i~0 976)} is VALID [2022-04-28 02:59:23,970 INFO L290 TraceCheckUtils]: 9: Hoare triple {44430#(< main_~i~0 975)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44423#(< main_~i~0 976)} is VALID [2022-04-28 02:59:23,970 INFO L290 TraceCheckUtils]: 8: Hoare triple {44430#(< main_~i~0 975)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44430#(< main_~i~0 975)} is VALID [2022-04-28 02:59:23,970 INFO L290 TraceCheckUtils]: 7: Hoare triple {44437#(< main_~i~0 974)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44430#(< main_~i~0 975)} is VALID [2022-04-28 02:59:23,970 INFO L290 TraceCheckUtils]: 6: Hoare triple {44437#(< main_~i~0 974)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44437#(< main_~i~0 974)} is VALID [2022-04-28 02:59:23,971 INFO L290 TraceCheckUtils]: 5: Hoare triple {43681#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {44437#(< main_~i~0 974)} is VALID [2022-04-28 02:59:23,971 INFO L272 TraceCheckUtils]: 4: Hoare triple {43681#true} call #t~ret6 := main(); {43681#true} is VALID [2022-04-28 02:59:23,971 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43681#true} {43681#true} #39#return; {43681#true} is VALID [2022-04-28 02:59:23,971 INFO L290 TraceCheckUtils]: 2: Hoare triple {43681#true} assume true; {43681#true} is VALID [2022-04-28 02:59:23,971 INFO L290 TraceCheckUtils]: 1: Hoare triple {43681#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {43681#true} is VALID [2022-04-28 02:59:23,971 INFO L272 TraceCheckUtils]: 0: Hoare triple {43681#true} call ULTIMATE.init(); {43681#true} is VALID [2022-04-28 02:59:23,971 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:59:23,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175043602] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:59:23,972 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:59:23,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 53, 53] total 106 [2022-04-28 02:59:23,972 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:59:23,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [728149275] [2022-04-28 02:59:23,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [728149275] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:59:23,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:59:23,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [54] imperfect sequences [] total 54 [2022-04-28 02:59:23,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663974924] [2022-04-28 02:59:23,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:59:23,972 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 2.0) internal successors, (108), 53 states have internal predecessors, (108), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 112 [2022-04-28 02:59:23,972 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:59:23,973 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 54 states, 54 states have (on average 2.0) internal successors, (108), 53 states have internal predecessors, (108), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:24,043 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:59:24,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-04-28 02:59:24,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:59:24,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-04-28 02:59:24,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5462, Invalid=5668, Unknown=0, NotChecked=0, Total=11130 [2022-04-28 02:59:24,045 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand has 54 states, 54 states have (on average 2.0) internal successors, (108), 53 states have internal predecessors, (108), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:25,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:59:25,968 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2022-04-28 02:59:25,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-04-28 02:59:25,968 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 2.0) internal successors, (108), 53 states have internal predecessors, (108), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 112 [2022-04-28 02:59:25,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:59:25,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 54 states have (on average 2.0) internal successors, (108), 53 states have internal predecessors, (108), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:25,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 122 transitions. [2022-04-28 02:59:25,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 54 states have (on average 2.0) internal successors, (108), 53 states have internal predecessors, (108), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:25,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 122 transitions. [2022-04-28 02:59:25,970 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 122 transitions. [2022-04-28 02:59:26,057 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:59:26,058 INFO L225 Difference]: With dead ends: 122 [2022-04-28 02:59:26,059 INFO L226 Difference]: Without dead ends: 116 [2022-04-28 02:59:26,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1574 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=10818, Invalid=13674, Unknown=0, NotChecked=0, Total=24492 [2022-04-28 02:59:26,060 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 110 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:59:26,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 24 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:59:26,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-04-28 02:59:26,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2022-04-28 02:59:26,637 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:59:26,637 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand has 115 states, 110 states have (on average 1.009090909090909) internal successors, (111), 110 states have internal predecessors, (111), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:26,638 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand has 115 states, 110 states have (on average 1.009090909090909) internal successors, (111), 110 states have internal predecessors, (111), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:26,638 INFO L87 Difference]: Start difference. First operand 116 states. Second operand has 115 states, 110 states have (on average 1.009090909090909) internal successors, (111), 110 states have internal predecessors, (111), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:26,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:59:26,639 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2022-04-28 02:59:26,639 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2022-04-28 02:59:26,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:59:26,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:59:26,639 INFO L74 IsIncluded]: Start isIncluded. First operand has 115 states, 110 states have (on average 1.009090909090909) internal successors, (111), 110 states have internal predecessors, (111), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 116 states. [2022-04-28 02:59:26,639 INFO L87 Difference]: Start difference. First operand has 115 states, 110 states have (on average 1.009090909090909) internal successors, (111), 110 states have internal predecessors, (111), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 116 states. [2022-04-28 02:59:26,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:59:26,640 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2022-04-28 02:59:26,640 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2022-04-28 02:59:26,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:59:26,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:59:26,640 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:59:26,640 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:59:26,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 110 states have (on average 1.009090909090909) internal successors, (111), 110 states have internal predecessors, (111), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:26,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2022-04-28 02:59:26,641 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 112 [2022-04-28 02:59:26,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:59:26,641 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2022-04-28 02:59:26,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 2.0) internal successors, (108), 53 states have internal predecessors, (108), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:26,641 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 115 states and 115 transitions. [2022-04-28 02:59:26,773 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:59:26,774 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2022-04-28 02:59:26,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-04-28 02:59:26,774 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:59:26,774 INFO L195 NwaCegarLoop]: trace histogram [51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:59:26,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Forceful destruction successful, exit code 0 [2022-04-28 02:59:26,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable50 [2022-04-28 02:59:26,975 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:59:26,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:59:26,976 INFO L85 PathProgramCache]: Analyzing trace with hash 174614880, now seen corresponding path program 101 times [2022-04-28 02:59:26,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:59:26,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1118833297] [2022-04-28 02:59:26,977 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:59:26,978 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:59:26,978 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:59:26,978 INFO L85 PathProgramCache]: Analyzing trace with hash 174614880, now seen corresponding path program 102 times [2022-04-28 02:59:26,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:59:26,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480384748] [2022-04-28 02:59:26,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:59:26,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:59:27,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:59:28,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:59:28,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:59:28,197 INFO L290 TraceCheckUtils]: 0: Hoare triple {45326#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {45269#true} is VALID [2022-04-28 02:59:28,197 INFO L290 TraceCheckUtils]: 1: Hoare triple {45269#true} assume true; {45269#true} is VALID [2022-04-28 02:59:28,197 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45269#true} {45269#true} #39#return; {45269#true} is VALID [2022-04-28 02:59:28,197 INFO L272 TraceCheckUtils]: 0: Hoare triple {45269#true} call ULTIMATE.init(); {45326#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:59:28,197 INFO L290 TraceCheckUtils]: 1: Hoare triple {45326#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {45269#true} is VALID [2022-04-28 02:59:28,197 INFO L290 TraceCheckUtils]: 2: Hoare triple {45269#true} assume true; {45269#true} is VALID [2022-04-28 02:59:28,198 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45269#true} {45269#true} #39#return; {45269#true} is VALID [2022-04-28 02:59:28,198 INFO L272 TraceCheckUtils]: 4: Hoare triple {45269#true} call #t~ret6 := main(); {45269#true} is VALID [2022-04-28 02:59:28,198 INFO L290 TraceCheckUtils]: 5: Hoare triple {45269#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {45274#(= main_~i~0 0)} is VALID [2022-04-28 02:59:28,198 INFO L290 TraceCheckUtils]: 6: Hoare triple {45274#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45274#(= main_~i~0 0)} is VALID [2022-04-28 02:59:28,198 INFO L290 TraceCheckUtils]: 7: Hoare triple {45274#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45275#(<= main_~i~0 1)} is VALID [2022-04-28 02:59:28,199 INFO L290 TraceCheckUtils]: 8: Hoare triple {45275#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45275#(<= main_~i~0 1)} is VALID [2022-04-28 02:59:28,199 INFO L290 TraceCheckUtils]: 9: Hoare triple {45275#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45276#(<= main_~i~0 2)} is VALID [2022-04-28 02:59:28,199 INFO L290 TraceCheckUtils]: 10: Hoare triple {45276#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45276#(<= main_~i~0 2)} is VALID [2022-04-28 02:59:28,200 INFO L290 TraceCheckUtils]: 11: Hoare triple {45276#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45277#(<= main_~i~0 3)} is VALID [2022-04-28 02:59:28,200 INFO L290 TraceCheckUtils]: 12: Hoare triple {45277#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45277#(<= main_~i~0 3)} is VALID [2022-04-28 02:59:28,200 INFO L290 TraceCheckUtils]: 13: Hoare triple {45277#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45278#(<= main_~i~0 4)} is VALID [2022-04-28 02:59:28,200 INFO L290 TraceCheckUtils]: 14: Hoare triple {45278#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45278#(<= main_~i~0 4)} is VALID [2022-04-28 02:59:28,201 INFO L290 TraceCheckUtils]: 15: Hoare triple {45278#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45279#(<= main_~i~0 5)} is VALID [2022-04-28 02:59:28,201 INFO L290 TraceCheckUtils]: 16: Hoare triple {45279#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45279#(<= main_~i~0 5)} is VALID [2022-04-28 02:59:28,201 INFO L290 TraceCheckUtils]: 17: Hoare triple {45279#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45280#(<= main_~i~0 6)} is VALID [2022-04-28 02:59:28,202 INFO L290 TraceCheckUtils]: 18: Hoare triple {45280#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45280#(<= main_~i~0 6)} is VALID [2022-04-28 02:59:28,202 INFO L290 TraceCheckUtils]: 19: Hoare triple {45280#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45281#(<= main_~i~0 7)} is VALID [2022-04-28 02:59:28,202 INFO L290 TraceCheckUtils]: 20: Hoare triple {45281#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45281#(<= main_~i~0 7)} is VALID [2022-04-28 02:59:28,203 INFO L290 TraceCheckUtils]: 21: Hoare triple {45281#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45282#(<= main_~i~0 8)} is VALID [2022-04-28 02:59:28,203 INFO L290 TraceCheckUtils]: 22: Hoare triple {45282#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45282#(<= main_~i~0 8)} is VALID [2022-04-28 02:59:28,203 INFO L290 TraceCheckUtils]: 23: Hoare triple {45282#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45283#(<= main_~i~0 9)} is VALID [2022-04-28 02:59:28,204 INFO L290 TraceCheckUtils]: 24: Hoare triple {45283#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45283#(<= main_~i~0 9)} is VALID [2022-04-28 02:59:28,204 INFO L290 TraceCheckUtils]: 25: Hoare triple {45283#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45284#(<= main_~i~0 10)} is VALID [2022-04-28 02:59:28,204 INFO L290 TraceCheckUtils]: 26: Hoare triple {45284#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45284#(<= main_~i~0 10)} is VALID [2022-04-28 02:59:28,204 INFO L290 TraceCheckUtils]: 27: Hoare triple {45284#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45285#(<= main_~i~0 11)} is VALID [2022-04-28 02:59:28,205 INFO L290 TraceCheckUtils]: 28: Hoare triple {45285#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45285#(<= main_~i~0 11)} is VALID [2022-04-28 02:59:28,205 INFO L290 TraceCheckUtils]: 29: Hoare triple {45285#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45286#(<= main_~i~0 12)} is VALID [2022-04-28 02:59:28,205 INFO L290 TraceCheckUtils]: 30: Hoare triple {45286#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45286#(<= main_~i~0 12)} is VALID [2022-04-28 02:59:28,206 INFO L290 TraceCheckUtils]: 31: Hoare triple {45286#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45287#(<= main_~i~0 13)} is VALID [2022-04-28 02:59:28,206 INFO L290 TraceCheckUtils]: 32: Hoare triple {45287#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45287#(<= main_~i~0 13)} is VALID [2022-04-28 02:59:28,206 INFO L290 TraceCheckUtils]: 33: Hoare triple {45287#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45288#(<= main_~i~0 14)} is VALID [2022-04-28 02:59:28,207 INFO L290 TraceCheckUtils]: 34: Hoare triple {45288#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45288#(<= main_~i~0 14)} is VALID [2022-04-28 02:59:28,207 INFO L290 TraceCheckUtils]: 35: Hoare triple {45288#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45289#(<= main_~i~0 15)} is VALID [2022-04-28 02:59:28,207 INFO L290 TraceCheckUtils]: 36: Hoare triple {45289#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45289#(<= main_~i~0 15)} is VALID [2022-04-28 02:59:28,208 INFO L290 TraceCheckUtils]: 37: Hoare triple {45289#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45290#(<= main_~i~0 16)} is VALID [2022-04-28 02:59:28,208 INFO L290 TraceCheckUtils]: 38: Hoare triple {45290#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45290#(<= main_~i~0 16)} is VALID [2022-04-28 02:59:28,208 INFO L290 TraceCheckUtils]: 39: Hoare triple {45290#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45291#(<= main_~i~0 17)} is VALID [2022-04-28 02:59:28,208 INFO L290 TraceCheckUtils]: 40: Hoare triple {45291#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45291#(<= main_~i~0 17)} is VALID [2022-04-28 02:59:28,209 INFO L290 TraceCheckUtils]: 41: Hoare triple {45291#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45292#(<= main_~i~0 18)} is VALID [2022-04-28 02:59:28,209 INFO L290 TraceCheckUtils]: 42: Hoare triple {45292#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45292#(<= main_~i~0 18)} is VALID [2022-04-28 02:59:28,209 INFO L290 TraceCheckUtils]: 43: Hoare triple {45292#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45293#(<= main_~i~0 19)} is VALID [2022-04-28 02:59:28,210 INFO L290 TraceCheckUtils]: 44: Hoare triple {45293#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45293#(<= main_~i~0 19)} is VALID [2022-04-28 02:59:28,210 INFO L290 TraceCheckUtils]: 45: Hoare triple {45293#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45294#(<= main_~i~0 20)} is VALID [2022-04-28 02:59:28,210 INFO L290 TraceCheckUtils]: 46: Hoare triple {45294#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45294#(<= main_~i~0 20)} is VALID [2022-04-28 02:59:28,211 INFO L290 TraceCheckUtils]: 47: Hoare triple {45294#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45295#(<= main_~i~0 21)} is VALID [2022-04-28 02:59:28,211 INFO L290 TraceCheckUtils]: 48: Hoare triple {45295#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45295#(<= main_~i~0 21)} is VALID [2022-04-28 02:59:28,211 INFO L290 TraceCheckUtils]: 49: Hoare triple {45295#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45296#(<= main_~i~0 22)} is VALID [2022-04-28 02:59:28,211 INFO L290 TraceCheckUtils]: 50: Hoare triple {45296#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45296#(<= main_~i~0 22)} is VALID [2022-04-28 02:59:28,212 INFO L290 TraceCheckUtils]: 51: Hoare triple {45296#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45297#(<= main_~i~0 23)} is VALID [2022-04-28 02:59:28,212 INFO L290 TraceCheckUtils]: 52: Hoare triple {45297#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45297#(<= main_~i~0 23)} is VALID [2022-04-28 02:59:28,212 INFO L290 TraceCheckUtils]: 53: Hoare triple {45297#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45298#(<= main_~i~0 24)} is VALID [2022-04-28 02:59:28,213 INFO L290 TraceCheckUtils]: 54: Hoare triple {45298#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45298#(<= main_~i~0 24)} is VALID [2022-04-28 02:59:28,213 INFO L290 TraceCheckUtils]: 55: Hoare triple {45298#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45299#(<= main_~i~0 25)} is VALID [2022-04-28 02:59:28,213 INFO L290 TraceCheckUtils]: 56: Hoare triple {45299#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45299#(<= main_~i~0 25)} is VALID [2022-04-28 02:59:28,214 INFO L290 TraceCheckUtils]: 57: Hoare triple {45299#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45300#(<= main_~i~0 26)} is VALID [2022-04-28 02:59:28,214 INFO L290 TraceCheckUtils]: 58: Hoare triple {45300#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45300#(<= main_~i~0 26)} is VALID [2022-04-28 02:59:28,214 INFO L290 TraceCheckUtils]: 59: Hoare triple {45300#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45301#(<= main_~i~0 27)} is VALID [2022-04-28 02:59:28,214 INFO L290 TraceCheckUtils]: 60: Hoare triple {45301#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45301#(<= main_~i~0 27)} is VALID [2022-04-28 02:59:28,215 INFO L290 TraceCheckUtils]: 61: Hoare triple {45301#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45302#(<= main_~i~0 28)} is VALID [2022-04-28 02:59:28,215 INFO L290 TraceCheckUtils]: 62: Hoare triple {45302#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45302#(<= main_~i~0 28)} is VALID [2022-04-28 02:59:28,215 INFO L290 TraceCheckUtils]: 63: Hoare triple {45302#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45303#(<= main_~i~0 29)} is VALID [2022-04-28 02:59:28,216 INFO L290 TraceCheckUtils]: 64: Hoare triple {45303#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45303#(<= main_~i~0 29)} is VALID [2022-04-28 02:59:28,216 INFO L290 TraceCheckUtils]: 65: Hoare triple {45303#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45304#(<= main_~i~0 30)} is VALID [2022-04-28 02:59:28,216 INFO L290 TraceCheckUtils]: 66: Hoare triple {45304#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45304#(<= main_~i~0 30)} is VALID [2022-04-28 02:59:28,217 INFO L290 TraceCheckUtils]: 67: Hoare triple {45304#(<= main_~i~0 30)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45305#(<= main_~i~0 31)} is VALID [2022-04-28 02:59:28,217 INFO L290 TraceCheckUtils]: 68: Hoare triple {45305#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45305#(<= main_~i~0 31)} is VALID [2022-04-28 02:59:28,217 INFO L290 TraceCheckUtils]: 69: Hoare triple {45305#(<= main_~i~0 31)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45306#(<= main_~i~0 32)} is VALID [2022-04-28 02:59:28,217 INFO L290 TraceCheckUtils]: 70: Hoare triple {45306#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45306#(<= main_~i~0 32)} is VALID [2022-04-28 02:59:28,218 INFO L290 TraceCheckUtils]: 71: Hoare triple {45306#(<= main_~i~0 32)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45307#(<= main_~i~0 33)} is VALID [2022-04-28 02:59:28,218 INFO L290 TraceCheckUtils]: 72: Hoare triple {45307#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45307#(<= main_~i~0 33)} is VALID [2022-04-28 02:59:28,218 INFO L290 TraceCheckUtils]: 73: Hoare triple {45307#(<= main_~i~0 33)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45308#(<= main_~i~0 34)} is VALID [2022-04-28 02:59:28,219 INFO L290 TraceCheckUtils]: 74: Hoare triple {45308#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45308#(<= main_~i~0 34)} is VALID [2022-04-28 02:59:28,219 INFO L290 TraceCheckUtils]: 75: Hoare triple {45308#(<= main_~i~0 34)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45309#(<= main_~i~0 35)} is VALID [2022-04-28 02:59:28,219 INFO L290 TraceCheckUtils]: 76: Hoare triple {45309#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45309#(<= main_~i~0 35)} is VALID [2022-04-28 02:59:28,220 INFO L290 TraceCheckUtils]: 77: Hoare triple {45309#(<= main_~i~0 35)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45310#(<= main_~i~0 36)} is VALID [2022-04-28 02:59:28,220 INFO L290 TraceCheckUtils]: 78: Hoare triple {45310#(<= main_~i~0 36)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45310#(<= main_~i~0 36)} is VALID [2022-04-28 02:59:28,220 INFO L290 TraceCheckUtils]: 79: Hoare triple {45310#(<= main_~i~0 36)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45311#(<= main_~i~0 37)} is VALID [2022-04-28 02:59:28,221 INFO L290 TraceCheckUtils]: 80: Hoare triple {45311#(<= main_~i~0 37)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45311#(<= main_~i~0 37)} is VALID [2022-04-28 02:59:28,221 INFO L290 TraceCheckUtils]: 81: Hoare triple {45311#(<= main_~i~0 37)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45312#(<= main_~i~0 38)} is VALID [2022-04-28 02:59:28,221 INFO L290 TraceCheckUtils]: 82: Hoare triple {45312#(<= main_~i~0 38)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45312#(<= main_~i~0 38)} is VALID [2022-04-28 02:59:28,222 INFO L290 TraceCheckUtils]: 83: Hoare triple {45312#(<= main_~i~0 38)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45313#(<= main_~i~0 39)} is VALID [2022-04-28 02:59:28,222 INFO L290 TraceCheckUtils]: 84: Hoare triple {45313#(<= main_~i~0 39)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45313#(<= main_~i~0 39)} is VALID [2022-04-28 02:59:28,222 INFO L290 TraceCheckUtils]: 85: Hoare triple {45313#(<= main_~i~0 39)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45314#(<= main_~i~0 40)} is VALID [2022-04-28 02:59:28,222 INFO L290 TraceCheckUtils]: 86: Hoare triple {45314#(<= main_~i~0 40)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45314#(<= main_~i~0 40)} is VALID [2022-04-28 02:59:28,223 INFO L290 TraceCheckUtils]: 87: Hoare triple {45314#(<= main_~i~0 40)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45315#(<= main_~i~0 41)} is VALID [2022-04-28 02:59:28,223 INFO L290 TraceCheckUtils]: 88: Hoare triple {45315#(<= main_~i~0 41)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45315#(<= main_~i~0 41)} is VALID [2022-04-28 02:59:28,223 INFO L290 TraceCheckUtils]: 89: Hoare triple {45315#(<= main_~i~0 41)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45316#(<= main_~i~0 42)} is VALID [2022-04-28 02:59:28,224 INFO L290 TraceCheckUtils]: 90: Hoare triple {45316#(<= main_~i~0 42)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45316#(<= main_~i~0 42)} is VALID [2022-04-28 02:59:28,224 INFO L290 TraceCheckUtils]: 91: Hoare triple {45316#(<= main_~i~0 42)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45317#(<= main_~i~0 43)} is VALID [2022-04-28 02:59:28,224 INFO L290 TraceCheckUtils]: 92: Hoare triple {45317#(<= main_~i~0 43)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45317#(<= main_~i~0 43)} is VALID [2022-04-28 02:59:28,225 INFO L290 TraceCheckUtils]: 93: Hoare triple {45317#(<= main_~i~0 43)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45318#(<= main_~i~0 44)} is VALID [2022-04-28 02:59:28,225 INFO L290 TraceCheckUtils]: 94: Hoare triple {45318#(<= main_~i~0 44)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45318#(<= main_~i~0 44)} is VALID [2022-04-28 02:59:28,225 INFO L290 TraceCheckUtils]: 95: Hoare triple {45318#(<= main_~i~0 44)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45319#(<= main_~i~0 45)} is VALID [2022-04-28 02:59:28,225 INFO L290 TraceCheckUtils]: 96: Hoare triple {45319#(<= main_~i~0 45)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45319#(<= main_~i~0 45)} is VALID [2022-04-28 02:59:28,226 INFO L290 TraceCheckUtils]: 97: Hoare triple {45319#(<= main_~i~0 45)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45320#(<= main_~i~0 46)} is VALID [2022-04-28 02:59:28,226 INFO L290 TraceCheckUtils]: 98: Hoare triple {45320#(<= main_~i~0 46)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45320#(<= main_~i~0 46)} is VALID [2022-04-28 02:59:28,226 INFO L290 TraceCheckUtils]: 99: Hoare triple {45320#(<= main_~i~0 46)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45321#(<= main_~i~0 47)} is VALID [2022-04-28 02:59:28,227 INFO L290 TraceCheckUtils]: 100: Hoare triple {45321#(<= main_~i~0 47)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45321#(<= main_~i~0 47)} is VALID [2022-04-28 02:59:28,227 INFO L290 TraceCheckUtils]: 101: Hoare triple {45321#(<= main_~i~0 47)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45322#(<= main_~i~0 48)} is VALID [2022-04-28 02:59:28,227 INFO L290 TraceCheckUtils]: 102: Hoare triple {45322#(<= main_~i~0 48)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45322#(<= main_~i~0 48)} is VALID [2022-04-28 02:59:28,228 INFO L290 TraceCheckUtils]: 103: Hoare triple {45322#(<= main_~i~0 48)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45323#(<= main_~i~0 49)} is VALID [2022-04-28 02:59:28,228 INFO L290 TraceCheckUtils]: 104: Hoare triple {45323#(<= main_~i~0 49)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45323#(<= main_~i~0 49)} is VALID [2022-04-28 02:59:28,228 INFO L290 TraceCheckUtils]: 105: Hoare triple {45323#(<= main_~i~0 49)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45324#(<= main_~i~0 50)} is VALID [2022-04-28 02:59:28,228 INFO L290 TraceCheckUtils]: 106: Hoare triple {45324#(<= main_~i~0 50)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45324#(<= main_~i~0 50)} is VALID [2022-04-28 02:59:28,229 INFO L290 TraceCheckUtils]: 107: Hoare triple {45324#(<= main_~i~0 50)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45325#(<= main_~i~0 51)} is VALID [2022-04-28 02:59:28,229 INFO L290 TraceCheckUtils]: 108: Hoare triple {45325#(<= main_~i~0 51)} assume !(~i~0 < 1024); {45270#false} is VALID [2022-04-28 02:59:28,229 INFO L290 TraceCheckUtils]: 109: Hoare triple {45270#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {45270#false} is VALID [2022-04-28 02:59:28,229 INFO L272 TraceCheckUtils]: 110: Hoare triple {45270#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {45270#false} is VALID [2022-04-28 02:59:28,229 INFO L290 TraceCheckUtils]: 111: Hoare triple {45270#false} ~cond := #in~cond; {45270#false} is VALID [2022-04-28 02:59:28,229 INFO L290 TraceCheckUtils]: 112: Hoare triple {45270#false} assume 0 == ~cond; {45270#false} is VALID [2022-04-28 02:59:28,229 INFO L290 TraceCheckUtils]: 113: Hoare triple {45270#false} assume !false; {45270#false} is VALID [2022-04-28 02:59:28,230 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:59:28,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:59:28,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480384748] [2022-04-28 02:59:28,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480384748] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:59:28,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044099682] [2022-04-28 02:59:28,231 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 02:59:28,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:59:28,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:59:28,232 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:59:28,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process