/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-acceleration/array_1-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 10:24:00,475 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 10:24:00,477 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 10:24:00,513 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 10:24:00,513 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 10:24:00,514 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 10:24:00,517 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 10:24:00,518 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 10:24:00,520 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 10:24:00,524 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 10:24:00,524 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 10:24:00,525 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 10:24:00,525 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 10:24:00,527 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 10:24:00,528 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 10:24:00,530 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 10:24:00,530 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 10:24:00,531 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 10:24:00,532 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 10:24:00,536 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 10:24:00,538 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 10:24:00,538 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 10:24:00,539 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 10:24:00,540 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 10:24:00,541 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 10:24:00,545 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 10:24:00,546 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 10:24:00,546 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 10:24:00,546 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 10:24:00,547 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 10:24:00,547 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 10:24:00,547 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 10:24:00,549 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 10:24:00,549 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 10:24:00,549 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 10:24:00,550 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 10:24:00,550 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 10:24:00,551 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 10:24:00,551 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 10:24:00,551 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 10:24:00,551 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 10:24:00,552 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 10:24:00,553 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 10:24:00,576 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 10:24:00,577 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 10:24:00,577 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 10:24:00,577 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 10:24:00,578 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 10:24:00,578 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 10:24:00,578 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 10:24:00,578 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 10:24:00,578 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 10:24:00,579 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 10:24:00,579 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 10:24:00,579 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 10:24:00,579 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 10:24:00,579 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 10:24:00,579 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 10:24:00,579 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 10:24:00,579 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 10:24:00,580 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 10:24:00,580 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 10:24:00,580 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 10:24:00,581 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 10:24:00,581 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 10:24:00,581 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 10:24:00,581 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 10:24:00,581 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:24:00,581 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 10:24:00,581 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 10:24:00,581 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 10:24:00,581 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 10:24:00,581 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 10:24:00,582 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 10:24:00,582 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 10:24:00,582 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 10:24:00,582 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-27 10:24:00,787 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 10:24:00,803 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 10:24:00,804 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 10:24:00,805 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 10:24:00,805 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 10:24:00,806 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-27 10:24:00,844 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21f7ef5ce/132f348c51084eada77d6149371732e4/FLAGd4842f523 [2022-04-27 10:24:01,217 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 10:24:01,217 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/array_1-1.c [2022-04-27 10:24:01,222 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21f7ef5ce/132f348c51084eada77d6149371732e4/FLAGd4842f523 [2022-04-27 10:24:01,233 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21f7ef5ce/132f348c51084eada77d6149371732e4 [2022-04-27 10:24:01,235 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 10:24:01,236 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 10:24:01,238 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 10:24:01,238 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 10:24:01,240 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 10:24:01,241 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:24:01" (1/1) ... [2022-04-27 10:24:01,242 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73ac1e52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:24:01, skipping insertion in model container [2022-04-27 10:24:01,242 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:24:01" (1/1) ... [2022-04-27 10:24:01,254 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 10:24:01,263 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 10:24:01,416 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-27 10:24:01,427 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:24:01,440 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 10:24:01,449 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-27 10:24:01,452 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:24:01,465 INFO L208 MainTranslator]: Completed translation [2022-04-27 10:24:01,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:24:01 WrapperNode [2022-04-27 10:24:01,466 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 10:24:01,467 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 10:24:01,467 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 10:24:01,467 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 10:24:01,473 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:24:01" (1/1) ... [2022-04-27 10:24:01,473 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:24:01" (1/1) ... [2022-04-27 10:24:01,478 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:24:01" (1/1) ... [2022-04-27 10:24:01,478 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:24:01" (1/1) ... [2022-04-27 10:24:01,487 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:24:01" (1/1) ... [2022-04-27 10:24:01,491 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:24:01" (1/1) ... [2022-04-27 10:24:01,494 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:24:01" (1/1) ... [2022-04-27 10:24:01,496 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 10:24:01,497 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 10:24:01,497 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 10:24:01,497 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 10:24:01,498 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:24:01" (1/1) ... [2022-04-27 10:24:01,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:24:01,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:24:01,536 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-27 10:24:01,553 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-27 10:24:01,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 10:24:01,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 10:24:01,570 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 10:24:01,571 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 10:24:01,571 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 10:24:01,571 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 10:24:01,571 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 10:24:01,572 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 10:24:01,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 10:24:01,572 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 10:24:01,572 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 10:24:01,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-27 10:24:01,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 10:24:01,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 10:24:01,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 10:24:01,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 10:24:01,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 10:24:01,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 10:24:01,616 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 10:24:01,617 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 10:24:01,753 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 10:24:01,757 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 10:24:01,757 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 10:24:01,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:24:01 BoogieIcfgContainer [2022-04-27 10:24:01,759 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 10:24:01,760 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 10:24:01,760 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 10:24:01,762 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 10:24:01,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:24:01" (1/3) ... [2022-04-27 10:24:01,762 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28dfba16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:24:01, skipping insertion in model container [2022-04-27 10:24:01,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:24:01" (2/3) ... [2022-04-27 10:24:01,763 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28dfba16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:24:01, skipping insertion in model container [2022-04-27 10:24:01,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:24:01" (3/3) ... [2022-04-27 10:24:01,764 INFO L111 eAbstractionObserver]: Analyzing ICFG array_1-1.c [2022-04-27 10:24:01,772 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 10:24:01,773 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 10:24:01,838 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 10:24:01,843 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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@3e82a12e, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@27ebe2ce [2022-04-27 10:24:01,843 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 10:24:01,848 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-27 10:24:01,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 10:24:01,852 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:24:01,853 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:24:01,853 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:24:01,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:24:01,856 INFO L85 PathProgramCache]: Analyzing trace with hash 147271546, now seen corresponding path program 1 times [2022-04-27 10:24:01,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:24:01,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967774150] [2022-04-27 10:24:01,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:24:01,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:24:01,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:24:02,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:24:02,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:24:02,074 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-27 10:24:02,074 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-27 10:24:02,074 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #39#return; {24#true} is VALID [2022-04-27 10:24:02,076 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-27 10:24:02,076 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-27 10:24:02,076 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-27 10:24:02,076 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #39#return; {24#true} is VALID [2022-04-27 10:24:02,076 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret6 := main(); {24#true} is VALID [2022-04-27 10:24:02,077 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-27 10:24:02,077 INFO L290 TraceCheckUtils]: 6: Hoare triple {29#(= main_~i~0 0)} assume !(~i~0 < 1024); {25#false} is VALID [2022-04-27 10:24:02,078 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-27 10:24:02,078 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-27 10:24:02,078 INFO L290 TraceCheckUtils]: 9: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2022-04-27 10:24:02,078 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#false} assume 0 == ~cond; {25#false} is VALID [2022-04-27 10:24:02,078 INFO L290 TraceCheckUtils]: 11: Hoare triple {25#false} assume !false; {25#false} is VALID [2022-04-27 10:24:02,079 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-27 10:24:02,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:24:02,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967774150] [2022-04-27 10:24:02,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967774150] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:24:02,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:24:02,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 10:24:02,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980592098] [2022-04-27 10:24:02,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:24:02,088 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-27 10:24:02,089 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:24:02,091 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-27 10:24:02,108 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-27 10:24:02,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 10:24:02,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:24:02,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 10:24:02,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 10:24:02,125 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-27 10:24:02,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:24:02,247 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-27 10:24:02,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 10:24:02,248 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-27 10:24:02,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:24:02,248 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-27 10:24:02,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-04-27 10:24:02,256 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-27 10:24:02,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-04-27 10:24:02,259 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 41 transitions. [2022-04-27 10:24:02,305 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-27 10:24:02,309 INFO L225 Difference]: With dead ends: 36 [2022-04-27 10:24:02,310 INFO L226 Difference]: Without dead ends: 16 [2022-04-27 10:24:02,311 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-27 10:24:02,313 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-27 10:24:02,314 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-27 10:24:02,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-27 10:24:02,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2022-04-27 10:24:02,333 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:24:02,333 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-27 10:24:02,334 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-27 10:24:02,334 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-27 10:24:02,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:24:02,335 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-27 10:24:02,336 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-27 10:24:02,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:24:02,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:24:02,336 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-27 10:24:02,336 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-27 10:24:02,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:24:02,338 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-27 10:24:02,338 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-27 10:24:02,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:24:02,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:24:02,338 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:24:02,338 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:24:02,339 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-27 10:24:02,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-27 10:24:02,340 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2022-04-27 10:24:02,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:24:02,341 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-27 10:24:02,341 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-27 10:24:02,341 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-27 10:24:02,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 10:24:02,341 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:24:02,341 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:24:02,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 10:24:02,342 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:24:02,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:24:02,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1080052612, now seen corresponding path program 1 times [2022-04-27 10:24:02,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:24:02,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406465321] [2022-04-27 10:24:02,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:24:02,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:24:02,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:24:02,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:24:02,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:24:02,396 INFO L290 TraceCheckUtils]: 0: Hoare triple {143#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {136#true} is VALID [2022-04-27 10:24:02,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {136#true} assume true; {136#true} is VALID [2022-04-27 10:24:02,396 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {136#true} {136#true} #39#return; {136#true} is VALID [2022-04-27 10:24:02,397 INFO L272 TraceCheckUtils]: 0: Hoare triple {136#true} call ULTIMATE.init(); {143#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:24:02,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {143#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {136#true} is VALID [2022-04-27 10:24:02,397 INFO L290 TraceCheckUtils]: 2: Hoare triple {136#true} assume true; {136#true} is VALID [2022-04-27 10:24:02,397 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {136#true} {136#true} #39#return; {136#true} is VALID [2022-04-27 10:24:02,397 INFO L272 TraceCheckUtils]: 4: Hoare triple {136#true} call #t~ret6 := main(); {136#true} is VALID [2022-04-27 10:24:02,398 INFO L290 TraceCheckUtils]: 5: Hoare triple {136#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {141#(= main_~i~0 0)} is VALID [2022-04-27 10:24:02,398 INFO L290 TraceCheckUtils]: 6: Hoare triple {141#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {141#(= main_~i~0 0)} is VALID [2022-04-27 10:24:02,399 INFO L290 TraceCheckUtils]: 7: Hoare triple {141#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {142#(<= main_~i~0 1)} is VALID [2022-04-27 10:24:02,400 INFO L290 TraceCheckUtils]: 8: Hoare triple {142#(<= main_~i~0 1)} assume !(~i~0 < 1024); {137#false} is VALID [2022-04-27 10:24:02,400 INFO L290 TraceCheckUtils]: 9: Hoare triple {137#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {137#false} is VALID [2022-04-27 10:24:02,400 INFO L272 TraceCheckUtils]: 10: Hoare triple {137#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {137#false} is VALID [2022-04-27 10:24:02,400 INFO L290 TraceCheckUtils]: 11: Hoare triple {137#false} ~cond := #in~cond; {137#false} is VALID [2022-04-27 10:24:02,401 INFO L290 TraceCheckUtils]: 12: Hoare triple {137#false} assume 0 == ~cond; {137#false} is VALID [2022-04-27 10:24:02,401 INFO L290 TraceCheckUtils]: 13: Hoare triple {137#false} assume !false; {137#false} is VALID [2022-04-27 10:24:02,401 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-27 10:24:02,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:24:02,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406465321] [2022-04-27 10:24:02,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406465321] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:24:02,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541050846] [2022-04-27 10:24:02,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:24:02,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:24:02,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:24:02,404 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-27 10:24:02,405 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-27 10:24:02,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:24:02,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-27 10:24:02,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:24:02,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:24:02,547 INFO L272 TraceCheckUtils]: 0: Hoare triple {136#true} call ULTIMATE.init(); {136#true} is VALID [2022-04-27 10:24:02,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {136#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {136#true} is VALID [2022-04-27 10:24:02,548 INFO L290 TraceCheckUtils]: 2: Hoare triple {136#true} assume true; {136#true} is VALID [2022-04-27 10:24:02,548 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {136#true} {136#true} #39#return; {136#true} is VALID [2022-04-27 10:24:02,548 INFO L272 TraceCheckUtils]: 4: Hoare triple {136#true} call #t~ret6 := main(); {136#true} is VALID [2022-04-27 10:24:02,549 INFO L290 TraceCheckUtils]: 5: Hoare triple {136#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {162#(<= main_~i~0 0)} is VALID [2022-04-27 10:24:02,549 INFO L290 TraceCheckUtils]: 6: Hoare triple {162#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {162#(<= main_~i~0 0)} is VALID [2022-04-27 10:24:02,549 INFO L290 TraceCheckUtils]: 7: Hoare triple {162#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {142#(<= main_~i~0 1)} is VALID [2022-04-27 10:24:02,550 INFO L290 TraceCheckUtils]: 8: Hoare triple {142#(<= main_~i~0 1)} assume !(~i~0 < 1024); {137#false} is VALID [2022-04-27 10:24:02,550 INFO L290 TraceCheckUtils]: 9: Hoare triple {137#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {137#false} is VALID [2022-04-27 10:24:02,550 INFO L272 TraceCheckUtils]: 10: Hoare triple {137#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {137#false} is VALID [2022-04-27 10:24:02,550 INFO L290 TraceCheckUtils]: 11: Hoare triple {137#false} ~cond := #in~cond; {137#false} is VALID [2022-04-27 10:24:02,551 INFO L290 TraceCheckUtils]: 12: Hoare triple {137#false} assume 0 == ~cond; {137#false} is VALID [2022-04-27 10:24:02,551 INFO L290 TraceCheckUtils]: 13: Hoare triple {137#false} assume !false; {137#false} is VALID [2022-04-27 10:24:02,551 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-27 10:24:02,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:24:02,609 INFO L290 TraceCheckUtils]: 13: Hoare triple {137#false} assume !false; {137#false} is VALID [2022-04-27 10:24:02,609 INFO L290 TraceCheckUtils]: 12: Hoare triple {137#false} assume 0 == ~cond; {137#false} is VALID [2022-04-27 10:24:02,609 INFO L290 TraceCheckUtils]: 11: Hoare triple {137#false} ~cond := #in~cond; {137#false} is VALID [2022-04-27 10:24:02,609 INFO L272 TraceCheckUtils]: 10: Hoare triple {137#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {137#false} is VALID [2022-04-27 10:24:02,609 INFO L290 TraceCheckUtils]: 9: Hoare triple {137#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {137#false} is VALID [2022-04-27 10:24:02,610 INFO L290 TraceCheckUtils]: 8: Hoare triple {202#(< main_~i~0 1024)} assume !(~i~0 < 1024); {137#false} is VALID [2022-04-27 10:24:02,610 INFO L290 TraceCheckUtils]: 7: Hoare triple {206#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {202#(< main_~i~0 1024)} is VALID [2022-04-27 10:24:02,611 INFO L290 TraceCheckUtils]: 6: Hoare triple {206#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {206#(< main_~i~0 1023)} is VALID [2022-04-27 10:24:02,611 INFO L290 TraceCheckUtils]: 5: Hoare triple {136#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {206#(< main_~i~0 1023)} is VALID [2022-04-27 10:24:02,611 INFO L272 TraceCheckUtils]: 4: Hoare triple {136#true} call #t~ret6 := main(); {136#true} is VALID [2022-04-27 10:24:02,611 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {136#true} {136#true} #39#return; {136#true} is VALID [2022-04-27 10:24:02,612 INFO L290 TraceCheckUtils]: 2: Hoare triple {136#true} assume true; {136#true} is VALID [2022-04-27 10:24:02,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {136#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {136#true} is VALID [2022-04-27 10:24:02,612 INFO L272 TraceCheckUtils]: 0: Hoare triple {136#true} call ULTIMATE.init(); {136#true} is VALID [2022-04-27 10:24:02,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:24:02,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [541050846] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:24:02,612 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:24:02,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-27 10:24:02,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9406535] [2022-04-27 10:24:02,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:24:02,614 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 10:24:02,614 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:24:02,614 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:24:02,628 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-27 10:24:02,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 10:24:02,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:24:02,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 10:24:02,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-27 10:24:02,629 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:24:02,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:24:02,728 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-27 10:24:02,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 10:24:02,728 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 10:24:02,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:24:02,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:24:02,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2022-04-27 10:24:02,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:24:02,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2022-04-27 10:24:02,744 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 29 transitions. [2022-04-27 10:24:02,767 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-27 10:24:02,768 INFO L225 Difference]: With dead ends: 27 [2022-04-27 10:24:02,768 INFO L226 Difference]: Without dead ends: 21 [2022-04-27 10:24:02,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2022-04-27 10:24:02,770 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 15 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:24:02,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 34 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:24:02,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-27 10:24:02,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-04-27 10:24:02,775 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:24:02,775 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 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-27 10:24:02,776 INFO L74 IsIncluded]: Start isIncluded. First operand 21 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-27 10:24:02,776 INFO L87 Difference]: Start difference. First operand 21 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-27 10:24:02,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:24:02,777 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-27 10:24:02,777 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-27 10:24:02,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:24:02,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:24:02,777 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 21 states. [2022-04-27 10:24:02,778 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 21 states. [2022-04-27 10:24:02,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:24:02,779 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-27 10:24:02,779 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-27 10:24:02,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:24:02,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:24:02,779 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:24:02,779 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:24:02,779 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-27 10:24:02,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2022-04-27 10:24:02,780 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 14 [2022-04-27 10:24:02,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:24:02,781 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2022-04-27 10:24:02,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:24:02,781 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-27 10:24:02,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 10:24:02,781 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:24:02,781 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:24:02,799 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-27 10:24:02,995 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-27 10:24:02,996 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:24:02,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:24:02,996 INFO L85 PathProgramCache]: Analyzing trace with hash 990015618, now seen corresponding path program 2 times [2022-04-27 10:24:02,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:24:02,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421270165] [2022-04-27 10:24:02,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:24:02,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:24:03,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:24:03,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:24:03,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:24:03,126 INFO L290 TraceCheckUtils]: 0: Hoare triple {362#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {352#true} is VALID [2022-04-27 10:24:03,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {352#true} assume true; {352#true} is VALID [2022-04-27 10:24:03,127 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {352#true} {352#true} #39#return; {352#true} is VALID [2022-04-27 10:24:03,127 INFO L272 TraceCheckUtils]: 0: Hoare triple {352#true} call ULTIMATE.init(); {362#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:24:03,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {362#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {352#true} is VALID [2022-04-27 10:24:03,128 INFO L290 TraceCheckUtils]: 2: Hoare triple {352#true} assume true; {352#true} is VALID [2022-04-27 10:24:03,128 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {352#true} {352#true} #39#return; {352#true} is VALID [2022-04-27 10:24:03,128 INFO L272 TraceCheckUtils]: 4: Hoare triple {352#true} call #t~ret6 := main(); {352#true} is VALID [2022-04-27 10:24:03,128 INFO L290 TraceCheckUtils]: 5: Hoare triple {352#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {357#(= main_~i~0 0)} is VALID [2022-04-27 10:24:03,128 INFO L290 TraceCheckUtils]: 6: Hoare triple {357#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {357#(= main_~i~0 0)} is VALID [2022-04-27 10:24:03,129 INFO L290 TraceCheckUtils]: 7: Hoare triple {357#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {358#(<= main_~i~0 1)} is VALID [2022-04-27 10:24:03,129 INFO L290 TraceCheckUtils]: 8: Hoare triple {358#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {358#(<= main_~i~0 1)} is VALID [2022-04-27 10:24:03,130 INFO L290 TraceCheckUtils]: 9: Hoare triple {358#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {359#(<= main_~i~0 2)} is VALID [2022-04-27 10:24:03,130 INFO L290 TraceCheckUtils]: 10: Hoare triple {359#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {359#(<= main_~i~0 2)} is VALID [2022-04-27 10:24:03,130 INFO L290 TraceCheckUtils]: 11: Hoare triple {359#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {360#(<= main_~i~0 3)} is VALID [2022-04-27 10:24:03,131 INFO L290 TraceCheckUtils]: 12: Hoare triple {360#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {360#(<= main_~i~0 3)} is VALID [2022-04-27 10:24:03,131 INFO L290 TraceCheckUtils]: 13: Hoare triple {360#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {361#(<= main_~i~0 4)} is VALID [2022-04-27 10:24:03,132 INFO L290 TraceCheckUtils]: 14: Hoare triple {361#(<= main_~i~0 4)} assume !(~i~0 < 1024); {353#false} is VALID [2022-04-27 10:24:03,132 INFO L290 TraceCheckUtils]: 15: Hoare triple {353#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {353#false} is VALID [2022-04-27 10:24:03,132 INFO L272 TraceCheckUtils]: 16: Hoare triple {353#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {353#false} is VALID [2022-04-27 10:24:03,132 INFO L290 TraceCheckUtils]: 17: Hoare triple {353#false} ~cond := #in~cond; {353#false} is VALID [2022-04-27 10:24:03,132 INFO L290 TraceCheckUtils]: 18: Hoare triple {353#false} assume 0 == ~cond; {353#false} is VALID [2022-04-27 10:24:03,132 INFO L290 TraceCheckUtils]: 19: Hoare triple {353#false} assume !false; {353#false} is VALID [2022-04-27 10:24:03,132 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-27 10:24:03,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:24:03,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421270165] [2022-04-27 10:24:03,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421270165] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:24:03,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [344810360] [2022-04-27 10:24:03,148 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 10:24:03,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:24:03,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:24:03,153 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-27 10:24:03,155 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-27 10:24:03,194 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 10:24:03,194 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:24:03,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-27 10:24:03,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:24:03,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:24:03,285 INFO L272 TraceCheckUtils]: 0: Hoare triple {352#true} call ULTIMATE.init(); {352#true} is VALID [2022-04-27 10:24:03,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {352#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {352#true} is VALID [2022-04-27 10:24:03,286 INFO L290 TraceCheckUtils]: 2: Hoare triple {352#true} assume true; {352#true} is VALID [2022-04-27 10:24:03,286 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {352#true} {352#true} #39#return; {352#true} is VALID [2022-04-27 10:24:03,286 INFO L272 TraceCheckUtils]: 4: Hoare triple {352#true} call #t~ret6 := main(); {352#true} is VALID [2022-04-27 10:24:03,286 INFO L290 TraceCheckUtils]: 5: Hoare triple {352#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {381#(<= main_~i~0 0)} is VALID [2022-04-27 10:24:03,287 INFO L290 TraceCheckUtils]: 6: Hoare triple {381#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {381#(<= main_~i~0 0)} is VALID [2022-04-27 10:24:03,287 INFO L290 TraceCheckUtils]: 7: Hoare triple {381#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {358#(<= main_~i~0 1)} is VALID [2022-04-27 10:24:03,288 INFO L290 TraceCheckUtils]: 8: Hoare triple {358#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {358#(<= main_~i~0 1)} is VALID [2022-04-27 10:24:03,288 INFO L290 TraceCheckUtils]: 9: Hoare triple {358#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {359#(<= main_~i~0 2)} is VALID [2022-04-27 10:24:03,288 INFO L290 TraceCheckUtils]: 10: Hoare triple {359#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {359#(<= main_~i~0 2)} is VALID [2022-04-27 10:24:03,289 INFO L290 TraceCheckUtils]: 11: Hoare triple {359#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {360#(<= main_~i~0 3)} is VALID [2022-04-27 10:24:03,289 INFO L290 TraceCheckUtils]: 12: Hoare triple {360#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {360#(<= main_~i~0 3)} is VALID [2022-04-27 10:24:03,290 INFO L290 TraceCheckUtils]: 13: Hoare triple {360#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {361#(<= main_~i~0 4)} is VALID [2022-04-27 10:24:03,290 INFO L290 TraceCheckUtils]: 14: Hoare triple {361#(<= main_~i~0 4)} assume !(~i~0 < 1024); {353#false} is VALID [2022-04-27 10:24:03,290 INFO L290 TraceCheckUtils]: 15: Hoare triple {353#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {353#false} is VALID [2022-04-27 10:24:03,290 INFO L272 TraceCheckUtils]: 16: Hoare triple {353#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {353#false} is VALID [2022-04-27 10:24:03,290 INFO L290 TraceCheckUtils]: 17: Hoare triple {353#false} ~cond := #in~cond; {353#false} is VALID [2022-04-27 10:24:03,290 INFO L290 TraceCheckUtils]: 18: Hoare triple {353#false} assume 0 == ~cond; {353#false} is VALID [2022-04-27 10:24:03,291 INFO L290 TraceCheckUtils]: 19: Hoare triple {353#false} assume !false; {353#false} is VALID [2022-04-27 10:24:03,291 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-27 10:24:03,291 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:24:03,409 INFO L290 TraceCheckUtils]: 19: Hoare triple {353#false} assume !false; {353#false} is VALID [2022-04-27 10:24:03,409 INFO L290 TraceCheckUtils]: 18: Hoare triple {353#false} assume 0 == ~cond; {353#false} is VALID [2022-04-27 10:24:03,409 INFO L290 TraceCheckUtils]: 17: Hoare triple {353#false} ~cond := #in~cond; {353#false} is VALID [2022-04-27 10:24:03,410 INFO L272 TraceCheckUtils]: 16: Hoare triple {353#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {353#false} is VALID [2022-04-27 10:24:03,410 INFO L290 TraceCheckUtils]: 15: Hoare triple {353#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {353#false} is VALID [2022-04-27 10:24:03,410 INFO L290 TraceCheckUtils]: 14: Hoare triple {439#(< main_~i~0 1024)} assume !(~i~0 < 1024); {353#false} is VALID [2022-04-27 10:24:03,411 INFO L290 TraceCheckUtils]: 13: Hoare triple {443#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {439#(< main_~i~0 1024)} is VALID [2022-04-27 10:24:03,411 INFO L290 TraceCheckUtils]: 12: Hoare triple {443#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {443#(< main_~i~0 1023)} is VALID [2022-04-27 10:24:03,411 INFO L290 TraceCheckUtils]: 11: Hoare triple {450#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {443#(< main_~i~0 1023)} is VALID [2022-04-27 10:24:03,412 INFO L290 TraceCheckUtils]: 10: Hoare triple {450#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {450#(< main_~i~0 1022)} is VALID [2022-04-27 10:24:03,412 INFO L290 TraceCheckUtils]: 9: Hoare triple {457#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {450#(< main_~i~0 1022)} is VALID [2022-04-27 10:24:03,414 INFO L290 TraceCheckUtils]: 8: Hoare triple {457#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {457#(< main_~i~0 1021)} is VALID [2022-04-27 10:24:03,414 INFO L290 TraceCheckUtils]: 7: Hoare triple {464#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {457#(< main_~i~0 1021)} is VALID [2022-04-27 10:24:03,414 INFO L290 TraceCheckUtils]: 6: Hoare triple {464#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {464#(< main_~i~0 1020)} is VALID [2022-04-27 10:24:03,416 INFO L290 TraceCheckUtils]: 5: Hoare triple {352#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {464#(< main_~i~0 1020)} is VALID [2022-04-27 10:24:03,416 INFO L272 TraceCheckUtils]: 4: Hoare triple {352#true} call #t~ret6 := main(); {352#true} is VALID [2022-04-27 10:24:03,422 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {352#true} {352#true} #39#return; {352#true} is VALID [2022-04-27 10:24:03,424 INFO L290 TraceCheckUtils]: 2: Hoare triple {352#true} assume true; {352#true} is VALID [2022-04-27 10:24:03,424 INFO L290 TraceCheckUtils]: 1: Hoare triple {352#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {352#true} is VALID [2022-04-27 10:24:03,425 INFO L272 TraceCheckUtils]: 0: Hoare triple {352#true} call ULTIMATE.init(); {352#true} is VALID [2022-04-27 10:24:03,425 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-27 10:24:03,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [344810360] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:24:03,425 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:24:03,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-27 10:24:03,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395199176] [2022-04-27 10:24:03,425 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:24:03,426 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-27 10:24:03,426 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:24:03,426 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:24:03,450 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-27 10:24:03,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 10:24:03,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:24:03,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 10:24:03,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2022-04-27 10:24:03,451 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:24:03,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:24:03,659 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-04-27 10:24:03,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 10:24:03,659 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-27 10:24:03,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:24:03,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:24:03,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 44 transitions. [2022-04-27 10:24:03,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:24:03,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 44 transitions. [2022-04-27 10:24:03,662 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 44 transitions. [2022-04-27 10:24:03,697 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-27 10:24:03,698 INFO L225 Difference]: With dead ends: 39 [2022-04-27 10:24:03,698 INFO L226 Difference]: Without dead ends: 33 [2022-04-27 10:24:03,699 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=211, Invalid=341, Unknown=0, NotChecked=0, Total=552 [2022-04-27 10:24:03,699 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 27 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:24:03,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 29 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:24:03,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-27 10:24:03,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-27 10:24:03,707 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:24:03,707 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 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-27 10:24:03,708 INFO L74 IsIncluded]: Start isIncluded. First operand 33 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-27 10:24:03,708 INFO L87 Difference]: Start difference. First operand 33 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-27 10:24:03,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:24:03,709 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-04-27 10:24:03,709 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-04-27 10:24:03,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:24:03,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:24:03,710 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 33 states. [2022-04-27 10:24:03,710 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 33 states. [2022-04-27 10:24:03,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:24:03,711 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-04-27 10:24:03,711 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-04-27 10:24:03,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:24:03,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:24:03,712 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:24:03,712 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:24:03,712 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-27 10:24:03,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2022-04-27 10:24:03,713 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 20 [2022-04-27 10:24:03,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:24:03,713 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2022-04-27 10:24:03,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:24:03,714 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-04-27 10:24:03,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-27 10:24:03,714 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:24:03,714 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:24:03,738 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-27 10:24:03,938 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-27 10:24:03,938 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:24:03,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:24:03,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1106742514, now seen corresponding path program 3 times [2022-04-27 10:24:03,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:24:03,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309103858] [2022-04-27 10:24:03,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:24:03,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:24:03,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:24:04,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:24:04,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:24:04,105 INFO L290 TraceCheckUtils]: 0: Hoare triple {698#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {682#true} is VALID [2022-04-27 10:24:04,106 INFO L290 TraceCheckUtils]: 1: Hoare triple {682#true} assume true; {682#true} is VALID [2022-04-27 10:24:04,106 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {682#true} {682#true} #39#return; {682#true} is VALID [2022-04-27 10:24:04,106 INFO L272 TraceCheckUtils]: 0: Hoare triple {682#true} call ULTIMATE.init(); {698#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:24:04,106 INFO L290 TraceCheckUtils]: 1: Hoare triple {698#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {682#true} is VALID [2022-04-27 10:24:04,106 INFO L290 TraceCheckUtils]: 2: Hoare triple {682#true} assume true; {682#true} is VALID [2022-04-27 10:24:04,107 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {682#true} {682#true} #39#return; {682#true} is VALID [2022-04-27 10:24:04,107 INFO L272 TraceCheckUtils]: 4: Hoare triple {682#true} call #t~ret6 := main(); {682#true} is VALID [2022-04-27 10:24:04,107 INFO L290 TraceCheckUtils]: 5: Hoare triple {682#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {687#(= main_~i~0 0)} is VALID [2022-04-27 10:24:04,107 INFO L290 TraceCheckUtils]: 6: Hoare triple {687#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {687#(= main_~i~0 0)} is VALID [2022-04-27 10:24:04,108 INFO L290 TraceCheckUtils]: 7: Hoare triple {687#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {688#(<= main_~i~0 1)} is VALID [2022-04-27 10:24:04,108 INFO L290 TraceCheckUtils]: 8: Hoare triple {688#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {688#(<= main_~i~0 1)} is VALID [2022-04-27 10:24:04,108 INFO L290 TraceCheckUtils]: 9: Hoare triple {688#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {689#(<= main_~i~0 2)} is VALID [2022-04-27 10:24:04,109 INFO L290 TraceCheckUtils]: 10: Hoare triple {689#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {689#(<= main_~i~0 2)} is VALID [2022-04-27 10:24:04,109 INFO L290 TraceCheckUtils]: 11: Hoare triple {689#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {690#(<= main_~i~0 3)} is VALID [2022-04-27 10:24:04,109 INFO L290 TraceCheckUtils]: 12: Hoare triple {690#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {690#(<= main_~i~0 3)} is VALID [2022-04-27 10:24:04,110 INFO L290 TraceCheckUtils]: 13: Hoare triple {690#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {691#(<= main_~i~0 4)} is VALID [2022-04-27 10:24:04,110 INFO L290 TraceCheckUtils]: 14: Hoare triple {691#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {691#(<= main_~i~0 4)} is VALID [2022-04-27 10:24:04,110 INFO L290 TraceCheckUtils]: 15: Hoare triple {691#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {692#(<= main_~i~0 5)} is VALID [2022-04-27 10:24:04,111 INFO L290 TraceCheckUtils]: 16: Hoare triple {692#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {692#(<= main_~i~0 5)} is VALID [2022-04-27 10:24:04,111 INFO L290 TraceCheckUtils]: 17: Hoare triple {692#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {693#(<= main_~i~0 6)} is VALID [2022-04-27 10:24:04,111 INFO L290 TraceCheckUtils]: 18: Hoare triple {693#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {693#(<= main_~i~0 6)} is VALID [2022-04-27 10:24:04,112 INFO L290 TraceCheckUtils]: 19: Hoare triple {693#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {694#(<= main_~i~0 7)} is VALID [2022-04-27 10:24:04,112 INFO L290 TraceCheckUtils]: 20: Hoare triple {694#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {694#(<= main_~i~0 7)} is VALID [2022-04-27 10:24:04,112 INFO L290 TraceCheckUtils]: 21: Hoare triple {694#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {695#(<= main_~i~0 8)} is VALID [2022-04-27 10:24:04,112 INFO L290 TraceCheckUtils]: 22: Hoare triple {695#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {695#(<= main_~i~0 8)} is VALID [2022-04-27 10:24:04,113 INFO L290 TraceCheckUtils]: 23: Hoare triple {695#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {696#(<= main_~i~0 9)} is VALID [2022-04-27 10:24:04,113 INFO L290 TraceCheckUtils]: 24: Hoare triple {696#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {696#(<= main_~i~0 9)} is VALID [2022-04-27 10:24:04,113 INFO L290 TraceCheckUtils]: 25: Hoare triple {696#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {697#(<= main_~i~0 10)} is VALID [2022-04-27 10:24:04,114 INFO L290 TraceCheckUtils]: 26: Hoare triple {697#(<= main_~i~0 10)} assume !(~i~0 < 1024); {683#false} is VALID [2022-04-27 10:24:04,114 INFO L290 TraceCheckUtils]: 27: Hoare triple {683#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {683#false} is VALID [2022-04-27 10:24:04,114 INFO L272 TraceCheckUtils]: 28: Hoare triple {683#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {683#false} is VALID [2022-04-27 10:24:04,114 INFO L290 TraceCheckUtils]: 29: Hoare triple {683#false} ~cond := #in~cond; {683#false} is VALID [2022-04-27 10:24:04,114 INFO L290 TraceCheckUtils]: 30: Hoare triple {683#false} assume 0 == ~cond; {683#false} is VALID [2022-04-27 10:24:04,114 INFO L290 TraceCheckUtils]: 31: Hoare triple {683#false} assume !false; {683#false} is VALID [2022-04-27 10:24:04,115 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-27 10:24:04,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:24:04,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309103858] [2022-04-27 10:24:04,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309103858] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:24:04,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2076865158] [2022-04-27 10:24:04,115 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 10:24:04,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:24:04,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:24:04,132 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-27 10:24:04,154 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-27 10:24:04,229 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-04-27 10:24:04,229 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:24:04,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 10:24:04,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:24:04,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:24:04,428 INFO L272 TraceCheckUtils]: 0: Hoare triple {682#true} call ULTIMATE.init(); {682#true} is VALID [2022-04-27 10:24:04,428 INFO L290 TraceCheckUtils]: 1: Hoare triple {682#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {682#true} is VALID [2022-04-27 10:24:04,428 INFO L290 TraceCheckUtils]: 2: Hoare triple {682#true} assume true; {682#true} is VALID [2022-04-27 10:24:04,428 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {682#true} {682#true} #39#return; {682#true} is VALID [2022-04-27 10:24:04,428 INFO L272 TraceCheckUtils]: 4: Hoare triple {682#true} call #t~ret6 := main(); {682#true} is VALID [2022-04-27 10:24:04,429 INFO L290 TraceCheckUtils]: 5: Hoare triple {682#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {717#(<= main_~i~0 0)} is VALID [2022-04-27 10:24:04,429 INFO L290 TraceCheckUtils]: 6: Hoare triple {717#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {717#(<= main_~i~0 0)} is VALID [2022-04-27 10:24:04,430 INFO L290 TraceCheckUtils]: 7: Hoare triple {717#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {688#(<= main_~i~0 1)} is VALID [2022-04-27 10:24:04,430 INFO L290 TraceCheckUtils]: 8: Hoare triple {688#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {688#(<= main_~i~0 1)} is VALID [2022-04-27 10:24:04,431 INFO L290 TraceCheckUtils]: 9: Hoare triple {688#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {689#(<= main_~i~0 2)} is VALID [2022-04-27 10:24:04,431 INFO L290 TraceCheckUtils]: 10: Hoare triple {689#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {689#(<= main_~i~0 2)} is VALID [2022-04-27 10:24:04,431 INFO L290 TraceCheckUtils]: 11: Hoare triple {689#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {690#(<= main_~i~0 3)} is VALID [2022-04-27 10:24:04,432 INFO L290 TraceCheckUtils]: 12: Hoare triple {690#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {690#(<= main_~i~0 3)} is VALID [2022-04-27 10:24:04,432 INFO L290 TraceCheckUtils]: 13: Hoare triple {690#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {691#(<= main_~i~0 4)} is VALID [2022-04-27 10:24:04,432 INFO L290 TraceCheckUtils]: 14: Hoare triple {691#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {691#(<= main_~i~0 4)} is VALID [2022-04-27 10:24:04,433 INFO L290 TraceCheckUtils]: 15: Hoare triple {691#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {692#(<= main_~i~0 5)} is VALID [2022-04-27 10:24:04,433 INFO L290 TraceCheckUtils]: 16: Hoare triple {692#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {692#(<= main_~i~0 5)} is VALID [2022-04-27 10:24:04,434 INFO L290 TraceCheckUtils]: 17: Hoare triple {692#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {693#(<= main_~i~0 6)} is VALID [2022-04-27 10:24:04,434 INFO L290 TraceCheckUtils]: 18: Hoare triple {693#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {693#(<= main_~i~0 6)} is VALID [2022-04-27 10:24:04,434 INFO L290 TraceCheckUtils]: 19: Hoare triple {693#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {694#(<= main_~i~0 7)} is VALID [2022-04-27 10:24:04,435 INFO L290 TraceCheckUtils]: 20: Hoare triple {694#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {694#(<= main_~i~0 7)} is VALID [2022-04-27 10:24:04,435 INFO L290 TraceCheckUtils]: 21: Hoare triple {694#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {695#(<= main_~i~0 8)} is VALID [2022-04-27 10:24:04,436 INFO L290 TraceCheckUtils]: 22: Hoare triple {695#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {695#(<= main_~i~0 8)} is VALID [2022-04-27 10:24:04,436 INFO L290 TraceCheckUtils]: 23: Hoare triple {695#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {696#(<= main_~i~0 9)} is VALID [2022-04-27 10:24:04,436 INFO L290 TraceCheckUtils]: 24: Hoare triple {696#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {696#(<= main_~i~0 9)} is VALID [2022-04-27 10:24:04,437 INFO L290 TraceCheckUtils]: 25: Hoare triple {696#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {697#(<= main_~i~0 10)} is VALID [2022-04-27 10:24:04,437 INFO L290 TraceCheckUtils]: 26: Hoare triple {697#(<= main_~i~0 10)} assume !(~i~0 < 1024); {683#false} is VALID [2022-04-27 10:24:04,437 INFO L290 TraceCheckUtils]: 27: Hoare triple {683#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {683#false} is VALID [2022-04-27 10:24:04,437 INFO L272 TraceCheckUtils]: 28: Hoare triple {683#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {683#false} is VALID [2022-04-27 10:24:04,437 INFO L290 TraceCheckUtils]: 29: Hoare triple {683#false} ~cond := #in~cond; {683#false} is VALID [2022-04-27 10:24:04,438 INFO L290 TraceCheckUtils]: 30: Hoare triple {683#false} assume 0 == ~cond; {683#false} is VALID [2022-04-27 10:24:04,438 INFO L290 TraceCheckUtils]: 31: Hoare triple {683#false} assume !false; {683#false} is VALID [2022-04-27 10:24:04,438 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-27 10:24:04,438 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:24:04,782 INFO L290 TraceCheckUtils]: 31: Hoare triple {683#false} assume !false; {683#false} is VALID [2022-04-27 10:24:04,782 INFO L290 TraceCheckUtils]: 30: Hoare triple {683#false} assume 0 == ~cond; {683#false} is VALID [2022-04-27 10:24:04,782 INFO L290 TraceCheckUtils]: 29: Hoare triple {683#false} ~cond := #in~cond; {683#false} is VALID [2022-04-27 10:24:04,783 INFO L272 TraceCheckUtils]: 28: Hoare triple {683#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {683#false} is VALID [2022-04-27 10:24:04,783 INFO L290 TraceCheckUtils]: 27: Hoare triple {683#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {683#false} is VALID [2022-04-27 10:24:04,783 INFO L290 TraceCheckUtils]: 26: Hoare triple {811#(< main_~i~0 1024)} assume !(~i~0 < 1024); {683#false} is VALID [2022-04-27 10:24:04,784 INFO L290 TraceCheckUtils]: 25: Hoare triple {815#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {811#(< main_~i~0 1024)} is VALID [2022-04-27 10:24:04,784 INFO L290 TraceCheckUtils]: 24: Hoare triple {815#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {815#(< main_~i~0 1023)} is VALID [2022-04-27 10:24:04,784 INFO L290 TraceCheckUtils]: 23: Hoare triple {822#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {815#(< main_~i~0 1023)} is VALID [2022-04-27 10:24:04,785 INFO L290 TraceCheckUtils]: 22: Hoare triple {822#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {822#(< main_~i~0 1022)} is VALID [2022-04-27 10:24:04,785 INFO L290 TraceCheckUtils]: 21: Hoare triple {829#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {822#(< main_~i~0 1022)} is VALID [2022-04-27 10:24:04,786 INFO L290 TraceCheckUtils]: 20: Hoare triple {829#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {829#(< main_~i~0 1021)} is VALID [2022-04-27 10:24:04,786 INFO L290 TraceCheckUtils]: 19: Hoare triple {836#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {829#(< main_~i~0 1021)} is VALID [2022-04-27 10:24:04,786 INFO L290 TraceCheckUtils]: 18: Hoare triple {836#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {836#(< main_~i~0 1020)} is VALID [2022-04-27 10:24:04,787 INFO L290 TraceCheckUtils]: 17: Hoare triple {843#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {836#(< main_~i~0 1020)} is VALID [2022-04-27 10:24:04,787 INFO L290 TraceCheckUtils]: 16: Hoare triple {843#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {843#(< main_~i~0 1019)} is VALID [2022-04-27 10:24:04,788 INFO L290 TraceCheckUtils]: 15: Hoare triple {850#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {843#(< main_~i~0 1019)} is VALID [2022-04-27 10:24:04,788 INFO L290 TraceCheckUtils]: 14: Hoare triple {850#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {850#(< main_~i~0 1018)} is VALID [2022-04-27 10:24:04,788 INFO L290 TraceCheckUtils]: 13: Hoare triple {857#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {850#(< main_~i~0 1018)} is VALID [2022-04-27 10:24:04,789 INFO L290 TraceCheckUtils]: 12: Hoare triple {857#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {857#(< main_~i~0 1017)} is VALID [2022-04-27 10:24:04,789 INFO L290 TraceCheckUtils]: 11: Hoare triple {864#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {857#(< main_~i~0 1017)} is VALID [2022-04-27 10:24:04,789 INFO L290 TraceCheckUtils]: 10: Hoare triple {864#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {864#(< main_~i~0 1016)} is VALID [2022-04-27 10:24:04,790 INFO L290 TraceCheckUtils]: 9: Hoare triple {871#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {864#(< main_~i~0 1016)} is VALID [2022-04-27 10:24:04,790 INFO L290 TraceCheckUtils]: 8: Hoare triple {871#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {871#(< main_~i~0 1015)} is VALID [2022-04-27 10:24:04,791 INFO L290 TraceCheckUtils]: 7: Hoare triple {878#(< main_~i~0 1014)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {871#(< main_~i~0 1015)} is VALID [2022-04-27 10:24:04,791 INFO L290 TraceCheckUtils]: 6: Hoare triple {878#(< main_~i~0 1014)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {878#(< main_~i~0 1014)} is VALID [2022-04-27 10:24:04,791 INFO L290 TraceCheckUtils]: 5: Hoare triple {682#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {878#(< main_~i~0 1014)} is VALID [2022-04-27 10:24:04,792 INFO L272 TraceCheckUtils]: 4: Hoare triple {682#true} call #t~ret6 := main(); {682#true} is VALID [2022-04-27 10:24:04,792 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {682#true} {682#true} #39#return; {682#true} is VALID [2022-04-27 10:24:04,792 INFO L290 TraceCheckUtils]: 2: Hoare triple {682#true} assume true; {682#true} is VALID [2022-04-27 10:24:04,792 INFO L290 TraceCheckUtils]: 1: Hoare triple {682#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {682#true} is VALID [2022-04-27 10:24:04,792 INFO L272 TraceCheckUtils]: 0: Hoare triple {682#true} call ULTIMATE.init(); {682#true} is VALID [2022-04-27 10:24:04,792 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-27 10:24:04,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2076865158] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:24:04,792 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:24:04,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-04-27 10:24:04,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011304611] [2022-04-27 10:24:04,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:24:04,793 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.076923076923077) internal successors, (54), 25 states have internal predecessors, (54), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-27 10:24:04,794 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:24:04,794 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 2.076923076923077) internal successors, (54), 25 states have internal predecessors, (54), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:24:04,833 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-27 10:24:04,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-27 10:24:04,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:24:04,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-27 10:24:04,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=348, Unknown=0, NotChecked=0, Total=650 [2022-04-27 10:24:04,835 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand has 26 states, 26 states have (on average 2.076923076923077) internal successors, (54), 25 states have internal predecessors, (54), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:24:05,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:24:05,273 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2022-04-27 10:24:05,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-27 10:24:05,273 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.076923076923077) internal successors, (54), 25 states have internal predecessors, (54), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-27 10:24:05,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:24:05,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 2.076923076923077) internal successors, (54), 25 states have internal predecessors, (54), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:24:05,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 74 transitions. [2022-04-27 10:24:05,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 2.076923076923077) internal successors, (54), 25 states have internal predecessors, (54), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:24:05,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 74 transitions. [2022-04-27 10:24:05,277 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 74 transitions. [2022-04-27 10:24:05,329 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-27 10:24:05,331 INFO L225 Difference]: With dead ends: 63 [2022-04-27 10:24:05,331 INFO L226 Difference]: Without dead ends: 57 [2022-04-27 10:24:05,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=853, Invalid=1403, Unknown=0, NotChecked=0, Total=2256 [2022-04-27 10:24:05,332 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 51 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:24:05,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 44 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:24:05,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-27 10:24:05,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-04-27 10:24:05,349 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:24:05,349 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 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-27 10:24:05,349 INFO L74 IsIncluded]: Start isIncluded. First operand 57 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-27 10:24:05,350 INFO L87 Difference]: Start difference. First operand 57 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-27 10:24:05,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:24:05,351 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2022-04-27 10:24:05,351 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2022-04-27 10:24:05,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:24:05,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:24:05,352 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 57 states. [2022-04-27 10:24:05,352 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 57 states. [2022-04-27 10:24:05,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:24:05,353 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2022-04-27 10:24:05,353 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2022-04-27 10:24:05,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:24:05,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:24:05,354 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:24:05,354 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:24:05,354 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-27 10:24:05,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2022-04-27 10:24:05,355 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 32 [2022-04-27 10:24:05,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:24:05,356 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2022-04-27 10:24:05,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.076923076923077) internal successors, (54), 25 states have internal predecessors, (54), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:24:05,356 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2022-04-27 10:24:05,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-27 10:24:05,357 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:24:05,357 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:24:05,387 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-27 10:24:05,573 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-27 10:24:05,573 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:24:05,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:24:05,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1506615846, now seen corresponding path program 4 times [2022-04-27 10:24:05,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:24:05,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510447900] [2022-04-27 10:24:05,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:24:05,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:24:05,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:24:05,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:24:05,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:24:05,890 INFO L290 TraceCheckUtils]: 0: Hoare triple {1268#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1240#true} is VALID [2022-04-27 10:24:05,890 INFO L290 TraceCheckUtils]: 1: Hoare triple {1240#true} assume true; {1240#true} is VALID [2022-04-27 10:24:05,890 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1240#true} {1240#true} #39#return; {1240#true} is VALID [2022-04-27 10:24:05,891 INFO L272 TraceCheckUtils]: 0: Hoare triple {1240#true} call ULTIMATE.init(); {1268#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:24:05,891 INFO L290 TraceCheckUtils]: 1: Hoare triple {1268#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1240#true} is VALID [2022-04-27 10:24:05,891 INFO L290 TraceCheckUtils]: 2: Hoare triple {1240#true} assume true; {1240#true} is VALID [2022-04-27 10:24:05,891 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1240#true} {1240#true} #39#return; {1240#true} is VALID [2022-04-27 10:24:05,891 INFO L272 TraceCheckUtils]: 4: Hoare triple {1240#true} call #t~ret6 := main(); {1240#true} is VALID [2022-04-27 10:24:05,891 INFO L290 TraceCheckUtils]: 5: Hoare triple {1240#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {1245#(= main_~i~0 0)} is VALID [2022-04-27 10:24:05,892 INFO L290 TraceCheckUtils]: 6: Hoare triple {1245#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1245#(= main_~i~0 0)} is VALID [2022-04-27 10:24:05,892 INFO L290 TraceCheckUtils]: 7: Hoare triple {1245#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1246#(<= main_~i~0 1)} is VALID [2022-04-27 10:24:05,892 INFO L290 TraceCheckUtils]: 8: Hoare triple {1246#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1246#(<= main_~i~0 1)} is VALID [2022-04-27 10:24:05,893 INFO L290 TraceCheckUtils]: 9: Hoare triple {1246#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1247#(<= main_~i~0 2)} is VALID [2022-04-27 10:24:05,893 INFO L290 TraceCheckUtils]: 10: Hoare triple {1247#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1247#(<= main_~i~0 2)} is VALID [2022-04-27 10:24:05,893 INFO L290 TraceCheckUtils]: 11: Hoare triple {1247#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1248#(<= main_~i~0 3)} is VALID [2022-04-27 10:24:05,894 INFO L290 TraceCheckUtils]: 12: Hoare triple {1248#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1248#(<= main_~i~0 3)} is VALID [2022-04-27 10:24:05,894 INFO L290 TraceCheckUtils]: 13: Hoare triple {1248#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1249#(<= main_~i~0 4)} is VALID [2022-04-27 10:24:05,894 INFO L290 TraceCheckUtils]: 14: Hoare triple {1249#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1249#(<= main_~i~0 4)} is VALID [2022-04-27 10:24:05,895 INFO L290 TraceCheckUtils]: 15: Hoare triple {1249#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1250#(<= main_~i~0 5)} is VALID [2022-04-27 10:24:05,895 INFO L290 TraceCheckUtils]: 16: Hoare triple {1250#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1250#(<= main_~i~0 5)} is VALID [2022-04-27 10:24:05,899 INFO L290 TraceCheckUtils]: 17: Hoare triple {1250#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1251#(<= main_~i~0 6)} is VALID [2022-04-27 10:24:05,900 INFO L290 TraceCheckUtils]: 18: Hoare triple {1251#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1251#(<= main_~i~0 6)} is VALID [2022-04-27 10:24:05,900 INFO L290 TraceCheckUtils]: 19: Hoare triple {1251#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1252#(<= main_~i~0 7)} is VALID [2022-04-27 10:24:05,901 INFO L290 TraceCheckUtils]: 20: Hoare triple {1252#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1252#(<= main_~i~0 7)} is VALID [2022-04-27 10:24:05,902 INFO L290 TraceCheckUtils]: 21: Hoare triple {1252#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1253#(<= main_~i~0 8)} is VALID [2022-04-27 10:24:05,902 INFO L290 TraceCheckUtils]: 22: Hoare triple {1253#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1253#(<= main_~i~0 8)} is VALID [2022-04-27 10:24:05,904 INFO L290 TraceCheckUtils]: 23: Hoare triple {1253#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1254#(<= main_~i~0 9)} is VALID [2022-04-27 10:24:05,904 INFO L290 TraceCheckUtils]: 24: Hoare triple {1254#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1254#(<= main_~i~0 9)} is VALID [2022-04-27 10:24:05,905 INFO L290 TraceCheckUtils]: 25: Hoare triple {1254#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1255#(<= main_~i~0 10)} is VALID [2022-04-27 10:24:05,905 INFO L290 TraceCheckUtils]: 26: Hoare triple {1255#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1255#(<= main_~i~0 10)} is VALID [2022-04-27 10:24:05,906 INFO L290 TraceCheckUtils]: 27: Hoare triple {1255#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1256#(<= main_~i~0 11)} is VALID [2022-04-27 10:24:05,906 INFO L290 TraceCheckUtils]: 28: Hoare triple {1256#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1256#(<= main_~i~0 11)} is VALID [2022-04-27 10:24:05,907 INFO L290 TraceCheckUtils]: 29: Hoare triple {1256#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1257#(<= main_~i~0 12)} is VALID [2022-04-27 10:24:05,910 INFO L290 TraceCheckUtils]: 30: Hoare triple {1257#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1257#(<= main_~i~0 12)} is VALID [2022-04-27 10:24:05,911 INFO L290 TraceCheckUtils]: 31: Hoare triple {1257#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1258#(<= main_~i~0 13)} is VALID [2022-04-27 10:24:05,911 INFO L290 TraceCheckUtils]: 32: Hoare triple {1258#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1258#(<= main_~i~0 13)} is VALID [2022-04-27 10:24:05,912 INFO L290 TraceCheckUtils]: 33: Hoare triple {1258#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1259#(<= main_~i~0 14)} is VALID [2022-04-27 10:24:05,912 INFO L290 TraceCheckUtils]: 34: Hoare triple {1259#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1259#(<= main_~i~0 14)} is VALID [2022-04-27 10:24:05,912 INFO L290 TraceCheckUtils]: 35: Hoare triple {1259#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1260#(<= main_~i~0 15)} is VALID [2022-04-27 10:24:05,913 INFO L290 TraceCheckUtils]: 36: Hoare triple {1260#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1260#(<= main_~i~0 15)} is VALID [2022-04-27 10:24:05,913 INFO L290 TraceCheckUtils]: 37: Hoare triple {1260#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1261#(<= main_~i~0 16)} is VALID [2022-04-27 10:24:05,913 INFO L290 TraceCheckUtils]: 38: Hoare triple {1261#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1261#(<= main_~i~0 16)} is VALID [2022-04-27 10:24:05,913 INFO L290 TraceCheckUtils]: 39: Hoare triple {1261#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1262#(<= main_~i~0 17)} is VALID [2022-04-27 10:24:05,914 INFO L290 TraceCheckUtils]: 40: Hoare triple {1262#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1262#(<= main_~i~0 17)} is VALID [2022-04-27 10:24:05,914 INFO L290 TraceCheckUtils]: 41: Hoare triple {1262#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1263#(<= main_~i~0 18)} is VALID [2022-04-27 10:24:05,914 INFO L290 TraceCheckUtils]: 42: Hoare triple {1263#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1263#(<= main_~i~0 18)} is VALID [2022-04-27 10:24:05,915 INFO L290 TraceCheckUtils]: 43: Hoare triple {1263#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1264#(<= main_~i~0 19)} is VALID [2022-04-27 10:24:05,915 INFO L290 TraceCheckUtils]: 44: Hoare triple {1264#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1264#(<= main_~i~0 19)} is VALID [2022-04-27 10:24:05,915 INFO L290 TraceCheckUtils]: 45: Hoare triple {1264#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1265#(<= main_~i~0 20)} is VALID [2022-04-27 10:24:05,915 INFO L290 TraceCheckUtils]: 46: Hoare triple {1265#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1265#(<= main_~i~0 20)} is VALID [2022-04-27 10:24:05,916 INFO L290 TraceCheckUtils]: 47: Hoare triple {1265#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1266#(<= main_~i~0 21)} is VALID [2022-04-27 10:24:05,916 INFO L290 TraceCheckUtils]: 48: Hoare triple {1266#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1266#(<= main_~i~0 21)} is VALID [2022-04-27 10:24:05,916 INFO L290 TraceCheckUtils]: 49: Hoare triple {1266#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1267#(<= main_~i~0 22)} is VALID [2022-04-27 10:24:05,917 INFO L290 TraceCheckUtils]: 50: Hoare triple {1267#(<= main_~i~0 22)} assume !(~i~0 < 1024); {1241#false} is VALID [2022-04-27 10:24:05,917 INFO L290 TraceCheckUtils]: 51: Hoare triple {1241#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {1241#false} is VALID [2022-04-27 10:24:05,917 INFO L272 TraceCheckUtils]: 52: Hoare triple {1241#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {1241#false} is VALID [2022-04-27 10:24:05,917 INFO L290 TraceCheckUtils]: 53: Hoare triple {1241#false} ~cond := #in~cond; {1241#false} is VALID [2022-04-27 10:24:05,917 INFO L290 TraceCheckUtils]: 54: Hoare triple {1241#false} assume 0 == ~cond; {1241#false} is VALID [2022-04-27 10:24:05,917 INFO L290 TraceCheckUtils]: 55: Hoare triple {1241#false} assume !false; {1241#false} is VALID [2022-04-27 10:24:05,918 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-27 10:24:05,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:24:05,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510447900] [2022-04-27 10:24:05,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510447900] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:24:05,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089326863] [2022-04-27 10:24:05,918 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 10:24:05,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:24:05,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:24:05,921 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-27 10:24:05,922 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-27 10:24:05,980 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 10:24:05,981 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:24:05,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-27 10:24:05,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:24:05,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:24:06,285 INFO L272 TraceCheckUtils]: 0: Hoare triple {1240#true} call ULTIMATE.init(); {1240#true} is VALID [2022-04-27 10:24:06,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {1240#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {1240#true} is VALID [2022-04-27 10:24:06,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {1240#true} assume true; {1240#true} is VALID [2022-04-27 10:24:06,285 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1240#true} {1240#true} #39#return; {1240#true} is VALID [2022-04-27 10:24:06,285 INFO L272 TraceCheckUtils]: 4: Hoare triple {1240#true} call #t~ret6 := main(); {1240#true} is VALID [2022-04-27 10:24:06,286 INFO L290 TraceCheckUtils]: 5: Hoare triple {1240#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {1287#(<= main_~i~0 0)} is VALID [2022-04-27 10:24:06,286 INFO L290 TraceCheckUtils]: 6: Hoare triple {1287#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1287#(<= main_~i~0 0)} is VALID [2022-04-27 10:24:06,287 INFO L290 TraceCheckUtils]: 7: Hoare triple {1287#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1246#(<= main_~i~0 1)} is VALID [2022-04-27 10:24:06,287 INFO L290 TraceCheckUtils]: 8: Hoare triple {1246#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1246#(<= main_~i~0 1)} is VALID [2022-04-27 10:24:06,287 INFO L290 TraceCheckUtils]: 9: Hoare triple {1246#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1247#(<= main_~i~0 2)} is VALID [2022-04-27 10:24:06,288 INFO L290 TraceCheckUtils]: 10: Hoare triple {1247#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1247#(<= main_~i~0 2)} is VALID [2022-04-27 10:24:06,288 INFO L290 TraceCheckUtils]: 11: Hoare triple {1247#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1248#(<= main_~i~0 3)} is VALID [2022-04-27 10:24:06,288 INFO L290 TraceCheckUtils]: 12: Hoare triple {1248#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1248#(<= main_~i~0 3)} is VALID [2022-04-27 10:24:06,289 INFO L290 TraceCheckUtils]: 13: Hoare triple {1248#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1249#(<= main_~i~0 4)} is VALID [2022-04-27 10:24:06,289 INFO L290 TraceCheckUtils]: 14: Hoare triple {1249#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1249#(<= main_~i~0 4)} is VALID [2022-04-27 10:24:06,289 INFO L290 TraceCheckUtils]: 15: Hoare triple {1249#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1250#(<= main_~i~0 5)} is VALID [2022-04-27 10:24:06,289 INFO L290 TraceCheckUtils]: 16: Hoare triple {1250#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1250#(<= main_~i~0 5)} is VALID [2022-04-27 10:24:06,290 INFO L290 TraceCheckUtils]: 17: Hoare triple {1250#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1251#(<= main_~i~0 6)} is VALID [2022-04-27 10:24:06,290 INFO L290 TraceCheckUtils]: 18: Hoare triple {1251#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1251#(<= main_~i~0 6)} is VALID [2022-04-27 10:24:06,290 INFO L290 TraceCheckUtils]: 19: Hoare triple {1251#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1252#(<= main_~i~0 7)} is VALID [2022-04-27 10:24:06,291 INFO L290 TraceCheckUtils]: 20: Hoare triple {1252#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1252#(<= main_~i~0 7)} is VALID [2022-04-27 10:24:06,291 INFO L290 TraceCheckUtils]: 21: Hoare triple {1252#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1253#(<= main_~i~0 8)} is VALID [2022-04-27 10:24:06,291 INFO L290 TraceCheckUtils]: 22: Hoare triple {1253#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1253#(<= main_~i~0 8)} is VALID [2022-04-27 10:24:06,292 INFO L290 TraceCheckUtils]: 23: Hoare triple {1253#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1254#(<= main_~i~0 9)} is VALID [2022-04-27 10:24:06,292 INFO L290 TraceCheckUtils]: 24: Hoare triple {1254#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1254#(<= main_~i~0 9)} is VALID [2022-04-27 10:24:06,292 INFO L290 TraceCheckUtils]: 25: Hoare triple {1254#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1255#(<= main_~i~0 10)} is VALID [2022-04-27 10:24:06,293 INFO L290 TraceCheckUtils]: 26: Hoare triple {1255#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1255#(<= main_~i~0 10)} is VALID [2022-04-27 10:24:06,293 INFO L290 TraceCheckUtils]: 27: Hoare triple {1255#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1256#(<= main_~i~0 11)} is VALID [2022-04-27 10:24:06,293 INFO L290 TraceCheckUtils]: 28: Hoare triple {1256#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1256#(<= main_~i~0 11)} is VALID [2022-04-27 10:24:06,294 INFO L290 TraceCheckUtils]: 29: Hoare triple {1256#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1257#(<= main_~i~0 12)} is VALID [2022-04-27 10:24:06,294 INFO L290 TraceCheckUtils]: 30: Hoare triple {1257#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1257#(<= main_~i~0 12)} is VALID [2022-04-27 10:24:06,294 INFO L290 TraceCheckUtils]: 31: Hoare triple {1257#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1258#(<= main_~i~0 13)} is VALID [2022-04-27 10:24:06,295 INFO L290 TraceCheckUtils]: 32: Hoare triple {1258#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1258#(<= main_~i~0 13)} is VALID [2022-04-27 10:24:06,295 INFO L290 TraceCheckUtils]: 33: Hoare triple {1258#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1259#(<= main_~i~0 14)} is VALID [2022-04-27 10:24:06,295 INFO L290 TraceCheckUtils]: 34: Hoare triple {1259#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1259#(<= main_~i~0 14)} is VALID [2022-04-27 10:24:06,296 INFO L290 TraceCheckUtils]: 35: Hoare triple {1259#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1260#(<= main_~i~0 15)} is VALID [2022-04-27 10:24:06,296 INFO L290 TraceCheckUtils]: 36: Hoare triple {1260#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1260#(<= main_~i~0 15)} is VALID [2022-04-27 10:24:06,296 INFO L290 TraceCheckUtils]: 37: Hoare triple {1260#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1261#(<= main_~i~0 16)} is VALID [2022-04-27 10:24:06,297 INFO L290 TraceCheckUtils]: 38: Hoare triple {1261#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1261#(<= main_~i~0 16)} is VALID [2022-04-27 10:24:06,297 INFO L290 TraceCheckUtils]: 39: Hoare triple {1261#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1262#(<= main_~i~0 17)} is VALID [2022-04-27 10:24:06,297 INFO L290 TraceCheckUtils]: 40: Hoare triple {1262#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1262#(<= main_~i~0 17)} is VALID [2022-04-27 10:24:06,298 INFO L290 TraceCheckUtils]: 41: Hoare triple {1262#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1263#(<= main_~i~0 18)} is VALID [2022-04-27 10:24:06,298 INFO L290 TraceCheckUtils]: 42: Hoare triple {1263#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1263#(<= main_~i~0 18)} is VALID [2022-04-27 10:24:06,298 INFO L290 TraceCheckUtils]: 43: Hoare triple {1263#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1264#(<= main_~i~0 19)} is VALID [2022-04-27 10:24:06,298 INFO L290 TraceCheckUtils]: 44: Hoare triple {1264#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1264#(<= main_~i~0 19)} is VALID [2022-04-27 10:24:06,299 INFO L290 TraceCheckUtils]: 45: Hoare triple {1264#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1265#(<= main_~i~0 20)} is VALID [2022-04-27 10:24:06,299 INFO L290 TraceCheckUtils]: 46: Hoare triple {1265#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1265#(<= main_~i~0 20)} is VALID [2022-04-27 10:24:06,299 INFO L290 TraceCheckUtils]: 47: Hoare triple {1265#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1266#(<= main_~i~0 21)} is VALID [2022-04-27 10:24:06,300 INFO L290 TraceCheckUtils]: 48: Hoare triple {1266#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1266#(<= main_~i~0 21)} is VALID [2022-04-27 10:24:06,300 INFO L290 TraceCheckUtils]: 49: Hoare triple {1266#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1267#(<= main_~i~0 22)} is VALID [2022-04-27 10:24:06,300 INFO L290 TraceCheckUtils]: 50: Hoare triple {1267#(<= main_~i~0 22)} assume !(~i~0 < 1024); {1241#false} is VALID [2022-04-27 10:24:06,300 INFO L290 TraceCheckUtils]: 51: Hoare triple {1241#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {1241#false} is VALID [2022-04-27 10:24:06,301 INFO L272 TraceCheckUtils]: 52: Hoare triple {1241#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {1241#false} is VALID [2022-04-27 10:24:06,301 INFO L290 TraceCheckUtils]: 53: Hoare triple {1241#false} ~cond := #in~cond; {1241#false} is VALID [2022-04-27 10:24:06,301 INFO L290 TraceCheckUtils]: 54: Hoare triple {1241#false} assume 0 == ~cond; {1241#false} is VALID [2022-04-27 10:24:06,301 INFO L290 TraceCheckUtils]: 55: Hoare triple {1241#false} assume !false; {1241#false} is VALID [2022-04-27 10:24:06,301 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-27 10:24:06,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:24:07,147 INFO L290 TraceCheckUtils]: 55: Hoare triple {1241#false} assume !false; {1241#false} is VALID [2022-04-27 10:24:07,147 INFO L290 TraceCheckUtils]: 54: Hoare triple {1241#false} assume 0 == ~cond; {1241#false} is VALID [2022-04-27 10:24:07,147 INFO L290 TraceCheckUtils]: 53: Hoare triple {1241#false} ~cond := #in~cond; {1241#false} is VALID [2022-04-27 10:24:07,147 INFO L272 TraceCheckUtils]: 52: Hoare triple {1241#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {1241#false} is VALID [2022-04-27 10:24:07,148 INFO L290 TraceCheckUtils]: 51: Hoare triple {1241#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {1241#false} is VALID [2022-04-27 10:24:07,148 INFO L290 TraceCheckUtils]: 50: Hoare triple {1453#(< main_~i~0 1024)} assume !(~i~0 < 1024); {1241#false} is VALID [2022-04-27 10:24:07,149 INFO L290 TraceCheckUtils]: 49: Hoare triple {1457#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1453#(< main_~i~0 1024)} is VALID [2022-04-27 10:24:07,149 INFO L290 TraceCheckUtils]: 48: Hoare triple {1457#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1457#(< main_~i~0 1023)} is VALID [2022-04-27 10:24:07,150 INFO L290 TraceCheckUtils]: 47: Hoare triple {1464#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1457#(< main_~i~0 1023)} is VALID [2022-04-27 10:24:07,150 INFO L290 TraceCheckUtils]: 46: Hoare triple {1464#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1464#(< main_~i~0 1022)} is VALID [2022-04-27 10:24:07,150 INFO L290 TraceCheckUtils]: 45: Hoare triple {1471#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1464#(< main_~i~0 1022)} is VALID [2022-04-27 10:24:07,151 INFO L290 TraceCheckUtils]: 44: Hoare triple {1471#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1471#(< main_~i~0 1021)} is VALID [2022-04-27 10:24:07,151 INFO L290 TraceCheckUtils]: 43: Hoare triple {1478#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1471#(< main_~i~0 1021)} is VALID [2022-04-27 10:24:07,151 INFO L290 TraceCheckUtils]: 42: Hoare triple {1478#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1478#(< main_~i~0 1020)} is VALID [2022-04-27 10:24:07,152 INFO L290 TraceCheckUtils]: 41: Hoare triple {1485#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1478#(< main_~i~0 1020)} is VALID [2022-04-27 10:24:07,152 INFO L290 TraceCheckUtils]: 40: Hoare triple {1485#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1485#(< main_~i~0 1019)} is VALID [2022-04-27 10:24:07,152 INFO L290 TraceCheckUtils]: 39: Hoare triple {1492#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1485#(< main_~i~0 1019)} is VALID [2022-04-27 10:24:07,153 INFO L290 TraceCheckUtils]: 38: Hoare triple {1492#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1492#(< main_~i~0 1018)} is VALID [2022-04-27 10:24:07,153 INFO L290 TraceCheckUtils]: 37: Hoare triple {1499#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1492#(< main_~i~0 1018)} is VALID [2022-04-27 10:24:07,153 INFO L290 TraceCheckUtils]: 36: Hoare triple {1499#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1499#(< main_~i~0 1017)} is VALID [2022-04-27 10:24:07,154 INFO L290 TraceCheckUtils]: 35: Hoare triple {1506#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1499#(< main_~i~0 1017)} is VALID [2022-04-27 10:24:07,154 INFO L290 TraceCheckUtils]: 34: Hoare triple {1506#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1506#(< main_~i~0 1016)} is VALID [2022-04-27 10:24:07,154 INFO L290 TraceCheckUtils]: 33: Hoare triple {1513#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1506#(< main_~i~0 1016)} is VALID [2022-04-27 10:24:07,155 INFO L290 TraceCheckUtils]: 32: Hoare triple {1513#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1513#(< main_~i~0 1015)} is VALID [2022-04-27 10:24:07,155 INFO L290 TraceCheckUtils]: 31: Hoare triple {1520#(< main_~i~0 1014)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1513#(< main_~i~0 1015)} is VALID [2022-04-27 10:24:07,155 INFO L290 TraceCheckUtils]: 30: Hoare triple {1520#(< main_~i~0 1014)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1520#(< main_~i~0 1014)} is VALID [2022-04-27 10:24:07,156 INFO L290 TraceCheckUtils]: 29: Hoare triple {1527#(< main_~i~0 1013)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1520#(< main_~i~0 1014)} is VALID [2022-04-27 10:24:07,156 INFO L290 TraceCheckUtils]: 28: Hoare triple {1527#(< main_~i~0 1013)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1527#(< main_~i~0 1013)} is VALID [2022-04-27 10:24:07,156 INFO L290 TraceCheckUtils]: 27: Hoare triple {1534#(< main_~i~0 1012)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1527#(< main_~i~0 1013)} is VALID [2022-04-27 10:24:07,157 INFO L290 TraceCheckUtils]: 26: Hoare triple {1534#(< main_~i~0 1012)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1534#(< main_~i~0 1012)} is VALID [2022-04-27 10:24:07,157 INFO L290 TraceCheckUtils]: 25: Hoare triple {1541#(< main_~i~0 1011)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1534#(< main_~i~0 1012)} is VALID [2022-04-27 10:24:07,157 INFO L290 TraceCheckUtils]: 24: Hoare triple {1541#(< main_~i~0 1011)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1541#(< main_~i~0 1011)} is VALID [2022-04-27 10:24:07,158 INFO L290 TraceCheckUtils]: 23: Hoare triple {1548#(< main_~i~0 1010)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1541#(< main_~i~0 1011)} is VALID [2022-04-27 10:24:07,158 INFO L290 TraceCheckUtils]: 22: Hoare triple {1548#(< main_~i~0 1010)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1548#(< main_~i~0 1010)} is VALID [2022-04-27 10:24:07,159 INFO L290 TraceCheckUtils]: 21: Hoare triple {1555#(< main_~i~0 1009)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1548#(< main_~i~0 1010)} is VALID [2022-04-27 10:24:07,159 INFO L290 TraceCheckUtils]: 20: Hoare triple {1555#(< main_~i~0 1009)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1555#(< main_~i~0 1009)} is VALID [2022-04-27 10:24:07,160 INFO L290 TraceCheckUtils]: 19: Hoare triple {1562#(< main_~i~0 1008)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1555#(< main_~i~0 1009)} is VALID [2022-04-27 10:24:07,160 INFO L290 TraceCheckUtils]: 18: Hoare triple {1562#(< main_~i~0 1008)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1562#(< main_~i~0 1008)} is VALID [2022-04-27 10:24:07,165 INFO L290 TraceCheckUtils]: 17: Hoare triple {1569#(< main_~i~0 1007)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1562#(< main_~i~0 1008)} is VALID [2022-04-27 10:24:07,165 INFO L290 TraceCheckUtils]: 16: Hoare triple {1569#(< main_~i~0 1007)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1569#(< main_~i~0 1007)} is VALID [2022-04-27 10:24:07,166 INFO L290 TraceCheckUtils]: 15: Hoare triple {1576#(< main_~i~0 1006)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1569#(< main_~i~0 1007)} is VALID [2022-04-27 10:24:07,166 INFO L290 TraceCheckUtils]: 14: Hoare triple {1576#(< main_~i~0 1006)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1576#(< main_~i~0 1006)} is VALID [2022-04-27 10:24:07,166 INFO L290 TraceCheckUtils]: 13: Hoare triple {1583#(< main_~i~0 1005)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1576#(< main_~i~0 1006)} is VALID [2022-04-27 10:24:07,167 INFO L290 TraceCheckUtils]: 12: Hoare triple {1583#(< main_~i~0 1005)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1583#(< main_~i~0 1005)} is VALID [2022-04-27 10:24:07,167 INFO L290 TraceCheckUtils]: 11: Hoare triple {1590#(< main_~i~0 1004)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1583#(< main_~i~0 1005)} is VALID [2022-04-27 10:24:07,168 INFO L290 TraceCheckUtils]: 10: Hoare triple {1590#(< main_~i~0 1004)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1590#(< main_~i~0 1004)} is VALID [2022-04-27 10:24:07,170 INFO L290 TraceCheckUtils]: 9: Hoare triple {1597#(< main_~i~0 1003)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1590#(< main_~i~0 1004)} is VALID [2022-04-27 10:24:07,170 INFO L290 TraceCheckUtils]: 8: Hoare triple {1597#(< main_~i~0 1003)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1597#(< main_~i~0 1003)} is VALID [2022-04-27 10:24:07,171 INFO L290 TraceCheckUtils]: 7: Hoare triple {1604#(< main_~i~0 1002)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1597#(< main_~i~0 1003)} is VALID [2022-04-27 10:24:07,171 INFO L290 TraceCheckUtils]: 6: Hoare triple {1604#(< main_~i~0 1002)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1604#(< main_~i~0 1002)} is VALID [2022-04-27 10:24:07,171 INFO L290 TraceCheckUtils]: 5: Hoare triple {1240#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {1604#(< main_~i~0 1002)} is VALID [2022-04-27 10:24:07,172 INFO L272 TraceCheckUtils]: 4: Hoare triple {1240#true} call #t~ret6 := main(); {1240#true} is VALID [2022-04-27 10:24:07,172 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1240#true} {1240#true} #39#return; {1240#true} is VALID [2022-04-27 10:24:07,172 INFO L290 TraceCheckUtils]: 2: Hoare triple {1240#true} assume true; {1240#true} is VALID [2022-04-27 10:24:07,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {1240#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {1240#true} is VALID [2022-04-27 10:24:07,172 INFO L272 TraceCheckUtils]: 0: Hoare triple {1240#true} call ULTIMATE.init(); {1240#true} is VALID [2022-04-27 10:24:07,172 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-27 10:24:07,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2089326863] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:24:07,173 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:24:07,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 50 [2022-04-27 10:24:07,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56004138] [2022-04-27 10:24:07,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:24:07,174 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.04) internal successors, (102), 49 states have internal predecessors, (102), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2022-04-27 10:24:07,174 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:24:07,174 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 50 states, 50 states have (on average 2.04) internal successors, (102), 49 states have internal predecessors, (102), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:24:07,239 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-27 10:24:07,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-04-27 10:24:07,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:24:07,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-04-27 10:24:07,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1178, Invalid=1272, Unknown=0, NotChecked=0, Total=2450 [2022-04-27 10:24:07,241 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand has 50 states, 50 states have (on average 2.04) internal successors, (102), 49 states have internal predecessors, (102), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:24:08,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:24:08,346 INFO L93 Difference]: Finished difference Result 111 states and 134 transitions. [2022-04-27 10:24:08,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-04-27 10:24:08,346 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.04) internal successors, (102), 49 states have internal predecessors, (102), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2022-04-27 10:24:08,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:24:08,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 2.04) internal successors, (102), 49 states have internal predecessors, (102), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:24:08,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 134 transitions. [2022-04-27 10:24:08,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 2.04) internal successors, (102), 49 states have internal predecessors, (102), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:24:08,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 134 transitions. [2022-04-27 10:24:08,351 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 134 transitions. [2022-04-27 10:24:08,445 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:24:08,447 INFO L225 Difference]: With dead ends: 111 [2022-04-27 10:24:08,447 INFO L226 Difference]: Without dead ends: 105 [2022-04-27 10:24:08,450 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1420 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=3433, Invalid=5687, Unknown=0, NotChecked=0, Total=9120 [2022-04-27 10:24:08,450 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 99 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:24:08,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 44 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:24:08,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-04-27 10:24:08,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2022-04-27 10:24:08,483 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:24:08,484 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 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-27 10:24:08,484 INFO L74 IsIncluded]: Start isIncluded. First operand 105 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-27 10:24:08,484 INFO L87 Difference]: Start difference. First operand 105 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-27 10:24:08,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:24:08,486 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2022-04-27 10:24:08,486 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2022-04-27 10:24:08,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:24:08,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:24:08,487 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 105 states. [2022-04-27 10:24:08,487 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 105 states. [2022-04-27 10:24:08,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:24:08,489 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2022-04-27 10:24:08,489 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2022-04-27 10:24:08,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:24:08,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:24:08,490 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:24:08,490 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:24:08,490 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-27 10:24:08,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2022-04-27 10:24:08,492 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 56 [2022-04-27 10:24:08,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:24:08,492 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2022-04-27 10:24:08,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.04) internal successors, (102), 49 states have internal predecessors, (102), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:24:08,493 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2022-04-27 10:24:08,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-04-27 10:24:08,494 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:24:08,495 INFO L195 NwaCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:24:08,511 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-27 10:24:08,707 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-27 10:24:08,708 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:24:08,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:24:08,708 INFO L85 PathProgramCache]: Analyzing trace with hash -609408938, now seen corresponding path program 5 times [2022-04-27 10:24:08,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:24:08,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912692806] [2022-04-27 10:24:08,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:24:08,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:24:08,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:24:09,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:24:09,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:24:09,672 INFO L290 TraceCheckUtils]: 0: Hoare triple {2306#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {2254#true} is VALID [2022-04-27 10:24:09,672 INFO L290 TraceCheckUtils]: 1: Hoare triple {2254#true} assume true; {2254#true} is VALID [2022-04-27 10:24:09,672 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2254#true} {2254#true} #39#return; {2254#true} is VALID [2022-04-27 10:24:09,673 INFO L272 TraceCheckUtils]: 0: Hoare triple {2254#true} call ULTIMATE.init(); {2306#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:24:09,673 INFO L290 TraceCheckUtils]: 1: Hoare triple {2306#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {2254#true} is VALID [2022-04-27 10:24:09,673 INFO L290 TraceCheckUtils]: 2: Hoare triple {2254#true} assume true; {2254#true} is VALID [2022-04-27 10:24:09,673 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2254#true} {2254#true} #39#return; {2254#true} is VALID [2022-04-27 10:24:09,673 INFO L272 TraceCheckUtils]: 4: Hoare triple {2254#true} call #t~ret6 := main(); {2254#true} is VALID [2022-04-27 10:24:09,673 INFO L290 TraceCheckUtils]: 5: Hoare triple {2254#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {2259#(= main_~i~0 0)} is VALID [2022-04-27 10:24:09,673 INFO L290 TraceCheckUtils]: 6: Hoare triple {2259#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2259#(= main_~i~0 0)} is VALID [2022-04-27 10:24:09,674 INFO L290 TraceCheckUtils]: 7: Hoare triple {2259#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2260#(<= main_~i~0 1)} is VALID [2022-04-27 10:24:09,674 INFO L290 TraceCheckUtils]: 8: Hoare triple {2260#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2260#(<= main_~i~0 1)} is VALID [2022-04-27 10:24:09,674 INFO L290 TraceCheckUtils]: 9: Hoare triple {2260#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2261#(<= main_~i~0 2)} is VALID [2022-04-27 10:24:09,675 INFO L290 TraceCheckUtils]: 10: Hoare triple {2261#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2261#(<= main_~i~0 2)} is VALID [2022-04-27 10:24:09,675 INFO L290 TraceCheckUtils]: 11: Hoare triple {2261#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2262#(<= main_~i~0 3)} is VALID [2022-04-27 10:24:09,675 INFO L290 TraceCheckUtils]: 12: Hoare triple {2262#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2262#(<= main_~i~0 3)} is VALID [2022-04-27 10:24:09,676 INFO L290 TraceCheckUtils]: 13: Hoare triple {2262#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2263#(<= main_~i~0 4)} is VALID [2022-04-27 10:24:09,676 INFO L290 TraceCheckUtils]: 14: Hoare triple {2263#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2263#(<= main_~i~0 4)} is VALID [2022-04-27 10:24:09,676 INFO L290 TraceCheckUtils]: 15: Hoare triple {2263#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2264#(<= main_~i~0 5)} is VALID [2022-04-27 10:24:09,677 INFO L290 TraceCheckUtils]: 16: Hoare triple {2264#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2264#(<= main_~i~0 5)} is VALID [2022-04-27 10:24:09,677 INFO L290 TraceCheckUtils]: 17: Hoare triple {2264#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2265#(<= main_~i~0 6)} is VALID [2022-04-27 10:24:09,677 INFO L290 TraceCheckUtils]: 18: Hoare triple {2265#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2265#(<= main_~i~0 6)} is VALID [2022-04-27 10:24:09,678 INFO L290 TraceCheckUtils]: 19: Hoare triple {2265#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2266#(<= main_~i~0 7)} is VALID [2022-04-27 10:24:09,678 INFO L290 TraceCheckUtils]: 20: Hoare triple {2266#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2266#(<= main_~i~0 7)} is VALID [2022-04-27 10:24:09,678 INFO L290 TraceCheckUtils]: 21: Hoare triple {2266#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2267#(<= main_~i~0 8)} is VALID [2022-04-27 10:24:09,679 INFO L290 TraceCheckUtils]: 22: Hoare triple {2267#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2267#(<= main_~i~0 8)} is VALID [2022-04-27 10:24:09,679 INFO L290 TraceCheckUtils]: 23: Hoare triple {2267#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2268#(<= main_~i~0 9)} is VALID [2022-04-27 10:24:09,679 INFO L290 TraceCheckUtils]: 24: Hoare triple {2268#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2268#(<= main_~i~0 9)} is VALID [2022-04-27 10:24:09,680 INFO L290 TraceCheckUtils]: 25: Hoare triple {2268#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2269#(<= main_~i~0 10)} is VALID [2022-04-27 10:24:09,680 INFO L290 TraceCheckUtils]: 26: Hoare triple {2269#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2269#(<= main_~i~0 10)} is VALID [2022-04-27 10:24:09,680 INFO L290 TraceCheckUtils]: 27: Hoare triple {2269#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2270#(<= main_~i~0 11)} is VALID [2022-04-27 10:24:09,680 INFO L290 TraceCheckUtils]: 28: Hoare triple {2270#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2270#(<= main_~i~0 11)} is VALID [2022-04-27 10:24:09,681 INFO L290 TraceCheckUtils]: 29: Hoare triple {2270#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2271#(<= main_~i~0 12)} is VALID [2022-04-27 10:24:09,681 INFO L290 TraceCheckUtils]: 30: Hoare triple {2271#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2271#(<= main_~i~0 12)} is VALID [2022-04-27 10:24:09,681 INFO L290 TraceCheckUtils]: 31: Hoare triple {2271#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2272#(<= main_~i~0 13)} is VALID [2022-04-27 10:24:09,682 INFO L290 TraceCheckUtils]: 32: Hoare triple {2272#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2272#(<= main_~i~0 13)} is VALID [2022-04-27 10:24:09,682 INFO L290 TraceCheckUtils]: 33: Hoare triple {2272#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2273#(<= main_~i~0 14)} is VALID [2022-04-27 10:24:09,682 INFO L290 TraceCheckUtils]: 34: Hoare triple {2273#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2273#(<= main_~i~0 14)} is VALID [2022-04-27 10:24:09,683 INFO L290 TraceCheckUtils]: 35: Hoare triple {2273#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2274#(<= main_~i~0 15)} is VALID [2022-04-27 10:24:09,683 INFO L290 TraceCheckUtils]: 36: Hoare triple {2274#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2274#(<= main_~i~0 15)} is VALID [2022-04-27 10:24:09,683 INFO L290 TraceCheckUtils]: 37: Hoare triple {2274#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2275#(<= main_~i~0 16)} is VALID [2022-04-27 10:24:09,684 INFO L290 TraceCheckUtils]: 38: Hoare triple {2275#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2275#(<= main_~i~0 16)} is VALID [2022-04-27 10:24:09,684 INFO L290 TraceCheckUtils]: 39: Hoare triple {2275#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2276#(<= main_~i~0 17)} is VALID [2022-04-27 10:24:09,684 INFO L290 TraceCheckUtils]: 40: Hoare triple {2276#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2276#(<= main_~i~0 17)} is VALID [2022-04-27 10:24:09,685 INFO L290 TraceCheckUtils]: 41: Hoare triple {2276#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2277#(<= main_~i~0 18)} is VALID [2022-04-27 10:24:09,685 INFO L290 TraceCheckUtils]: 42: Hoare triple {2277#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2277#(<= main_~i~0 18)} is VALID [2022-04-27 10:24:09,685 INFO L290 TraceCheckUtils]: 43: Hoare triple {2277#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2278#(<= main_~i~0 19)} is VALID [2022-04-27 10:24:09,686 INFO L290 TraceCheckUtils]: 44: Hoare triple {2278#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2278#(<= main_~i~0 19)} is VALID [2022-04-27 10:24:09,686 INFO L290 TraceCheckUtils]: 45: Hoare triple {2278#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2279#(<= main_~i~0 20)} is VALID [2022-04-27 10:24:09,686 INFO L290 TraceCheckUtils]: 46: Hoare triple {2279#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2279#(<= main_~i~0 20)} is VALID [2022-04-27 10:24:09,687 INFO L290 TraceCheckUtils]: 47: Hoare triple {2279#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2280#(<= main_~i~0 21)} is VALID [2022-04-27 10:24:09,687 INFO L290 TraceCheckUtils]: 48: Hoare triple {2280#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2280#(<= main_~i~0 21)} is VALID [2022-04-27 10:24:09,688 INFO L290 TraceCheckUtils]: 49: Hoare triple {2280#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2281#(<= main_~i~0 22)} is VALID [2022-04-27 10:24:09,688 INFO L290 TraceCheckUtils]: 50: Hoare triple {2281#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2281#(<= main_~i~0 22)} is VALID [2022-04-27 10:24:09,689 INFO L290 TraceCheckUtils]: 51: Hoare triple {2281#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2282#(<= main_~i~0 23)} is VALID [2022-04-27 10:24:09,689 INFO L290 TraceCheckUtils]: 52: Hoare triple {2282#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2282#(<= main_~i~0 23)} is VALID [2022-04-27 10:24:09,689 INFO L290 TraceCheckUtils]: 53: Hoare triple {2282#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2283#(<= main_~i~0 24)} is VALID [2022-04-27 10:24:09,690 INFO L290 TraceCheckUtils]: 54: Hoare triple {2283#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2283#(<= main_~i~0 24)} is VALID [2022-04-27 10:24:09,690 INFO L290 TraceCheckUtils]: 55: Hoare triple {2283#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2284#(<= main_~i~0 25)} is VALID [2022-04-27 10:24:09,690 INFO L290 TraceCheckUtils]: 56: Hoare triple {2284#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2284#(<= main_~i~0 25)} is VALID [2022-04-27 10:24:09,691 INFO L290 TraceCheckUtils]: 57: Hoare triple {2284#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2285#(<= main_~i~0 26)} is VALID [2022-04-27 10:24:09,691 INFO L290 TraceCheckUtils]: 58: Hoare triple {2285#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2285#(<= main_~i~0 26)} is VALID [2022-04-27 10:24:09,691 INFO L290 TraceCheckUtils]: 59: Hoare triple {2285#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2286#(<= main_~i~0 27)} is VALID [2022-04-27 10:24:09,692 INFO L290 TraceCheckUtils]: 60: Hoare triple {2286#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2286#(<= main_~i~0 27)} is VALID [2022-04-27 10:24:09,692 INFO L290 TraceCheckUtils]: 61: Hoare triple {2286#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2287#(<= main_~i~0 28)} is VALID [2022-04-27 10:24:09,692 INFO L290 TraceCheckUtils]: 62: Hoare triple {2287#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2287#(<= main_~i~0 28)} is VALID [2022-04-27 10:24:09,693 INFO L290 TraceCheckUtils]: 63: Hoare triple {2287#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2288#(<= main_~i~0 29)} is VALID [2022-04-27 10:24:09,693 INFO L290 TraceCheckUtils]: 64: Hoare triple {2288#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2288#(<= main_~i~0 29)} is VALID [2022-04-27 10:24:09,693 INFO L290 TraceCheckUtils]: 65: Hoare triple {2288#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2289#(<= main_~i~0 30)} is VALID [2022-04-27 10:24:09,693 INFO L290 TraceCheckUtils]: 66: Hoare triple {2289#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2289#(<= main_~i~0 30)} is VALID [2022-04-27 10:24:09,694 INFO L290 TraceCheckUtils]: 67: Hoare triple {2289#(<= main_~i~0 30)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2290#(<= main_~i~0 31)} is VALID [2022-04-27 10:24:09,694 INFO L290 TraceCheckUtils]: 68: Hoare triple {2290#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2290#(<= main_~i~0 31)} is VALID [2022-04-27 10:24:09,694 INFO L290 TraceCheckUtils]: 69: Hoare triple {2290#(<= main_~i~0 31)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2291#(<= main_~i~0 32)} is VALID [2022-04-27 10:24:09,695 INFO L290 TraceCheckUtils]: 70: Hoare triple {2291#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2291#(<= main_~i~0 32)} is VALID [2022-04-27 10:24:09,695 INFO L290 TraceCheckUtils]: 71: Hoare triple {2291#(<= main_~i~0 32)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2292#(<= main_~i~0 33)} is VALID [2022-04-27 10:24:09,695 INFO L290 TraceCheckUtils]: 72: Hoare triple {2292#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2292#(<= main_~i~0 33)} is VALID [2022-04-27 10:24:09,696 INFO L290 TraceCheckUtils]: 73: Hoare triple {2292#(<= main_~i~0 33)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2293#(<= main_~i~0 34)} is VALID [2022-04-27 10:24:09,696 INFO L290 TraceCheckUtils]: 74: Hoare triple {2293#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2293#(<= main_~i~0 34)} is VALID [2022-04-27 10:24:09,696 INFO L290 TraceCheckUtils]: 75: Hoare triple {2293#(<= main_~i~0 34)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2294#(<= main_~i~0 35)} is VALID [2022-04-27 10:24:09,697 INFO L290 TraceCheckUtils]: 76: Hoare triple {2294#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2294#(<= main_~i~0 35)} is VALID [2022-04-27 10:24:09,697 INFO L290 TraceCheckUtils]: 77: Hoare triple {2294#(<= main_~i~0 35)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2295#(<= main_~i~0 36)} is VALID [2022-04-27 10:24:09,697 INFO L290 TraceCheckUtils]: 78: Hoare triple {2295#(<= main_~i~0 36)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2295#(<= main_~i~0 36)} is VALID [2022-04-27 10:24:09,698 INFO L290 TraceCheckUtils]: 79: Hoare triple {2295#(<= main_~i~0 36)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2296#(<= main_~i~0 37)} is VALID [2022-04-27 10:24:09,698 INFO L290 TraceCheckUtils]: 80: Hoare triple {2296#(<= main_~i~0 37)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2296#(<= main_~i~0 37)} is VALID [2022-04-27 10:24:09,698 INFO L290 TraceCheckUtils]: 81: Hoare triple {2296#(<= main_~i~0 37)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2297#(<= main_~i~0 38)} is VALID [2022-04-27 10:24:09,699 INFO L290 TraceCheckUtils]: 82: Hoare triple {2297#(<= main_~i~0 38)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2297#(<= main_~i~0 38)} is VALID [2022-04-27 10:24:09,699 INFO L290 TraceCheckUtils]: 83: Hoare triple {2297#(<= main_~i~0 38)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2298#(<= main_~i~0 39)} is VALID [2022-04-27 10:24:09,699 INFO L290 TraceCheckUtils]: 84: Hoare triple {2298#(<= main_~i~0 39)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2298#(<= main_~i~0 39)} is VALID [2022-04-27 10:24:09,700 INFO L290 TraceCheckUtils]: 85: Hoare triple {2298#(<= main_~i~0 39)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2299#(<= main_~i~0 40)} is VALID [2022-04-27 10:24:09,700 INFO L290 TraceCheckUtils]: 86: Hoare triple {2299#(<= main_~i~0 40)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2299#(<= main_~i~0 40)} is VALID [2022-04-27 10:24:09,700 INFO L290 TraceCheckUtils]: 87: Hoare triple {2299#(<= main_~i~0 40)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2300#(<= main_~i~0 41)} is VALID [2022-04-27 10:24:09,700 INFO L290 TraceCheckUtils]: 88: Hoare triple {2300#(<= main_~i~0 41)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2300#(<= main_~i~0 41)} is VALID [2022-04-27 10:24:09,701 INFO L290 TraceCheckUtils]: 89: Hoare triple {2300#(<= main_~i~0 41)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2301#(<= main_~i~0 42)} is VALID [2022-04-27 10:24:09,701 INFO L290 TraceCheckUtils]: 90: Hoare triple {2301#(<= main_~i~0 42)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2301#(<= main_~i~0 42)} is VALID [2022-04-27 10:24:09,701 INFO L290 TraceCheckUtils]: 91: Hoare triple {2301#(<= main_~i~0 42)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2302#(<= main_~i~0 43)} is VALID [2022-04-27 10:24:09,702 INFO L290 TraceCheckUtils]: 92: Hoare triple {2302#(<= main_~i~0 43)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2302#(<= main_~i~0 43)} is VALID [2022-04-27 10:24:09,702 INFO L290 TraceCheckUtils]: 93: Hoare triple {2302#(<= main_~i~0 43)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2303#(<= main_~i~0 44)} is VALID [2022-04-27 10:24:09,702 INFO L290 TraceCheckUtils]: 94: Hoare triple {2303#(<= main_~i~0 44)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2303#(<= main_~i~0 44)} is VALID [2022-04-27 10:24:09,703 INFO L290 TraceCheckUtils]: 95: Hoare triple {2303#(<= main_~i~0 44)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2304#(<= main_~i~0 45)} is VALID [2022-04-27 10:24:09,703 INFO L290 TraceCheckUtils]: 96: Hoare triple {2304#(<= main_~i~0 45)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2304#(<= main_~i~0 45)} is VALID [2022-04-27 10:24:09,703 INFO L290 TraceCheckUtils]: 97: Hoare triple {2304#(<= main_~i~0 45)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2305#(<= main_~i~0 46)} is VALID [2022-04-27 10:24:09,704 INFO L290 TraceCheckUtils]: 98: Hoare triple {2305#(<= main_~i~0 46)} assume !(~i~0 < 1024); {2255#false} is VALID [2022-04-27 10:24:09,704 INFO L290 TraceCheckUtils]: 99: Hoare triple {2255#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {2255#false} is VALID [2022-04-27 10:24:09,704 INFO L272 TraceCheckUtils]: 100: Hoare triple {2255#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {2255#false} is VALID [2022-04-27 10:24:09,704 INFO L290 TraceCheckUtils]: 101: Hoare triple {2255#false} ~cond := #in~cond; {2255#false} is VALID [2022-04-27 10:24:09,704 INFO L290 TraceCheckUtils]: 102: Hoare triple {2255#false} assume 0 == ~cond; {2255#false} is VALID [2022-04-27 10:24:09,704 INFO L290 TraceCheckUtils]: 103: Hoare triple {2255#false} assume !false; {2255#false} is VALID [2022-04-27 10:24:09,705 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-27 10:24:09,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:24:09,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912692806] [2022-04-27 10:24:09,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912692806] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:24:09,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55921016] [2022-04-27 10:24:09,706 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 10:24:09,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:24:09,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:24:09,707 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-27 10:24:09,708 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-27 10:24:27,941 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2022-04-27 10:24:27,941 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:24:27,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-27 10:24:28,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:24:28,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:24:28,656 INFO L272 TraceCheckUtils]: 0: Hoare triple {2254#true} call ULTIMATE.init(); {2254#true} is VALID [2022-04-27 10:24:28,657 INFO L290 TraceCheckUtils]: 1: Hoare triple {2254#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {2254#true} is VALID [2022-04-27 10:24:28,657 INFO L290 TraceCheckUtils]: 2: Hoare triple {2254#true} assume true; {2254#true} is VALID [2022-04-27 10:24:28,657 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2254#true} {2254#true} #39#return; {2254#true} is VALID [2022-04-27 10:24:28,657 INFO L272 TraceCheckUtils]: 4: Hoare triple {2254#true} call #t~ret6 := main(); {2254#true} is VALID [2022-04-27 10:24:28,657 INFO L290 TraceCheckUtils]: 5: Hoare triple {2254#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {2325#(<= main_~i~0 0)} is VALID [2022-04-27 10:24:28,658 INFO L290 TraceCheckUtils]: 6: Hoare triple {2325#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2325#(<= main_~i~0 0)} is VALID [2022-04-27 10:24:28,658 INFO L290 TraceCheckUtils]: 7: Hoare triple {2325#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2260#(<= main_~i~0 1)} is VALID [2022-04-27 10:24:28,658 INFO L290 TraceCheckUtils]: 8: Hoare triple {2260#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2260#(<= main_~i~0 1)} is VALID [2022-04-27 10:24:28,659 INFO L290 TraceCheckUtils]: 9: Hoare triple {2260#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2261#(<= main_~i~0 2)} is VALID [2022-04-27 10:24:28,659 INFO L290 TraceCheckUtils]: 10: Hoare triple {2261#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2261#(<= main_~i~0 2)} is VALID [2022-04-27 10:24:28,660 INFO L290 TraceCheckUtils]: 11: Hoare triple {2261#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2262#(<= main_~i~0 3)} is VALID [2022-04-27 10:24:28,660 INFO L290 TraceCheckUtils]: 12: Hoare triple {2262#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2262#(<= main_~i~0 3)} is VALID [2022-04-27 10:24:28,660 INFO L290 TraceCheckUtils]: 13: Hoare triple {2262#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2263#(<= main_~i~0 4)} is VALID [2022-04-27 10:24:28,661 INFO L290 TraceCheckUtils]: 14: Hoare triple {2263#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2263#(<= main_~i~0 4)} is VALID [2022-04-27 10:24:28,661 INFO L290 TraceCheckUtils]: 15: Hoare triple {2263#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2264#(<= main_~i~0 5)} is VALID [2022-04-27 10:24:28,661 INFO L290 TraceCheckUtils]: 16: Hoare triple {2264#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2264#(<= main_~i~0 5)} is VALID [2022-04-27 10:24:28,662 INFO L290 TraceCheckUtils]: 17: Hoare triple {2264#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2265#(<= main_~i~0 6)} is VALID [2022-04-27 10:24:28,662 INFO L290 TraceCheckUtils]: 18: Hoare triple {2265#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2265#(<= main_~i~0 6)} is VALID [2022-04-27 10:24:28,663 INFO L290 TraceCheckUtils]: 19: Hoare triple {2265#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2266#(<= main_~i~0 7)} is VALID [2022-04-27 10:24:28,663 INFO L290 TraceCheckUtils]: 20: Hoare triple {2266#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2266#(<= main_~i~0 7)} is VALID [2022-04-27 10:24:28,663 INFO L290 TraceCheckUtils]: 21: Hoare triple {2266#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2267#(<= main_~i~0 8)} is VALID [2022-04-27 10:24:28,664 INFO L290 TraceCheckUtils]: 22: Hoare triple {2267#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2267#(<= main_~i~0 8)} is VALID [2022-04-27 10:24:28,664 INFO L290 TraceCheckUtils]: 23: Hoare triple {2267#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2268#(<= main_~i~0 9)} is VALID [2022-04-27 10:24:28,664 INFO L290 TraceCheckUtils]: 24: Hoare triple {2268#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2268#(<= main_~i~0 9)} is VALID [2022-04-27 10:24:28,665 INFO L290 TraceCheckUtils]: 25: Hoare triple {2268#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2269#(<= main_~i~0 10)} is VALID [2022-04-27 10:24:28,665 INFO L290 TraceCheckUtils]: 26: Hoare triple {2269#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2269#(<= main_~i~0 10)} is VALID [2022-04-27 10:24:28,665 INFO L290 TraceCheckUtils]: 27: Hoare triple {2269#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2270#(<= main_~i~0 11)} is VALID [2022-04-27 10:24:28,666 INFO L290 TraceCheckUtils]: 28: Hoare triple {2270#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2270#(<= main_~i~0 11)} is VALID [2022-04-27 10:24:28,666 INFO L290 TraceCheckUtils]: 29: Hoare triple {2270#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2271#(<= main_~i~0 12)} is VALID [2022-04-27 10:24:28,666 INFO L290 TraceCheckUtils]: 30: Hoare triple {2271#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2271#(<= main_~i~0 12)} is VALID [2022-04-27 10:24:28,667 INFO L290 TraceCheckUtils]: 31: Hoare triple {2271#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2272#(<= main_~i~0 13)} is VALID [2022-04-27 10:24:28,667 INFO L290 TraceCheckUtils]: 32: Hoare triple {2272#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2272#(<= main_~i~0 13)} is VALID [2022-04-27 10:24:28,668 INFO L290 TraceCheckUtils]: 33: Hoare triple {2272#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2273#(<= main_~i~0 14)} is VALID [2022-04-27 10:24:28,668 INFO L290 TraceCheckUtils]: 34: Hoare triple {2273#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2273#(<= main_~i~0 14)} is VALID [2022-04-27 10:24:28,668 INFO L290 TraceCheckUtils]: 35: Hoare triple {2273#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2274#(<= main_~i~0 15)} is VALID [2022-04-27 10:24:28,669 INFO L290 TraceCheckUtils]: 36: Hoare triple {2274#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2274#(<= main_~i~0 15)} is VALID [2022-04-27 10:24:28,669 INFO L290 TraceCheckUtils]: 37: Hoare triple {2274#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2275#(<= main_~i~0 16)} is VALID [2022-04-27 10:24:28,669 INFO L290 TraceCheckUtils]: 38: Hoare triple {2275#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2275#(<= main_~i~0 16)} is VALID [2022-04-27 10:24:28,670 INFO L290 TraceCheckUtils]: 39: Hoare triple {2275#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2276#(<= main_~i~0 17)} is VALID [2022-04-27 10:24:28,670 INFO L290 TraceCheckUtils]: 40: Hoare triple {2276#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2276#(<= main_~i~0 17)} is VALID [2022-04-27 10:24:28,671 INFO L290 TraceCheckUtils]: 41: Hoare triple {2276#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2277#(<= main_~i~0 18)} is VALID [2022-04-27 10:24:28,671 INFO L290 TraceCheckUtils]: 42: Hoare triple {2277#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2277#(<= main_~i~0 18)} is VALID [2022-04-27 10:24:28,671 INFO L290 TraceCheckUtils]: 43: Hoare triple {2277#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2278#(<= main_~i~0 19)} is VALID [2022-04-27 10:24:28,672 INFO L290 TraceCheckUtils]: 44: Hoare triple {2278#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2278#(<= main_~i~0 19)} is VALID [2022-04-27 10:24:28,672 INFO L290 TraceCheckUtils]: 45: Hoare triple {2278#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2279#(<= main_~i~0 20)} is VALID [2022-04-27 10:24:28,672 INFO L290 TraceCheckUtils]: 46: Hoare triple {2279#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2279#(<= main_~i~0 20)} is VALID [2022-04-27 10:24:28,673 INFO L290 TraceCheckUtils]: 47: Hoare triple {2279#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2280#(<= main_~i~0 21)} is VALID [2022-04-27 10:24:28,673 INFO L290 TraceCheckUtils]: 48: Hoare triple {2280#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2280#(<= main_~i~0 21)} is VALID [2022-04-27 10:24:28,673 INFO L290 TraceCheckUtils]: 49: Hoare triple {2280#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2281#(<= main_~i~0 22)} is VALID [2022-04-27 10:24:28,674 INFO L290 TraceCheckUtils]: 50: Hoare triple {2281#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2281#(<= main_~i~0 22)} is VALID [2022-04-27 10:24:28,674 INFO L290 TraceCheckUtils]: 51: Hoare triple {2281#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2282#(<= main_~i~0 23)} is VALID [2022-04-27 10:24:28,674 INFO L290 TraceCheckUtils]: 52: Hoare triple {2282#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2282#(<= main_~i~0 23)} is VALID [2022-04-27 10:24:28,675 INFO L290 TraceCheckUtils]: 53: Hoare triple {2282#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2283#(<= main_~i~0 24)} is VALID [2022-04-27 10:24:28,675 INFO L290 TraceCheckUtils]: 54: Hoare triple {2283#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2283#(<= main_~i~0 24)} is VALID [2022-04-27 10:24:28,676 INFO L290 TraceCheckUtils]: 55: Hoare triple {2283#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2284#(<= main_~i~0 25)} is VALID [2022-04-27 10:24:28,676 INFO L290 TraceCheckUtils]: 56: Hoare triple {2284#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2284#(<= main_~i~0 25)} is VALID [2022-04-27 10:24:28,676 INFO L290 TraceCheckUtils]: 57: Hoare triple {2284#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2285#(<= main_~i~0 26)} is VALID [2022-04-27 10:24:28,677 INFO L290 TraceCheckUtils]: 58: Hoare triple {2285#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2285#(<= main_~i~0 26)} is VALID [2022-04-27 10:24:28,677 INFO L290 TraceCheckUtils]: 59: Hoare triple {2285#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2286#(<= main_~i~0 27)} is VALID [2022-04-27 10:24:28,677 INFO L290 TraceCheckUtils]: 60: Hoare triple {2286#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2286#(<= main_~i~0 27)} is VALID [2022-04-27 10:24:28,678 INFO L290 TraceCheckUtils]: 61: Hoare triple {2286#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2287#(<= main_~i~0 28)} is VALID [2022-04-27 10:24:28,678 INFO L290 TraceCheckUtils]: 62: Hoare triple {2287#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2287#(<= main_~i~0 28)} is VALID [2022-04-27 10:24:28,678 INFO L290 TraceCheckUtils]: 63: Hoare triple {2287#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2288#(<= main_~i~0 29)} is VALID [2022-04-27 10:24:28,679 INFO L290 TraceCheckUtils]: 64: Hoare triple {2288#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2288#(<= main_~i~0 29)} is VALID [2022-04-27 10:24:28,679 INFO L290 TraceCheckUtils]: 65: Hoare triple {2288#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2289#(<= main_~i~0 30)} is VALID [2022-04-27 10:24:28,679 INFO L290 TraceCheckUtils]: 66: Hoare triple {2289#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2289#(<= main_~i~0 30)} is VALID [2022-04-27 10:24:28,680 INFO L290 TraceCheckUtils]: 67: Hoare triple {2289#(<= main_~i~0 30)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2290#(<= main_~i~0 31)} is VALID [2022-04-27 10:24:28,680 INFO L290 TraceCheckUtils]: 68: Hoare triple {2290#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2290#(<= main_~i~0 31)} is VALID [2022-04-27 10:24:28,680 INFO L290 TraceCheckUtils]: 69: Hoare triple {2290#(<= main_~i~0 31)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2291#(<= main_~i~0 32)} is VALID [2022-04-27 10:24:28,681 INFO L290 TraceCheckUtils]: 70: Hoare triple {2291#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2291#(<= main_~i~0 32)} is VALID [2022-04-27 10:24:28,681 INFO L290 TraceCheckUtils]: 71: Hoare triple {2291#(<= main_~i~0 32)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2292#(<= main_~i~0 33)} is VALID [2022-04-27 10:24:28,681 INFO L290 TraceCheckUtils]: 72: Hoare triple {2292#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2292#(<= main_~i~0 33)} is VALID [2022-04-27 10:24:28,682 INFO L290 TraceCheckUtils]: 73: Hoare triple {2292#(<= main_~i~0 33)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2293#(<= main_~i~0 34)} is VALID [2022-04-27 10:24:28,682 INFO L290 TraceCheckUtils]: 74: Hoare triple {2293#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2293#(<= main_~i~0 34)} is VALID [2022-04-27 10:24:28,682 INFO L290 TraceCheckUtils]: 75: Hoare triple {2293#(<= main_~i~0 34)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2294#(<= main_~i~0 35)} is VALID [2022-04-27 10:24:28,683 INFO L290 TraceCheckUtils]: 76: Hoare triple {2294#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2294#(<= main_~i~0 35)} is VALID [2022-04-27 10:24:28,683 INFO L290 TraceCheckUtils]: 77: Hoare triple {2294#(<= main_~i~0 35)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2295#(<= main_~i~0 36)} is VALID [2022-04-27 10:24:28,683 INFO L290 TraceCheckUtils]: 78: Hoare triple {2295#(<= main_~i~0 36)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2295#(<= main_~i~0 36)} is VALID [2022-04-27 10:24:28,684 INFO L290 TraceCheckUtils]: 79: Hoare triple {2295#(<= main_~i~0 36)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2296#(<= main_~i~0 37)} is VALID [2022-04-27 10:24:28,684 INFO L290 TraceCheckUtils]: 80: Hoare triple {2296#(<= main_~i~0 37)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2296#(<= main_~i~0 37)} is VALID [2022-04-27 10:24:28,684 INFO L290 TraceCheckUtils]: 81: Hoare triple {2296#(<= main_~i~0 37)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2297#(<= main_~i~0 38)} is VALID [2022-04-27 10:24:28,685 INFO L290 TraceCheckUtils]: 82: Hoare triple {2297#(<= main_~i~0 38)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2297#(<= main_~i~0 38)} is VALID [2022-04-27 10:24:28,685 INFO L290 TraceCheckUtils]: 83: Hoare triple {2297#(<= main_~i~0 38)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2298#(<= main_~i~0 39)} is VALID [2022-04-27 10:24:28,685 INFO L290 TraceCheckUtils]: 84: Hoare triple {2298#(<= main_~i~0 39)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2298#(<= main_~i~0 39)} is VALID [2022-04-27 10:24:28,686 INFO L290 TraceCheckUtils]: 85: Hoare triple {2298#(<= main_~i~0 39)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2299#(<= main_~i~0 40)} is VALID [2022-04-27 10:24:28,686 INFO L290 TraceCheckUtils]: 86: Hoare triple {2299#(<= main_~i~0 40)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2299#(<= main_~i~0 40)} is VALID [2022-04-27 10:24:28,686 INFO L290 TraceCheckUtils]: 87: Hoare triple {2299#(<= main_~i~0 40)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2300#(<= main_~i~0 41)} is VALID [2022-04-27 10:24:28,687 INFO L290 TraceCheckUtils]: 88: Hoare triple {2300#(<= main_~i~0 41)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2300#(<= main_~i~0 41)} is VALID [2022-04-27 10:24:28,687 INFO L290 TraceCheckUtils]: 89: Hoare triple {2300#(<= main_~i~0 41)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2301#(<= main_~i~0 42)} is VALID [2022-04-27 10:24:28,687 INFO L290 TraceCheckUtils]: 90: Hoare triple {2301#(<= main_~i~0 42)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2301#(<= main_~i~0 42)} is VALID [2022-04-27 10:24:28,688 INFO L290 TraceCheckUtils]: 91: Hoare triple {2301#(<= main_~i~0 42)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2302#(<= main_~i~0 43)} is VALID [2022-04-27 10:24:28,688 INFO L290 TraceCheckUtils]: 92: Hoare triple {2302#(<= main_~i~0 43)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2302#(<= main_~i~0 43)} is VALID [2022-04-27 10:24:28,688 INFO L290 TraceCheckUtils]: 93: Hoare triple {2302#(<= main_~i~0 43)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2303#(<= main_~i~0 44)} is VALID [2022-04-27 10:24:28,689 INFO L290 TraceCheckUtils]: 94: Hoare triple {2303#(<= main_~i~0 44)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2303#(<= main_~i~0 44)} is VALID [2022-04-27 10:24:28,689 INFO L290 TraceCheckUtils]: 95: Hoare triple {2303#(<= main_~i~0 44)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2304#(<= main_~i~0 45)} is VALID [2022-04-27 10:24:28,689 INFO L290 TraceCheckUtils]: 96: Hoare triple {2304#(<= main_~i~0 45)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2304#(<= main_~i~0 45)} is VALID [2022-04-27 10:24:28,690 INFO L290 TraceCheckUtils]: 97: Hoare triple {2304#(<= main_~i~0 45)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2305#(<= main_~i~0 46)} is VALID [2022-04-27 10:24:28,690 INFO L290 TraceCheckUtils]: 98: Hoare triple {2305#(<= main_~i~0 46)} assume !(~i~0 < 1024); {2255#false} is VALID [2022-04-27 10:24:28,690 INFO L290 TraceCheckUtils]: 99: Hoare triple {2255#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {2255#false} is VALID [2022-04-27 10:24:28,690 INFO L272 TraceCheckUtils]: 100: Hoare triple {2255#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {2255#false} is VALID [2022-04-27 10:24:28,690 INFO L290 TraceCheckUtils]: 101: Hoare triple {2255#false} ~cond := #in~cond; {2255#false} is VALID [2022-04-27 10:24:28,690 INFO L290 TraceCheckUtils]: 102: Hoare triple {2255#false} assume 0 == ~cond; {2255#false} is VALID [2022-04-27 10:24:28,690 INFO L290 TraceCheckUtils]: 103: Hoare triple {2255#false} assume !false; {2255#false} is VALID [2022-04-27 10:24:28,691 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-27 10:24:28,692 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:24:31,134 INFO L290 TraceCheckUtils]: 103: Hoare triple {2255#false} assume !false; {2255#false} is VALID [2022-04-27 10:24:31,135 INFO L290 TraceCheckUtils]: 102: Hoare triple {2255#false} assume 0 == ~cond; {2255#false} is VALID [2022-04-27 10:24:31,135 INFO L290 TraceCheckUtils]: 101: Hoare triple {2255#false} ~cond := #in~cond; {2255#false} is VALID [2022-04-27 10:24:31,135 INFO L272 TraceCheckUtils]: 100: Hoare triple {2255#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {2255#false} is VALID [2022-04-27 10:24:31,135 INFO L290 TraceCheckUtils]: 99: Hoare triple {2255#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {2255#false} is VALID [2022-04-27 10:24:31,135 INFO L290 TraceCheckUtils]: 98: Hoare triple {2635#(< main_~i~0 1024)} assume !(~i~0 < 1024); {2255#false} is VALID [2022-04-27 10:24:31,136 INFO L290 TraceCheckUtils]: 97: Hoare triple {2639#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2635#(< main_~i~0 1024)} is VALID [2022-04-27 10:24:31,136 INFO L290 TraceCheckUtils]: 96: Hoare triple {2639#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2639#(< main_~i~0 1023)} is VALID [2022-04-27 10:24:31,136 INFO L290 TraceCheckUtils]: 95: Hoare triple {2646#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2639#(< main_~i~0 1023)} is VALID [2022-04-27 10:24:31,137 INFO L290 TraceCheckUtils]: 94: Hoare triple {2646#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2646#(< main_~i~0 1022)} is VALID [2022-04-27 10:24:31,137 INFO L290 TraceCheckUtils]: 93: Hoare triple {2653#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2646#(< main_~i~0 1022)} is VALID [2022-04-27 10:24:31,137 INFO L290 TraceCheckUtils]: 92: Hoare triple {2653#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2653#(< main_~i~0 1021)} is VALID [2022-04-27 10:24:31,138 INFO L290 TraceCheckUtils]: 91: Hoare triple {2660#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2653#(< main_~i~0 1021)} is VALID [2022-04-27 10:24:31,138 INFO L290 TraceCheckUtils]: 90: Hoare triple {2660#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2660#(< main_~i~0 1020)} is VALID [2022-04-27 10:24:31,138 INFO L290 TraceCheckUtils]: 89: Hoare triple {2667#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2660#(< main_~i~0 1020)} is VALID [2022-04-27 10:24:31,139 INFO L290 TraceCheckUtils]: 88: Hoare triple {2667#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2667#(< main_~i~0 1019)} is VALID [2022-04-27 10:24:31,139 INFO L290 TraceCheckUtils]: 87: Hoare triple {2674#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2667#(< main_~i~0 1019)} is VALID [2022-04-27 10:24:31,139 INFO L290 TraceCheckUtils]: 86: Hoare triple {2674#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2674#(< main_~i~0 1018)} is VALID [2022-04-27 10:24:31,140 INFO L290 TraceCheckUtils]: 85: Hoare triple {2681#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2674#(< main_~i~0 1018)} is VALID [2022-04-27 10:24:31,140 INFO L290 TraceCheckUtils]: 84: Hoare triple {2681#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2681#(< main_~i~0 1017)} is VALID [2022-04-27 10:24:31,140 INFO L290 TraceCheckUtils]: 83: Hoare triple {2688#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2681#(< main_~i~0 1017)} is VALID [2022-04-27 10:24:31,141 INFO L290 TraceCheckUtils]: 82: Hoare triple {2688#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2688#(< main_~i~0 1016)} is VALID [2022-04-27 10:24:31,141 INFO L290 TraceCheckUtils]: 81: Hoare triple {2695#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2688#(< main_~i~0 1016)} is VALID [2022-04-27 10:24:31,141 INFO L290 TraceCheckUtils]: 80: Hoare triple {2695#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2695#(< main_~i~0 1015)} is VALID [2022-04-27 10:24:31,142 INFO L290 TraceCheckUtils]: 79: Hoare triple {2702#(< main_~i~0 1014)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2695#(< main_~i~0 1015)} is VALID [2022-04-27 10:24:31,142 INFO L290 TraceCheckUtils]: 78: Hoare triple {2702#(< main_~i~0 1014)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2702#(< main_~i~0 1014)} is VALID [2022-04-27 10:24:31,142 INFO L290 TraceCheckUtils]: 77: Hoare triple {2709#(< main_~i~0 1013)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2702#(< main_~i~0 1014)} is VALID [2022-04-27 10:24:31,143 INFO L290 TraceCheckUtils]: 76: Hoare triple {2709#(< main_~i~0 1013)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2709#(< main_~i~0 1013)} is VALID [2022-04-27 10:24:31,143 INFO L290 TraceCheckUtils]: 75: Hoare triple {2716#(< main_~i~0 1012)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2709#(< main_~i~0 1013)} is VALID [2022-04-27 10:24:31,143 INFO L290 TraceCheckUtils]: 74: Hoare triple {2716#(< main_~i~0 1012)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2716#(< main_~i~0 1012)} is VALID [2022-04-27 10:24:31,144 INFO L290 TraceCheckUtils]: 73: Hoare triple {2723#(< main_~i~0 1011)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2716#(< main_~i~0 1012)} is VALID [2022-04-27 10:24:31,144 INFO L290 TraceCheckUtils]: 72: Hoare triple {2723#(< main_~i~0 1011)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2723#(< main_~i~0 1011)} is VALID [2022-04-27 10:24:31,144 INFO L290 TraceCheckUtils]: 71: Hoare triple {2730#(< main_~i~0 1010)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2723#(< main_~i~0 1011)} is VALID [2022-04-27 10:24:31,144 INFO L290 TraceCheckUtils]: 70: Hoare triple {2730#(< main_~i~0 1010)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2730#(< main_~i~0 1010)} is VALID [2022-04-27 10:24:31,145 INFO L290 TraceCheckUtils]: 69: Hoare triple {2737#(< main_~i~0 1009)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2730#(< main_~i~0 1010)} is VALID [2022-04-27 10:24:31,145 INFO L290 TraceCheckUtils]: 68: Hoare triple {2737#(< main_~i~0 1009)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2737#(< main_~i~0 1009)} is VALID [2022-04-27 10:24:31,145 INFO L290 TraceCheckUtils]: 67: Hoare triple {2744#(< main_~i~0 1008)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2737#(< main_~i~0 1009)} is VALID [2022-04-27 10:24:31,146 INFO L290 TraceCheckUtils]: 66: Hoare triple {2744#(< main_~i~0 1008)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2744#(< main_~i~0 1008)} is VALID [2022-04-27 10:24:31,146 INFO L290 TraceCheckUtils]: 65: Hoare triple {2751#(< main_~i~0 1007)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2744#(< main_~i~0 1008)} is VALID [2022-04-27 10:24:31,146 INFO L290 TraceCheckUtils]: 64: Hoare triple {2751#(< main_~i~0 1007)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2751#(< main_~i~0 1007)} is VALID [2022-04-27 10:24:31,147 INFO L290 TraceCheckUtils]: 63: Hoare triple {2758#(< main_~i~0 1006)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2751#(< main_~i~0 1007)} is VALID [2022-04-27 10:24:31,147 INFO L290 TraceCheckUtils]: 62: Hoare triple {2758#(< main_~i~0 1006)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2758#(< main_~i~0 1006)} is VALID [2022-04-27 10:24:31,147 INFO L290 TraceCheckUtils]: 61: Hoare triple {2765#(< main_~i~0 1005)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2758#(< main_~i~0 1006)} is VALID [2022-04-27 10:24:31,148 INFO L290 TraceCheckUtils]: 60: Hoare triple {2765#(< main_~i~0 1005)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2765#(< main_~i~0 1005)} is VALID [2022-04-27 10:24:31,148 INFO L290 TraceCheckUtils]: 59: Hoare triple {2772#(< main_~i~0 1004)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2765#(< main_~i~0 1005)} is VALID [2022-04-27 10:24:31,148 INFO L290 TraceCheckUtils]: 58: Hoare triple {2772#(< main_~i~0 1004)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2772#(< main_~i~0 1004)} is VALID [2022-04-27 10:24:31,149 INFO L290 TraceCheckUtils]: 57: Hoare triple {2779#(< main_~i~0 1003)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2772#(< main_~i~0 1004)} is VALID [2022-04-27 10:24:31,149 INFO L290 TraceCheckUtils]: 56: Hoare triple {2779#(< main_~i~0 1003)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2779#(< main_~i~0 1003)} is VALID [2022-04-27 10:24:31,149 INFO L290 TraceCheckUtils]: 55: Hoare triple {2786#(< main_~i~0 1002)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2779#(< main_~i~0 1003)} is VALID [2022-04-27 10:24:31,150 INFO L290 TraceCheckUtils]: 54: Hoare triple {2786#(< main_~i~0 1002)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2786#(< main_~i~0 1002)} is VALID [2022-04-27 10:24:31,150 INFO L290 TraceCheckUtils]: 53: Hoare triple {2793#(< main_~i~0 1001)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2786#(< main_~i~0 1002)} is VALID [2022-04-27 10:24:31,150 INFO L290 TraceCheckUtils]: 52: Hoare triple {2793#(< main_~i~0 1001)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2793#(< main_~i~0 1001)} is VALID [2022-04-27 10:24:31,151 INFO L290 TraceCheckUtils]: 51: Hoare triple {2800#(< main_~i~0 1000)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2793#(< main_~i~0 1001)} is VALID [2022-04-27 10:24:31,151 INFO L290 TraceCheckUtils]: 50: Hoare triple {2800#(< main_~i~0 1000)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2800#(< main_~i~0 1000)} is VALID [2022-04-27 10:24:31,151 INFO L290 TraceCheckUtils]: 49: Hoare triple {2807#(< main_~i~0 999)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2800#(< main_~i~0 1000)} is VALID [2022-04-27 10:24:31,152 INFO L290 TraceCheckUtils]: 48: Hoare triple {2807#(< main_~i~0 999)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2807#(< main_~i~0 999)} is VALID [2022-04-27 10:24:31,152 INFO L290 TraceCheckUtils]: 47: Hoare triple {2814#(< main_~i~0 998)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2807#(< main_~i~0 999)} is VALID [2022-04-27 10:24:31,152 INFO L290 TraceCheckUtils]: 46: Hoare triple {2814#(< main_~i~0 998)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2814#(< main_~i~0 998)} is VALID [2022-04-27 10:24:31,153 INFO L290 TraceCheckUtils]: 45: Hoare triple {2821#(< main_~i~0 997)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2814#(< main_~i~0 998)} is VALID [2022-04-27 10:24:31,153 INFO L290 TraceCheckUtils]: 44: Hoare triple {2821#(< main_~i~0 997)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2821#(< main_~i~0 997)} is VALID [2022-04-27 10:24:31,153 INFO L290 TraceCheckUtils]: 43: Hoare triple {2828#(< main_~i~0 996)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2821#(< main_~i~0 997)} is VALID [2022-04-27 10:24:31,154 INFO L290 TraceCheckUtils]: 42: Hoare triple {2828#(< main_~i~0 996)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2828#(< main_~i~0 996)} is VALID [2022-04-27 10:24:31,154 INFO L290 TraceCheckUtils]: 41: Hoare triple {2835#(< main_~i~0 995)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2828#(< main_~i~0 996)} is VALID [2022-04-27 10:24:31,154 INFO L290 TraceCheckUtils]: 40: Hoare triple {2835#(< main_~i~0 995)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2835#(< main_~i~0 995)} is VALID [2022-04-27 10:24:31,155 INFO L290 TraceCheckUtils]: 39: Hoare triple {2842#(< main_~i~0 994)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2835#(< main_~i~0 995)} is VALID [2022-04-27 10:24:31,155 INFO L290 TraceCheckUtils]: 38: Hoare triple {2842#(< main_~i~0 994)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2842#(< main_~i~0 994)} is VALID [2022-04-27 10:24:31,155 INFO L290 TraceCheckUtils]: 37: Hoare triple {2849#(< main_~i~0 993)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2842#(< main_~i~0 994)} is VALID [2022-04-27 10:24:31,155 INFO L290 TraceCheckUtils]: 36: Hoare triple {2849#(< main_~i~0 993)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2849#(< main_~i~0 993)} is VALID [2022-04-27 10:24:31,156 INFO L290 TraceCheckUtils]: 35: Hoare triple {2856#(< main_~i~0 992)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2849#(< main_~i~0 993)} is VALID [2022-04-27 10:24:31,156 INFO L290 TraceCheckUtils]: 34: Hoare triple {2856#(< main_~i~0 992)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2856#(< main_~i~0 992)} is VALID [2022-04-27 10:24:31,156 INFO L290 TraceCheckUtils]: 33: Hoare triple {2863#(< main_~i~0 991)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2856#(< main_~i~0 992)} is VALID [2022-04-27 10:24:31,157 INFO L290 TraceCheckUtils]: 32: Hoare triple {2863#(< main_~i~0 991)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2863#(< main_~i~0 991)} is VALID [2022-04-27 10:24:31,157 INFO L290 TraceCheckUtils]: 31: Hoare triple {2870#(< main_~i~0 990)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2863#(< main_~i~0 991)} is VALID [2022-04-27 10:24:31,157 INFO L290 TraceCheckUtils]: 30: Hoare triple {2870#(< main_~i~0 990)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2870#(< main_~i~0 990)} is VALID [2022-04-27 10:24:31,158 INFO L290 TraceCheckUtils]: 29: Hoare triple {2877#(< main_~i~0 989)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2870#(< main_~i~0 990)} is VALID [2022-04-27 10:24:31,158 INFO L290 TraceCheckUtils]: 28: Hoare triple {2877#(< main_~i~0 989)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2877#(< main_~i~0 989)} is VALID [2022-04-27 10:24:31,158 INFO L290 TraceCheckUtils]: 27: Hoare triple {2884#(< main_~i~0 988)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2877#(< main_~i~0 989)} is VALID [2022-04-27 10:24:31,159 INFO L290 TraceCheckUtils]: 26: Hoare triple {2884#(< main_~i~0 988)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2884#(< main_~i~0 988)} is VALID [2022-04-27 10:24:31,159 INFO L290 TraceCheckUtils]: 25: Hoare triple {2891#(< main_~i~0 987)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2884#(< main_~i~0 988)} is VALID [2022-04-27 10:24:31,159 INFO L290 TraceCheckUtils]: 24: Hoare triple {2891#(< main_~i~0 987)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2891#(< main_~i~0 987)} is VALID [2022-04-27 10:24:31,160 INFO L290 TraceCheckUtils]: 23: Hoare triple {2898#(< main_~i~0 986)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2891#(< main_~i~0 987)} is VALID [2022-04-27 10:24:31,160 INFO L290 TraceCheckUtils]: 22: Hoare triple {2898#(< main_~i~0 986)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2898#(< main_~i~0 986)} is VALID [2022-04-27 10:24:31,160 INFO L290 TraceCheckUtils]: 21: Hoare triple {2905#(< main_~i~0 985)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2898#(< main_~i~0 986)} is VALID [2022-04-27 10:24:31,161 INFO L290 TraceCheckUtils]: 20: Hoare triple {2905#(< main_~i~0 985)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2905#(< main_~i~0 985)} is VALID [2022-04-27 10:24:31,161 INFO L290 TraceCheckUtils]: 19: Hoare triple {2912#(< main_~i~0 984)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2905#(< main_~i~0 985)} is VALID [2022-04-27 10:24:31,161 INFO L290 TraceCheckUtils]: 18: Hoare triple {2912#(< main_~i~0 984)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2912#(< main_~i~0 984)} is VALID [2022-04-27 10:24:31,162 INFO L290 TraceCheckUtils]: 17: Hoare triple {2919#(< main_~i~0 983)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2912#(< main_~i~0 984)} is VALID [2022-04-27 10:24:31,162 INFO L290 TraceCheckUtils]: 16: Hoare triple {2919#(< main_~i~0 983)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2919#(< main_~i~0 983)} is VALID [2022-04-27 10:24:31,162 INFO L290 TraceCheckUtils]: 15: Hoare triple {2926#(< main_~i~0 982)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2919#(< main_~i~0 983)} is VALID [2022-04-27 10:24:31,163 INFO L290 TraceCheckUtils]: 14: Hoare triple {2926#(< main_~i~0 982)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2926#(< main_~i~0 982)} is VALID [2022-04-27 10:24:31,163 INFO L290 TraceCheckUtils]: 13: Hoare triple {2933#(< main_~i~0 981)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2926#(< main_~i~0 982)} is VALID [2022-04-27 10:24:31,163 INFO L290 TraceCheckUtils]: 12: Hoare triple {2933#(< main_~i~0 981)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2933#(< main_~i~0 981)} is VALID [2022-04-27 10:24:31,164 INFO L290 TraceCheckUtils]: 11: Hoare triple {2940#(< main_~i~0 980)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2933#(< main_~i~0 981)} is VALID [2022-04-27 10:24:31,164 INFO L290 TraceCheckUtils]: 10: Hoare triple {2940#(< main_~i~0 980)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2940#(< main_~i~0 980)} is VALID [2022-04-27 10:24:31,164 INFO L290 TraceCheckUtils]: 9: Hoare triple {2947#(< main_~i~0 979)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2940#(< main_~i~0 980)} is VALID [2022-04-27 10:24:31,165 INFO L290 TraceCheckUtils]: 8: Hoare triple {2947#(< main_~i~0 979)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2947#(< main_~i~0 979)} is VALID [2022-04-27 10:24:31,165 INFO L290 TraceCheckUtils]: 7: Hoare triple {2954#(< main_~i~0 978)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2947#(< main_~i~0 979)} is VALID [2022-04-27 10:24:31,165 INFO L290 TraceCheckUtils]: 6: Hoare triple {2954#(< main_~i~0 978)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2954#(< main_~i~0 978)} is VALID [2022-04-27 10:24:31,166 INFO L290 TraceCheckUtils]: 5: Hoare triple {2254#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {2954#(< main_~i~0 978)} is VALID [2022-04-27 10:24:31,166 INFO L272 TraceCheckUtils]: 4: Hoare triple {2254#true} call #t~ret6 := main(); {2254#true} is VALID [2022-04-27 10:24:31,166 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2254#true} {2254#true} #39#return; {2254#true} is VALID [2022-04-27 10:24:31,166 INFO L290 TraceCheckUtils]: 2: Hoare triple {2254#true} assume true; {2254#true} is VALID [2022-04-27 10:24:31,166 INFO L290 TraceCheckUtils]: 1: Hoare triple {2254#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {2254#true} is VALID [2022-04-27 10:24:31,166 INFO L272 TraceCheckUtils]: 0: Hoare triple {2254#true} call ULTIMATE.init(); {2254#true} is VALID [2022-04-27 10:24:31,167 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-27 10:24:31,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [55921016] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:24:31,167 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:24:31,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 49, 49] total 98 [2022-04-27 10:24:31,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248694723] [2022-04-27 10:24:31,168 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:24:31,168 INFO L78 Accepts]: Start accepts. Automaton has has 98 states, 98 states have (on average 2.020408163265306) internal successors, (198), 97 states have internal predecessors, (198), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 104 [2022-04-27 10:24:31,169 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:24:31,169 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 98 states, 98 states have (on average 2.020408163265306) internal successors, (198), 97 states have internal predecessors, (198), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:24:31,306 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 203 edges. 203 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:24:31,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 98 states [2022-04-27 10:24:31,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:24:31,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2022-04-27 10:24:31,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4658, Invalid=4848, Unknown=0, NotChecked=0, Total=9506 [2022-04-27 10:24:31,310 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand has 98 states, 98 states have (on average 2.020408163265306) internal successors, (198), 97 states have internal predecessors, (198), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:24:34,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:24:34,576 INFO L93 Difference]: Finished difference Result 207 states and 254 transitions. [2022-04-27 10:24:34,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2022-04-27 10:24:34,577 INFO L78 Accepts]: Start accepts. Automaton has has 98 states, 98 states have (on average 2.020408163265306) internal successors, (198), 97 states have internal predecessors, (198), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 104 [2022-04-27 10:24:34,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:24:34,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 98 states have (on average 2.020408163265306) internal successors, (198), 97 states have internal predecessors, (198), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:24:34,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 254 transitions. [2022-04-27 10:24:34,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 98 states have (on average 2.020408163265306) internal successors, (198), 97 states have internal predecessors, (198), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:24:34,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 254 transitions. [2022-04-27 10:24:34,584 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 97 states and 254 transitions. [2022-04-27 10:24:34,740 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 254 edges. 254 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:24:34,748 INFO L225 Difference]: With dead ends: 207 [2022-04-27 10:24:34,748 INFO L226 Difference]: Without dead ends: 201 [2022-04-27 10:24:34,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5728 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=13777, Invalid=22895, Unknown=0, NotChecked=0, Total=36672 [2022-04-27 10:24:34,756 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 195 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 10:24:34,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 59 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 10:24:34,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-04-27 10:24:34,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2022-04-27 10:24:34,825 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:24:34,825 INFO L82 GeneralOperation]: Start isEquivalent. First operand 201 states. Second operand has 201 states, 196 states have (on average 1.0051020408163265) internal successors, (197), 196 states have internal predecessors, (197), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:24:34,825 INFO L74 IsIncluded]: Start isIncluded. First operand 201 states. Second operand has 201 states, 196 states have (on average 1.0051020408163265) internal successors, (197), 196 states have internal predecessors, (197), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:24:34,826 INFO L87 Difference]: Start difference. First operand 201 states. Second operand has 201 states, 196 states have (on average 1.0051020408163265) internal successors, (197), 196 states have internal predecessors, (197), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:24:34,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:24:34,830 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2022-04-27 10:24:34,830 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2022-04-27 10:24:34,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:24:34,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:24:34,831 INFO L74 IsIncluded]: Start isIncluded. First operand has 201 states, 196 states have (on average 1.0051020408163265) internal successors, (197), 196 states have internal predecessors, (197), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 201 states. [2022-04-27 10:24:34,831 INFO L87 Difference]: Start difference. First operand has 201 states, 196 states have (on average 1.0051020408163265) internal successors, (197), 196 states have internal predecessors, (197), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 201 states. [2022-04-27 10:24:34,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:24:34,836 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2022-04-27 10:24:34,836 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2022-04-27 10:24:34,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:24:34,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:24:34,836 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:24:34,836 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:24:34,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 196 states have (on average 1.0051020408163265) internal successors, (197), 196 states have internal predecessors, (197), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:24:34,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2022-04-27 10:24:34,841 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 104 [2022-04-27 10:24:34,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:24:34,841 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2022-04-27 10:24:34,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 98 states, 98 states have (on average 2.020408163265306) internal successors, (198), 97 states have internal predecessors, (198), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:24:34,841 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2022-04-27 10:24:34,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-04-27 10:24:34,844 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:24:34,844 INFO L195 NwaCegarLoop]: trace histogram [94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:24:34,870 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-27 10:24:35,067 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-27 10:24:35,068 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:24:35,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:24:35,068 INFO L85 PathProgramCache]: Analyzing trace with hash -2140678986, now seen corresponding path program 6 times [2022-04-27 10:24:35,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:24:35,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539771535] [2022-04-27 10:24:35,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:24:35,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:24:35,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:24:38,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:24:38,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:24:38,035 INFO L290 TraceCheckUtils]: 0: Hoare triple {4280#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {4180#true} is VALID [2022-04-27 10:24:38,035 INFO L290 TraceCheckUtils]: 1: Hoare triple {4180#true} assume true; {4180#true} is VALID [2022-04-27 10:24:38,036 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4180#true} {4180#true} #39#return; {4180#true} is VALID [2022-04-27 10:24:38,036 INFO L272 TraceCheckUtils]: 0: Hoare triple {4180#true} call ULTIMATE.init(); {4280#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:24:38,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {4280#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {4180#true} is VALID [2022-04-27 10:24:38,036 INFO L290 TraceCheckUtils]: 2: Hoare triple {4180#true} assume true; {4180#true} is VALID [2022-04-27 10:24:38,036 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4180#true} {4180#true} #39#return; {4180#true} is VALID [2022-04-27 10:24:38,036 INFO L272 TraceCheckUtils]: 4: Hoare triple {4180#true} call #t~ret6 := main(); {4180#true} is VALID [2022-04-27 10:24:38,036 INFO L290 TraceCheckUtils]: 5: Hoare triple {4180#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {4185#(= main_~i~0 0)} is VALID [2022-04-27 10:24:38,037 INFO L290 TraceCheckUtils]: 6: Hoare triple {4185#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4185#(= main_~i~0 0)} is VALID [2022-04-27 10:24:38,037 INFO L290 TraceCheckUtils]: 7: Hoare triple {4185#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4186#(<= main_~i~0 1)} is VALID [2022-04-27 10:24:38,037 INFO L290 TraceCheckUtils]: 8: Hoare triple {4186#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4186#(<= main_~i~0 1)} is VALID [2022-04-27 10:24:38,038 INFO L290 TraceCheckUtils]: 9: Hoare triple {4186#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4187#(<= main_~i~0 2)} is VALID [2022-04-27 10:24:38,038 INFO L290 TraceCheckUtils]: 10: Hoare triple {4187#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4187#(<= main_~i~0 2)} is VALID [2022-04-27 10:24:38,038 INFO L290 TraceCheckUtils]: 11: Hoare triple {4187#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4188#(<= main_~i~0 3)} is VALID [2022-04-27 10:24:38,038 INFO L290 TraceCheckUtils]: 12: Hoare triple {4188#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4188#(<= main_~i~0 3)} is VALID [2022-04-27 10:24:38,039 INFO L290 TraceCheckUtils]: 13: Hoare triple {4188#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4189#(<= main_~i~0 4)} is VALID [2022-04-27 10:24:38,039 INFO L290 TraceCheckUtils]: 14: Hoare triple {4189#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4189#(<= main_~i~0 4)} is VALID [2022-04-27 10:24:38,039 INFO L290 TraceCheckUtils]: 15: Hoare triple {4189#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4190#(<= main_~i~0 5)} is VALID [2022-04-27 10:24:38,039 INFO L290 TraceCheckUtils]: 16: Hoare triple {4190#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4190#(<= main_~i~0 5)} is VALID [2022-04-27 10:24:38,040 INFO L290 TraceCheckUtils]: 17: Hoare triple {4190#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4191#(<= main_~i~0 6)} is VALID [2022-04-27 10:24:38,040 INFO L290 TraceCheckUtils]: 18: Hoare triple {4191#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4191#(<= main_~i~0 6)} is VALID [2022-04-27 10:24:38,040 INFO L290 TraceCheckUtils]: 19: Hoare triple {4191#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4192#(<= main_~i~0 7)} is VALID [2022-04-27 10:24:38,040 INFO L290 TraceCheckUtils]: 20: Hoare triple {4192#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4192#(<= main_~i~0 7)} is VALID [2022-04-27 10:24:38,041 INFO L290 TraceCheckUtils]: 21: Hoare triple {4192#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4193#(<= main_~i~0 8)} is VALID [2022-04-27 10:24:38,041 INFO L290 TraceCheckUtils]: 22: Hoare triple {4193#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4193#(<= main_~i~0 8)} is VALID [2022-04-27 10:24:38,041 INFO L290 TraceCheckUtils]: 23: Hoare triple {4193#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4194#(<= main_~i~0 9)} is VALID [2022-04-27 10:24:38,041 INFO L290 TraceCheckUtils]: 24: Hoare triple {4194#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4194#(<= main_~i~0 9)} is VALID [2022-04-27 10:24:38,042 INFO L290 TraceCheckUtils]: 25: Hoare triple {4194#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4195#(<= main_~i~0 10)} is VALID [2022-04-27 10:24:38,042 INFO L290 TraceCheckUtils]: 26: Hoare triple {4195#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4195#(<= main_~i~0 10)} is VALID [2022-04-27 10:24:38,042 INFO L290 TraceCheckUtils]: 27: Hoare triple {4195#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4196#(<= main_~i~0 11)} is VALID [2022-04-27 10:24:38,042 INFO L290 TraceCheckUtils]: 28: Hoare triple {4196#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4196#(<= main_~i~0 11)} is VALID [2022-04-27 10:24:38,043 INFO L290 TraceCheckUtils]: 29: Hoare triple {4196#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4197#(<= main_~i~0 12)} is VALID [2022-04-27 10:24:38,043 INFO L290 TraceCheckUtils]: 30: Hoare triple {4197#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4197#(<= main_~i~0 12)} is VALID [2022-04-27 10:24:38,043 INFO L290 TraceCheckUtils]: 31: Hoare triple {4197#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4198#(<= main_~i~0 13)} is VALID [2022-04-27 10:24:38,043 INFO L290 TraceCheckUtils]: 32: Hoare triple {4198#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4198#(<= main_~i~0 13)} is VALID [2022-04-27 10:24:38,044 INFO L290 TraceCheckUtils]: 33: Hoare triple {4198#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4199#(<= main_~i~0 14)} is VALID [2022-04-27 10:24:38,044 INFO L290 TraceCheckUtils]: 34: Hoare triple {4199#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4199#(<= main_~i~0 14)} is VALID [2022-04-27 10:24:38,044 INFO L290 TraceCheckUtils]: 35: Hoare triple {4199#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4200#(<= main_~i~0 15)} is VALID [2022-04-27 10:24:38,050 INFO L290 TraceCheckUtils]: 36: Hoare triple {4200#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4200#(<= main_~i~0 15)} is VALID [2022-04-27 10:24:38,050 INFO L290 TraceCheckUtils]: 37: Hoare triple {4200#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4201#(<= main_~i~0 16)} is VALID [2022-04-27 10:24:38,051 INFO L290 TraceCheckUtils]: 38: Hoare triple {4201#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4201#(<= main_~i~0 16)} is VALID [2022-04-27 10:24:38,051 INFO L290 TraceCheckUtils]: 39: Hoare triple {4201#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4202#(<= main_~i~0 17)} is VALID [2022-04-27 10:24:38,051 INFO L290 TraceCheckUtils]: 40: Hoare triple {4202#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4202#(<= main_~i~0 17)} is VALID [2022-04-27 10:24:38,052 INFO L290 TraceCheckUtils]: 41: Hoare triple {4202#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4203#(<= main_~i~0 18)} is VALID [2022-04-27 10:24:38,052 INFO L290 TraceCheckUtils]: 42: Hoare triple {4203#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4203#(<= main_~i~0 18)} is VALID [2022-04-27 10:24:38,052 INFO L290 TraceCheckUtils]: 43: Hoare triple {4203#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4204#(<= main_~i~0 19)} is VALID [2022-04-27 10:24:38,053 INFO L290 TraceCheckUtils]: 44: Hoare triple {4204#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4204#(<= main_~i~0 19)} is VALID [2022-04-27 10:24:38,053 INFO L290 TraceCheckUtils]: 45: Hoare triple {4204#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4205#(<= main_~i~0 20)} is VALID [2022-04-27 10:24:38,053 INFO L290 TraceCheckUtils]: 46: Hoare triple {4205#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4205#(<= main_~i~0 20)} is VALID [2022-04-27 10:24:38,054 INFO L290 TraceCheckUtils]: 47: Hoare triple {4205#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4206#(<= main_~i~0 21)} is VALID [2022-04-27 10:24:38,054 INFO L290 TraceCheckUtils]: 48: Hoare triple {4206#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4206#(<= main_~i~0 21)} is VALID [2022-04-27 10:24:38,055 INFO L290 TraceCheckUtils]: 49: Hoare triple {4206#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4207#(<= main_~i~0 22)} is VALID [2022-04-27 10:24:38,055 INFO L290 TraceCheckUtils]: 50: Hoare triple {4207#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4207#(<= main_~i~0 22)} is VALID [2022-04-27 10:24:38,055 INFO L290 TraceCheckUtils]: 51: Hoare triple {4207#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4208#(<= main_~i~0 23)} is VALID [2022-04-27 10:24:38,056 INFO L290 TraceCheckUtils]: 52: Hoare triple {4208#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4208#(<= main_~i~0 23)} is VALID [2022-04-27 10:24:38,056 INFO L290 TraceCheckUtils]: 53: Hoare triple {4208#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4209#(<= main_~i~0 24)} is VALID [2022-04-27 10:24:38,056 INFO L290 TraceCheckUtils]: 54: Hoare triple {4209#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4209#(<= main_~i~0 24)} is VALID [2022-04-27 10:24:38,057 INFO L290 TraceCheckUtils]: 55: Hoare triple {4209#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4210#(<= main_~i~0 25)} is VALID [2022-04-27 10:24:38,057 INFO L290 TraceCheckUtils]: 56: Hoare triple {4210#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4210#(<= main_~i~0 25)} is VALID [2022-04-27 10:24:38,057 INFO L290 TraceCheckUtils]: 57: Hoare triple {4210#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4211#(<= main_~i~0 26)} is VALID [2022-04-27 10:24:38,058 INFO L290 TraceCheckUtils]: 58: Hoare triple {4211#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4211#(<= main_~i~0 26)} is VALID [2022-04-27 10:24:38,058 INFO L290 TraceCheckUtils]: 59: Hoare triple {4211#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4212#(<= main_~i~0 27)} is VALID [2022-04-27 10:24:38,058 INFO L290 TraceCheckUtils]: 60: Hoare triple {4212#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4212#(<= main_~i~0 27)} is VALID [2022-04-27 10:24:38,059 INFO L290 TraceCheckUtils]: 61: Hoare triple {4212#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4213#(<= main_~i~0 28)} is VALID [2022-04-27 10:24:38,059 INFO L290 TraceCheckUtils]: 62: Hoare triple {4213#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4213#(<= main_~i~0 28)} is VALID [2022-04-27 10:24:38,060 INFO L290 TraceCheckUtils]: 63: Hoare triple {4213#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4214#(<= main_~i~0 29)} is VALID [2022-04-27 10:24:38,060 INFO L290 TraceCheckUtils]: 64: Hoare triple {4214#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4214#(<= main_~i~0 29)} is VALID [2022-04-27 10:24:38,060 INFO L290 TraceCheckUtils]: 65: Hoare triple {4214#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4215#(<= main_~i~0 30)} is VALID [2022-04-27 10:24:38,061 INFO L290 TraceCheckUtils]: 66: Hoare triple {4215#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4215#(<= main_~i~0 30)} is VALID [2022-04-27 10:24:38,061 INFO L290 TraceCheckUtils]: 67: Hoare triple {4215#(<= main_~i~0 30)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4216#(<= main_~i~0 31)} is VALID [2022-04-27 10:24:38,061 INFO L290 TraceCheckUtils]: 68: Hoare triple {4216#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4216#(<= main_~i~0 31)} is VALID [2022-04-27 10:24:38,062 INFO L290 TraceCheckUtils]: 69: Hoare triple {4216#(<= main_~i~0 31)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4217#(<= main_~i~0 32)} is VALID [2022-04-27 10:24:38,062 INFO L290 TraceCheckUtils]: 70: Hoare triple {4217#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4217#(<= main_~i~0 32)} is VALID [2022-04-27 10:24:38,062 INFO L290 TraceCheckUtils]: 71: Hoare triple {4217#(<= main_~i~0 32)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4218#(<= main_~i~0 33)} is VALID [2022-04-27 10:24:38,063 INFO L290 TraceCheckUtils]: 72: Hoare triple {4218#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4218#(<= main_~i~0 33)} is VALID [2022-04-27 10:24:38,063 INFO L290 TraceCheckUtils]: 73: Hoare triple {4218#(<= main_~i~0 33)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4219#(<= main_~i~0 34)} is VALID [2022-04-27 10:24:38,064 INFO L290 TraceCheckUtils]: 74: Hoare triple {4219#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4219#(<= main_~i~0 34)} is VALID [2022-04-27 10:24:38,064 INFO L290 TraceCheckUtils]: 75: Hoare triple {4219#(<= main_~i~0 34)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4220#(<= main_~i~0 35)} is VALID [2022-04-27 10:24:38,065 INFO L290 TraceCheckUtils]: 76: Hoare triple {4220#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4220#(<= main_~i~0 35)} is VALID [2022-04-27 10:24:38,065 INFO L290 TraceCheckUtils]: 77: Hoare triple {4220#(<= main_~i~0 35)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4221#(<= main_~i~0 36)} is VALID [2022-04-27 10:24:38,066 INFO L290 TraceCheckUtils]: 78: Hoare triple {4221#(<= main_~i~0 36)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4221#(<= main_~i~0 36)} is VALID [2022-04-27 10:24:38,066 INFO L290 TraceCheckUtils]: 79: Hoare triple {4221#(<= main_~i~0 36)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4222#(<= main_~i~0 37)} is VALID [2022-04-27 10:24:38,066 INFO L290 TraceCheckUtils]: 80: Hoare triple {4222#(<= main_~i~0 37)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4222#(<= main_~i~0 37)} is VALID [2022-04-27 10:24:38,067 INFO L290 TraceCheckUtils]: 81: Hoare triple {4222#(<= main_~i~0 37)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4223#(<= main_~i~0 38)} is VALID [2022-04-27 10:24:38,067 INFO L290 TraceCheckUtils]: 82: Hoare triple {4223#(<= main_~i~0 38)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4223#(<= main_~i~0 38)} is VALID [2022-04-27 10:24:38,067 INFO L290 TraceCheckUtils]: 83: Hoare triple {4223#(<= main_~i~0 38)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4224#(<= main_~i~0 39)} is VALID [2022-04-27 10:24:38,068 INFO L290 TraceCheckUtils]: 84: Hoare triple {4224#(<= main_~i~0 39)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4224#(<= main_~i~0 39)} is VALID [2022-04-27 10:24:38,068 INFO L290 TraceCheckUtils]: 85: Hoare triple {4224#(<= main_~i~0 39)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4225#(<= main_~i~0 40)} is VALID [2022-04-27 10:24:38,069 INFO L290 TraceCheckUtils]: 86: Hoare triple {4225#(<= main_~i~0 40)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4225#(<= main_~i~0 40)} is VALID [2022-04-27 10:24:38,069 INFO L290 TraceCheckUtils]: 87: Hoare triple {4225#(<= main_~i~0 40)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4226#(<= main_~i~0 41)} is VALID [2022-04-27 10:24:38,069 INFO L290 TraceCheckUtils]: 88: Hoare triple {4226#(<= main_~i~0 41)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4226#(<= main_~i~0 41)} is VALID [2022-04-27 10:24:38,070 INFO L290 TraceCheckUtils]: 89: Hoare triple {4226#(<= main_~i~0 41)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4227#(<= main_~i~0 42)} is VALID [2022-04-27 10:24:38,070 INFO L290 TraceCheckUtils]: 90: Hoare triple {4227#(<= main_~i~0 42)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4227#(<= main_~i~0 42)} is VALID [2022-04-27 10:24:38,070 INFO L290 TraceCheckUtils]: 91: Hoare triple {4227#(<= main_~i~0 42)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4228#(<= main_~i~0 43)} is VALID [2022-04-27 10:24:38,071 INFO L290 TraceCheckUtils]: 92: Hoare triple {4228#(<= main_~i~0 43)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4228#(<= main_~i~0 43)} is VALID [2022-04-27 10:24:38,071 INFO L290 TraceCheckUtils]: 93: Hoare triple {4228#(<= main_~i~0 43)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4229#(<= main_~i~0 44)} is VALID [2022-04-27 10:24:38,071 INFO L290 TraceCheckUtils]: 94: Hoare triple {4229#(<= main_~i~0 44)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4229#(<= main_~i~0 44)} is VALID [2022-04-27 10:24:38,072 INFO L290 TraceCheckUtils]: 95: Hoare triple {4229#(<= main_~i~0 44)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4230#(<= main_~i~0 45)} is VALID [2022-04-27 10:24:38,072 INFO L290 TraceCheckUtils]: 96: Hoare triple {4230#(<= main_~i~0 45)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4230#(<= main_~i~0 45)} is VALID [2022-04-27 10:24:38,073 INFO L290 TraceCheckUtils]: 97: Hoare triple {4230#(<= main_~i~0 45)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4231#(<= main_~i~0 46)} is VALID [2022-04-27 10:24:38,073 INFO L290 TraceCheckUtils]: 98: Hoare triple {4231#(<= main_~i~0 46)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4231#(<= main_~i~0 46)} is VALID [2022-04-27 10:24:38,073 INFO L290 TraceCheckUtils]: 99: Hoare triple {4231#(<= main_~i~0 46)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4232#(<= main_~i~0 47)} is VALID [2022-04-27 10:24:38,074 INFO L290 TraceCheckUtils]: 100: Hoare triple {4232#(<= main_~i~0 47)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4232#(<= main_~i~0 47)} is VALID [2022-04-27 10:24:38,074 INFO L290 TraceCheckUtils]: 101: Hoare triple {4232#(<= main_~i~0 47)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4233#(<= main_~i~0 48)} is VALID [2022-04-27 10:24:38,074 INFO L290 TraceCheckUtils]: 102: Hoare triple {4233#(<= main_~i~0 48)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4233#(<= main_~i~0 48)} is VALID [2022-04-27 10:24:38,075 INFO L290 TraceCheckUtils]: 103: Hoare triple {4233#(<= main_~i~0 48)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4234#(<= main_~i~0 49)} is VALID [2022-04-27 10:24:38,075 INFO L290 TraceCheckUtils]: 104: Hoare triple {4234#(<= main_~i~0 49)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4234#(<= main_~i~0 49)} is VALID [2022-04-27 10:24:38,076 INFO L290 TraceCheckUtils]: 105: Hoare triple {4234#(<= main_~i~0 49)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4235#(<= main_~i~0 50)} is VALID [2022-04-27 10:24:38,076 INFO L290 TraceCheckUtils]: 106: Hoare triple {4235#(<= main_~i~0 50)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4235#(<= main_~i~0 50)} is VALID [2022-04-27 10:24:38,076 INFO L290 TraceCheckUtils]: 107: Hoare triple {4235#(<= main_~i~0 50)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4236#(<= main_~i~0 51)} is VALID [2022-04-27 10:24:38,077 INFO L290 TraceCheckUtils]: 108: Hoare triple {4236#(<= main_~i~0 51)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4236#(<= main_~i~0 51)} is VALID [2022-04-27 10:24:38,077 INFO L290 TraceCheckUtils]: 109: Hoare triple {4236#(<= main_~i~0 51)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4237#(<= main_~i~0 52)} is VALID [2022-04-27 10:24:38,077 INFO L290 TraceCheckUtils]: 110: Hoare triple {4237#(<= main_~i~0 52)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4237#(<= main_~i~0 52)} is VALID [2022-04-27 10:24:38,078 INFO L290 TraceCheckUtils]: 111: Hoare triple {4237#(<= main_~i~0 52)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4238#(<= main_~i~0 53)} is VALID [2022-04-27 10:24:38,078 INFO L290 TraceCheckUtils]: 112: Hoare triple {4238#(<= main_~i~0 53)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4238#(<= main_~i~0 53)} is VALID [2022-04-27 10:24:38,078 INFO L290 TraceCheckUtils]: 113: Hoare triple {4238#(<= main_~i~0 53)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4239#(<= main_~i~0 54)} is VALID [2022-04-27 10:24:38,079 INFO L290 TraceCheckUtils]: 114: Hoare triple {4239#(<= main_~i~0 54)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4239#(<= main_~i~0 54)} is VALID [2022-04-27 10:24:38,079 INFO L290 TraceCheckUtils]: 115: Hoare triple {4239#(<= main_~i~0 54)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4240#(<= main_~i~0 55)} is VALID [2022-04-27 10:24:38,079 INFO L290 TraceCheckUtils]: 116: Hoare triple {4240#(<= main_~i~0 55)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4240#(<= main_~i~0 55)} is VALID [2022-04-27 10:24:38,080 INFO L290 TraceCheckUtils]: 117: Hoare triple {4240#(<= main_~i~0 55)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4241#(<= main_~i~0 56)} is VALID [2022-04-27 10:24:38,080 INFO L290 TraceCheckUtils]: 118: Hoare triple {4241#(<= main_~i~0 56)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4241#(<= main_~i~0 56)} is VALID [2022-04-27 10:24:38,080 INFO L290 TraceCheckUtils]: 119: Hoare triple {4241#(<= main_~i~0 56)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4242#(<= main_~i~0 57)} is VALID [2022-04-27 10:24:38,081 INFO L290 TraceCheckUtils]: 120: Hoare triple {4242#(<= main_~i~0 57)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4242#(<= main_~i~0 57)} is VALID [2022-04-27 10:24:38,081 INFO L290 TraceCheckUtils]: 121: Hoare triple {4242#(<= main_~i~0 57)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4243#(<= main_~i~0 58)} is VALID [2022-04-27 10:24:38,081 INFO L290 TraceCheckUtils]: 122: Hoare triple {4243#(<= main_~i~0 58)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4243#(<= main_~i~0 58)} is VALID [2022-04-27 10:24:38,082 INFO L290 TraceCheckUtils]: 123: Hoare triple {4243#(<= main_~i~0 58)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4244#(<= main_~i~0 59)} is VALID [2022-04-27 10:24:38,082 INFO L290 TraceCheckUtils]: 124: Hoare triple {4244#(<= main_~i~0 59)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4244#(<= main_~i~0 59)} is VALID [2022-04-27 10:24:38,082 INFO L290 TraceCheckUtils]: 125: Hoare triple {4244#(<= main_~i~0 59)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4245#(<= main_~i~0 60)} is VALID [2022-04-27 10:24:38,083 INFO L290 TraceCheckUtils]: 126: Hoare triple {4245#(<= main_~i~0 60)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4245#(<= main_~i~0 60)} is VALID [2022-04-27 10:24:38,083 INFO L290 TraceCheckUtils]: 127: Hoare triple {4245#(<= main_~i~0 60)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4246#(<= main_~i~0 61)} is VALID [2022-04-27 10:24:38,083 INFO L290 TraceCheckUtils]: 128: Hoare triple {4246#(<= main_~i~0 61)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4246#(<= main_~i~0 61)} is VALID [2022-04-27 10:24:38,084 INFO L290 TraceCheckUtils]: 129: Hoare triple {4246#(<= main_~i~0 61)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4247#(<= main_~i~0 62)} is VALID [2022-04-27 10:24:38,084 INFO L290 TraceCheckUtils]: 130: Hoare triple {4247#(<= main_~i~0 62)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4247#(<= main_~i~0 62)} is VALID [2022-04-27 10:24:38,085 INFO L290 TraceCheckUtils]: 131: Hoare triple {4247#(<= main_~i~0 62)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4248#(<= main_~i~0 63)} is VALID [2022-04-27 10:24:38,085 INFO L290 TraceCheckUtils]: 132: Hoare triple {4248#(<= main_~i~0 63)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4248#(<= main_~i~0 63)} is VALID [2022-04-27 10:24:38,085 INFO L290 TraceCheckUtils]: 133: Hoare triple {4248#(<= main_~i~0 63)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4249#(<= main_~i~0 64)} is VALID [2022-04-27 10:24:38,085 INFO L290 TraceCheckUtils]: 134: Hoare triple {4249#(<= main_~i~0 64)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4249#(<= main_~i~0 64)} is VALID [2022-04-27 10:24:38,086 INFO L290 TraceCheckUtils]: 135: Hoare triple {4249#(<= main_~i~0 64)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4250#(<= main_~i~0 65)} is VALID [2022-04-27 10:24:38,086 INFO L290 TraceCheckUtils]: 136: Hoare triple {4250#(<= main_~i~0 65)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4250#(<= main_~i~0 65)} is VALID [2022-04-27 10:24:38,087 INFO L290 TraceCheckUtils]: 137: Hoare triple {4250#(<= main_~i~0 65)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4251#(<= main_~i~0 66)} is VALID [2022-04-27 10:24:38,087 INFO L290 TraceCheckUtils]: 138: Hoare triple {4251#(<= main_~i~0 66)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4251#(<= main_~i~0 66)} is VALID [2022-04-27 10:24:38,087 INFO L290 TraceCheckUtils]: 139: Hoare triple {4251#(<= main_~i~0 66)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4252#(<= main_~i~0 67)} is VALID [2022-04-27 10:24:38,087 INFO L290 TraceCheckUtils]: 140: Hoare triple {4252#(<= main_~i~0 67)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4252#(<= main_~i~0 67)} is VALID [2022-04-27 10:24:38,088 INFO L290 TraceCheckUtils]: 141: Hoare triple {4252#(<= main_~i~0 67)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4253#(<= main_~i~0 68)} is VALID [2022-04-27 10:24:38,088 INFO L290 TraceCheckUtils]: 142: Hoare triple {4253#(<= main_~i~0 68)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4253#(<= main_~i~0 68)} is VALID [2022-04-27 10:24:38,089 INFO L290 TraceCheckUtils]: 143: Hoare triple {4253#(<= main_~i~0 68)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4254#(<= main_~i~0 69)} is VALID [2022-04-27 10:24:38,089 INFO L290 TraceCheckUtils]: 144: Hoare triple {4254#(<= main_~i~0 69)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4254#(<= main_~i~0 69)} is VALID [2022-04-27 10:24:38,107 INFO L290 TraceCheckUtils]: 145: Hoare triple {4254#(<= main_~i~0 69)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4255#(<= main_~i~0 70)} is VALID [2022-04-27 10:24:38,107 INFO L290 TraceCheckUtils]: 146: Hoare triple {4255#(<= main_~i~0 70)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4255#(<= main_~i~0 70)} is VALID [2022-04-27 10:24:38,108 INFO L290 TraceCheckUtils]: 147: Hoare triple {4255#(<= main_~i~0 70)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4256#(<= main_~i~0 71)} is VALID [2022-04-27 10:24:38,108 INFO L290 TraceCheckUtils]: 148: Hoare triple {4256#(<= main_~i~0 71)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4256#(<= main_~i~0 71)} is VALID [2022-04-27 10:24:38,108 INFO L290 TraceCheckUtils]: 149: Hoare triple {4256#(<= main_~i~0 71)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4257#(<= main_~i~0 72)} is VALID [2022-04-27 10:24:38,109 INFO L290 TraceCheckUtils]: 150: Hoare triple {4257#(<= main_~i~0 72)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4257#(<= main_~i~0 72)} is VALID [2022-04-27 10:24:38,109 INFO L290 TraceCheckUtils]: 151: Hoare triple {4257#(<= main_~i~0 72)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4258#(<= main_~i~0 73)} is VALID [2022-04-27 10:24:38,109 INFO L290 TraceCheckUtils]: 152: Hoare triple {4258#(<= main_~i~0 73)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4258#(<= main_~i~0 73)} is VALID [2022-04-27 10:24:38,110 INFO L290 TraceCheckUtils]: 153: Hoare triple {4258#(<= main_~i~0 73)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4259#(<= main_~i~0 74)} is VALID [2022-04-27 10:24:38,110 INFO L290 TraceCheckUtils]: 154: Hoare triple {4259#(<= main_~i~0 74)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4259#(<= main_~i~0 74)} is VALID [2022-04-27 10:24:38,110 INFO L290 TraceCheckUtils]: 155: Hoare triple {4259#(<= main_~i~0 74)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4260#(<= main_~i~0 75)} is VALID [2022-04-27 10:24:38,111 INFO L290 TraceCheckUtils]: 156: Hoare triple {4260#(<= main_~i~0 75)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4260#(<= main_~i~0 75)} is VALID [2022-04-27 10:24:38,111 INFO L290 TraceCheckUtils]: 157: Hoare triple {4260#(<= main_~i~0 75)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4261#(<= main_~i~0 76)} is VALID [2022-04-27 10:24:38,111 INFO L290 TraceCheckUtils]: 158: Hoare triple {4261#(<= main_~i~0 76)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4261#(<= main_~i~0 76)} is VALID [2022-04-27 10:24:38,112 INFO L290 TraceCheckUtils]: 159: Hoare triple {4261#(<= main_~i~0 76)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4262#(<= main_~i~0 77)} is VALID [2022-04-27 10:24:38,112 INFO L290 TraceCheckUtils]: 160: Hoare triple {4262#(<= main_~i~0 77)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4262#(<= main_~i~0 77)} is VALID [2022-04-27 10:24:38,112 INFO L290 TraceCheckUtils]: 161: Hoare triple {4262#(<= main_~i~0 77)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4263#(<= main_~i~0 78)} is VALID [2022-04-27 10:24:38,113 INFO L290 TraceCheckUtils]: 162: Hoare triple {4263#(<= main_~i~0 78)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4263#(<= main_~i~0 78)} is VALID [2022-04-27 10:24:38,113 INFO L290 TraceCheckUtils]: 163: Hoare triple {4263#(<= main_~i~0 78)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4264#(<= main_~i~0 79)} is VALID [2022-04-27 10:24:38,113 INFO L290 TraceCheckUtils]: 164: Hoare triple {4264#(<= main_~i~0 79)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4264#(<= main_~i~0 79)} is VALID [2022-04-27 10:24:38,114 INFO L290 TraceCheckUtils]: 165: Hoare triple {4264#(<= main_~i~0 79)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4265#(<= main_~i~0 80)} is VALID [2022-04-27 10:24:38,114 INFO L290 TraceCheckUtils]: 166: Hoare triple {4265#(<= main_~i~0 80)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4265#(<= main_~i~0 80)} is VALID [2022-04-27 10:24:38,114 INFO L290 TraceCheckUtils]: 167: Hoare triple {4265#(<= main_~i~0 80)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4266#(<= main_~i~0 81)} is VALID [2022-04-27 10:24:38,114 INFO L290 TraceCheckUtils]: 168: Hoare triple {4266#(<= main_~i~0 81)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4266#(<= main_~i~0 81)} is VALID [2022-04-27 10:24:38,115 INFO L290 TraceCheckUtils]: 169: Hoare triple {4266#(<= main_~i~0 81)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4267#(<= main_~i~0 82)} is VALID [2022-04-27 10:24:38,115 INFO L290 TraceCheckUtils]: 170: Hoare triple {4267#(<= main_~i~0 82)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4267#(<= main_~i~0 82)} is VALID [2022-04-27 10:24:38,116 INFO L290 TraceCheckUtils]: 171: Hoare triple {4267#(<= main_~i~0 82)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4268#(<= main_~i~0 83)} is VALID [2022-04-27 10:24:38,116 INFO L290 TraceCheckUtils]: 172: Hoare triple {4268#(<= main_~i~0 83)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4268#(<= main_~i~0 83)} is VALID [2022-04-27 10:24:38,116 INFO L290 TraceCheckUtils]: 173: Hoare triple {4268#(<= main_~i~0 83)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4269#(<= main_~i~0 84)} is VALID [2022-04-27 10:24:38,116 INFO L290 TraceCheckUtils]: 174: Hoare triple {4269#(<= main_~i~0 84)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4269#(<= main_~i~0 84)} is VALID [2022-04-27 10:24:38,117 INFO L290 TraceCheckUtils]: 175: Hoare triple {4269#(<= main_~i~0 84)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4270#(<= main_~i~0 85)} is VALID [2022-04-27 10:24:38,117 INFO L290 TraceCheckUtils]: 176: Hoare triple {4270#(<= main_~i~0 85)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4270#(<= main_~i~0 85)} is VALID [2022-04-27 10:24:38,117 INFO L290 TraceCheckUtils]: 177: Hoare triple {4270#(<= main_~i~0 85)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4271#(<= main_~i~0 86)} is VALID [2022-04-27 10:24:38,118 INFO L290 TraceCheckUtils]: 178: Hoare triple {4271#(<= main_~i~0 86)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4271#(<= main_~i~0 86)} is VALID [2022-04-27 10:24:38,118 INFO L290 TraceCheckUtils]: 179: Hoare triple {4271#(<= main_~i~0 86)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4272#(<= main_~i~0 87)} is VALID [2022-04-27 10:24:38,118 INFO L290 TraceCheckUtils]: 180: Hoare triple {4272#(<= main_~i~0 87)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4272#(<= main_~i~0 87)} is VALID [2022-04-27 10:24:38,119 INFO L290 TraceCheckUtils]: 181: Hoare triple {4272#(<= main_~i~0 87)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4273#(<= main_~i~0 88)} is VALID [2022-04-27 10:24:38,119 INFO L290 TraceCheckUtils]: 182: Hoare triple {4273#(<= main_~i~0 88)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4273#(<= main_~i~0 88)} is VALID [2022-04-27 10:24:38,119 INFO L290 TraceCheckUtils]: 183: Hoare triple {4273#(<= main_~i~0 88)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4274#(<= main_~i~0 89)} is VALID [2022-04-27 10:24:38,120 INFO L290 TraceCheckUtils]: 184: Hoare triple {4274#(<= main_~i~0 89)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4274#(<= main_~i~0 89)} is VALID [2022-04-27 10:24:38,120 INFO L290 TraceCheckUtils]: 185: Hoare triple {4274#(<= main_~i~0 89)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4275#(<= main_~i~0 90)} is VALID [2022-04-27 10:24:38,120 INFO L290 TraceCheckUtils]: 186: Hoare triple {4275#(<= main_~i~0 90)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4275#(<= main_~i~0 90)} is VALID [2022-04-27 10:24:38,121 INFO L290 TraceCheckUtils]: 187: Hoare triple {4275#(<= main_~i~0 90)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4276#(<= main_~i~0 91)} is VALID [2022-04-27 10:24:38,121 INFO L290 TraceCheckUtils]: 188: Hoare triple {4276#(<= main_~i~0 91)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4276#(<= main_~i~0 91)} is VALID [2022-04-27 10:24:38,121 INFO L290 TraceCheckUtils]: 189: Hoare triple {4276#(<= main_~i~0 91)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4277#(<= main_~i~0 92)} is VALID [2022-04-27 10:24:38,122 INFO L290 TraceCheckUtils]: 190: Hoare triple {4277#(<= main_~i~0 92)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4277#(<= main_~i~0 92)} is VALID [2022-04-27 10:24:38,122 INFO L290 TraceCheckUtils]: 191: Hoare triple {4277#(<= main_~i~0 92)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4278#(<= main_~i~0 93)} is VALID [2022-04-27 10:24:38,122 INFO L290 TraceCheckUtils]: 192: Hoare triple {4278#(<= main_~i~0 93)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4278#(<= main_~i~0 93)} is VALID [2022-04-27 10:24:38,123 INFO L290 TraceCheckUtils]: 193: Hoare triple {4278#(<= main_~i~0 93)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4279#(<= main_~i~0 94)} is VALID [2022-04-27 10:24:38,123 INFO L290 TraceCheckUtils]: 194: Hoare triple {4279#(<= main_~i~0 94)} assume !(~i~0 < 1024); {4181#false} is VALID [2022-04-27 10:24:38,123 INFO L290 TraceCheckUtils]: 195: Hoare triple {4181#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {4181#false} is VALID [2022-04-27 10:24:38,123 INFO L272 TraceCheckUtils]: 196: Hoare triple {4181#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {4181#false} is VALID [2022-04-27 10:24:38,123 INFO L290 TraceCheckUtils]: 197: Hoare triple {4181#false} ~cond := #in~cond; {4181#false} is VALID [2022-04-27 10:24:38,123 INFO L290 TraceCheckUtils]: 198: Hoare triple {4181#false} assume 0 == ~cond; {4181#false} is VALID [2022-04-27 10:24:38,123 INFO L290 TraceCheckUtils]: 199: Hoare triple {4181#false} assume !false; {4181#false} is VALID [2022-04-27 10:24:38,127 INFO L134 CoverageAnalysis]: Checked inductivity of 8836 backedges. 0 proven. 8836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:24:38,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:24:38,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539771535] [2022-04-27 10:24:38,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539771535] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:24:38,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413439932] [2022-04-27 10:24:38,127 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 10:24:38,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:24:38,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:24:38,128 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-27 10:24:38,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process