./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/960521-1-2.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/960521-1-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 19e2947f690bcfa099d607c2a0a6dc0e6f351f54e3f3874a42109cbf9e336957 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:43:49,704 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:43:49,705 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:43:49,729 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:43:49,730 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:43:49,732 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:43:49,734 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:43:49,738 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:43:49,739 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:43:49,742 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:43:49,743 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:43:49,744 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:43:49,744 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:43:49,746 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:43:49,746 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:43:49,748 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:43:49,748 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:43:49,749 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:43:49,751 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:43:49,759 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:43:49,760 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:43:49,761 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:43:49,762 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:43:49,762 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:43:49,767 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:43:49,767 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:43:49,767 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:43:49,768 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:43:49,768 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:43:49,769 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:43:49,770 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:43:49,770 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:43:49,771 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:43:49,772 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:43:49,773 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:43:49,773 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:43:49,773 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:43:49,773 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:43:49,773 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:43:49,774 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:43:49,774 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:43:49,775 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-02-20 23:43:49,803 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:43:49,803 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:43:49,803 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:43:49,804 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:43:49,804 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:43:49,804 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:43:49,805 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:43:49,805 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:43:49,805 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:43:49,805 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:43:49,806 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:43:49,806 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:43:49,806 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:43:49,806 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:43:49,806 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:43:49,806 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:43:49,807 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:43:49,807 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:43:49,807 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:43:49,807 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:43:49,807 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:43:49,807 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:43:49,807 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:43:49,808 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:43:49,808 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:43:49,808 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:43:49,808 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:43:49,808 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:43:49,808 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:43:49,808 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:43:49,808 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 19e2947f690bcfa099d607c2a0a6dc0e6f351f54e3f3874a42109cbf9e336957 [2022-02-20 23:43:50,003 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:43:50,019 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:43:50,020 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:43:50,021 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:43:50,022 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:43:50,023 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/960521-1-2.i [2022-02-20 23:43:50,076 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2979ebe8/85a263ce965f41378ecc6e08111a4836/FLAGadd200660 [2022-02-20 23:43:50,448 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:43:50,454 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/960521-1-2.i [2022-02-20 23:43:50,467 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2979ebe8/85a263ce965f41378ecc6e08111a4836/FLAGadd200660 [2022-02-20 23:43:50,475 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2979ebe8/85a263ce965f41378ecc6e08111a4836 [2022-02-20 23:43:50,477 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:43:50,478 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:43:50,480 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:43:50,480 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:43:50,482 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:43:50,483 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:43:50" (1/1) ... [2022-02-20 23:43:50,484 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@363fe4c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:50, skipping insertion in model container [2022-02-20 23:43:50,484 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:43:50" (1/1) ... [2022-02-20 23:43:50,488 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:43:50,515 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:43:50,738 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:43:50,742 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:43:50,765 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:43:50,782 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:43:50,784 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:50 WrapperNode [2022-02-20 23:43:50,784 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:43:50,785 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:43:50,785 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:43:50,785 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:43:50,790 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:50" (1/1) ... [2022-02-20 23:43:50,807 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:50" (1/1) ... [2022-02-20 23:43:50,822 INFO L137 Inliner]: procedures = 121, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 65 [2022-02-20 23:43:50,833 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:43:50,833 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:43:50,833 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:43:50,834 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:43:50,838 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:50" (1/1) ... [2022-02-20 23:43:50,839 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:50" (1/1) ... [2022-02-20 23:43:50,841 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:50" (1/1) ... [2022-02-20 23:43:50,842 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:50" (1/1) ... [2022-02-20 23:43:50,847 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:50" (1/1) ... [2022-02-20 23:43:50,855 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:50" (1/1) ... [2022-02-20 23:43:50,859 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:50" (1/1) ... [2022-02-20 23:43:50,866 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:43:50,867 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:43:50,867 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:43:50,868 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:43:50,873 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:50" (1/1) ... [2022-02-20 23:43:50,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:43:50,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:43:50,899 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-02-20 23:43:50,917 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-02-20 23:43:50,930 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 23:43:50,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 23:43:50,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:43:50,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:43:50,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:43:50,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 23:43:50,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:43:50,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:43:51,006 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:43:51,008 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:43:51,205 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:43:51,210 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:43:51,210 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 23:43:51,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:43:51 BoogieIcfgContainer [2022-02-20 23:43:51,211 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:43:51,212 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:43:51,212 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:43:51,215 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:43:51,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:43:50" (1/3) ... [2022-02-20 23:43:51,215 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12f2248d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:43:51, skipping insertion in model container [2022-02-20 23:43:51,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:50" (2/3) ... [2022-02-20 23:43:51,219 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12f2248d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:43:51, skipping insertion in model container [2022-02-20 23:43:51,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:43:51" (3/3) ... [2022-02-20 23:43:51,220 INFO L111 eAbstractionObserver]: Analyzing ICFG 960521-1-2.i [2022-02-20 23:43:51,224 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:43:51,224 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 21 error locations. [2022-02-20 23:43:51,250 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:43:51,254 INFO L339 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=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 23:43:51,254 INFO L340 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2022-02-20 23:43:51,264 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 29 states have (on average 1.896551724137931) internal successors, (55), 50 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:51,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-20 23:43:51,267 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:43:51,268 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-20 23:43:51,268 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2022-02-20 23:43:51,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:43:51,272 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-02-20 23:43:51,289 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:43:51,291 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883889328] [2022-02-20 23:43:51,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:51,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:43:51,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:51,441 INFO L290 TraceCheckUtils]: 0: Hoare triple {54#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);~a~0.base, ~a~0.offset := 0, 0;~b~0.base, ~b~0.offset := 0, 0;~n~0 := 0; {54#true} is VALID [2022-02-20 23:43:51,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {54#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~post7#1.base, main_#t~post7#1.offset, main_#t~mem8#1;~n~0 := 32768;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~a~0.base, ~a~0.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~b~0.base, ~b~0.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_#t~post7#1.base, main_#t~post7#1.offset := ~b~0.base, ~b~0.offset;~b~0.base, ~b~0.offset := main_#t~post7#1.base, 4 + main_#t~post7#1.offset; {56#(= (select |#valid| |ULTIMATE.start_main_#t~post7#1.base|) 1)} is VALID [2022-02-20 23:43:51,444 INFO L290 TraceCheckUtils]: 2: Hoare triple {56#(= (select |#valid| |ULTIMATE.start_main_#t~post7#1.base|) 1)} assume !(1 == #valid[main_#t~post7#1.base]); {55#false} is VALID [2022-02-20 23:43:51,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:43:51,445 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:43:51,446 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883889328] [2022-02-20 23:43:51,446 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883889328] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:43:51,446 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:43:51,447 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:43:51,449 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323195861] [2022-02-20 23:43:51,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:43:51,459 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-02-20 23:43:51,460 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:43:51,462 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:51,468 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:51,468 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:43:51,468 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:43:51,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:43:51,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:43:51,488 INFO L87 Difference]: Start difference. First operand has 51 states, 29 states have (on average 1.896551724137931) internal successors, (55), 50 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:51,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:51,607 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2022-02-20 23:43:51,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:43:51,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-02-20 23:43:51,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:43:51,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:51,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-02-20 23:43:51,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:51,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-02-20 23:43:51,626 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 55 transitions. [2022-02-20 23:43:51,676 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:51,685 INFO L225 Difference]: With dead ends: 50 [2022-02-20 23:43:51,685 INFO L226 Difference]: Without dead ends: 48 [2022-02-20 23:43:51,692 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:43:51,695 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 2 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:43:51,697 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 81 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:43:51,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-02-20 23:43:51,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-02-20 23:43:51,716 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:43:51,718 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 48 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 47 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:51,718 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 48 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 47 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:51,721 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 48 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 47 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:51,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:51,724 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2022-02-20 23:43:51,724 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2022-02-20 23:43:51,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:51,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:51,725 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 47 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 48 states. [2022-02-20 23:43:51,725 INFO L87 Difference]: Start difference. First operand has 48 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 47 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 48 states. [2022-02-20 23:43:51,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:51,728 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2022-02-20 23:43:51,728 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2022-02-20 23:43:51,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:51,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:51,729 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:43:51,729 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:43:51,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 47 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:51,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2022-02-20 23:43:51,735 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 3 [2022-02-20 23:43:51,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:43:51,736 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2022-02-20 23:43:51,736 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:51,737 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2022-02-20 23:43:51,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-20 23:43:51,738 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:43:51,738 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-20 23:43:51,738 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 23:43:51,738 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2022-02-20 23:43:51,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:43:51,739 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-02-20 23:43:51,739 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:43:51,739 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130662928] [2022-02-20 23:43:51,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:51,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:43:51,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:51,798 INFO L290 TraceCheckUtils]: 0: Hoare triple {253#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);~a~0.base, ~a~0.offset := 0, 0;~b~0.base, ~b~0.offset := 0, 0;~n~0 := 0; {253#true} is VALID [2022-02-20 23:43:51,799 INFO L290 TraceCheckUtils]: 1: Hoare triple {253#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~post7#1.base, main_#t~post7#1.offset, main_#t~mem8#1;~n~0 := 32768;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~a~0.base, ~a~0.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~b~0.base, ~b~0.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_#t~post7#1.base, main_#t~post7#1.offset := ~b~0.base, ~b~0.offset;~b~0.base, ~b~0.offset := main_#t~post7#1.base, 4 + main_#t~post7#1.offset; {255#(and (= 0 |ULTIMATE.start_main_#t~post7#1.offset|) (<= 131072 (select |#length| |ULTIMATE.start_main_#t~post7#1.base|)))} is VALID [2022-02-20 23:43:51,800 INFO L290 TraceCheckUtils]: 2: Hoare triple {255#(and (= 0 |ULTIMATE.start_main_#t~post7#1.offset|) (<= 131072 (select |#length| |ULTIMATE.start_main_#t~post7#1.base|)))} assume !(4 + main_#t~post7#1.offset <= #length[main_#t~post7#1.base] && 0 <= main_#t~post7#1.offset); {254#false} is VALID [2022-02-20 23:43:51,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:43:51,801 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:43:51,801 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130662928] [2022-02-20 23:43:51,802 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130662928] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:43:51,802 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:43:51,803 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:43:51,803 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382699996] [2022-02-20 23:43:51,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:43:51,804 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-02-20 23:43:51,804 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:43:51,805 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:51,808 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:51,812 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:43:51,812 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:43:51,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:43:51,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:43:51,813 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:51,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:51,867 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2022-02-20 23:43:51,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:43:51,867 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-02-20 23:43:51,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:43:51,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:51,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-02-20 23:43:51,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:51,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-02-20 23:43:51,870 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 50 transitions. [2022-02-20 23:43:51,901 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:51,903 INFO L225 Difference]: With dead ends: 47 [2022-02-20 23:43:51,903 INFO L226 Difference]: Without dead ends: 47 [2022-02-20 23:43:51,904 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:43:51,908 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 1 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:43:51,909 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 87 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:43:51,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-02-20 23:43:51,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-02-20 23:43:51,918 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:43:51,919 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 28 states have (on average 1.75) internal successors, (49), 46 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:51,920 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 28 states have (on average 1.75) internal successors, (49), 46 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:51,921 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 28 states have (on average 1.75) internal successors, (49), 46 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:51,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:51,929 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2022-02-20 23:43:51,929 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-02-20 23:43:51,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:51,930 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:51,930 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 28 states have (on average 1.75) internal successors, (49), 46 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 47 states. [2022-02-20 23:43:51,931 INFO L87 Difference]: Start difference. First operand has 47 states, 28 states have (on average 1.75) internal successors, (49), 46 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 47 states. [2022-02-20 23:43:51,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:51,933 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2022-02-20 23:43:51,933 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-02-20 23:43:51,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:51,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:51,934 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:43:51,934 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:43:51,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 28 states have (on average 1.75) internal successors, (49), 46 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:51,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2022-02-20 23:43:51,936 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 3 [2022-02-20 23:43:51,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:43:51,936 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2022-02-20 23:43:51,936 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:51,936 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-02-20 23:43:51,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 23:43:51,937 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:43:51,937 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 23:43:51,937 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 23:43:51,937 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2022-02-20 23:43:51,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:43:51,938 INFO L85 PathProgramCache]: Analyzing trace with hash 889446312, now seen corresponding path program 1 times [2022-02-20 23:43:51,938 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:43:51,938 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140423060] [2022-02-20 23:43:51,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:51,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:43:51,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:51,984 INFO L290 TraceCheckUtils]: 0: Hoare triple {446#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);~a~0.base, ~a~0.offset := 0, 0;~b~0.base, ~b~0.offset := 0, 0;~n~0 := 0; {446#true} is VALID [2022-02-20 23:43:51,986 INFO L290 TraceCheckUtils]: 1: Hoare triple {446#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~post7#1.base, main_#t~post7#1.offset, main_#t~mem8#1;~n~0 := 32768;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~a~0.base, ~a~0.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~b~0.base, ~b~0.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_#t~post7#1.base, main_#t~post7#1.offset := ~b~0.base, ~b~0.offset;~b~0.base, ~b~0.offset := main_#t~post7#1.base, 4 + main_#t~post7#1.offset; {448#(or (= (select |#valid| ~a~0.base) 1) (= ~a~0.base |ULTIMATE.start_main_#t~post7#1.base|))} is VALID [2022-02-20 23:43:51,987 INFO L290 TraceCheckUtils]: 2: Hoare triple {448#(or (= (select |#valid| ~a~0.base) 1) (= ~a~0.base |ULTIMATE.start_main_#t~post7#1.base|))} SUMMARY for call write~int(0, main_#t~post7#1.base, main_#t~post7#1.offset, 4); srcloc: L538 {449#(= (select |#valid| ~a~0.base) 1)} is VALID [2022-02-20 23:43:51,988 INFO L290 TraceCheckUtils]: 3: Hoare triple {449#(= (select |#valid| ~a~0.base) 1)} havoc main_#t~post7#1.base, main_#t~post7#1.offset;assume { :begin_inline_foo } true;havoc foo_#t~post3#1, foo_#t~post4#1, foo_~i~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {449#(= (select |#valid| ~a~0.base) 1)} is VALID [2022-02-20 23:43:51,989 INFO L290 TraceCheckUtils]: 4: Hoare triple {449#(= (select |#valid| ~a~0.base) 1)} assume !!(foo_~i~0#1 < ~n~0); {449#(= (select |#valid| ~a~0.base) 1)} is VALID [2022-02-20 23:43:51,991 INFO L290 TraceCheckUtils]: 5: Hoare triple {449#(= (select |#valid| ~a~0.base) 1)} assume !(1 == #valid[~a~0.base]); {447#false} is VALID [2022-02-20 23:43:51,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:43:51,995 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:43:51,995 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140423060] [2022-02-20 23:43:51,996 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140423060] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:43:51,996 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:43:51,996 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:43:51,996 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534104141] [2022-02-20 23:43:51,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:43:51,997 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 23:43:51,997 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:43:51,997 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:52,002 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:52,002 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:43:52,003 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:43:52,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:43:52,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:43:52,003 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:52,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:52,072 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-02-20 23:43:52,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:43:52,073 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 23:43:52,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:43:52,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:52,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2022-02-20 23:43:52,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:52,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2022-02-20 23:43:52,076 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 49 transitions. [2022-02-20 23:43:52,103 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:52,104 INFO L225 Difference]: With dead ends: 44 [2022-02-20 23:43:52,104 INFO L226 Difference]: Without dead ends: 44 [2022-02-20 23:43:52,105 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:43:52,110 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 28 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:43:52,112 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 51 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:43:52,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-02-20 23:43:52,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-02-20 23:43:52,118 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:43:52,118 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 43 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:52,118 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 43 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:52,119 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 43 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:52,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:52,121 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-02-20 23:43:52,121 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-02-20 23:43:52,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:52,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:52,123 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 43 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 44 states. [2022-02-20 23:43:52,123 INFO L87 Difference]: Start difference. First operand has 44 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 43 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 44 states. [2022-02-20 23:43:52,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:52,125 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-02-20 23:43:52,126 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-02-20 23:43:52,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:52,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:52,127 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:43:52,127 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:43:52,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 43 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:52,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2022-02-20 23:43:52,128 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 6 [2022-02-20 23:43:52,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:43:52,129 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2022-02-20 23:43:52,129 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:52,129 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-02-20 23:43:52,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 23:43:52,129 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:43:52,129 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 23:43:52,130 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 23:43:52,130 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2022-02-20 23:43:52,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:43:52,130 INFO L85 PathProgramCache]: Analyzing trace with hash 889446313, now seen corresponding path program 1 times [2022-02-20 23:43:52,130 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:43:52,131 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519412892] [2022-02-20 23:43:52,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:52,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:43:52,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:52,209 INFO L290 TraceCheckUtils]: 0: Hoare triple {628#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);~a~0.base, ~a~0.offset := 0, 0;~b~0.base, ~b~0.offset := 0, 0;~n~0 := 0; {628#true} is VALID [2022-02-20 23:43:52,210 INFO L290 TraceCheckUtils]: 1: Hoare triple {628#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~post7#1.base, main_#t~post7#1.offset, main_#t~mem8#1;~n~0 := 32768;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~a~0.base, ~a~0.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~b~0.base, ~b~0.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_#t~post7#1.base, main_#t~post7#1.offset := ~b~0.base, ~b~0.offset;~b~0.base, ~b~0.offset := main_#t~post7#1.base, 4 + main_#t~post7#1.offset; {630#(and (= ~a~0.offset 0) (= (* ~n~0 4) (select |#length| ~a~0.base)) (<= 32768 ~n~0))} is VALID [2022-02-20 23:43:52,210 INFO L290 TraceCheckUtils]: 2: Hoare triple {630#(and (= ~a~0.offset 0) (= (* ~n~0 4) (select |#length| ~a~0.base)) (<= 32768 ~n~0))} SUMMARY for call write~int(0, main_#t~post7#1.base, main_#t~post7#1.offset, 4); srcloc: L538 {630#(and (= ~a~0.offset 0) (= (* ~n~0 4) (select |#length| ~a~0.base)) (<= 32768 ~n~0))} is VALID [2022-02-20 23:43:52,211 INFO L290 TraceCheckUtils]: 3: Hoare triple {630#(and (= ~a~0.offset 0) (= (* ~n~0 4) (select |#length| ~a~0.base)) (<= 32768 ~n~0))} havoc main_#t~post7#1.base, main_#t~post7#1.offset;assume { :begin_inline_foo } true;havoc foo_#t~post3#1, foo_#t~post4#1, foo_~i~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {631#(and (= ~a~0.offset 0) (= |ULTIMATE.start_foo_~i~0#1| 0) (= (* ~n~0 4) (select |#length| ~a~0.base)) (<= 32768 ~n~0))} is VALID [2022-02-20 23:43:52,211 INFO L290 TraceCheckUtils]: 4: Hoare triple {631#(and (= ~a~0.offset 0) (= |ULTIMATE.start_foo_~i~0#1| 0) (= (* ~n~0 4) (select |#length| ~a~0.base)) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {632#(and (<= 131072 (select |#length| ~a~0.base)) (= ~a~0.offset 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} is VALID [2022-02-20 23:43:52,212 INFO L290 TraceCheckUtils]: 5: Hoare triple {632#(and (<= 131072 (select |#length| ~a~0.base)) (= ~a~0.offset 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} assume !(4 + (~a~0.offset + 4 * foo_~i~0#1) <= #length[~a~0.base] && 0 <= ~a~0.offset + 4 * foo_~i~0#1); {629#false} is VALID [2022-02-20 23:43:52,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:43:52,213 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:43:52,213 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519412892] [2022-02-20 23:43:52,213 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519412892] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:43:52,213 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:43:52,213 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:43:52,213 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475404199] [2022-02-20 23:43:52,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:43:52,214 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 23:43:52,214 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:43:52,214 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:52,219 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:52,220 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:43:52,220 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:43:52,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:43:52,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:43:52,221 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:52,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:52,358 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2022-02-20 23:43:52,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:43:52,358 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 23:43:52,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:43:52,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:52,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2022-02-20 23:43:52,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:52,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2022-02-20 23:43:52,360 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 57 transitions. [2022-02-20 23:43:52,402 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:52,403 INFO L225 Difference]: With dead ends: 50 [2022-02-20 23:43:52,403 INFO L226 Difference]: Without dead ends: 50 [2022-02-20 23:43:52,403 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:43:52,404 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 58 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:43:52,404 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 43 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:43:52,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-02-20 23:43:52,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2022-02-20 23:43:52,406 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:43:52,406 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 45 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 44 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:52,406 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 45 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 44 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:52,406 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 45 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 44 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:52,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:52,407 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2022-02-20 23:43:52,408 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2022-02-20 23:43:52,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:52,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:52,408 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 44 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 50 states. [2022-02-20 23:43:52,408 INFO L87 Difference]: Start difference. First operand has 45 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 44 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 50 states. [2022-02-20 23:43:52,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:52,409 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2022-02-20 23:43:52,410 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2022-02-20 23:43:52,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:52,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:52,410 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:43:52,410 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:43:52,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 44 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:52,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2022-02-20 23:43:52,411 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 6 [2022-02-20 23:43:52,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:43:52,411 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2022-02-20 23:43:52,411 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:52,412 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2022-02-20 23:43:52,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 23:43:52,412 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:43:52,412 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:43:52,412 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 23:43:52,412 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2022-02-20 23:43:52,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:43:52,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1841820687, now seen corresponding path program 1 times [2022-02-20 23:43:52,413 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:43:52,413 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520619599] [2022-02-20 23:43:52,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:52,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:43:52,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:52,499 INFO L290 TraceCheckUtils]: 0: Hoare triple {830#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);~a~0.base, ~a~0.offset := 0, 0;~b~0.base, ~b~0.offset := 0, 0;~n~0 := 0; {830#true} is VALID [2022-02-20 23:43:52,500 INFO L290 TraceCheckUtils]: 1: Hoare triple {830#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~post7#1.base, main_#t~post7#1.offset, main_#t~mem8#1;~n~0 := 32768;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~a~0.base, ~a~0.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~b~0.base, ~b~0.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_#t~post7#1.base, main_#t~post7#1.offset := ~b~0.base, ~b~0.offset;~b~0.base, ~b~0.offset := main_#t~post7#1.base, 4 + main_#t~post7#1.offset; {832#(and (<= 131072 (select |#length| ~a~0.base)) (= ~a~0.offset 0) (not (= ~a~0.base |ULTIMATE.start_main_#t~post7#1.base|)))} is VALID [2022-02-20 23:43:52,501 INFO L290 TraceCheckUtils]: 2: Hoare triple {832#(and (<= 131072 (select |#length| ~a~0.base)) (= ~a~0.offset 0) (not (= ~a~0.base |ULTIMATE.start_main_#t~post7#1.base|)))} SUMMARY for call write~int(0, main_#t~post7#1.base, main_#t~post7#1.offset, 4); srcloc: L538 {833#(and (<= 131072 (select |#length| ~a~0.base)) (= ~a~0.offset 0))} is VALID [2022-02-20 23:43:52,501 INFO L290 TraceCheckUtils]: 3: Hoare triple {833#(and (<= 131072 (select |#length| ~a~0.base)) (= ~a~0.offset 0))} havoc main_#t~post7#1.base, main_#t~post7#1.offset;assume { :begin_inline_foo } true;havoc foo_#t~post3#1, foo_#t~post4#1, foo_~i~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {834#(and (<= 131072 (select |#length| ~a~0.base)) (= ~a~0.offset 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} is VALID [2022-02-20 23:43:52,502 INFO L290 TraceCheckUtils]: 4: Hoare triple {834#(and (<= 131072 (select |#length| ~a~0.base)) (= ~a~0.offset 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} assume !!(foo_~i~0#1 < ~n~0); {834#(and (<= 131072 (select |#length| ~a~0.base)) (= ~a~0.offset 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} is VALID [2022-02-20 23:43:52,502 INFO L290 TraceCheckUtils]: 5: Hoare triple {834#(and (<= 131072 (select |#length| ~a~0.base)) (= ~a~0.offset 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {834#(and (<= 131072 (select |#length| ~a~0.base)) (= ~a~0.offset 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} is VALID [2022-02-20 23:43:52,503 INFO L290 TraceCheckUtils]: 6: Hoare triple {834#(and (<= 131072 (select |#length| ~a~0.base)) (= ~a~0.offset 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {835#(and (= ~a~0.offset 0) (<= (+ 131068 (* |ULTIMATE.start_foo_~i~0#1| 4)) (select |#length| ~a~0.base)) (<= 1 |ULTIMATE.start_foo_~i~0#1|))} is VALID [2022-02-20 23:43:52,503 INFO L290 TraceCheckUtils]: 7: Hoare triple {835#(and (= ~a~0.offset 0) (<= (+ 131068 (* |ULTIMATE.start_foo_~i~0#1| 4)) (select |#length| ~a~0.base)) (<= 1 |ULTIMATE.start_foo_~i~0#1|))} assume !!(foo_~i~0#1 < ~n~0); {835#(and (= ~a~0.offset 0) (<= (+ 131068 (* |ULTIMATE.start_foo_~i~0#1| 4)) (select |#length| ~a~0.base)) (<= 1 |ULTIMATE.start_foo_~i~0#1|))} is VALID [2022-02-20 23:43:52,504 INFO L290 TraceCheckUtils]: 8: Hoare triple {835#(and (= ~a~0.offset 0) (<= (+ 131068 (* |ULTIMATE.start_foo_~i~0#1| 4)) (select |#length| ~a~0.base)) (<= 1 |ULTIMATE.start_foo_~i~0#1|))} assume !(4 + (~a~0.offset + 4 * foo_~i~0#1) <= #length[~a~0.base] && 0 <= ~a~0.offset + 4 * foo_~i~0#1); {831#false} is VALID [2022-02-20 23:43:52,504 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:43:52,505 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:43:52,505 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520619599] [2022-02-20 23:43:52,505 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520619599] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:43:52,505 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997082324] [2022-02-20 23:43:52,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:52,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:43:52,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:43:52,507 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-02-20 23:43:52,535 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-02-20 23:43:52,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:52,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-20 23:43:52,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:52,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:43:52,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:43:52,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-02-20 23:43:52,761 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-02-20 23:43:52,873 INFO L290 TraceCheckUtils]: 0: Hoare triple {830#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);~a~0.base, ~a~0.offset := 0, 0;~b~0.base, ~b~0.offset := 0, 0;~n~0 := 0; {830#true} is VALID [2022-02-20 23:43:52,874 INFO L290 TraceCheckUtils]: 1: Hoare triple {830#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~post7#1.base, main_#t~post7#1.offset, main_#t~mem8#1;~n~0 := 32768;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~a~0.base, ~a~0.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~b~0.base, ~b~0.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_#t~post7#1.base, main_#t~post7#1.offset := ~b~0.base, ~b~0.offset;~b~0.base, ~b~0.offset := main_#t~post7#1.base, 4 + main_#t~post7#1.offset; {833#(and (<= 131072 (select |#length| ~a~0.base)) (= ~a~0.offset 0))} is VALID [2022-02-20 23:43:52,875 INFO L290 TraceCheckUtils]: 2: Hoare triple {833#(and (<= 131072 (select |#length| ~a~0.base)) (= ~a~0.offset 0))} SUMMARY for call write~int(0, main_#t~post7#1.base, main_#t~post7#1.offset, 4); srcloc: L538 {833#(and (<= 131072 (select |#length| ~a~0.base)) (= ~a~0.offset 0))} is VALID [2022-02-20 23:43:52,875 INFO L290 TraceCheckUtils]: 3: Hoare triple {833#(and (<= 131072 (select |#length| ~a~0.base)) (= ~a~0.offset 0))} havoc main_#t~post7#1.base, main_#t~post7#1.offset;assume { :begin_inline_foo } true;havoc foo_#t~post3#1, foo_#t~post4#1, foo_~i~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {834#(and (<= 131072 (select |#length| ~a~0.base)) (= ~a~0.offset 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} is VALID [2022-02-20 23:43:52,876 INFO L290 TraceCheckUtils]: 4: Hoare triple {834#(and (<= 131072 (select |#length| ~a~0.base)) (= ~a~0.offset 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} assume !!(foo_~i~0#1 < ~n~0); {834#(and (<= 131072 (select |#length| ~a~0.base)) (= ~a~0.offset 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} is VALID [2022-02-20 23:43:52,876 INFO L290 TraceCheckUtils]: 5: Hoare triple {834#(and (<= 131072 (select |#length| ~a~0.base)) (= ~a~0.offset 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {834#(and (<= 131072 (select |#length| ~a~0.base)) (= ~a~0.offset 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} is VALID [2022-02-20 23:43:52,877 INFO L290 TraceCheckUtils]: 6: Hoare triple {834#(and (<= 131072 (select |#length| ~a~0.base)) (= ~a~0.offset 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {857#(and (= (+ (- 1) |ULTIMATE.start_foo_~i~0#1|) 0) (<= 131072 (select |#length| ~a~0.base)) (= ~a~0.offset 0))} is VALID [2022-02-20 23:43:52,877 INFO L290 TraceCheckUtils]: 7: Hoare triple {857#(and (= (+ (- 1) |ULTIMATE.start_foo_~i~0#1|) 0) (<= 131072 (select |#length| ~a~0.base)) (= ~a~0.offset 0))} assume !!(foo_~i~0#1 < ~n~0); {857#(and (= (+ (- 1) |ULTIMATE.start_foo_~i~0#1|) 0) (<= 131072 (select |#length| ~a~0.base)) (= ~a~0.offset 0))} is VALID [2022-02-20 23:43:52,878 INFO L290 TraceCheckUtils]: 8: Hoare triple {857#(and (= (+ (- 1) |ULTIMATE.start_foo_~i~0#1|) 0) (<= 131072 (select |#length| ~a~0.base)) (= ~a~0.offset 0))} assume !(4 + (~a~0.offset + 4 * foo_~i~0#1) <= #length[~a~0.base] && 0 <= ~a~0.offset + 4 * foo_~i~0#1); {831#false} is VALID [2022-02-20 23:43:52,878 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:43:52,878 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:43:53,201 INFO L290 TraceCheckUtils]: 8: Hoare triple {864#(and (<= (+ ~a~0.offset 4 (* |ULTIMATE.start_foo_~i~0#1| 4)) (select |#length| ~a~0.base)) (<= 0 (+ ~a~0.offset (* |ULTIMATE.start_foo_~i~0#1| 4))))} assume !(4 + (~a~0.offset + 4 * foo_~i~0#1) <= #length[~a~0.base] && 0 <= ~a~0.offset + 4 * foo_~i~0#1); {831#false} is VALID [2022-02-20 23:43:53,201 INFO L290 TraceCheckUtils]: 7: Hoare triple {864#(and (<= (+ ~a~0.offset 4 (* |ULTIMATE.start_foo_~i~0#1| 4)) (select |#length| ~a~0.base)) (<= 0 (+ ~a~0.offset (* |ULTIMATE.start_foo_~i~0#1| 4))))} assume !!(foo_~i~0#1 < ~n~0); {864#(and (<= (+ ~a~0.offset 4 (* |ULTIMATE.start_foo_~i~0#1| 4)) (select |#length| ~a~0.base)) (<= 0 (+ ~a~0.offset (* |ULTIMATE.start_foo_~i~0#1| 4))))} is VALID [2022-02-20 23:43:53,202 INFO L290 TraceCheckUtils]: 6: Hoare triple {871#(and (<= (+ ~a~0.offset 8 (* |ULTIMATE.start_foo_~i~0#1| 4)) (select |#length| ~a~0.base)) (<= 0 (+ ~a~0.offset 4 (* |ULTIMATE.start_foo_~i~0#1| 4))))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {864#(and (<= (+ ~a~0.offset 4 (* |ULTIMATE.start_foo_~i~0#1| 4)) (select |#length| ~a~0.base)) (<= 0 (+ ~a~0.offset (* |ULTIMATE.start_foo_~i~0#1| 4))))} is VALID [2022-02-20 23:43:53,203 INFO L290 TraceCheckUtils]: 5: Hoare triple {871#(and (<= (+ ~a~0.offset 8 (* |ULTIMATE.start_foo_~i~0#1| 4)) (select |#length| ~a~0.base)) (<= 0 (+ ~a~0.offset 4 (* |ULTIMATE.start_foo_~i~0#1| 4))))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {871#(and (<= (+ ~a~0.offset 8 (* |ULTIMATE.start_foo_~i~0#1| 4)) (select |#length| ~a~0.base)) (<= 0 (+ ~a~0.offset 4 (* |ULTIMATE.start_foo_~i~0#1| 4))))} is VALID [2022-02-20 23:43:53,203 INFO L290 TraceCheckUtils]: 4: Hoare triple {871#(and (<= (+ ~a~0.offset 8 (* |ULTIMATE.start_foo_~i~0#1| 4)) (select |#length| ~a~0.base)) (<= 0 (+ ~a~0.offset 4 (* |ULTIMATE.start_foo_~i~0#1| 4))))} assume !!(foo_~i~0#1 < ~n~0); {871#(and (<= (+ ~a~0.offset 8 (* |ULTIMATE.start_foo_~i~0#1| 4)) (select |#length| ~a~0.base)) (<= 0 (+ ~a~0.offset 4 (* |ULTIMATE.start_foo_~i~0#1| 4))))} is VALID [2022-02-20 23:43:53,204 INFO L290 TraceCheckUtils]: 3: Hoare triple {881#(and (<= (+ ~a~0.offset 8) (select |#length| ~a~0.base)) (<= 0 (+ ~a~0.offset 4)))} havoc main_#t~post7#1.base, main_#t~post7#1.offset;assume { :begin_inline_foo } true;havoc foo_#t~post3#1, foo_#t~post4#1, foo_~i~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {871#(and (<= (+ ~a~0.offset 8 (* |ULTIMATE.start_foo_~i~0#1| 4)) (select |#length| ~a~0.base)) (<= 0 (+ ~a~0.offset 4 (* |ULTIMATE.start_foo_~i~0#1| 4))))} is VALID [2022-02-20 23:43:53,204 INFO L290 TraceCheckUtils]: 2: Hoare triple {881#(and (<= (+ ~a~0.offset 8) (select |#length| ~a~0.base)) (<= 0 (+ ~a~0.offset 4)))} SUMMARY for call write~int(0, main_#t~post7#1.base, main_#t~post7#1.offset, 4); srcloc: L538 {881#(and (<= (+ ~a~0.offset 8) (select |#length| ~a~0.base)) (<= 0 (+ ~a~0.offset 4)))} is VALID [2022-02-20 23:43:53,205 INFO L290 TraceCheckUtils]: 1: Hoare triple {830#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~post7#1.base, main_#t~post7#1.offset, main_#t~mem8#1;~n~0 := 32768;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~a~0.base, ~a~0.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~b~0.base, ~b~0.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_#t~post7#1.base, main_#t~post7#1.offset := ~b~0.base, ~b~0.offset;~b~0.base, ~b~0.offset := main_#t~post7#1.base, 4 + main_#t~post7#1.offset; {881#(and (<= (+ ~a~0.offset 8) (select |#length| ~a~0.base)) (<= 0 (+ ~a~0.offset 4)))} is VALID [2022-02-20 23:43:53,205 INFO L290 TraceCheckUtils]: 0: Hoare triple {830#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);~a~0.base, ~a~0.offset := 0, 0;~b~0.base, ~b~0.offset := 0, 0;~n~0 := 0; {830#true} is VALID [2022-02-20 23:43:53,206 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:43:53,206 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997082324] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:43:53,206 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:43:53,206 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2022-02-20 23:43:53,206 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965972775] [2022-02-20 23:43:53,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:43:53,207 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 23:43:53,207 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:43:53,207 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:53,222 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:53,222 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 23:43:53,222 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:43:53,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 23:43:53,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:43:53,223 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:53,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:53,620 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2022-02-20 23:43:53,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:43:53,620 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 23:43:53,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:43:53,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:53,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 105 transitions. [2022-02-20 23:43:53,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:53,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 105 transitions. [2022-02-20 23:43:53,623 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 105 transitions. [2022-02-20 23:43:53,712 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:53,714 INFO L225 Difference]: With dead ends: 95 [2022-02-20 23:43:53,714 INFO L226 Difference]: Without dead ends: 95 [2022-02-20 23:43:53,714 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2022-02-20 23:43:53,715 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 281 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:43:53,715 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [281 Valid, 101 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:43:53,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-02-20 23:43:53,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 57. [2022-02-20 23:43:53,718 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:43:53,718 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand has 57 states, 43 states have (on average 1.4883720930232558) internal successors, (64), 56 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:53,718 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand has 57 states, 43 states have (on average 1.4883720930232558) internal successors, (64), 56 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:53,719 INFO L87 Difference]: Start difference. First operand 95 states. Second operand has 57 states, 43 states have (on average 1.4883720930232558) internal successors, (64), 56 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:53,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:53,721 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2022-02-20 23:43:53,721 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2022-02-20 23:43:53,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:53,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:53,721 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 43 states have (on average 1.4883720930232558) internal successors, (64), 56 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 95 states. [2022-02-20 23:43:53,721 INFO L87 Difference]: Start difference. First operand has 57 states, 43 states have (on average 1.4883720930232558) internal successors, (64), 56 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 95 states. [2022-02-20 23:43:53,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:53,725 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2022-02-20 23:43:53,725 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2022-02-20 23:43:53,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:53,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:53,725 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:43:53,725 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:43:53,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 43 states have (on average 1.4883720930232558) internal successors, (64), 56 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:53,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2022-02-20 23:43:53,727 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 9 [2022-02-20 23:43:53,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:43:53,727 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2022-02-20 23:43:53,728 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:53,728 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2022-02-20 23:43:53,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 23:43:53,728 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:43:53,728 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:43:53,750 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-02-20 23:43:53,947 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:43:53,948 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2022-02-20 23:43:53,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:43:53,948 INFO L85 PathProgramCache]: Analyzing trace with hash 463101433, now seen corresponding path program 1 times [2022-02-20 23:43:53,948 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:43:53,948 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610980600] [2022-02-20 23:43:53,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:53,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:43:53,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:53,986 INFO L290 TraceCheckUtils]: 0: Hoare triple {1236#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);~a~0.base, ~a~0.offset := 0, 0;~b~0.base, ~b~0.offset := 0, 0;~n~0 := 0; {1236#true} is VALID [2022-02-20 23:43:53,987 INFO L290 TraceCheckUtils]: 1: Hoare triple {1236#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~post7#1.base, main_#t~post7#1.offset, main_#t~mem8#1;~n~0 := 32768;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~a~0.base, ~a~0.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~b~0.base, ~b~0.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_#t~post7#1.base, main_#t~post7#1.offset := ~b~0.base, ~b~0.offset;~b~0.base, ~b~0.offset := main_#t~post7#1.base, 4 + main_#t~post7#1.offset; {1238#(= (select |#valid| |ULTIMATE.start_main_#t~post7#1.base|) (select |#valid| ~b~0.base))} is VALID [2022-02-20 23:43:53,987 INFO L290 TraceCheckUtils]: 2: Hoare triple {1238#(= (select |#valid| |ULTIMATE.start_main_#t~post7#1.base|) (select |#valid| ~b~0.base))} SUMMARY for call write~int(0, main_#t~post7#1.base, main_#t~post7#1.offset, 4); srcloc: L538 {1239#(= (select |#valid| ~b~0.base) 1)} is VALID [2022-02-20 23:43:53,987 INFO L290 TraceCheckUtils]: 3: Hoare triple {1239#(= (select |#valid| ~b~0.base) 1)} havoc main_#t~post7#1.base, main_#t~post7#1.offset;assume { :begin_inline_foo } true;havoc foo_#t~post3#1, foo_#t~post4#1, foo_~i~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {1239#(= (select |#valid| ~b~0.base) 1)} is VALID [2022-02-20 23:43:53,988 INFO L290 TraceCheckUtils]: 4: Hoare triple {1239#(= (select |#valid| ~b~0.base) 1)} assume !!(foo_~i~0#1 < ~n~0); {1239#(= (select |#valid| ~b~0.base) 1)} is VALID [2022-02-20 23:43:53,988 INFO L290 TraceCheckUtils]: 5: Hoare triple {1239#(= (select |#valid| ~b~0.base) 1)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {1239#(= (select |#valid| ~b~0.base) 1)} is VALID [2022-02-20 23:43:53,988 INFO L290 TraceCheckUtils]: 6: Hoare triple {1239#(= (select |#valid| ~b~0.base) 1)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {1239#(= (select |#valid| ~b~0.base) 1)} is VALID [2022-02-20 23:43:53,989 INFO L290 TraceCheckUtils]: 7: Hoare triple {1239#(= (select |#valid| ~b~0.base) 1)} assume !(foo_~i~0#1 < ~n~0); {1239#(= (select |#valid| ~b~0.base) 1)} is VALID [2022-02-20 23:43:53,989 INFO L290 TraceCheckUtils]: 8: Hoare triple {1239#(= (select |#valid| ~b~0.base) 1)} foo_~i~0#1 := 0; {1239#(= (select |#valid| ~b~0.base) 1)} is VALID [2022-02-20 23:43:53,989 INFO L290 TraceCheckUtils]: 9: Hoare triple {1239#(= (select |#valid| ~b~0.base) 1)} assume !!(foo_~i~0#1 < 32767); {1239#(= (select |#valid| ~b~0.base) 1)} is VALID [2022-02-20 23:43:53,990 INFO L290 TraceCheckUtils]: 10: Hoare triple {1239#(= (select |#valid| ~b~0.base) 1)} assume !(1 == #valid[~b~0.base]); {1237#false} is VALID [2022-02-20 23:43:53,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:43:53,990 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:43:53,990 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610980600] [2022-02-20 23:43:53,990 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610980600] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:43:53,990 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:43:53,991 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:43:53,991 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142401355] [2022-02-20 23:43:53,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:43:53,991 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 23:43:53,991 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:43:53,991 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:53,998 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:53,998 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:43:53,998 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:43:53,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:43:53,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:43:53,999 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:54,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:54,063 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2022-02-20 23:43:54,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:43:54,063 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 23:43:54,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:43:54,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:54,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-02-20 23:43:54,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:54,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-02-20 23:43:54,065 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 44 transitions. [2022-02-20 23:43:54,092 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:54,092 INFO L225 Difference]: With dead ends: 55 [2022-02-20 23:43:54,092 INFO L226 Difference]: Without dead ends: 55 [2022-02-20 23:43:54,093 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-02-20 23:43:54,093 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 17 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:43:54,094 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 61 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:43:54,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-02-20 23:43:54,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-02-20 23:43:54,095 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:43:54,096 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 55 states, 43 states have (on average 1.4186046511627908) internal successors, (61), 54 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:54,096 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 55 states, 43 states have (on average 1.4186046511627908) internal successors, (61), 54 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:54,096 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 55 states, 43 states have (on average 1.4186046511627908) internal successors, (61), 54 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:54,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:54,097 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2022-02-20 23:43:54,097 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2022-02-20 23:43:54,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:54,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:54,098 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 43 states have (on average 1.4186046511627908) internal successors, (61), 54 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 55 states. [2022-02-20 23:43:54,098 INFO L87 Difference]: Start difference. First operand has 55 states, 43 states have (on average 1.4186046511627908) internal successors, (61), 54 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 55 states. [2022-02-20 23:43:54,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:54,099 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2022-02-20 23:43:54,099 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2022-02-20 23:43:54,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:54,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:54,100 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:43:54,100 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:43:54,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 43 states have (on average 1.4186046511627908) internal successors, (61), 54 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:54,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2022-02-20 23:43:54,101 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 11 [2022-02-20 23:43:54,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:43:54,101 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2022-02-20 23:43:54,101 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:54,101 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2022-02-20 23:43:54,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 23:43:54,102 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:43:54,102 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:43:54,102 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 23:43:54,102 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2022-02-20 23:43:54,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:43:54,102 INFO L85 PathProgramCache]: Analyzing trace with hash 463101434, now seen corresponding path program 1 times [2022-02-20 23:43:54,102 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:43:54,103 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119110314] [2022-02-20 23:43:54,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:54,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:43:54,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:54,147 INFO L290 TraceCheckUtils]: 0: Hoare triple {1464#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);~a~0.base, ~a~0.offset := 0, 0;~b~0.base, ~b~0.offset := 0, 0;~n~0 := 0; {1464#true} is VALID [2022-02-20 23:43:54,148 INFO L290 TraceCheckUtils]: 1: Hoare triple {1464#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~post7#1.base, main_#t~post7#1.offset, main_#t~mem8#1;~n~0 := 32768;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~a~0.base, ~a~0.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~b~0.base, ~b~0.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_#t~post7#1.base, main_#t~post7#1.offset := ~b~0.base, ~b~0.offset;~b~0.base, ~b~0.offset := main_#t~post7#1.base, 4 + main_#t~post7#1.offset; {1466#(<= 32768 ~n~0)} is VALID [2022-02-20 23:43:54,149 INFO L290 TraceCheckUtils]: 2: Hoare triple {1466#(<= 32768 ~n~0)} SUMMARY for call write~int(0, main_#t~post7#1.base, main_#t~post7#1.offset, 4); srcloc: L538 {1466#(<= 32768 ~n~0)} is VALID [2022-02-20 23:43:54,149 INFO L290 TraceCheckUtils]: 3: Hoare triple {1466#(<= 32768 ~n~0)} havoc main_#t~post7#1.base, main_#t~post7#1.offset;assume { :begin_inline_foo } true;havoc foo_#t~post3#1, foo_#t~post4#1, foo_~i~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {1467#(and (= |ULTIMATE.start_foo_~i~0#1| 0) (<= 32768 ~n~0))} is VALID [2022-02-20 23:43:54,149 INFO L290 TraceCheckUtils]: 4: Hoare triple {1467#(and (= |ULTIMATE.start_foo_~i~0#1| 0) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {1467#(and (= |ULTIMATE.start_foo_~i~0#1| 0) (<= 32768 ~n~0))} is VALID [2022-02-20 23:43:54,150 INFO L290 TraceCheckUtils]: 5: Hoare triple {1467#(and (= |ULTIMATE.start_foo_~i~0#1| 0) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {1467#(and (= |ULTIMATE.start_foo_~i~0#1| 0) (<= 32768 ~n~0))} is VALID [2022-02-20 23:43:54,150 INFO L290 TraceCheckUtils]: 6: Hoare triple {1467#(and (= |ULTIMATE.start_foo_~i~0#1| 0) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {1468#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32767) ~n~0)} is VALID [2022-02-20 23:43:54,151 INFO L290 TraceCheckUtils]: 7: Hoare triple {1468#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32767) ~n~0)} assume !(foo_~i~0#1 < ~n~0); {1465#false} is VALID [2022-02-20 23:43:54,151 INFO L290 TraceCheckUtils]: 8: Hoare triple {1465#false} foo_~i~0#1 := 0; {1465#false} is VALID [2022-02-20 23:43:54,151 INFO L290 TraceCheckUtils]: 9: Hoare triple {1465#false} assume !!(foo_~i~0#1 < 32767); {1465#false} is VALID [2022-02-20 23:43:54,151 INFO L290 TraceCheckUtils]: 10: Hoare triple {1465#false} assume !(4 + (~b~0.offset + 4 * foo_~i~0#1) <= #length[~b~0.base] && 0 <= ~b~0.offset + 4 * foo_~i~0#1); {1465#false} is VALID [2022-02-20 23:43:54,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:43:54,151 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:43:54,151 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119110314] [2022-02-20 23:43:54,151 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119110314] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:43:54,151 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135701954] [2022-02-20 23:43:54,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:54,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:43:54,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:43:54,152 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-02-20 23:43:54,154 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-02-20 23:43:54,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:54,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:43:54,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:54,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:43:54,281 INFO L290 TraceCheckUtils]: 0: Hoare triple {1464#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);~a~0.base, ~a~0.offset := 0, 0;~b~0.base, ~b~0.offset := 0, 0;~n~0 := 0; {1464#true} is VALID [2022-02-20 23:43:54,282 INFO L290 TraceCheckUtils]: 1: Hoare triple {1464#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~post7#1.base, main_#t~post7#1.offset, main_#t~mem8#1;~n~0 := 32768;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~a~0.base, ~a~0.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~b~0.base, ~b~0.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_#t~post7#1.base, main_#t~post7#1.offset := ~b~0.base, ~b~0.offset;~b~0.base, ~b~0.offset := main_#t~post7#1.base, 4 + main_#t~post7#1.offset; {1466#(<= 32768 ~n~0)} is VALID [2022-02-20 23:43:54,282 INFO L290 TraceCheckUtils]: 2: Hoare triple {1466#(<= 32768 ~n~0)} SUMMARY for call write~int(0, main_#t~post7#1.base, main_#t~post7#1.offset, 4); srcloc: L538 {1466#(<= 32768 ~n~0)} is VALID [2022-02-20 23:43:54,283 INFO L290 TraceCheckUtils]: 3: Hoare triple {1466#(<= 32768 ~n~0)} havoc main_#t~post7#1.base, main_#t~post7#1.offset;assume { :begin_inline_foo } true;havoc foo_#t~post3#1, foo_#t~post4#1, foo_~i~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {1481#(and (<= |ULTIMATE.start_foo_~i~0#1| 0) (<= 32768 ~n~0))} is VALID [2022-02-20 23:43:54,283 INFO L290 TraceCheckUtils]: 4: Hoare triple {1481#(and (<= |ULTIMATE.start_foo_~i~0#1| 0) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {1481#(and (<= |ULTIMATE.start_foo_~i~0#1| 0) (<= 32768 ~n~0))} is VALID [2022-02-20 23:43:54,284 INFO L290 TraceCheckUtils]: 5: Hoare triple {1481#(and (<= |ULTIMATE.start_foo_~i~0#1| 0) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {1481#(and (<= |ULTIMATE.start_foo_~i~0#1| 0) (<= 32768 ~n~0))} is VALID [2022-02-20 23:43:54,284 INFO L290 TraceCheckUtils]: 6: Hoare triple {1481#(and (<= |ULTIMATE.start_foo_~i~0#1| 0) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {1491#(and (<= |ULTIMATE.start_foo_~i~0#1| 1) (<= 32768 ~n~0))} is VALID [2022-02-20 23:43:54,285 INFO L290 TraceCheckUtils]: 7: Hoare triple {1491#(and (<= |ULTIMATE.start_foo_~i~0#1| 1) (<= 32768 ~n~0))} assume !(foo_~i~0#1 < ~n~0); {1465#false} is VALID [2022-02-20 23:43:54,285 INFO L290 TraceCheckUtils]: 8: Hoare triple {1465#false} foo_~i~0#1 := 0; {1465#false} is VALID [2022-02-20 23:43:54,285 INFO L290 TraceCheckUtils]: 9: Hoare triple {1465#false} assume !!(foo_~i~0#1 < 32767); {1465#false} is VALID [2022-02-20 23:43:54,285 INFO L290 TraceCheckUtils]: 10: Hoare triple {1465#false} assume !(4 + (~b~0.offset + 4 * foo_~i~0#1) <= #length[~b~0.base] && 0 <= ~b~0.offset + 4 * foo_~i~0#1); {1465#false} is VALID [2022-02-20 23:43:54,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:43:54,285 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:43:54,345 INFO L290 TraceCheckUtils]: 10: Hoare triple {1465#false} assume !(4 + (~b~0.offset + 4 * foo_~i~0#1) <= #length[~b~0.base] && 0 <= ~b~0.offset + 4 * foo_~i~0#1); {1465#false} is VALID [2022-02-20 23:43:54,346 INFO L290 TraceCheckUtils]: 9: Hoare triple {1465#false} assume !!(foo_~i~0#1 < 32767); {1465#false} is VALID [2022-02-20 23:43:54,346 INFO L290 TraceCheckUtils]: 8: Hoare triple {1465#false} foo_~i~0#1 := 0; {1465#false} is VALID [2022-02-20 23:43:54,346 INFO L290 TraceCheckUtils]: 7: Hoare triple {1513#(< |ULTIMATE.start_foo_~i~0#1| ~n~0)} assume !(foo_~i~0#1 < ~n~0); {1465#false} is VALID [2022-02-20 23:43:54,347 INFO L290 TraceCheckUtils]: 6: Hoare triple {1517#(< (+ |ULTIMATE.start_foo_~i~0#1| 1) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {1513#(< |ULTIMATE.start_foo_~i~0#1| ~n~0)} is VALID [2022-02-20 23:43:54,347 INFO L290 TraceCheckUtils]: 5: Hoare triple {1517#(< (+ |ULTIMATE.start_foo_~i~0#1| 1) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {1517#(< (+ |ULTIMATE.start_foo_~i~0#1| 1) ~n~0)} is VALID [2022-02-20 23:43:54,348 INFO L290 TraceCheckUtils]: 4: Hoare triple {1517#(< (+ |ULTIMATE.start_foo_~i~0#1| 1) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {1517#(< (+ |ULTIMATE.start_foo_~i~0#1| 1) ~n~0)} is VALID [2022-02-20 23:43:54,348 INFO L290 TraceCheckUtils]: 3: Hoare triple {1527#(< 1 ~n~0)} havoc main_#t~post7#1.base, main_#t~post7#1.offset;assume { :begin_inline_foo } true;havoc foo_#t~post3#1, foo_#t~post4#1, foo_~i~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {1517#(< (+ |ULTIMATE.start_foo_~i~0#1| 1) ~n~0)} is VALID [2022-02-20 23:43:54,348 INFO L290 TraceCheckUtils]: 2: Hoare triple {1527#(< 1 ~n~0)} SUMMARY for call write~int(0, main_#t~post7#1.base, main_#t~post7#1.offset, 4); srcloc: L538 {1527#(< 1 ~n~0)} is VALID [2022-02-20 23:43:54,349 INFO L290 TraceCheckUtils]: 1: Hoare triple {1464#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~post7#1.base, main_#t~post7#1.offset, main_#t~mem8#1;~n~0 := 32768;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~a~0.base, ~a~0.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~b~0.base, ~b~0.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_#t~post7#1.base, main_#t~post7#1.offset := ~b~0.base, ~b~0.offset;~b~0.base, ~b~0.offset := main_#t~post7#1.base, 4 + main_#t~post7#1.offset; {1527#(< 1 ~n~0)} is VALID [2022-02-20 23:43:54,349 INFO L290 TraceCheckUtils]: 0: Hoare triple {1464#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);~a~0.base, ~a~0.offset := 0, 0;~b~0.base, ~b~0.offset := 0, 0;~n~0 := 0; {1464#true} is VALID [2022-02-20 23:43:54,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:43:54,349 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1135701954] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:43:54,350 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:43:54,350 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-02-20 23:43:54,350 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415006824] [2022-02-20 23:43:54,350 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:43:54,350 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 23:43:54,351 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:43:54,351 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:54,365 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:54,365 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 23:43:54,365 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:43:54,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 23:43:54,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:43:54,366 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:54,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:54,554 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2022-02-20 23:43:54,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:43:54,554 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 23:43:54,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:43:54,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:54,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 92 transitions. [2022-02-20 23:43:54,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:54,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 92 transitions. [2022-02-20 23:43:54,556 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 92 transitions. [2022-02-20 23:43:54,617 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:54,617 INFO L225 Difference]: With dead ends: 87 [2022-02-20 23:43:54,618 INFO L226 Difference]: Without dead ends: 87 [2022-02-20 23:43:54,618 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2022-02-20 23:43:54,618 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 211 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:43:54,618 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [211 Valid, 117 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:43:54,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-02-20 23:43:54,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 55. [2022-02-20 23:43:54,620 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:43:54,620 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand has 55 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 54 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:54,620 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand has 55 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 54 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:54,621 INFO L87 Difference]: Start difference. First operand 87 states. Second operand has 55 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 54 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:54,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:54,622 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2022-02-20 23:43:54,622 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 90 transitions. [2022-02-20 23:43:54,622 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:54,622 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:54,622 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 54 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 87 states. [2022-02-20 23:43:54,623 INFO L87 Difference]: Start difference. First operand has 55 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 54 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 87 states. [2022-02-20 23:43:54,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:54,624 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2022-02-20 23:43:54,624 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 90 transitions. [2022-02-20 23:43:54,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:54,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:54,624 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:43:54,624 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:43:54,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 54 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:54,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2022-02-20 23:43:54,625 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 11 [2022-02-20 23:43:54,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:43:54,625 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2022-02-20 23:43:54,625 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:54,626 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2022-02-20 23:43:54,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 23:43:54,626 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:43:54,626 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1] [2022-02-20 23:43:54,645 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-02-20 23:43:54,839 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-02-20 23:43:54,839 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2022-02-20 23:43:54,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:43:54,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1941957673, now seen corresponding path program 2 times [2022-02-20 23:43:54,840 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:43:54,840 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364265711] [2022-02-20 23:43:54,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:54,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:43:54,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:55,074 INFO L290 TraceCheckUtils]: 0: Hoare triple {1856#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);~a~0.base, ~a~0.offset := 0, 0;~b~0.base, ~b~0.offset := 0, 0;~n~0 := 0; {1856#true} is VALID [2022-02-20 23:43:55,076 INFO L290 TraceCheckUtils]: 1: Hoare triple {1856#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~post7#1.base, main_#t~post7#1.offset, main_#t~mem8#1;~n~0 := 32768;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~a~0.base, ~a~0.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~b~0.base, ~b~0.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_#t~post7#1.base, main_#t~post7#1.offset := ~b~0.base, ~b~0.offset;~b~0.base, ~b~0.offset := main_#t~post7#1.base, 4 + main_#t~post7#1.offset; {1858#(and (= ~a~0.offset 0) (= (* ~n~0 4) (select |#length| ~a~0.base)) (not (= ~a~0.base |ULTIMATE.start_main_#t~post7#1.base|)) (<= 32768 ~n~0))} is VALID [2022-02-20 23:43:55,077 INFO L290 TraceCheckUtils]: 2: Hoare triple {1858#(and (= ~a~0.offset 0) (= (* ~n~0 4) (select |#length| ~a~0.base)) (not (= ~a~0.base |ULTIMATE.start_main_#t~post7#1.base|)) (<= 32768 ~n~0))} SUMMARY for call write~int(0, main_#t~post7#1.base, main_#t~post7#1.offset, 4); srcloc: L538 {1859#(and (= ~a~0.offset 0) (= (* ~n~0 4) (select |#length| ~a~0.base)) (<= 32768 ~n~0))} is VALID [2022-02-20 23:43:55,077 INFO L290 TraceCheckUtils]: 3: Hoare triple {1859#(and (= ~a~0.offset 0) (= (* ~n~0 4) (select |#length| ~a~0.base)) (<= 32768 ~n~0))} havoc main_#t~post7#1.base, main_#t~post7#1.offset;assume { :begin_inline_foo } true;havoc foo_#t~post3#1, foo_#t~post4#1, foo_~i~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {1860#(and (= ~a~0.offset 0) (= |ULTIMATE.start_foo_~i~0#1| 0) (= (* ~n~0 4) (select |#length| ~a~0.base)) (<= 32768 ~n~0))} is VALID [2022-02-20 23:43:55,078 INFO L290 TraceCheckUtils]: 4: Hoare triple {1860#(and (= ~a~0.offset 0) (= |ULTIMATE.start_foo_~i~0#1| 0) (= (* ~n~0 4) (select |#length| ~a~0.base)) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {1860#(and (= ~a~0.offset 0) (= |ULTIMATE.start_foo_~i~0#1| 0) (= (* ~n~0 4) (select |#length| ~a~0.base)) (<= 32768 ~n~0))} is VALID [2022-02-20 23:43:55,079 INFO L290 TraceCheckUtils]: 5: Hoare triple {1860#(and (= ~a~0.offset 0) (= |ULTIMATE.start_foo_~i~0#1| 0) (= (* ~n~0 4) (select |#length| ~a~0.base)) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {1860#(and (= ~a~0.offset 0) (= |ULTIMATE.start_foo_~i~0#1| 0) (= (* ~n~0 4) (select |#length| ~a~0.base)) (<= 32768 ~n~0))} is VALID [2022-02-20 23:43:55,079 INFO L290 TraceCheckUtils]: 6: Hoare triple {1860#(and (= ~a~0.offset 0) (= |ULTIMATE.start_foo_~i~0#1| 0) (= (* ~n~0 4) (select |#length| ~a~0.base)) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {1861#(and (= ~a~0.offset 0) (= (* ~n~0 4) (select |#length| ~a~0.base)) (<= (+ |ULTIMATE.start_foo_~i~0#1| 32767) ~n~0) (<= 1 |ULTIMATE.start_foo_~i~0#1|))} is VALID [2022-02-20 23:43:55,080 INFO L290 TraceCheckUtils]: 7: Hoare triple {1861#(and (= ~a~0.offset 0) (= (* ~n~0 4) (select |#length| ~a~0.base)) (<= (+ |ULTIMATE.start_foo_~i~0#1| 32767) ~n~0) (<= 1 |ULTIMATE.start_foo_~i~0#1|))} assume !!(foo_~i~0#1 < ~n~0); {1861#(and (= ~a~0.offset 0) (= (* ~n~0 4) (select |#length| ~a~0.base)) (<= (+ |ULTIMATE.start_foo_~i~0#1| 32767) ~n~0) (<= 1 |ULTIMATE.start_foo_~i~0#1|))} is VALID [2022-02-20 23:43:55,080 INFO L290 TraceCheckUtils]: 8: Hoare triple {1861#(and (= ~a~0.offset 0) (= (* ~n~0 4) (select |#length| ~a~0.base)) (<= (+ |ULTIMATE.start_foo_~i~0#1| 32767) ~n~0) (<= 1 |ULTIMATE.start_foo_~i~0#1|))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {1861#(and (= ~a~0.offset 0) (= (* ~n~0 4) (select |#length| ~a~0.base)) (<= (+ |ULTIMATE.start_foo_~i~0#1| 32767) ~n~0) (<= 1 |ULTIMATE.start_foo_~i~0#1|))} is VALID [2022-02-20 23:43:55,081 INFO L290 TraceCheckUtils]: 9: Hoare triple {1861#(and (= ~a~0.offset 0) (= (* ~n~0 4) (select |#length| ~a~0.base)) (<= (+ |ULTIMATE.start_foo_~i~0#1| 32767) ~n~0) (<= 1 |ULTIMATE.start_foo_~i~0#1|))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {1862#(and (<= (+ 32766 |ULTIMATE.start_foo_~i~0#1|) ~n~0) (= ~a~0.offset 0) (= (* ~n~0 4) (select |#length| ~a~0.base)) (<= 2 |ULTIMATE.start_foo_~i~0#1|))} is VALID [2022-02-20 23:43:55,082 INFO L290 TraceCheckUtils]: 10: Hoare triple {1862#(and (<= (+ 32766 |ULTIMATE.start_foo_~i~0#1|) ~n~0) (= ~a~0.offset 0) (= (* ~n~0 4) (select |#length| ~a~0.base)) (<= 2 |ULTIMATE.start_foo_~i~0#1|))} assume !!(foo_~i~0#1 < ~n~0); {1862#(and (<= (+ 32766 |ULTIMATE.start_foo_~i~0#1|) ~n~0) (= ~a~0.offset 0) (= (* ~n~0 4) (select |#length| ~a~0.base)) (<= 2 |ULTIMATE.start_foo_~i~0#1|))} is VALID [2022-02-20 23:43:55,082 INFO L290 TraceCheckUtils]: 11: Hoare triple {1862#(and (<= (+ 32766 |ULTIMATE.start_foo_~i~0#1|) ~n~0) (= ~a~0.offset 0) (= (* ~n~0 4) (select |#length| ~a~0.base)) (<= 2 |ULTIMATE.start_foo_~i~0#1|))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {1862#(and (<= (+ 32766 |ULTIMATE.start_foo_~i~0#1|) ~n~0) (= ~a~0.offset 0) (= (* ~n~0 4) (select |#length| ~a~0.base)) (<= 2 |ULTIMATE.start_foo_~i~0#1|))} is VALID [2022-02-20 23:43:55,083 INFO L290 TraceCheckUtils]: 12: Hoare triple {1862#(and (<= (+ 32766 |ULTIMATE.start_foo_~i~0#1|) ~n~0) (= ~a~0.offset 0) (= (* ~n~0 4) (select |#length| ~a~0.base)) (<= 2 |ULTIMATE.start_foo_~i~0#1|))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {1863#(and (<= (+ |ULTIMATE.start_foo_~i~0#1| 32765) ~n~0) (<= 3 |ULTIMATE.start_foo_~i~0#1|) (= ~a~0.offset 0) (= (* ~n~0 4) (select |#length| ~a~0.base)))} is VALID [2022-02-20 23:43:55,083 INFO L290 TraceCheckUtils]: 13: Hoare triple {1863#(and (<= (+ |ULTIMATE.start_foo_~i~0#1| 32765) ~n~0) (<= 3 |ULTIMATE.start_foo_~i~0#1|) (= ~a~0.offset 0) (= (* ~n~0 4) (select |#length| ~a~0.base)))} assume !!(foo_~i~0#1 < ~n~0); {1863#(and (<= (+ |ULTIMATE.start_foo_~i~0#1| 32765) ~n~0) (<= 3 |ULTIMATE.start_foo_~i~0#1|) (= ~a~0.offset 0) (= (* ~n~0 4) (select |#length| ~a~0.base)))} is VALID [2022-02-20 23:43:55,084 INFO L290 TraceCheckUtils]: 14: Hoare triple {1863#(and (<= (+ |ULTIMATE.start_foo_~i~0#1| 32765) ~n~0) (<= 3 |ULTIMATE.start_foo_~i~0#1|) (= ~a~0.offset 0) (= (* ~n~0 4) (select |#length| ~a~0.base)))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {1863#(and (<= (+ |ULTIMATE.start_foo_~i~0#1| 32765) ~n~0) (<= 3 |ULTIMATE.start_foo_~i~0#1|) (= ~a~0.offset 0) (= (* ~n~0 4) (select |#length| ~a~0.base)))} is VALID [2022-02-20 23:43:55,084 INFO L290 TraceCheckUtils]: 15: Hoare triple {1863#(and (<= (+ |ULTIMATE.start_foo_~i~0#1| 32765) ~n~0) (<= 3 |ULTIMATE.start_foo_~i~0#1|) (= ~a~0.offset 0) (= (* ~n~0 4) (select |#length| ~a~0.base)))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {1864#(and (<= (+ |ULTIMATE.start_foo_~i~0#1| 32764) ~n~0) (<= 4 |ULTIMATE.start_foo_~i~0#1|) (= ~a~0.offset 0) (= (* ~n~0 4) (select |#length| ~a~0.base)))} is VALID [2022-02-20 23:43:55,085 INFO L290 TraceCheckUtils]: 16: Hoare triple {1864#(and (<= (+ |ULTIMATE.start_foo_~i~0#1| 32764) ~n~0) (<= 4 |ULTIMATE.start_foo_~i~0#1|) (= ~a~0.offset 0) (= (* ~n~0 4) (select |#length| ~a~0.base)))} assume !!(foo_~i~0#1 < ~n~0); {1865#(and (<= (+ 131056 (* |ULTIMATE.start_foo_~i~0#1| 4)) (select |#length| ~a~0.base)) (<= 4 |ULTIMATE.start_foo_~i~0#1|) (= ~a~0.offset 0))} is VALID [2022-02-20 23:43:55,085 INFO L290 TraceCheckUtils]: 17: Hoare triple {1865#(and (<= (+ 131056 (* |ULTIMATE.start_foo_~i~0#1| 4)) (select |#length| ~a~0.base)) (<= 4 |ULTIMATE.start_foo_~i~0#1|) (= ~a~0.offset 0))} assume !(4 + (~a~0.offset + 4 * foo_~i~0#1) <= #length[~a~0.base] && 0 <= ~a~0.offset + 4 * foo_~i~0#1); {1857#false} is VALID [2022-02-20 23:43:55,086 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:43:55,086 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:43:55,086 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364265711] [2022-02-20 23:43:55,086 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364265711] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:43:55,086 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121364722] [2022-02-20 23:43:55,086 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 23:43:55,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:43:55,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:43:55,103 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-02-20 23:43:55,104 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-02-20 23:43:55,150 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 23:43:55,151 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 23:43:55,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 15 conjunts are in the unsatisfiable core [2022-02-20 23:43:55,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:55,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:43:55,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:43:55,209 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-02-20 23:43:55,216 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-02-20 23:43:55,466 INFO L290 TraceCheckUtils]: 0: Hoare triple {1856#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);~a~0.base, ~a~0.offset := 0, 0;~b~0.base, ~b~0.offset := 0, 0;~n~0 := 0; {1856#true} is VALID [2022-02-20 23:43:55,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {1856#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~post7#1.base, main_#t~post7#1.offset, main_#t~mem8#1;~n~0 := 32768;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~a~0.base, ~a~0.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~b~0.base, ~b~0.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_#t~post7#1.base, main_#t~post7#1.offset := ~b~0.base, ~b~0.offset;~b~0.base, ~b~0.offset := main_#t~post7#1.base, 4 + main_#t~post7#1.offset; {1872#(and (<= (* ~n~0 4) (select |#length| ~a~0.base)) (= ~a~0.offset 0))} is VALID [2022-02-20 23:43:55,467 INFO L290 TraceCheckUtils]: 2: Hoare triple {1872#(and (<= (* ~n~0 4) (select |#length| ~a~0.base)) (= ~a~0.offset 0))} SUMMARY for call write~int(0, main_#t~post7#1.base, main_#t~post7#1.offset, 4); srcloc: L538 {1872#(and (<= (* ~n~0 4) (select |#length| ~a~0.base)) (= ~a~0.offset 0))} is VALID [2022-02-20 23:43:55,468 INFO L290 TraceCheckUtils]: 3: Hoare triple {1872#(and (<= (* ~n~0 4) (select |#length| ~a~0.base)) (= ~a~0.offset 0))} havoc main_#t~post7#1.base, main_#t~post7#1.offset;assume { :begin_inline_foo } true;havoc foo_#t~post3#1, foo_#t~post4#1, foo_~i~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {1879#(and (<= (* ~n~0 4) (select |#length| ~a~0.base)) (= ~a~0.offset 0) (<= 0 |ULTIMATE.start_foo_~i~0#1|))} is VALID [2022-02-20 23:43:55,468 INFO L290 TraceCheckUtils]: 4: Hoare triple {1879#(and (<= (* ~n~0 4) (select |#length| ~a~0.base)) (= ~a~0.offset 0) (<= 0 |ULTIMATE.start_foo_~i~0#1|))} assume !!(foo_~i~0#1 < ~n~0); {1879#(and (<= (* ~n~0 4) (select |#length| ~a~0.base)) (= ~a~0.offset 0) (<= 0 |ULTIMATE.start_foo_~i~0#1|))} is VALID [2022-02-20 23:43:55,469 INFO L290 TraceCheckUtils]: 5: Hoare triple {1879#(and (<= (* ~n~0 4) (select |#length| ~a~0.base)) (= ~a~0.offset 0) (<= 0 |ULTIMATE.start_foo_~i~0#1|))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {1879#(and (<= (* ~n~0 4) (select |#length| ~a~0.base)) (= ~a~0.offset 0) (<= 0 |ULTIMATE.start_foo_~i~0#1|))} is VALID [2022-02-20 23:43:55,469 INFO L290 TraceCheckUtils]: 6: Hoare triple {1879#(and (<= (* ~n~0 4) (select |#length| ~a~0.base)) (= ~a~0.offset 0) (<= 0 |ULTIMATE.start_foo_~i~0#1|))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {1889#(and (<= (* ~n~0 4) (select |#length| ~a~0.base)) (= ~a~0.offset 0) (<= 1 |ULTIMATE.start_foo_~i~0#1|))} is VALID [2022-02-20 23:43:55,470 INFO L290 TraceCheckUtils]: 7: Hoare triple {1889#(and (<= (* ~n~0 4) (select |#length| ~a~0.base)) (= ~a~0.offset 0) (<= 1 |ULTIMATE.start_foo_~i~0#1|))} assume !!(foo_~i~0#1 < ~n~0); {1889#(and (<= (* ~n~0 4) (select |#length| ~a~0.base)) (= ~a~0.offset 0) (<= 1 |ULTIMATE.start_foo_~i~0#1|))} is VALID [2022-02-20 23:43:55,471 INFO L290 TraceCheckUtils]: 8: Hoare triple {1889#(and (<= (* ~n~0 4) (select |#length| ~a~0.base)) (= ~a~0.offset 0) (<= 1 |ULTIMATE.start_foo_~i~0#1|))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {1889#(and (<= (* ~n~0 4) (select |#length| ~a~0.base)) (= ~a~0.offset 0) (<= 1 |ULTIMATE.start_foo_~i~0#1|))} is VALID [2022-02-20 23:43:55,471 INFO L290 TraceCheckUtils]: 9: Hoare triple {1889#(and (<= (* ~n~0 4) (select |#length| ~a~0.base)) (= ~a~0.offset 0) (<= 1 |ULTIMATE.start_foo_~i~0#1|))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {1899#(and (<= (* ~n~0 4) (select |#length| ~a~0.base)) (= ~a~0.offset 0) (<= 2 |ULTIMATE.start_foo_~i~0#1|))} is VALID [2022-02-20 23:43:55,472 INFO L290 TraceCheckUtils]: 10: Hoare triple {1899#(and (<= (* ~n~0 4) (select |#length| ~a~0.base)) (= ~a~0.offset 0) (<= 2 |ULTIMATE.start_foo_~i~0#1|))} assume !!(foo_~i~0#1 < ~n~0); {1899#(and (<= (* ~n~0 4) (select |#length| ~a~0.base)) (= ~a~0.offset 0) (<= 2 |ULTIMATE.start_foo_~i~0#1|))} is VALID [2022-02-20 23:43:55,473 INFO L290 TraceCheckUtils]: 11: Hoare triple {1899#(and (<= (* ~n~0 4) (select |#length| ~a~0.base)) (= ~a~0.offset 0) (<= 2 |ULTIMATE.start_foo_~i~0#1|))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {1899#(and (<= (* ~n~0 4) (select |#length| ~a~0.base)) (= ~a~0.offset 0) (<= 2 |ULTIMATE.start_foo_~i~0#1|))} is VALID [2022-02-20 23:43:55,474 INFO L290 TraceCheckUtils]: 12: Hoare triple {1899#(and (<= (* ~n~0 4) (select |#length| ~a~0.base)) (= ~a~0.offset 0) (<= 2 |ULTIMATE.start_foo_~i~0#1|))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {1909#(and (<= 3 |ULTIMATE.start_foo_~i~0#1|) (<= (* ~n~0 4) (select |#length| ~a~0.base)) (= ~a~0.offset 0))} is VALID [2022-02-20 23:43:55,486 INFO L290 TraceCheckUtils]: 13: Hoare triple {1909#(and (<= 3 |ULTIMATE.start_foo_~i~0#1|) (<= (* ~n~0 4) (select |#length| ~a~0.base)) (= ~a~0.offset 0))} assume !!(foo_~i~0#1 < ~n~0); {1909#(and (<= 3 |ULTIMATE.start_foo_~i~0#1|) (<= (* ~n~0 4) (select |#length| ~a~0.base)) (= ~a~0.offset 0))} is VALID [2022-02-20 23:43:55,487 INFO L290 TraceCheckUtils]: 14: Hoare triple {1909#(and (<= 3 |ULTIMATE.start_foo_~i~0#1|) (<= (* ~n~0 4) (select |#length| ~a~0.base)) (= ~a~0.offset 0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {1909#(and (<= 3 |ULTIMATE.start_foo_~i~0#1|) (<= (* ~n~0 4) (select |#length| ~a~0.base)) (= ~a~0.offset 0))} is VALID [2022-02-20 23:43:55,488 INFO L290 TraceCheckUtils]: 15: Hoare triple {1909#(and (<= 3 |ULTIMATE.start_foo_~i~0#1|) (<= (* ~n~0 4) (select |#length| ~a~0.base)) (= ~a~0.offset 0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {1919#(and (<= (* ~n~0 4) (select |#length| ~a~0.base)) (<= 4 |ULTIMATE.start_foo_~i~0#1|) (= ~a~0.offset 0))} is VALID [2022-02-20 23:43:55,488 INFO L290 TraceCheckUtils]: 16: Hoare triple {1919#(and (<= (* ~n~0 4) (select |#length| ~a~0.base)) (<= 4 |ULTIMATE.start_foo_~i~0#1|) (= ~a~0.offset 0))} assume !!(foo_~i~0#1 < ~n~0); {1923#(and (<= 4 |ULTIMATE.start_foo_~i~0#1|) (= ~a~0.offset 0) (< |ULTIMATE.start_foo_~i~0#1| (div (select |#length| ~a~0.base) 4)))} is VALID [2022-02-20 23:43:55,489 INFO L290 TraceCheckUtils]: 17: Hoare triple {1923#(and (<= 4 |ULTIMATE.start_foo_~i~0#1|) (= ~a~0.offset 0) (< |ULTIMATE.start_foo_~i~0#1| (div (select |#length| ~a~0.base) 4)))} assume !(4 + (~a~0.offset + 4 * foo_~i~0#1) <= #length[~a~0.base] && 0 <= ~a~0.offset + 4 * foo_~i~0#1); {1857#false} is VALID [2022-02-20 23:43:55,489 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 22 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:43:55,489 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:43:56,444 INFO L290 TraceCheckUtils]: 17: Hoare triple {1927#(and (<= (+ ~a~0.offset 4 (* |ULTIMATE.start_foo_~i~0#1| 4)) (select |#length| ~a~0.base)) (<= 0 (+ ~a~0.offset (* |ULTIMATE.start_foo_~i~0#1| 4))))} assume !(4 + (~a~0.offset + 4 * foo_~i~0#1) <= #length[~a~0.base] && 0 <= ~a~0.offset + 4 * foo_~i~0#1); {1857#false} is VALID [2022-02-20 23:43:56,444 INFO L290 TraceCheckUtils]: 16: Hoare triple {1931#(or (not (< |ULTIMATE.start_foo_~i~0#1| ~n~0)) (and (<= (+ ~a~0.offset 4 (* |ULTIMATE.start_foo_~i~0#1| 4)) (select |#length| ~a~0.base)) (<= 0 (+ ~a~0.offset (* |ULTIMATE.start_foo_~i~0#1| 4)))))} assume !!(foo_~i~0#1 < ~n~0); {1927#(and (<= (+ ~a~0.offset 4 (* |ULTIMATE.start_foo_~i~0#1| 4)) (select |#length| ~a~0.base)) (<= 0 (+ ~a~0.offset (* |ULTIMATE.start_foo_~i~0#1| 4))))} is VALID [2022-02-20 23:43:56,445 INFO L290 TraceCheckUtils]: 15: Hoare triple {1935#(and (or (<= ~n~0 (+ |ULTIMATE.start_foo_~i~0#1| 1)) (<= ~n~0 (+ (div (+ (- 4) (select |#length| ~a~0.base) (* (- 1) ~a~0.offset)) 4) 1))) (or (<= ~n~0 (+ |ULTIMATE.start_foo_~i~0#1| 1)) (<= (div ~a~0.offset (- 4)) (+ |ULTIMATE.start_foo_~i~0#1| 1))))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {1931#(or (not (< |ULTIMATE.start_foo_~i~0#1| ~n~0)) (and (<= (+ ~a~0.offset 4 (* |ULTIMATE.start_foo_~i~0#1| 4)) (select |#length| ~a~0.base)) (<= 0 (+ ~a~0.offset (* |ULTIMATE.start_foo_~i~0#1| 4)))))} is VALID [2022-02-20 23:43:56,446 INFO L290 TraceCheckUtils]: 14: Hoare triple {1935#(and (or (<= ~n~0 (+ |ULTIMATE.start_foo_~i~0#1| 1)) (<= ~n~0 (+ (div (+ (- 4) (select |#length| ~a~0.base) (* (- 1) ~a~0.offset)) 4) 1))) (or (<= ~n~0 (+ |ULTIMATE.start_foo_~i~0#1| 1)) (<= (div ~a~0.offset (- 4)) (+ |ULTIMATE.start_foo_~i~0#1| 1))))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {1935#(and (or (<= ~n~0 (+ |ULTIMATE.start_foo_~i~0#1| 1)) (<= ~n~0 (+ (div (+ (- 4) (select |#length| ~a~0.base) (* (- 1) ~a~0.offset)) 4) 1))) (or (<= ~n~0 (+ |ULTIMATE.start_foo_~i~0#1| 1)) (<= (div ~a~0.offset (- 4)) (+ |ULTIMATE.start_foo_~i~0#1| 1))))} is VALID [2022-02-20 23:43:56,447 INFO L290 TraceCheckUtils]: 13: Hoare triple {1935#(and (or (<= ~n~0 (+ |ULTIMATE.start_foo_~i~0#1| 1)) (<= ~n~0 (+ (div (+ (- 4) (select |#length| ~a~0.base) (* (- 1) ~a~0.offset)) 4) 1))) (or (<= ~n~0 (+ |ULTIMATE.start_foo_~i~0#1| 1)) (<= (div ~a~0.offset (- 4)) (+ |ULTIMATE.start_foo_~i~0#1| 1))))} assume !!(foo_~i~0#1 < ~n~0); {1935#(and (or (<= ~n~0 (+ |ULTIMATE.start_foo_~i~0#1| 1)) (<= ~n~0 (+ (div (+ (- 4) (select |#length| ~a~0.base) (* (- 1) ~a~0.offset)) 4) 1))) (or (<= ~n~0 (+ |ULTIMATE.start_foo_~i~0#1| 1)) (<= (div ~a~0.offset (- 4)) (+ |ULTIMATE.start_foo_~i~0#1| 1))))} is VALID [2022-02-20 23:43:56,447 INFO L290 TraceCheckUtils]: 12: Hoare triple {1945#(and (or (<= ~n~0 (+ |ULTIMATE.start_foo_~i~0#1| 2)) (<= ~n~0 (+ (div (+ (- 4) (select |#length| ~a~0.base) (* (- 1) ~a~0.offset)) 4) 1))) (or (<= ~n~0 (+ |ULTIMATE.start_foo_~i~0#1| 2)) (<= (div ~a~0.offset (- 4)) (+ |ULTIMATE.start_foo_~i~0#1| 2))))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {1935#(and (or (<= ~n~0 (+ |ULTIMATE.start_foo_~i~0#1| 1)) (<= ~n~0 (+ (div (+ (- 4) (select |#length| ~a~0.base) (* (- 1) ~a~0.offset)) 4) 1))) (or (<= ~n~0 (+ |ULTIMATE.start_foo_~i~0#1| 1)) (<= (div ~a~0.offset (- 4)) (+ |ULTIMATE.start_foo_~i~0#1| 1))))} is VALID [2022-02-20 23:43:56,448 INFO L290 TraceCheckUtils]: 11: Hoare triple {1945#(and (or (<= ~n~0 (+ |ULTIMATE.start_foo_~i~0#1| 2)) (<= ~n~0 (+ (div (+ (- 4) (select |#length| ~a~0.base) (* (- 1) ~a~0.offset)) 4) 1))) (or (<= ~n~0 (+ |ULTIMATE.start_foo_~i~0#1| 2)) (<= (div ~a~0.offset (- 4)) (+ |ULTIMATE.start_foo_~i~0#1| 2))))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {1945#(and (or (<= ~n~0 (+ |ULTIMATE.start_foo_~i~0#1| 2)) (<= ~n~0 (+ (div (+ (- 4) (select |#length| ~a~0.base) (* (- 1) ~a~0.offset)) 4) 1))) (or (<= ~n~0 (+ |ULTIMATE.start_foo_~i~0#1| 2)) (<= (div ~a~0.offset (- 4)) (+ |ULTIMATE.start_foo_~i~0#1| 2))))} is VALID [2022-02-20 23:43:56,449 INFO L290 TraceCheckUtils]: 10: Hoare triple {1945#(and (or (<= ~n~0 (+ |ULTIMATE.start_foo_~i~0#1| 2)) (<= ~n~0 (+ (div (+ (- 4) (select |#length| ~a~0.base) (* (- 1) ~a~0.offset)) 4) 1))) (or (<= ~n~0 (+ |ULTIMATE.start_foo_~i~0#1| 2)) (<= (div ~a~0.offset (- 4)) (+ |ULTIMATE.start_foo_~i~0#1| 2))))} assume !!(foo_~i~0#1 < ~n~0); {1945#(and (or (<= ~n~0 (+ |ULTIMATE.start_foo_~i~0#1| 2)) (<= ~n~0 (+ (div (+ (- 4) (select |#length| ~a~0.base) (* (- 1) ~a~0.offset)) 4) 1))) (or (<= ~n~0 (+ |ULTIMATE.start_foo_~i~0#1| 2)) (<= (div ~a~0.offset (- 4)) (+ |ULTIMATE.start_foo_~i~0#1| 2))))} is VALID [2022-02-20 23:43:56,449 INFO L290 TraceCheckUtils]: 9: Hoare triple {1955#(and (or (<= ~n~0 (+ |ULTIMATE.start_foo_~i~0#1| 3)) (<= (div ~a~0.offset (- 4)) (+ |ULTIMATE.start_foo_~i~0#1| 3))) (or (<= ~n~0 (+ |ULTIMATE.start_foo_~i~0#1| 3)) (<= ~n~0 (+ (div (+ (- 4) (select |#length| ~a~0.base) (* (- 1) ~a~0.offset)) 4) 1))))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {1945#(and (or (<= ~n~0 (+ |ULTIMATE.start_foo_~i~0#1| 2)) (<= ~n~0 (+ (div (+ (- 4) (select |#length| ~a~0.base) (* (- 1) ~a~0.offset)) 4) 1))) (or (<= ~n~0 (+ |ULTIMATE.start_foo_~i~0#1| 2)) (<= (div ~a~0.offset (- 4)) (+ |ULTIMATE.start_foo_~i~0#1| 2))))} is VALID [2022-02-20 23:43:56,450 INFO L290 TraceCheckUtils]: 8: Hoare triple {1955#(and (or (<= ~n~0 (+ |ULTIMATE.start_foo_~i~0#1| 3)) (<= (div ~a~0.offset (- 4)) (+ |ULTIMATE.start_foo_~i~0#1| 3))) (or (<= ~n~0 (+ |ULTIMATE.start_foo_~i~0#1| 3)) (<= ~n~0 (+ (div (+ (- 4) (select |#length| ~a~0.base) (* (- 1) ~a~0.offset)) 4) 1))))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {1955#(and (or (<= ~n~0 (+ |ULTIMATE.start_foo_~i~0#1| 3)) (<= (div ~a~0.offset (- 4)) (+ |ULTIMATE.start_foo_~i~0#1| 3))) (or (<= ~n~0 (+ |ULTIMATE.start_foo_~i~0#1| 3)) (<= ~n~0 (+ (div (+ (- 4) (select |#length| ~a~0.base) (* (- 1) ~a~0.offset)) 4) 1))))} is VALID [2022-02-20 23:43:56,451 INFO L290 TraceCheckUtils]: 7: Hoare triple {1955#(and (or (<= ~n~0 (+ |ULTIMATE.start_foo_~i~0#1| 3)) (<= (div ~a~0.offset (- 4)) (+ |ULTIMATE.start_foo_~i~0#1| 3))) (or (<= ~n~0 (+ |ULTIMATE.start_foo_~i~0#1| 3)) (<= ~n~0 (+ (div (+ (- 4) (select |#length| ~a~0.base) (* (- 1) ~a~0.offset)) 4) 1))))} assume !!(foo_~i~0#1 < ~n~0); {1955#(and (or (<= ~n~0 (+ |ULTIMATE.start_foo_~i~0#1| 3)) (<= (div ~a~0.offset (- 4)) (+ |ULTIMATE.start_foo_~i~0#1| 3))) (or (<= ~n~0 (+ |ULTIMATE.start_foo_~i~0#1| 3)) (<= ~n~0 (+ (div (+ (- 4) (select |#length| ~a~0.base) (* (- 1) ~a~0.offset)) 4) 1))))} is VALID [2022-02-20 23:43:56,451 INFO L290 TraceCheckUtils]: 6: Hoare triple {1965#(and (or (<= ~n~0 (+ (div (+ (- 4) (select |#length| ~a~0.base) (* (- 1) ~a~0.offset)) 4) 1)) (<= ~n~0 (+ |ULTIMATE.start_foo_~i~0#1| 4))) (or (<= (div ~a~0.offset (- 4)) (+ |ULTIMATE.start_foo_~i~0#1| 4)) (<= ~n~0 (+ |ULTIMATE.start_foo_~i~0#1| 4))))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {1955#(and (or (<= ~n~0 (+ |ULTIMATE.start_foo_~i~0#1| 3)) (<= (div ~a~0.offset (- 4)) (+ |ULTIMATE.start_foo_~i~0#1| 3))) (or (<= ~n~0 (+ |ULTIMATE.start_foo_~i~0#1| 3)) (<= ~n~0 (+ (div (+ (- 4) (select |#length| ~a~0.base) (* (- 1) ~a~0.offset)) 4) 1))))} is VALID [2022-02-20 23:43:56,452 INFO L290 TraceCheckUtils]: 5: Hoare triple {1965#(and (or (<= ~n~0 (+ (div (+ (- 4) (select |#length| ~a~0.base) (* (- 1) ~a~0.offset)) 4) 1)) (<= ~n~0 (+ |ULTIMATE.start_foo_~i~0#1| 4))) (or (<= (div ~a~0.offset (- 4)) (+ |ULTIMATE.start_foo_~i~0#1| 4)) (<= ~n~0 (+ |ULTIMATE.start_foo_~i~0#1| 4))))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {1965#(and (or (<= ~n~0 (+ (div (+ (- 4) (select |#length| ~a~0.base) (* (- 1) ~a~0.offset)) 4) 1)) (<= ~n~0 (+ |ULTIMATE.start_foo_~i~0#1| 4))) (or (<= (div ~a~0.offset (- 4)) (+ |ULTIMATE.start_foo_~i~0#1| 4)) (<= ~n~0 (+ |ULTIMATE.start_foo_~i~0#1| 4))))} is VALID [2022-02-20 23:43:56,453 INFO L290 TraceCheckUtils]: 4: Hoare triple {1965#(and (or (<= ~n~0 (+ (div (+ (- 4) (select |#length| ~a~0.base) (* (- 1) ~a~0.offset)) 4) 1)) (<= ~n~0 (+ |ULTIMATE.start_foo_~i~0#1| 4))) (or (<= (div ~a~0.offset (- 4)) (+ |ULTIMATE.start_foo_~i~0#1| 4)) (<= ~n~0 (+ |ULTIMATE.start_foo_~i~0#1| 4))))} assume !!(foo_~i~0#1 < ~n~0); {1965#(and (or (<= ~n~0 (+ (div (+ (- 4) (select |#length| ~a~0.base) (* (- 1) ~a~0.offset)) 4) 1)) (<= ~n~0 (+ |ULTIMATE.start_foo_~i~0#1| 4))) (or (<= (div ~a~0.offset (- 4)) (+ |ULTIMATE.start_foo_~i~0#1| 4)) (<= ~n~0 (+ |ULTIMATE.start_foo_~i~0#1| 4))))} is VALID [2022-02-20 23:43:56,453 INFO L290 TraceCheckUtils]: 3: Hoare triple {1975#(and (or (<= ~n~0 (+ (div (+ (- 4) (select |#length| ~a~0.base) (* (- 1) ~a~0.offset)) 4) 1)) (<= ~n~0 4)) (or (<= (div ~a~0.offset (- 4)) 4) (<= ~n~0 4)))} havoc main_#t~post7#1.base, main_#t~post7#1.offset;assume { :begin_inline_foo } true;havoc foo_#t~post3#1, foo_#t~post4#1, foo_~i~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {1965#(and (or (<= ~n~0 (+ (div (+ (- 4) (select |#length| ~a~0.base) (* (- 1) ~a~0.offset)) 4) 1)) (<= ~n~0 (+ |ULTIMATE.start_foo_~i~0#1| 4))) (or (<= (div ~a~0.offset (- 4)) (+ |ULTIMATE.start_foo_~i~0#1| 4)) (<= ~n~0 (+ |ULTIMATE.start_foo_~i~0#1| 4))))} is VALID [2022-02-20 23:43:56,454 INFO L290 TraceCheckUtils]: 2: Hoare triple {1975#(and (or (<= ~n~0 (+ (div (+ (- 4) (select |#length| ~a~0.base) (* (- 1) ~a~0.offset)) 4) 1)) (<= ~n~0 4)) (or (<= (div ~a~0.offset (- 4)) 4) (<= ~n~0 4)))} SUMMARY for call write~int(0, main_#t~post7#1.base, main_#t~post7#1.offset, 4); srcloc: L538 {1975#(and (or (<= ~n~0 (+ (div (+ (- 4) (select |#length| ~a~0.base) (* (- 1) ~a~0.offset)) 4) 1)) (<= ~n~0 4)) (or (<= (div ~a~0.offset (- 4)) 4) (<= ~n~0 4)))} is VALID [2022-02-20 23:43:56,455 INFO L290 TraceCheckUtils]: 1: Hoare triple {1856#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~post7#1.base, main_#t~post7#1.offset, main_#t~mem8#1;~n~0 := 32768;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~a~0.base, ~a~0.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~b~0.base, ~b~0.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_#t~post7#1.base, main_#t~post7#1.offset := ~b~0.base, ~b~0.offset;~b~0.base, ~b~0.offset := main_#t~post7#1.base, 4 + main_#t~post7#1.offset; {1975#(and (or (<= ~n~0 (+ (div (+ (- 4) (select |#length| ~a~0.base) (* (- 1) ~a~0.offset)) 4) 1)) (<= ~n~0 4)) (or (<= (div ~a~0.offset (- 4)) 4) (<= ~n~0 4)))} is VALID [2022-02-20 23:43:56,455 INFO L290 TraceCheckUtils]: 0: Hoare triple {1856#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);~a~0.base, ~a~0.offset := 0, 0;~b~0.base, ~b~0.offset := 0, 0;~n~0 := 0; {1856#true} is VALID [2022-02-20 23:43:56,455 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:43:56,455 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [121364722] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:43:56,455 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:43:56,455 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23 [2022-02-20 23:43:56,455 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18872597] [2022-02-20 23:43:56,456 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:43:56,456 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.260869565217391) internal successors, (52), 24 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-20 23:43:56,456 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:43:56,456 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 24 states, 23 states have (on average 2.260869565217391) internal successors, (52), 24 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:56,499 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:56,499 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-02-20 23:43:56,500 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:43:56,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-02-20 23:43:56,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=382, Unknown=0, NotChecked=0, Total=552 [2022-02-20 23:43:56,500 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand has 24 states, 23 states have (on average 2.260869565217391) internal successors, (52), 24 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:57,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:57,647 INFO L93 Difference]: Finished difference Result 184 states and 190 transitions. [2022-02-20 23:43:57,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 23:43:57,647 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.260869565217391) internal successors, (52), 24 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-20 23:43:57,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:43:57,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 2.260869565217391) internal successors, (52), 24 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:57,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 194 transitions. [2022-02-20 23:43:57,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 2.260869565217391) internal successors, (52), 24 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:57,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 194 transitions. [2022-02-20 23:43:57,651 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 194 transitions. [2022-02-20 23:43:57,779 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 194 edges. 194 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:57,781 INFO L225 Difference]: With dead ends: 184 [2022-02-20 23:43:57,781 INFO L226 Difference]: Without dead ends: 184 [2022-02-20 23:43:57,781 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=251, Invalid=505, Unknown=0, NotChecked=0, Total=756 [2022-02-20 23:43:57,782 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 897 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 897 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:43:57,782 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [897 Valid, 157 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:43:57,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-02-20 23:43:57,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 59. [2022-02-20 23:43:57,784 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:43:57,784 INFO L82 GeneralOperation]: Start isEquivalent. First operand 184 states. Second operand has 59 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 58 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:57,784 INFO L74 IsIncluded]: Start isIncluded. First operand 184 states. Second operand has 59 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 58 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:57,785 INFO L87 Difference]: Start difference. First operand 184 states. Second operand has 59 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 58 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:57,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:57,788 INFO L93 Difference]: Finished difference Result 184 states and 190 transitions. [2022-02-20 23:43:57,788 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 190 transitions. [2022-02-20 23:43:57,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:57,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:57,788 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 58 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 184 states. [2022-02-20 23:43:57,788 INFO L87 Difference]: Start difference. First operand has 59 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 58 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 184 states. [2022-02-20 23:43:57,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:57,792 INFO L93 Difference]: Finished difference Result 184 states and 190 transitions. [2022-02-20 23:43:57,792 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 190 transitions. [2022-02-20 23:43:57,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:57,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:57,792 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:43:57,792 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:43:57,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 58 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:57,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2022-02-20 23:43:57,799 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 18 [2022-02-20 23:43:57,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:43:57,800 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2022-02-20 23:43:57,801 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.260869565217391) internal successors, (52), 24 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:57,801 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2022-02-20 23:43:57,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 23:43:57,802 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:43:57,802 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:43:57,820 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-02-20 23:43:58,005 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:43:58,005 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2022-02-20 23:43:58,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:43:58,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1502042668, now seen corresponding path program 2 times [2022-02-20 23:43:58,006 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:43:58,006 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631195003] [2022-02-20 23:43:58,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:58,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:43:58,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:58,109 INFO L290 TraceCheckUtils]: 0: Hoare triple {2603#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);~a~0.base, ~a~0.offset := 0, 0;~b~0.base, ~b~0.offset := 0, 0;~n~0 := 0; {2603#true} is VALID [2022-02-20 23:43:58,110 INFO L290 TraceCheckUtils]: 1: Hoare triple {2603#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~post7#1.base, main_#t~post7#1.offset, main_#t~mem8#1;~n~0 := 32768;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~a~0.base, ~a~0.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~b~0.base, ~b~0.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_#t~post7#1.base, main_#t~post7#1.offset := ~b~0.base, ~b~0.offset;~b~0.base, ~b~0.offset := main_#t~post7#1.base, 4 + main_#t~post7#1.offset; {2605#(<= 32768 ~n~0)} is VALID [2022-02-20 23:43:58,110 INFO L290 TraceCheckUtils]: 2: Hoare triple {2605#(<= 32768 ~n~0)} SUMMARY for call write~int(0, main_#t~post7#1.base, main_#t~post7#1.offset, 4); srcloc: L538 {2605#(<= 32768 ~n~0)} is VALID [2022-02-20 23:43:58,111 INFO L290 TraceCheckUtils]: 3: Hoare triple {2605#(<= 32768 ~n~0)} havoc main_#t~post7#1.base, main_#t~post7#1.offset;assume { :begin_inline_foo } true;havoc foo_#t~post3#1, foo_#t~post4#1, foo_~i~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {2606#(and (= |ULTIMATE.start_foo_~i~0#1| 0) (<= 32768 ~n~0))} is VALID [2022-02-20 23:43:58,111 INFO L290 TraceCheckUtils]: 4: Hoare triple {2606#(and (= |ULTIMATE.start_foo_~i~0#1| 0) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {2606#(and (= |ULTIMATE.start_foo_~i~0#1| 0) (<= 32768 ~n~0))} is VALID [2022-02-20 23:43:58,111 INFO L290 TraceCheckUtils]: 5: Hoare triple {2606#(and (= |ULTIMATE.start_foo_~i~0#1| 0) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {2606#(and (= |ULTIMATE.start_foo_~i~0#1| 0) (<= 32768 ~n~0))} is VALID [2022-02-20 23:43:58,112 INFO L290 TraceCheckUtils]: 6: Hoare triple {2606#(and (= |ULTIMATE.start_foo_~i~0#1| 0) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {2607#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32767) ~n~0)} is VALID [2022-02-20 23:43:58,112 INFO L290 TraceCheckUtils]: 7: Hoare triple {2607#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32767) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {2607#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32767) ~n~0)} is VALID [2022-02-20 23:43:58,112 INFO L290 TraceCheckUtils]: 8: Hoare triple {2607#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32767) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {2607#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32767) ~n~0)} is VALID [2022-02-20 23:43:58,113 INFO L290 TraceCheckUtils]: 9: Hoare triple {2607#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32767) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {2608#(<= (+ 32766 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:43:58,113 INFO L290 TraceCheckUtils]: 10: Hoare triple {2608#(<= (+ 32766 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {2608#(<= (+ 32766 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:43:58,113 INFO L290 TraceCheckUtils]: 11: Hoare triple {2608#(<= (+ 32766 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {2608#(<= (+ 32766 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:43:58,114 INFO L290 TraceCheckUtils]: 12: Hoare triple {2608#(<= (+ 32766 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {2609#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32765) ~n~0)} is VALID [2022-02-20 23:43:58,114 INFO L290 TraceCheckUtils]: 13: Hoare triple {2609#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32765) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {2609#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32765) ~n~0)} is VALID [2022-02-20 23:43:58,114 INFO L290 TraceCheckUtils]: 14: Hoare triple {2609#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32765) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {2609#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32765) ~n~0)} is VALID [2022-02-20 23:43:58,115 INFO L290 TraceCheckUtils]: 15: Hoare triple {2609#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32765) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {2610#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32764) ~n~0)} is VALID [2022-02-20 23:43:58,115 INFO L290 TraceCheckUtils]: 16: Hoare triple {2610#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32764) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {2610#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32764) ~n~0)} is VALID [2022-02-20 23:43:58,115 INFO L290 TraceCheckUtils]: 17: Hoare triple {2610#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32764) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {2610#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32764) ~n~0)} is VALID [2022-02-20 23:43:58,116 INFO L290 TraceCheckUtils]: 18: Hoare triple {2610#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32764) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {2611#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32763) ~n~0)} is VALID [2022-02-20 23:43:58,116 INFO L290 TraceCheckUtils]: 19: Hoare triple {2611#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32763) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {2611#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32763) ~n~0)} is VALID [2022-02-20 23:43:58,116 INFO L290 TraceCheckUtils]: 20: Hoare triple {2611#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32763) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {2611#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32763) ~n~0)} is VALID [2022-02-20 23:43:58,117 INFO L290 TraceCheckUtils]: 21: Hoare triple {2611#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32763) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {2612#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32762) ~n~0)} is VALID [2022-02-20 23:43:58,117 INFO L290 TraceCheckUtils]: 22: Hoare triple {2612#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32762) ~n~0)} assume !(foo_~i~0#1 < ~n~0); {2604#false} is VALID [2022-02-20 23:43:58,117 INFO L290 TraceCheckUtils]: 23: Hoare triple {2604#false} foo_~i~0#1 := 0; {2604#false} is VALID [2022-02-20 23:43:58,117 INFO L290 TraceCheckUtils]: 24: Hoare triple {2604#false} assume !!(foo_~i~0#1 < 32767); {2604#false} is VALID [2022-02-20 23:43:58,117 INFO L290 TraceCheckUtils]: 25: Hoare triple {2604#false} assume !(4 + (~b~0.offset + 4 * foo_~i~0#1) <= #length[~b~0.base] && 0 <= ~b~0.offset + 4 * foo_~i~0#1); {2604#false} is VALID [2022-02-20 23:43:58,118 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:43:58,118 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:43:58,118 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631195003] [2022-02-20 23:43:58,118 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631195003] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:43:58,118 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587298178] [2022-02-20 23:43:58,118 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 23:43:58,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:43:58,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:43:58,119 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-02-20 23:43:58,120 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-02-20 23:43:58,164 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-20 23:43:58,164 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 23:43:58,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 23:43:58,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:58,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:43:58,259 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-20 23:43:58,260 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-02-20 23:43:58,451 INFO L290 TraceCheckUtils]: 0: Hoare triple {2603#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);~a~0.base, ~a~0.offset := 0, 0;~b~0.base, ~b~0.offset := 0, 0;~n~0 := 0; {2603#true} is VALID [2022-02-20 23:43:58,451 INFO L290 TraceCheckUtils]: 1: Hoare triple {2603#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~post7#1.base, main_#t~post7#1.offset, main_#t~mem8#1;~n~0 := 32768;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~a~0.base, ~a~0.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~b~0.base, ~b~0.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_#t~post7#1.base, main_#t~post7#1.offset := ~b~0.base, ~b~0.offset;~b~0.base, ~b~0.offset := main_#t~post7#1.base, 4 + main_#t~post7#1.offset; {2619#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:43:58,452 INFO L290 TraceCheckUtils]: 2: Hoare triple {2619#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} SUMMARY for call write~int(0, main_#t~post7#1.base, main_#t~post7#1.offset, 4); srcloc: L538 {2619#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:43:58,452 INFO L290 TraceCheckUtils]: 3: Hoare triple {2619#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} havoc main_#t~post7#1.base, main_#t~post7#1.offset;assume { :begin_inline_foo } true;havoc foo_#t~post3#1, foo_#t~post4#1, foo_~i~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {2619#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:43:58,453 INFO L290 TraceCheckUtils]: 4: Hoare triple {2619#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} assume !!(foo_~i~0#1 < ~n~0); {2619#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:43:58,453 INFO L290 TraceCheckUtils]: 5: Hoare triple {2619#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {2619#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:43:58,453 INFO L290 TraceCheckUtils]: 6: Hoare triple {2619#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {2619#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:43:58,454 INFO L290 TraceCheckUtils]: 7: Hoare triple {2619#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} assume !!(foo_~i~0#1 < ~n~0); {2619#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:43:58,454 INFO L290 TraceCheckUtils]: 8: Hoare triple {2619#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {2619#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:43:58,455 INFO L290 TraceCheckUtils]: 9: Hoare triple {2619#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {2619#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:43:58,455 INFO L290 TraceCheckUtils]: 10: Hoare triple {2619#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} assume !!(foo_~i~0#1 < ~n~0); {2619#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:43:58,455 INFO L290 TraceCheckUtils]: 11: Hoare triple {2619#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {2619#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:43:58,456 INFO L290 TraceCheckUtils]: 12: Hoare triple {2619#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {2619#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:43:58,456 INFO L290 TraceCheckUtils]: 13: Hoare triple {2619#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} assume !!(foo_~i~0#1 < ~n~0); {2619#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:43:58,457 INFO L290 TraceCheckUtils]: 14: Hoare triple {2619#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {2619#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:43:58,457 INFO L290 TraceCheckUtils]: 15: Hoare triple {2619#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {2619#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:43:58,457 INFO L290 TraceCheckUtils]: 16: Hoare triple {2619#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} assume !!(foo_~i~0#1 < ~n~0); {2619#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:43:58,458 INFO L290 TraceCheckUtils]: 17: Hoare triple {2619#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {2619#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:43:58,459 INFO L290 TraceCheckUtils]: 18: Hoare triple {2619#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {2619#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:43:58,459 INFO L290 TraceCheckUtils]: 19: Hoare triple {2619#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} assume !!(foo_~i~0#1 < ~n~0); {2619#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:43:58,459 INFO L290 TraceCheckUtils]: 20: Hoare triple {2619#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {2619#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:43:58,460 INFO L290 TraceCheckUtils]: 21: Hoare triple {2619#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {2619#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:43:58,460 INFO L290 TraceCheckUtils]: 22: Hoare triple {2619#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} assume !(foo_~i~0#1 < ~n~0); {2619#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:43:58,460 INFO L290 TraceCheckUtils]: 23: Hoare triple {2619#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} foo_~i~0#1 := 0; {2686#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4) (= |ULTIMATE.start_foo_~i~0#1| 0))} is VALID [2022-02-20 23:43:58,461 INFO L290 TraceCheckUtils]: 24: Hoare triple {2686#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4) (= |ULTIMATE.start_foo_~i~0#1| 0))} assume !!(foo_~i~0#1 < 32767); {2686#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4) (= |ULTIMATE.start_foo_~i~0#1| 0))} is VALID [2022-02-20 23:43:58,461 INFO L290 TraceCheckUtils]: 25: Hoare triple {2686#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4) (= |ULTIMATE.start_foo_~i~0#1| 0))} assume !(4 + (~b~0.offset + 4 * foo_~i~0#1) <= #length[~b~0.base] && 0 <= ~b~0.offset + 4 * foo_~i~0#1); {2604#false} is VALID [2022-02-20 23:43:58,462 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-02-20 23:43:58,462 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:43:58,462 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587298178] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:43:58,462 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 23:43:58,462 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 12 [2022-02-20 23:43:58,462 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659740242] [2022-02-20 23:43:58,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:43:58,462 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-02-20 23:43:58,462 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:43:58,462 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:58,471 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:58,471 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:43:58,471 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:43:58,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:43:58,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-02-20 23:43:58,472 INFO L87 Difference]: Start difference. First operand 59 states and 62 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:58,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:58,537 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2022-02-20 23:43:58,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:43:58,537 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-02-20 23:43:58,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:43:58,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:58,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-02-20 23:43:58,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:58,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-02-20 23:43:58,539 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 44 transitions. [2022-02-20 23:43:58,576 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:58,577 INFO L225 Difference]: With dead ends: 53 [2022-02-20 23:43:58,577 INFO L226 Difference]: Without dead ends: 53 [2022-02-20 23:43:58,577 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-02-20 23:43:58,579 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 30 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:43:58,579 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 32 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:43:58,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-02-20 23:43:58,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-02-20 23:43:58,581 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:43:58,581 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 53 states, 46 states have (on average 1.173913043478261) internal successors, (54), 52 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:58,581 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 53 states, 46 states have (on average 1.173913043478261) internal successors, (54), 52 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:58,581 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 53 states, 46 states have (on average 1.173913043478261) internal successors, (54), 52 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:58,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:58,582 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2022-02-20 23:43:58,582 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2022-02-20 23:43:58,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:58,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:58,582 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 46 states have (on average 1.173913043478261) internal successors, (54), 52 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 53 states. [2022-02-20 23:43:58,582 INFO L87 Difference]: Start difference. First operand has 53 states, 46 states have (on average 1.173913043478261) internal successors, (54), 52 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 53 states. [2022-02-20 23:43:58,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:58,583 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2022-02-20 23:43:58,583 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2022-02-20 23:43:58,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:58,583 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:58,583 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:43:58,583 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:43:58,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 46 states have (on average 1.173913043478261) internal successors, (54), 52 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:58,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2022-02-20 23:43:58,584 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 26 [2022-02-20 23:43:58,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:43:58,585 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2022-02-20 23:43:58,585 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:58,585 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2022-02-20 23:43:58,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 23:43:58,585 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:43:58,585 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:43:58,603 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-02-20 23:43:58,803 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:43:58,804 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2022-02-20 23:43:58,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:43:58,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1911110645, now seen corresponding path program 1 times [2022-02-20 23:43:58,804 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:43:58,804 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087294445] [2022-02-20 23:43:58,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:58,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:43:58,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:58,902 INFO L290 TraceCheckUtils]: 0: Hoare triple {2904#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);~a~0.base, ~a~0.offset := 0, 0;~b~0.base, ~b~0.offset := 0, 0;~n~0 := 0; {2904#true} is VALID [2022-02-20 23:43:58,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {2904#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~post7#1.base, main_#t~post7#1.offset, main_#t~mem8#1;~n~0 := 32768;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~a~0.base, ~a~0.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~b~0.base, ~b~0.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_#t~post7#1.base, main_#t~post7#1.offset := ~b~0.base, ~b~0.offset;~b~0.base, ~b~0.offset := main_#t~post7#1.base, 4 + main_#t~post7#1.offset; {2906#(<= 32768 ~n~0)} is VALID [2022-02-20 23:43:58,903 INFO L290 TraceCheckUtils]: 2: Hoare triple {2906#(<= 32768 ~n~0)} SUMMARY for call write~int(0, main_#t~post7#1.base, main_#t~post7#1.offset, 4); srcloc: L538 {2906#(<= 32768 ~n~0)} is VALID [2022-02-20 23:43:58,903 INFO L290 TraceCheckUtils]: 3: Hoare triple {2906#(<= 32768 ~n~0)} havoc main_#t~post7#1.base, main_#t~post7#1.offset;assume { :begin_inline_foo } true;havoc foo_#t~post3#1, foo_#t~post4#1, foo_~i~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {2907#(and (= |ULTIMATE.start_foo_~i~0#1| 0) (<= 32768 ~n~0))} is VALID [2022-02-20 23:43:58,904 INFO L290 TraceCheckUtils]: 4: Hoare triple {2907#(and (= |ULTIMATE.start_foo_~i~0#1| 0) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {2907#(and (= |ULTIMATE.start_foo_~i~0#1| 0) (<= 32768 ~n~0))} is VALID [2022-02-20 23:43:58,904 INFO L290 TraceCheckUtils]: 5: Hoare triple {2907#(and (= |ULTIMATE.start_foo_~i~0#1| 0) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {2907#(and (= |ULTIMATE.start_foo_~i~0#1| 0) (<= 32768 ~n~0))} is VALID [2022-02-20 23:43:58,905 INFO L290 TraceCheckUtils]: 6: Hoare triple {2907#(and (= |ULTIMATE.start_foo_~i~0#1| 0) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {2908#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32767) ~n~0)} is VALID [2022-02-20 23:43:58,905 INFO L290 TraceCheckUtils]: 7: Hoare triple {2908#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32767) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {2908#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32767) ~n~0)} is VALID [2022-02-20 23:43:58,905 INFO L290 TraceCheckUtils]: 8: Hoare triple {2908#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32767) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {2908#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32767) ~n~0)} is VALID [2022-02-20 23:43:58,909 INFO L290 TraceCheckUtils]: 9: Hoare triple {2908#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32767) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {2909#(<= (+ 32766 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:43:58,910 INFO L290 TraceCheckUtils]: 10: Hoare triple {2909#(<= (+ 32766 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {2909#(<= (+ 32766 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:43:58,910 INFO L290 TraceCheckUtils]: 11: Hoare triple {2909#(<= (+ 32766 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {2909#(<= (+ 32766 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:43:58,911 INFO L290 TraceCheckUtils]: 12: Hoare triple {2909#(<= (+ 32766 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {2910#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32765) ~n~0)} is VALID [2022-02-20 23:43:58,911 INFO L290 TraceCheckUtils]: 13: Hoare triple {2910#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32765) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {2910#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32765) ~n~0)} is VALID [2022-02-20 23:43:58,911 INFO L290 TraceCheckUtils]: 14: Hoare triple {2910#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32765) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {2910#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32765) ~n~0)} is VALID [2022-02-20 23:43:58,912 INFO L290 TraceCheckUtils]: 15: Hoare triple {2910#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32765) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {2911#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32764) ~n~0)} is VALID [2022-02-20 23:43:58,912 INFO L290 TraceCheckUtils]: 16: Hoare triple {2911#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32764) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {2911#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32764) ~n~0)} is VALID [2022-02-20 23:43:58,912 INFO L290 TraceCheckUtils]: 17: Hoare triple {2911#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32764) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {2911#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32764) ~n~0)} is VALID [2022-02-20 23:43:58,913 INFO L290 TraceCheckUtils]: 18: Hoare triple {2911#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32764) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {2912#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32763) ~n~0)} is VALID [2022-02-20 23:43:58,913 INFO L290 TraceCheckUtils]: 19: Hoare triple {2912#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32763) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {2912#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32763) ~n~0)} is VALID [2022-02-20 23:43:58,913 INFO L290 TraceCheckUtils]: 20: Hoare triple {2912#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32763) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {2912#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32763) ~n~0)} is VALID [2022-02-20 23:43:58,914 INFO L290 TraceCheckUtils]: 21: Hoare triple {2912#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32763) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {2913#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32762) ~n~0)} is VALID [2022-02-20 23:43:58,914 INFO L290 TraceCheckUtils]: 22: Hoare triple {2913#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32762) ~n~0)} assume !(foo_~i~0#1 < ~n~0); {2905#false} is VALID [2022-02-20 23:43:58,914 INFO L290 TraceCheckUtils]: 23: Hoare triple {2905#false} foo_~i~0#1 := 0; {2905#false} is VALID [2022-02-20 23:43:58,914 INFO L290 TraceCheckUtils]: 24: Hoare triple {2905#false} assume !!(foo_~i~0#1 < 32767); {2905#false} is VALID [2022-02-20 23:43:58,914 INFO L290 TraceCheckUtils]: 25: Hoare triple {2905#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {2905#false} is VALID [2022-02-20 23:43:58,914 INFO L290 TraceCheckUtils]: 26: Hoare triple {2905#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {2905#false} is VALID [2022-02-20 23:43:58,914 INFO L290 TraceCheckUtils]: 27: Hoare triple {2905#false} assume !!(foo_~i~0#1 < 32767); {2905#false} is VALID [2022-02-20 23:43:58,915 INFO L290 TraceCheckUtils]: 28: Hoare triple {2905#false} assume !(4 + (~b~0.offset + 4 * foo_~i~0#1) <= #length[~b~0.base] && 0 <= ~b~0.offset + 4 * foo_~i~0#1); {2905#false} is VALID [2022-02-20 23:43:58,915 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 23:43:58,915 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:43:58,916 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087294445] [2022-02-20 23:43:58,916 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087294445] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:43:58,916 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1590061138] [2022-02-20 23:43:58,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:58,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:43:58,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:43:58,919 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-02-20 23:43:58,920 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-02-20 23:43:58,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:58,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 23:43:58,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:58,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:43:59,253 INFO L290 TraceCheckUtils]: 0: Hoare triple {2904#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);~a~0.base, ~a~0.offset := 0, 0;~b~0.base, ~b~0.offset := 0, 0;~n~0 := 0; {2904#true} is VALID [2022-02-20 23:43:59,254 INFO L290 TraceCheckUtils]: 1: Hoare triple {2904#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~post7#1.base, main_#t~post7#1.offset, main_#t~mem8#1;~n~0 := 32768;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~a~0.base, ~a~0.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~b~0.base, ~b~0.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_#t~post7#1.base, main_#t~post7#1.offset := ~b~0.base, ~b~0.offset;~b~0.base, ~b~0.offset := main_#t~post7#1.base, 4 + main_#t~post7#1.offset; {2906#(<= 32768 ~n~0)} is VALID [2022-02-20 23:43:59,254 INFO L290 TraceCheckUtils]: 2: Hoare triple {2906#(<= 32768 ~n~0)} SUMMARY for call write~int(0, main_#t~post7#1.base, main_#t~post7#1.offset, 4); srcloc: L538 {2906#(<= 32768 ~n~0)} is VALID [2022-02-20 23:43:59,254 INFO L290 TraceCheckUtils]: 3: Hoare triple {2906#(<= 32768 ~n~0)} havoc main_#t~post7#1.base, main_#t~post7#1.offset;assume { :begin_inline_foo } true;havoc foo_#t~post3#1, foo_#t~post4#1, foo_~i~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {2926#(and (<= |ULTIMATE.start_foo_~i~0#1| 0) (<= 32768 ~n~0))} is VALID [2022-02-20 23:43:59,255 INFO L290 TraceCheckUtils]: 4: Hoare triple {2926#(and (<= |ULTIMATE.start_foo_~i~0#1| 0) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {2926#(and (<= |ULTIMATE.start_foo_~i~0#1| 0) (<= 32768 ~n~0))} is VALID [2022-02-20 23:43:59,255 INFO L290 TraceCheckUtils]: 5: Hoare triple {2926#(and (<= |ULTIMATE.start_foo_~i~0#1| 0) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {2926#(and (<= |ULTIMATE.start_foo_~i~0#1| 0) (<= 32768 ~n~0))} is VALID [2022-02-20 23:43:59,256 INFO L290 TraceCheckUtils]: 6: Hoare triple {2926#(and (<= |ULTIMATE.start_foo_~i~0#1| 0) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {2936#(and (<= |ULTIMATE.start_foo_~i~0#1| 1) (<= 32768 ~n~0))} is VALID [2022-02-20 23:43:59,256 INFO L290 TraceCheckUtils]: 7: Hoare triple {2936#(and (<= |ULTIMATE.start_foo_~i~0#1| 1) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {2936#(and (<= |ULTIMATE.start_foo_~i~0#1| 1) (<= 32768 ~n~0))} is VALID [2022-02-20 23:43:59,257 INFO L290 TraceCheckUtils]: 8: Hoare triple {2936#(and (<= |ULTIMATE.start_foo_~i~0#1| 1) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {2936#(and (<= |ULTIMATE.start_foo_~i~0#1| 1) (<= 32768 ~n~0))} is VALID [2022-02-20 23:43:59,257 INFO L290 TraceCheckUtils]: 9: Hoare triple {2936#(and (<= |ULTIMATE.start_foo_~i~0#1| 1) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {2946#(and (<= |ULTIMATE.start_foo_~i~0#1| 2) (<= 32768 ~n~0))} is VALID [2022-02-20 23:43:59,257 INFO L290 TraceCheckUtils]: 10: Hoare triple {2946#(and (<= |ULTIMATE.start_foo_~i~0#1| 2) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {2946#(and (<= |ULTIMATE.start_foo_~i~0#1| 2) (<= 32768 ~n~0))} is VALID [2022-02-20 23:43:59,258 INFO L290 TraceCheckUtils]: 11: Hoare triple {2946#(and (<= |ULTIMATE.start_foo_~i~0#1| 2) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {2946#(and (<= |ULTIMATE.start_foo_~i~0#1| 2) (<= 32768 ~n~0))} is VALID [2022-02-20 23:43:59,258 INFO L290 TraceCheckUtils]: 12: Hoare triple {2946#(and (<= |ULTIMATE.start_foo_~i~0#1| 2) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {2956#(and (<= |ULTIMATE.start_foo_~i~0#1| 3) (<= 32768 ~n~0))} is VALID [2022-02-20 23:43:59,259 INFO L290 TraceCheckUtils]: 13: Hoare triple {2956#(and (<= |ULTIMATE.start_foo_~i~0#1| 3) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {2956#(and (<= |ULTIMATE.start_foo_~i~0#1| 3) (<= 32768 ~n~0))} is VALID [2022-02-20 23:43:59,259 INFO L290 TraceCheckUtils]: 14: Hoare triple {2956#(and (<= |ULTIMATE.start_foo_~i~0#1| 3) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {2956#(and (<= |ULTIMATE.start_foo_~i~0#1| 3) (<= 32768 ~n~0))} is VALID [2022-02-20 23:43:59,259 INFO L290 TraceCheckUtils]: 15: Hoare triple {2956#(and (<= |ULTIMATE.start_foo_~i~0#1| 3) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {2966#(and (<= |ULTIMATE.start_foo_~i~0#1| 4) (<= 32768 ~n~0))} is VALID [2022-02-20 23:43:59,260 INFO L290 TraceCheckUtils]: 16: Hoare triple {2966#(and (<= |ULTIMATE.start_foo_~i~0#1| 4) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {2966#(and (<= |ULTIMATE.start_foo_~i~0#1| 4) (<= 32768 ~n~0))} is VALID [2022-02-20 23:43:59,260 INFO L290 TraceCheckUtils]: 17: Hoare triple {2966#(and (<= |ULTIMATE.start_foo_~i~0#1| 4) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {2966#(and (<= |ULTIMATE.start_foo_~i~0#1| 4) (<= 32768 ~n~0))} is VALID [2022-02-20 23:43:59,261 INFO L290 TraceCheckUtils]: 18: Hoare triple {2966#(and (<= |ULTIMATE.start_foo_~i~0#1| 4) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {2976#(and (<= |ULTIMATE.start_foo_~i~0#1| 5) (<= 32768 ~n~0))} is VALID [2022-02-20 23:43:59,266 INFO L290 TraceCheckUtils]: 19: Hoare triple {2976#(and (<= |ULTIMATE.start_foo_~i~0#1| 5) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {2976#(and (<= |ULTIMATE.start_foo_~i~0#1| 5) (<= 32768 ~n~0))} is VALID [2022-02-20 23:43:59,266 INFO L290 TraceCheckUtils]: 20: Hoare triple {2976#(and (<= |ULTIMATE.start_foo_~i~0#1| 5) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {2976#(and (<= |ULTIMATE.start_foo_~i~0#1| 5) (<= 32768 ~n~0))} is VALID [2022-02-20 23:43:59,266 INFO L290 TraceCheckUtils]: 21: Hoare triple {2976#(and (<= |ULTIMATE.start_foo_~i~0#1| 5) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {2986#(and (<= |ULTIMATE.start_foo_~i~0#1| 6) (<= 32768 ~n~0))} is VALID [2022-02-20 23:43:59,267 INFO L290 TraceCheckUtils]: 22: Hoare triple {2986#(and (<= |ULTIMATE.start_foo_~i~0#1| 6) (<= 32768 ~n~0))} assume !(foo_~i~0#1 < ~n~0); {2905#false} is VALID [2022-02-20 23:43:59,267 INFO L290 TraceCheckUtils]: 23: Hoare triple {2905#false} foo_~i~0#1 := 0; {2905#false} is VALID [2022-02-20 23:43:59,267 INFO L290 TraceCheckUtils]: 24: Hoare triple {2905#false} assume !!(foo_~i~0#1 < 32767); {2905#false} is VALID [2022-02-20 23:43:59,267 INFO L290 TraceCheckUtils]: 25: Hoare triple {2905#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {2905#false} is VALID [2022-02-20 23:43:59,267 INFO L290 TraceCheckUtils]: 26: Hoare triple {2905#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {2905#false} is VALID [2022-02-20 23:43:59,267 INFO L290 TraceCheckUtils]: 27: Hoare triple {2905#false} assume !!(foo_~i~0#1 < 32767); {2905#false} is VALID [2022-02-20 23:43:59,267 INFO L290 TraceCheckUtils]: 28: Hoare triple {2905#false} assume !(4 + (~b~0.offset + 4 * foo_~i~0#1) <= #length[~b~0.base] && 0 <= ~b~0.offset + 4 * foo_~i~0#1); {2905#false} is VALID [2022-02-20 23:43:59,267 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 23:43:59,268 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:43:59,480 INFO L290 TraceCheckUtils]: 28: Hoare triple {2905#false} assume !(4 + (~b~0.offset + 4 * foo_~i~0#1) <= #length[~b~0.base] && 0 <= ~b~0.offset + 4 * foo_~i~0#1); {2905#false} is VALID [2022-02-20 23:43:59,480 INFO L290 TraceCheckUtils]: 27: Hoare triple {2905#false} assume !!(foo_~i~0#1 < 32767); {2905#false} is VALID [2022-02-20 23:43:59,481 INFO L290 TraceCheckUtils]: 26: Hoare triple {2905#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {2905#false} is VALID [2022-02-20 23:43:59,481 INFO L290 TraceCheckUtils]: 25: Hoare triple {2905#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {2905#false} is VALID [2022-02-20 23:43:59,481 INFO L290 TraceCheckUtils]: 24: Hoare triple {2905#false} assume !!(foo_~i~0#1 < 32767); {2905#false} is VALID [2022-02-20 23:43:59,481 INFO L290 TraceCheckUtils]: 23: Hoare triple {2905#false} foo_~i~0#1 := 0; {2905#false} is VALID [2022-02-20 23:43:59,487 INFO L290 TraceCheckUtils]: 22: Hoare triple {3026#(< |ULTIMATE.start_foo_~i~0#1| ~n~0)} assume !(foo_~i~0#1 < ~n~0); {2905#false} is VALID [2022-02-20 23:43:59,499 INFO L290 TraceCheckUtils]: 21: Hoare triple {3030#(< (+ |ULTIMATE.start_foo_~i~0#1| 1) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {3026#(< |ULTIMATE.start_foo_~i~0#1| ~n~0)} is VALID [2022-02-20 23:43:59,499 INFO L290 TraceCheckUtils]: 20: Hoare triple {3030#(< (+ |ULTIMATE.start_foo_~i~0#1| 1) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {3030#(< (+ |ULTIMATE.start_foo_~i~0#1| 1) ~n~0)} is VALID [2022-02-20 23:43:59,500 INFO L290 TraceCheckUtils]: 19: Hoare triple {3030#(< (+ |ULTIMATE.start_foo_~i~0#1| 1) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {3030#(< (+ |ULTIMATE.start_foo_~i~0#1| 1) ~n~0)} is VALID [2022-02-20 23:43:59,500 INFO L290 TraceCheckUtils]: 18: Hoare triple {3040#(< (+ |ULTIMATE.start_foo_~i~0#1| 2) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {3030#(< (+ |ULTIMATE.start_foo_~i~0#1| 1) ~n~0)} is VALID [2022-02-20 23:43:59,501 INFO L290 TraceCheckUtils]: 17: Hoare triple {3040#(< (+ |ULTIMATE.start_foo_~i~0#1| 2) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {3040#(< (+ |ULTIMATE.start_foo_~i~0#1| 2) ~n~0)} is VALID [2022-02-20 23:43:59,501 INFO L290 TraceCheckUtils]: 16: Hoare triple {3040#(< (+ |ULTIMATE.start_foo_~i~0#1| 2) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {3040#(< (+ |ULTIMATE.start_foo_~i~0#1| 2) ~n~0)} is VALID [2022-02-20 23:43:59,501 INFO L290 TraceCheckUtils]: 15: Hoare triple {3050#(< (+ |ULTIMATE.start_foo_~i~0#1| 3) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {3040#(< (+ |ULTIMATE.start_foo_~i~0#1| 2) ~n~0)} is VALID [2022-02-20 23:43:59,502 INFO L290 TraceCheckUtils]: 14: Hoare triple {3050#(< (+ |ULTIMATE.start_foo_~i~0#1| 3) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {3050#(< (+ |ULTIMATE.start_foo_~i~0#1| 3) ~n~0)} is VALID [2022-02-20 23:43:59,502 INFO L290 TraceCheckUtils]: 13: Hoare triple {3050#(< (+ |ULTIMATE.start_foo_~i~0#1| 3) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {3050#(< (+ |ULTIMATE.start_foo_~i~0#1| 3) ~n~0)} is VALID [2022-02-20 23:43:59,503 INFO L290 TraceCheckUtils]: 12: Hoare triple {3060#(< (+ |ULTIMATE.start_foo_~i~0#1| 4) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {3050#(< (+ |ULTIMATE.start_foo_~i~0#1| 3) ~n~0)} is VALID [2022-02-20 23:43:59,503 INFO L290 TraceCheckUtils]: 11: Hoare triple {3060#(< (+ |ULTIMATE.start_foo_~i~0#1| 4) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {3060#(< (+ |ULTIMATE.start_foo_~i~0#1| 4) ~n~0)} is VALID [2022-02-20 23:43:59,503 INFO L290 TraceCheckUtils]: 10: Hoare triple {3060#(< (+ |ULTIMATE.start_foo_~i~0#1| 4) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {3060#(< (+ |ULTIMATE.start_foo_~i~0#1| 4) ~n~0)} is VALID [2022-02-20 23:43:59,504 INFO L290 TraceCheckUtils]: 9: Hoare triple {3070#(< (+ |ULTIMATE.start_foo_~i~0#1| 5) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {3060#(< (+ |ULTIMATE.start_foo_~i~0#1| 4) ~n~0)} is VALID [2022-02-20 23:43:59,504 INFO L290 TraceCheckUtils]: 8: Hoare triple {3070#(< (+ |ULTIMATE.start_foo_~i~0#1| 5) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {3070#(< (+ |ULTIMATE.start_foo_~i~0#1| 5) ~n~0)} is VALID [2022-02-20 23:43:59,504 INFO L290 TraceCheckUtils]: 7: Hoare triple {3070#(< (+ |ULTIMATE.start_foo_~i~0#1| 5) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {3070#(< (+ |ULTIMATE.start_foo_~i~0#1| 5) ~n~0)} is VALID [2022-02-20 23:43:59,505 INFO L290 TraceCheckUtils]: 6: Hoare triple {3080#(< (+ |ULTIMATE.start_foo_~i~0#1| 6) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {3070#(< (+ |ULTIMATE.start_foo_~i~0#1| 5) ~n~0)} is VALID [2022-02-20 23:43:59,505 INFO L290 TraceCheckUtils]: 5: Hoare triple {3080#(< (+ |ULTIMATE.start_foo_~i~0#1| 6) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {3080#(< (+ |ULTIMATE.start_foo_~i~0#1| 6) ~n~0)} is VALID [2022-02-20 23:43:59,505 INFO L290 TraceCheckUtils]: 4: Hoare triple {3080#(< (+ |ULTIMATE.start_foo_~i~0#1| 6) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {3080#(< (+ |ULTIMATE.start_foo_~i~0#1| 6) ~n~0)} is VALID [2022-02-20 23:43:59,506 INFO L290 TraceCheckUtils]: 3: Hoare triple {3090#(< 6 ~n~0)} havoc main_#t~post7#1.base, main_#t~post7#1.offset;assume { :begin_inline_foo } true;havoc foo_#t~post3#1, foo_#t~post4#1, foo_~i~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {3080#(< (+ |ULTIMATE.start_foo_~i~0#1| 6) ~n~0)} is VALID [2022-02-20 23:43:59,506 INFO L290 TraceCheckUtils]: 2: Hoare triple {3090#(< 6 ~n~0)} SUMMARY for call write~int(0, main_#t~post7#1.base, main_#t~post7#1.offset, 4); srcloc: L538 {3090#(< 6 ~n~0)} is VALID [2022-02-20 23:43:59,507 INFO L290 TraceCheckUtils]: 1: Hoare triple {2904#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~post7#1.base, main_#t~post7#1.offset, main_#t~mem8#1;~n~0 := 32768;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~a~0.base, ~a~0.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~b~0.base, ~b~0.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_#t~post7#1.base, main_#t~post7#1.offset := ~b~0.base, ~b~0.offset;~b~0.base, ~b~0.offset := main_#t~post7#1.base, 4 + main_#t~post7#1.offset; {3090#(< 6 ~n~0)} is VALID [2022-02-20 23:43:59,507 INFO L290 TraceCheckUtils]: 0: Hoare triple {2904#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);~a~0.base, ~a~0.offset := 0, 0;~b~0.base, ~b~0.offset := 0, 0;~n~0 := 0; {2904#true} is VALID [2022-02-20 23:43:59,509 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 23:43:59,509 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1590061138] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:43:59,509 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:43:59,509 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2022-02-20 23:43:59,509 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715893671] [2022-02-20 23:43:59,509 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:43:59,510 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.8) internal successors, (70), 25 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-02-20 23:43:59,510 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:43:59,511 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 2.8) internal successors, (70), 25 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:59,554 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:59,554 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-02-20 23:43:59,554 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:43:59,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-02-20 23:43:59,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=341, Unknown=0, NotChecked=0, Total=600 [2022-02-20 23:43:59,555 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand has 25 states, 25 states have (on average 2.8) internal successors, (70), 25 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:00,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:00,185 INFO L93 Difference]: Finished difference Result 247 states and 248 transitions. [2022-02-20 23:44:00,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-20 23:44:00,185 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.8) internal successors, (70), 25 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-02-20 23:44:00,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:00,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.8) internal successors, (70), 25 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:00,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 261 transitions. [2022-02-20 23:44:00,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.8) internal successors, (70), 25 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:00,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 261 transitions. [2022-02-20 23:44:00,190 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 261 transitions. [2022-02-20 23:44:00,358 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 261 edges. 261 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:00,361 INFO L225 Difference]: With dead ends: 247 [2022-02-20 23:44:00,361 INFO L226 Difference]: Without dead ends: 247 [2022-02-20 23:44:00,361 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=392, Invalid=600, Unknown=0, NotChecked=0, Total=992 [2022-02-20 23:44:00,362 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 787 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 787 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:00,362 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [787 Valid, 168 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:44:00,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-02-20 23:44:00,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 92. [2022-02-20 23:44:00,364 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:00,364 INFO L82 GeneralOperation]: Start isEquivalent. First operand 247 states. Second operand has 92 states, 85 states have (on average 1.1529411764705881) internal successors, (98), 91 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:00,365 INFO L74 IsIncluded]: Start isIncluded. First operand 247 states. Second operand has 92 states, 85 states have (on average 1.1529411764705881) internal successors, (98), 91 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:00,365 INFO L87 Difference]: Start difference. First operand 247 states. Second operand has 92 states, 85 states have (on average 1.1529411764705881) internal successors, (98), 91 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:00,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:00,367 INFO L93 Difference]: Finished difference Result 247 states and 248 transitions. [2022-02-20 23:44:00,367 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 248 transitions. [2022-02-20 23:44:00,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:00,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:00,368 INFO L74 IsIncluded]: Start isIncluded. First operand has 92 states, 85 states have (on average 1.1529411764705881) internal successors, (98), 91 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 247 states. [2022-02-20 23:44:00,368 INFO L87 Difference]: Start difference. First operand has 92 states, 85 states have (on average 1.1529411764705881) internal successors, (98), 91 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 247 states. [2022-02-20 23:44:00,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:00,371 INFO L93 Difference]: Finished difference Result 247 states and 248 transitions. [2022-02-20 23:44:00,371 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 248 transitions. [2022-02-20 23:44:00,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:00,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:00,371 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:00,371 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:00,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 85 states have (on average 1.1529411764705881) internal successors, (98), 91 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:00,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 98 transitions. [2022-02-20 23:44:00,372 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 98 transitions. Word has length 29 [2022-02-20 23:44:00,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:00,372 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 98 transitions. [2022-02-20 23:44:00,372 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.8) internal successors, (70), 25 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:00,372 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 98 transitions. [2022-02-20 23:44:00,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-20 23:44:00,373 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:00,373 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 14, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:44:00,389 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-02-20 23:44:00,587 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-02-20 23:44:00,587 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2022-02-20 23:44:00,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:00,588 INFO L85 PathProgramCache]: Analyzing trace with hash -248790283, now seen corresponding path program 2 times [2022-02-20 23:44:00,588 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:44:00,588 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087248111] [2022-02-20 23:44:00,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:00,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:44:00,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:00,806 INFO L290 TraceCheckUtils]: 0: Hoare triple {3946#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);~a~0.base, ~a~0.offset := 0, 0;~b~0.base, ~b~0.offset := 0, 0;~n~0 := 0; {3946#true} is VALID [2022-02-20 23:44:00,806 INFO L290 TraceCheckUtils]: 1: Hoare triple {3946#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~post7#1.base, main_#t~post7#1.offset, main_#t~mem8#1;~n~0 := 32768;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~a~0.base, ~a~0.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~b~0.base, ~b~0.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_#t~post7#1.base, main_#t~post7#1.offset := ~b~0.base, ~b~0.offset;~b~0.base, ~b~0.offset := main_#t~post7#1.base, 4 + main_#t~post7#1.offset; {3948#(<= 32768 ~n~0)} is VALID [2022-02-20 23:44:00,807 INFO L290 TraceCheckUtils]: 2: Hoare triple {3948#(<= 32768 ~n~0)} SUMMARY for call write~int(0, main_#t~post7#1.base, main_#t~post7#1.offset, 4); srcloc: L538 {3948#(<= 32768 ~n~0)} is VALID [2022-02-20 23:44:00,807 INFO L290 TraceCheckUtils]: 3: Hoare triple {3948#(<= 32768 ~n~0)} havoc main_#t~post7#1.base, main_#t~post7#1.offset;assume { :begin_inline_foo } true;havoc foo_#t~post3#1, foo_#t~post4#1, foo_~i~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {3949#(and (= |ULTIMATE.start_foo_~i~0#1| 0) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:00,807 INFO L290 TraceCheckUtils]: 4: Hoare triple {3949#(and (= |ULTIMATE.start_foo_~i~0#1| 0) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {3949#(and (= |ULTIMATE.start_foo_~i~0#1| 0) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:00,808 INFO L290 TraceCheckUtils]: 5: Hoare triple {3949#(and (= |ULTIMATE.start_foo_~i~0#1| 0) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {3949#(and (= |ULTIMATE.start_foo_~i~0#1| 0) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:00,808 INFO L290 TraceCheckUtils]: 6: Hoare triple {3949#(and (= |ULTIMATE.start_foo_~i~0#1| 0) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {3950#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32767) ~n~0)} is VALID [2022-02-20 23:44:00,808 INFO L290 TraceCheckUtils]: 7: Hoare triple {3950#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32767) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {3950#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32767) ~n~0)} is VALID [2022-02-20 23:44:00,808 INFO L290 TraceCheckUtils]: 8: Hoare triple {3950#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32767) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {3950#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32767) ~n~0)} is VALID [2022-02-20 23:44:00,809 INFO L290 TraceCheckUtils]: 9: Hoare triple {3950#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32767) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {3951#(<= (+ 32766 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:00,810 INFO L290 TraceCheckUtils]: 10: Hoare triple {3951#(<= (+ 32766 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {3951#(<= (+ 32766 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:00,810 INFO L290 TraceCheckUtils]: 11: Hoare triple {3951#(<= (+ 32766 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {3951#(<= (+ 32766 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:00,810 INFO L290 TraceCheckUtils]: 12: Hoare triple {3951#(<= (+ 32766 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {3952#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32765) ~n~0)} is VALID [2022-02-20 23:44:00,810 INFO L290 TraceCheckUtils]: 13: Hoare triple {3952#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32765) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {3952#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32765) ~n~0)} is VALID [2022-02-20 23:44:00,811 INFO L290 TraceCheckUtils]: 14: Hoare triple {3952#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32765) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {3952#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32765) ~n~0)} is VALID [2022-02-20 23:44:00,811 INFO L290 TraceCheckUtils]: 15: Hoare triple {3952#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32765) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {3953#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32764) ~n~0)} is VALID [2022-02-20 23:44:00,811 INFO L290 TraceCheckUtils]: 16: Hoare triple {3953#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32764) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {3953#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32764) ~n~0)} is VALID [2022-02-20 23:44:00,812 INFO L290 TraceCheckUtils]: 17: Hoare triple {3953#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32764) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {3953#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32764) ~n~0)} is VALID [2022-02-20 23:44:00,812 INFO L290 TraceCheckUtils]: 18: Hoare triple {3953#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32764) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {3954#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32763) ~n~0)} is VALID [2022-02-20 23:44:00,813 INFO L290 TraceCheckUtils]: 19: Hoare triple {3954#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32763) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {3954#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32763) ~n~0)} is VALID [2022-02-20 23:44:00,813 INFO L290 TraceCheckUtils]: 20: Hoare triple {3954#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32763) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {3954#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32763) ~n~0)} is VALID [2022-02-20 23:44:00,813 INFO L290 TraceCheckUtils]: 21: Hoare triple {3954#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32763) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {3955#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32762) ~n~0)} is VALID [2022-02-20 23:44:00,813 INFO L290 TraceCheckUtils]: 22: Hoare triple {3955#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32762) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {3955#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32762) ~n~0)} is VALID [2022-02-20 23:44:00,814 INFO L290 TraceCheckUtils]: 23: Hoare triple {3955#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32762) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {3955#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32762) ~n~0)} is VALID [2022-02-20 23:44:00,814 INFO L290 TraceCheckUtils]: 24: Hoare triple {3955#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32762) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {3956#(<= (+ 32761 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:00,814 INFO L290 TraceCheckUtils]: 25: Hoare triple {3956#(<= (+ 32761 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {3956#(<= (+ 32761 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:00,815 INFO L290 TraceCheckUtils]: 26: Hoare triple {3956#(<= (+ 32761 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {3956#(<= (+ 32761 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:00,815 INFO L290 TraceCheckUtils]: 27: Hoare triple {3956#(<= (+ 32761 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {3957#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32760) ~n~0)} is VALID [2022-02-20 23:44:00,815 INFO L290 TraceCheckUtils]: 28: Hoare triple {3957#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32760) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {3957#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32760) ~n~0)} is VALID [2022-02-20 23:44:00,815 INFO L290 TraceCheckUtils]: 29: Hoare triple {3957#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32760) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {3957#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32760) ~n~0)} is VALID [2022-02-20 23:44:00,816 INFO L290 TraceCheckUtils]: 30: Hoare triple {3957#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32760) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {3958#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32759) ~n~0)} is VALID [2022-02-20 23:44:00,816 INFO L290 TraceCheckUtils]: 31: Hoare triple {3958#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32759) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {3958#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32759) ~n~0)} is VALID [2022-02-20 23:44:00,816 INFO L290 TraceCheckUtils]: 32: Hoare triple {3958#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32759) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {3958#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32759) ~n~0)} is VALID [2022-02-20 23:44:00,817 INFO L290 TraceCheckUtils]: 33: Hoare triple {3958#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32759) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {3959#(<= (+ 32758 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:00,817 INFO L290 TraceCheckUtils]: 34: Hoare triple {3959#(<= (+ 32758 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {3959#(<= (+ 32758 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:00,817 INFO L290 TraceCheckUtils]: 35: Hoare triple {3959#(<= (+ 32758 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {3959#(<= (+ 32758 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:00,818 INFO L290 TraceCheckUtils]: 36: Hoare triple {3959#(<= (+ 32758 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {3960#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32757) ~n~0)} is VALID [2022-02-20 23:44:00,818 INFO L290 TraceCheckUtils]: 37: Hoare triple {3960#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32757) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {3960#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32757) ~n~0)} is VALID [2022-02-20 23:44:00,819 INFO L290 TraceCheckUtils]: 38: Hoare triple {3960#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32757) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {3960#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32757) ~n~0)} is VALID [2022-02-20 23:44:00,819 INFO L290 TraceCheckUtils]: 39: Hoare triple {3960#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32757) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {3961#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32756) ~n~0)} is VALID [2022-02-20 23:44:00,819 INFO L290 TraceCheckUtils]: 40: Hoare triple {3961#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32756) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {3961#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32756) ~n~0)} is VALID [2022-02-20 23:44:00,820 INFO L290 TraceCheckUtils]: 41: Hoare triple {3961#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32756) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {3961#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32756) ~n~0)} is VALID [2022-02-20 23:44:00,820 INFO L290 TraceCheckUtils]: 42: Hoare triple {3961#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32756) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {3962#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32755) ~n~0)} is VALID [2022-02-20 23:44:00,821 INFO L290 TraceCheckUtils]: 43: Hoare triple {3962#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32755) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {3962#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32755) ~n~0)} is VALID [2022-02-20 23:44:00,821 INFO L290 TraceCheckUtils]: 44: Hoare triple {3962#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32755) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {3962#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32755) ~n~0)} is VALID [2022-02-20 23:44:00,821 INFO L290 TraceCheckUtils]: 45: Hoare triple {3962#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32755) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {3963#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32754) ~n~0)} is VALID [2022-02-20 23:44:00,822 INFO L290 TraceCheckUtils]: 46: Hoare triple {3963#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32754) ~n~0)} assume !(foo_~i~0#1 < ~n~0); {3947#false} is VALID [2022-02-20 23:44:00,822 INFO L290 TraceCheckUtils]: 47: Hoare triple {3947#false} foo_~i~0#1 := 0; {3947#false} is VALID [2022-02-20 23:44:00,822 INFO L290 TraceCheckUtils]: 48: Hoare triple {3947#false} assume !!(foo_~i~0#1 < 32767); {3947#false} is VALID [2022-02-20 23:44:00,822 INFO L290 TraceCheckUtils]: 49: Hoare triple {3947#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {3947#false} is VALID [2022-02-20 23:44:00,822 INFO L290 TraceCheckUtils]: 50: Hoare triple {3947#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {3947#false} is VALID [2022-02-20 23:44:00,822 INFO L290 TraceCheckUtils]: 51: Hoare triple {3947#false} assume !!(foo_~i~0#1 < 32767); {3947#false} is VALID [2022-02-20 23:44:00,822 INFO L290 TraceCheckUtils]: 52: Hoare triple {3947#false} assume !(4 + (~b~0.offset + 4 * foo_~i~0#1) <= #length[~b~0.base] && 0 <= ~b~0.offset + 4 * foo_~i~0#1); {3947#false} is VALID [2022-02-20 23:44:00,822 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 23:44:00,822 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:44:00,822 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087248111] [2022-02-20 23:44:00,823 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087248111] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:44:00,823 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432382420] [2022-02-20 23:44:00,823 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 23:44:00,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:44:00,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:44:00,824 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-02-20 23:44:00,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-02-20 23:44:00,904 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 23:44:00,905 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 23:44:00,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 17 conjunts are in the unsatisfiable core [2022-02-20 23:44:00,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:00,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:44:01,496 INFO L290 TraceCheckUtils]: 0: Hoare triple {3946#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);~a~0.base, ~a~0.offset := 0, 0;~b~0.base, ~b~0.offset := 0, 0;~n~0 := 0; {3946#true} is VALID [2022-02-20 23:44:01,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {3946#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~post7#1.base, main_#t~post7#1.offset, main_#t~mem8#1;~n~0 := 32768;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~a~0.base, ~a~0.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~b~0.base, ~b~0.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_#t~post7#1.base, main_#t~post7#1.offset := ~b~0.base, ~b~0.offset;~b~0.base, ~b~0.offset := main_#t~post7#1.base, 4 + main_#t~post7#1.offset; {3948#(<= 32768 ~n~0)} is VALID [2022-02-20 23:44:01,497 INFO L290 TraceCheckUtils]: 2: Hoare triple {3948#(<= 32768 ~n~0)} SUMMARY for call write~int(0, main_#t~post7#1.base, main_#t~post7#1.offset, 4); srcloc: L538 {3948#(<= 32768 ~n~0)} is VALID [2022-02-20 23:44:01,497 INFO L290 TraceCheckUtils]: 3: Hoare triple {3948#(<= 32768 ~n~0)} havoc main_#t~post7#1.base, main_#t~post7#1.offset;assume { :begin_inline_foo } true;havoc foo_#t~post3#1, foo_#t~post4#1, foo_~i~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {3976#(and (<= |ULTIMATE.start_foo_~i~0#1| 0) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:01,497 INFO L290 TraceCheckUtils]: 4: Hoare triple {3976#(and (<= |ULTIMATE.start_foo_~i~0#1| 0) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {3976#(and (<= |ULTIMATE.start_foo_~i~0#1| 0) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:01,498 INFO L290 TraceCheckUtils]: 5: Hoare triple {3976#(and (<= |ULTIMATE.start_foo_~i~0#1| 0) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {3976#(and (<= |ULTIMATE.start_foo_~i~0#1| 0) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:01,498 INFO L290 TraceCheckUtils]: 6: Hoare triple {3976#(and (<= |ULTIMATE.start_foo_~i~0#1| 0) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {3986#(and (<= |ULTIMATE.start_foo_~i~0#1| 1) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:01,499 INFO L290 TraceCheckUtils]: 7: Hoare triple {3986#(and (<= |ULTIMATE.start_foo_~i~0#1| 1) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {3986#(and (<= |ULTIMATE.start_foo_~i~0#1| 1) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:01,500 INFO L290 TraceCheckUtils]: 8: Hoare triple {3986#(and (<= |ULTIMATE.start_foo_~i~0#1| 1) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {3986#(and (<= |ULTIMATE.start_foo_~i~0#1| 1) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:01,500 INFO L290 TraceCheckUtils]: 9: Hoare triple {3986#(and (<= |ULTIMATE.start_foo_~i~0#1| 1) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {3996#(and (<= |ULTIMATE.start_foo_~i~0#1| 2) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:01,501 INFO L290 TraceCheckUtils]: 10: Hoare triple {3996#(and (<= |ULTIMATE.start_foo_~i~0#1| 2) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {3996#(and (<= |ULTIMATE.start_foo_~i~0#1| 2) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:01,501 INFO L290 TraceCheckUtils]: 11: Hoare triple {3996#(and (<= |ULTIMATE.start_foo_~i~0#1| 2) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {3996#(and (<= |ULTIMATE.start_foo_~i~0#1| 2) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:01,502 INFO L290 TraceCheckUtils]: 12: Hoare triple {3996#(and (<= |ULTIMATE.start_foo_~i~0#1| 2) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {4006#(and (<= |ULTIMATE.start_foo_~i~0#1| 3) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:01,502 INFO L290 TraceCheckUtils]: 13: Hoare triple {4006#(and (<= |ULTIMATE.start_foo_~i~0#1| 3) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {4006#(and (<= |ULTIMATE.start_foo_~i~0#1| 3) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:01,502 INFO L290 TraceCheckUtils]: 14: Hoare triple {4006#(and (<= |ULTIMATE.start_foo_~i~0#1| 3) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {4006#(and (<= |ULTIMATE.start_foo_~i~0#1| 3) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:01,503 INFO L290 TraceCheckUtils]: 15: Hoare triple {4006#(and (<= |ULTIMATE.start_foo_~i~0#1| 3) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {4016#(and (<= |ULTIMATE.start_foo_~i~0#1| 4) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:01,503 INFO L290 TraceCheckUtils]: 16: Hoare triple {4016#(and (<= |ULTIMATE.start_foo_~i~0#1| 4) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {4016#(and (<= |ULTIMATE.start_foo_~i~0#1| 4) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:01,504 INFO L290 TraceCheckUtils]: 17: Hoare triple {4016#(and (<= |ULTIMATE.start_foo_~i~0#1| 4) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {4016#(and (<= |ULTIMATE.start_foo_~i~0#1| 4) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:01,504 INFO L290 TraceCheckUtils]: 18: Hoare triple {4016#(and (<= |ULTIMATE.start_foo_~i~0#1| 4) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {4026#(and (<= |ULTIMATE.start_foo_~i~0#1| 5) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:01,505 INFO L290 TraceCheckUtils]: 19: Hoare triple {4026#(and (<= |ULTIMATE.start_foo_~i~0#1| 5) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {4026#(and (<= |ULTIMATE.start_foo_~i~0#1| 5) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:01,505 INFO L290 TraceCheckUtils]: 20: Hoare triple {4026#(and (<= |ULTIMATE.start_foo_~i~0#1| 5) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {4026#(and (<= |ULTIMATE.start_foo_~i~0#1| 5) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:01,505 INFO L290 TraceCheckUtils]: 21: Hoare triple {4026#(and (<= |ULTIMATE.start_foo_~i~0#1| 5) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {4036#(and (<= |ULTIMATE.start_foo_~i~0#1| 6) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:01,506 INFO L290 TraceCheckUtils]: 22: Hoare triple {4036#(and (<= |ULTIMATE.start_foo_~i~0#1| 6) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {4036#(and (<= |ULTIMATE.start_foo_~i~0#1| 6) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:01,506 INFO L290 TraceCheckUtils]: 23: Hoare triple {4036#(and (<= |ULTIMATE.start_foo_~i~0#1| 6) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {4036#(and (<= |ULTIMATE.start_foo_~i~0#1| 6) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:01,507 INFO L290 TraceCheckUtils]: 24: Hoare triple {4036#(and (<= |ULTIMATE.start_foo_~i~0#1| 6) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {4046#(and (<= |ULTIMATE.start_foo_~i~0#1| 7) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:01,507 INFO L290 TraceCheckUtils]: 25: Hoare triple {4046#(and (<= |ULTIMATE.start_foo_~i~0#1| 7) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {4046#(and (<= |ULTIMATE.start_foo_~i~0#1| 7) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:01,508 INFO L290 TraceCheckUtils]: 26: Hoare triple {4046#(and (<= |ULTIMATE.start_foo_~i~0#1| 7) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {4046#(and (<= |ULTIMATE.start_foo_~i~0#1| 7) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:01,508 INFO L290 TraceCheckUtils]: 27: Hoare triple {4046#(and (<= |ULTIMATE.start_foo_~i~0#1| 7) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {4056#(and (<= |ULTIMATE.start_foo_~i~0#1| 8) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:01,508 INFO L290 TraceCheckUtils]: 28: Hoare triple {4056#(and (<= |ULTIMATE.start_foo_~i~0#1| 8) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {4056#(and (<= |ULTIMATE.start_foo_~i~0#1| 8) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:01,509 INFO L290 TraceCheckUtils]: 29: Hoare triple {4056#(and (<= |ULTIMATE.start_foo_~i~0#1| 8) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {4056#(and (<= |ULTIMATE.start_foo_~i~0#1| 8) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:01,509 INFO L290 TraceCheckUtils]: 30: Hoare triple {4056#(and (<= |ULTIMATE.start_foo_~i~0#1| 8) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {4066#(and (<= |ULTIMATE.start_foo_~i~0#1| 9) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:01,510 INFO L290 TraceCheckUtils]: 31: Hoare triple {4066#(and (<= |ULTIMATE.start_foo_~i~0#1| 9) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {4066#(and (<= |ULTIMATE.start_foo_~i~0#1| 9) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:01,510 INFO L290 TraceCheckUtils]: 32: Hoare triple {4066#(and (<= |ULTIMATE.start_foo_~i~0#1| 9) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {4066#(and (<= |ULTIMATE.start_foo_~i~0#1| 9) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:01,510 INFO L290 TraceCheckUtils]: 33: Hoare triple {4066#(and (<= |ULTIMATE.start_foo_~i~0#1| 9) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {4076#(and (<= 32768 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 10))} is VALID [2022-02-20 23:44:01,511 INFO L290 TraceCheckUtils]: 34: Hoare triple {4076#(and (<= 32768 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 10))} assume !!(foo_~i~0#1 < ~n~0); {4076#(and (<= 32768 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 10))} is VALID [2022-02-20 23:44:01,511 INFO L290 TraceCheckUtils]: 35: Hoare triple {4076#(and (<= 32768 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 10))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {4076#(and (<= 32768 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 10))} is VALID [2022-02-20 23:44:01,512 INFO L290 TraceCheckUtils]: 36: Hoare triple {4076#(and (<= 32768 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 10))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {4086#(and (<= |ULTIMATE.start_foo_~i~0#1| 11) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:01,513 INFO L290 TraceCheckUtils]: 37: Hoare triple {4086#(and (<= |ULTIMATE.start_foo_~i~0#1| 11) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {4086#(and (<= |ULTIMATE.start_foo_~i~0#1| 11) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:01,513 INFO L290 TraceCheckUtils]: 38: Hoare triple {4086#(and (<= |ULTIMATE.start_foo_~i~0#1| 11) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {4086#(and (<= |ULTIMATE.start_foo_~i~0#1| 11) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:01,513 INFO L290 TraceCheckUtils]: 39: Hoare triple {4086#(and (<= |ULTIMATE.start_foo_~i~0#1| 11) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {4096#(and (<= |ULTIMATE.start_foo_~i~0#1| 12) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:01,518 INFO L290 TraceCheckUtils]: 40: Hoare triple {4096#(and (<= |ULTIMATE.start_foo_~i~0#1| 12) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {4096#(and (<= |ULTIMATE.start_foo_~i~0#1| 12) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:01,519 INFO L290 TraceCheckUtils]: 41: Hoare triple {4096#(and (<= |ULTIMATE.start_foo_~i~0#1| 12) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {4096#(and (<= |ULTIMATE.start_foo_~i~0#1| 12) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:01,519 INFO L290 TraceCheckUtils]: 42: Hoare triple {4096#(and (<= |ULTIMATE.start_foo_~i~0#1| 12) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {4106#(and (<= |ULTIMATE.start_foo_~i~0#1| 13) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:01,519 INFO L290 TraceCheckUtils]: 43: Hoare triple {4106#(and (<= |ULTIMATE.start_foo_~i~0#1| 13) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {4106#(and (<= |ULTIMATE.start_foo_~i~0#1| 13) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:01,520 INFO L290 TraceCheckUtils]: 44: Hoare triple {4106#(and (<= |ULTIMATE.start_foo_~i~0#1| 13) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {4106#(and (<= |ULTIMATE.start_foo_~i~0#1| 13) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:01,520 INFO L290 TraceCheckUtils]: 45: Hoare triple {4106#(and (<= |ULTIMATE.start_foo_~i~0#1| 13) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {4116#(and (<= |ULTIMATE.start_foo_~i~0#1| 14) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:01,521 INFO L290 TraceCheckUtils]: 46: Hoare triple {4116#(and (<= |ULTIMATE.start_foo_~i~0#1| 14) (<= 32768 ~n~0))} assume !(foo_~i~0#1 < ~n~0); {3947#false} is VALID [2022-02-20 23:44:01,521 INFO L290 TraceCheckUtils]: 47: Hoare triple {3947#false} foo_~i~0#1 := 0; {3947#false} is VALID [2022-02-20 23:44:01,521 INFO L290 TraceCheckUtils]: 48: Hoare triple {3947#false} assume !!(foo_~i~0#1 < 32767); {3947#false} is VALID [2022-02-20 23:44:01,521 INFO L290 TraceCheckUtils]: 49: Hoare triple {3947#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {3947#false} is VALID [2022-02-20 23:44:01,521 INFO L290 TraceCheckUtils]: 50: Hoare triple {3947#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {3947#false} is VALID [2022-02-20 23:44:01,521 INFO L290 TraceCheckUtils]: 51: Hoare triple {3947#false} assume !!(foo_~i~0#1 < 32767); {3947#false} is VALID [2022-02-20 23:44:01,521 INFO L290 TraceCheckUtils]: 52: Hoare triple {3947#false} assume !(4 + (~b~0.offset + 4 * foo_~i~0#1) <= #length[~b~0.base] && 0 <= ~b~0.offset + 4 * foo_~i~0#1); {3947#false} is VALID [2022-02-20 23:44:01,521 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 23:44:01,522 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:44:02,046 INFO L290 TraceCheckUtils]: 52: Hoare triple {3947#false} assume !(4 + (~b~0.offset + 4 * foo_~i~0#1) <= #length[~b~0.base] && 0 <= ~b~0.offset + 4 * foo_~i~0#1); {3947#false} is VALID [2022-02-20 23:44:02,046 INFO L290 TraceCheckUtils]: 51: Hoare triple {3947#false} assume !!(foo_~i~0#1 < 32767); {3947#false} is VALID [2022-02-20 23:44:02,046 INFO L290 TraceCheckUtils]: 50: Hoare triple {3947#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {3947#false} is VALID [2022-02-20 23:44:02,046 INFO L290 TraceCheckUtils]: 49: Hoare triple {3947#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {3947#false} is VALID [2022-02-20 23:44:02,046 INFO L290 TraceCheckUtils]: 48: Hoare triple {3947#false} assume !!(foo_~i~0#1 < 32767); {3947#false} is VALID [2022-02-20 23:44:02,046 INFO L290 TraceCheckUtils]: 47: Hoare triple {3947#false} foo_~i~0#1 := 0; {3947#false} is VALID [2022-02-20 23:44:02,047 INFO L290 TraceCheckUtils]: 46: Hoare triple {4156#(< |ULTIMATE.start_foo_~i~0#1| ~n~0)} assume !(foo_~i~0#1 < ~n~0); {3947#false} is VALID [2022-02-20 23:44:02,047 INFO L290 TraceCheckUtils]: 45: Hoare triple {4160#(< (+ |ULTIMATE.start_foo_~i~0#1| 1) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {4156#(< |ULTIMATE.start_foo_~i~0#1| ~n~0)} is VALID [2022-02-20 23:44:02,047 INFO L290 TraceCheckUtils]: 44: Hoare triple {4160#(< (+ |ULTIMATE.start_foo_~i~0#1| 1) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {4160#(< (+ |ULTIMATE.start_foo_~i~0#1| 1) ~n~0)} is VALID [2022-02-20 23:44:02,048 INFO L290 TraceCheckUtils]: 43: Hoare triple {4160#(< (+ |ULTIMATE.start_foo_~i~0#1| 1) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {4160#(< (+ |ULTIMATE.start_foo_~i~0#1| 1) ~n~0)} is VALID [2022-02-20 23:44:02,048 INFO L290 TraceCheckUtils]: 42: Hoare triple {4170#(< (+ |ULTIMATE.start_foo_~i~0#1| 2) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {4160#(< (+ |ULTIMATE.start_foo_~i~0#1| 1) ~n~0)} is VALID [2022-02-20 23:44:02,049 INFO L290 TraceCheckUtils]: 41: Hoare triple {4170#(< (+ |ULTIMATE.start_foo_~i~0#1| 2) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {4170#(< (+ |ULTIMATE.start_foo_~i~0#1| 2) ~n~0)} is VALID [2022-02-20 23:44:02,049 INFO L290 TraceCheckUtils]: 40: Hoare triple {4170#(< (+ |ULTIMATE.start_foo_~i~0#1| 2) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {4170#(< (+ |ULTIMATE.start_foo_~i~0#1| 2) ~n~0)} is VALID [2022-02-20 23:44:02,049 INFO L290 TraceCheckUtils]: 39: Hoare triple {4180#(< (+ |ULTIMATE.start_foo_~i~0#1| 3) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {4170#(< (+ |ULTIMATE.start_foo_~i~0#1| 2) ~n~0)} is VALID [2022-02-20 23:44:02,050 INFO L290 TraceCheckUtils]: 38: Hoare triple {4180#(< (+ |ULTIMATE.start_foo_~i~0#1| 3) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {4180#(< (+ |ULTIMATE.start_foo_~i~0#1| 3) ~n~0)} is VALID [2022-02-20 23:44:02,050 INFO L290 TraceCheckUtils]: 37: Hoare triple {4180#(< (+ |ULTIMATE.start_foo_~i~0#1| 3) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {4180#(< (+ |ULTIMATE.start_foo_~i~0#1| 3) ~n~0)} is VALID [2022-02-20 23:44:02,051 INFO L290 TraceCheckUtils]: 36: Hoare triple {4190#(< (+ |ULTIMATE.start_foo_~i~0#1| 4) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {4180#(< (+ |ULTIMATE.start_foo_~i~0#1| 3) ~n~0)} is VALID [2022-02-20 23:44:02,051 INFO L290 TraceCheckUtils]: 35: Hoare triple {4190#(< (+ |ULTIMATE.start_foo_~i~0#1| 4) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {4190#(< (+ |ULTIMATE.start_foo_~i~0#1| 4) ~n~0)} is VALID [2022-02-20 23:44:02,051 INFO L290 TraceCheckUtils]: 34: Hoare triple {4190#(< (+ |ULTIMATE.start_foo_~i~0#1| 4) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {4190#(< (+ |ULTIMATE.start_foo_~i~0#1| 4) ~n~0)} is VALID [2022-02-20 23:44:02,052 INFO L290 TraceCheckUtils]: 33: Hoare triple {4200#(< (+ |ULTIMATE.start_foo_~i~0#1| 5) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {4190#(< (+ |ULTIMATE.start_foo_~i~0#1| 4) ~n~0)} is VALID [2022-02-20 23:44:02,052 INFO L290 TraceCheckUtils]: 32: Hoare triple {4200#(< (+ |ULTIMATE.start_foo_~i~0#1| 5) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {4200#(< (+ |ULTIMATE.start_foo_~i~0#1| 5) ~n~0)} is VALID [2022-02-20 23:44:02,053 INFO L290 TraceCheckUtils]: 31: Hoare triple {4200#(< (+ |ULTIMATE.start_foo_~i~0#1| 5) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {4200#(< (+ |ULTIMATE.start_foo_~i~0#1| 5) ~n~0)} is VALID [2022-02-20 23:44:02,053 INFO L290 TraceCheckUtils]: 30: Hoare triple {4210#(< (+ |ULTIMATE.start_foo_~i~0#1| 6) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {4200#(< (+ |ULTIMATE.start_foo_~i~0#1| 5) ~n~0)} is VALID [2022-02-20 23:44:02,054 INFO L290 TraceCheckUtils]: 29: Hoare triple {4210#(< (+ |ULTIMATE.start_foo_~i~0#1| 6) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {4210#(< (+ |ULTIMATE.start_foo_~i~0#1| 6) ~n~0)} is VALID [2022-02-20 23:44:02,054 INFO L290 TraceCheckUtils]: 28: Hoare triple {4210#(< (+ |ULTIMATE.start_foo_~i~0#1| 6) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {4210#(< (+ |ULTIMATE.start_foo_~i~0#1| 6) ~n~0)} is VALID [2022-02-20 23:44:02,054 INFO L290 TraceCheckUtils]: 27: Hoare triple {4220#(< (+ 7 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {4210#(< (+ |ULTIMATE.start_foo_~i~0#1| 6) ~n~0)} is VALID [2022-02-20 23:44:02,055 INFO L290 TraceCheckUtils]: 26: Hoare triple {4220#(< (+ 7 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {4220#(< (+ 7 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:02,055 INFO L290 TraceCheckUtils]: 25: Hoare triple {4220#(< (+ 7 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {4220#(< (+ 7 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:02,055 INFO L290 TraceCheckUtils]: 24: Hoare triple {4230#(< (+ |ULTIMATE.start_foo_~i~0#1| 8) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {4220#(< (+ 7 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:02,056 INFO L290 TraceCheckUtils]: 23: Hoare triple {4230#(< (+ |ULTIMATE.start_foo_~i~0#1| 8) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {4230#(< (+ |ULTIMATE.start_foo_~i~0#1| 8) ~n~0)} is VALID [2022-02-20 23:44:02,056 INFO L290 TraceCheckUtils]: 22: Hoare triple {4230#(< (+ |ULTIMATE.start_foo_~i~0#1| 8) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {4230#(< (+ |ULTIMATE.start_foo_~i~0#1| 8) ~n~0)} is VALID [2022-02-20 23:44:02,057 INFO L290 TraceCheckUtils]: 21: Hoare triple {4240#(< (+ |ULTIMATE.start_foo_~i~0#1| 9) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {4230#(< (+ |ULTIMATE.start_foo_~i~0#1| 8) ~n~0)} is VALID [2022-02-20 23:44:02,057 INFO L290 TraceCheckUtils]: 20: Hoare triple {4240#(< (+ |ULTIMATE.start_foo_~i~0#1| 9) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {4240#(< (+ |ULTIMATE.start_foo_~i~0#1| 9) ~n~0)} is VALID [2022-02-20 23:44:02,057 INFO L290 TraceCheckUtils]: 19: Hoare triple {4240#(< (+ |ULTIMATE.start_foo_~i~0#1| 9) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {4240#(< (+ |ULTIMATE.start_foo_~i~0#1| 9) ~n~0)} is VALID [2022-02-20 23:44:02,058 INFO L290 TraceCheckUtils]: 18: Hoare triple {4250#(< (+ |ULTIMATE.start_foo_~i~0#1| 10) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {4240#(< (+ |ULTIMATE.start_foo_~i~0#1| 9) ~n~0)} is VALID [2022-02-20 23:44:02,058 INFO L290 TraceCheckUtils]: 17: Hoare triple {4250#(< (+ |ULTIMATE.start_foo_~i~0#1| 10) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {4250#(< (+ |ULTIMATE.start_foo_~i~0#1| 10) ~n~0)} is VALID [2022-02-20 23:44:02,058 INFO L290 TraceCheckUtils]: 16: Hoare triple {4250#(< (+ |ULTIMATE.start_foo_~i~0#1| 10) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {4250#(< (+ |ULTIMATE.start_foo_~i~0#1| 10) ~n~0)} is VALID [2022-02-20 23:44:02,059 INFO L290 TraceCheckUtils]: 15: Hoare triple {4260#(< (+ |ULTIMATE.start_foo_~i~0#1| 11) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {4250#(< (+ |ULTIMATE.start_foo_~i~0#1| 10) ~n~0)} is VALID [2022-02-20 23:44:02,059 INFO L290 TraceCheckUtils]: 14: Hoare triple {4260#(< (+ |ULTIMATE.start_foo_~i~0#1| 11) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {4260#(< (+ |ULTIMATE.start_foo_~i~0#1| 11) ~n~0)} is VALID [2022-02-20 23:44:02,059 INFO L290 TraceCheckUtils]: 13: Hoare triple {4260#(< (+ |ULTIMATE.start_foo_~i~0#1| 11) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {4260#(< (+ |ULTIMATE.start_foo_~i~0#1| 11) ~n~0)} is VALID [2022-02-20 23:44:02,060 INFO L290 TraceCheckUtils]: 12: Hoare triple {4270#(< (+ |ULTIMATE.start_foo_~i~0#1| 12) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {4260#(< (+ |ULTIMATE.start_foo_~i~0#1| 11) ~n~0)} is VALID [2022-02-20 23:44:02,060 INFO L290 TraceCheckUtils]: 11: Hoare triple {4270#(< (+ |ULTIMATE.start_foo_~i~0#1| 12) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {4270#(< (+ |ULTIMATE.start_foo_~i~0#1| 12) ~n~0)} is VALID [2022-02-20 23:44:02,061 INFO L290 TraceCheckUtils]: 10: Hoare triple {4270#(< (+ |ULTIMATE.start_foo_~i~0#1| 12) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {4270#(< (+ |ULTIMATE.start_foo_~i~0#1| 12) ~n~0)} is VALID [2022-02-20 23:44:02,061 INFO L290 TraceCheckUtils]: 9: Hoare triple {4280#(< (+ |ULTIMATE.start_foo_~i~0#1| 13) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {4270#(< (+ |ULTIMATE.start_foo_~i~0#1| 12) ~n~0)} is VALID [2022-02-20 23:44:02,061 INFO L290 TraceCheckUtils]: 8: Hoare triple {4280#(< (+ |ULTIMATE.start_foo_~i~0#1| 13) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {4280#(< (+ |ULTIMATE.start_foo_~i~0#1| 13) ~n~0)} is VALID [2022-02-20 23:44:02,062 INFO L290 TraceCheckUtils]: 7: Hoare triple {4280#(< (+ |ULTIMATE.start_foo_~i~0#1| 13) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {4280#(< (+ |ULTIMATE.start_foo_~i~0#1| 13) ~n~0)} is VALID [2022-02-20 23:44:02,062 INFO L290 TraceCheckUtils]: 6: Hoare triple {4290#(< (+ |ULTIMATE.start_foo_~i~0#1| 14) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {4280#(< (+ |ULTIMATE.start_foo_~i~0#1| 13) ~n~0)} is VALID [2022-02-20 23:44:02,063 INFO L290 TraceCheckUtils]: 5: Hoare triple {4290#(< (+ |ULTIMATE.start_foo_~i~0#1| 14) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {4290#(< (+ |ULTIMATE.start_foo_~i~0#1| 14) ~n~0)} is VALID [2022-02-20 23:44:02,063 INFO L290 TraceCheckUtils]: 4: Hoare triple {4290#(< (+ |ULTIMATE.start_foo_~i~0#1| 14) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {4290#(< (+ |ULTIMATE.start_foo_~i~0#1| 14) ~n~0)} is VALID [2022-02-20 23:44:02,063 INFO L290 TraceCheckUtils]: 3: Hoare triple {4300#(< 14 ~n~0)} havoc main_#t~post7#1.base, main_#t~post7#1.offset;assume { :begin_inline_foo } true;havoc foo_#t~post3#1, foo_#t~post4#1, foo_~i~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {4290#(< (+ |ULTIMATE.start_foo_~i~0#1| 14) ~n~0)} is VALID [2022-02-20 23:44:02,064 INFO L290 TraceCheckUtils]: 2: Hoare triple {4300#(< 14 ~n~0)} SUMMARY for call write~int(0, main_#t~post7#1.base, main_#t~post7#1.offset, 4); srcloc: L538 {4300#(< 14 ~n~0)} is VALID [2022-02-20 23:44:02,064 INFO L290 TraceCheckUtils]: 1: Hoare triple {3946#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~post7#1.base, main_#t~post7#1.offset, main_#t~mem8#1;~n~0 := 32768;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~a~0.base, ~a~0.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~b~0.base, ~b~0.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_#t~post7#1.base, main_#t~post7#1.offset := ~b~0.base, ~b~0.offset;~b~0.base, ~b~0.offset := main_#t~post7#1.base, 4 + main_#t~post7#1.offset; {4300#(< 14 ~n~0)} is VALID [2022-02-20 23:44:02,064 INFO L290 TraceCheckUtils]: 0: Hoare triple {3946#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);~a~0.base, ~a~0.offset := 0, 0;~b~0.base, ~b~0.offset := 0, 0;~n~0 := 0; {3946#true} is VALID [2022-02-20 23:44:02,065 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 23:44:02,065 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1432382420] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:44:02,065 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:44:02,065 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 49 [2022-02-20 23:44:02,067 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090280345] [2022-02-20 23:44:02,067 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:44:02,068 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.8979591836734695) internal successors, (142), 49 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-02-20 23:44:02,068 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:02,068 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 49 states, 49 states have (on average 2.8979591836734695) internal successors, (142), 49 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:02,158 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:02,158 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-02-20 23:44:02,159 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:44:02,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-02-20 23:44:02,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1027, Invalid=1325, Unknown=0, NotChecked=0, Total=2352 [2022-02-20 23:44:02,160 INFO L87 Difference]: Start difference. First operand 92 states and 98 transitions. Second operand has 49 states, 49 states have (on average 2.8979591836734695) internal successors, (142), 49 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:03,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:03,689 INFO L93 Difference]: Finished difference Result 527 states and 528 transitions. [2022-02-20 23:44:03,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-02-20 23:44:03,689 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.8979591836734695) internal successors, (142), 49 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-02-20 23:44:03,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:03,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 2.8979591836734695) internal successors, (142), 49 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:03,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 552 transitions. [2022-02-20 23:44:03,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 2.8979591836734695) internal successors, (142), 49 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:03,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 552 transitions. [2022-02-20 23:44:03,695 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 552 transitions. [2022-02-20 23:44:04,027 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 552 edges. 552 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:04,038 INFO L225 Difference]: With dead ends: 527 [2022-02-20 23:44:04,038 INFO L226 Difference]: Without dead ends: 527 [2022-02-20 23:44:04,039 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1377 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1552, Invalid=2480, Unknown=0, NotChecked=0, Total=4032 [2022-02-20 23:44:04,040 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 1887 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 232 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1887 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:04,040 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1887 Valid, 429 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:44:04,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2022-02-20 23:44:04,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 164. [2022-02-20 23:44:04,055 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:04,056 INFO L82 GeneralOperation]: Start isEquivalent. First operand 527 states. Second operand has 164 states, 157 states have (on average 1.1337579617834395) internal successors, (178), 163 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:04,056 INFO L74 IsIncluded]: Start isIncluded. First operand 527 states. Second operand has 164 states, 157 states have (on average 1.1337579617834395) internal successors, (178), 163 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:04,056 INFO L87 Difference]: Start difference. First operand 527 states. Second operand has 164 states, 157 states have (on average 1.1337579617834395) internal successors, (178), 163 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:04,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:04,064 INFO L93 Difference]: Finished difference Result 527 states and 528 transitions. [2022-02-20 23:44:04,064 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 528 transitions. [2022-02-20 23:44:04,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:04,065 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:04,065 INFO L74 IsIncluded]: Start isIncluded. First operand has 164 states, 157 states have (on average 1.1337579617834395) internal successors, (178), 163 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 527 states. [2022-02-20 23:44:04,065 INFO L87 Difference]: Start difference. First operand has 164 states, 157 states have (on average 1.1337579617834395) internal successors, (178), 163 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 527 states. [2022-02-20 23:44:04,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:04,079 INFO L93 Difference]: Finished difference Result 527 states and 528 transitions. [2022-02-20 23:44:04,080 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 528 transitions. [2022-02-20 23:44:04,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:04,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:04,080 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:04,080 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:04,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 157 states have (on average 1.1337579617834395) internal successors, (178), 163 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:04,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 178 transitions. [2022-02-20 23:44:04,082 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 178 transitions. Word has length 53 [2022-02-20 23:44:04,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:04,082 INFO L470 AbstractCegarLoop]: Abstraction has 164 states and 178 transitions. [2022-02-20 23:44:04,082 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 2.8979591836734695) internal successors, (142), 49 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:04,082 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 178 transitions. [2022-02-20 23:44:04,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-02-20 23:44:04,084 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:04,084 INFO L514 BasicCegarLoop]: trace histogram [30, 30, 30, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:44:04,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-02-20 23:44:04,286 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:44:04,286 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2022-02-20 23:44:04,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:04,286 INFO L85 PathProgramCache]: Analyzing trace with hash -2038312715, now seen corresponding path program 3 times [2022-02-20 23:44:04,287 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:44:04,287 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043657771] [2022-02-20 23:44:04,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:04,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:44:04,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:04,829 INFO L290 TraceCheckUtils]: 0: Hoare triple {6084#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);~a~0.base, ~a~0.offset := 0, 0;~b~0.base, ~b~0.offset := 0, 0;~n~0 := 0; {6084#true} is VALID [2022-02-20 23:44:04,830 INFO L290 TraceCheckUtils]: 1: Hoare triple {6084#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~post7#1.base, main_#t~post7#1.offset, main_#t~mem8#1;~n~0 := 32768;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~a~0.base, ~a~0.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~b~0.base, ~b~0.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_#t~post7#1.base, main_#t~post7#1.offset := ~b~0.base, ~b~0.offset;~b~0.base, ~b~0.offset := main_#t~post7#1.base, 4 + main_#t~post7#1.offset; {6086#(<= 32768 ~n~0)} is VALID [2022-02-20 23:44:04,831 INFO L290 TraceCheckUtils]: 2: Hoare triple {6086#(<= 32768 ~n~0)} SUMMARY for call write~int(0, main_#t~post7#1.base, main_#t~post7#1.offset, 4); srcloc: L538 {6086#(<= 32768 ~n~0)} is VALID [2022-02-20 23:44:04,831 INFO L290 TraceCheckUtils]: 3: Hoare triple {6086#(<= 32768 ~n~0)} havoc main_#t~post7#1.base, main_#t~post7#1.offset;assume { :begin_inline_foo } true;havoc foo_#t~post3#1, foo_#t~post4#1, foo_~i~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {6087#(and (= |ULTIMATE.start_foo_~i~0#1| 0) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:04,831 INFO L290 TraceCheckUtils]: 4: Hoare triple {6087#(and (= |ULTIMATE.start_foo_~i~0#1| 0) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {6087#(and (= |ULTIMATE.start_foo_~i~0#1| 0) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:04,832 INFO L290 TraceCheckUtils]: 5: Hoare triple {6087#(and (= |ULTIMATE.start_foo_~i~0#1| 0) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {6087#(and (= |ULTIMATE.start_foo_~i~0#1| 0) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:04,832 INFO L290 TraceCheckUtils]: 6: Hoare triple {6087#(and (= |ULTIMATE.start_foo_~i~0#1| 0) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {6088#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32767) ~n~0)} is VALID [2022-02-20 23:44:04,832 INFO L290 TraceCheckUtils]: 7: Hoare triple {6088#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32767) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {6088#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32767) ~n~0)} is VALID [2022-02-20 23:44:04,832 INFO L290 TraceCheckUtils]: 8: Hoare triple {6088#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32767) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {6088#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32767) ~n~0)} is VALID [2022-02-20 23:44:04,833 INFO L290 TraceCheckUtils]: 9: Hoare triple {6088#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32767) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {6089#(<= (+ 32766 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:04,833 INFO L290 TraceCheckUtils]: 10: Hoare triple {6089#(<= (+ 32766 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {6089#(<= (+ 32766 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:04,833 INFO L290 TraceCheckUtils]: 11: Hoare triple {6089#(<= (+ 32766 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {6089#(<= (+ 32766 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:04,834 INFO L290 TraceCheckUtils]: 12: Hoare triple {6089#(<= (+ 32766 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {6090#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32765) ~n~0)} is VALID [2022-02-20 23:44:04,834 INFO L290 TraceCheckUtils]: 13: Hoare triple {6090#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32765) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {6090#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32765) ~n~0)} is VALID [2022-02-20 23:44:04,834 INFO L290 TraceCheckUtils]: 14: Hoare triple {6090#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32765) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {6090#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32765) ~n~0)} is VALID [2022-02-20 23:44:04,835 INFO L290 TraceCheckUtils]: 15: Hoare triple {6090#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32765) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {6091#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32764) ~n~0)} is VALID [2022-02-20 23:44:04,835 INFO L290 TraceCheckUtils]: 16: Hoare triple {6091#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32764) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {6091#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32764) ~n~0)} is VALID [2022-02-20 23:44:04,835 INFO L290 TraceCheckUtils]: 17: Hoare triple {6091#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32764) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {6091#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32764) ~n~0)} is VALID [2022-02-20 23:44:04,836 INFO L290 TraceCheckUtils]: 18: Hoare triple {6091#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32764) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {6092#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32763) ~n~0)} is VALID [2022-02-20 23:44:04,836 INFO L290 TraceCheckUtils]: 19: Hoare triple {6092#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32763) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {6092#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32763) ~n~0)} is VALID [2022-02-20 23:44:04,836 INFO L290 TraceCheckUtils]: 20: Hoare triple {6092#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32763) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {6092#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32763) ~n~0)} is VALID [2022-02-20 23:44:04,836 INFO L290 TraceCheckUtils]: 21: Hoare triple {6092#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32763) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {6093#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32762) ~n~0)} is VALID [2022-02-20 23:44:04,837 INFO L290 TraceCheckUtils]: 22: Hoare triple {6093#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32762) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {6093#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32762) ~n~0)} is VALID [2022-02-20 23:44:04,837 INFO L290 TraceCheckUtils]: 23: Hoare triple {6093#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32762) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {6093#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32762) ~n~0)} is VALID [2022-02-20 23:44:04,837 INFO L290 TraceCheckUtils]: 24: Hoare triple {6093#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32762) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {6094#(<= (+ 32761 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:04,838 INFO L290 TraceCheckUtils]: 25: Hoare triple {6094#(<= (+ 32761 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {6094#(<= (+ 32761 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:04,838 INFO L290 TraceCheckUtils]: 26: Hoare triple {6094#(<= (+ 32761 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {6094#(<= (+ 32761 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:04,838 INFO L290 TraceCheckUtils]: 27: Hoare triple {6094#(<= (+ 32761 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {6095#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32760) ~n~0)} is VALID [2022-02-20 23:44:04,838 INFO L290 TraceCheckUtils]: 28: Hoare triple {6095#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32760) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {6095#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32760) ~n~0)} is VALID [2022-02-20 23:44:04,839 INFO L290 TraceCheckUtils]: 29: Hoare triple {6095#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32760) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {6095#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32760) ~n~0)} is VALID [2022-02-20 23:44:04,839 INFO L290 TraceCheckUtils]: 30: Hoare triple {6095#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32760) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {6096#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32759) ~n~0)} is VALID [2022-02-20 23:44:04,839 INFO L290 TraceCheckUtils]: 31: Hoare triple {6096#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32759) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {6096#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32759) ~n~0)} is VALID [2022-02-20 23:44:04,840 INFO L290 TraceCheckUtils]: 32: Hoare triple {6096#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32759) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {6096#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32759) ~n~0)} is VALID [2022-02-20 23:44:04,840 INFO L290 TraceCheckUtils]: 33: Hoare triple {6096#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32759) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {6097#(<= (+ 32758 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:04,840 INFO L290 TraceCheckUtils]: 34: Hoare triple {6097#(<= (+ 32758 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {6097#(<= (+ 32758 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:04,840 INFO L290 TraceCheckUtils]: 35: Hoare triple {6097#(<= (+ 32758 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {6097#(<= (+ 32758 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:04,841 INFO L290 TraceCheckUtils]: 36: Hoare triple {6097#(<= (+ 32758 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {6098#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32757) ~n~0)} is VALID [2022-02-20 23:44:04,841 INFO L290 TraceCheckUtils]: 37: Hoare triple {6098#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32757) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {6098#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32757) ~n~0)} is VALID [2022-02-20 23:44:04,841 INFO L290 TraceCheckUtils]: 38: Hoare triple {6098#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32757) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {6098#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32757) ~n~0)} is VALID [2022-02-20 23:44:04,842 INFO L290 TraceCheckUtils]: 39: Hoare triple {6098#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32757) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {6099#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32756) ~n~0)} is VALID [2022-02-20 23:44:04,842 INFO L290 TraceCheckUtils]: 40: Hoare triple {6099#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32756) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {6099#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32756) ~n~0)} is VALID [2022-02-20 23:44:04,842 INFO L290 TraceCheckUtils]: 41: Hoare triple {6099#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32756) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {6099#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32756) ~n~0)} is VALID [2022-02-20 23:44:04,843 INFO L290 TraceCheckUtils]: 42: Hoare triple {6099#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32756) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {6100#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32755) ~n~0)} is VALID [2022-02-20 23:44:04,843 INFO L290 TraceCheckUtils]: 43: Hoare triple {6100#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32755) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {6100#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32755) ~n~0)} is VALID [2022-02-20 23:44:04,843 INFO L290 TraceCheckUtils]: 44: Hoare triple {6100#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32755) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {6100#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32755) ~n~0)} is VALID [2022-02-20 23:44:04,844 INFO L290 TraceCheckUtils]: 45: Hoare triple {6100#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32755) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {6101#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32754) ~n~0)} is VALID [2022-02-20 23:44:04,844 INFO L290 TraceCheckUtils]: 46: Hoare triple {6101#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32754) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {6101#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32754) ~n~0)} is VALID [2022-02-20 23:44:04,844 INFO L290 TraceCheckUtils]: 47: Hoare triple {6101#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32754) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {6101#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32754) ~n~0)} is VALID [2022-02-20 23:44:04,845 INFO L290 TraceCheckUtils]: 48: Hoare triple {6101#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32754) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {6102#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32753) ~n~0)} is VALID [2022-02-20 23:44:04,845 INFO L290 TraceCheckUtils]: 49: Hoare triple {6102#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32753) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {6102#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32753) ~n~0)} is VALID [2022-02-20 23:44:04,845 INFO L290 TraceCheckUtils]: 50: Hoare triple {6102#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32753) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {6102#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32753) ~n~0)} is VALID [2022-02-20 23:44:04,846 INFO L290 TraceCheckUtils]: 51: Hoare triple {6102#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32753) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {6103#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32752) ~n~0)} is VALID [2022-02-20 23:44:04,846 INFO L290 TraceCheckUtils]: 52: Hoare triple {6103#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32752) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {6103#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32752) ~n~0)} is VALID [2022-02-20 23:44:04,846 INFO L290 TraceCheckUtils]: 53: Hoare triple {6103#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32752) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {6103#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32752) ~n~0)} is VALID [2022-02-20 23:44:04,847 INFO L290 TraceCheckUtils]: 54: Hoare triple {6103#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32752) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {6104#(<= (+ 32751 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:04,847 INFO L290 TraceCheckUtils]: 55: Hoare triple {6104#(<= (+ 32751 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {6104#(<= (+ 32751 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:04,847 INFO L290 TraceCheckUtils]: 56: Hoare triple {6104#(<= (+ 32751 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {6104#(<= (+ 32751 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:04,848 INFO L290 TraceCheckUtils]: 57: Hoare triple {6104#(<= (+ 32751 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {6105#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32750) ~n~0)} is VALID [2022-02-20 23:44:04,848 INFO L290 TraceCheckUtils]: 58: Hoare triple {6105#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32750) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {6105#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32750) ~n~0)} is VALID [2022-02-20 23:44:04,848 INFO L290 TraceCheckUtils]: 59: Hoare triple {6105#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32750) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {6105#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32750) ~n~0)} is VALID [2022-02-20 23:44:04,848 INFO L290 TraceCheckUtils]: 60: Hoare triple {6105#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32750) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {6106#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32749) ~n~0)} is VALID [2022-02-20 23:44:04,849 INFO L290 TraceCheckUtils]: 61: Hoare triple {6106#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32749) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {6106#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32749) ~n~0)} is VALID [2022-02-20 23:44:04,849 INFO L290 TraceCheckUtils]: 62: Hoare triple {6106#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32749) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {6106#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32749) ~n~0)} is VALID [2022-02-20 23:44:04,850 INFO L290 TraceCheckUtils]: 63: Hoare triple {6106#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32749) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {6107#(<= (+ 32748 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:04,850 INFO L290 TraceCheckUtils]: 64: Hoare triple {6107#(<= (+ 32748 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {6107#(<= (+ 32748 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:04,850 INFO L290 TraceCheckUtils]: 65: Hoare triple {6107#(<= (+ 32748 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {6107#(<= (+ 32748 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:04,850 INFO L290 TraceCheckUtils]: 66: Hoare triple {6107#(<= (+ 32748 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {6108#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32747) ~n~0)} is VALID [2022-02-20 23:44:04,851 INFO L290 TraceCheckUtils]: 67: Hoare triple {6108#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32747) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {6108#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32747) ~n~0)} is VALID [2022-02-20 23:44:04,851 INFO L290 TraceCheckUtils]: 68: Hoare triple {6108#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32747) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {6108#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32747) ~n~0)} is VALID [2022-02-20 23:44:04,851 INFO L290 TraceCheckUtils]: 69: Hoare triple {6108#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32747) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {6109#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32746) ~n~0)} is VALID [2022-02-20 23:44:04,852 INFO L290 TraceCheckUtils]: 70: Hoare triple {6109#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32746) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {6109#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32746) ~n~0)} is VALID [2022-02-20 23:44:04,852 INFO L290 TraceCheckUtils]: 71: Hoare triple {6109#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32746) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {6109#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32746) ~n~0)} is VALID [2022-02-20 23:44:04,852 INFO L290 TraceCheckUtils]: 72: Hoare triple {6109#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32746) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {6110#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32745) ~n~0)} is VALID [2022-02-20 23:44:04,853 INFO L290 TraceCheckUtils]: 73: Hoare triple {6110#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32745) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {6110#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32745) ~n~0)} is VALID [2022-02-20 23:44:04,853 INFO L290 TraceCheckUtils]: 74: Hoare triple {6110#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32745) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {6110#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32745) ~n~0)} is VALID [2022-02-20 23:44:04,853 INFO L290 TraceCheckUtils]: 75: Hoare triple {6110#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32745) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {6111#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32744) ~n~0)} is VALID [2022-02-20 23:44:04,854 INFO L290 TraceCheckUtils]: 76: Hoare triple {6111#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32744) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {6111#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32744) ~n~0)} is VALID [2022-02-20 23:44:04,854 INFO L290 TraceCheckUtils]: 77: Hoare triple {6111#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32744) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {6111#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32744) ~n~0)} is VALID [2022-02-20 23:44:04,854 INFO L290 TraceCheckUtils]: 78: Hoare triple {6111#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32744) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {6112#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32743) ~n~0)} is VALID [2022-02-20 23:44:04,855 INFO L290 TraceCheckUtils]: 79: Hoare triple {6112#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32743) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {6112#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32743) ~n~0)} is VALID [2022-02-20 23:44:04,855 INFO L290 TraceCheckUtils]: 80: Hoare triple {6112#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32743) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {6112#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32743) ~n~0)} is VALID [2022-02-20 23:44:04,855 INFO L290 TraceCheckUtils]: 81: Hoare triple {6112#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32743) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {6113#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32742) ~n~0)} is VALID [2022-02-20 23:44:04,856 INFO L290 TraceCheckUtils]: 82: Hoare triple {6113#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32742) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {6113#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32742) ~n~0)} is VALID [2022-02-20 23:44:04,856 INFO L290 TraceCheckUtils]: 83: Hoare triple {6113#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32742) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {6113#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32742) ~n~0)} is VALID [2022-02-20 23:44:04,856 INFO L290 TraceCheckUtils]: 84: Hoare triple {6113#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32742) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {6114#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32741) ~n~0)} is VALID [2022-02-20 23:44:04,857 INFO L290 TraceCheckUtils]: 85: Hoare triple {6114#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32741) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {6114#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32741) ~n~0)} is VALID [2022-02-20 23:44:04,857 INFO L290 TraceCheckUtils]: 86: Hoare triple {6114#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32741) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {6114#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32741) ~n~0)} is VALID [2022-02-20 23:44:04,857 INFO L290 TraceCheckUtils]: 87: Hoare triple {6114#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32741) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {6115#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32740) ~n~0)} is VALID [2022-02-20 23:44:04,857 INFO L290 TraceCheckUtils]: 88: Hoare triple {6115#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32740) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {6115#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32740) ~n~0)} is VALID [2022-02-20 23:44:04,858 INFO L290 TraceCheckUtils]: 89: Hoare triple {6115#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32740) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {6115#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32740) ~n~0)} is VALID [2022-02-20 23:44:04,858 INFO L290 TraceCheckUtils]: 90: Hoare triple {6115#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32740) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {6116#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32739) ~n~0)} is VALID [2022-02-20 23:44:04,858 INFO L290 TraceCheckUtils]: 91: Hoare triple {6116#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32739) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {6116#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32739) ~n~0)} is VALID [2022-02-20 23:44:04,859 INFO L290 TraceCheckUtils]: 92: Hoare triple {6116#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32739) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {6116#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32739) ~n~0)} is VALID [2022-02-20 23:44:04,859 INFO L290 TraceCheckUtils]: 93: Hoare triple {6116#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32739) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {6117#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32738) ~n~0)} is VALID [2022-02-20 23:44:04,860 INFO L290 TraceCheckUtils]: 94: Hoare triple {6117#(<= (+ |ULTIMATE.start_foo_~i~0#1| 32738) ~n~0)} assume !(foo_~i~0#1 < ~n~0); {6085#false} is VALID [2022-02-20 23:44:04,860 INFO L290 TraceCheckUtils]: 95: Hoare triple {6085#false} foo_~i~0#1 := 0; {6085#false} is VALID [2022-02-20 23:44:04,860 INFO L290 TraceCheckUtils]: 96: Hoare triple {6085#false} assume !!(foo_~i~0#1 < 32767); {6085#false} is VALID [2022-02-20 23:44:04,860 INFO L290 TraceCheckUtils]: 97: Hoare triple {6085#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {6085#false} is VALID [2022-02-20 23:44:04,860 INFO L290 TraceCheckUtils]: 98: Hoare triple {6085#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {6085#false} is VALID [2022-02-20 23:44:04,860 INFO L290 TraceCheckUtils]: 99: Hoare triple {6085#false} assume !!(foo_~i~0#1 < 32767); {6085#false} is VALID [2022-02-20 23:44:04,860 INFO L290 TraceCheckUtils]: 100: Hoare triple {6085#false} assume !(4 + (~b~0.offset + 4 * foo_~i~0#1) <= #length[~b~0.base] && 0 <= ~b~0.offset + 4 * foo_~i~0#1); {6085#false} is VALID [2022-02-20 23:44:04,861 INFO L134 CoverageAnalysis]: Checked inductivity of 1337 backedges. 0 proven. 1335 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 23:44:04,861 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:44:04,861 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043657771] [2022-02-20 23:44:04,861 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043657771] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:44:04,861 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598134290] [2022-02-20 23:44:04,861 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 23:44:04,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:44:04,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:44:04,862 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:44:04,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-02-20 23:44:04,946 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-02-20 23:44:04,946 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 23:44:04,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-20 23:44:04,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:04,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:44:05,064 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-20 23:44:05,064 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-02-20 23:44:05,825 INFO L290 TraceCheckUtils]: 0: Hoare triple {6084#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);~a~0.base, ~a~0.offset := 0, 0;~b~0.base, ~b~0.offset := 0, 0;~n~0 := 0; {6084#true} is VALID [2022-02-20 23:44:05,826 INFO L290 TraceCheckUtils]: 1: Hoare triple {6084#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~post7#1.base, main_#t~post7#1.offset, main_#t~mem8#1;~n~0 := 32768;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~a~0.base, ~a~0.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~b~0.base, ~b~0.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_#t~post7#1.base, main_#t~post7#1.offset := ~b~0.base, ~b~0.offset;~b~0.base, ~b~0.offset := main_#t~post7#1.base, 4 + main_#t~post7#1.offset; {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,827 INFO L290 TraceCheckUtils]: 2: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} SUMMARY for call write~int(0, main_#t~post7#1.base, main_#t~post7#1.offset, 4); srcloc: L538 {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,827 INFO L290 TraceCheckUtils]: 3: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} havoc main_#t~post7#1.base, main_#t~post7#1.offset;assume { :begin_inline_foo } true;havoc foo_#t~post3#1, foo_#t~post4#1, foo_~i~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,828 INFO L290 TraceCheckUtils]: 4: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} assume !!(foo_~i~0#1 < ~n~0); {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,828 INFO L290 TraceCheckUtils]: 5: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,828 INFO L290 TraceCheckUtils]: 6: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,830 INFO L290 TraceCheckUtils]: 7: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} assume !!(foo_~i~0#1 < ~n~0); {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,830 INFO L290 TraceCheckUtils]: 8: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,830 INFO L290 TraceCheckUtils]: 9: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,831 INFO L290 TraceCheckUtils]: 10: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} assume !!(foo_~i~0#1 < ~n~0); {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,831 INFO L290 TraceCheckUtils]: 11: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,832 INFO L290 TraceCheckUtils]: 12: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,832 INFO L290 TraceCheckUtils]: 13: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} assume !!(foo_~i~0#1 < ~n~0); {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,832 INFO L290 TraceCheckUtils]: 14: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,833 INFO L290 TraceCheckUtils]: 15: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,833 INFO L290 TraceCheckUtils]: 16: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} assume !!(foo_~i~0#1 < ~n~0); {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,834 INFO L290 TraceCheckUtils]: 17: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,834 INFO L290 TraceCheckUtils]: 18: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,834 INFO L290 TraceCheckUtils]: 19: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} assume !!(foo_~i~0#1 < ~n~0); {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,835 INFO L290 TraceCheckUtils]: 20: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,836 INFO L290 TraceCheckUtils]: 21: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,836 INFO L290 TraceCheckUtils]: 22: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} assume !!(foo_~i~0#1 < ~n~0); {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,837 INFO L290 TraceCheckUtils]: 23: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,837 INFO L290 TraceCheckUtils]: 24: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,837 INFO L290 TraceCheckUtils]: 25: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} assume !!(foo_~i~0#1 < ~n~0); {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,838 INFO L290 TraceCheckUtils]: 26: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,838 INFO L290 TraceCheckUtils]: 27: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,839 INFO L290 TraceCheckUtils]: 28: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} assume !!(foo_~i~0#1 < ~n~0); {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,839 INFO L290 TraceCheckUtils]: 29: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,839 INFO L290 TraceCheckUtils]: 30: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,840 INFO L290 TraceCheckUtils]: 31: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} assume !!(foo_~i~0#1 < ~n~0); {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,840 INFO L290 TraceCheckUtils]: 32: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,841 INFO L290 TraceCheckUtils]: 33: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,841 INFO L290 TraceCheckUtils]: 34: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} assume !!(foo_~i~0#1 < ~n~0); {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,842 INFO L290 TraceCheckUtils]: 35: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,842 INFO L290 TraceCheckUtils]: 36: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,842 INFO L290 TraceCheckUtils]: 37: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} assume !!(foo_~i~0#1 < ~n~0); {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,843 INFO L290 TraceCheckUtils]: 38: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,843 INFO L290 TraceCheckUtils]: 39: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,843 INFO L290 TraceCheckUtils]: 40: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} assume !!(foo_~i~0#1 < ~n~0); {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,844 INFO L290 TraceCheckUtils]: 41: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,844 INFO L290 TraceCheckUtils]: 42: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,845 INFO L290 TraceCheckUtils]: 43: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} assume !!(foo_~i~0#1 < ~n~0); {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,845 INFO L290 TraceCheckUtils]: 44: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,845 INFO L290 TraceCheckUtils]: 45: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,846 INFO L290 TraceCheckUtils]: 46: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} assume !!(foo_~i~0#1 < ~n~0); {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,846 INFO L290 TraceCheckUtils]: 47: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,853 INFO L290 TraceCheckUtils]: 48: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,853 INFO L290 TraceCheckUtils]: 49: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} assume !!(foo_~i~0#1 < ~n~0); {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,854 INFO L290 TraceCheckUtils]: 50: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,854 INFO L290 TraceCheckUtils]: 51: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,854 INFO L290 TraceCheckUtils]: 52: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} assume !!(foo_~i~0#1 < ~n~0); {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,855 INFO L290 TraceCheckUtils]: 53: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,855 INFO L290 TraceCheckUtils]: 54: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,855 INFO L290 TraceCheckUtils]: 55: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} assume !!(foo_~i~0#1 < ~n~0); {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,856 INFO L290 TraceCheckUtils]: 56: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,856 INFO L290 TraceCheckUtils]: 57: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,859 INFO L290 TraceCheckUtils]: 58: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} assume !!(foo_~i~0#1 < ~n~0); {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,860 INFO L290 TraceCheckUtils]: 59: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,860 INFO L290 TraceCheckUtils]: 60: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,860 INFO L290 TraceCheckUtils]: 61: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} assume !!(foo_~i~0#1 < ~n~0); {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,861 INFO L290 TraceCheckUtils]: 62: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,861 INFO L290 TraceCheckUtils]: 63: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,862 INFO L290 TraceCheckUtils]: 64: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} assume !!(foo_~i~0#1 < ~n~0); {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,862 INFO L290 TraceCheckUtils]: 65: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,863 INFO L290 TraceCheckUtils]: 66: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,863 INFO L290 TraceCheckUtils]: 67: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} assume !!(foo_~i~0#1 < ~n~0); {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,864 INFO L290 TraceCheckUtils]: 68: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,864 INFO L290 TraceCheckUtils]: 69: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,864 INFO L290 TraceCheckUtils]: 70: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} assume !!(foo_~i~0#1 < ~n~0); {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,865 INFO L290 TraceCheckUtils]: 71: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,865 INFO L290 TraceCheckUtils]: 72: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,866 INFO L290 TraceCheckUtils]: 73: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} assume !!(foo_~i~0#1 < ~n~0); {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,866 INFO L290 TraceCheckUtils]: 74: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,867 INFO L290 TraceCheckUtils]: 75: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,867 INFO L290 TraceCheckUtils]: 76: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} assume !!(foo_~i~0#1 < ~n~0); {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,867 INFO L290 TraceCheckUtils]: 77: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,868 INFO L290 TraceCheckUtils]: 78: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,868 INFO L290 TraceCheckUtils]: 79: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} assume !!(foo_~i~0#1 < ~n~0); {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,868 INFO L290 TraceCheckUtils]: 80: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,869 INFO L290 TraceCheckUtils]: 81: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,870 INFO L290 TraceCheckUtils]: 82: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} assume !!(foo_~i~0#1 < ~n~0); {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,870 INFO L290 TraceCheckUtils]: 83: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,870 INFO L290 TraceCheckUtils]: 84: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,871 INFO L290 TraceCheckUtils]: 85: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} assume !!(foo_~i~0#1 < ~n~0); {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,871 INFO L290 TraceCheckUtils]: 86: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,871 INFO L290 TraceCheckUtils]: 87: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,872 INFO L290 TraceCheckUtils]: 88: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} assume !!(foo_~i~0#1 < ~n~0); {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,872 INFO L290 TraceCheckUtils]: 89: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,873 INFO L290 TraceCheckUtils]: 90: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,873 INFO L290 TraceCheckUtils]: 91: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} assume !!(foo_~i~0#1 < ~n~0); {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,873 INFO L290 TraceCheckUtils]: 92: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,874 INFO L290 TraceCheckUtils]: 93: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,874 INFO L290 TraceCheckUtils]: 94: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} assume !(foo_~i~0#1 < ~n~0); {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:05,874 INFO L290 TraceCheckUtils]: 95: Hoare triple {6124#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} foo_~i~0#1 := 0; {6407#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4) (<= 0 |ULTIMATE.start_foo_~i~0#1|))} is VALID [2022-02-20 23:44:05,875 INFO L290 TraceCheckUtils]: 96: Hoare triple {6407#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4) (<= 0 |ULTIMATE.start_foo_~i~0#1|))} assume !!(foo_~i~0#1 < 32767); {6407#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4) (<= 0 |ULTIMATE.start_foo_~i~0#1|))} is VALID [2022-02-20 23:44:05,875 INFO L290 TraceCheckUtils]: 97: Hoare triple {6407#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4) (<= 0 |ULTIMATE.start_foo_~i~0#1|))} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {6407#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4) (<= 0 |ULTIMATE.start_foo_~i~0#1|))} is VALID [2022-02-20 23:44:05,876 INFO L290 TraceCheckUtils]: 98: Hoare triple {6407#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4) (<= 0 |ULTIMATE.start_foo_~i~0#1|))} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {6417#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4) (<= 1 |ULTIMATE.start_foo_~i~0#1|))} is VALID [2022-02-20 23:44:05,876 INFO L290 TraceCheckUtils]: 99: Hoare triple {6417#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4) (<= 1 |ULTIMATE.start_foo_~i~0#1|))} assume !!(foo_~i~0#1 < 32767); {6421#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (< |ULTIMATE.start_foo_~i~0#1| 32767) (= ~b~0.offset 4) (<= 1 |ULTIMATE.start_foo_~i~0#1|))} is VALID [2022-02-20 23:44:05,876 INFO L290 TraceCheckUtils]: 100: Hoare triple {6421#(and (<= 32768 (div (select |#length| ~b~0.base) 4)) (< |ULTIMATE.start_foo_~i~0#1| 32767) (= ~b~0.offset 4) (<= 1 |ULTIMATE.start_foo_~i~0#1|))} assume !(4 + (~b~0.offset + 4 * foo_~i~0#1) <= #length[~b~0.base] && 0 <= ~b~0.offset + 4 * foo_~i~0#1); {6085#false} is VALID [2022-02-20 23:44:05,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1337 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1335 trivial. 0 not checked. [2022-02-20 23:44:05,877 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:44:05,877 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598134290] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:44:05,877 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 23:44:05,877 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [34] total 38 [2022-02-20 23:44:05,877 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820790724] [2022-02-20 23:44:05,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:44:05,878 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2022-02-20 23:44:05,878 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:05,878 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:05,888 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:05,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:44:05,888 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:44:05,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:44:05,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=545, Invalid=861, Unknown=0, NotChecked=0, Total=1406 [2022-02-20 23:44:05,889 INFO L87 Difference]: Start difference. First operand 164 states and 178 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:05,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:05,981 INFO L93 Difference]: Finished difference Result 163 states and 164 transitions. [2022-02-20 23:44:05,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:44:05,981 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2022-02-20 23:44:05,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:05,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:05,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-02-20 23:44:05,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:05,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-02-20 23:44:05,983 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 40 transitions. [2022-02-20 23:44:06,008 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:06,009 INFO L225 Difference]: With dead ends: 163 [2022-02-20 23:44:06,010 INFO L226 Difference]: Without dead ends: 163 [2022-02-20 23:44:06,010 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=545, Invalid=861, Unknown=0, NotChecked=0, Total=1406 [2022-02-20 23:44:06,010 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 54 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:06,010 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 30 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:44:06,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-02-20 23:44:06,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2022-02-20 23:44:06,012 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:06,012 INFO L82 GeneralOperation]: Start isEquivalent. First operand 163 states. Second operand has 163 states, 157 states have (on average 1.0445859872611465) internal successors, (164), 162 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:06,012 INFO L74 IsIncluded]: Start isIncluded. First operand 163 states. Second operand has 163 states, 157 states have (on average 1.0445859872611465) internal successors, (164), 162 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:06,012 INFO L87 Difference]: Start difference. First operand 163 states. Second operand has 163 states, 157 states have (on average 1.0445859872611465) internal successors, (164), 162 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:06,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:06,014 INFO L93 Difference]: Finished difference Result 163 states and 164 transitions. [2022-02-20 23:44:06,014 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 164 transitions. [2022-02-20 23:44:06,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:06,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:06,014 INFO L74 IsIncluded]: Start isIncluded. First operand has 163 states, 157 states have (on average 1.0445859872611465) internal successors, (164), 162 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 163 states. [2022-02-20 23:44:06,014 INFO L87 Difference]: Start difference. First operand has 163 states, 157 states have (on average 1.0445859872611465) internal successors, (164), 162 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 163 states. [2022-02-20 23:44:06,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:06,016 INFO L93 Difference]: Finished difference Result 163 states and 164 transitions. [2022-02-20 23:44:06,016 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 164 transitions. [2022-02-20 23:44:06,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:06,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:06,016 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:06,016 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:06,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 157 states have (on average 1.0445859872611465) internal successors, (164), 162 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:06,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 164 transitions. [2022-02-20 23:44:06,018 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 164 transitions. Word has length 101 [2022-02-20 23:44:06,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:06,018 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 164 transitions. [2022-02-20 23:44:06,018 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:06,018 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 164 transitions. [2022-02-20 23:44:06,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-02-20 23:44:06,019 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:06,019 INFO L514 BasicCegarLoop]: trace histogram [30, 30, 30, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:44:06,053 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-02-20 23:44:06,219 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:44:06,220 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2022-02-20 23:44:06,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:06,220 INFO L85 PathProgramCache]: Analyzing trace with hash -376576047, now seen corresponding path program 1 times [2022-02-20 23:44:06,220 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:44:06,220 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280366778] [2022-02-20 23:44:06,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:06,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:44:06,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:06,388 INFO L290 TraceCheckUtils]: 0: Hoare triple {7076#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);~a~0.base, ~a~0.offset := 0, 0;~b~0.base, ~b~0.offset := 0, 0;~n~0 := 0; {7076#true} is VALID [2022-02-20 23:44:06,389 INFO L290 TraceCheckUtils]: 1: Hoare triple {7076#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~post7#1.base, main_#t~post7#1.offset, main_#t~mem8#1;~n~0 := 32768;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~a~0.base, ~a~0.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~b~0.base, ~b~0.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_#t~post7#1.base, main_#t~post7#1.offset := ~b~0.base, ~b~0.offset;~b~0.base, ~b~0.offset := main_#t~post7#1.base, 4 + main_#t~post7#1.offset; {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,389 INFO L290 TraceCheckUtils]: 2: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} SUMMARY for call write~int(0, main_#t~post7#1.base, main_#t~post7#1.offset, 4); srcloc: L538 {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,389 INFO L290 TraceCheckUtils]: 3: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} havoc main_#t~post7#1.base, main_#t~post7#1.offset;assume { :begin_inline_foo } true;havoc foo_#t~post3#1, foo_#t~post4#1, foo_~i~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,390 INFO L290 TraceCheckUtils]: 4: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < ~n~0); {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,390 INFO L290 TraceCheckUtils]: 5: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,390 INFO L290 TraceCheckUtils]: 6: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,391 INFO L290 TraceCheckUtils]: 7: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < ~n~0); {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,391 INFO L290 TraceCheckUtils]: 8: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,391 INFO L290 TraceCheckUtils]: 9: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,392 INFO L290 TraceCheckUtils]: 10: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < ~n~0); {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,392 INFO L290 TraceCheckUtils]: 11: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,392 INFO L290 TraceCheckUtils]: 12: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,392 INFO L290 TraceCheckUtils]: 13: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < ~n~0); {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,393 INFO L290 TraceCheckUtils]: 14: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,393 INFO L290 TraceCheckUtils]: 15: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,393 INFO L290 TraceCheckUtils]: 16: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < ~n~0); {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,395 INFO L290 TraceCheckUtils]: 17: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,395 INFO L290 TraceCheckUtils]: 18: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,395 INFO L290 TraceCheckUtils]: 19: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < ~n~0); {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,396 INFO L290 TraceCheckUtils]: 20: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,396 INFO L290 TraceCheckUtils]: 21: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,396 INFO L290 TraceCheckUtils]: 22: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < ~n~0); {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,396 INFO L290 TraceCheckUtils]: 23: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,397 INFO L290 TraceCheckUtils]: 24: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,397 INFO L290 TraceCheckUtils]: 25: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < ~n~0); {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,397 INFO L290 TraceCheckUtils]: 26: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,397 INFO L290 TraceCheckUtils]: 27: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,398 INFO L290 TraceCheckUtils]: 28: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < ~n~0); {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,398 INFO L290 TraceCheckUtils]: 29: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,398 INFO L290 TraceCheckUtils]: 30: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,399 INFO L290 TraceCheckUtils]: 31: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < ~n~0); {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,399 INFO L290 TraceCheckUtils]: 32: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,399 INFO L290 TraceCheckUtils]: 33: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,399 INFO L290 TraceCheckUtils]: 34: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < ~n~0); {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,400 INFO L290 TraceCheckUtils]: 35: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,400 INFO L290 TraceCheckUtils]: 36: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,400 INFO L290 TraceCheckUtils]: 37: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < ~n~0); {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,400 INFO L290 TraceCheckUtils]: 38: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,401 INFO L290 TraceCheckUtils]: 39: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,401 INFO L290 TraceCheckUtils]: 40: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < ~n~0); {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,401 INFO L290 TraceCheckUtils]: 41: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,402 INFO L290 TraceCheckUtils]: 42: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,402 INFO L290 TraceCheckUtils]: 43: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < ~n~0); {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,402 INFO L290 TraceCheckUtils]: 44: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,402 INFO L290 TraceCheckUtils]: 45: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,403 INFO L290 TraceCheckUtils]: 46: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < ~n~0); {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,403 INFO L290 TraceCheckUtils]: 47: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,403 INFO L290 TraceCheckUtils]: 48: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,404 INFO L290 TraceCheckUtils]: 49: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < ~n~0); {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,404 INFO L290 TraceCheckUtils]: 50: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,404 INFO L290 TraceCheckUtils]: 51: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,404 INFO L290 TraceCheckUtils]: 52: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < ~n~0); {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,405 INFO L290 TraceCheckUtils]: 53: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,405 INFO L290 TraceCheckUtils]: 54: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,405 INFO L290 TraceCheckUtils]: 55: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < ~n~0); {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,405 INFO L290 TraceCheckUtils]: 56: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,406 INFO L290 TraceCheckUtils]: 57: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,406 INFO L290 TraceCheckUtils]: 58: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < ~n~0); {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,406 INFO L290 TraceCheckUtils]: 59: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,407 INFO L290 TraceCheckUtils]: 60: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,407 INFO L290 TraceCheckUtils]: 61: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < ~n~0); {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,407 INFO L290 TraceCheckUtils]: 62: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,407 INFO L290 TraceCheckUtils]: 63: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,408 INFO L290 TraceCheckUtils]: 64: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < ~n~0); {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,408 INFO L290 TraceCheckUtils]: 65: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,408 INFO L290 TraceCheckUtils]: 66: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,409 INFO L290 TraceCheckUtils]: 67: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < ~n~0); {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,409 INFO L290 TraceCheckUtils]: 68: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,409 INFO L290 TraceCheckUtils]: 69: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,409 INFO L290 TraceCheckUtils]: 70: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < ~n~0); {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,410 INFO L290 TraceCheckUtils]: 71: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,410 INFO L290 TraceCheckUtils]: 72: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,410 INFO L290 TraceCheckUtils]: 73: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < ~n~0); {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,410 INFO L290 TraceCheckUtils]: 74: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,411 INFO L290 TraceCheckUtils]: 75: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,411 INFO L290 TraceCheckUtils]: 76: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < ~n~0); {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,411 INFO L290 TraceCheckUtils]: 77: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,412 INFO L290 TraceCheckUtils]: 78: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,412 INFO L290 TraceCheckUtils]: 79: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < ~n~0); {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,412 INFO L290 TraceCheckUtils]: 80: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,412 INFO L290 TraceCheckUtils]: 81: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,413 INFO L290 TraceCheckUtils]: 82: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < ~n~0); {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,413 INFO L290 TraceCheckUtils]: 83: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,413 INFO L290 TraceCheckUtils]: 84: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,414 INFO L290 TraceCheckUtils]: 85: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < ~n~0); {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,414 INFO L290 TraceCheckUtils]: 86: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,414 INFO L290 TraceCheckUtils]: 87: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,414 INFO L290 TraceCheckUtils]: 88: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < ~n~0); {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,415 INFO L290 TraceCheckUtils]: 89: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,415 INFO L290 TraceCheckUtils]: 90: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,415 INFO L290 TraceCheckUtils]: 91: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < ~n~0); {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,415 INFO L290 TraceCheckUtils]: 92: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,416 INFO L290 TraceCheckUtils]: 93: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,416 INFO L290 TraceCheckUtils]: 94: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !(foo_~i~0#1 < ~n~0); {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,416 INFO L290 TraceCheckUtils]: 95: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} foo_~i~0#1 := 0; {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,417 INFO L290 TraceCheckUtils]: 96: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < 32767); {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,417 INFO L290 TraceCheckUtils]: 97: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,417 INFO L290 TraceCheckUtils]: 98: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,417 INFO L290 TraceCheckUtils]: 99: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < 32767); {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,418 INFO L290 TraceCheckUtils]: 100: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,418 INFO L290 TraceCheckUtils]: 101: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,418 INFO L290 TraceCheckUtils]: 102: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < 32767); {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,419 INFO L290 TraceCheckUtils]: 103: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,419 INFO L290 TraceCheckUtils]: 104: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,419 INFO L290 TraceCheckUtils]: 105: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < 32767); {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,419 INFO L290 TraceCheckUtils]: 106: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,420 INFO L290 TraceCheckUtils]: 107: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,420 INFO L290 TraceCheckUtils]: 108: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < 32767); {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,420 INFO L290 TraceCheckUtils]: 109: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,421 INFO L290 TraceCheckUtils]: 110: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,421 INFO L290 TraceCheckUtils]: 111: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < 32767); {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,421 INFO L290 TraceCheckUtils]: 112: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,421 INFO L290 TraceCheckUtils]: 113: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,422 INFO L290 TraceCheckUtils]: 114: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < 32767); {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,422 INFO L290 TraceCheckUtils]: 115: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,422 INFO L290 TraceCheckUtils]: 116: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,422 INFO L290 TraceCheckUtils]: 117: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < 32767); {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,423 INFO L290 TraceCheckUtils]: 118: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,423 INFO L290 TraceCheckUtils]: 119: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,423 INFO L290 TraceCheckUtils]: 120: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < 32767); {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,424 INFO L290 TraceCheckUtils]: 121: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,424 INFO L290 TraceCheckUtils]: 122: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,424 INFO L290 TraceCheckUtils]: 123: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < 32767); {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,424 INFO L290 TraceCheckUtils]: 124: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,425 INFO L290 TraceCheckUtils]: 125: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,425 INFO L290 TraceCheckUtils]: 126: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < 32767); {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,425 INFO L290 TraceCheckUtils]: 127: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,425 INFO L290 TraceCheckUtils]: 128: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,426 INFO L290 TraceCheckUtils]: 129: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < 32767); {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,426 INFO L290 TraceCheckUtils]: 130: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,426 INFO L290 TraceCheckUtils]: 131: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,427 INFO L290 TraceCheckUtils]: 132: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < 32767); {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,427 INFO L290 TraceCheckUtils]: 133: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,427 INFO L290 TraceCheckUtils]: 134: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,427 INFO L290 TraceCheckUtils]: 135: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < 32767); {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,428 INFO L290 TraceCheckUtils]: 136: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,428 INFO L290 TraceCheckUtils]: 137: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,428 INFO L290 TraceCheckUtils]: 138: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < 32767); {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,428 INFO L290 TraceCheckUtils]: 139: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,429 INFO L290 TraceCheckUtils]: 140: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,429 INFO L290 TraceCheckUtils]: 141: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !(foo_~i~0#1 < 32767); {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,429 INFO L290 TraceCheckUtils]: 142: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} assume { :end_inline_foo } true; {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,430 INFO L290 TraceCheckUtils]: 143: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} SUMMARY for call main_#t~mem8#1 := read~int(~b~0.base, -4 + ~b~0.offset, 4); srcloc: L540 {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,430 INFO L290 TraceCheckUtils]: 144: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !(0 != main_#t~mem8#1);havoc main_#t~mem8#1; {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,430 INFO L290 TraceCheckUtils]: 145: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} assume 0 == ~a~0.offset; {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:06,431 INFO L290 TraceCheckUtils]: 146: Hoare triple {7078#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !(~a~0.base < #StackHeapBarrier); {7077#false} is VALID [2022-02-20 23:44:06,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1665 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1665 trivial. 0 not checked. [2022-02-20 23:44:06,431 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:44:06,432 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280366778] [2022-02-20 23:44:06,432 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280366778] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:44:06,432 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:44:06,432 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:44:06,432 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925614151] [2022-02-20 23:44:06,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:44:06,432 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 147 [2022-02-20 23:44:06,432 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:06,433 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:06,443 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:06,443 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:44:06,444 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:44:06,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:44:06,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:44:06,444 INFO L87 Difference]: Start difference. First operand 163 states and 164 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:06,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:06,465 INFO L93 Difference]: Finished difference Result 161 states and 162 transitions. [2022-02-20 23:44:06,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:44:06,465 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 147 [2022-02-20 23:44:06,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:06,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:06,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2022-02-20 23:44:06,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:06,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2022-02-20 23:44:06,466 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 33 transitions. [2022-02-20 23:44:06,485 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:06,487 INFO L225 Difference]: With dead ends: 161 [2022-02-20 23:44:06,487 INFO L226 Difference]: Without dead ends: 161 [2022-02-20 23:44:06,487 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:44:06,488 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 14 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:06,488 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 23 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:44:06,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-02-20 23:44:06,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2022-02-20 23:44:06,490 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:06,490 INFO L82 GeneralOperation]: Start isEquivalent. First operand 161 states. Second operand has 161 states, 157 states have (on average 1.0318471337579618) internal successors, (162), 160 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:06,490 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand has 161 states, 157 states have (on average 1.0318471337579618) internal successors, (162), 160 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:06,491 INFO L87 Difference]: Start difference. First operand 161 states. Second operand has 161 states, 157 states have (on average 1.0318471337579618) internal successors, (162), 160 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:06,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:06,493 INFO L93 Difference]: Finished difference Result 161 states and 162 transitions. [2022-02-20 23:44:06,493 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 162 transitions. [2022-02-20 23:44:06,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:06,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:06,493 INFO L74 IsIncluded]: Start isIncluded. First operand has 161 states, 157 states have (on average 1.0318471337579618) internal successors, (162), 160 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 161 states. [2022-02-20 23:44:06,493 INFO L87 Difference]: Start difference. First operand has 161 states, 157 states have (on average 1.0318471337579618) internal successors, (162), 160 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 161 states. [2022-02-20 23:44:06,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:06,495 INFO L93 Difference]: Finished difference Result 161 states and 162 transitions. [2022-02-20 23:44:06,495 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 162 transitions. [2022-02-20 23:44:06,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:06,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:06,496 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:06,496 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:06,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 157 states have (on average 1.0318471337579618) internal successors, (162), 160 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:06,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 162 transitions. [2022-02-20 23:44:06,498 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 162 transitions. Word has length 147 [2022-02-20 23:44:06,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:06,498 INFO L470 AbstractCegarLoop]: Abstraction has 161 states and 162 transitions. [2022-02-20 23:44:06,498 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:06,498 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 162 transitions. [2022-02-20 23:44:06,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-02-20 23:44:06,499 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:06,500 INFO L514 BasicCegarLoop]: trace histogram [30, 30, 30, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:44:06,500 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-20 23:44:06,500 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2022-02-20 23:44:06,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:06,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1125685499, now seen corresponding path program 1 times [2022-02-20 23:44:06,501 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:44:06,501 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563615976] [2022-02-20 23:44:06,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:06,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:44:06,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:06,747 INFO L290 TraceCheckUtils]: 0: Hoare triple {7725#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);~a~0.base, ~a~0.offset := 0, 0;~b~0.base, ~b~0.offset := 0, 0;~n~0 := 0; {7725#true} is VALID [2022-02-20 23:44:06,747 INFO L290 TraceCheckUtils]: 1: Hoare triple {7725#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~post7#1.base, main_#t~post7#1.offset, main_#t~mem8#1;~n~0 := 32768;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~a~0.base, ~a~0.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~b~0.base, ~b~0.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_#t~post7#1.base, main_#t~post7#1.offset := ~b~0.base, ~b~0.offset;~b~0.base, ~b~0.offset := main_#t~post7#1.base, 4 + main_#t~post7#1.offset; {7725#true} is VALID [2022-02-20 23:44:06,747 INFO L290 TraceCheckUtils]: 2: Hoare triple {7725#true} SUMMARY for call write~int(0, main_#t~post7#1.base, main_#t~post7#1.offset, 4); srcloc: L538 {7725#true} is VALID [2022-02-20 23:44:06,747 INFO L290 TraceCheckUtils]: 3: Hoare triple {7725#true} havoc main_#t~post7#1.base, main_#t~post7#1.offset;assume { :begin_inline_foo } true;havoc foo_#t~post3#1, foo_#t~post4#1, foo_~i~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {7725#true} is VALID [2022-02-20 23:44:06,747 INFO L290 TraceCheckUtils]: 4: Hoare triple {7725#true} assume !!(foo_~i~0#1 < ~n~0); {7725#true} is VALID [2022-02-20 23:44:06,747 INFO L290 TraceCheckUtils]: 5: Hoare triple {7725#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7725#true} is VALID [2022-02-20 23:44:06,747 INFO L290 TraceCheckUtils]: 6: Hoare triple {7725#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7725#true} is VALID [2022-02-20 23:44:06,747 INFO L290 TraceCheckUtils]: 7: Hoare triple {7725#true} assume !!(foo_~i~0#1 < ~n~0); {7725#true} is VALID [2022-02-20 23:44:06,747 INFO L290 TraceCheckUtils]: 8: Hoare triple {7725#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7725#true} is VALID [2022-02-20 23:44:06,747 INFO L290 TraceCheckUtils]: 9: Hoare triple {7725#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7725#true} is VALID [2022-02-20 23:44:06,747 INFO L290 TraceCheckUtils]: 10: Hoare triple {7725#true} assume !!(foo_~i~0#1 < ~n~0); {7725#true} is VALID [2022-02-20 23:44:06,747 INFO L290 TraceCheckUtils]: 11: Hoare triple {7725#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7725#true} is VALID [2022-02-20 23:44:06,747 INFO L290 TraceCheckUtils]: 12: Hoare triple {7725#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7725#true} is VALID [2022-02-20 23:44:06,747 INFO L290 TraceCheckUtils]: 13: Hoare triple {7725#true} assume !!(foo_~i~0#1 < ~n~0); {7725#true} is VALID [2022-02-20 23:44:06,748 INFO L290 TraceCheckUtils]: 14: Hoare triple {7725#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7725#true} is VALID [2022-02-20 23:44:06,748 INFO L290 TraceCheckUtils]: 15: Hoare triple {7725#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7725#true} is VALID [2022-02-20 23:44:06,748 INFO L290 TraceCheckUtils]: 16: Hoare triple {7725#true} assume !!(foo_~i~0#1 < ~n~0); {7725#true} is VALID [2022-02-20 23:44:06,748 INFO L290 TraceCheckUtils]: 17: Hoare triple {7725#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7725#true} is VALID [2022-02-20 23:44:06,748 INFO L290 TraceCheckUtils]: 18: Hoare triple {7725#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7725#true} is VALID [2022-02-20 23:44:06,748 INFO L290 TraceCheckUtils]: 19: Hoare triple {7725#true} assume !!(foo_~i~0#1 < ~n~0); {7725#true} is VALID [2022-02-20 23:44:06,748 INFO L290 TraceCheckUtils]: 20: Hoare triple {7725#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7725#true} is VALID [2022-02-20 23:44:06,748 INFO L290 TraceCheckUtils]: 21: Hoare triple {7725#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7725#true} is VALID [2022-02-20 23:44:06,748 INFO L290 TraceCheckUtils]: 22: Hoare triple {7725#true} assume !!(foo_~i~0#1 < ~n~0); {7725#true} is VALID [2022-02-20 23:44:06,748 INFO L290 TraceCheckUtils]: 23: Hoare triple {7725#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7725#true} is VALID [2022-02-20 23:44:06,748 INFO L290 TraceCheckUtils]: 24: Hoare triple {7725#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7725#true} is VALID [2022-02-20 23:44:06,748 INFO L290 TraceCheckUtils]: 25: Hoare triple {7725#true} assume !!(foo_~i~0#1 < ~n~0); {7725#true} is VALID [2022-02-20 23:44:06,748 INFO L290 TraceCheckUtils]: 26: Hoare triple {7725#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7725#true} is VALID [2022-02-20 23:44:06,748 INFO L290 TraceCheckUtils]: 27: Hoare triple {7725#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7725#true} is VALID [2022-02-20 23:44:06,748 INFO L290 TraceCheckUtils]: 28: Hoare triple {7725#true} assume !!(foo_~i~0#1 < ~n~0); {7725#true} is VALID [2022-02-20 23:44:06,748 INFO L290 TraceCheckUtils]: 29: Hoare triple {7725#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7725#true} is VALID [2022-02-20 23:44:06,748 INFO L290 TraceCheckUtils]: 30: Hoare triple {7725#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7725#true} is VALID [2022-02-20 23:44:06,748 INFO L290 TraceCheckUtils]: 31: Hoare triple {7725#true} assume !!(foo_~i~0#1 < ~n~0); {7725#true} is VALID [2022-02-20 23:44:06,748 INFO L290 TraceCheckUtils]: 32: Hoare triple {7725#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7725#true} is VALID [2022-02-20 23:44:06,748 INFO L290 TraceCheckUtils]: 33: Hoare triple {7725#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7725#true} is VALID [2022-02-20 23:44:06,748 INFO L290 TraceCheckUtils]: 34: Hoare triple {7725#true} assume !!(foo_~i~0#1 < ~n~0); {7725#true} is VALID [2022-02-20 23:44:06,748 INFO L290 TraceCheckUtils]: 35: Hoare triple {7725#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7725#true} is VALID [2022-02-20 23:44:06,749 INFO L290 TraceCheckUtils]: 36: Hoare triple {7725#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7725#true} is VALID [2022-02-20 23:44:06,749 INFO L290 TraceCheckUtils]: 37: Hoare triple {7725#true} assume !!(foo_~i~0#1 < ~n~0); {7725#true} is VALID [2022-02-20 23:44:06,749 INFO L290 TraceCheckUtils]: 38: Hoare triple {7725#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7725#true} is VALID [2022-02-20 23:44:06,749 INFO L290 TraceCheckUtils]: 39: Hoare triple {7725#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7725#true} is VALID [2022-02-20 23:44:06,749 INFO L290 TraceCheckUtils]: 40: Hoare triple {7725#true} assume !!(foo_~i~0#1 < ~n~0); {7725#true} is VALID [2022-02-20 23:44:06,749 INFO L290 TraceCheckUtils]: 41: Hoare triple {7725#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7725#true} is VALID [2022-02-20 23:44:06,749 INFO L290 TraceCheckUtils]: 42: Hoare triple {7725#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7725#true} is VALID [2022-02-20 23:44:06,749 INFO L290 TraceCheckUtils]: 43: Hoare triple {7725#true} assume !!(foo_~i~0#1 < ~n~0); {7725#true} is VALID [2022-02-20 23:44:06,749 INFO L290 TraceCheckUtils]: 44: Hoare triple {7725#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7725#true} is VALID [2022-02-20 23:44:06,749 INFO L290 TraceCheckUtils]: 45: Hoare triple {7725#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7725#true} is VALID [2022-02-20 23:44:06,749 INFO L290 TraceCheckUtils]: 46: Hoare triple {7725#true} assume !!(foo_~i~0#1 < ~n~0); {7725#true} is VALID [2022-02-20 23:44:06,749 INFO L290 TraceCheckUtils]: 47: Hoare triple {7725#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7725#true} is VALID [2022-02-20 23:44:06,749 INFO L290 TraceCheckUtils]: 48: Hoare triple {7725#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7725#true} is VALID [2022-02-20 23:44:06,749 INFO L290 TraceCheckUtils]: 49: Hoare triple {7725#true} assume !!(foo_~i~0#1 < ~n~0); {7725#true} is VALID [2022-02-20 23:44:06,749 INFO L290 TraceCheckUtils]: 50: Hoare triple {7725#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7725#true} is VALID [2022-02-20 23:44:06,749 INFO L290 TraceCheckUtils]: 51: Hoare triple {7725#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7725#true} is VALID [2022-02-20 23:44:06,749 INFO L290 TraceCheckUtils]: 52: Hoare triple {7725#true} assume !!(foo_~i~0#1 < ~n~0); {7725#true} is VALID [2022-02-20 23:44:06,749 INFO L290 TraceCheckUtils]: 53: Hoare triple {7725#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7725#true} is VALID [2022-02-20 23:44:06,749 INFO L290 TraceCheckUtils]: 54: Hoare triple {7725#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7725#true} is VALID [2022-02-20 23:44:06,749 INFO L290 TraceCheckUtils]: 55: Hoare triple {7725#true} assume !!(foo_~i~0#1 < ~n~0); {7725#true} is VALID [2022-02-20 23:44:06,749 INFO L290 TraceCheckUtils]: 56: Hoare triple {7725#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7725#true} is VALID [2022-02-20 23:44:06,750 INFO L290 TraceCheckUtils]: 57: Hoare triple {7725#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7725#true} is VALID [2022-02-20 23:44:06,750 INFO L290 TraceCheckUtils]: 58: Hoare triple {7725#true} assume !!(foo_~i~0#1 < ~n~0); {7725#true} is VALID [2022-02-20 23:44:06,750 INFO L290 TraceCheckUtils]: 59: Hoare triple {7725#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7725#true} is VALID [2022-02-20 23:44:06,750 INFO L290 TraceCheckUtils]: 60: Hoare triple {7725#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7725#true} is VALID [2022-02-20 23:44:06,750 INFO L290 TraceCheckUtils]: 61: Hoare triple {7725#true} assume !!(foo_~i~0#1 < ~n~0); {7725#true} is VALID [2022-02-20 23:44:06,750 INFO L290 TraceCheckUtils]: 62: Hoare triple {7725#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7725#true} is VALID [2022-02-20 23:44:06,750 INFO L290 TraceCheckUtils]: 63: Hoare triple {7725#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7725#true} is VALID [2022-02-20 23:44:06,750 INFO L290 TraceCheckUtils]: 64: Hoare triple {7725#true} assume !!(foo_~i~0#1 < ~n~0); {7725#true} is VALID [2022-02-20 23:44:06,750 INFO L290 TraceCheckUtils]: 65: Hoare triple {7725#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7725#true} is VALID [2022-02-20 23:44:06,750 INFO L290 TraceCheckUtils]: 66: Hoare triple {7725#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7725#true} is VALID [2022-02-20 23:44:06,750 INFO L290 TraceCheckUtils]: 67: Hoare triple {7725#true} assume !!(foo_~i~0#1 < ~n~0); {7725#true} is VALID [2022-02-20 23:44:06,750 INFO L290 TraceCheckUtils]: 68: Hoare triple {7725#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7725#true} is VALID [2022-02-20 23:44:06,750 INFO L290 TraceCheckUtils]: 69: Hoare triple {7725#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7725#true} is VALID [2022-02-20 23:44:06,750 INFO L290 TraceCheckUtils]: 70: Hoare triple {7725#true} assume !!(foo_~i~0#1 < ~n~0); {7725#true} is VALID [2022-02-20 23:44:06,750 INFO L290 TraceCheckUtils]: 71: Hoare triple {7725#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7725#true} is VALID [2022-02-20 23:44:06,750 INFO L290 TraceCheckUtils]: 72: Hoare triple {7725#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7725#true} is VALID [2022-02-20 23:44:06,750 INFO L290 TraceCheckUtils]: 73: Hoare triple {7725#true} assume !!(foo_~i~0#1 < ~n~0); {7725#true} is VALID [2022-02-20 23:44:06,750 INFO L290 TraceCheckUtils]: 74: Hoare triple {7725#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7725#true} is VALID [2022-02-20 23:44:06,750 INFO L290 TraceCheckUtils]: 75: Hoare triple {7725#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7725#true} is VALID [2022-02-20 23:44:06,750 INFO L290 TraceCheckUtils]: 76: Hoare triple {7725#true} assume !!(foo_~i~0#1 < ~n~0); {7725#true} is VALID [2022-02-20 23:44:06,750 INFO L290 TraceCheckUtils]: 77: Hoare triple {7725#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7725#true} is VALID [2022-02-20 23:44:06,750 INFO L290 TraceCheckUtils]: 78: Hoare triple {7725#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7725#true} is VALID [2022-02-20 23:44:06,751 INFO L290 TraceCheckUtils]: 79: Hoare triple {7725#true} assume !!(foo_~i~0#1 < ~n~0); {7725#true} is VALID [2022-02-20 23:44:06,751 INFO L290 TraceCheckUtils]: 80: Hoare triple {7725#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7725#true} is VALID [2022-02-20 23:44:06,751 INFO L290 TraceCheckUtils]: 81: Hoare triple {7725#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7725#true} is VALID [2022-02-20 23:44:06,751 INFO L290 TraceCheckUtils]: 82: Hoare triple {7725#true} assume !!(foo_~i~0#1 < ~n~0); {7725#true} is VALID [2022-02-20 23:44:06,751 INFO L290 TraceCheckUtils]: 83: Hoare triple {7725#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7725#true} is VALID [2022-02-20 23:44:06,751 INFO L290 TraceCheckUtils]: 84: Hoare triple {7725#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7725#true} is VALID [2022-02-20 23:44:06,752 INFO L290 TraceCheckUtils]: 85: Hoare triple {7725#true} assume !!(foo_~i~0#1 < ~n~0); {7725#true} is VALID [2022-02-20 23:44:06,752 INFO L290 TraceCheckUtils]: 86: Hoare triple {7725#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7725#true} is VALID [2022-02-20 23:44:06,752 INFO L290 TraceCheckUtils]: 87: Hoare triple {7725#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7725#true} is VALID [2022-02-20 23:44:06,752 INFO L290 TraceCheckUtils]: 88: Hoare triple {7725#true} assume !!(foo_~i~0#1 < ~n~0); {7725#true} is VALID [2022-02-20 23:44:06,752 INFO L290 TraceCheckUtils]: 89: Hoare triple {7725#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7725#true} is VALID [2022-02-20 23:44:06,752 INFO L290 TraceCheckUtils]: 90: Hoare triple {7725#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7725#true} is VALID [2022-02-20 23:44:06,752 INFO L290 TraceCheckUtils]: 91: Hoare triple {7725#true} assume !!(foo_~i~0#1 < ~n~0); {7725#true} is VALID [2022-02-20 23:44:06,752 INFO L290 TraceCheckUtils]: 92: Hoare triple {7725#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7725#true} is VALID [2022-02-20 23:44:06,752 INFO L290 TraceCheckUtils]: 93: Hoare triple {7725#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7725#true} is VALID [2022-02-20 23:44:06,752 INFO L290 TraceCheckUtils]: 94: Hoare triple {7725#true} assume !(foo_~i~0#1 < ~n~0); {7725#true} is VALID [2022-02-20 23:44:06,752 INFO L290 TraceCheckUtils]: 95: Hoare triple {7725#true} foo_~i~0#1 := 0; {7727#(= |ULTIMATE.start_foo_~i~0#1| 0)} is VALID [2022-02-20 23:44:06,752 INFO L290 TraceCheckUtils]: 96: Hoare triple {7727#(= |ULTIMATE.start_foo_~i~0#1| 0)} assume !!(foo_~i~0#1 < 32767); {7727#(= |ULTIMATE.start_foo_~i~0#1| 0)} is VALID [2022-02-20 23:44:06,753 INFO L290 TraceCheckUtils]: 97: Hoare triple {7727#(= |ULTIMATE.start_foo_~i~0#1| 0)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7727#(= |ULTIMATE.start_foo_~i~0#1| 0)} is VALID [2022-02-20 23:44:06,753 INFO L290 TraceCheckUtils]: 98: Hoare triple {7727#(= |ULTIMATE.start_foo_~i~0#1| 0)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7728#(<= |ULTIMATE.start_foo_~i~0#1| 1)} is VALID [2022-02-20 23:44:06,753 INFO L290 TraceCheckUtils]: 99: Hoare triple {7728#(<= |ULTIMATE.start_foo_~i~0#1| 1)} assume !!(foo_~i~0#1 < 32767); {7728#(<= |ULTIMATE.start_foo_~i~0#1| 1)} is VALID [2022-02-20 23:44:06,753 INFO L290 TraceCheckUtils]: 100: Hoare triple {7728#(<= |ULTIMATE.start_foo_~i~0#1| 1)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7728#(<= |ULTIMATE.start_foo_~i~0#1| 1)} is VALID [2022-02-20 23:44:06,754 INFO L290 TraceCheckUtils]: 101: Hoare triple {7728#(<= |ULTIMATE.start_foo_~i~0#1| 1)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7729#(<= |ULTIMATE.start_foo_~i~0#1| 2)} is VALID [2022-02-20 23:44:06,754 INFO L290 TraceCheckUtils]: 102: Hoare triple {7729#(<= |ULTIMATE.start_foo_~i~0#1| 2)} assume !!(foo_~i~0#1 < 32767); {7729#(<= |ULTIMATE.start_foo_~i~0#1| 2)} is VALID [2022-02-20 23:44:06,754 INFO L290 TraceCheckUtils]: 103: Hoare triple {7729#(<= |ULTIMATE.start_foo_~i~0#1| 2)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7729#(<= |ULTIMATE.start_foo_~i~0#1| 2)} is VALID [2022-02-20 23:44:06,754 INFO L290 TraceCheckUtils]: 104: Hoare triple {7729#(<= |ULTIMATE.start_foo_~i~0#1| 2)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7730#(<= |ULTIMATE.start_foo_~i~0#1| 3)} is VALID [2022-02-20 23:44:06,755 INFO L290 TraceCheckUtils]: 105: Hoare triple {7730#(<= |ULTIMATE.start_foo_~i~0#1| 3)} assume !!(foo_~i~0#1 < 32767); {7730#(<= |ULTIMATE.start_foo_~i~0#1| 3)} is VALID [2022-02-20 23:44:06,755 INFO L290 TraceCheckUtils]: 106: Hoare triple {7730#(<= |ULTIMATE.start_foo_~i~0#1| 3)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7730#(<= |ULTIMATE.start_foo_~i~0#1| 3)} is VALID [2022-02-20 23:44:06,755 INFO L290 TraceCheckUtils]: 107: Hoare triple {7730#(<= |ULTIMATE.start_foo_~i~0#1| 3)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7731#(<= |ULTIMATE.start_foo_~i~0#1| 4)} is VALID [2022-02-20 23:44:06,756 INFO L290 TraceCheckUtils]: 108: Hoare triple {7731#(<= |ULTIMATE.start_foo_~i~0#1| 4)} assume !!(foo_~i~0#1 < 32767); {7731#(<= |ULTIMATE.start_foo_~i~0#1| 4)} is VALID [2022-02-20 23:44:06,756 INFO L290 TraceCheckUtils]: 109: Hoare triple {7731#(<= |ULTIMATE.start_foo_~i~0#1| 4)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7731#(<= |ULTIMATE.start_foo_~i~0#1| 4)} is VALID [2022-02-20 23:44:06,756 INFO L290 TraceCheckUtils]: 110: Hoare triple {7731#(<= |ULTIMATE.start_foo_~i~0#1| 4)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7732#(<= |ULTIMATE.start_foo_~i~0#1| 5)} is VALID [2022-02-20 23:44:06,756 INFO L290 TraceCheckUtils]: 111: Hoare triple {7732#(<= |ULTIMATE.start_foo_~i~0#1| 5)} assume !!(foo_~i~0#1 < 32767); {7732#(<= |ULTIMATE.start_foo_~i~0#1| 5)} is VALID [2022-02-20 23:44:06,757 INFO L290 TraceCheckUtils]: 112: Hoare triple {7732#(<= |ULTIMATE.start_foo_~i~0#1| 5)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7732#(<= |ULTIMATE.start_foo_~i~0#1| 5)} is VALID [2022-02-20 23:44:06,757 INFO L290 TraceCheckUtils]: 113: Hoare triple {7732#(<= |ULTIMATE.start_foo_~i~0#1| 5)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7733#(<= |ULTIMATE.start_foo_~i~0#1| 6)} is VALID [2022-02-20 23:44:06,757 INFO L290 TraceCheckUtils]: 114: Hoare triple {7733#(<= |ULTIMATE.start_foo_~i~0#1| 6)} assume !!(foo_~i~0#1 < 32767); {7733#(<= |ULTIMATE.start_foo_~i~0#1| 6)} is VALID [2022-02-20 23:44:06,757 INFO L290 TraceCheckUtils]: 115: Hoare triple {7733#(<= |ULTIMATE.start_foo_~i~0#1| 6)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7733#(<= |ULTIMATE.start_foo_~i~0#1| 6)} is VALID [2022-02-20 23:44:06,758 INFO L290 TraceCheckUtils]: 116: Hoare triple {7733#(<= |ULTIMATE.start_foo_~i~0#1| 6)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7734#(<= |ULTIMATE.start_foo_~i~0#1| 7)} is VALID [2022-02-20 23:44:06,758 INFO L290 TraceCheckUtils]: 117: Hoare triple {7734#(<= |ULTIMATE.start_foo_~i~0#1| 7)} assume !!(foo_~i~0#1 < 32767); {7734#(<= |ULTIMATE.start_foo_~i~0#1| 7)} is VALID [2022-02-20 23:44:06,758 INFO L290 TraceCheckUtils]: 118: Hoare triple {7734#(<= |ULTIMATE.start_foo_~i~0#1| 7)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7734#(<= |ULTIMATE.start_foo_~i~0#1| 7)} is VALID [2022-02-20 23:44:06,758 INFO L290 TraceCheckUtils]: 119: Hoare triple {7734#(<= |ULTIMATE.start_foo_~i~0#1| 7)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7735#(<= |ULTIMATE.start_foo_~i~0#1| 8)} is VALID [2022-02-20 23:44:06,759 INFO L290 TraceCheckUtils]: 120: Hoare triple {7735#(<= |ULTIMATE.start_foo_~i~0#1| 8)} assume !!(foo_~i~0#1 < 32767); {7735#(<= |ULTIMATE.start_foo_~i~0#1| 8)} is VALID [2022-02-20 23:44:06,759 INFO L290 TraceCheckUtils]: 121: Hoare triple {7735#(<= |ULTIMATE.start_foo_~i~0#1| 8)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7735#(<= |ULTIMATE.start_foo_~i~0#1| 8)} is VALID [2022-02-20 23:44:06,759 INFO L290 TraceCheckUtils]: 122: Hoare triple {7735#(<= |ULTIMATE.start_foo_~i~0#1| 8)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7736#(<= |ULTIMATE.start_foo_~i~0#1| 9)} is VALID [2022-02-20 23:44:06,759 INFO L290 TraceCheckUtils]: 123: Hoare triple {7736#(<= |ULTIMATE.start_foo_~i~0#1| 9)} assume !!(foo_~i~0#1 < 32767); {7736#(<= |ULTIMATE.start_foo_~i~0#1| 9)} is VALID [2022-02-20 23:44:06,760 INFO L290 TraceCheckUtils]: 124: Hoare triple {7736#(<= |ULTIMATE.start_foo_~i~0#1| 9)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7736#(<= |ULTIMATE.start_foo_~i~0#1| 9)} is VALID [2022-02-20 23:44:06,760 INFO L290 TraceCheckUtils]: 125: Hoare triple {7736#(<= |ULTIMATE.start_foo_~i~0#1| 9)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7737#(<= |ULTIMATE.start_foo_~i~0#1| 10)} is VALID [2022-02-20 23:44:06,760 INFO L290 TraceCheckUtils]: 126: Hoare triple {7737#(<= |ULTIMATE.start_foo_~i~0#1| 10)} assume !!(foo_~i~0#1 < 32767); {7737#(<= |ULTIMATE.start_foo_~i~0#1| 10)} is VALID [2022-02-20 23:44:06,761 INFO L290 TraceCheckUtils]: 127: Hoare triple {7737#(<= |ULTIMATE.start_foo_~i~0#1| 10)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7737#(<= |ULTIMATE.start_foo_~i~0#1| 10)} is VALID [2022-02-20 23:44:06,761 INFO L290 TraceCheckUtils]: 128: Hoare triple {7737#(<= |ULTIMATE.start_foo_~i~0#1| 10)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7738#(<= |ULTIMATE.start_foo_~i~0#1| 11)} is VALID [2022-02-20 23:44:06,761 INFO L290 TraceCheckUtils]: 129: Hoare triple {7738#(<= |ULTIMATE.start_foo_~i~0#1| 11)} assume !!(foo_~i~0#1 < 32767); {7738#(<= |ULTIMATE.start_foo_~i~0#1| 11)} is VALID [2022-02-20 23:44:06,761 INFO L290 TraceCheckUtils]: 130: Hoare triple {7738#(<= |ULTIMATE.start_foo_~i~0#1| 11)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7738#(<= |ULTIMATE.start_foo_~i~0#1| 11)} is VALID [2022-02-20 23:44:06,762 INFO L290 TraceCheckUtils]: 131: Hoare triple {7738#(<= |ULTIMATE.start_foo_~i~0#1| 11)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7739#(<= |ULTIMATE.start_foo_~i~0#1| 12)} is VALID [2022-02-20 23:44:06,762 INFO L290 TraceCheckUtils]: 132: Hoare triple {7739#(<= |ULTIMATE.start_foo_~i~0#1| 12)} assume !!(foo_~i~0#1 < 32767); {7739#(<= |ULTIMATE.start_foo_~i~0#1| 12)} is VALID [2022-02-20 23:44:06,762 INFO L290 TraceCheckUtils]: 133: Hoare triple {7739#(<= |ULTIMATE.start_foo_~i~0#1| 12)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7739#(<= |ULTIMATE.start_foo_~i~0#1| 12)} is VALID [2022-02-20 23:44:06,763 INFO L290 TraceCheckUtils]: 134: Hoare triple {7739#(<= |ULTIMATE.start_foo_~i~0#1| 12)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7740#(<= |ULTIMATE.start_foo_~i~0#1| 13)} is VALID [2022-02-20 23:44:06,763 INFO L290 TraceCheckUtils]: 135: Hoare triple {7740#(<= |ULTIMATE.start_foo_~i~0#1| 13)} assume !!(foo_~i~0#1 < 32767); {7740#(<= |ULTIMATE.start_foo_~i~0#1| 13)} is VALID [2022-02-20 23:44:06,763 INFO L290 TraceCheckUtils]: 136: Hoare triple {7740#(<= |ULTIMATE.start_foo_~i~0#1| 13)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7740#(<= |ULTIMATE.start_foo_~i~0#1| 13)} is VALID [2022-02-20 23:44:06,763 INFO L290 TraceCheckUtils]: 137: Hoare triple {7740#(<= |ULTIMATE.start_foo_~i~0#1| 13)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7741#(<= |ULTIMATE.start_foo_~i~0#1| 14)} is VALID [2022-02-20 23:44:06,764 INFO L290 TraceCheckUtils]: 138: Hoare triple {7741#(<= |ULTIMATE.start_foo_~i~0#1| 14)} assume !!(foo_~i~0#1 < 32767); {7741#(<= |ULTIMATE.start_foo_~i~0#1| 14)} is VALID [2022-02-20 23:44:06,764 INFO L290 TraceCheckUtils]: 139: Hoare triple {7741#(<= |ULTIMATE.start_foo_~i~0#1| 14)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7741#(<= |ULTIMATE.start_foo_~i~0#1| 14)} is VALID [2022-02-20 23:44:06,764 INFO L290 TraceCheckUtils]: 140: Hoare triple {7741#(<= |ULTIMATE.start_foo_~i~0#1| 14)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7742#(<= |ULTIMATE.start_foo_~i~0#1| 15)} is VALID [2022-02-20 23:44:06,764 INFO L290 TraceCheckUtils]: 141: Hoare triple {7742#(<= |ULTIMATE.start_foo_~i~0#1| 15)} assume !(foo_~i~0#1 < 32767); {7726#false} is VALID [2022-02-20 23:44:06,764 INFO L290 TraceCheckUtils]: 142: Hoare triple {7726#false} assume { :end_inline_foo } true; {7726#false} is VALID [2022-02-20 23:44:06,765 INFO L290 TraceCheckUtils]: 143: Hoare triple {7726#false} SUMMARY for call main_#t~mem8#1 := read~int(~b~0.base, -4 + ~b~0.offset, 4); srcloc: L540 {7726#false} is VALID [2022-02-20 23:44:06,765 INFO L290 TraceCheckUtils]: 144: Hoare triple {7726#false} assume 0 != main_#t~mem8#1;havoc main_#t~mem8#1; {7726#false} is VALID [2022-02-20 23:44:06,765 INFO L290 TraceCheckUtils]: 145: Hoare triple {7726#false} assume 0 == ~a~0.offset; {7726#false} is VALID [2022-02-20 23:44:06,765 INFO L290 TraceCheckUtils]: 146: Hoare triple {7726#false} assume ~a~0.base < #StackHeapBarrier; {7726#false} is VALID [2022-02-20 23:44:06,765 INFO L290 TraceCheckUtils]: 147: Hoare triple {7726#false} assume 0 == ~a~0.base || 1 == #valid[~a~0.base];call ULTIMATE.dealloc(~a~0.base, ~a~0.offset); {7726#false} is VALID [2022-02-20 23:44:06,765 INFO L290 TraceCheckUtils]: 148: Hoare triple {7726#false} assume !(0 == ~b~0.offset); {7726#false} is VALID [2022-02-20 23:44:06,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1665 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 1335 trivial. 0 not checked. [2022-02-20 23:44:06,766 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:44:06,766 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563615976] [2022-02-20 23:44:06,766 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563615976] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:44:06,766 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [4374413] [2022-02-20 23:44:06,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:06,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:44:06,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:44:06,767 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:44:06,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-02-20 23:44:06,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:06,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 33 conjunts are in the unsatisfiable core [2022-02-20 23:44:06,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:06,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:44:08,215 INFO L290 TraceCheckUtils]: 0: Hoare triple {7725#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);~a~0.base, ~a~0.offset := 0, 0;~b~0.base, ~b~0.offset := 0, 0;~n~0 := 0; {7725#true} is VALID [2022-02-20 23:44:08,215 INFO L290 TraceCheckUtils]: 1: Hoare triple {7725#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~post7#1.base, main_#t~post7#1.offset, main_#t~mem8#1;~n~0 := 32768;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~a~0.base, ~a~0.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~b~0.base, ~b~0.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_#t~post7#1.base, main_#t~post7#1.offset := ~b~0.base, ~b~0.offset;~b~0.base, ~b~0.offset := main_#t~post7#1.base, 4 + main_#t~post7#1.offset; {7749#(<= 32768 ~n~0)} is VALID [2022-02-20 23:44:08,216 INFO L290 TraceCheckUtils]: 2: Hoare triple {7749#(<= 32768 ~n~0)} SUMMARY for call write~int(0, main_#t~post7#1.base, main_#t~post7#1.offset, 4); srcloc: L538 {7749#(<= 32768 ~n~0)} is VALID [2022-02-20 23:44:08,216 INFO L290 TraceCheckUtils]: 3: Hoare triple {7749#(<= 32768 ~n~0)} havoc main_#t~post7#1.base, main_#t~post7#1.offset;assume { :begin_inline_foo } true;havoc foo_#t~post3#1, foo_#t~post4#1, foo_~i~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {7756#(and (<= |ULTIMATE.start_foo_~i~0#1| 0) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:08,216 INFO L290 TraceCheckUtils]: 4: Hoare triple {7756#(and (<= |ULTIMATE.start_foo_~i~0#1| 0) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {7756#(and (<= |ULTIMATE.start_foo_~i~0#1| 0) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:08,218 INFO L290 TraceCheckUtils]: 5: Hoare triple {7756#(and (<= |ULTIMATE.start_foo_~i~0#1| 0) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7756#(and (<= |ULTIMATE.start_foo_~i~0#1| 0) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:08,218 INFO L290 TraceCheckUtils]: 6: Hoare triple {7756#(and (<= |ULTIMATE.start_foo_~i~0#1| 0) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7766#(and (<= |ULTIMATE.start_foo_~i~0#1| 1) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:08,218 INFO L290 TraceCheckUtils]: 7: Hoare triple {7766#(and (<= |ULTIMATE.start_foo_~i~0#1| 1) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {7766#(and (<= |ULTIMATE.start_foo_~i~0#1| 1) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:08,219 INFO L290 TraceCheckUtils]: 8: Hoare triple {7766#(and (<= |ULTIMATE.start_foo_~i~0#1| 1) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7766#(and (<= |ULTIMATE.start_foo_~i~0#1| 1) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:08,219 INFO L290 TraceCheckUtils]: 9: Hoare triple {7766#(and (<= |ULTIMATE.start_foo_~i~0#1| 1) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7776#(and (<= |ULTIMATE.start_foo_~i~0#1| 2) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:08,219 INFO L290 TraceCheckUtils]: 10: Hoare triple {7776#(and (<= |ULTIMATE.start_foo_~i~0#1| 2) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {7776#(and (<= |ULTIMATE.start_foo_~i~0#1| 2) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:08,220 INFO L290 TraceCheckUtils]: 11: Hoare triple {7776#(and (<= |ULTIMATE.start_foo_~i~0#1| 2) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7776#(and (<= |ULTIMATE.start_foo_~i~0#1| 2) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:08,220 INFO L290 TraceCheckUtils]: 12: Hoare triple {7776#(and (<= |ULTIMATE.start_foo_~i~0#1| 2) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7786#(and (<= |ULTIMATE.start_foo_~i~0#1| 3) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:08,221 INFO L290 TraceCheckUtils]: 13: Hoare triple {7786#(and (<= |ULTIMATE.start_foo_~i~0#1| 3) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {7786#(and (<= |ULTIMATE.start_foo_~i~0#1| 3) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:08,221 INFO L290 TraceCheckUtils]: 14: Hoare triple {7786#(and (<= |ULTIMATE.start_foo_~i~0#1| 3) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7786#(and (<= |ULTIMATE.start_foo_~i~0#1| 3) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:08,221 INFO L290 TraceCheckUtils]: 15: Hoare triple {7786#(and (<= |ULTIMATE.start_foo_~i~0#1| 3) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7796#(and (<= |ULTIMATE.start_foo_~i~0#1| 4) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:08,222 INFO L290 TraceCheckUtils]: 16: Hoare triple {7796#(and (<= |ULTIMATE.start_foo_~i~0#1| 4) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {7796#(and (<= |ULTIMATE.start_foo_~i~0#1| 4) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:08,222 INFO L290 TraceCheckUtils]: 17: Hoare triple {7796#(and (<= |ULTIMATE.start_foo_~i~0#1| 4) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7796#(and (<= |ULTIMATE.start_foo_~i~0#1| 4) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:08,223 INFO L290 TraceCheckUtils]: 18: Hoare triple {7796#(and (<= |ULTIMATE.start_foo_~i~0#1| 4) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7806#(and (<= |ULTIMATE.start_foo_~i~0#1| 5) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:08,223 INFO L290 TraceCheckUtils]: 19: Hoare triple {7806#(and (<= |ULTIMATE.start_foo_~i~0#1| 5) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {7806#(and (<= |ULTIMATE.start_foo_~i~0#1| 5) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:08,223 INFO L290 TraceCheckUtils]: 20: Hoare triple {7806#(and (<= |ULTIMATE.start_foo_~i~0#1| 5) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7806#(and (<= |ULTIMATE.start_foo_~i~0#1| 5) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:08,224 INFO L290 TraceCheckUtils]: 21: Hoare triple {7806#(and (<= |ULTIMATE.start_foo_~i~0#1| 5) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7816#(and (<= |ULTIMATE.start_foo_~i~0#1| 6) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:08,239 INFO L290 TraceCheckUtils]: 22: Hoare triple {7816#(and (<= |ULTIMATE.start_foo_~i~0#1| 6) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {7816#(and (<= |ULTIMATE.start_foo_~i~0#1| 6) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:08,240 INFO L290 TraceCheckUtils]: 23: Hoare triple {7816#(and (<= |ULTIMATE.start_foo_~i~0#1| 6) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7816#(and (<= |ULTIMATE.start_foo_~i~0#1| 6) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:08,240 INFO L290 TraceCheckUtils]: 24: Hoare triple {7816#(and (<= |ULTIMATE.start_foo_~i~0#1| 6) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7826#(and (<= |ULTIMATE.start_foo_~i~0#1| 7) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:08,241 INFO L290 TraceCheckUtils]: 25: Hoare triple {7826#(and (<= |ULTIMATE.start_foo_~i~0#1| 7) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {7826#(and (<= |ULTIMATE.start_foo_~i~0#1| 7) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:08,241 INFO L290 TraceCheckUtils]: 26: Hoare triple {7826#(and (<= |ULTIMATE.start_foo_~i~0#1| 7) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7826#(and (<= |ULTIMATE.start_foo_~i~0#1| 7) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:08,241 INFO L290 TraceCheckUtils]: 27: Hoare triple {7826#(and (<= |ULTIMATE.start_foo_~i~0#1| 7) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7836#(and (<= |ULTIMATE.start_foo_~i~0#1| 8) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:08,242 INFO L290 TraceCheckUtils]: 28: Hoare triple {7836#(and (<= |ULTIMATE.start_foo_~i~0#1| 8) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {7836#(and (<= |ULTIMATE.start_foo_~i~0#1| 8) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:08,242 INFO L290 TraceCheckUtils]: 29: Hoare triple {7836#(and (<= |ULTIMATE.start_foo_~i~0#1| 8) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7836#(and (<= |ULTIMATE.start_foo_~i~0#1| 8) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:08,243 INFO L290 TraceCheckUtils]: 30: Hoare triple {7836#(and (<= |ULTIMATE.start_foo_~i~0#1| 8) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7846#(and (<= |ULTIMATE.start_foo_~i~0#1| 9) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:08,243 INFO L290 TraceCheckUtils]: 31: Hoare triple {7846#(and (<= |ULTIMATE.start_foo_~i~0#1| 9) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {7846#(and (<= |ULTIMATE.start_foo_~i~0#1| 9) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:08,244 INFO L290 TraceCheckUtils]: 32: Hoare triple {7846#(and (<= |ULTIMATE.start_foo_~i~0#1| 9) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7846#(and (<= |ULTIMATE.start_foo_~i~0#1| 9) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:08,244 INFO L290 TraceCheckUtils]: 33: Hoare triple {7846#(and (<= |ULTIMATE.start_foo_~i~0#1| 9) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7856#(and (<= 32768 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 10))} is VALID [2022-02-20 23:44:08,244 INFO L290 TraceCheckUtils]: 34: Hoare triple {7856#(and (<= 32768 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 10))} assume !!(foo_~i~0#1 < ~n~0); {7856#(and (<= 32768 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 10))} is VALID [2022-02-20 23:44:08,245 INFO L290 TraceCheckUtils]: 35: Hoare triple {7856#(and (<= 32768 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 10))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7856#(and (<= 32768 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 10))} is VALID [2022-02-20 23:44:08,245 INFO L290 TraceCheckUtils]: 36: Hoare triple {7856#(and (<= 32768 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 10))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7866#(and (<= |ULTIMATE.start_foo_~i~0#1| 11) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:08,246 INFO L290 TraceCheckUtils]: 37: Hoare triple {7866#(and (<= |ULTIMATE.start_foo_~i~0#1| 11) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {7866#(and (<= |ULTIMATE.start_foo_~i~0#1| 11) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:08,246 INFO L290 TraceCheckUtils]: 38: Hoare triple {7866#(and (<= |ULTIMATE.start_foo_~i~0#1| 11) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7866#(and (<= |ULTIMATE.start_foo_~i~0#1| 11) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:08,246 INFO L290 TraceCheckUtils]: 39: Hoare triple {7866#(and (<= |ULTIMATE.start_foo_~i~0#1| 11) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7876#(and (<= |ULTIMATE.start_foo_~i~0#1| 12) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:08,247 INFO L290 TraceCheckUtils]: 40: Hoare triple {7876#(and (<= |ULTIMATE.start_foo_~i~0#1| 12) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {7876#(and (<= |ULTIMATE.start_foo_~i~0#1| 12) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:08,247 INFO L290 TraceCheckUtils]: 41: Hoare triple {7876#(and (<= |ULTIMATE.start_foo_~i~0#1| 12) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7876#(and (<= |ULTIMATE.start_foo_~i~0#1| 12) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:08,248 INFO L290 TraceCheckUtils]: 42: Hoare triple {7876#(and (<= |ULTIMATE.start_foo_~i~0#1| 12) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7886#(and (<= |ULTIMATE.start_foo_~i~0#1| 13) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:08,248 INFO L290 TraceCheckUtils]: 43: Hoare triple {7886#(and (<= |ULTIMATE.start_foo_~i~0#1| 13) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {7886#(and (<= |ULTIMATE.start_foo_~i~0#1| 13) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:08,248 INFO L290 TraceCheckUtils]: 44: Hoare triple {7886#(and (<= |ULTIMATE.start_foo_~i~0#1| 13) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7886#(and (<= |ULTIMATE.start_foo_~i~0#1| 13) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:08,249 INFO L290 TraceCheckUtils]: 45: Hoare triple {7886#(and (<= |ULTIMATE.start_foo_~i~0#1| 13) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7896#(and (<= |ULTIMATE.start_foo_~i~0#1| 14) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:08,249 INFO L290 TraceCheckUtils]: 46: Hoare triple {7896#(and (<= |ULTIMATE.start_foo_~i~0#1| 14) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {7896#(and (<= |ULTIMATE.start_foo_~i~0#1| 14) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:08,250 INFO L290 TraceCheckUtils]: 47: Hoare triple {7896#(and (<= |ULTIMATE.start_foo_~i~0#1| 14) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7896#(and (<= |ULTIMATE.start_foo_~i~0#1| 14) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:08,250 INFO L290 TraceCheckUtils]: 48: Hoare triple {7896#(and (<= |ULTIMATE.start_foo_~i~0#1| 14) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7906#(and (<= |ULTIMATE.start_foo_~i~0#1| 15) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:08,251 INFO L290 TraceCheckUtils]: 49: Hoare triple {7906#(and (<= |ULTIMATE.start_foo_~i~0#1| 15) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {7906#(and (<= |ULTIMATE.start_foo_~i~0#1| 15) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:08,251 INFO L290 TraceCheckUtils]: 50: Hoare triple {7906#(and (<= |ULTIMATE.start_foo_~i~0#1| 15) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7906#(and (<= |ULTIMATE.start_foo_~i~0#1| 15) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:08,251 INFO L290 TraceCheckUtils]: 51: Hoare triple {7906#(and (<= |ULTIMATE.start_foo_~i~0#1| 15) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7916#(and (<= 32768 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 16))} is VALID [2022-02-20 23:44:08,252 INFO L290 TraceCheckUtils]: 52: Hoare triple {7916#(and (<= 32768 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 16))} assume !!(foo_~i~0#1 < ~n~0); {7916#(and (<= 32768 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 16))} is VALID [2022-02-20 23:44:08,252 INFO L290 TraceCheckUtils]: 53: Hoare triple {7916#(and (<= 32768 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 16))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7916#(and (<= 32768 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 16))} is VALID [2022-02-20 23:44:08,253 INFO L290 TraceCheckUtils]: 54: Hoare triple {7916#(and (<= 32768 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 16))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7926#(and (<= 32768 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 17))} is VALID [2022-02-20 23:44:08,253 INFO L290 TraceCheckUtils]: 55: Hoare triple {7926#(and (<= 32768 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 17))} assume !!(foo_~i~0#1 < ~n~0); {7926#(and (<= 32768 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 17))} is VALID [2022-02-20 23:44:08,253 INFO L290 TraceCheckUtils]: 56: Hoare triple {7926#(and (<= 32768 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 17))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7926#(and (<= 32768 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 17))} is VALID [2022-02-20 23:44:08,254 INFO L290 TraceCheckUtils]: 57: Hoare triple {7926#(and (<= 32768 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 17))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7936#(and (<= |ULTIMATE.start_foo_~i~0#1| 18) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:08,254 INFO L290 TraceCheckUtils]: 58: Hoare triple {7936#(and (<= |ULTIMATE.start_foo_~i~0#1| 18) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {7936#(and (<= |ULTIMATE.start_foo_~i~0#1| 18) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:08,254 INFO L290 TraceCheckUtils]: 59: Hoare triple {7936#(and (<= |ULTIMATE.start_foo_~i~0#1| 18) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7936#(and (<= |ULTIMATE.start_foo_~i~0#1| 18) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:08,255 INFO L290 TraceCheckUtils]: 60: Hoare triple {7936#(and (<= |ULTIMATE.start_foo_~i~0#1| 18) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7946#(and (<= |ULTIMATE.start_foo_~i~0#1| 19) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:08,255 INFO L290 TraceCheckUtils]: 61: Hoare triple {7946#(and (<= |ULTIMATE.start_foo_~i~0#1| 19) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {7946#(and (<= |ULTIMATE.start_foo_~i~0#1| 19) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:08,256 INFO L290 TraceCheckUtils]: 62: Hoare triple {7946#(and (<= |ULTIMATE.start_foo_~i~0#1| 19) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7946#(and (<= |ULTIMATE.start_foo_~i~0#1| 19) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:08,256 INFO L290 TraceCheckUtils]: 63: Hoare triple {7946#(and (<= |ULTIMATE.start_foo_~i~0#1| 19) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7956#(and (<= |ULTIMATE.start_foo_~i~0#1| 20) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:08,256 INFO L290 TraceCheckUtils]: 64: Hoare triple {7956#(and (<= |ULTIMATE.start_foo_~i~0#1| 20) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {7956#(and (<= |ULTIMATE.start_foo_~i~0#1| 20) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:08,257 INFO L290 TraceCheckUtils]: 65: Hoare triple {7956#(and (<= |ULTIMATE.start_foo_~i~0#1| 20) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7956#(and (<= |ULTIMATE.start_foo_~i~0#1| 20) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:08,257 INFO L290 TraceCheckUtils]: 66: Hoare triple {7956#(and (<= |ULTIMATE.start_foo_~i~0#1| 20) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7966#(and (<= |ULTIMATE.start_foo_~i~0#1| 21) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:08,257 INFO L290 TraceCheckUtils]: 67: Hoare triple {7966#(and (<= |ULTIMATE.start_foo_~i~0#1| 21) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {7966#(and (<= |ULTIMATE.start_foo_~i~0#1| 21) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:08,258 INFO L290 TraceCheckUtils]: 68: Hoare triple {7966#(and (<= |ULTIMATE.start_foo_~i~0#1| 21) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7966#(and (<= |ULTIMATE.start_foo_~i~0#1| 21) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:08,258 INFO L290 TraceCheckUtils]: 69: Hoare triple {7966#(and (<= |ULTIMATE.start_foo_~i~0#1| 21) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7976#(and (<= 32768 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 22))} is VALID [2022-02-20 23:44:08,258 INFO L290 TraceCheckUtils]: 70: Hoare triple {7976#(and (<= 32768 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 22))} assume !!(foo_~i~0#1 < ~n~0); {7976#(and (<= 32768 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 22))} is VALID [2022-02-20 23:44:08,259 INFO L290 TraceCheckUtils]: 71: Hoare triple {7976#(and (<= 32768 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 22))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7976#(and (<= 32768 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 22))} is VALID [2022-02-20 23:44:08,259 INFO L290 TraceCheckUtils]: 72: Hoare triple {7976#(and (<= 32768 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 22))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7986#(and (<= |ULTIMATE.start_foo_~i~0#1| 23) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:08,260 INFO L290 TraceCheckUtils]: 73: Hoare triple {7986#(and (<= |ULTIMATE.start_foo_~i~0#1| 23) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {7986#(and (<= |ULTIMATE.start_foo_~i~0#1| 23) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:08,260 INFO L290 TraceCheckUtils]: 74: Hoare triple {7986#(and (<= |ULTIMATE.start_foo_~i~0#1| 23) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7986#(and (<= |ULTIMATE.start_foo_~i~0#1| 23) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:08,260 INFO L290 TraceCheckUtils]: 75: Hoare triple {7986#(and (<= |ULTIMATE.start_foo_~i~0#1| 23) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7996#(and (<= |ULTIMATE.start_foo_~i~0#1| 24) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:08,261 INFO L290 TraceCheckUtils]: 76: Hoare triple {7996#(and (<= |ULTIMATE.start_foo_~i~0#1| 24) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {7996#(and (<= |ULTIMATE.start_foo_~i~0#1| 24) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:08,261 INFO L290 TraceCheckUtils]: 77: Hoare triple {7996#(and (<= |ULTIMATE.start_foo_~i~0#1| 24) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7996#(and (<= |ULTIMATE.start_foo_~i~0#1| 24) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:08,261 INFO L290 TraceCheckUtils]: 78: Hoare triple {7996#(and (<= |ULTIMATE.start_foo_~i~0#1| 24) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {8006#(and (<= |ULTIMATE.start_foo_~i~0#1| 25) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:08,262 INFO L290 TraceCheckUtils]: 79: Hoare triple {8006#(and (<= |ULTIMATE.start_foo_~i~0#1| 25) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {8006#(and (<= |ULTIMATE.start_foo_~i~0#1| 25) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:08,262 INFO L290 TraceCheckUtils]: 80: Hoare triple {8006#(and (<= |ULTIMATE.start_foo_~i~0#1| 25) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {8006#(and (<= |ULTIMATE.start_foo_~i~0#1| 25) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:08,263 INFO L290 TraceCheckUtils]: 81: Hoare triple {8006#(and (<= |ULTIMATE.start_foo_~i~0#1| 25) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {8016#(and (<= |ULTIMATE.start_foo_~i~0#1| 26) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:08,263 INFO L290 TraceCheckUtils]: 82: Hoare triple {8016#(and (<= |ULTIMATE.start_foo_~i~0#1| 26) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {8016#(and (<= |ULTIMATE.start_foo_~i~0#1| 26) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:08,263 INFO L290 TraceCheckUtils]: 83: Hoare triple {8016#(and (<= |ULTIMATE.start_foo_~i~0#1| 26) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {8016#(and (<= |ULTIMATE.start_foo_~i~0#1| 26) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:08,264 INFO L290 TraceCheckUtils]: 84: Hoare triple {8016#(and (<= |ULTIMATE.start_foo_~i~0#1| 26) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {8026#(and (<= |ULTIMATE.start_foo_~i~0#1| 27) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:08,264 INFO L290 TraceCheckUtils]: 85: Hoare triple {8026#(and (<= |ULTIMATE.start_foo_~i~0#1| 27) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {8026#(and (<= |ULTIMATE.start_foo_~i~0#1| 27) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:08,264 INFO L290 TraceCheckUtils]: 86: Hoare triple {8026#(and (<= |ULTIMATE.start_foo_~i~0#1| 27) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {8026#(and (<= |ULTIMATE.start_foo_~i~0#1| 27) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:08,265 INFO L290 TraceCheckUtils]: 87: Hoare triple {8026#(and (<= |ULTIMATE.start_foo_~i~0#1| 27) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {8036#(and (<= |ULTIMATE.start_foo_~i~0#1| 28) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:08,265 INFO L290 TraceCheckUtils]: 88: Hoare triple {8036#(and (<= |ULTIMATE.start_foo_~i~0#1| 28) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {8036#(and (<= |ULTIMATE.start_foo_~i~0#1| 28) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:08,265 INFO L290 TraceCheckUtils]: 89: Hoare triple {8036#(and (<= |ULTIMATE.start_foo_~i~0#1| 28) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {8036#(and (<= |ULTIMATE.start_foo_~i~0#1| 28) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:08,266 INFO L290 TraceCheckUtils]: 90: Hoare triple {8036#(and (<= |ULTIMATE.start_foo_~i~0#1| 28) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {8046#(and (<= |ULTIMATE.start_foo_~i~0#1| 29) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:08,266 INFO L290 TraceCheckUtils]: 91: Hoare triple {8046#(and (<= |ULTIMATE.start_foo_~i~0#1| 29) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {8046#(and (<= |ULTIMATE.start_foo_~i~0#1| 29) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:08,266 INFO L290 TraceCheckUtils]: 92: Hoare triple {8046#(and (<= |ULTIMATE.start_foo_~i~0#1| 29) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {8046#(and (<= |ULTIMATE.start_foo_~i~0#1| 29) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:08,267 INFO L290 TraceCheckUtils]: 93: Hoare triple {8046#(and (<= |ULTIMATE.start_foo_~i~0#1| 29) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {8056#(and (<= |ULTIMATE.start_foo_~i~0#1| 30) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:08,267 INFO L290 TraceCheckUtils]: 94: Hoare triple {8056#(and (<= |ULTIMATE.start_foo_~i~0#1| 30) (<= 32768 ~n~0))} assume !(foo_~i~0#1 < ~n~0); {7726#false} is VALID [2022-02-20 23:44:08,267 INFO L290 TraceCheckUtils]: 95: Hoare triple {7726#false} foo_~i~0#1 := 0; {7726#false} is VALID [2022-02-20 23:44:08,267 INFO L290 TraceCheckUtils]: 96: Hoare triple {7726#false} assume !!(foo_~i~0#1 < 32767); {7726#false} is VALID [2022-02-20 23:44:08,267 INFO L290 TraceCheckUtils]: 97: Hoare triple {7726#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7726#false} is VALID [2022-02-20 23:44:08,267 INFO L290 TraceCheckUtils]: 98: Hoare triple {7726#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7726#false} is VALID [2022-02-20 23:44:08,267 INFO L290 TraceCheckUtils]: 99: Hoare triple {7726#false} assume !!(foo_~i~0#1 < 32767); {7726#false} is VALID [2022-02-20 23:44:08,268 INFO L290 TraceCheckUtils]: 100: Hoare triple {7726#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7726#false} is VALID [2022-02-20 23:44:08,268 INFO L290 TraceCheckUtils]: 101: Hoare triple {7726#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7726#false} is VALID [2022-02-20 23:44:08,268 INFO L290 TraceCheckUtils]: 102: Hoare triple {7726#false} assume !!(foo_~i~0#1 < 32767); {7726#false} is VALID [2022-02-20 23:44:08,268 INFO L290 TraceCheckUtils]: 103: Hoare triple {7726#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7726#false} is VALID [2022-02-20 23:44:08,268 INFO L290 TraceCheckUtils]: 104: Hoare triple {7726#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7726#false} is VALID [2022-02-20 23:44:08,268 INFO L290 TraceCheckUtils]: 105: Hoare triple {7726#false} assume !!(foo_~i~0#1 < 32767); {7726#false} is VALID [2022-02-20 23:44:08,268 INFO L290 TraceCheckUtils]: 106: Hoare triple {7726#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7726#false} is VALID [2022-02-20 23:44:08,268 INFO L290 TraceCheckUtils]: 107: Hoare triple {7726#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7726#false} is VALID [2022-02-20 23:44:08,268 INFO L290 TraceCheckUtils]: 108: Hoare triple {7726#false} assume !!(foo_~i~0#1 < 32767); {7726#false} is VALID [2022-02-20 23:44:08,268 INFO L290 TraceCheckUtils]: 109: Hoare triple {7726#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7726#false} is VALID [2022-02-20 23:44:08,268 INFO L290 TraceCheckUtils]: 110: Hoare triple {7726#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7726#false} is VALID [2022-02-20 23:44:08,268 INFO L290 TraceCheckUtils]: 111: Hoare triple {7726#false} assume !!(foo_~i~0#1 < 32767); {7726#false} is VALID [2022-02-20 23:44:08,268 INFO L290 TraceCheckUtils]: 112: Hoare triple {7726#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7726#false} is VALID [2022-02-20 23:44:08,268 INFO L290 TraceCheckUtils]: 113: Hoare triple {7726#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7726#false} is VALID [2022-02-20 23:44:08,268 INFO L290 TraceCheckUtils]: 114: Hoare triple {7726#false} assume !!(foo_~i~0#1 < 32767); {7726#false} is VALID [2022-02-20 23:44:08,268 INFO L290 TraceCheckUtils]: 115: Hoare triple {7726#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7726#false} is VALID [2022-02-20 23:44:08,268 INFO L290 TraceCheckUtils]: 116: Hoare triple {7726#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7726#false} is VALID [2022-02-20 23:44:08,268 INFO L290 TraceCheckUtils]: 117: Hoare triple {7726#false} assume !!(foo_~i~0#1 < 32767); {7726#false} is VALID [2022-02-20 23:44:08,268 INFO L290 TraceCheckUtils]: 118: Hoare triple {7726#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7726#false} is VALID [2022-02-20 23:44:08,268 INFO L290 TraceCheckUtils]: 119: Hoare triple {7726#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7726#false} is VALID [2022-02-20 23:44:08,268 INFO L290 TraceCheckUtils]: 120: Hoare triple {7726#false} assume !!(foo_~i~0#1 < 32767); {7726#false} is VALID [2022-02-20 23:44:08,268 INFO L290 TraceCheckUtils]: 121: Hoare triple {7726#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7726#false} is VALID [2022-02-20 23:44:08,268 INFO L290 TraceCheckUtils]: 122: Hoare triple {7726#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7726#false} is VALID [2022-02-20 23:44:08,269 INFO L290 TraceCheckUtils]: 123: Hoare triple {7726#false} assume !!(foo_~i~0#1 < 32767); {7726#false} is VALID [2022-02-20 23:44:08,269 INFO L290 TraceCheckUtils]: 124: Hoare triple {7726#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7726#false} is VALID [2022-02-20 23:44:08,269 INFO L290 TraceCheckUtils]: 125: Hoare triple {7726#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7726#false} is VALID [2022-02-20 23:44:08,269 INFO L290 TraceCheckUtils]: 126: Hoare triple {7726#false} assume !!(foo_~i~0#1 < 32767); {7726#false} is VALID [2022-02-20 23:44:08,269 INFO L290 TraceCheckUtils]: 127: Hoare triple {7726#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7726#false} is VALID [2022-02-20 23:44:08,269 INFO L290 TraceCheckUtils]: 128: Hoare triple {7726#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7726#false} is VALID [2022-02-20 23:44:08,269 INFO L290 TraceCheckUtils]: 129: Hoare triple {7726#false} assume !!(foo_~i~0#1 < 32767); {7726#false} is VALID [2022-02-20 23:44:08,269 INFO L290 TraceCheckUtils]: 130: Hoare triple {7726#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7726#false} is VALID [2022-02-20 23:44:08,269 INFO L290 TraceCheckUtils]: 131: Hoare triple {7726#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7726#false} is VALID [2022-02-20 23:44:08,269 INFO L290 TraceCheckUtils]: 132: Hoare triple {7726#false} assume !!(foo_~i~0#1 < 32767); {7726#false} is VALID [2022-02-20 23:44:08,269 INFO L290 TraceCheckUtils]: 133: Hoare triple {7726#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7726#false} is VALID [2022-02-20 23:44:08,269 INFO L290 TraceCheckUtils]: 134: Hoare triple {7726#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7726#false} is VALID [2022-02-20 23:44:08,269 INFO L290 TraceCheckUtils]: 135: Hoare triple {7726#false} assume !!(foo_~i~0#1 < 32767); {7726#false} is VALID [2022-02-20 23:44:08,269 INFO L290 TraceCheckUtils]: 136: Hoare triple {7726#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7726#false} is VALID [2022-02-20 23:44:08,269 INFO L290 TraceCheckUtils]: 137: Hoare triple {7726#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7726#false} is VALID [2022-02-20 23:44:08,269 INFO L290 TraceCheckUtils]: 138: Hoare triple {7726#false} assume !!(foo_~i~0#1 < 32767); {7726#false} is VALID [2022-02-20 23:44:08,269 INFO L290 TraceCheckUtils]: 139: Hoare triple {7726#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7726#false} is VALID [2022-02-20 23:44:08,269 INFO L290 TraceCheckUtils]: 140: Hoare triple {7726#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7726#false} is VALID [2022-02-20 23:44:08,269 INFO L290 TraceCheckUtils]: 141: Hoare triple {7726#false} assume !(foo_~i~0#1 < 32767); {7726#false} is VALID [2022-02-20 23:44:08,269 INFO L290 TraceCheckUtils]: 142: Hoare triple {7726#false} assume { :end_inline_foo } true; {7726#false} is VALID [2022-02-20 23:44:08,269 INFO L290 TraceCheckUtils]: 143: Hoare triple {7726#false} SUMMARY for call main_#t~mem8#1 := read~int(~b~0.base, -4 + ~b~0.offset, 4); srcloc: L540 {7726#false} is VALID [2022-02-20 23:44:08,269 INFO L290 TraceCheckUtils]: 144: Hoare triple {7726#false} assume 0 != main_#t~mem8#1;havoc main_#t~mem8#1; {7726#false} is VALID [2022-02-20 23:44:08,270 INFO L290 TraceCheckUtils]: 145: Hoare triple {7726#false} assume 0 == ~a~0.offset; {7726#false} is VALID [2022-02-20 23:44:08,270 INFO L290 TraceCheckUtils]: 146: Hoare triple {7726#false} assume ~a~0.base < #StackHeapBarrier; {7726#false} is VALID [2022-02-20 23:44:08,270 INFO L290 TraceCheckUtils]: 147: Hoare triple {7726#false} assume 0 == ~a~0.base || 1 == #valid[~a~0.base];call ULTIMATE.dealloc(~a~0.base, ~a~0.offset); {7726#false} is VALID [2022-02-20 23:44:08,270 INFO L290 TraceCheckUtils]: 148: Hoare triple {7726#false} assume !(0 == ~b~0.offset); {7726#false} is VALID [2022-02-20 23:44:08,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1665 backedges. 0 proven. 1335 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2022-02-20 23:44:08,271 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:44:09,707 INFO L290 TraceCheckUtils]: 148: Hoare triple {7726#false} assume !(0 == ~b~0.offset); {7726#false} is VALID [2022-02-20 23:44:09,707 INFO L290 TraceCheckUtils]: 147: Hoare triple {7726#false} assume 0 == ~a~0.base || 1 == #valid[~a~0.base];call ULTIMATE.dealloc(~a~0.base, ~a~0.offset); {7726#false} is VALID [2022-02-20 23:44:09,707 INFO L290 TraceCheckUtils]: 146: Hoare triple {7726#false} assume ~a~0.base < #StackHeapBarrier; {7726#false} is VALID [2022-02-20 23:44:09,707 INFO L290 TraceCheckUtils]: 145: Hoare triple {7726#false} assume 0 == ~a~0.offset; {7726#false} is VALID [2022-02-20 23:44:09,707 INFO L290 TraceCheckUtils]: 144: Hoare triple {7726#false} assume 0 != main_#t~mem8#1;havoc main_#t~mem8#1; {7726#false} is VALID [2022-02-20 23:44:09,707 INFO L290 TraceCheckUtils]: 143: Hoare triple {7726#false} SUMMARY for call main_#t~mem8#1 := read~int(~b~0.base, -4 + ~b~0.offset, 4); srcloc: L540 {7726#false} is VALID [2022-02-20 23:44:09,707 INFO L290 TraceCheckUtils]: 142: Hoare triple {7726#false} assume { :end_inline_foo } true; {7726#false} is VALID [2022-02-20 23:44:09,707 INFO L290 TraceCheckUtils]: 141: Hoare triple {7726#false} assume !(foo_~i~0#1 < 32767); {7726#false} is VALID [2022-02-20 23:44:09,707 INFO L290 TraceCheckUtils]: 140: Hoare triple {7726#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7726#false} is VALID [2022-02-20 23:44:09,707 INFO L290 TraceCheckUtils]: 139: Hoare triple {7726#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7726#false} is VALID [2022-02-20 23:44:09,707 INFO L290 TraceCheckUtils]: 138: Hoare triple {7726#false} assume !!(foo_~i~0#1 < 32767); {7726#false} is VALID [2022-02-20 23:44:09,707 INFO L290 TraceCheckUtils]: 137: Hoare triple {7726#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7726#false} is VALID [2022-02-20 23:44:09,707 INFO L290 TraceCheckUtils]: 136: Hoare triple {7726#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7726#false} is VALID [2022-02-20 23:44:09,707 INFO L290 TraceCheckUtils]: 135: Hoare triple {7726#false} assume !!(foo_~i~0#1 < 32767); {7726#false} is VALID [2022-02-20 23:44:09,707 INFO L290 TraceCheckUtils]: 134: Hoare triple {7726#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7726#false} is VALID [2022-02-20 23:44:09,708 INFO L290 TraceCheckUtils]: 133: Hoare triple {7726#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7726#false} is VALID [2022-02-20 23:44:09,708 INFO L290 TraceCheckUtils]: 132: Hoare triple {7726#false} assume !!(foo_~i~0#1 < 32767); {7726#false} is VALID [2022-02-20 23:44:09,708 INFO L290 TraceCheckUtils]: 131: Hoare triple {7726#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7726#false} is VALID [2022-02-20 23:44:09,708 INFO L290 TraceCheckUtils]: 130: Hoare triple {7726#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7726#false} is VALID [2022-02-20 23:44:09,708 INFO L290 TraceCheckUtils]: 129: Hoare triple {7726#false} assume !!(foo_~i~0#1 < 32767); {7726#false} is VALID [2022-02-20 23:44:09,708 INFO L290 TraceCheckUtils]: 128: Hoare triple {7726#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7726#false} is VALID [2022-02-20 23:44:09,708 INFO L290 TraceCheckUtils]: 127: Hoare triple {7726#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7726#false} is VALID [2022-02-20 23:44:09,708 INFO L290 TraceCheckUtils]: 126: Hoare triple {7726#false} assume !!(foo_~i~0#1 < 32767); {7726#false} is VALID [2022-02-20 23:44:09,708 INFO L290 TraceCheckUtils]: 125: Hoare triple {7726#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7726#false} is VALID [2022-02-20 23:44:09,708 INFO L290 TraceCheckUtils]: 124: Hoare triple {7726#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7726#false} is VALID [2022-02-20 23:44:09,708 INFO L290 TraceCheckUtils]: 123: Hoare triple {7726#false} assume !!(foo_~i~0#1 < 32767); {7726#false} is VALID [2022-02-20 23:44:09,708 INFO L290 TraceCheckUtils]: 122: Hoare triple {7726#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7726#false} is VALID [2022-02-20 23:44:09,708 INFO L290 TraceCheckUtils]: 121: Hoare triple {7726#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7726#false} is VALID [2022-02-20 23:44:09,708 INFO L290 TraceCheckUtils]: 120: Hoare triple {7726#false} assume !!(foo_~i~0#1 < 32767); {7726#false} is VALID [2022-02-20 23:44:09,709 INFO L290 TraceCheckUtils]: 119: Hoare triple {7726#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7726#false} is VALID [2022-02-20 23:44:09,709 INFO L290 TraceCheckUtils]: 118: Hoare triple {7726#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7726#false} is VALID [2022-02-20 23:44:09,709 INFO L290 TraceCheckUtils]: 117: Hoare triple {7726#false} assume !!(foo_~i~0#1 < 32767); {7726#false} is VALID [2022-02-20 23:44:09,709 INFO L290 TraceCheckUtils]: 116: Hoare triple {7726#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7726#false} is VALID [2022-02-20 23:44:09,709 INFO L290 TraceCheckUtils]: 115: Hoare triple {7726#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7726#false} is VALID [2022-02-20 23:44:09,709 INFO L290 TraceCheckUtils]: 114: Hoare triple {7726#false} assume !!(foo_~i~0#1 < 32767); {7726#false} is VALID [2022-02-20 23:44:09,709 INFO L290 TraceCheckUtils]: 113: Hoare triple {7726#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7726#false} is VALID [2022-02-20 23:44:09,709 INFO L290 TraceCheckUtils]: 112: Hoare triple {7726#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7726#false} is VALID [2022-02-20 23:44:09,709 INFO L290 TraceCheckUtils]: 111: Hoare triple {7726#false} assume !!(foo_~i~0#1 < 32767); {7726#false} is VALID [2022-02-20 23:44:09,709 INFO L290 TraceCheckUtils]: 110: Hoare triple {7726#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7726#false} is VALID [2022-02-20 23:44:09,709 INFO L290 TraceCheckUtils]: 109: Hoare triple {7726#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7726#false} is VALID [2022-02-20 23:44:09,709 INFO L290 TraceCheckUtils]: 108: Hoare triple {7726#false} assume !!(foo_~i~0#1 < 32767); {7726#false} is VALID [2022-02-20 23:44:09,709 INFO L290 TraceCheckUtils]: 107: Hoare triple {7726#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7726#false} is VALID [2022-02-20 23:44:09,709 INFO L290 TraceCheckUtils]: 106: Hoare triple {7726#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7726#false} is VALID [2022-02-20 23:44:09,709 INFO L290 TraceCheckUtils]: 105: Hoare triple {7726#false} assume !!(foo_~i~0#1 < 32767); {7726#false} is VALID [2022-02-20 23:44:09,709 INFO L290 TraceCheckUtils]: 104: Hoare triple {7726#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7726#false} is VALID [2022-02-20 23:44:09,709 INFO L290 TraceCheckUtils]: 103: Hoare triple {7726#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7726#false} is VALID [2022-02-20 23:44:09,710 INFO L290 TraceCheckUtils]: 102: Hoare triple {7726#false} assume !!(foo_~i~0#1 < 32767); {7726#false} is VALID [2022-02-20 23:44:09,710 INFO L290 TraceCheckUtils]: 101: Hoare triple {7726#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7726#false} is VALID [2022-02-20 23:44:09,710 INFO L290 TraceCheckUtils]: 100: Hoare triple {7726#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7726#false} is VALID [2022-02-20 23:44:09,710 INFO L290 TraceCheckUtils]: 99: Hoare triple {7726#false} assume !!(foo_~i~0#1 < 32767); {7726#false} is VALID [2022-02-20 23:44:09,710 INFO L290 TraceCheckUtils]: 98: Hoare triple {7726#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7726#false} is VALID [2022-02-20 23:44:09,710 INFO L290 TraceCheckUtils]: 97: Hoare triple {7726#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7726#false} is VALID [2022-02-20 23:44:09,710 INFO L290 TraceCheckUtils]: 96: Hoare triple {7726#false} assume !!(foo_~i~0#1 < 32767); {7726#false} is VALID [2022-02-20 23:44:09,710 INFO L290 TraceCheckUtils]: 95: Hoare triple {7726#false} foo_~i~0#1 := 0; {7726#false} is VALID [2022-02-20 23:44:09,710 INFO L290 TraceCheckUtils]: 94: Hoare triple {8384#(< |ULTIMATE.start_foo_~i~0#1| ~n~0)} assume !(foo_~i~0#1 < ~n~0); {7726#false} is VALID [2022-02-20 23:44:09,711 INFO L290 TraceCheckUtils]: 93: Hoare triple {8388#(< (+ |ULTIMATE.start_foo_~i~0#1| 1) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {8384#(< |ULTIMATE.start_foo_~i~0#1| ~n~0)} is VALID [2022-02-20 23:44:09,711 INFO L290 TraceCheckUtils]: 92: Hoare triple {8388#(< (+ |ULTIMATE.start_foo_~i~0#1| 1) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {8388#(< (+ |ULTIMATE.start_foo_~i~0#1| 1) ~n~0)} is VALID [2022-02-20 23:44:09,711 INFO L290 TraceCheckUtils]: 91: Hoare triple {8388#(< (+ |ULTIMATE.start_foo_~i~0#1| 1) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {8388#(< (+ |ULTIMATE.start_foo_~i~0#1| 1) ~n~0)} is VALID [2022-02-20 23:44:09,712 INFO L290 TraceCheckUtils]: 90: Hoare triple {8398#(< (+ |ULTIMATE.start_foo_~i~0#1| 2) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {8388#(< (+ |ULTIMATE.start_foo_~i~0#1| 1) ~n~0)} is VALID [2022-02-20 23:44:09,712 INFO L290 TraceCheckUtils]: 89: Hoare triple {8398#(< (+ |ULTIMATE.start_foo_~i~0#1| 2) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {8398#(< (+ |ULTIMATE.start_foo_~i~0#1| 2) ~n~0)} is VALID [2022-02-20 23:44:09,713 INFO L290 TraceCheckUtils]: 88: Hoare triple {8398#(< (+ |ULTIMATE.start_foo_~i~0#1| 2) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {8398#(< (+ |ULTIMATE.start_foo_~i~0#1| 2) ~n~0)} is VALID [2022-02-20 23:44:09,713 INFO L290 TraceCheckUtils]: 87: Hoare triple {8408#(< (+ |ULTIMATE.start_foo_~i~0#1| 3) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {8398#(< (+ |ULTIMATE.start_foo_~i~0#1| 2) ~n~0)} is VALID [2022-02-20 23:44:09,713 INFO L290 TraceCheckUtils]: 86: Hoare triple {8408#(< (+ |ULTIMATE.start_foo_~i~0#1| 3) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {8408#(< (+ |ULTIMATE.start_foo_~i~0#1| 3) ~n~0)} is VALID [2022-02-20 23:44:09,714 INFO L290 TraceCheckUtils]: 85: Hoare triple {8408#(< (+ |ULTIMATE.start_foo_~i~0#1| 3) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {8408#(< (+ |ULTIMATE.start_foo_~i~0#1| 3) ~n~0)} is VALID [2022-02-20 23:44:09,714 INFO L290 TraceCheckUtils]: 84: Hoare triple {8418#(< (+ |ULTIMATE.start_foo_~i~0#1| 4) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {8408#(< (+ |ULTIMATE.start_foo_~i~0#1| 3) ~n~0)} is VALID [2022-02-20 23:44:09,714 INFO L290 TraceCheckUtils]: 83: Hoare triple {8418#(< (+ |ULTIMATE.start_foo_~i~0#1| 4) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {8418#(< (+ |ULTIMATE.start_foo_~i~0#1| 4) ~n~0)} is VALID [2022-02-20 23:44:09,715 INFO L290 TraceCheckUtils]: 82: Hoare triple {8418#(< (+ |ULTIMATE.start_foo_~i~0#1| 4) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {8418#(< (+ |ULTIMATE.start_foo_~i~0#1| 4) ~n~0)} is VALID [2022-02-20 23:44:09,715 INFO L290 TraceCheckUtils]: 81: Hoare triple {8428#(< (+ |ULTIMATE.start_foo_~i~0#1| 5) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {8418#(< (+ |ULTIMATE.start_foo_~i~0#1| 4) ~n~0)} is VALID [2022-02-20 23:44:09,716 INFO L290 TraceCheckUtils]: 80: Hoare triple {8428#(< (+ |ULTIMATE.start_foo_~i~0#1| 5) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {8428#(< (+ |ULTIMATE.start_foo_~i~0#1| 5) ~n~0)} is VALID [2022-02-20 23:44:09,716 INFO L290 TraceCheckUtils]: 79: Hoare triple {8428#(< (+ |ULTIMATE.start_foo_~i~0#1| 5) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {8428#(< (+ |ULTIMATE.start_foo_~i~0#1| 5) ~n~0)} is VALID [2022-02-20 23:44:09,716 INFO L290 TraceCheckUtils]: 78: Hoare triple {8438#(< (+ |ULTIMATE.start_foo_~i~0#1| 6) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {8428#(< (+ |ULTIMATE.start_foo_~i~0#1| 5) ~n~0)} is VALID [2022-02-20 23:44:09,717 INFO L290 TraceCheckUtils]: 77: Hoare triple {8438#(< (+ |ULTIMATE.start_foo_~i~0#1| 6) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {8438#(< (+ |ULTIMATE.start_foo_~i~0#1| 6) ~n~0)} is VALID [2022-02-20 23:44:09,717 INFO L290 TraceCheckUtils]: 76: Hoare triple {8438#(< (+ |ULTIMATE.start_foo_~i~0#1| 6) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {8438#(< (+ |ULTIMATE.start_foo_~i~0#1| 6) ~n~0)} is VALID [2022-02-20 23:44:09,717 INFO L290 TraceCheckUtils]: 75: Hoare triple {8448#(< (+ 7 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {8438#(< (+ |ULTIMATE.start_foo_~i~0#1| 6) ~n~0)} is VALID [2022-02-20 23:44:09,718 INFO L290 TraceCheckUtils]: 74: Hoare triple {8448#(< (+ 7 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {8448#(< (+ 7 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:09,718 INFO L290 TraceCheckUtils]: 73: Hoare triple {8448#(< (+ 7 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {8448#(< (+ 7 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:09,718 INFO L290 TraceCheckUtils]: 72: Hoare triple {8458#(< (+ |ULTIMATE.start_foo_~i~0#1| 8) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {8448#(< (+ 7 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:09,719 INFO L290 TraceCheckUtils]: 71: Hoare triple {8458#(< (+ |ULTIMATE.start_foo_~i~0#1| 8) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {8458#(< (+ |ULTIMATE.start_foo_~i~0#1| 8) ~n~0)} is VALID [2022-02-20 23:44:09,719 INFO L290 TraceCheckUtils]: 70: Hoare triple {8458#(< (+ |ULTIMATE.start_foo_~i~0#1| 8) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {8458#(< (+ |ULTIMATE.start_foo_~i~0#1| 8) ~n~0)} is VALID [2022-02-20 23:44:09,719 INFO L290 TraceCheckUtils]: 69: Hoare triple {8468#(< (+ |ULTIMATE.start_foo_~i~0#1| 9) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {8458#(< (+ |ULTIMATE.start_foo_~i~0#1| 8) ~n~0)} is VALID [2022-02-20 23:44:09,720 INFO L290 TraceCheckUtils]: 68: Hoare triple {8468#(< (+ |ULTIMATE.start_foo_~i~0#1| 9) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {8468#(< (+ |ULTIMATE.start_foo_~i~0#1| 9) ~n~0)} is VALID [2022-02-20 23:44:09,720 INFO L290 TraceCheckUtils]: 67: Hoare triple {8468#(< (+ |ULTIMATE.start_foo_~i~0#1| 9) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {8468#(< (+ |ULTIMATE.start_foo_~i~0#1| 9) ~n~0)} is VALID [2022-02-20 23:44:09,721 INFO L290 TraceCheckUtils]: 66: Hoare triple {8478#(< (+ |ULTIMATE.start_foo_~i~0#1| 10) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {8468#(< (+ |ULTIMATE.start_foo_~i~0#1| 9) ~n~0)} is VALID [2022-02-20 23:44:09,721 INFO L290 TraceCheckUtils]: 65: Hoare triple {8478#(< (+ |ULTIMATE.start_foo_~i~0#1| 10) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {8478#(< (+ |ULTIMATE.start_foo_~i~0#1| 10) ~n~0)} is VALID [2022-02-20 23:44:09,721 INFO L290 TraceCheckUtils]: 64: Hoare triple {8478#(< (+ |ULTIMATE.start_foo_~i~0#1| 10) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {8478#(< (+ |ULTIMATE.start_foo_~i~0#1| 10) ~n~0)} is VALID [2022-02-20 23:44:09,722 INFO L290 TraceCheckUtils]: 63: Hoare triple {8488#(< (+ |ULTIMATE.start_foo_~i~0#1| 11) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {8478#(< (+ |ULTIMATE.start_foo_~i~0#1| 10) ~n~0)} is VALID [2022-02-20 23:44:09,722 INFO L290 TraceCheckUtils]: 62: Hoare triple {8488#(< (+ |ULTIMATE.start_foo_~i~0#1| 11) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {8488#(< (+ |ULTIMATE.start_foo_~i~0#1| 11) ~n~0)} is VALID [2022-02-20 23:44:09,722 INFO L290 TraceCheckUtils]: 61: Hoare triple {8488#(< (+ |ULTIMATE.start_foo_~i~0#1| 11) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {8488#(< (+ |ULTIMATE.start_foo_~i~0#1| 11) ~n~0)} is VALID [2022-02-20 23:44:09,723 INFO L290 TraceCheckUtils]: 60: Hoare triple {8498#(< (+ |ULTIMATE.start_foo_~i~0#1| 12) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {8488#(< (+ |ULTIMATE.start_foo_~i~0#1| 11) ~n~0)} is VALID [2022-02-20 23:44:09,723 INFO L290 TraceCheckUtils]: 59: Hoare triple {8498#(< (+ |ULTIMATE.start_foo_~i~0#1| 12) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {8498#(< (+ |ULTIMATE.start_foo_~i~0#1| 12) ~n~0)} is VALID [2022-02-20 23:44:09,723 INFO L290 TraceCheckUtils]: 58: Hoare triple {8498#(< (+ |ULTIMATE.start_foo_~i~0#1| 12) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {8498#(< (+ |ULTIMATE.start_foo_~i~0#1| 12) ~n~0)} is VALID [2022-02-20 23:44:09,724 INFO L290 TraceCheckUtils]: 57: Hoare triple {8508#(< (+ |ULTIMATE.start_foo_~i~0#1| 13) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {8498#(< (+ |ULTIMATE.start_foo_~i~0#1| 12) ~n~0)} is VALID [2022-02-20 23:44:09,724 INFO L290 TraceCheckUtils]: 56: Hoare triple {8508#(< (+ |ULTIMATE.start_foo_~i~0#1| 13) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {8508#(< (+ |ULTIMATE.start_foo_~i~0#1| 13) ~n~0)} is VALID [2022-02-20 23:44:09,724 INFO L290 TraceCheckUtils]: 55: Hoare triple {8508#(< (+ |ULTIMATE.start_foo_~i~0#1| 13) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {8508#(< (+ |ULTIMATE.start_foo_~i~0#1| 13) ~n~0)} is VALID [2022-02-20 23:44:09,725 INFO L290 TraceCheckUtils]: 54: Hoare triple {8518#(< (+ |ULTIMATE.start_foo_~i~0#1| 14) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {8508#(< (+ |ULTIMATE.start_foo_~i~0#1| 13) ~n~0)} is VALID [2022-02-20 23:44:09,725 INFO L290 TraceCheckUtils]: 53: Hoare triple {8518#(< (+ |ULTIMATE.start_foo_~i~0#1| 14) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {8518#(< (+ |ULTIMATE.start_foo_~i~0#1| 14) ~n~0)} is VALID [2022-02-20 23:44:09,726 INFO L290 TraceCheckUtils]: 52: Hoare triple {8518#(< (+ |ULTIMATE.start_foo_~i~0#1| 14) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {8518#(< (+ |ULTIMATE.start_foo_~i~0#1| 14) ~n~0)} is VALID [2022-02-20 23:44:09,726 INFO L290 TraceCheckUtils]: 51: Hoare triple {8528#(< (+ |ULTIMATE.start_foo_~i~0#1| 15) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {8518#(< (+ |ULTIMATE.start_foo_~i~0#1| 14) ~n~0)} is VALID [2022-02-20 23:44:09,726 INFO L290 TraceCheckUtils]: 50: Hoare triple {8528#(< (+ |ULTIMATE.start_foo_~i~0#1| 15) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {8528#(< (+ |ULTIMATE.start_foo_~i~0#1| 15) ~n~0)} is VALID [2022-02-20 23:44:09,727 INFO L290 TraceCheckUtils]: 49: Hoare triple {8528#(< (+ |ULTIMATE.start_foo_~i~0#1| 15) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {8528#(< (+ |ULTIMATE.start_foo_~i~0#1| 15) ~n~0)} is VALID [2022-02-20 23:44:09,727 INFO L290 TraceCheckUtils]: 48: Hoare triple {8538#(< (+ |ULTIMATE.start_foo_~i~0#1| 16) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {8528#(< (+ |ULTIMATE.start_foo_~i~0#1| 15) ~n~0)} is VALID [2022-02-20 23:44:09,727 INFO L290 TraceCheckUtils]: 47: Hoare triple {8538#(< (+ |ULTIMATE.start_foo_~i~0#1| 16) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {8538#(< (+ |ULTIMATE.start_foo_~i~0#1| 16) ~n~0)} is VALID [2022-02-20 23:44:09,728 INFO L290 TraceCheckUtils]: 46: Hoare triple {8538#(< (+ |ULTIMATE.start_foo_~i~0#1| 16) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {8538#(< (+ |ULTIMATE.start_foo_~i~0#1| 16) ~n~0)} is VALID [2022-02-20 23:44:09,728 INFO L290 TraceCheckUtils]: 45: Hoare triple {8548#(< (+ |ULTIMATE.start_foo_~i~0#1| 17) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {8538#(< (+ |ULTIMATE.start_foo_~i~0#1| 16) ~n~0)} is VALID [2022-02-20 23:44:09,729 INFO L290 TraceCheckUtils]: 44: Hoare triple {8548#(< (+ |ULTIMATE.start_foo_~i~0#1| 17) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {8548#(< (+ |ULTIMATE.start_foo_~i~0#1| 17) ~n~0)} is VALID [2022-02-20 23:44:09,729 INFO L290 TraceCheckUtils]: 43: Hoare triple {8548#(< (+ |ULTIMATE.start_foo_~i~0#1| 17) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {8548#(< (+ |ULTIMATE.start_foo_~i~0#1| 17) ~n~0)} is VALID [2022-02-20 23:44:09,729 INFO L290 TraceCheckUtils]: 42: Hoare triple {8558#(< (+ |ULTIMATE.start_foo_~i~0#1| 18) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {8548#(< (+ |ULTIMATE.start_foo_~i~0#1| 17) ~n~0)} is VALID [2022-02-20 23:44:09,730 INFO L290 TraceCheckUtils]: 41: Hoare triple {8558#(< (+ |ULTIMATE.start_foo_~i~0#1| 18) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {8558#(< (+ |ULTIMATE.start_foo_~i~0#1| 18) ~n~0)} is VALID [2022-02-20 23:44:09,730 INFO L290 TraceCheckUtils]: 40: Hoare triple {8558#(< (+ |ULTIMATE.start_foo_~i~0#1| 18) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {8558#(< (+ |ULTIMATE.start_foo_~i~0#1| 18) ~n~0)} is VALID [2022-02-20 23:44:09,736 INFO L290 TraceCheckUtils]: 39: Hoare triple {8568#(< (+ 19 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {8558#(< (+ |ULTIMATE.start_foo_~i~0#1| 18) ~n~0)} is VALID [2022-02-20 23:44:09,736 INFO L290 TraceCheckUtils]: 38: Hoare triple {8568#(< (+ 19 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {8568#(< (+ 19 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:09,736 INFO L290 TraceCheckUtils]: 37: Hoare triple {8568#(< (+ 19 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {8568#(< (+ 19 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:09,737 INFO L290 TraceCheckUtils]: 36: Hoare triple {8578#(< (+ |ULTIMATE.start_foo_~i~0#1| 20) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {8568#(< (+ 19 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:09,737 INFO L290 TraceCheckUtils]: 35: Hoare triple {8578#(< (+ |ULTIMATE.start_foo_~i~0#1| 20) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {8578#(< (+ |ULTIMATE.start_foo_~i~0#1| 20) ~n~0)} is VALID [2022-02-20 23:44:09,737 INFO L290 TraceCheckUtils]: 34: Hoare triple {8578#(< (+ |ULTIMATE.start_foo_~i~0#1| 20) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {8578#(< (+ |ULTIMATE.start_foo_~i~0#1| 20) ~n~0)} is VALID [2022-02-20 23:44:09,738 INFO L290 TraceCheckUtils]: 33: Hoare triple {8588#(< (+ |ULTIMATE.start_foo_~i~0#1| 21) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {8578#(< (+ |ULTIMATE.start_foo_~i~0#1| 20) ~n~0)} is VALID [2022-02-20 23:44:09,738 INFO L290 TraceCheckUtils]: 32: Hoare triple {8588#(< (+ |ULTIMATE.start_foo_~i~0#1| 21) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {8588#(< (+ |ULTIMATE.start_foo_~i~0#1| 21) ~n~0)} is VALID [2022-02-20 23:44:09,739 INFO L290 TraceCheckUtils]: 31: Hoare triple {8588#(< (+ |ULTIMATE.start_foo_~i~0#1| 21) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {8588#(< (+ |ULTIMATE.start_foo_~i~0#1| 21) ~n~0)} is VALID [2022-02-20 23:44:09,739 INFO L290 TraceCheckUtils]: 30: Hoare triple {8598#(< (+ |ULTIMATE.start_foo_~i~0#1| 22) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {8588#(< (+ |ULTIMATE.start_foo_~i~0#1| 21) ~n~0)} is VALID [2022-02-20 23:44:09,740 INFO L290 TraceCheckUtils]: 29: Hoare triple {8598#(< (+ |ULTIMATE.start_foo_~i~0#1| 22) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {8598#(< (+ |ULTIMATE.start_foo_~i~0#1| 22) ~n~0)} is VALID [2022-02-20 23:44:09,740 INFO L290 TraceCheckUtils]: 28: Hoare triple {8598#(< (+ |ULTIMATE.start_foo_~i~0#1| 22) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {8598#(< (+ |ULTIMATE.start_foo_~i~0#1| 22) ~n~0)} is VALID [2022-02-20 23:44:09,740 INFO L290 TraceCheckUtils]: 27: Hoare triple {8608#(< (+ 23 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {8598#(< (+ |ULTIMATE.start_foo_~i~0#1| 22) ~n~0)} is VALID [2022-02-20 23:44:09,741 INFO L290 TraceCheckUtils]: 26: Hoare triple {8608#(< (+ 23 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {8608#(< (+ 23 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:09,741 INFO L290 TraceCheckUtils]: 25: Hoare triple {8608#(< (+ 23 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {8608#(< (+ 23 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:09,741 INFO L290 TraceCheckUtils]: 24: Hoare triple {8618#(< (+ |ULTIMATE.start_foo_~i~0#1| 24) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {8608#(< (+ 23 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:09,742 INFO L290 TraceCheckUtils]: 23: Hoare triple {8618#(< (+ |ULTIMATE.start_foo_~i~0#1| 24) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {8618#(< (+ |ULTIMATE.start_foo_~i~0#1| 24) ~n~0)} is VALID [2022-02-20 23:44:09,742 INFO L290 TraceCheckUtils]: 22: Hoare triple {8618#(< (+ |ULTIMATE.start_foo_~i~0#1| 24) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {8618#(< (+ |ULTIMATE.start_foo_~i~0#1| 24) ~n~0)} is VALID [2022-02-20 23:44:09,742 INFO L290 TraceCheckUtils]: 21: Hoare triple {8628#(< (+ |ULTIMATE.start_foo_~i~0#1| 25) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {8618#(< (+ |ULTIMATE.start_foo_~i~0#1| 24) ~n~0)} is VALID [2022-02-20 23:44:09,743 INFO L290 TraceCheckUtils]: 20: Hoare triple {8628#(< (+ |ULTIMATE.start_foo_~i~0#1| 25) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {8628#(< (+ |ULTIMATE.start_foo_~i~0#1| 25) ~n~0)} is VALID [2022-02-20 23:44:09,743 INFO L290 TraceCheckUtils]: 19: Hoare triple {8628#(< (+ |ULTIMATE.start_foo_~i~0#1| 25) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {8628#(< (+ |ULTIMATE.start_foo_~i~0#1| 25) ~n~0)} is VALID [2022-02-20 23:44:09,743 INFO L290 TraceCheckUtils]: 18: Hoare triple {8638#(< (+ |ULTIMATE.start_foo_~i~0#1| 26) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {8628#(< (+ |ULTIMATE.start_foo_~i~0#1| 25) ~n~0)} is VALID [2022-02-20 23:44:09,744 INFO L290 TraceCheckUtils]: 17: Hoare triple {8638#(< (+ |ULTIMATE.start_foo_~i~0#1| 26) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {8638#(< (+ |ULTIMATE.start_foo_~i~0#1| 26) ~n~0)} is VALID [2022-02-20 23:44:09,744 INFO L290 TraceCheckUtils]: 16: Hoare triple {8638#(< (+ |ULTIMATE.start_foo_~i~0#1| 26) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {8638#(< (+ |ULTIMATE.start_foo_~i~0#1| 26) ~n~0)} is VALID [2022-02-20 23:44:09,744 INFO L290 TraceCheckUtils]: 15: Hoare triple {8648#(< (+ |ULTIMATE.start_foo_~i~0#1| 27) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {8638#(< (+ |ULTIMATE.start_foo_~i~0#1| 26) ~n~0)} is VALID [2022-02-20 23:44:09,745 INFO L290 TraceCheckUtils]: 14: Hoare triple {8648#(< (+ |ULTIMATE.start_foo_~i~0#1| 27) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {8648#(< (+ |ULTIMATE.start_foo_~i~0#1| 27) ~n~0)} is VALID [2022-02-20 23:44:09,745 INFO L290 TraceCheckUtils]: 13: Hoare triple {8648#(< (+ |ULTIMATE.start_foo_~i~0#1| 27) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {8648#(< (+ |ULTIMATE.start_foo_~i~0#1| 27) ~n~0)} is VALID [2022-02-20 23:44:09,745 INFO L290 TraceCheckUtils]: 12: Hoare triple {8658#(< (+ |ULTIMATE.start_foo_~i~0#1| 28) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {8648#(< (+ |ULTIMATE.start_foo_~i~0#1| 27) ~n~0)} is VALID [2022-02-20 23:44:09,746 INFO L290 TraceCheckUtils]: 11: Hoare triple {8658#(< (+ |ULTIMATE.start_foo_~i~0#1| 28) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {8658#(< (+ |ULTIMATE.start_foo_~i~0#1| 28) ~n~0)} is VALID [2022-02-20 23:44:09,746 INFO L290 TraceCheckUtils]: 10: Hoare triple {8658#(< (+ |ULTIMATE.start_foo_~i~0#1| 28) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {8658#(< (+ |ULTIMATE.start_foo_~i~0#1| 28) ~n~0)} is VALID [2022-02-20 23:44:09,746 INFO L290 TraceCheckUtils]: 9: Hoare triple {8668#(< (+ |ULTIMATE.start_foo_~i~0#1| 29) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {8658#(< (+ |ULTIMATE.start_foo_~i~0#1| 28) ~n~0)} is VALID [2022-02-20 23:44:09,747 INFO L290 TraceCheckUtils]: 8: Hoare triple {8668#(< (+ |ULTIMATE.start_foo_~i~0#1| 29) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {8668#(< (+ |ULTIMATE.start_foo_~i~0#1| 29) ~n~0)} is VALID [2022-02-20 23:44:09,747 INFO L290 TraceCheckUtils]: 7: Hoare triple {8668#(< (+ |ULTIMATE.start_foo_~i~0#1| 29) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {8668#(< (+ |ULTIMATE.start_foo_~i~0#1| 29) ~n~0)} is VALID [2022-02-20 23:44:09,747 INFO L290 TraceCheckUtils]: 6: Hoare triple {8678#(< (+ |ULTIMATE.start_foo_~i~0#1| 30) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {8668#(< (+ |ULTIMATE.start_foo_~i~0#1| 29) ~n~0)} is VALID [2022-02-20 23:44:09,748 INFO L290 TraceCheckUtils]: 5: Hoare triple {8678#(< (+ |ULTIMATE.start_foo_~i~0#1| 30) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {8678#(< (+ |ULTIMATE.start_foo_~i~0#1| 30) ~n~0)} is VALID [2022-02-20 23:44:09,748 INFO L290 TraceCheckUtils]: 4: Hoare triple {8678#(< (+ |ULTIMATE.start_foo_~i~0#1| 30) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {8678#(< (+ |ULTIMATE.start_foo_~i~0#1| 30) ~n~0)} is VALID [2022-02-20 23:44:09,748 INFO L290 TraceCheckUtils]: 3: Hoare triple {8688#(< 30 ~n~0)} havoc main_#t~post7#1.base, main_#t~post7#1.offset;assume { :begin_inline_foo } true;havoc foo_#t~post3#1, foo_#t~post4#1, foo_~i~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {8678#(< (+ |ULTIMATE.start_foo_~i~0#1| 30) ~n~0)} is VALID [2022-02-20 23:44:09,748 INFO L290 TraceCheckUtils]: 2: Hoare triple {8688#(< 30 ~n~0)} SUMMARY for call write~int(0, main_#t~post7#1.base, main_#t~post7#1.offset, 4); srcloc: L538 {8688#(< 30 ~n~0)} is VALID [2022-02-20 23:44:09,749 INFO L290 TraceCheckUtils]: 1: Hoare triple {7725#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~post7#1.base, main_#t~post7#1.offset, main_#t~mem8#1;~n~0 := 32768;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~a~0.base, ~a~0.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~b~0.base, ~b~0.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_#t~post7#1.base, main_#t~post7#1.offset := ~b~0.base, ~b~0.offset;~b~0.base, ~b~0.offset := main_#t~post7#1.base, 4 + main_#t~post7#1.offset; {8688#(< 30 ~n~0)} is VALID [2022-02-20 23:44:09,749 INFO L290 TraceCheckUtils]: 0: Hoare triple {7725#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);~a~0.base, ~a~0.offset := 0, 0;~b~0.base, ~b~0.offset := 0, 0;~n~0 := 0; {7725#true} is VALID [2022-02-20 23:44:09,750 INFO L134 CoverageAnalysis]: Checked inductivity of 1665 backedges. 0 proven. 1335 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2022-02-20 23:44:09,750 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [4374413] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:44:09,750 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:44:09,750 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 34, 34] total 82 [2022-02-20 23:44:09,750 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776540884] [2022-02-20 23:44:09,750 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:44:09,755 INFO L78 Accepts]: Start accepts. Automaton has has 82 states, 82 states have (on average 3.1097560975609757) internal successors, (255), 82 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 149 [2022-02-20 23:44:09,755 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:09,756 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 82 states, 82 states have (on average 3.1097560975609757) internal successors, (255), 82 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:09,912 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 255 edges. 255 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:09,912 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2022-02-20 23:44:09,912 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:44:09,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2022-02-20 23:44:09,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2370, Invalid=4272, Unknown=0, NotChecked=0, Total=6642 [2022-02-20 23:44:09,914 INFO L87 Difference]: Start difference. First operand 161 states and 162 transitions. Second operand has 82 states, 82 states have (on average 3.1097560975609757) internal successors, (255), 82 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:13,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:13,420 INFO L93 Difference]: Finished difference Result 965 states and 966 transitions. [2022-02-20 23:44:13,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-02-20 23:44:13,420 INFO L78 Accepts]: Start accepts. Automaton has has 82 states, 82 states have (on average 3.1097560975609757) internal successors, (255), 82 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 149 [2022-02-20 23:44:13,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:13,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 82 states have (on average 3.1097560975609757) internal successors, (255), 82 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:13,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 1014 transitions. [2022-02-20 23:44:13,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 82 states have (on average 3.1097560975609757) internal successors, (255), 82 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:13,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 1014 transitions. [2022-02-20 23:44:13,430 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 65 states and 1014 transitions. [2022-02-20 23:44:14,083 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1014 edges. 1014 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:14,107 INFO L225 Difference]: With dead ends: 965 [2022-02-20 23:44:14,108 INFO L226 Difference]: Without dead ends: 965 [2022-02-20 23:44:14,110 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3949 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=4529, Invalid=8353, Unknown=0, NotChecked=0, Total=12882 [2022-02-20 23:44:14,110 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 3927 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 481 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3927 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 481 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:14,110 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3927 Valid, 704 Invalid, 965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [481 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 23:44:14,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2022-02-20 23:44:14,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 305. [2022-02-20 23:44:14,114 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:14,115 INFO L82 GeneralOperation]: Start isEquivalent. First operand 965 states. Second operand has 305 states, 301 states have (on average 1.0166112956810631) internal successors, (306), 304 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:14,115 INFO L74 IsIncluded]: Start isIncluded. First operand 965 states. Second operand has 305 states, 301 states have (on average 1.0166112956810631) internal successors, (306), 304 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:14,115 INFO L87 Difference]: Start difference. First operand 965 states. Second operand has 305 states, 301 states have (on average 1.0166112956810631) internal successors, (306), 304 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:14,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:14,140 INFO L93 Difference]: Finished difference Result 965 states and 966 transitions. [2022-02-20 23:44:14,140 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 966 transitions. [2022-02-20 23:44:14,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:14,141 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:14,141 INFO L74 IsIncluded]: Start isIncluded. First operand has 305 states, 301 states have (on average 1.0166112956810631) internal successors, (306), 304 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 965 states. [2022-02-20 23:44:14,142 INFO L87 Difference]: Start difference. First operand has 305 states, 301 states have (on average 1.0166112956810631) internal successors, (306), 304 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 965 states. [2022-02-20 23:44:14,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:14,166 INFO L93 Difference]: Finished difference Result 965 states and 966 transitions. [2022-02-20 23:44:14,166 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 966 transitions. [2022-02-20 23:44:14,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:14,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:14,168 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:14,168 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:14,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 301 states have (on average 1.0166112956810631) internal successors, (306), 304 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:14,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 306 transitions. [2022-02-20 23:44:14,171 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 306 transitions. Word has length 149 [2022-02-20 23:44:14,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:14,172 INFO L470 AbstractCegarLoop]: Abstraction has 305 states and 306 transitions. [2022-02-20 23:44:14,172 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 82 states, 82 states have (on average 3.1097560975609757) internal successors, (255), 82 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:14,172 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 306 transitions. [2022-02-20 23:44:14,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2022-02-20 23:44:14,174 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:14,174 INFO L514 BasicCegarLoop]: trace histogram [62, 62, 62, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:44:14,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-02-20 23:44:14,385 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-02-20 23:44:14,385 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2022-02-20 23:44:14,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:14,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1756594171, now seen corresponding path program 2 times [2022-02-20 23:44:14,386 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:44:14,386 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191595379] [2022-02-20 23:44:14,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:14,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:44:14,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:15,035 INFO L290 TraceCheckUtils]: 0: Hoare triple {11993#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);~a~0.base, ~a~0.offset := 0, 0;~b~0.base, ~b~0.offset := 0, 0;~n~0 := 0; {11993#true} is VALID [2022-02-20 23:44:15,035 INFO L290 TraceCheckUtils]: 1: Hoare triple {11993#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~post7#1.base, main_#t~post7#1.offset, main_#t~mem8#1;~n~0 := 32768;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~a~0.base, ~a~0.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~b~0.base, ~b~0.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_#t~post7#1.base, main_#t~post7#1.offset := ~b~0.base, ~b~0.offset;~b~0.base, ~b~0.offset := main_#t~post7#1.base, 4 + main_#t~post7#1.offset; {11993#true} is VALID [2022-02-20 23:44:15,035 INFO L290 TraceCheckUtils]: 2: Hoare triple {11993#true} SUMMARY for call write~int(0, main_#t~post7#1.base, main_#t~post7#1.offset, 4); srcloc: L538 {11993#true} is VALID [2022-02-20 23:44:15,036 INFO L290 TraceCheckUtils]: 3: Hoare triple {11993#true} havoc main_#t~post7#1.base, main_#t~post7#1.offset;assume { :begin_inline_foo } true;havoc foo_#t~post3#1, foo_#t~post4#1, foo_~i~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {11993#true} is VALID [2022-02-20 23:44:15,036 INFO L290 TraceCheckUtils]: 4: Hoare triple {11993#true} assume !!(foo_~i~0#1 < ~n~0); {11993#true} is VALID [2022-02-20 23:44:15,036 INFO L290 TraceCheckUtils]: 5: Hoare triple {11993#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11993#true} is VALID [2022-02-20 23:44:15,036 INFO L290 TraceCheckUtils]: 6: Hoare triple {11993#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11993#true} is VALID [2022-02-20 23:44:15,036 INFO L290 TraceCheckUtils]: 7: Hoare triple {11993#true} assume !!(foo_~i~0#1 < ~n~0); {11993#true} is VALID [2022-02-20 23:44:15,036 INFO L290 TraceCheckUtils]: 8: Hoare triple {11993#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11993#true} is VALID [2022-02-20 23:44:15,036 INFO L290 TraceCheckUtils]: 9: Hoare triple {11993#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11993#true} is VALID [2022-02-20 23:44:15,036 INFO L290 TraceCheckUtils]: 10: Hoare triple {11993#true} assume !!(foo_~i~0#1 < ~n~0); {11993#true} is VALID [2022-02-20 23:44:15,036 INFO L290 TraceCheckUtils]: 11: Hoare triple {11993#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11993#true} is VALID [2022-02-20 23:44:15,036 INFO L290 TraceCheckUtils]: 12: Hoare triple {11993#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11993#true} is VALID [2022-02-20 23:44:15,036 INFO L290 TraceCheckUtils]: 13: Hoare triple {11993#true} assume !!(foo_~i~0#1 < ~n~0); {11993#true} is VALID [2022-02-20 23:44:15,036 INFO L290 TraceCheckUtils]: 14: Hoare triple {11993#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11993#true} is VALID [2022-02-20 23:44:15,036 INFO L290 TraceCheckUtils]: 15: Hoare triple {11993#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11993#true} is VALID [2022-02-20 23:44:15,036 INFO L290 TraceCheckUtils]: 16: Hoare triple {11993#true} assume !!(foo_~i~0#1 < ~n~0); {11993#true} is VALID [2022-02-20 23:44:15,036 INFO L290 TraceCheckUtils]: 17: Hoare triple {11993#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11993#true} is VALID [2022-02-20 23:44:15,036 INFO L290 TraceCheckUtils]: 18: Hoare triple {11993#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11993#true} is VALID [2022-02-20 23:44:15,037 INFO L290 TraceCheckUtils]: 19: Hoare triple {11993#true} assume !!(foo_~i~0#1 < ~n~0); {11993#true} is VALID [2022-02-20 23:44:15,037 INFO L290 TraceCheckUtils]: 20: Hoare triple {11993#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11993#true} is VALID [2022-02-20 23:44:15,037 INFO L290 TraceCheckUtils]: 21: Hoare triple {11993#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11993#true} is VALID [2022-02-20 23:44:15,037 INFO L290 TraceCheckUtils]: 22: Hoare triple {11993#true} assume !!(foo_~i~0#1 < ~n~0); {11993#true} is VALID [2022-02-20 23:44:15,037 INFO L290 TraceCheckUtils]: 23: Hoare triple {11993#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11993#true} is VALID [2022-02-20 23:44:15,037 INFO L290 TraceCheckUtils]: 24: Hoare triple {11993#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11993#true} is VALID [2022-02-20 23:44:15,037 INFO L290 TraceCheckUtils]: 25: Hoare triple {11993#true} assume !!(foo_~i~0#1 < ~n~0); {11993#true} is VALID [2022-02-20 23:44:15,037 INFO L290 TraceCheckUtils]: 26: Hoare triple {11993#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11993#true} is VALID [2022-02-20 23:44:15,037 INFO L290 TraceCheckUtils]: 27: Hoare triple {11993#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11993#true} is VALID [2022-02-20 23:44:15,037 INFO L290 TraceCheckUtils]: 28: Hoare triple {11993#true} assume !!(foo_~i~0#1 < ~n~0); {11993#true} is VALID [2022-02-20 23:44:15,037 INFO L290 TraceCheckUtils]: 29: Hoare triple {11993#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11993#true} is VALID [2022-02-20 23:44:15,037 INFO L290 TraceCheckUtils]: 30: Hoare triple {11993#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11993#true} is VALID [2022-02-20 23:44:15,037 INFO L290 TraceCheckUtils]: 31: Hoare triple {11993#true} assume !!(foo_~i~0#1 < ~n~0); {11993#true} is VALID [2022-02-20 23:44:15,037 INFO L290 TraceCheckUtils]: 32: Hoare triple {11993#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11993#true} is VALID [2022-02-20 23:44:15,037 INFO L290 TraceCheckUtils]: 33: Hoare triple {11993#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11993#true} is VALID [2022-02-20 23:44:15,037 INFO L290 TraceCheckUtils]: 34: Hoare triple {11993#true} assume !!(foo_~i~0#1 < ~n~0); {11993#true} is VALID [2022-02-20 23:44:15,037 INFO L290 TraceCheckUtils]: 35: Hoare triple {11993#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11993#true} is VALID [2022-02-20 23:44:15,037 INFO L290 TraceCheckUtils]: 36: Hoare triple {11993#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11993#true} is VALID [2022-02-20 23:44:15,037 INFO L290 TraceCheckUtils]: 37: Hoare triple {11993#true} assume !!(foo_~i~0#1 < ~n~0); {11993#true} is VALID [2022-02-20 23:44:15,037 INFO L290 TraceCheckUtils]: 38: Hoare triple {11993#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11993#true} is VALID [2022-02-20 23:44:15,038 INFO L290 TraceCheckUtils]: 39: Hoare triple {11993#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11993#true} is VALID [2022-02-20 23:44:15,038 INFO L290 TraceCheckUtils]: 40: Hoare triple {11993#true} assume !!(foo_~i~0#1 < ~n~0); {11993#true} is VALID [2022-02-20 23:44:15,038 INFO L290 TraceCheckUtils]: 41: Hoare triple {11993#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11993#true} is VALID [2022-02-20 23:44:15,038 INFO L290 TraceCheckUtils]: 42: Hoare triple {11993#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11993#true} is VALID [2022-02-20 23:44:15,038 INFO L290 TraceCheckUtils]: 43: Hoare triple {11993#true} assume !!(foo_~i~0#1 < ~n~0); {11993#true} is VALID [2022-02-20 23:44:15,038 INFO L290 TraceCheckUtils]: 44: Hoare triple {11993#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11993#true} is VALID [2022-02-20 23:44:15,038 INFO L290 TraceCheckUtils]: 45: Hoare triple {11993#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11993#true} is VALID [2022-02-20 23:44:15,038 INFO L290 TraceCheckUtils]: 46: Hoare triple {11993#true} assume !!(foo_~i~0#1 < ~n~0); {11993#true} is VALID [2022-02-20 23:44:15,038 INFO L290 TraceCheckUtils]: 47: Hoare triple {11993#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11993#true} is VALID [2022-02-20 23:44:15,038 INFO L290 TraceCheckUtils]: 48: Hoare triple {11993#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11993#true} is VALID [2022-02-20 23:44:15,038 INFO L290 TraceCheckUtils]: 49: Hoare triple {11993#true} assume !!(foo_~i~0#1 < ~n~0); {11993#true} is VALID [2022-02-20 23:44:15,038 INFO L290 TraceCheckUtils]: 50: Hoare triple {11993#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11993#true} is VALID [2022-02-20 23:44:15,038 INFO L290 TraceCheckUtils]: 51: Hoare triple {11993#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11993#true} is VALID [2022-02-20 23:44:15,038 INFO L290 TraceCheckUtils]: 52: Hoare triple {11993#true} assume !!(foo_~i~0#1 < ~n~0); {11993#true} is VALID [2022-02-20 23:44:15,038 INFO L290 TraceCheckUtils]: 53: Hoare triple {11993#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11993#true} is VALID [2022-02-20 23:44:15,038 INFO L290 TraceCheckUtils]: 54: Hoare triple {11993#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11993#true} is VALID [2022-02-20 23:44:15,038 INFO L290 TraceCheckUtils]: 55: Hoare triple {11993#true} assume !!(foo_~i~0#1 < ~n~0); {11993#true} is VALID [2022-02-20 23:44:15,038 INFO L290 TraceCheckUtils]: 56: Hoare triple {11993#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11993#true} is VALID [2022-02-20 23:44:15,038 INFO L290 TraceCheckUtils]: 57: Hoare triple {11993#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11993#true} is VALID [2022-02-20 23:44:15,038 INFO L290 TraceCheckUtils]: 58: Hoare triple {11993#true} assume !!(foo_~i~0#1 < ~n~0); {11993#true} is VALID [2022-02-20 23:44:15,038 INFO L290 TraceCheckUtils]: 59: Hoare triple {11993#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11993#true} is VALID [2022-02-20 23:44:15,038 INFO L290 TraceCheckUtils]: 60: Hoare triple {11993#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11993#true} is VALID [2022-02-20 23:44:15,039 INFO L290 TraceCheckUtils]: 61: Hoare triple {11993#true} assume !!(foo_~i~0#1 < ~n~0); {11993#true} is VALID [2022-02-20 23:44:15,039 INFO L290 TraceCheckUtils]: 62: Hoare triple {11993#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11993#true} is VALID [2022-02-20 23:44:15,039 INFO L290 TraceCheckUtils]: 63: Hoare triple {11993#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11993#true} is VALID [2022-02-20 23:44:15,039 INFO L290 TraceCheckUtils]: 64: Hoare triple {11993#true} assume !!(foo_~i~0#1 < ~n~0); {11993#true} is VALID [2022-02-20 23:44:15,039 INFO L290 TraceCheckUtils]: 65: Hoare triple {11993#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11993#true} is VALID [2022-02-20 23:44:15,039 INFO L290 TraceCheckUtils]: 66: Hoare triple {11993#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11993#true} is VALID [2022-02-20 23:44:15,039 INFO L290 TraceCheckUtils]: 67: Hoare triple {11993#true} assume !!(foo_~i~0#1 < ~n~0); {11993#true} is VALID [2022-02-20 23:44:15,039 INFO L290 TraceCheckUtils]: 68: Hoare triple {11993#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11993#true} is VALID [2022-02-20 23:44:15,039 INFO L290 TraceCheckUtils]: 69: Hoare triple {11993#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11993#true} is VALID [2022-02-20 23:44:15,039 INFO L290 TraceCheckUtils]: 70: Hoare triple {11993#true} assume !!(foo_~i~0#1 < ~n~0); {11993#true} is VALID [2022-02-20 23:44:15,039 INFO L290 TraceCheckUtils]: 71: Hoare triple {11993#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11993#true} is VALID [2022-02-20 23:44:15,039 INFO L290 TraceCheckUtils]: 72: Hoare triple {11993#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11993#true} is VALID [2022-02-20 23:44:15,039 INFO L290 TraceCheckUtils]: 73: Hoare triple {11993#true} assume !!(foo_~i~0#1 < ~n~0); {11993#true} is VALID [2022-02-20 23:44:15,039 INFO L290 TraceCheckUtils]: 74: Hoare triple {11993#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11993#true} is VALID [2022-02-20 23:44:15,039 INFO L290 TraceCheckUtils]: 75: Hoare triple {11993#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11993#true} is VALID [2022-02-20 23:44:15,039 INFO L290 TraceCheckUtils]: 76: Hoare triple {11993#true} assume !!(foo_~i~0#1 < ~n~0); {11993#true} is VALID [2022-02-20 23:44:15,039 INFO L290 TraceCheckUtils]: 77: Hoare triple {11993#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11993#true} is VALID [2022-02-20 23:44:15,039 INFO L290 TraceCheckUtils]: 78: Hoare triple {11993#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11993#true} is VALID [2022-02-20 23:44:15,040 INFO L290 TraceCheckUtils]: 79: Hoare triple {11993#true} assume !!(foo_~i~0#1 < ~n~0); {11993#true} is VALID [2022-02-20 23:44:15,040 INFO L290 TraceCheckUtils]: 80: Hoare triple {11993#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11993#true} is VALID [2022-02-20 23:44:15,040 INFO L290 TraceCheckUtils]: 81: Hoare triple {11993#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11993#true} is VALID [2022-02-20 23:44:15,040 INFO L290 TraceCheckUtils]: 82: Hoare triple {11993#true} assume !!(foo_~i~0#1 < ~n~0); {11993#true} is VALID [2022-02-20 23:44:15,040 INFO L290 TraceCheckUtils]: 83: Hoare triple {11993#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11993#true} is VALID [2022-02-20 23:44:15,040 INFO L290 TraceCheckUtils]: 84: Hoare triple {11993#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11993#true} is VALID [2022-02-20 23:44:15,040 INFO L290 TraceCheckUtils]: 85: Hoare triple {11993#true} assume !!(foo_~i~0#1 < ~n~0); {11993#true} is VALID [2022-02-20 23:44:15,040 INFO L290 TraceCheckUtils]: 86: Hoare triple {11993#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11993#true} is VALID [2022-02-20 23:44:15,040 INFO L290 TraceCheckUtils]: 87: Hoare triple {11993#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11993#true} is VALID [2022-02-20 23:44:15,040 INFO L290 TraceCheckUtils]: 88: Hoare triple {11993#true} assume !!(foo_~i~0#1 < ~n~0); {11993#true} is VALID [2022-02-20 23:44:15,040 INFO L290 TraceCheckUtils]: 89: Hoare triple {11993#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11993#true} is VALID [2022-02-20 23:44:15,040 INFO L290 TraceCheckUtils]: 90: Hoare triple {11993#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11993#true} is VALID [2022-02-20 23:44:15,040 INFO L290 TraceCheckUtils]: 91: Hoare triple {11993#true} assume !!(foo_~i~0#1 < ~n~0); {11993#true} is VALID [2022-02-20 23:44:15,040 INFO L290 TraceCheckUtils]: 92: Hoare triple {11993#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11993#true} is VALID [2022-02-20 23:44:15,040 INFO L290 TraceCheckUtils]: 93: Hoare triple {11993#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11993#true} is VALID [2022-02-20 23:44:15,040 INFO L290 TraceCheckUtils]: 94: Hoare triple {11993#true} assume !!(foo_~i~0#1 < ~n~0); {11993#true} is VALID [2022-02-20 23:44:15,040 INFO L290 TraceCheckUtils]: 95: Hoare triple {11993#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11993#true} is VALID [2022-02-20 23:44:15,040 INFO L290 TraceCheckUtils]: 96: Hoare triple {11993#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11993#true} is VALID [2022-02-20 23:44:15,041 INFO L290 TraceCheckUtils]: 97: Hoare triple {11993#true} assume !!(foo_~i~0#1 < ~n~0); {11993#true} is VALID [2022-02-20 23:44:15,041 INFO L290 TraceCheckUtils]: 98: Hoare triple {11993#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11993#true} is VALID [2022-02-20 23:44:15,041 INFO L290 TraceCheckUtils]: 99: Hoare triple {11993#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11993#true} is VALID [2022-02-20 23:44:15,041 INFO L290 TraceCheckUtils]: 100: Hoare triple {11993#true} assume !!(foo_~i~0#1 < ~n~0); {11993#true} is VALID [2022-02-20 23:44:15,041 INFO L290 TraceCheckUtils]: 101: Hoare triple {11993#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11993#true} is VALID [2022-02-20 23:44:15,041 INFO L290 TraceCheckUtils]: 102: Hoare triple {11993#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11993#true} is VALID [2022-02-20 23:44:15,041 INFO L290 TraceCheckUtils]: 103: Hoare triple {11993#true} assume !!(foo_~i~0#1 < ~n~0); {11993#true} is VALID [2022-02-20 23:44:15,041 INFO L290 TraceCheckUtils]: 104: Hoare triple {11993#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11993#true} is VALID [2022-02-20 23:44:15,041 INFO L290 TraceCheckUtils]: 105: Hoare triple {11993#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11993#true} is VALID [2022-02-20 23:44:15,041 INFO L290 TraceCheckUtils]: 106: Hoare triple {11993#true} assume !!(foo_~i~0#1 < ~n~0); {11993#true} is VALID [2022-02-20 23:44:15,041 INFO L290 TraceCheckUtils]: 107: Hoare triple {11993#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11993#true} is VALID [2022-02-20 23:44:15,041 INFO L290 TraceCheckUtils]: 108: Hoare triple {11993#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11993#true} is VALID [2022-02-20 23:44:15,041 INFO L290 TraceCheckUtils]: 109: Hoare triple {11993#true} assume !!(foo_~i~0#1 < ~n~0); {11993#true} is VALID [2022-02-20 23:44:15,041 INFO L290 TraceCheckUtils]: 110: Hoare triple {11993#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11993#true} is VALID [2022-02-20 23:44:15,041 INFO L290 TraceCheckUtils]: 111: Hoare triple {11993#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11993#true} is VALID [2022-02-20 23:44:15,041 INFO L290 TraceCheckUtils]: 112: Hoare triple {11993#true} assume !!(foo_~i~0#1 < ~n~0); {11993#true} is VALID [2022-02-20 23:44:15,041 INFO L290 TraceCheckUtils]: 113: Hoare triple {11993#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11993#true} is VALID [2022-02-20 23:44:15,041 INFO L290 TraceCheckUtils]: 114: Hoare triple {11993#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11993#true} is VALID [2022-02-20 23:44:15,042 INFO L290 TraceCheckUtils]: 115: Hoare triple {11993#true} assume !!(foo_~i~0#1 < ~n~0); {11993#true} is VALID [2022-02-20 23:44:15,042 INFO L290 TraceCheckUtils]: 116: Hoare triple {11993#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11993#true} is VALID [2022-02-20 23:44:15,042 INFO L290 TraceCheckUtils]: 117: Hoare triple {11993#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11993#true} is VALID [2022-02-20 23:44:15,042 INFO L290 TraceCheckUtils]: 118: Hoare triple {11993#true} assume !!(foo_~i~0#1 < ~n~0); {11993#true} is VALID [2022-02-20 23:44:15,042 INFO L290 TraceCheckUtils]: 119: Hoare triple {11993#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11993#true} is VALID [2022-02-20 23:44:15,042 INFO L290 TraceCheckUtils]: 120: Hoare triple {11993#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11993#true} is VALID [2022-02-20 23:44:15,042 INFO L290 TraceCheckUtils]: 121: Hoare triple {11993#true} assume !!(foo_~i~0#1 < ~n~0); {11993#true} is VALID [2022-02-20 23:44:15,042 INFO L290 TraceCheckUtils]: 122: Hoare triple {11993#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11993#true} is VALID [2022-02-20 23:44:15,042 INFO L290 TraceCheckUtils]: 123: Hoare triple {11993#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11993#true} is VALID [2022-02-20 23:44:15,042 INFO L290 TraceCheckUtils]: 124: Hoare triple {11993#true} assume !!(foo_~i~0#1 < ~n~0); {11993#true} is VALID [2022-02-20 23:44:15,042 INFO L290 TraceCheckUtils]: 125: Hoare triple {11993#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11993#true} is VALID [2022-02-20 23:44:15,042 INFO L290 TraceCheckUtils]: 126: Hoare triple {11993#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11993#true} is VALID [2022-02-20 23:44:15,042 INFO L290 TraceCheckUtils]: 127: Hoare triple {11993#true} assume !!(foo_~i~0#1 < ~n~0); {11993#true} is VALID [2022-02-20 23:44:15,042 INFO L290 TraceCheckUtils]: 128: Hoare triple {11993#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11993#true} is VALID [2022-02-20 23:44:15,042 INFO L290 TraceCheckUtils]: 129: Hoare triple {11993#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11993#true} is VALID [2022-02-20 23:44:15,043 INFO L290 TraceCheckUtils]: 130: Hoare triple {11993#true} assume !!(foo_~i~0#1 < ~n~0); {11993#true} is VALID [2022-02-20 23:44:15,043 INFO L290 TraceCheckUtils]: 131: Hoare triple {11993#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11993#true} is VALID [2022-02-20 23:44:15,043 INFO L290 TraceCheckUtils]: 132: Hoare triple {11993#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11993#true} is VALID [2022-02-20 23:44:15,043 INFO L290 TraceCheckUtils]: 133: Hoare triple {11993#true} assume !!(foo_~i~0#1 < ~n~0); {11993#true} is VALID [2022-02-20 23:44:15,043 INFO L290 TraceCheckUtils]: 134: Hoare triple {11993#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11993#true} is VALID [2022-02-20 23:44:15,043 INFO L290 TraceCheckUtils]: 135: Hoare triple {11993#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11993#true} is VALID [2022-02-20 23:44:15,043 INFO L290 TraceCheckUtils]: 136: Hoare triple {11993#true} assume !!(foo_~i~0#1 < ~n~0); {11993#true} is VALID [2022-02-20 23:44:15,043 INFO L290 TraceCheckUtils]: 137: Hoare triple {11993#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11993#true} is VALID [2022-02-20 23:44:15,043 INFO L290 TraceCheckUtils]: 138: Hoare triple {11993#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11993#true} is VALID [2022-02-20 23:44:15,043 INFO L290 TraceCheckUtils]: 139: Hoare triple {11993#true} assume !!(foo_~i~0#1 < ~n~0); {11993#true} is VALID [2022-02-20 23:44:15,044 INFO L290 TraceCheckUtils]: 140: Hoare triple {11993#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11993#true} is VALID [2022-02-20 23:44:15,044 INFO L290 TraceCheckUtils]: 141: Hoare triple {11993#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11993#true} is VALID [2022-02-20 23:44:15,044 INFO L290 TraceCheckUtils]: 142: Hoare triple {11993#true} assume !!(foo_~i~0#1 < ~n~0); {11993#true} is VALID [2022-02-20 23:44:15,044 INFO L290 TraceCheckUtils]: 143: Hoare triple {11993#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11993#true} is VALID [2022-02-20 23:44:15,044 INFO L290 TraceCheckUtils]: 144: Hoare triple {11993#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11993#true} is VALID [2022-02-20 23:44:15,044 INFO L290 TraceCheckUtils]: 145: Hoare triple {11993#true} assume !!(foo_~i~0#1 < ~n~0); {11993#true} is VALID [2022-02-20 23:44:15,044 INFO L290 TraceCheckUtils]: 146: Hoare triple {11993#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11993#true} is VALID [2022-02-20 23:44:15,044 INFO L290 TraceCheckUtils]: 147: Hoare triple {11993#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11993#true} is VALID [2022-02-20 23:44:15,044 INFO L290 TraceCheckUtils]: 148: Hoare triple {11993#true} assume !!(foo_~i~0#1 < ~n~0); {11993#true} is VALID [2022-02-20 23:44:15,045 INFO L290 TraceCheckUtils]: 149: Hoare triple {11993#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11993#true} is VALID [2022-02-20 23:44:15,045 INFO L290 TraceCheckUtils]: 150: Hoare triple {11993#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11993#true} is VALID [2022-02-20 23:44:15,045 INFO L290 TraceCheckUtils]: 151: Hoare triple {11993#true} assume !!(foo_~i~0#1 < ~n~0); {11993#true} is VALID [2022-02-20 23:44:15,045 INFO L290 TraceCheckUtils]: 152: Hoare triple {11993#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11993#true} is VALID [2022-02-20 23:44:15,045 INFO L290 TraceCheckUtils]: 153: Hoare triple {11993#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11993#true} is VALID [2022-02-20 23:44:15,045 INFO L290 TraceCheckUtils]: 154: Hoare triple {11993#true} assume !!(foo_~i~0#1 < ~n~0); {11993#true} is VALID [2022-02-20 23:44:15,045 INFO L290 TraceCheckUtils]: 155: Hoare triple {11993#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11993#true} is VALID [2022-02-20 23:44:15,045 INFO L290 TraceCheckUtils]: 156: Hoare triple {11993#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11993#true} is VALID [2022-02-20 23:44:15,045 INFO L290 TraceCheckUtils]: 157: Hoare triple {11993#true} assume !!(foo_~i~0#1 < ~n~0); {11993#true} is VALID [2022-02-20 23:44:15,045 INFO L290 TraceCheckUtils]: 158: Hoare triple {11993#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11993#true} is VALID [2022-02-20 23:44:15,046 INFO L290 TraceCheckUtils]: 159: Hoare triple {11993#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11993#true} is VALID [2022-02-20 23:44:15,046 INFO L290 TraceCheckUtils]: 160: Hoare triple {11993#true} assume !!(foo_~i~0#1 < ~n~0); {11993#true} is VALID [2022-02-20 23:44:15,046 INFO L290 TraceCheckUtils]: 161: Hoare triple {11993#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11993#true} is VALID [2022-02-20 23:44:15,046 INFO L290 TraceCheckUtils]: 162: Hoare triple {11993#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11993#true} is VALID [2022-02-20 23:44:15,046 INFO L290 TraceCheckUtils]: 163: Hoare triple {11993#true} assume !!(foo_~i~0#1 < ~n~0); {11993#true} is VALID [2022-02-20 23:44:15,046 INFO L290 TraceCheckUtils]: 164: Hoare triple {11993#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11993#true} is VALID [2022-02-20 23:44:15,046 INFO L290 TraceCheckUtils]: 165: Hoare triple {11993#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11993#true} is VALID [2022-02-20 23:44:15,046 INFO L290 TraceCheckUtils]: 166: Hoare triple {11993#true} assume !!(foo_~i~0#1 < ~n~0); {11993#true} is VALID [2022-02-20 23:44:15,046 INFO L290 TraceCheckUtils]: 167: Hoare triple {11993#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11993#true} is VALID [2022-02-20 23:44:15,046 INFO L290 TraceCheckUtils]: 168: Hoare triple {11993#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11993#true} is VALID [2022-02-20 23:44:15,047 INFO L290 TraceCheckUtils]: 169: Hoare triple {11993#true} assume !!(foo_~i~0#1 < ~n~0); {11993#true} is VALID [2022-02-20 23:44:15,047 INFO L290 TraceCheckUtils]: 170: Hoare triple {11993#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11993#true} is VALID [2022-02-20 23:44:15,047 INFO L290 TraceCheckUtils]: 171: Hoare triple {11993#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11993#true} is VALID [2022-02-20 23:44:15,047 INFO L290 TraceCheckUtils]: 172: Hoare triple {11993#true} assume !!(foo_~i~0#1 < ~n~0); {11993#true} is VALID [2022-02-20 23:44:15,047 INFO L290 TraceCheckUtils]: 173: Hoare triple {11993#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11993#true} is VALID [2022-02-20 23:44:15,047 INFO L290 TraceCheckUtils]: 174: Hoare triple {11993#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11993#true} is VALID [2022-02-20 23:44:15,047 INFO L290 TraceCheckUtils]: 175: Hoare triple {11993#true} assume !!(foo_~i~0#1 < ~n~0); {11993#true} is VALID [2022-02-20 23:44:15,047 INFO L290 TraceCheckUtils]: 176: Hoare triple {11993#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11993#true} is VALID [2022-02-20 23:44:15,047 INFO L290 TraceCheckUtils]: 177: Hoare triple {11993#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11993#true} is VALID [2022-02-20 23:44:15,048 INFO L290 TraceCheckUtils]: 178: Hoare triple {11993#true} assume !!(foo_~i~0#1 < ~n~0); {11993#true} is VALID [2022-02-20 23:44:15,048 INFO L290 TraceCheckUtils]: 179: Hoare triple {11993#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11993#true} is VALID [2022-02-20 23:44:15,048 INFO L290 TraceCheckUtils]: 180: Hoare triple {11993#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11993#true} is VALID [2022-02-20 23:44:15,048 INFO L290 TraceCheckUtils]: 181: Hoare triple {11993#true} assume !!(foo_~i~0#1 < ~n~0); {11993#true} is VALID [2022-02-20 23:44:15,048 INFO L290 TraceCheckUtils]: 182: Hoare triple {11993#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11993#true} is VALID [2022-02-20 23:44:15,048 INFO L290 TraceCheckUtils]: 183: Hoare triple {11993#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11993#true} is VALID [2022-02-20 23:44:15,048 INFO L290 TraceCheckUtils]: 184: Hoare triple {11993#true} assume !!(foo_~i~0#1 < ~n~0); {11993#true} is VALID [2022-02-20 23:44:15,048 INFO L290 TraceCheckUtils]: 185: Hoare triple {11993#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11993#true} is VALID [2022-02-20 23:44:15,048 INFO L290 TraceCheckUtils]: 186: Hoare triple {11993#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11993#true} is VALID [2022-02-20 23:44:15,048 INFO L290 TraceCheckUtils]: 187: Hoare triple {11993#true} assume !!(foo_~i~0#1 < ~n~0); {11993#true} is VALID [2022-02-20 23:44:15,049 INFO L290 TraceCheckUtils]: 188: Hoare triple {11993#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11993#true} is VALID [2022-02-20 23:44:15,049 INFO L290 TraceCheckUtils]: 189: Hoare triple {11993#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11993#true} is VALID [2022-02-20 23:44:15,049 INFO L290 TraceCheckUtils]: 190: Hoare triple {11993#true} assume !(foo_~i~0#1 < ~n~0); {11993#true} is VALID [2022-02-20 23:44:15,049 INFO L290 TraceCheckUtils]: 191: Hoare triple {11993#true} foo_~i~0#1 := 0; {11995#(= |ULTIMATE.start_foo_~i~0#1| 0)} is VALID [2022-02-20 23:44:15,049 INFO L290 TraceCheckUtils]: 192: Hoare triple {11995#(= |ULTIMATE.start_foo_~i~0#1| 0)} assume !!(foo_~i~0#1 < 32767); {11995#(= |ULTIMATE.start_foo_~i~0#1| 0)} is VALID [2022-02-20 23:44:15,050 INFO L290 TraceCheckUtils]: 193: Hoare triple {11995#(= |ULTIMATE.start_foo_~i~0#1| 0)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {11995#(= |ULTIMATE.start_foo_~i~0#1| 0)} is VALID [2022-02-20 23:44:15,050 INFO L290 TraceCheckUtils]: 194: Hoare triple {11995#(= |ULTIMATE.start_foo_~i~0#1| 0)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {11996#(<= |ULTIMATE.start_foo_~i~0#1| 1)} is VALID [2022-02-20 23:44:15,050 INFO L290 TraceCheckUtils]: 195: Hoare triple {11996#(<= |ULTIMATE.start_foo_~i~0#1| 1)} assume !!(foo_~i~0#1 < 32767); {11996#(<= |ULTIMATE.start_foo_~i~0#1| 1)} is VALID [2022-02-20 23:44:15,050 INFO L290 TraceCheckUtils]: 196: Hoare triple {11996#(<= |ULTIMATE.start_foo_~i~0#1| 1)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {11996#(<= |ULTIMATE.start_foo_~i~0#1| 1)} is VALID [2022-02-20 23:44:15,051 INFO L290 TraceCheckUtils]: 197: Hoare triple {11996#(<= |ULTIMATE.start_foo_~i~0#1| 1)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {11997#(<= |ULTIMATE.start_foo_~i~0#1| 2)} is VALID [2022-02-20 23:44:15,051 INFO L290 TraceCheckUtils]: 198: Hoare triple {11997#(<= |ULTIMATE.start_foo_~i~0#1| 2)} assume !!(foo_~i~0#1 < 32767); {11997#(<= |ULTIMATE.start_foo_~i~0#1| 2)} is VALID [2022-02-20 23:44:15,051 INFO L290 TraceCheckUtils]: 199: Hoare triple {11997#(<= |ULTIMATE.start_foo_~i~0#1| 2)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {11997#(<= |ULTIMATE.start_foo_~i~0#1| 2)} is VALID [2022-02-20 23:44:15,052 INFO L290 TraceCheckUtils]: 200: Hoare triple {11997#(<= |ULTIMATE.start_foo_~i~0#1| 2)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {11998#(<= |ULTIMATE.start_foo_~i~0#1| 3)} is VALID [2022-02-20 23:44:15,052 INFO L290 TraceCheckUtils]: 201: Hoare triple {11998#(<= |ULTIMATE.start_foo_~i~0#1| 3)} assume !!(foo_~i~0#1 < 32767); {11998#(<= |ULTIMATE.start_foo_~i~0#1| 3)} is VALID [2022-02-20 23:44:15,052 INFO L290 TraceCheckUtils]: 202: Hoare triple {11998#(<= |ULTIMATE.start_foo_~i~0#1| 3)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {11998#(<= |ULTIMATE.start_foo_~i~0#1| 3)} is VALID [2022-02-20 23:44:15,052 INFO L290 TraceCheckUtils]: 203: Hoare triple {11998#(<= |ULTIMATE.start_foo_~i~0#1| 3)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {11999#(<= |ULTIMATE.start_foo_~i~0#1| 4)} is VALID [2022-02-20 23:44:15,053 INFO L290 TraceCheckUtils]: 204: Hoare triple {11999#(<= |ULTIMATE.start_foo_~i~0#1| 4)} assume !!(foo_~i~0#1 < 32767); {11999#(<= |ULTIMATE.start_foo_~i~0#1| 4)} is VALID [2022-02-20 23:44:15,053 INFO L290 TraceCheckUtils]: 205: Hoare triple {11999#(<= |ULTIMATE.start_foo_~i~0#1| 4)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {11999#(<= |ULTIMATE.start_foo_~i~0#1| 4)} is VALID [2022-02-20 23:44:15,053 INFO L290 TraceCheckUtils]: 206: Hoare triple {11999#(<= |ULTIMATE.start_foo_~i~0#1| 4)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {12000#(<= |ULTIMATE.start_foo_~i~0#1| 5)} is VALID [2022-02-20 23:44:15,054 INFO L290 TraceCheckUtils]: 207: Hoare triple {12000#(<= |ULTIMATE.start_foo_~i~0#1| 5)} assume !!(foo_~i~0#1 < 32767); {12000#(<= |ULTIMATE.start_foo_~i~0#1| 5)} is VALID [2022-02-20 23:44:15,054 INFO L290 TraceCheckUtils]: 208: Hoare triple {12000#(<= |ULTIMATE.start_foo_~i~0#1| 5)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {12000#(<= |ULTIMATE.start_foo_~i~0#1| 5)} is VALID [2022-02-20 23:44:15,054 INFO L290 TraceCheckUtils]: 209: Hoare triple {12000#(<= |ULTIMATE.start_foo_~i~0#1| 5)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {12001#(<= |ULTIMATE.start_foo_~i~0#1| 6)} is VALID [2022-02-20 23:44:15,054 INFO L290 TraceCheckUtils]: 210: Hoare triple {12001#(<= |ULTIMATE.start_foo_~i~0#1| 6)} assume !!(foo_~i~0#1 < 32767); {12001#(<= |ULTIMATE.start_foo_~i~0#1| 6)} is VALID [2022-02-20 23:44:15,055 INFO L290 TraceCheckUtils]: 211: Hoare triple {12001#(<= |ULTIMATE.start_foo_~i~0#1| 6)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {12001#(<= |ULTIMATE.start_foo_~i~0#1| 6)} is VALID [2022-02-20 23:44:15,055 INFO L290 TraceCheckUtils]: 212: Hoare triple {12001#(<= |ULTIMATE.start_foo_~i~0#1| 6)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {12002#(<= |ULTIMATE.start_foo_~i~0#1| 7)} is VALID [2022-02-20 23:44:15,055 INFO L290 TraceCheckUtils]: 213: Hoare triple {12002#(<= |ULTIMATE.start_foo_~i~0#1| 7)} assume !!(foo_~i~0#1 < 32767); {12002#(<= |ULTIMATE.start_foo_~i~0#1| 7)} is VALID [2022-02-20 23:44:15,055 INFO L290 TraceCheckUtils]: 214: Hoare triple {12002#(<= |ULTIMATE.start_foo_~i~0#1| 7)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {12002#(<= |ULTIMATE.start_foo_~i~0#1| 7)} is VALID [2022-02-20 23:44:15,056 INFO L290 TraceCheckUtils]: 215: Hoare triple {12002#(<= |ULTIMATE.start_foo_~i~0#1| 7)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {12003#(<= |ULTIMATE.start_foo_~i~0#1| 8)} is VALID [2022-02-20 23:44:15,056 INFO L290 TraceCheckUtils]: 216: Hoare triple {12003#(<= |ULTIMATE.start_foo_~i~0#1| 8)} assume !!(foo_~i~0#1 < 32767); {12003#(<= |ULTIMATE.start_foo_~i~0#1| 8)} is VALID [2022-02-20 23:44:15,056 INFO L290 TraceCheckUtils]: 217: Hoare triple {12003#(<= |ULTIMATE.start_foo_~i~0#1| 8)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {12003#(<= |ULTIMATE.start_foo_~i~0#1| 8)} is VALID [2022-02-20 23:44:15,057 INFO L290 TraceCheckUtils]: 218: Hoare triple {12003#(<= |ULTIMATE.start_foo_~i~0#1| 8)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {12004#(<= |ULTIMATE.start_foo_~i~0#1| 9)} is VALID [2022-02-20 23:44:15,057 INFO L290 TraceCheckUtils]: 219: Hoare triple {12004#(<= |ULTIMATE.start_foo_~i~0#1| 9)} assume !!(foo_~i~0#1 < 32767); {12004#(<= |ULTIMATE.start_foo_~i~0#1| 9)} is VALID [2022-02-20 23:44:15,057 INFO L290 TraceCheckUtils]: 220: Hoare triple {12004#(<= |ULTIMATE.start_foo_~i~0#1| 9)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {12004#(<= |ULTIMATE.start_foo_~i~0#1| 9)} is VALID [2022-02-20 23:44:15,057 INFO L290 TraceCheckUtils]: 221: Hoare triple {12004#(<= |ULTIMATE.start_foo_~i~0#1| 9)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {12005#(<= |ULTIMATE.start_foo_~i~0#1| 10)} is VALID [2022-02-20 23:44:15,058 INFO L290 TraceCheckUtils]: 222: Hoare triple {12005#(<= |ULTIMATE.start_foo_~i~0#1| 10)} assume !!(foo_~i~0#1 < 32767); {12005#(<= |ULTIMATE.start_foo_~i~0#1| 10)} is VALID [2022-02-20 23:44:15,058 INFO L290 TraceCheckUtils]: 223: Hoare triple {12005#(<= |ULTIMATE.start_foo_~i~0#1| 10)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {12005#(<= |ULTIMATE.start_foo_~i~0#1| 10)} is VALID [2022-02-20 23:44:15,058 INFO L290 TraceCheckUtils]: 224: Hoare triple {12005#(<= |ULTIMATE.start_foo_~i~0#1| 10)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {12006#(<= |ULTIMATE.start_foo_~i~0#1| 11)} is VALID [2022-02-20 23:44:15,059 INFO L290 TraceCheckUtils]: 225: Hoare triple {12006#(<= |ULTIMATE.start_foo_~i~0#1| 11)} assume !!(foo_~i~0#1 < 32767); {12006#(<= |ULTIMATE.start_foo_~i~0#1| 11)} is VALID [2022-02-20 23:44:15,059 INFO L290 TraceCheckUtils]: 226: Hoare triple {12006#(<= |ULTIMATE.start_foo_~i~0#1| 11)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {12006#(<= |ULTIMATE.start_foo_~i~0#1| 11)} is VALID [2022-02-20 23:44:15,059 INFO L290 TraceCheckUtils]: 227: Hoare triple {12006#(<= |ULTIMATE.start_foo_~i~0#1| 11)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {12007#(<= |ULTIMATE.start_foo_~i~0#1| 12)} is VALID [2022-02-20 23:44:15,060 INFO L290 TraceCheckUtils]: 228: Hoare triple {12007#(<= |ULTIMATE.start_foo_~i~0#1| 12)} assume !!(foo_~i~0#1 < 32767); {12007#(<= |ULTIMATE.start_foo_~i~0#1| 12)} is VALID [2022-02-20 23:44:15,060 INFO L290 TraceCheckUtils]: 229: Hoare triple {12007#(<= |ULTIMATE.start_foo_~i~0#1| 12)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {12007#(<= |ULTIMATE.start_foo_~i~0#1| 12)} is VALID [2022-02-20 23:44:15,060 INFO L290 TraceCheckUtils]: 230: Hoare triple {12007#(<= |ULTIMATE.start_foo_~i~0#1| 12)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {12008#(<= |ULTIMATE.start_foo_~i~0#1| 13)} is VALID [2022-02-20 23:44:15,060 INFO L290 TraceCheckUtils]: 231: Hoare triple {12008#(<= |ULTIMATE.start_foo_~i~0#1| 13)} assume !!(foo_~i~0#1 < 32767); {12008#(<= |ULTIMATE.start_foo_~i~0#1| 13)} is VALID [2022-02-20 23:44:15,061 INFO L290 TraceCheckUtils]: 232: Hoare triple {12008#(<= |ULTIMATE.start_foo_~i~0#1| 13)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {12008#(<= |ULTIMATE.start_foo_~i~0#1| 13)} is VALID [2022-02-20 23:44:15,061 INFO L290 TraceCheckUtils]: 233: Hoare triple {12008#(<= |ULTIMATE.start_foo_~i~0#1| 13)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {12009#(<= |ULTIMATE.start_foo_~i~0#1| 14)} is VALID [2022-02-20 23:44:15,061 INFO L290 TraceCheckUtils]: 234: Hoare triple {12009#(<= |ULTIMATE.start_foo_~i~0#1| 14)} assume !!(foo_~i~0#1 < 32767); {12009#(<= |ULTIMATE.start_foo_~i~0#1| 14)} is VALID [2022-02-20 23:44:15,062 INFO L290 TraceCheckUtils]: 235: Hoare triple {12009#(<= |ULTIMATE.start_foo_~i~0#1| 14)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {12009#(<= |ULTIMATE.start_foo_~i~0#1| 14)} is VALID [2022-02-20 23:44:15,062 INFO L290 TraceCheckUtils]: 236: Hoare triple {12009#(<= |ULTIMATE.start_foo_~i~0#1| 14)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {12010#(<= |ULTIMATE.start_foo_~i~0#1| 15)} is VALID [2022-02-20 23:44:15,062 INFO L290 TraceCheckUtils]: 237: Hoare triple {12010#(<= |ULTIMATE.start_foo_~i~0#1| 15)} assume !!(foo_~i~0#1 < 32767); {12010#(<= |ULTIMATE.start_foo_~i~0#1| 15)} is VALID [2022-02-20 23:44:15,062 INFO L290 TraceCheckUtils]: 238: Hoare triple {12010#(<= |ULTIMATE.start_foo_~i~0#1| 15)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {12010#(<= |ULTIMATE.start_foo_~i~0#1| 15)} is VALID [2022-02-20 23:44:15,063 INFO L290 TraceCheckUtils]: 239: Hoare triple {12010#(<= |ULTIMATE.start_foo_~i~0#1| 15)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {12011#(<= |ULTIMATE.start_foo_~i~0#1| 16)} is VALID [2022-02-20 23:44:15,063 INFO L290 TraceCheckUtils]: 240: Hoare triple {12011#(<= |ULTIMATE.start_foo_~i~0#1| 16)} assume !!(foo_~i~0#1 < 32767); {12011#(<= |ULTIMATE.start_foo_~i~0#1| 16)} is VALID [2022-02-20 23:44:15,063 INFO L290 TraceCheckUtils]: 241: Hoare triple {12011#(<= |ULTIMATE.start_foo_~i~0#1| 16)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {12011#(<= |ULTIMATE.start_foo_~i~0#1| 16)} is VALID [2022-02-20 23:44:15,064 INFO L290 TraceCheckUtils]: 242: Hoare triple {12011#(<= |ULTIMATE.start_foo_~i~0#1| 16)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {12012#(<= |ULTIMATE.start_foo_~i~0#1| 17)} is VALID [2022-02-20 23:44:15,064 INFO L290 TraceCheckUtils]: 243: Hoare triple {12012#(<= |ULTIMATE.start_foo_~i~0#1| 17)} assume !!(foo_~i~0#1 < 32767); {12012#(<= |ULTIMATE.start_foo_~i~0#1| 17)} is VALID [2022-02-20 23:44:15,064 INFO L290 TraceCheckUtils]: 244: Hoare triple {12012#(<= |ULTIMATE.start_foo_~i~0#1| 17)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {12012#(<= |ULTIMATE.start_foo_~i~0#1| 17)} is VALID [2022-02-20 23:44:15,064 INFO L290 TraceCheckUtils]: 245: Hoare triple {12012#(<= |ULTIMATE.start_foo_~i~0#1| 17)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {12013#(<= |ULTIMATE.start_foo_~i~0#1| 18)} is VALID [2022-02-20 23:44:15,065 INFO L290 TraceCheckUtils]: 246: Hoare triple {12013#(<= |ULTIMATE.start_foo_~i~0#1| 18)} assume !!(foo_~i~0#1 < 32767); {12013#(<= |ULTIMATE.start_foo_~i~0#1| 18)} is VALID [2022-02-20 23:44:15,065 INFO L290 TraceCheckUtils]: 247: Hoare triple {12013#(<= |ULTIMATE.start_foo_~i~0#1| 18)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {12013#(<= |ULTIMATE.start_foo_~i~0#1| 18)} is VALID [2022-02-20 23:44:15,065 INFO L290 TraceCheckUtils]: 248: Hoare triple {12013#(<= |ULTIMATE.start_foo_~i~0#1| 18)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {12014#(<= |ULTIMATE.start_foo_~i~0#1| 19)} is VALID [2022-02-20 23:44:15,065 INFO L290 TraceCheckUtils]: 249: Hoare triple {12014#(<= |ULTIMATE.start_foo_~i~0#1| 19)} assume !!(foo_~i~0#1 < 32767); {12014#(<= |ULTIMATE.start_foo_~i~0#1| 19)} is VALID [2022-02-20 23:44:15,066 INFO L290 TraceCheckUtils]: 250: Hoare triple {12014#(<= |ULTIMATE.start_foo_~i~0#1| 19)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {12014#(<= |ULTIMATE.start_foo_~i~0#1| 19)} is VALID [2022-02-20 23:44:15,066 INFO L290 TraceCheckUtils]: 251: Hoare triple {12014#(<= |ULTIMATE.start_foo_~i~0#1| 19)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {12015#(<= |ULTIMATE.start_foo_~i~0#1| 20)} is VALID [2022-02-20 23:44:15,066 INFO L290 TraceCheckUtils]: 252: Hoare triple {12015#(<= |ULTIMATE.start_foo_~i~0#1| 20)} assume !!(foo_~i~0#1 < 32767); {12015#(<= |ULTIMATE.start_foo_~i~0#1| 20)} is VALID [2022-02-20 23:44:15,067 INFO L290 TraceCheckUtils]: 253: Hoare triple {12015#(<= |ULTIMATE.start_foo_~i~0#1| 20)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {12015#(<= |ULTIMATE.start_foo_~i~0#1| 20)} is VALID [2022-02-20 23:44:15,067 INFO L290 TraceCheckUtils]: 254: Hoare triple {12015#(<= |ULTIMATE.start_foo_~i~0#1| 20)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {12016#(<= |ULTIMATE.start_foo_~i~0#1| 21)} is VALID [2022-02-20 23:44:15,067 INFO L290 TraceCheckUtils]: 255: Hoare triple {12016#(<= |ULTIMATE.start_foo_~i~0#1| 21)} assume !!(foo_~i~0#1 < 32767); {12016#(<= |ULTIMATE.start_foo_~i~0#1| 21)} is VALID [2022-02-20 23:44:15,067 INFO L290 TraceCheckUtils]: 256: Hoare triple {12016#(<= |ULTIMATE.start_foo_~i~0#1| 21)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {12016#(<= |ULTIMATE.start_foo_~i~0#1| 21)} is VALID [2022-02-20 23:44:15,068 INFO L290 TraceCheckUtils]: 257: Hoare triple {12016#(<= |ULTIMATE.start_foo_~i~0#1| 21)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {12017#(<= |ULTIMATE.start_foo_~i~0#1| 22)} is VALID [2022-02-20 23:44:15,068 INFO L290 TraceCheckUtils]: 258: Hoare triple {12017#(<= |ULTIMATE.start_foo_~i~0#1| 22)} assume !!(foo_~i~0#1 < 32767); {12017#(<= |ULTIMATE.start_foo_~i~0#1| 22)} is VALID [2022-02-20 23:44:15,068 INFO L290 TraceCheckUtils]: 259: Hoare triple {12017#(<= |ULTIMATE.start_foo_~i~0#1| 22)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {12017#(<= |ULTIMATE.start_foo_~i~0#1| 22)} is VALID [2022-02-20 23:44:15,069 INFO L290 TraceCheckUtils]: 260: Hoare triple {12017#(<= |ULTIMATE.start_foo_~i~0#1| 22)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {12018#(<= |ULTIMATE.start_foo_~i~0#1| 23)} is VALID [2022-02-20 23:44:15,069 INFO L290 TraceCheckUtils]: 261: Hoare triple {12018#(<= |ULTIMATE.start_foo_~i~0#1| 23)} assume !!(foo_~i~0#1 < 32767); {12018#(<= |ULTIMATE.start_foo_~i~0#1| 23)} is VALID [2022-02-20 23:44:15,069 INFO L290 TraceCheckUtils]: 262: Hoare triple {12018#(<= |ULTIMATE.start_foo_~i~0#1| 23)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {12018#(<= |ULTIMATE.start_foo_~i~0#1| 23)} is VALID [2022-02-20 23:44:15,069 INFO L290 TraceCheckUtils]: 263: Hoare triple {12018#(<= |ULTIMATE.start_foo_~i~0#1| 23)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {12019#(<= |ULTIMATE.start_foo_~i~0#1| 24)} is VALID [2022-02-20 23:44:15,070 INFO L290 TraceCheckUtils]: 264: Hoare triple {12019#(<= |ULTIMATE.start_foo_~i~0#1| 24)} assume !!(foo_~i~0#1 < 32767); {12019#(<= |ULTIMATE.start_foo_~i~0#1| 24)} is VALID [2022-02-20 23:44:15,070 INFO L290 TraceCheckUtils]: 265: Hoare triple {12019#(<= |ULTIMATE.start_foo_~i~0#1| 24)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {12019#(<= |ULTIMATE.start_foo_~i~0#1| 24)} is VALID [2022-02-20 23:44:15,070 INFO L290 TraceCheckUtils]: 266: Hoare triple {12019#(<= |ULTIMATE.start_foo_~i~0#1| 24)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {12020#(<= |ULTIMATE.start_foo_~i~0#1| 25)} is VALID [2022-02-20 23:44:15,070 INFO L290 TraceCheckUtils]: 267: Hoare triple {12020#(<= |ULTIMATE.start_foo_~i~0#1| 25)} assume !!(foo_~i~0#1 < 32767); {12020#(<= |ULTIMATE.start_foo_~i~0#1| 25)} is VALID [2022-02-20 23:44:15,071 INFO L290 TraceCheckUtils]: 268: Hoare triple {12020#(<= |ULTIMATE.start_foo_~i~0#1| 25)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {12020#(<= |ULTIMATE.start_foo_~i~0#1| 25)} is VALID [2022-02-20 23:44:15,071 INFO L290 TraceCheckUtils]: 269: Hoare triple {12020#(<= |ULTIMATE.start_foo_~i~0#1| 25)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {12021#(<= |ULTIMATE.start_foo_~i~0#1| 26)} is VALID [2022-02-20 23:44:15,071 INFO L290 TraceCheckUtils]: 270: Hoare triple {12021#(<= |ULTIMATE.start_foo_~i~0#1| 26)} assume !!(foo_~i~0#1 < 32767); {12021#(<= |ULTIMATE.start_foo_~i~0#1| 26)} is VALID [2022-02-20 23:44:15,072 INFO L290 TraceCheckUtils]: 271: Hoare triple {12021#(<= |ULTIMATE.start_foo_~i~0#1| 26)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {12021#(<= |ULTIMATE.start_foo_~i~0#1| 26)} is VALID [2022-02-20 23:44:15,072 INFO L290 TraceCheckUtils]: 272: Hoare triple {12021#(<= |ULTIMATE.start_foo_~i~0#1| 26)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {12022#(<= |ULTIMATE.start_foo_~i~0#1| 27)} is VALID [2022-02-20 23:44:15,072 INFO L290 TraceCheckUtils]: 273: Hoare triple {12022#(<= |ULTIMATE.start_foo_~i~0#1| 27)} assume !!(foo_~i~0#1 < 32767); {12022#(<= |ULTIMATE.start_foo_~i~0#1| 27)} is VALID [2022-02-20 23:44:15,072 INFO L290 TraceCheckUtils]: 274: Hoare triple {12022#(<= |ULTIMATE.start_foo_~i~0#1| 27)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {12022#(<= |ULTIMATE.start_foo_~i~0#1| 27)} is VALID [2022-02-20 23:44:15,073 INFO L290 TraceCheckUtils]: 275: Hoare triple {12022#(<= |ULTIMATE.start_foo_~i~0#1| 27)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {12023#(<= |ULTIMATE.start_foo_~i~0#1| 28)} is VALID [2022-02-20 23:44:15,073 INFO L290 TraceCheckUtils]: 276: Hoare triple {12023#(<= |ULTIMATE.start_foo_~i~0#1| 28)} assume !!(foo_~i~0#1 < 32767); {12023#(<= |ULTIMATE.start_foo_~i~0#1| 28)} is VALID [2022-02-20 23:44:15,073 INFO L290 TraceCheckUtils]: 277: Hoare triple {12023#(<= |ULTIMATE.start_foo_~i~0#1| 28)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {12023#(<= |ULTIMATE.start_foo_~i~0#1| 28)} is VALID [2022-02-20 23:44:15,074 INFO L290 TraceCheckUtils]: 278: Hoare triple {12023#(<= |ULTIMATE.start_foo_~i~0#1| 28)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {12024#(<= |ULTIMATE.start_foo_~i~0#1| 29)} is VALID [2022-02-20 23:44:15,074 INFO L290 TraceCheckUtils]: 279: Hoare triple {12024#(<= |ULTIMATE.start_foo_~i~0#1| 29)} assume !!(foo_~i~0#1 < 32767); {12024#(<= |ULTIMATE.start_foo_~i~0#1| 29)} is VALID [2022-02-20 23:44:15,074 INFO L290 TraceCheckUtils]: 280: Hoare triple {12024#(<= |ULTIMATE.start_foo_~i~0#1| 29)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {12024#(<= |ULTIMATE.start_foo_~i~0#1| 29)} is VALID [2022-02-20 23:44:15,074 INFO L290 TraceCheckUtils]: 281: Hoare triple {12024#(<= |ULTIMATE.start_foo_~i~0#1| 29)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {12025#(<= |ULTIMATE.start_foo_~i~0#1| 30)} is VALID [2022-02-20 23:44:15,075 INFO L290 TraceCheckUtils]: 282: Hoare triple {12025#(<= |ULTIMATE.start_foo_~i~0#1| 30)} assume !!(foo_~i~0#1 < 32767); {12025#(<= |ULTIMATE.start_foo_~i~0#1| 30)} is VALID [2022-02-20 23:44:15,075 INFO L290 TraceCheckUtils]: 283: Hoare triple {12025#(<= |ULTIMATE.start_foo_~i~0#1| 30)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {12025#(<= |ULTIMATE.start_foo_~i~0#1| 30)} is VALID [2022-02-20 23:44:15,075 INFO L290 TraceCheckUtils]: 284: Hoare triple {12025#(<= |ULTIMATE.start_foo_~i~0#1| 30)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {12026#(<= |ULTIMATE.start_foo_~i~0#1| 31)} is VALID [2022-02-20 23:44:15,076 INFO L290 TraceCheckUtils]: 285: Hoare triple {12026#(<= |ULTIMATE.start_foo_~i~0#1| 31)} assume !(foo_~i~0#1 < 32767); {11994#false} is VALID [2022-02-20 23:44:15,076 INFO L290 TraceCheckUtils]: 286: Hoare triple {11994#false} assume { :end_inline_foo } true; {11994#false} is VALID [2022-02-20 23:44:15,076 INFO L290 TraceCheckUtils]: 287: Hoare triple {11994#false} SUMMARY for call main_#t~mem8#1 := read~int(~b~0.base, -4 + ~b~0.offset, 4); srcloc: L540 {11994#false} is VALID [2022-02-20 23:44:15,076 INFO L290 TraceCheckUtils]: 288: Hoare triple {11994#false} assume 0 != main_#t~mem8#1;havoc main_#t~mem8#1; {11994#false} is VALID [2022-02-20 23:44:15,076 INFO L290 TraceCheckUtils]: 289: Hoare triple {11994#false} assume 0 == ~a~0.offset; {11994#false} is VALID [2022-02-20 23:44:15,076 INFO L290 TraceCheckUtils]: 290: Hoare triple {11994#false} assume ~a~0.base < #StackHeapBarrier; {11994#false} is VALID [2022-02-20 23:44:15,076 INFO L290 TraceCheckUtils]: 291: Hoare triple {11994#false} assume 0 == ~a~0.base || 1 == #valid[~a~0.base];call ULTIMATE.dealloc(~a~0.base, ~a~0.offset); {11994#false} is VALID [2022-02-20 23:44:15,076 INFO L290 TraceCheckUtils]: 292: Hoare triple {11994#false} assume !(0 == ~b~0.offset); {11994#false} is VALID [2022-02-20 23:44:15,078 INFO L134 CoverageAnalysis]: Checked inductivity of 7161 backedges. 0 proven. 1426 refuted. 0 times theorem prover too weak. 5735 trivial. 0 not checked. [2022-02-20 23:44:15,079 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:44:15,079 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191595379] [2022-02-20 23:44:15,079 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191595379] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:44:15,079 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440019057] [2022-02-20 23:44:15,079 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 23:44:15,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:44:15,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:44:15,080 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:44:15,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-02-20 23:44:15,368 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 23:44:15,369 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 23:44:15,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 1115 conjuncts, 65 conjunts are in the unsatisfiable core [2022-02-20 23:44:15,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:15,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:44:18,574 INFO L290 TraceCheckUtils]: 0: Hoare triple {11993#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);~a~0.base, ~a~0.offset := 0, 0;~b~0.base, ~b~0.offset := 0, 0;~n~0 := 0; {11993#true} is VALID [2022-02-20 23:44:18,577 INFO L290 TraceCheckUtils]: 1: Hoare triple {11993#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~post7#1.base, main_#t~post7#1.offset, main_#t~mem8#1;~n~0 := 32768;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~a~0.base, ~a~0.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~b~0.base, ~b~0.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_#t~post7#1.base, main_#t~post7#1.offset := ~b~0.base, ~b~0.offset;~b~0.base, ~b~0.offset := main_#t~post7#1.base, 4 + main_#t~post7#1.offset; {12033#(<= 32768 ~n~0)} is VALID [2022-02-20 23:44:18,577 INFO L290 TraceCheckUtils]: 2: Hoare triple {12033#(<= 32768 ~n~0)} SUMMARY for call write~int(0, main_#t~post7#1.base, main_#t~post7#1.offset, 4); srcloc: L538 {12033#(<= 32768 ~n~0)} is VALID [2022-02-20 23:44:18,577 INFO L290 TraceCheckUtils]: 3: Hoare triple {12033#(<= 32768 ~n~0)} havoc main_#t~post7#1.base, main_#t~post7#1.offset;assume { :begin_inline_foo } true;havoc foo_#t~post3#1, foo_#t~post4#1, foo_~i~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {12040#(and (<= |ULTIMATE.start_foo_~i~0#1| 0) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,578 INFO L290 TraceCheckUtils]: 4: Hoare triple {12040#(and (<= |ULTIMATE.start_foo_~i~0#1| 0) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {12040#(and (<= |ULTIMATE.start_foo_~i~0#1| 0) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,578 INFO L290 TraceCheckUtils]: 5: Hoare triple {12040#(and (<= |ULTIMATE.start_foo_~i~0#1| 0) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {12040#(and (<= |ULTIMATE.start_foo_~i~0#1| 0) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,579 INFO L290 TraceCheckUtils]: 6: Hoare triple {12040#(and (<= |ULTIMATE.start_foo_~i~0#1| 0) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {12050#(and (<= |ULTIMATE.start_foo_~i~0#1| 1) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,579 INFO L290 TraceCheckUtils]: 7: Hoare triple {12050#(and (<= |ULTIMATE.start_foo_~i~0#1| 1) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {12050#(and (<= |ULTIMATE.start_foo_~i~0#1| 1) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,579 INFO L290 TraceCheckUtils]: 8: Hoare triple {12050#(and (<= |ULTIMATE.start_foo_~i~0#1| 1) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {12050#(and (<= |ULTIMATE.start_foo_~i~0#1| 1) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,580 INFO L290 TraceCheckUtils]: 9: Hoare triple {12050#(and (<= |ULTIMATE.start_foo_~i~0#1| 1) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {12060#(and (<= |ULTIMATE.start_foo_~i~0#1| 2) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,580 INFO L290 TraceCheckUtils]: 10: Hoare triple {12060#(and (<= |ULTIMATE.start_foo_~i~0#1| 2) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {12060#(and (<= |ULTIMATE.start_foo_~i~0#1| 2) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,580 INFO L290 TraceCheckUtils]: 11: Hoare triple {12060#(and (<= |ULTIMATE.start_foo_~i~0#1| 2) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {12060#(and (<= |ULTIMATE.start_foo_~i~0#1| 2) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,581 INFO L290 TraceCheckUtils]: 12: Hoare triple {12060#(and (<= |ULTIMATE.start_foo_~i~0#1| 2) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {12070#(and (<= |ULTIMATE.start_foo_~i~0#1| 3) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,581 INFO L290 TraceCheckUtils]: 13: Hoare triple {12070#(and (<= |ULTIMATE.start_foo_~i~0#1| 3) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {12070#(and (<= |ULTIMATE.start_foo_~i~0#1| 3) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,582 INFO L290 TraceCheckUtils]: 14: Hoare triple {12070#(and (<= |ULTIMATE.start_foo_~i~0#1| 3) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {12070#(and (<= |ULTIMATE.start_foo_~i~0#1| 3) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,583 INFO L290 TraceCheckUtils]: 15: Hoare triple {12070#(and (<= |ULTIMATE.start_foo_~i~0#1| 3) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {12080#(and (<= |ULTIMATE.start_foo_~i~0#1| 4) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,584 INFO L290 TraceCheckUtils]: 16: Hoare triple {12080#(and (<= |ULTIMATE.start_foo_~i~0#1| 4) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {12080#(and (<= |ULTIMATE.start_foo_~i~0#1| 4) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,584 INFO L290 TraceCheckUtils]: 17: Hoare triple {12080#(and (<= |ULTIMATE.start_foo_~i~0#1| 4) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {12080#(and (<= |ULTIMATE.start_foo_~i~0#1| 4) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,584 INFO L290 TraceCheckUtils]: 18: Hoare triple {12080#(and (<= |ULTIMATE.start_foo_~i~0#1| 4) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {12090#(and (<= |ULTIMATE.start_foo_~i~0#1| 5) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,585 INFO L290 TraceCheckUtils]: 19: Hoare triple {12090#(and (<= |ULTIMATE.start_foo_~i~0#1| 5) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {12090#(and (<= |ULTIMATE.start_foo_~i~0#1| 5) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,585 INFO L290 TraceCheckUtils]: 20: Hoare triple {12090#(and (<= |ULTIMATE.start_foo_~i~0#1| 5) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {12090#(and (<= |ULTIMATE.start_foo_~i~0#1| 5) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,586 INFO L290 TraceCheckUtils]: 21: Hoare triple {12090#(and (<= |ULTIMATE.start_foo_~i~0#1| 5) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {12100#(and (<= |ULTIMATE.start_foo_~i~0#1| 6) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,586 INFO L290 TraceCheckUtils]: 22: Hoare triple {12100#(and (<= |ULTIMATE.start_foo_~i~0#1| 6) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {12100#(and (<= |ULTIMATE.start_foo_~i~0#1| 6) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,587 INFO L290 TraceCheckUtils]: 23: Hoare triple {12100#(and (<= |ULTIMATE.start_foo_~i~0#1| 6) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {12100#(and (<= |ULTIMATE.start_foo_~i~0#1| 6) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,587 INFO L290 TraceCheckUtils]: 24: Hoare triple {12100#(and (<= |ULTIMATE.start_foo_~i~0#1| 6) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {12110#(and (<= |ULTIMATE.start_foo_~i~0#1| 7) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,587 INFO L290 TraceCheckUtils]: 25: Hoare triple {12110#(and (<= |ULTIMATE.start_foo_~i~0#1| 7) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {12110#(and (<= |ULTIMATE.start_foo_~i~0#1| 7) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,588 INFO L290 TraceCheckUtils]: 26: Hoare triple {12110#(and (<= |ULTIMATE.start_foo_~i~0#1| 7) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {12110#(and (<= |ULTIMATE.start_foo_~i~0#1| 7) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,588 INFO L290 TraceCheckUtils]: 27: Hoare triple {12110#(and (<= |ULTIMATE.start_foo_~i~0#1| 7) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {12120#(and (<= |ULTIMATE.start_foo_~i~0#1| 8) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,589 INFO L290 TraceCheckUtils]: 28: Hoare triple {12120#(and (<= |ULTIMATE.start_foo_~i~0#1| 8) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {12120#(and (<= |ULTIMATE.start_foo_~i~0#1| 8) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,589 INFO L290 TraceCheckUtils]: 29: Hoare triple {12120#(and (<= |ULTIMATE.start_foo_~i~0#1| 8) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {12120#(and (<= |ULTIMATE.start_foo_~i~0#1| 8) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,589 INFO L290 TraceCheckUtils]: 30: Hoare triple {12120#(and (<= |ULTIMATE.start_foo_~i~0#1| 8) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {12130#(and (<= |ULTIMATE.start_foo_~i~0#1| 9) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,590 INFO L290 TraceCheckUtils]: 31: Hoare triple {12130#(and (<= |ULTIMATE.start_foo_~i~0#1| 9) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {12130#(and (<= |ULTIMATE.start_foo_~i~0#1| 9) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,590 INFO L290 TraceCheckUtils]: 32: Hoare triple {12130#(and (<= |ULTIMATE.start_foo_~i~0#1| 9) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {12130#(and (<= |ULTIMATE.start_foo_~i~0#1| 9) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,590 INFO L290 TraceCheckUtils]: 33: Hoare triple {12130#(and (<= |ULTIMATE.start_foo_~i~0#1| 9) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {12140#(and (<= 32768 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 10))} is VALID [2022-02-20 23:44:18,591 INFO L290 TraceCheckUtils]: 34: Hoare triple {12140#(and (<= 32768 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 10))} assume !!(foo_~i~0#1 < ~n~0); {12140#(and (<= 32768 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 10))} is VALID [2022-02-20 23:44:18,591 INFO L290 TraceCheckUtils]: 35: Hoare triple {12140#(and (<= 32768 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 10))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {12140#(and (<= 32768 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 10))} is VALID [2022-02-20 23:44:18,592 INFO L290 TraceCheckUtils]: 36: Hoare triple {12140#(and (<= 32768 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 10))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {12150#(and (<= |ULTIMATE.start_foo_~i~0#1| 11) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,592 INFO L290 TraceCheckUtils]: 37: Hoare triple {12150#(and (<= |ULTIMATE.start_foo_~i~0#1| 11) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {12150#(and (<= |ULTIMATE.start_foo_~i~0#1| 11) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,592 INFO L290 TraceCheckUtils]: 38: Hoare triple {12150#(and (<= |ULTIMATE.start_foo_~i~0#1| 11) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {12150#(and (<= |ULTIMATE.start_foo_~i~0#1| 11) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,593 INFO L290 TraceCheckUtils]: 39: Hoare triple {12150#(and (<= |ULTIMATE.start_foo_~i~0#1| 11) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {12160#(and (<= |ULTIMATE.start_foo_~i~0#1| 12) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,593 INFO L290 TraceCheckUtils]: 40: Hoare triple {12160#(and (<= |ULTIMATE.start_foo_~i~0#1| 12) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {12160#(and (<= |ULTIMATE.start_foo_~i~0#1| 12) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,593 INFO L290 TraceCheckUtils]: 41: Hoare triple {12160#(and (<= |ULTIMATE.start_foo_~i~0#1| 12) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {12160#(and (<= |ULTIMATE.start_foo_~i~0#1| 12) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,594 INFO L290 TraceCheckUtils]: 42: Hoare triple {12160#(and (<= |ULTIMATE.start_foo_~i~0#1| 12) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {12170#(and (<= |ULTIMATE.start_foo_~i~0#1| 13) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,594 INFO L290 TraceCheckUtils]: 43: Hoare triple {12170#(and (<= |ULTIMATE.start_foo_~i~0#1| 13) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {12170#(and (<= |ULTIMATE.start_foo_~i~0#1| 13) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,594 INFO L290 TraceCheckUtils]: 44: Hoare triple {12170#(and (<= |ULTIMATE.start_foo_~i~0#1| 13) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {12170#(and (<= |ULTIMATE.start_foo_~i~0#1| 13) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,595 INFO L290 TraceCheckUtils]: 45: Hoare triple {12170#(and (<= |ULTIMATE.start_foo_~i~0#1| 13) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {12180#(and (<= |ULTIMATE.start_foo_~i~0#1| 14) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,595 INFO L290 TraceCheckUtils]: 46: Hoare triple {12180#(and (<= |ULTIMATE.start_foo_~i~0#1| 14) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {12180#(and (<= |ULTIMATE.start_foo_~i~0#1| 14) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,596 INFO L290 TraceCheckUtils]: 47: Hoare triple {12180#(and (<= |ULTIMATE.start_foo_~i~0#1| 14) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {12180#(and (<= |ULTIMATE.start_foo_~i~0#1| 14) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,596 INFO L290 TraceCheckUtils]: 48: Hoare triple {12180#(and (<= |ULTIMATE.start_foo_~i~0#1| 14) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {12190#(and (<= |ULTIMATE.start_foo_~i~0#1| 15) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,596 INFO L290 TraceCheckUtils]: 49: Hoare triple {12190#(and (<= |ULTIMATE.start_foo_~i~0#1| 15) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {12190#(and (<= |ULTIMATE.start_foo_~i~0#1| 15) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,597 INFO L290 TraceCheckUtils]: 50: Hoare triple {12190#(and (<= |ULTIMATE.start_foo_~i~0#1| 15) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {12190#(and (<= |ULTIMATE.start_foo_~i~0#1| 15) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,597 INFO L290 TraceCheckUtils]: 51: Hoare triple {12190#(and (<= |ULTIMATE.start_foo_~i~0#1| 15) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {12200#(and (<= 32768 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 16))} is VALID [2022-02-20 23:44:18,597 INFO L290 TraceCheckUtils]: 52: Hoare triple {12200#(and (<= 32768 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 16))} assume !!(foo_~i~0#1 < ~n~0); {12200#(and (<= 32768 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 16))} is VALID [2022-02-20 23:44:18,598 INFO L290 TraceCheckUtils]: 53: Hoare triple {12200#(and (<= 32768 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 16))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {12200#(and (<= 32768 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 16))} is VALID [2022-02-20 23:44:18,598 INFO L290 TraceCheckUtils]: 54: Hoare triple {12200#(and (<= 32768 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 16))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {12210#(and (<= 32768 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 17))} is VALID [2022-02-20 23:44:18,598 INFO L290 TraceCheckUtils]: 55: Hoare triple {12210#(and (<= 32768 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 17))} assume !!(foo_~i~0#1 < ~n~0); {12210#(and (<= 32768 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 17))} is VALID [2022-02-20 23:44:18,599 INFO L290 TraceCheckUtils]: 56: Hoare triple {12210#(and (<= 32768 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 17))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {12210#(and (<= 32768 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 17))} is VALID [2022-02-20 23:44:18,599 INFO L290 TraceCheckUtils]: 57: Hoare triple {12210#(and (<= 32768 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 17))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {12220#(and (<= |ULTIMATE.start_foo_~i~0#1| 18) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,600 INFO L290 TraceCheckUtils]: 58: Hoare triple {12220#(and (<= |ULTIMATE.start_foo_~i~0#1| 18) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {12220#(and (<= |ULTIMATE.start_foo_~i~0#1| 18) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,600 INFO L290 TraceCheckUtils]: 59: Hoare triple {12220#(and (<= |ULTIMATE.start_foo_~i~0#1| 18) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {12220#(and (<= |ULTIMATE.start_foo_~i~0#1| 18) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,600 INFO L290 TraceCheckUtils]: 60: Hoare triple {12220#(and (<= |ULTIMATE.start_foo_~i~0#1| 18) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {12230#(and (<= |ULTIMATE.start_foo_~i~0#1| 19) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,601 INFO L290 TraceCheckUtils]: 61: Hoare triple {12230#(and (<= |ULTIMATE.start_foo_~i~0#1| 19) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {12230#(and (<= |ULTIMATE.start_foo_~i~0#1| 19) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,601 INFO L290 TraceCheckUtils]: 62: Hoare triple {12230#(and (<= |ULTIMATE.start_foo_~i~0#1| 19) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {12230#(and (<= |ULTIMATE.start_foo_~i~0#1| 19) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,601 INFO L290 TraceCheckUtils]: 63: Hoare triple {12230#(and (<= |ULTIMATE.start_foo_~i~0#1| 19) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {12240#(and (<= |ULTIMATE.start_foo_~i~0#1| 20) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,602 INFO L290 TraceCheckUtils]: 64: Hoare triple {12240#(and (<= |ULTIMATE.start_foo_~i~0#1| 20) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {12240#(and (<= |ULTIMATE.start_foo_~i~0#1| 20) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,602 INFO L290 TraceCheckUtils]: 65: Hoare triple {12240#(and (<= |ULTIMATE.start_foo_~i~0#1| 20) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {12240#(and (<= |ULTIMATE.start_foo_~i~0#1| 20) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,602 INFO L290 TraceCheckUtils]: 66: Hoare triple {12240#(and (<= |ULTIMATE.start_foo_~i~0#1| 20) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {12250#(and (<= |ULTIMATE.start_foo_~i~0#1| 21) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,603 INFO L290 TraceCheckUtils]: 67: Hoare triple {12250#(and (<= |ULTIMATE.start_foo_~i~0#1| 21) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {12250#(and (<= |ULTIMATE.start_foo_~i~0#1| 21) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,603 INFO L290 TraceCheckUtils]: 68: Hoare triple {12250#(and (<= |ULTIMATE.start_foo_~i~0#1| 21) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {12250#(and (<= |ULTIMATE.start_foo_~i~0#1| 21) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,604 INFO L290 TraceCheckUtils]: 69: Hoare triple {12250#(and (<= |ULTIMATE.start_foo_~i~0#1| 21) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {12260#(and (<= 32768 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 22))} is VALID [2022-02-20 23:44:18,604 INFO L290 TraceCheckUtils]: 70: Hoare triple {12260#(and (<= 32768 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 22))} assume !!(foo_~i~0#1 < ~n~0); {12260#(and (<= 32768 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 22))} is VALID [2022-02-20 23:44:18,604 INFO L290 TraceCheckUtils]: 71: Hoare triple {12260#(and (<= 32768 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 22))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {12260#(and (<= 32768 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 22))} is VALID [2022-02-20 23:44:18,608 INFO L290 TraceCheckUtils]: 72: Hoare triple {12260#(and (<= 32768 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 22))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {12270#(and (<= |ULTIMATE.start_foo_~i~0#1| 23) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,609 INFO L290 TraceCheckUtils]: 73: Hoare triple {12270#(and (<= |ULTIMATE.start_foo_~i~0#1| 23) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {12270#(and (<= |ULTIMATE.start_foo_~i~0#1| 23) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,609 INFO L290 TraceCheckUtils]: 74: Hoare triple {12270#(and (<= |ULTIMATE.start_foo_~i~0#1| 23) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {12270#(and (<= |ULTIMATE.start_foo_~i~0#1| 23) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,609 INFO L290 TraceCheckUtils]: 75: Hoare triple {12270#(and (<= |ULTIMATE.start_foo_~i~0#1| 23) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {12280#(and (<= |ULTIMATE.start_foo_~i~0#1| 24) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,610 INFO L290 TraceCheckUtils]: 76: Hoare triple {12280#(and (<= |ULTIMATE.start_foo_~i~0#1| 24) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {12280#(and (<= |ULTIMATE.start_foo_~i~0#1| 24) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,610 INFO L290 TraceCheckUtils]: 77: Hoare triple {12280#(and (<= |ULTIMATE.start_foo_~i~0#1| 24) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {12280#(and (<= |ULTIMATE.start_foo_~i~0#1| 24) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,610 INFO L290 TraceCheckUtils]: 78: Hoare triple {12280#(and (<= |ULTIMATE.start_foo_~i~0#1| 24) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {12290#(and (<= |ULTIMATE.start_foo_~i~0#1| 25) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,611 INFO L290 TraceCheckUtils]: 79: Hoare triple {12290#(and (<= |ULTIMATE.start_foo_~i~0#1| 25) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {12290#(and (<= |ULTIMATE.start_foo_~i~0#1| 25) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,611 INFO L290 TraceCheckUtils]: 80: Hoare triple {12290#(and (<= |ULTIMATE.start_foo_~i~0#1| 25) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {12290#(and (<= |ULTIMATE.start_foo_~i~0#1| 25) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,612 INFO L290 TraceCheckUtils]: 81: Hoare triple {12290#(and (<= |ULTIMATE.start_foo_~i~0#1| 25) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {12300#(and (<= |ULTIMATE.start_foo_~i~0#1| 26) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,612 INFO L290 TraceCheckUtils]: 82: Hoare triple {12300#(and (<= |ULTIMATE.start_foo_~i~0#1| 26) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {12300#(and (<= |ULTIMATE.start_foo_~i~0#1| 26) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,612 INFO L290 TraceCheckUtils]: 83: Hoare triple {12300#(and (<= |ULTIMATE.start_foo_~i~0#1| 26) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {12300#(and (<= |ULTIMATE.start_foo_~i~0#1| 26) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,613 INFO L290 TraceCheckUtils]: 84: Hoare triple {12300#(and (<= |ULTIMATE.start_foo_~i~0#1| 26) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {12310#(and (<= |ULTIMATE.start_foo_~i~0#1| 27) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,613 INFO L290 TraceCheckUtils]: 85: Hoare triple {12310#(and (<= |ULTIMATE.start_foo_~i~0#1| 27) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {12310#(and (<= |ULTIMATE.start_foo_~i~0#1| 27) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,613 INFO L290 TraceCheckUtils]: 86: Hoare triple {12310#(and (<= |ULTIMATE.start_foo_~i~0#1| 27) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {12310#(and (<= |ULTIMATE.start_foo_~i~0#1| 27) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,614 INFO L290 TraceCheckUtils]: 87: Hoare triple {12310#(and (<= |ULTIMATE.start_foo_~i~0#1| 27) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {12320#(and (<= |ULTIMATE.start_foo_~i~0#1| 28) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,614 INFO L290 TraceCheckUtils]: 88: Hoare triple {12320#(and (<= |ULTIMATE.start_foo_~i~0#1| 28) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {12320#(and (<= |ULTIMATE.start_foo_~i~0#1| 28) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,614 INFO L290 TraceCheckUtils]: 89: Hoare triple {12320#(and (<= |ULTIMATE.start_foo_~i~0#1| 28) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {12320#(and (<= |ULTIMATE.start_foo_~i~0#1| 28) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,615 INFO L290 TraceCheckUtils]: 90: Hoare triple {12320#(and (<= |ULTIMATE.start_foo_~i~0#1| 28) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {12330#(and (<= |ULTIMATE.start_foo_~i~0#1| 29) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,615 INFO L290 TraceCheckUtils]: 91: Hoare triple {12330#(and (<= |ULTIMATE.start_foo_~i~0#1| 29) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {12330#(and (<= |ULTIMATE.start_foo_~i~0#1| 29) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,616 INFO L290 TraceCheckUtils]: 92: Hoare triple {12330#(and (<= |ULTIMATE.start_foo_~i~0#1| 29) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {12330#(and (<= |ULTIMATE.start_foo_~i~0#1| 29) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,616 INFO L290 TraceCheckUtils]: 93: Hoare triple {12330#(and (<= |ULTIMATE.start_foo_~i~0#1| 29) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {12340#(and (<= |ULTIMATE.start_foo_~i~0#1| 30) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,619 INFO L290 TraceCheckUtils]: 94: Hoare triple {12340#(and (<= |ULTIMATE.start_foo_~i~0#1| 30) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {12340#(and (<= |ULTIMATE.start_foo_~i~0#1| 30) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,620 INFO L290 TraceCheckUtils]: 95: Hoare triple {12340#(and (<= |ULTIMATE.start_foo_~i~0#1| 30) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {12340#(and (<= |ULTIMATE.start_foo_~i~0#1| 30) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,620 INFO L290 TraceCheckUtils]: 96: Hoare triple {12340#(and (<= |ULTIMATE.start_foo_~i~0#1| 30) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {12350#(and (<= |ULTIMATE.start_foo_~i~0#1| 31) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,620 INFO L290 TraceCheckUtils]: 97: Hoare triple {12350#(and (<= |ULTIMATE.start_foo_~i~0#1| 31) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {12350#(and (<= |ULTIMATE.start_foo_~i~0#1| 31) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,621 INFO L290 TraceCheckUtils]: 98: Hoare triple {12350#(and (<= |ULTIMATE.start_foo_~i~0#1| 31) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {12350#(and (<= |ULTIMATE.start_foo_~i~0#1| 31) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,621 INFO L290 TraceCheckUtils]: 99: Hoare triple {12350#(and (<= |ULTIMATE.start_foo_~i~0#1| 31) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {12360#(and (<= 32768 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 32))} is VALID [2022-02-20 23:44:18,622 INFO L290 TraceCheckUtils]: 100: Hoare triple {12360#(and (<= 32768 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 32))} assume !!(foo_~i~0#1 < ~n~0); {12360#(and (<= 32768 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 32))} is VALID [2022-02-20 23:44:18,622 INFO L290 TraceCheckUtils]: 101: Hoare triple {12360#(and (<= 32768 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 32))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {12360#(and (<= 32768 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 32))} is VALID [2022-02-20 23:44:18,622 INFO L290 TraceCheckUtils]: 102: Hoare triple {12360#(and (<= 32768 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 32))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {12370#(and (<= |ULTIMATE.start_foo_~i~0#1| 33) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,623 INFO L290 TraceCheckUtils]: 103: Hoare triple {12370#(and (<= |ULTIMATE.start_foo_~i~0#1| 33) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {12370#(and (<= |ULTIMATE.start_foo_~i~0#1| 33) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,623 INFO L290 TraceCheckUtils]: 104: Hoare triple {12370#(and (<= |ULTIMATE.start_foo_~i~0#1| 33) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {12370#(and (<= |ULTIMATE.start_foo_~i~0#1| 33) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,624 INFO L290 TraceCheckUtils]: 105: Hoare triple {12370#(and (<= |ULTIMATE.start_foo_~i~0#1| 33) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {12380#(and (<= |ULTIMATE.start_foo_~i~0#1| 34) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,624 INFO L290 TraceCheckUtils]: 106: Hoare triple {12380#(and (<= |ULTIMATE.start_foo_~i~0#1| 34) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {12380#(and (<= |ULTIMATE.start_foo_~i~0#1| 34) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,625 INFO L290 TraceCheckUtils]: 107: Hoare triple {12380#(and (<= |ULTIMATE.start_foo_~i~0#1| 34) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {12380#(and (<= |ULTIMATE.start_foo_~i~0#1| 34) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,625 INFO L290 TraceCheckUtils]: 108: Hoare triple {12380#(and (<= |ULTIMATE.start_foo_~i~0#1| 34) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {12390#(and (<= 32768 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 35))} is VALID [2022-02-20 23:44:18,625 INFO L290 TraceCheckUtils]: 109: Hoare triple {12390#(and (<= 32768 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 35))} assume !!(foo_~i~0#1 < ~n~0); {12390#(and (<= 32768 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 35))} is VALID [2022-02-20 23:44:18,626 INFO L290 TraceCheckUtils]: 110: Hoare triple {12390#(and (<= 32768 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 35))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {12390#(and (<= 32768 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 35))} is VALID [2022-02-20 23:44:18,626 INFO L290 TraceCheckUtils]: 111: Hoare triple {12390#(and (<= 32768 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 35))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {12400#(and (<= |ULTIMATE.start_foo_~i~0#1| 36) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,627 INFO L290 TraceCheckUtils]: 112: Hoare triple {12400#(and (<= |ULTIMATE.start_foo_~i~0#1| 36) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {12400#(and (<= |ULTIMATE.start_foo_~i~0#1| 36) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,627 INFO L290 TraceCheckUtils]: 113: Hoare triple {12400#(and (<= |ULTIMATE.start_foo_~i~0#1| 36) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {12400#(and (<= |ULTIMATE.start_foo_~i~0#1| 36) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,627 INFO L290 TraceCheckUtils]: 114: Hoare triple {12400#(and (<= |ULTIMATE.start_foo_~i~0#1| 36) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {12410#(and (<= |ULTIMATE.start_foo_~i~0#1| 37) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,628 INFO L290 TraceCheckUtils]: 115: Hoare triple {12410#(and (<= |ULTIMATE.start_foo_~i~0#1| 37) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {12410#(and (<= |ULTIMATE.start_foo_~i~0#1| 37) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,628 INFO L290 TraceCheckUtils]: 116: Hoare triple {12410#(and (<= |ULTIMATE.start_foo_~i~0#1| 37) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {12410#(and (<= |ULTIMATE.start_foo_~i~0#1| 37) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,629 INFO L290 TraceCheckUtils]: 117: Hoare triple {12410#(and (<= |ULTIMATE.start_foo_~i~0#1| 37) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {12420#(and (<= |ULTIMATE.start_foo_~i~0#1| 38) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,629 INFO L290 TraceCheckUtils]: 118: Hoare triple {12420#(and (<= |ULTIMATE.start_foo_~i~0#1| 38) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {12420#(and (<= |ULTIMATE.start_foo_~i~0#1| 38) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,630 INFO L290 TraceCheckUtils]: 119: Hoare triple {12420#(and (<= |ULTIMATE.start_foo_~i~0#1| 38) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {12420#(and (<= |ULTIMATE.start_foo_~i~0#1| 38) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,630 INFO L290 TraceCheckUtils]: 120: Hoare triple {12420#(and (<= |ULTIMATE.start_foo_~i~0#1| 38) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {12430#(and (<= |ULTIMATE.start_foo_~i~0#1| 39) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,630 INFO L290 TraceCheckUtils]: 121: Hoare triple {12430#(and (<= |ULTIMATE.start_foo_~i~0#1| 39) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {12430#(and (<= |ULTIMATE.start_foo_~i~0#1| 39) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,631 INFO L290 TraceCheckUtils]: 122: Hoare triple {12430#(and (<= |ULTIMATE.start_foo_~i~0#1| 39) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {12430#(and (<= |ULTIMATE.start_foo_~i~0#1| 39) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,631 INFO L290 TraceCheckUtils]: 123: Hoare triple {12430#(and (<= |ULTIMATE.start_foo_~i~0#1| 39) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {12440#(and (<= |ULTIMATE.start_foo_~i~0#1| 40) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,631 INFO L290 TraceCheckUtils]: 124: Hoare triple {12440#(and (<= |ULTIMATE.start_foo_~i~0#1| 40) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {12440#(and (<= |ULTIMATE.start_foo_~i~0#1| 40) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,632 INFO L290 TraceCheckUtils]: 125: Hoare triple {12440#(and (<= |ULTIMATE.start_foo_~i~0#1| 40) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {12440#(and (<= |ULTIMATE.start_foo_~i~0#1| 40) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,632 INFO L290 TraceCheckUtils]: 126: Hoare triple {12440#(and (<= |ULTIMATE.start_foo_~i~0#1| 40) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {12450#(and (<= |ULTIMATE.start_foo_~i~0#1| 41) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,632 INFO L290 TraceCheckUtils]: 127: Hoare triple {12450#(and (<= |ULTIMATE.start_foo_~i~0#1| 41) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {12450#(and (<= |ULTIMATE.start_foo_~i~0#1| 41) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,633 INFO L290 TraceCheckUtils]: 128: Hoare triple {12450#(and (<= |ULTIMATE.start_foo_~i~0#1| 41) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {12450#(and (<= |ULTIMATE.start_foo_~i~0#1| 41) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,633 INFO L290 TraceCheckUtils]: 129: Hoare triple {12450#(and (<= |ULTIMATE.start_foo_~i~0#1| 41) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {12460#(and (<= |ULTIMATE.start_foo_~i~0#1| 42) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,633 INFO L290 TraceCheckUtils]: 130: Hoare triple {12460#(and (<= |ULTIMATE.start_foo_~i~0#1| 42) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {12460#(and (<= |ULTIMATE.start_foo_~i~0#1| 42) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,634 INFO L290 TraceCheckUtils]: 131: Hoare triple {12460#(and (<= |ULTIMATE.start_foo_~i~0#1| 42) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {12460#(and (<= |ULTIMATE.start_foo_~i~0#1| 42) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,634 INFO L290 TraceCheckUtils]: 132: Hoare triple {12460#(and (<= |ULTIMATE.start_foo_~i~0#1| 42) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {12470#(and (<= |ULTIMATE.start_foo_~i~0#1| 43) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,635 INFO L290 TraceCheckUtils]: 133: Hoare triple {12470#(and (<= |ULTIMATE.start_foo_~i~0#1| 43) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {12470#(and (<= |ULTIMATE.start_foo_~i~0#1| 43) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,635 INFO L290 TraceCheckUtils]: 134: Hoare triple {12470#(and (<= |ULTIMATE.start_foo_~i~0#1| 43) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {12470#(and (<= |ULTIMATE.start_foo_~i~0#1| 43) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,635 INFO L290 TraceCheckUtils]: 135: Hoare triple {12470#(and (<= |ULTIMATE.start_foo_~i~0#1| 43) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {12480#(and (<= |ULTIMATE.start_foo_~i~0#1| 44) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,636 INFO L290 TraceCheckUtils]: 136: Hoare triple {12480#(and (<= |ULTIMATE.start_foo_~i~0#1| 44) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {12480#(and (<= |ULTIMATE.start_foo_~i~0#1| 44) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,636 INFO L290 TraceCheckUtils]: 137: Hoare triple {12480#(and (<= |ULTIMATE.start_foo_~i~0#1| 44) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {12480#(and (<= |ULTIMATE.start_foo_~i~0#1| 44) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,636 INFO L290 TraceCheckUtils]: 138: Hoare triple {12480#(and (<= |ULTIMATE.start_foo_~i~0#1| 44) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {12490#(and (<= |ULTIMATE.start_foo_~i~0#1| 45) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,637 INFO L290 TraceCheckUtils]: 139: Hoare triple {12490#(and (<= |ULTIMATE.start_foo_~i~0#1| 45) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {12490#(and (<= |ULTIMATE.start_foo_~i~0#1| 45) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,637 INFO L290 TraceCheckUtils]: 140: Hoare triple {12490#(and (<= |ULTIMATE.start_foo_~i~0#1| 45) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {12490#(and (<= |ULTIMATE.start_foo_~i~0#1| 45) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,637 INFO L290 TraceCheckUtils]: 141: Hoare triple {12490#(and (<= |ULTIMATE.start_foo_~i~0#1| 45) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {12500#(and (<= |ULTIMATE.start_foo_~i~0#1| 46) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,638 INFO L290 TraceCheckUtils]: 142: Hoare triple {12500#(and (<= |ULTIMATE.start_foo_~i~0#1| 46) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {12500#(and (<= |ULTIMATE.start_foo_~i~0#1| 46) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,638 INFO L290 TraceCheckUtils]: 143: Hoare triple {12500#(and (<= |ULTIMATE.start_foo_~i~0#1| 46) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {12500#(and (<= |ULTIMATE.start_foo_~i~0#1| 46) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,639 INFO L290 TraceCheckUtils]: 144: Hoare triple {12500#(and (<= |ULTIMATE.start_foo_~i~0#1| 46) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {12510#(and (<= |ULTIMATE.start_foo_~i~0#1| 47) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,639 INFO L290 TraceCheckUtils]: 145: Hoare triple {12510#(and (<= |ULTIMATE.start_foo_~i~0#1| 47) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {12510#(and (<= |ULTIMATE.start_foo_~i~0#1| 47) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,639 INFO L290 TraceCheckUtils]: 146: Hoare triple {12510#(and (<= |ULTIMATE.start_foo_~i~0#1| 47) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {12510#(and (<= |ULTIMATE.start_foo_~i~0#1| 47) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,640 INFO L290 TraceCheckUtils]: 147: Hoare triple {12510#(and (<= |ULTIMATE.start_foo_~i~0#1| 47) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {12520#(and (<= |ULTIMATE.start_foo_~i~0#1| 48) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,640 INFO L290 TraceCheckUtils]: 148: Hoare triple {12520#(and (<= |ULTIMATE.start_foo_~i~0#1| 48) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {12520#(and (<= |ULTIMATE.start_foo_~i~0#1| 48) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,640 INFO L290 TraceCheckUtils]: 149: Hoare triple {12520#(and (<= |ULTIMATE.start_foo_~i~0#1| 48) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {12520#(and (<= |ULTIMATE.start_foo_~i~0#1| 48) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,641 INFO L290 TraceCheckUtils]: 150: Hoare triple {12520#(and (<= |ULTIMATE.start_foo_~i~0#1| 48) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {12530#(and (<= 32768 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 49))} is VALID [2022-02-20 23:44:18,641 INFO L290 TraceCheckUtils]: 151: Hoare triple {12530#(and (<= 32768 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 49))} assume !!(foo_~i~0#1 < ~n~0); {12530#(and (<= 32768 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 49))} is VALID [2022-02-20 23:44:18,642 INFO L290 TraceCheckUtils]: 152: Hoare triple {12530#(and (<= 32768 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 49))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {12530#(and (<= 32768 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 49))} is VALID [2022-02-20 23:44:18,642 INFO L290 TraceCheckUtils]: 153: Hoare triple {12530#(and (<= 32768 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 49))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {12540#(and (<= 32768 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 50))} is VALID [2022-02-20 23:44:18,642 INFO L290 TraceCheckUtils]: 154: Hoare triple {12540#(and (<= 32768 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 50))} assume !!(foo_~i~0#1 < ~n~0); {12540#(and (<= 32768 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 50))} is VALID [2022-02-20 23:44:18,643 INFO L290 TraceCheckUtils]: 155: Hoare triple {12540#(and (<= 32768 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 50))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {12540#(and (<= 32768 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 50))} is VALID [2022-02-20 23:44:18,643 INFO L290 TraceCheckUtils]: 156: Hoare triple {12540#(and (<= 32768 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 50))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {12550#(and (<= |ULTIMATE.start_foo_~i~0#1| 51) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,643 INFO L290 TraceCheckUtils]: 157: Hoare triple {12550#(and (<= |ULTIMATE.start_foo_~i~0#1| 51) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {12550#(and (<= |ULTIMATE.start_foo_~i~0#1| 51) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,644 INFO L290 TraceCheckUtils]: 158: Hoare triple {12550#(and (<= |ULTIMATE.start_foo_~i~0#1| 51) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {12550#(and (<= |ULTIMATE.start_foo_~i~0#1| 51) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,644 INFO L290 TraceCheckUtils]: 159: Hoare triple {12550#(and (<= |ULTIMATE.start_foo_~i~0#1| 51) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {12560#(and (<= |ULTIMATE.start_foo_~i~0#1| 52) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,644 INFO L290 TraceCheckUtils]: 160: Hoare triple {12560#(and (<= |ULTIMATE.start_foo_~i~0#1| 52) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {12560#(and (<= |ULTIMATE.start_foo_~i~0#1| 52) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,645 INFO L290 TraceCheckUtils]: 161: Hoare triple {12560#(and (<= |ULTIMATE.start_foo_~i~0#1| 52) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {12560#(and (<= |ULTIMATE.start_foo_~i~0#1| 52) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,645 INFO L290 TraceCheckUtils]: 162: Hoare triple {12560#(and (<= |ULTIMATE.start_foo_~i~0#1| 52) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {12570#(and (<= |ULTIMATE.start_foo_~i~0#1| 53) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,646 INFO L290 TraceCheckUtils]: 163: Hoare triple {12570#(and (<= |ULTIMATE.start_foo_~i~0#1| 53) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {12570#(and (<= |ULTIMATE.start_foo_~i~0#1| 53) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,647 INFO L290 TraceCheckUtils]: 164: Hoare triple {12570#(and (<= |ULTIMATE.start_foo_~i~0#1| 53) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {12570#(and (<= |ULTIMATE.start_foo_~i~0#1| 53) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,647 INFO L290 TraceCheckUtils]: 165: Hoare triple {12570#(and (<= |ULTIMATE.start_foo_~i~0#1| 53) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {12580#(and (<= |ULTIMATE.start_foo_~i~0#1| 54) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,648 INFO L290 TraceCheckUtils]: 166: Hoare triple {12580#(and (<= |ULTIMATE.start_foo_~i~0#1| 54) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {12580#(and (<= |ULTIMATE.start_foo_~i~0#1| 54) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,648 INFO L290 TraceCheckUtils]: 167: Hoare triple {12580#(and (<= |ULTIMATE.start_foo_~i~0#1| 54) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {12580#(and (<= |ULTIMATE.start_foo_~i~0#1| 54) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,648 INFO L290 TraceCheckUtils]: 168: Hoare triple {12580#(and (<= |ULTIMATE.start_foo_~i~0#1| 54) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {12590#(and (<= |ULTIMATE.start_foo_~i~0#1| 55) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,649 INFO L290 TraceCheckUtils]: 169: Hoare triple {12590#(and (<= |ULTIMATE.start_foo_~i~0#1| 55) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {12590#(and (<= |ULTIMATE.start_foo_~i~0#1| 55) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,649 INFO L290 TraceCheckUtils]: 170: Hoare triple {12590#(and (<= |ULTIMATE.start_foo_~i~0#1| 55) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {12590#(and (<= |ULTIMATE.start_foo_~i~0#1| 55) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,650 INFO L290 TraceCheckUtils]: 171: Hoare triple {12590#(and (<= |ULTIMATE.start_foo_~i~0#1| 55) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {12600#(and (<= |ULTIMATE.start_foo_~i~0#1| 56) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,650 INFO L290 TraceCheckUtils]: 172: Hoare triple {12600#(and (<= |ULTIMATE.start_foo_~i~0#1| 56) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {12600#(and (<= |ULTIMATE.start_foo_~i~0#1| 56) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,650 INFO L290 TraceCheckUtils]: 173: Hoare triple {12600#(and (<= |ULTIMATE.start_foo_~i~0#1| 56) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {12600#(and (<= |ULTIMATE.start_foo_~i~0#1| 56) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,651 INFO L290 TraceCheckUtils]: 174: Hoare triple {12600#(and (<= |ULTIMATE.start_foo_~i~0#1| 56) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {12610#(and (<= |ULTIMATE.start_foo_~i~0#1| 57) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,651 INFO L290 TraceCheckUtils]: 175: Hoare triple {12610#(and (<= |ULTIMATE.start_foo_~i~0#1| 57) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {12610#(and (<= |ULTIMATE.start_foo_~i~0#1| 57) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,652 INFO L290 TraceCheckUtils]: 176: Hoare triple {12610#(and (<= |ULTIMATE.start_foo_~i~0#1| 57) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {12610#(and (<= |ULTIMATE.start_foo_~i~0#1| 57) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,652 INFO L290 TraceCheckUtils]: 177: Hoare triple {12610#(and (<= |ULTIMATE.start_foo_~i~0#1| 57) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {12620#(and (<= |ULTIMATE.start_foo_~i~0#1| 58) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,652 INFO L290 TraceCheckUtils]: 178: Hoare triple {12620#(and (<= |ULTIMATE.start_foo_~i~0#1| 58) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {12620#(and (<= |ULTIMATE.start_foo_~i~0#1| 58) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,653 INFO L290 TraceCheckUtils]: 179: Hoare triple {12620#(and (<= |ULTIMATE.start_foo_~i~0#1| 58) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {12620#(and (<= |ULTIMATE.start_foo_~i~0#1| 58) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,653 INFO L290 TraceCheckUtils]: 180: Hoare triple {12620#(and (<= |ULTIMATE.start_foo_~i~0#1| 58) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {12630#(and (<= 32768 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 59))} is VALID [2022-02-20 23:44:18,654 INFO L290 TraceCheckUtils]: 181: Hoare triple {12630#(and (<= 32768 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 59))} assume !!(foo_~i~0#1 < ~n~0); {12630#(and (<= 32768 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 59))} is VALID [2022-02-20 23:44:18,654 INFO L290 TraceCheckUtils]: 182: Hoare triple {12630#(and (<= 32768 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 59))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {12630#(and (<= 32768 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 59))} is VALID [2022-02-20 23:44:18,654 INFO L290 TraceCheckUtils]: 183: Hoare triple {12630#(and (<= 32768 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 59))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {12640#(and (<= |ULTIMATE.start_foo_~i~0#1| 60) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,655 INFO L290 TraceCheckUtils]: 184: Hoare triple {12640#(and (<= |ULTIMATE.start_foo_~i~0#1| 60) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {12640#(and (<= |ULTIMATE.start_foo_~i~0#1| 60) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,655 INFO L290 TraceCheckUtils]: 185: Hoare triple {12640#(and (<= |ULTIMATE.start_foo_~i~0#1| 60) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {12640#(and (<= |ULTIMATE.start_foo_~i~0#1| 60) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,656 INFO L290 TraceCheckUtils]: 186: Hoare triple {12640#(and (<= |ULTIMATE.start_foo_~i~0#1| 60) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {12650#(and (<= |ULTIMATE.start_foo_~i~0#1| 61) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,656 INFO L290 TraceCheckUtils]: 187: Hoare triple {12650#(and (<= |ULTIMATE.start_foo_~i~0#1| 61) (<= 32768 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {12650#(and (<= |ULTIMATE.start_foo_~i~0#1| 61) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,656 INFO L290 TraceCheckUtils]: 188: Hoare triple {12650#(and (<= |ULTIMATE.start_foo_~i~0#1| 61) (<= 32768 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {12650#(and (<= |ULTIMATE.start_foo_~i~0#1| 61) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,657 INFO L290 TraceCheckUtils]: 189: Hoare triple {12650#(and (<= |ULTIMATE.start_foo_~i~0#1| 61) (<= 32768 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {12660#(and (<= |ULTIMATE.start_foo_~i~0#1| 62) (<= 32768 ~n~0))} is VALID [2022-02-20 23:44:18,657 INFO L290 TraceCheckUtils]: 190: Hoare triple {12660#(and (<= |ULTIMATE.start_foo_~i~0#1| 62) (<= 32768 ~n~0))} assume !(foo_~i~0#1 < ~n~0); {11994#false} is VALID [2022-02-20 23:44:18,657 INFO L290 TraceCheckUtils]: 191: Hoare triple {11994#false} foo_~i~0#1 := 0; {11994#false} is VALID [2022-02-20 23:44:18,657 INFO L290 TraceCheckUtils]: 192: Hoare triple {11994#false} assume !!(foo_~i~0#1 < 32767); {11994#false} is VALID [2022-02-20 23:44:18,657 INFO L290 TraceCheckUtils]: 193: Hoare triple {11994#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {11994#false} is VALID [2022-02-20 23:44:18,657 INFO L290 TraceCheckUtils]: 194: Hoare triple {11994#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {11994#false} is VALID [2022-02-20 23:44:18,658 INFO L290 TraceCheckUtils]: 195: Hoare triple {11994#false} assume !!(foo_~i~0#1 < 32767); {11994#false} is VALID [2022-02-20 23:44:18,658 INFO L290 TraceCheckUtils]: 196: Hoare triple {11994#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {11994#false} is VALID [2022-02-20 23:44:18,658 INFO L290 TraceCheckUtils]: 197: Hoare triple {11994#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {11994#false} is VALID [2022-02-20 23:44:18,658 INFO L290 TraceCheckUtils]: 198: Hoare triple {11994#false} assume !!(foo_~i~0#1 < 32767); {11994#false} is VALID [2022-02-20 23:44:18,658 INFO L290 TraceCheckUtils]: 199: Hoare triple {11994#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {11994#false} is VALID [2022-02-20 23:44:18,658 INFO L290 TraceCheckUtils]: 200: Hoare triple {11994#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {11994#false} is VALID [2022-02-20 23:44:18,658 INFO L290 TraceCheckUtils]: 201: Hoare triple {11994#false} assume !!(foo_~i~0#1 < 32767); {11994#false} is VALID [2022-02-20 23:44:18,658 INFO L290 TraceCheckUtils]: 202: Hoare triple {11994#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {11994#false} is VALID [2022-02-20 23:44:18,658 INFO L290 TraceCheckUtils]: 203: Hoare triple {11994#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {11994#false} is VALID [2022-02-20 23:44:18,658 INFO L290 TraceCheckUtils]: 204: Hoare triple {11994#false} assume !!(foo_~i~0#1 < 32767); {11994#false} is VALID [2022-02-20 23:44:18,658 INFO L290 TraceCheckUtils]: 205: Hoare triple {11994#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {11994#false} is VALID [2022-02-20 23:44:18,658 INFO L290 TraceCheckUtils]: 206: Hoare triple {11994#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {11994#false} is VALID [2022-02-20 23:44:18,659 INFO L290 TraceCheckUtils]: 207: Hoare triple {11994#false} assume !!(foo_~i~0#1 < 32767); {11994#false} is VALID [2022-02-20 23:44:18,659 INFO L290 TraceCheckUtils]: 208: Hoare triple {11994#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {11994#false} is VALID [2022-02-20 23:44:18,659 INFO L290 TraceCheckUtils]: 209: Hoare triple {11994#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {11994#false} is VALID [2022-02-20 23:44:18,659 INFO L290 TraceCheckUtils]: 210: Hoare triple {11994#false} assume !!(foo_~i~0#1 < 32767); {11994#false} is VALID [2022-02-20 23:44:18,659 INFO L290 TraceCheckUtils]: 211: Hoare triple {11994#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {11994#false} is VALID [2022-02-20 23:44:18,659 INFO L290 TraceCheckUtils]: 212: Hoare triple {11994#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {11994#false} is VALID [2022-02-20 23:44:18,659 INFO L290 TraceCheckUtils]: 213: Hoare triple {11994#false} assume !!(foo_~i~0#1 < 32767); {11994#false} is VALID [2022-02-20 23:44:18,659 INFO L290 TraceCheckUtils]: 214: Hoare triple {11994#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {11994#false} is VALID [2022-02-20 23:44:18,659 INFO L290 TraceCheckUtils]: 215: Hoare triple {11994#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {11994#false} is VALID [2022-02-20 23:44:18,659 INFO L290 TraceCheckUtils]: 216: Hoare triple {11994#false} assume !!(foo_~i~0#1 < 32767); {11994#false} is VALID [2022-02-20 23:44:18,659 INFO L290 TraceCheckUtils]: 217: Hoare triple {11994#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {11994#false} is VALID [2022-02-20 23:44:18,659 INFO L290 TraceCheckUtils]: 218: Hoare triple {11994#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {11994#false} is VALID [2022-02-20 23:44:18,659 INFO L290 TraceCheckUtils]: 219: Hoare triple {11994#false} assume !!(foo_~i~0#1 < 32767); {11994#false} is VALID [2022-02-20 23:44:18,659 INFO L290 TraceCheckUtils]: 220: Hoare triple {11994#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {11994#false} is VALID [2022-02-20 23:44:18,659 INFO L290 TraceCheckUtils]: 221: Hoare triple {11994#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {11994#false} is VALID [2022-02-20 23:44:18,660 INFO L290 TraceCheckUtils]: 222: Hoare triple {11994#false} assume !!(foo_~i~0#1 < 32767); {11994#false} is VALID [2022-02-20 23:44:18,660 INFO L290 TraceCheckUtils]: 223: Hoare triple {11994#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {11994#false} is VALID [2022-02-20 23:44:18,660 INFO L290 TraceCheckUtils]: 224: Hoare triple {11994#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {11994#false} is VALID [2022-02-20 23:44:18,660 INFO L290 TraceCheckUtils]: 225: Hoare triple {11994#false} assume !!(foo_~i~0#1 < 32767); {11994#false} is VALID [2022-02-20 23:44:18,660 INFO L290 TraceCheckUtils]: 226: Hoare triple {11994#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {11994#false} is VALID [2022-02-20 23:44:18,660 INFO L290 TraceCheckUtils]: 227: Hoare triple {11994#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {11994#false} is VALID [2022-02-20 23:44:18,660 INFO L290 TraceCheckUtils]: 228: Hoare triple {11994#false} assume !!(foo_~i~0#1 < 32767); {11994#false} is VALID [2022-02-20 23:44:18,660 INFO L290 TraceCheckUtils]: 229: Hoare triple {11994#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {11994#false} is VALID [2022-02-20 23:44:18,660 INFO L290 TraceCheckUtils]: 230: Hoare triple {11994#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {11994#false} is VALID [2022-02-20 23:44:18,660 INFO L290 TraceCheckUtils]: 231: Hoare triple {11994#false} assume !!(foo_~i~0#1 < 32767); {11994#false} is VALID [2022-02-20 23:44:18,660 INFO L290 TraceCheckUtils]: 232: Hoare triple {11994#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {11994#false} is VALID [2022-02-20 23:44:18,660 INFO L290 TraceCheckUtils]: 233: Hoare triple {11994#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {11994#false} is VALID [2022-02-20 23:44:18,660 INFO L290 TraceCheckUtils]: 234: Hoare triple {11994#false} assume !!(foo_~i~0#1 < 32767); {11994#false} is VALID [2022-02-20 23:44:18,660 INFO L290 TraceCheckUtils]: 235: Hoare triple {11994#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {11994#false} is VALID [2022-02-20 23:44:18,660 INFO L290 TraceCheckUtils]: 236: Hoare triple {11994#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {11994#false} is VALID [2022-02-20 23:44:18,661 INFO L290 TraceCheckUtils]: 237: Hoare triple {11994#false} assume !!(foo_~i~0#1 < 32767); {11994#false} is VALID [2022-02-20 23:44:18,661 INFO L290 TraceCheckUtils]: 238: Hoare triple {11994#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {11994#false} is VALID [2022-02-20 23:44:18,661 INFO L290 TraceCheckUtils]: 239: Hoare triple {11994#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {11994#false} is VALID [2022-02-20 23:44:18,661 INFO L290 TraceCheckUtils]: 240: Hoare triple {11994#false} assume !!(foo_~i~0#1 < 32767); {11994#false} is VALID [2022-02-20 23:44:18,661 INFO L290 TraceCheckUtils]: 241: Hoare triple {11994#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {11994#false} is VALID [2022-02-20 23:44:18,661 INFO L290 TraceCheckUtils]: 242: Hoare triple {11994#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {11994#false} is VALID [2022-02-20 23:44:18,661 INFO L290 TraceCheckUtils]: 243: Hoare triple {11994#false} assume !!(foo_~i~0#1 < 32767); {11994#false} is VALID [2022-02-20 23:44:18,661 INFO L290 TraceCheckUtils]: 244: Hoare triple {11994#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {11994#false} is VALID [2022-02-20 23:44:18,661 INFO L290 TraceCheckUtils]: 245: Hoare triple {11994#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {11994#false} is VALID [2022-02-20 23:44:18,661 INFO L290 TraceCheckUtils]: 246: Hoare triple {11994#false} assume !!(foo_~i~0#1 < 32767); {11994#false} is VALID [2022-02-20 23:44:18,661 INFO L290 TraceCheckUtils]: 247: Hoare triple {11994#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {11994#false} is VALID [2022-02-20 23:44:18,661 INFO L290 TraceCheckUtils]: 248: Hoare triple {11994#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {11994#false} is VALID [2022-02-20 23:44:18,661 INFO L290 TraceCheckUtils]: 249: Hoare triple {11994#false} assume !!(foo_~i~0#1 < 32767); {11994#false} is VALID [2022-02-20 23:44:18,661 INFO L290 TraceCheckUtils]: 250: Hoare triple {11994#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {11994#false} is VALID [2022-02-20 23:44:18,661 INFO L290 TraceCheckUtils]: 251: Hoare triple {11994#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {11994#false} is VALID [2022-02-20 23:44:18,661 INFO L290 TraceCheckUtils]: 252: Hoare triple {11994#false} assume !!(foo_~i~0#1 < 32767); {11994#false} is VALID [2022-02-20 23:44:18,662 INFO L290 TraceCheckUtils]: 253: Hoare triple {11994#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {11994#false} is VALID [2022-02-20 23:44:18,662 INFO L290 TraceCheckUtils]: 254: Hoare triple {11994#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {11994#false} is VALID [2022-02-20 23:44:18,662 INFO L290 TraceCheckUtils]: 255: Hoare triple {11994#false} assume !!(foo_~i~0#1 < 32767); {11994#false} is VALID [2022-02-20 23:44:18,662 INFO L290 TraceCheckUtils]: 256: Hoare triple {11994#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {11994#false} is VALID [2022-02-20 23:44:18,662 INFO L290 TraceCheckUtils]: 257: Hoare triple {11994#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {11994#false} is VALID [2022-02-20 23:44:18,662 INFO L290 TraceCheckUtils]: 258: Hoare triple {11994#false} assume !!(foo_~i~0#1 < 32767); {11994#false} is VALID [2022-02-20 23:44:18,662 INFO L290 TraceCheckUtils]: 259: Hoare triple {11994#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {11994#false} is VALID [2022-02-20 23:44:18,662 INFO L290 TraceCheckUtils]: 260: Hoare triple {11994#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {11994#false} is VALID [2022-02-20 23:44:18,662 INFO L290 TraceCheckUtils]: 261: Hoare triple {11994#false} assume !!(foo_~i~0#1 < 32767); {11994#false} is VALID [2022-02-20 23:44:18,662 INFO L290 TraceCheckUtils]: 262: Hoare triple {11994#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {11994#false} is VALID [2022-02-20 23:44:18,662 INFO L290 TraceCheckUtils]: 263: Hoare triple {11994#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {11994#false} is VALID [2022-02-20 23:44:18,662 INFO L290 TraceCheckUtils]: 264: Hoare triple {11994#false} assume !!(foo_~i~0#1 < 32767); {11994#false} is VALID [2022-02-20 23:44:18,662 INFO L290 TraceCheckUtils]: 265: Hoare triple {11994#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {11994#false} is VALID [2022-02-20 23:44:18,662 INFO L290 TraceCheckUtils]: 266: Hoare triple {11994#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {11994#false} is VALID [2022-02-20 23:44:18,662 INFO L290 TraceCheckUtils]: 267: Hoare triple {11994#false} assume !!(foo_~i~0#1 < 32767); {11994#false} is VALID [2022-02-20 23:44:18,663 INFO L290 TraceCheckUtils]: 268: Hoare triple {11994#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {11994#false} is VALID [2022-02-20 23:44:18,663 INFO L290 TraceCheckUtils]: 269: Hoare triple {11994#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {11994#false} is VALID [2022-02-20 23:44:18,663 INFO L290 TraceCheckUtils]: 270: Hoare triple {11994#false} assume !!(foo_~i~0#1 < 32767); {11994#false} is VALID [2022-02-20 23:44:18,663 INFO L290 TraceCheckUtils]: 271: Hoare triple {11994#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {11994#false} is VALID [2022-02-20 23:44:18,663 INFO L290 TraceCheckUtils]: 272: Hoare triple {11994#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {11994#false} is VALID [2022-02-20 23:44:18,663 INFO L290 TraceCheckUtils]: 273: Hoare triple {11994#false} assume !!(foo_~i~0#1 < 32767); {11994#false} is VALID [2022-02-20 23:44:18,663 INFO L290 TraceCheckUtils]: 274: Hoare triple {11994#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {11994#false} is VALID [2022-02-20 23:44:18,663 INFO L290 TraceCheckUtils]: 275: Hoare triple {11994#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {11994#false} is VALID [2022-02-20 23:44:18,663 INFO L290 TraceCheckUtils]: 276: Hoare triple {11994#false} assume !!(foo_~i~0#1 < 32767); {11994#false} is VALID [2022-02-20 23:44:18,663 INFO L290 TraceCheckUtils]: 277: Hoare triple {11994#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {11994#false} is VALID [2022-02-20 23:44:18,663 INFO L290 TraceCheckUtils]: 278: Hoare triple {11994#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {11994#false} is VALID [2022-02-20 23:44:18,663 INFO L290 TraceCheckUtils]: 279: Hoare triple {11994#false} assume !!(foo_~i~0#1 < 32767); {11994#false} is VALID [2022-02-20 23:44:18,663 INFO L290 TraceCheckUtils]: 280: Hoare triple {11994#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {11994#false} is VALID [2022-02-20 23:44:18,663 INFO L290 TraceCheckUtils]: 281: Hoare triple {11994#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {11994#false} is VALID [2022-02-20 23:44:18,663 INFO L290 TraceCheckUtils]: 282: Hoare triple {11994#false} assume !!(foo_~i~0#1 < 32767); {11994#false} is VALID [2022-02-20 23:44:18,663 INFO L290 TraceCheckUtils]: 283: Hoare triple {11994#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {11994#false} is VALID [2022-02-20 23:44:18,664 INFO L290 TraceCheckUtils]: 284: Hoare triple {11994#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {11994#false} is VALID [2022-02-20 23:44:18,664 INFO L290 TraceCheckUtils]: 285: Hoare triple {11994#false} assume !(foo_~i~0#1 < 32767); {11994#false} is VALID [2022-02-20 23:44:18,664 INFO L290 TraceCheckUtils]: 286: Hoare triple {11994#false} assume { :end_inline_foo } true; {11994#false} is VALID [2022-02-20 23:44:18,664 INFO L290 TraceCheckUtils]: 287: Hoare triple {11994#false} SUMMARY for call main_#t~mem8#1 := read~int(~b~0.base, -4 + ~b~0.offset, 4); srcloc: L540 {11994#false} is VALID [2022-02-20 23:44:18,664 INFO L290 TraceCheckUtils]: 288: Hoare triple {11994#false} assume 0 != main_#t~mem8#1;havoc main_#t~mem8#1; {11994#false} is VALID [2022-02-20 23:44:18,664 INFO L290 TraceCheckUtils]: 289: Hoare triple {11994#false} assume 0 == ~a~0.offset; {11994#false} is VALID [2022-02-20 23:44:18,664 INFO L290 TraceCheckUtils]: 290: Hoare triple {11994#false} assume ~a~0.base < #StackHeapBarrier; {11994#false} is VALID [2022-02-20 23:44:18,664 INFO L290 TraceCheckUtils]: 291: Hoare triple {11994#false} assume 0 == ~a~0.base || 1 == #valid[~a~0.base];call ULTIMATE.dealloc(~a~0.base, ~a~0.offset); {11994#false} is VALID [2022-02-20 23:44:18,664 INFO L290 TraceCheckUtils]: 292: Hoare triple {11994#false} assume !(0 == ~b~0.offset); {11994#false} is VALID [2022-02-20 23:44:18,667 INFO L134 CoverageAnalysis]: Checked inductivity of 7161 backedges. 0 proven. 5735 refuted. 0 times theorem prover too weak. 1426 trivial. 0 not checked. [2022-02-20 23:44:18,667 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:44:22,970 INFO L290 TraceCheckUtils]: 292: Hoare triple {11994#false} assume !(0 == ~b~0.offset); {11994#false} is VALID [2022-02-20 23:44:22,970 INFO L290 TraceCheckUtils]: 291: Hoare triple {11994#false} assume 0 == ~a~0.base || 1 == #valid[~a~0.base];call ULTIMATE.dealloc(~a~0.base, ~a~0.offset); {11994#false} is VALID [2022-02-20 23:44:22,970 INFO L290 TraceCheckUtils]: 290: Hoare triple {11994#false} assume ~a~0.base < #StackHeapBarrier; {11994#false} is VALID [2022-02-20 23:44:22,970 INFO L290 TraceCheckUtils]: 289: Hoare triple {11994#false} assume 0 == ~a~0.offset; {11994#false} is VALID [2022-02-20 23:44:22,970 INFO L290 TraceCheckUtils]: 288: Hoare triple {11994#false} assume 0 != main_#t~mem8#1;havoc main_#t~mem8#1; {11994#false} is VALID [2022-02-20 23:44:22,970 INFO L290 TraceCheckUtils]: 287: Hoare triple {11994#false} SUMMARY for call main_#t~mem8#1 := read~int(~b~0.base, -4 + ~b~0.offset, 4); srcloc: L540 {11994#false} is VALID [2022-02-20 23:44:22,970 INFO L290 TraceCheckUtils]: 286: Hoare triple {11994#false} assume { :end_inline_foo } true; {11994#false} is VALID [2022-02-20 23:44:22,970 INFO L290 TraceCheckUtils]: 285: Hoare triple {11994#false} assume !(foo_~i~0#1 < 32767); {11994#false} is VALID [2022-02-20 23:44:22,970 INFO L290 TraceCheckUtils]: 284: Hoare triple {11994#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {11994#false} is VALID [2022-02-20 23:44:22,970 INFO L290 TraceCheckUtils]: 283: Hoare triple {11994#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {11994#false} is VALID [2022-02-20 23:44:22,970 INFO L290 TraceCheckUtils]: 282: Hoare triple {11994#false} assume !!(foo_~i~0#1 < 32767); {11994#false} is VALID [2022-02-20 23:44:22,971 INFO L290 TraceCheckUtils]: 281: Hoare triple {11994#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {11994#false} is VALID [2022-02-20 23:44:22,971 INFO L290 TraceCheckUtils]: 280: Hoare triple {11994#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {11994#false} is VALID [2022-02-20 23:44:22,971 INFO L290 TraceCheckUtils]: 279: Hoare triple {11994#false} assume !!(foo_~i~0#1 < 32767); {11994#false} is VALID [2022-02-20 23:44:22,971 INFO L290 TraceCheckUtils]: 278: Hoare triple {11994#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {11994#false} is VALID [2022-02-20 23:44:22,971 INFO L290 TraceCheckUtils]: 277: Hoare triple {11994#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {11994#false} is VALID [2022-02-20 23:44:22,971 INFO L290 TraceCheckUtils]: 276: Hoare triple {11994#false} assume !!(foo_~i~0#1 < 32767); {11994#false} is VALID [2022-02-20 23:44:22,971 INFO L290 TraceCheckUtils]: 275: Hoare triple {11994#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {11994#false} is VALID [2022-02-20 23:44:22,971 INFO L290 TraceCheckUtils]: 274: Hoare triple {11994#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {11994#false} is VALID [2022-02-20 23:44:22,971 INFO L290 TraceCheckUtils]: 273: Hoare triple {11994#false} assume !!(foo_~i~0#1 < 32767); {11994#false} is VALID [2022-02-20 23:44:22,971 INFO L290 TraceCheckUtils]: 272: Hoare triple {11994#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {11994#false} is VALID [2022-02-20 23:44:22,971 INFO L290 TraceCheckUtils]: 271: Hoare triple {11994#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {11994#false} is VALID [2022-02-20 23:44:22,971 INFO L290 TraceCheckUtils]: 270: Hoare triple {11994#false} assume !!(foo_~i~0#1 < 32767); {11994#false} is VALID [2022-02-20 23:44:22,971 INFO L290 TraceCheckUtils]: 269: Hoare triple {11994#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {11994#false} is VALID [2022-02-20 23:44:22,971 INFO L290 TraceCheckUtils]: 268: Hoare triple {11994#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {11994#false} is VALID [2022-02-20 23:44:22,971 INFO L290 TraceCheckUtils]: 267: Hoare triple {11994#false} assume !!(foo_~i~0#1 < 32767); {11994#false} is VALID [2022-02-20 23:44:22,971 INFO L290 TraceCheckUtils]: 266: Hoare triple {11994#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {11994#false} is VALID [2022-02-20 23:44:22,971 INFO L290 TraceCheckUtils]: 265: Hoare triple {11994#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {11994#false} is VALID [2022-02-20 23:44:22,971 INFO L290 TraceCheckUtils]: 264: Hoare triple {11994#false} assume !!(foo_~i~0#1 < 32767); {11994#false} is VALID [2022-02-20 23:44:22,971 INFO L290 TraceCheckUtils]: 263: Hoare triple {11994#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {11994#false} is VALID [2022-02-20 23:44:22,971 INFO L290 TraceCheckUtils]: 262: Hoare triple {11994#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {11994#false} is VALID [2022-02-20 23:44:22,971 INFO L290 TraceCheckUtils]: 261: Hoare triple {11994#false} assume !!(foo_~i~0#1 < 32767); {11994#false} is VALID [2022-02-20 23:44:22,971 INFO L290 TraceCheckUtils]: 260: Hoare triple {11994#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {11994#false} is VALID [2022-02-20 23:44:22,971 INFO L290 TraceCheckUtils]: 259: Hoare triple {11994#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {11994#false} is VALID [2022-02-20 23:44:22,972 INFO L290 TraceCheckUtils]: 258: Hoare triple {11994#false} assume !!(foo_~i~0#1 < 32767); {11994#false} is VALID [2022-02-20 23:44:22,972 INFO L290 TraceCheckUtils]: 257: Hoare triple {11994#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {11994#false} is VALID [2022-02-20 23:44:22,972 INFO L290 TraceCheckUtils]: 256: Hoare triple {11994#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {11994#false} is VALID [2022-02-20 23:44:22,972 INFO L290 TraceCheckUtils]: 255: Hoare triple {11994#false} assume !!(foo_~i~0#1 < 32767); {11994#false} is VALID [2022-02-20 23:44:22,972 INFO L290 TraceCheckUtils]: 254: Hoare triple {11994#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {11994#false} is VALID [2022-02-20 23:44:22,972 INFO L290 TraceCheckUtils]: 253: Hoare triple {11994#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {11994#false} is VALID [2022-02-20 23:44:22,972 INFO L290 TraceCheckUtils]: 252: Hoare triple {11994#false} assume !!(foo_~i~0#1 < 32767); {11994#false} is VALID [2022-02-20 23:44:22,972 INFO L290 TraceCheckUtils]: 251: Hoare triple {11994#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {11994#false} is VALID [2022-02-20 23:44:22,972 INFO L290 TraceCheckUtils]: 250: Hoare triple {11994#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {11994#false} is VALID [2022-02-20 23:44:22,972 INFO L290 TraceCheckUtils]: 249: Hoare triple {11994#false} assume !!(foo_~i~0#1 < 32767); {11994#false} is VALID [2022-02-20 23:44:22,972 INFO L290 TraceCheckUtils]: 248: Hoare triple {11994#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {11994#false} is VALID [2022-02-20 23:44:22,972 INFO L290 TraceCheckUtils]: 247: Hoare triple {11994#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {11994#false} is VALID [2022-02-20 23:44:22,972 INFO L290 TraceCheckUtils]: 246: Hoare triple {11994#false} assume !!(foo_~i~0#1 < 32767); {11994#false} is VALID [2022-02-20 23:44:22,972 INFO L290 TraceCheckUtils]: 245: Hoare triple {11994#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {11994#false} is VALID [2022-02-20 23:44:22,972 INFO L290 TraceCheckUtils]: 244: Hoare triple {11994#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {11994#false} is VALID [2022-02-20 23:44:22,972 INFO L290 TraceCheckUtils]: 243: Hoare triple {11994#false} assume !!(foo_~i~0#1 < 32767); {11994#false} is VALID [2022-02-20 23:44:22,972 INFO L290 TraceCheckUtils]: 242: Hoare triple {11994#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {11994#false} is VALID [2022-02-20 23:44:22,972 INFO L290 TraceCheckUtils]: 241: Hoare triple {11994#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {11994#false} is VALID [2022-02-20 23:44:22,972 INFO L290 TraceCheckUtils]: 240: Hoare triple {11994#false} assume !!(foo_~i~0#1 < 32767); {11994#false} is VALID [2022-02-20 23:44:22,972 INFO L290 TraceCheckUtils]: 239: Hoare triple {11994#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {11994#false} is VALID [2022-02-20 23:44:22,972 INFO L290 TraceCheckUtils]: 238: Hoare triple {11994#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {11994#false} is VALID [2022-02-20 23:44:22,972 INFO L290 TraceCheckUtils]: 237: Hoare triple {11994#false} assume !!(foo_~i~0#1 < 32767); {11994#false} is VALID [2022-02-20 23:44:22,972 INFO L290 TraceCheckUtils]: 236: Hoare triple {11994#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {11994#false} is VALID [2022-02-20 23:44:22,972 INFO L290 TraceCheckUtils]: 235: Hoare triple {11994#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {11994#false} is VALID [2022-02-20 23:44:22,973 INFO L290 TraceCheckUtils]: 234: Hoare triple {11994#false} assume !!(foo_~i~0#1 < 32767); {11994#false} is VALID [2022-02-20 23:44:22,973 INFO L290 TraceCheckUtils]: 233: Hoare triple {11994#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {11994#false} is VALID [2022-02-20 23:44:22,973 INFO L290 TraceCheckUtils]: 232: Hoare triple {11994#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {11994#false} is VALID [2022-02-20 23:44:22,973 INFO L290 TraceCheckUtils]: 231: Hoare triple {11994#false} assume !!(foo_~i~0#1 < 32767); {11994#false} is VALID [2022-02-20 23:44:22,973 INFO L290 TraceCheckUtils]: 230: Hoare triple {11994#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {11994#false} is VALID [2022-02-20 23:44:22,973 INFO L290 TraceCheckUtils]: 229: Hoare triple {11994#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {11994#false} is VALID [2022-02-20 23:44:22,973 INFO L290 TraceCheckUtils]: 228: Hoare triple {11994#false} assume !!(foo_~i~0#1 < 32767); {11994#false} is VALID [2022-02-20 23:44:22,973 INFO L290 TraceCheckUtils]: 227: Hoare triple {11994#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {11994#false} is VALID [2022-02-20 23:44:22,973 INFO L290 TraceCheckUtils]: 226: Hoare triple {11994#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {11994#false} is VALID [2022-02-20 23:44:22,973 INFO L290 TraceCheckUtils]: 225: Hoare triple {11994#false} assume !!(foo_~i~0#1 < 32767); {11994#false} is VALID [2022-02-20 23:44:22,973 INFO L290 TraceCheckUtils]: 224: Hoare triple {11994#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {11994#false} is VALID [2022-02-20 23:44:22,973 INFO L290 TraceCheckUtils]: 223: Hoare triple {11994#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {11994#false} is VALID [2022-02-20 23:44:22,973 INFO L290 TraceCheckUtils]: 222: Hoare triple {11994#false} assume !!(foo_~i~0#1 < 32767); {11994#false} is VALID [2022-02-20 23:44:22,973 INFO L290 TraceCheckUtils]: 221: Hoare triple {11994#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {11994#false} is VALID [2022-02-20 23:44:22,973 INFO L290 TraceCheckUtils]: 220: Hoare triple {11994#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {11994#false} is VALID [2022-02-20 23:44:22,973 INFO L290 TraceCheckUtils]: 219: Hoare triple {11994#false} assume !!(foo_~i~0#1 < 32767); {11994#false} is VALID [2022-02-20 23:44:22,973 INFO L290 TraceCheckUtils]: 218: Hoare triple {11994#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {11994#false} is VALID [2022-02-20 23:44:22,973 INFO L290 TraceCheckUtils]: 217: Hoare triple {11994#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {11994#false} is VALID [2022-02-20 23:44:22,973 INFO L290 TraceCheckUtils]: 216: Hoare triple {11994#false} assume !!(foo_~i~0#1 < 32767); {11994#false} is VALID [2022-02-20 23:44:22,973 INFO L290 TraceCheckUtils]: 215: Hoare triple {11994#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {11994#false} is VALID [2022-02-20 23:44:22,973 INFO L290 TraceCheckUtils]: 214: Hoare triple {11994#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {11994#false} is VALID [2022-02-20 23:44:22,973 INFO L290 TraceCheckUtils]: 213: Hoare triple {11994#false} assume !!(foo_~i~0#1 < 32767); {11994#false} is VALID [2022-02-20 23:44:22,973 INFO L290 TraceCheckUtils]: 212: Hoare triple {11994#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {11994#false} is VALID [2022-02-20 23:44:22,974 INFO L290 TraceCheckUtils]: 211: Hoare triple {11994#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {11994#false} is VALID [2022-02-20 23:44:22,974 INFO L290 TraceCheckUtils]: 210: Hoare triple {11994#false} assume !!(foo_~i~0#1 < 32767); {11994#false} is VALID [2022-02-20 23:44:22,974 INFO L290 TraceCheckUtils]: 209: Hoare triple {11994#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {11994#false} is VALID [2022-02-20 23:44:22,974 INFO L290 TraceCheckUtils]: 208: Hoare triple {11994#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {11994#false} is VALID [2022-02-20 23:44:22,974 INFO L290 TraceCheckUtils]: 207: Hoare triple {11994#false} assume !!(foo_~i~0#1 < 32767); {11994#false} is VALID [2022-02-20 23:44:22,974 INFO L290 TraceCheckUtils]: 206: Hoare triple {11994#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {11994#false} is VALID [2022-02-20 23:44:22,974 INFO L290 TraceCheckUtils]: 205: Hoare triple {11994#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {11994#false} is VALID [2022-02-20 23:44:22,974 INFO L290 TraceCheckUtils]: 204: Hoare triple {11994#false} assume !!(foo_~i~0#1 < 32767); {11994#false} is VALID [2022-02-20 23:44:22,974 INFO L290 TraceCheckUtils]: 203: Hoare triple {11994#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {11994#false} is VALID [2022-02-20 23:44:22,974 INFO L290 TraceCheckUtils]: 202: Hoare triple {11994#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {11994#false} is VALID [2022-02-20 23:44:22,974 INFO L290 TraceCheckUtils]: 201: Hoare triple {11994#false} assume !!(foo_~i~0#1 < 32767); {11994#false} is VALID [2022-02-20 23:44:22,974 INFO L290 TraceCheckUtils]: 200: Hoare triple {11994#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {11994#false} is VALID [2022-02-20 23:44:22,974 INFO L290 TraceCheckUtils]: 199: Hoare triple {11994#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {11994#false} is VALID [2022-02-20 23:44:22,974 INFO L290 TraceCheckUtils]: 198: Hoare triple {11994#false} assume !!(foo_~i~0#1 < 32767); {11994#false} is VALID [2022-02-20 23:44:22,974 INFO L290 TraceCheckUtils]: 197: Hoare triple {11994#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {11994#false} is VALID [2022-02-20 23:44:22,974 INFO L290 TraceCheckUtils]: 196: Hoare triple {11994#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {11994#false} is VALID [2022-02-20 23:44:22,974 INFO L290 TraceCheckUtils]: 195: Hoare triple {11994#false} assume !!(foo_~i~0#1 < 32767); {11994#false} is VALID [2022-02-20 23:44:22,974 INFO L290 TraceCheckUtils]: 194: Hoare triple {11994#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {11994#false} is VALID [2022-02-20 23:44:22,974 INFO L290 TraceCheckUtils]: 193: Hoare triple {11994#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {11994#false} is VALID [2022-02-20 23:44:22,974 INFO L290 TraceCheckUtils]: 192: Hoare triple {11994#false} assume !!(foo_~i~0#1 < 32767); {11994#false} is VALID [2022-02-20 23:44:22,974 INFO L290 TraceCheckUtils]: 191: Hoare triple {11994#false} foo_~i~0#1 := 0; {11994#false} is VALID [2022-02-20 23:44:22,975 INFO L290 TraceCheckUtils]: 190: Hoare triple {13276#(< |ULTIMATE.start_foo_~i~0#1| ~n~0)} assume !(foo_~i~0#1 < ~n~0); {11994#false} is VALID [2022-02-20 23:44:22,975 INFO L290 TraceCheckUtils]: 189: Hoare triple {13280#(< (+ |ULTIMATE.start_foo_~i~0#1| 1) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {13276#(< |ULTIMATE.start_foo_~i~0#1| ~n~0)} is VALID [2022-02-20 23:44:22,975 INFO L290 TraceCheckUtils]: 188: Hoare triple {13280#(< (+ |ULTIMATE.start_foo_~i~0#1| 1) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {13280#(< (+ |ULTIMATE.start_foo_~i~0#1| 1) ~n~0)} is VALID [2022-02-20 23:44:22,975 INFO L290 TraceCheckUtils]: 187: Hoare triple {13280#(< (+ |ULTIMATE.start_foo_~i~0#1| 1) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {13280#(< (+ |ULTIMATE.start_foo_~i~0#1| 1) ~n~0)} is VALID [2022-02-20 23:44:22,976 INFO L290 TraceCheckUtils]: 186: Hoare triple {13290#(< (+ |ULTIMATE.start_foo_~i~0#1| 2) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {13280#(< (+ |ULTIMATE.start_foo_~i~0#1| 1) ~n~0)} is VALID [2022-02-20 23:44:22,976 INFO L290 TraceCheckUtils]: 185: Hoare triple {13290#(< (+ |ULTIMATE.start_foo_~i~0#1| 2) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {13290#(< (+ |ULTIMATE.start_foo_~i~0#1| 2) ~n~0)} is VALID [2022-02-20 23:44:22,985 INFO L290 TraceCheckUtils]: 184: Hoare triple {13290#(< (+ |ULTIMATE.start_foo_~i~0#1| 2) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {13290#(< (+ |ULTIMATE.start_foo_~i~0#1| 2) ~n~0)} is VALID [2022-02-20 23:44:22,985 INFO L290 TraceCheckUtils]: 183: Hoare triple {13300#(< (+ |ULTIMATE.start_foo_~i~0#1| 3) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {13290#(< (+ |ULTIMATE.start_foo_~i~0#1| 2) ~n~0)} is VALID [2022-02-20 23:44:22,986 INFO L290 TraceCheckUtils]: 182: Hoare triple {13300#(< (+ |ULTIMATE.start_foo_~i~0#1| 3) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {13300#(< (+ |ULTIMATE.start_foo_~i~0#1| 3) ~n~0)} is VALID [2022-02-20 23:44:22,986 INFO L290 TraceCheckUtils]: 181: Hoare triple {13300#(< (+ |ULTIMATE.start_foo_~i~0#1| 3) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {13300#(< (+ |ULTIMATE.start_foo_~i~0#1| 3) ~n~0)} is VALID [2022-02-20 23:44:22,987 INFO L290 TraceCheckUtils]: 180: Hoare triple {13310#(< (+ |ULTIMATE.start_foo_~i~0#1| 4) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {13300#(< (+ |ULTIMATE.start_foo_~i~0#1| 3) ~n~0)} is VALID [2022-02-20 23:44:22,987 INFO L290 TraceCheckUtils]: 179: Hoare triple {13310#(< (+ |ULTIMATE.start_foo_~i~0#1| 4) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {13310#(< (+ |ULTIMATE.start_foo_~i~0#1| 4) ~n~0)} is VALID [2022-02-20 23:44:22,989 INFO L290 TraceCheckUtils]: 178: Hoare triple {13310#(< (+ |ULTIMATE.start_foo_~i~0#1| 4) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {13310#(< (+ |ULTIMATE.start_foo_~i~0#1| 4) ~n~0)} is VALID [2022-02-20 23:44:22,989 INFO L290 TraceCheckUtils]: 177: Hoare triple {13320#(< (+ |ULTIMATE.start_foo_~i~0#1| 5) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {13310#(< (+ |ULTIMATE.start_foo_~i~0#1| 4) ~n~0)} is VALID [2022-02-20 23:44:22,990 INFO L290 TraceCheckUtils]: 176: Hoare triple {13320#(< (+ |ULTIMATE.start_foo_~i~0#1| 5) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {13320#(< (+ |ULTIMATE.start_foo_~i~0#1| 5) ~n~0)} is VALID [2022-02-20 23:44:22,990 INFO L290 TraceCheckUtils]: 175: Hoare triple {13320#(< (+ |ULTIMATE.start_foo_~i~0#1| 5) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {13320#(< (+ |ULTIMATE.start_foo_~i~0#1| 5) ~n~0)} is VALID [2022-02-20 23:44:22,990 INFO L290 TraceCheckUtils]: 174: Hoare triple {13330#(< (+ |ULTIMATE.start_foo_~i~0#1| 6) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {13320#(< (+ |ULTIMATE.start_foo_~i~0#1| 5) ~n~0)} is VALID [2022-02-20 23:44:22,991 INFO L290 TraceCheckUtils]: 173: Hoare triple {13330#(< (+ |ULTIMATE.start_foo_~i~0#1| 6) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {13330#(< (+ |ULTIMATE.start_foo_~i~0#1| 6) ~n~0)} is VALID [2022-02-20 23:44:22,991 INFO L290 TraceCheckUtils]: 172: Hoare triple {13330#(< (+ |ULTIMATE.start_foo_~i~0#1| 6) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {13330#(< (+ |ULTIMATE.start_foo_~i~0#1| 6) ~n~0)} is VALID [2022-02-20 23:44:22,991 INFO L290 TraceCheckUtils]: 171: Hoare triple {13340#(< (+ 7 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {13330#(< (+ |ULTIMATE.start_foo_~i~0#1| 6) ~n~0)} is VALID [2022-02-20 23:44:22,991 INFO L290 TraceCheckUtils]: 170: Hoare triple {13340#(< (+ 7 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {13340#(< (+ 7 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:22,992 INFO L290 TraceCheckUtils]: 169: Hoare triple {13340#(< (+ 7 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {13340#(< (+ 7 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:22,992 INFO L290 TraceCheckUtils]: 168: Hoare triple {13350#(< (+ |ULTIMATE.start_foo_~i~0#1| 8) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {13340#(< (+ 7 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:22,992 INFO L290 TraceCheckUtils]: 167: Hoare triple {13350#(< (+ |ULTIMATE.start_foo_~i~0#1| 8) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {13350#(< (+ |ULTIMATE.start_foo_~i~0#1| 8) ~n~0)} is VALID [2022-02-20 23:44:22,993 INFO L290 TraceCheckUtils]: 166: Hoare triple {13350#(< (+ |ULTIMATE.start_foo_~i~0#1| 8) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {13350#(< (+ |ULTIMATE.start_foo_~i~0#1| 8) ~n~0)} is VALID [2022-02-20 23:44:22,993 INFO L290 TraceCheckUtils]: 165: Hoare triple {13360#(< (+ |ULTIMATE.start_foo_~i~0#1| 9) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {13350#(< (+ |ULTIMATE.start_foo_~i~0#1| 8) ~n~0)} is VALID [2022-02-20 23:44:22,993 INFO L290 TraceCheckUtils]: 164: Hoare triple {13360#(< (+ |ULTIMATE.start_foo_~i~0#1| 9) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {13360#(< (+ |ULTIMATE.start_foo_~i~0#1| 9) ~n~0)} is VALID [2022-02-20 23:44:22,994 INFO L290 TraceCheckUtils]: 163: Hoare triple {13360#(< (+ |ULTIMATE.start_foo_~i~0#1| 9) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {13360#(< (+ |ULTIMATE.start_foo_~i~0#1| 9) ~n~0)} is VALID [2022-02-20 23:44:22,994 INFO L290 TraceCheckUtils]: 162: Hoare triple {13370#(< (+ |ULTIMATE.start_foo_~i~0#1| 10) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {13360#(< (+ |ULTIMATE.start_foo_~i~0#1| 9) ~n~0)} is VALID [2022-02-20 23:44:22,994 INFO L290 TraceCheckUtils]: 161: Hoare triple {13370#(< (+ |ULTIMATE.start_foo_~i~0#1| 10) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {13370#(< (+ |ULTIMATE.start_foo_~i~0#1| 10) ~n~0)} is VALID [2022-02-20 23:44:22,994 INFO L290 TraceCheckUtils]: 160: Hoare triple {13370#(< (+ |ULTIMATE.start_foo_~i~0#1| 10) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {13370#(< (+ |ULTIMATE.start_foo_~i~0#1| 10) ~n~0)} is VALID [2022-02-20 23:44:22,995 INFO L290 TraceCheckUtils]: 159: Hoare triple {13380#(< (+ |ULTIMATE.start_foo_~i~0#1| 11) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {13370#(< (+ |ULTIMATE.start_foo_~i~0#1| 10) ~n~0)} is VALID [2022-02-20 23:44:22,995 INFO L290 TraceCheckUtils]: 158: Hoare triple {13380#(< (+ |ULTIMATE.start_foo_~i~0#1| 11) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {13380#(< (+ |ULTIMATE.start_foo_~i~0#1| 11) ~n~0)} is VALID [2022-02-20 23:44:22,995 INFO L290 TraceCheckUtils]: 157: Hoare triple {13380#(< (+ |ULTIMATE.start_foo_~i~0#1| 11) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {13380#(< (+ |ULTIMATE.start_foo_~i~0#1| 11) ~n~0)} is VALID [2022-02-20 23:44:22,996 INFO L290 TraceCheckUtils]: 156: Hoare triple {13390#(< (+ |ULTIMATE.start_foo_~i~0#1| 12) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {13380#(< (+ |ULTIMATE.start_foo_~i~0#1| 11) ~n~0)} is VALID [2022-02-20 23:44:22,996 INFO L290 TraceCheckUtils]: 155: Hoare triple {13390#(< (+ |ULTIMATE.start_foo_~i~0#1| 12) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {13390#(< (+ |ULTIMATE.start_foo_~i~0#1| 12) ~n~0)} is VALID [2022-02-20 23:44:22,996 INFO L290 TraceCheckUtils]: 154: Hoare triple {13390#(< (+ |ULTIMATE.start_foo_~i~0#1| 12) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {13390#(< (+ |ULTIMATE.start_foo_~i~0#1| 12) ~n~0)} is VALID [2022-02-20 23:44:22,997 INFO L290 TraceCheckUtils]: 153: Hoare triple {13400#(< (+ |ULTIMATE.start_foo_~i~0#1| 13) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {13390#(< (+ |ULTIMATE.start_foo_~i~0#1| 12) ~n~0)} is VALID [2022-02-20 23:44:22,997 INFO L290 TraceCheckUtils]: 152: Hoare triple {13400#(< (+ |ULTIMATE.start_foo_~i~0#1| 13) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {13400#(< (+ |ULTIMATE.start_foo_~i~0#1| 13) ~n~0)} is VALID [2022-02-20 23:44:22,997 INFO L290 TraceCheckUtils]: 151: Hoare triple {13400#(< (+ |ULTIMATE.start_foo_~i~0#1| 13) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {13400#(< (+ |ULTIMATE.start_foo_~i~0#1| 13) ~n~0)} is VALID [2022-02-20 23:44:22,997 INFO L290 TraceCheckUtils]: 150: Hoare triple {13410#(< (+ |ULTIMATE.start_foo_~i~0#1| 14) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {13400#(< (+ |ULTIMATE.start_foo_~i~0#1| 13) ~n~0)} is VALID [2022-02-20 23:44:22,998 INFO L290 TraceCheckUtils]: 149: Hoare triple {13410#(< (+ |ULTIMATE.start_foo_~i~0#1| 14) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {13410#(< (+ |ULTIMATE.start_foo_~i~0#1| 14) ~n~0)} is VALID [2022-02-20 23:44:22,998 INFO L290 TraceCheckUtils]: 148: Hoare triple {13410#(< (+ |ULTIMATE.start_foo_~i~0#1| 14) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {13410#(< (+ |ULTIMATE.start_foo_~i~0#1| 14) ~n~0)} is VALID [2022-02-20 23:44:22,998 INFO L290 TraceCheckUtils]: 147: Hoare triple {13420#(< (+ |ULTIMATE.start_foo_~i~0#1| 15) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {13410#(< (+ |ULTIMATE.start_foo_~i~0#1| 14) ~n~0)} is VALID [2022-02-20 23:44:22,999 INFO L290 TraceCheckUtils]: 146: Hoare triple {13420#(< (+ |ULTIMATE.start_foo_~i~0#1| 15) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {13420#(< (+ |ULTIMATE.start_foo_~i~0#1| 15) ~n~0)} is VALID [2022-02-20 23:44:22,999 INFO L290 TraceCheckUtils]: 145: Hoare triple {13420#(< (+ |ULTIMATE.start_foo_~i~0#1| 15) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {13420#(< (+ |ULTIMATE.start_foo_~i~0#1| 15) ~n~0)} is VALID [2022-02-20 23:44:22,999 INFO L290 TraceCheckUtils]: 144: Hoare triple {13430#(< (+ |ULTIMATE.start_foo_~i~0#1| 16) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {13420#(< (+ |ULTIMATE.start_foo_~i~0#1| 15) ~n~0)} is VALID [2022-02-20 23:44:23,000 INFO L290 TraceCheckUtils]: 143: Hoare triple {13430#(< (+ |ULTIMATE.start_foo_~i~0#1| 16) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {13430#(< (+ |ULTIMATE.start_foo_~i~0#1| 16) ~n~0)} is VALID [2022-02-20 23:44:23,000 INFO L290 TraceCheckUtils]: 142: Hoare triple {13430#(< (+ |ULTIMATE.start_foo_~i~0#1| 16) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {13430#(< (+ |ULTIMATE.start_foo_~i~0#1| 16) ~n~0)} is VALID [2022-02-20 23:44:23,000 INFO L290 TraceCheckUtils]: 141: Hoare triple {13440#(< (+ |ULTIMATE.start_foo_~i~0#1| 17) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {13430#(< (+ |ULTIMATE.start_foo_~i~0#1| 16) ~n~0)} is VALID [2022-02-20 23:44:23,001 INFO L290 TraceCheckUtils]: 140: Hoare triple {13440#(< (+ |ULTIMATE.start_foo_~i~0#1| 17) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {13440#(< (+ |ULTIMATE.start_foo_~i~0#1| 17) ~n~0)} is VALID [2022-02-20 23:44:23,001 INFO L290 TraceCheckUtils]: 139: Hoare triple {13440#(< (+ |ULTIMATE.start_foo_~i~0#1| 17) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {13440#(< (+ |ULTIMATE.start_foo_~i~0#1| 17) ~n~0)} is VALID [2022-02-20 23:44:23,001 INFO L290 TraceCheckUtils]: 138: Hoare triple {13450#(< (+ |ULTIMATE.start_foo_~i~0#1| 18) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {13440#(< (+ |ULTIMATE.start_foo_~i~0#1| 17) ~n~0)} is VALID [2022-02-20 23:44:23,001 INFO L290 TraceCheckUtils]: 137: Hoare triple {13450#(< (+ |ULTIMATE.start_foo_~i~0#1| 18) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {13450#(< (+ |ULTIMATE.start_foo_~i~0#1| 18) ~n~0)} is VALID [2022-02-20 23:44:23,002 INFO L290 TraceCheckUtils]: 136: Hoare triple {13450#(< (+ |ULTIMATE.start_foo_~i~0#1| 18) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {13450#(< (+ |ULTIMATE.start_foo_~i~0#1| 18) ~n~0)} is VALID [2022-02-20 23:44:23,002 INFO L290 TraceCheckUtils]: 135: Hoare triple {13460#(< (+ 19 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {13450#(< (+ |ULTIMATE.start_foo_~i~0#1| 18) ~n~0)} is VALID [2022-02-20 23:44:23,002 INFO L290 TraceCheckUtils]: 134: Hoare triple {13460#(< (+ 19 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {13460#(< (+ 19 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:23,003 INFO L290 TraceCheckUtils]: 133: Hoare triple {13460#(< (+ 19 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {13460#(< (+ 19 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:23,003 INFO L290 TraceCheckUtils]: 132: Hoare triple {13470#(< (+ |ULTIMATE.start_foo_~i~0#1| 20) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {13460#(< (+ 19 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:23,003 INFO L290 TraceCheckUtils]: 131: Hoare triple {13470#(< (+ |ULTIMATE.start_foo_~i~0#1| 20) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {13470#(< (+ |ULTIMATE.start_foo_~i~0#1| 20) ~n~0)} is VALID [2022-02-20 23:44:23,003 INFO L290 TraceCheckUtils]: 130: Hoare triple {13470#(< (+ |ULTIMATE.start_foo_~i~0#1| 20) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {13470#(< (+ |ULTIMATE.start_foo_~i~0#1| 20) ~n~0)} is VALID [2022-02-20 23:44:23,004 INFO L290 TraceCheckUtils]: 129: Hoare triple {13480#(< (+ |ULTIMATE.start_foo_~i~0#1| 21) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {13470#(< (+ |ULTIMATE.start_foo_~i~0#1| 20) ~n~0)} is VALID [2022-02-20 23:44:23,004 INFO L290 TraceCheckUtils]: 128: Hoare triple {13480#(< (+ |ULTIMATE.start_foo_~i~0#1| 21) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {13480#(< (+ |ULTIMATE.start_foo_~i~0#1| 21) ~n~0)} is VALID [2022-02-20 23:44:23,004 INFO L290 TraceCheckUtils]: 127: Hoare triple {13480#(< (+ |ULTIMATE.start_foo_~i~0#1| 21) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {13480#(< (+ |ULTIMATE.start_foo_~i~0#1| 21) ~n~0)} is VALID [2022-02-20 23:44:23,005 INFO L290 TraceCheckUtils]: 126: Hoare triple {13490#(< (+ |ULTIMATE.start_foo_~i~0#1| 22) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {13480#(< (+ |ULTIMATE.start_foo_~i~0#1| 21) ~n~0)} is VALID [2022-02-20 23:44:23,005 INFO L290 TraceCheckUtils]: 125: Hoare triple {13490#(< (+ |ULTIMATE.start_foo_~i~0#1| 22) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {13490#(< (+ |ULTIMATE.start_foo_~i~0#1| 22) ~n~0)} is VALID [2022-02-20 23:44:23,005 INFO L290 TraceCheckUtils]: 124: Hoare triple {13490#(< (+ |ULTIMATE.start_foo_~i~0#1| 22) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {13490#(< (+ |ULTIMATE.start_foo_~i~0#1| 22) ~n~0)} is VALID [2022-02-20 23:44:23,006 INFO L290 TraceCheckUtils]: 123: Hoare triple {13500#(< (+ 23 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {13490#(< (+ |ULTIMATE.start_foo_~i~0#1| 22) ~n~0)} is VALID [2022-02-20 23:44:23,006 INFO L290 TraceCheckUtils]: 122: Hoare triple {13500#(< (+ 23 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {13500#(< (+ 23 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:23,006 INFO L290 TraceCheckUtils]: 121: Hoare triple {13500#(< (+ 23 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {13500#(< (+ 23 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:23,007 INFO L290 TraceCheckUtils]: 120: Hoare triple {13510#(< (+ |ULTIMATE.start_foo_~i~0#1| 24) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {13500#(< (+ 23 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:23,007 INFO L290 TraceCheckUtils]: 119: Hoare triple {13510#(< (+ |ULTIMATE.start_foo_~i~0#1| 24) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {13510#(< (+ |ULTIMATE.start_foo_~i~0#1| 24) ~n~0)} is VALID [2022-02-20 23:44:23,007 INFO L290 TraceCheckUtils]: 118: Hoare triple {13510#(< (+ |ULTIMATE.start_foo_~i~0#1| 24) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {13510#(< (+ |ULTIMATE.start_foo_~i~0#1| 24) ~n~0)} is VALID [2022-02-20 23:44:23,008 INFO L290 TraceCheckUtils]: 117: Hoare triple {13520#(< (+ |ULTIMATE.start_foo_~i~0#1| 25) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {13510#(< (+ |ULTIMATE.start_foo_~i~0#1| 24) ~n~0)} is VALID [2022-02-20 23:44:23,008 INFO L290 TraceCheckUtils]: 116: Hoare triple {13520#(< (+ |ULTIMATE.start_foo_~i~0#1| 25) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {13520#(< (+ |ULTIMATE.start_foo_~i~0#1| 25) ~n~0)} is VALID [2022-02-20 23:44:23,008 INFO L290 TraceCheckUtils]: 115: Hoare triple {13520#(< (+ |ULTIMATE.start_foo_~i~0#1| 25) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {13520#(< (+ |ULTIMATE.start_foo_~i~0#1| 25) ~n~0)} is VALID [2022-02-20 23:44:23,008 INFO L290 TraceCheckUtils]: 114: Hoare triple {13530#(< (+ |ULTIMATE.start_foo_~i~0#1| 26) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {13520#(< (+ |ULTIMATE.start_foo_~i~0#1| 25) ~n~0)} is VALID [2022-02-20 23:44:23,009 INFO L290 TraceCheckUtils]: 113: Hoare triple {13530#(< (+ |ULTIMATE.start_foo_~i~0#1| 26) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {13530#(< (+ |ULTIMATE.start_foo_~i~0#1| 26) ~n~0)} is VALID [2022-02-20 23:44:23,009 INFO L290 TraceCheckUtils]: 112: Hoare triple {13530#(< (+ |ULTIMATE.start_foo_~i~0#1| 26) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {13530#(< (+ |ULTIMATE.start_foo_~i~0#1| 26) ~n~0)} is VALID [2022-02-20 23:44:23,009 INFO L290 TraceCheckUtils]: 111: Hoare triple {13540#(< (+ |ULTIMATE.start_foo_~i~0#1| 27) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {13530#(< (+ |ULTIMATE.start_foo_~i~0#1| 26) ~n~0)} is VALID [2022-02-20 23:44:23,009 INFO L290 TraceCheckUtils]: 110: Hoare triple {13540#(< (+ |ULTIMATE.start_foo_~i~0#1| 27) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {13540#(< (+ |ULTIMATE.start_foo_~i~0#1| 27) ~n~0)} is VALID [2022-02-20 23:44:23,010 INFO L290 TraceCheckUtils]: 109: Hoare triple {13540#(< (+ |ULTIMATE.start_foo_~i~0#1| 27) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {13540#(< (+ |ULTIMATE.start_foo_~i~0#1| 27) ~n~0)} is VALID [2022-02-20 23:44:23,010 INFO L290 TraceCheckUtils]: 108: Hoare triple {13550#(< (+ |ULTIMATE.start_foo_~i~0#1| 28) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {13540#(< (+ |ULTIMATE.start_foo_~i~0#1| 27) ~n~0)} is VALID [2022-02-20 23:44:23,010 INFO L290 TraceCheckUtils]: 107: Hoare triple {13550#(< (+ |ULTIMATE.start_foo_~i~0#1| 28) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {13550#(< (+ |ULTIMATE.start_foo_~i~0#1| 28) ~n~0)} is VALID [2022-02-20 23:44:23,011 INFO L290 TraceCheckUtils]: 106: Hoare triple {13550#(< (+ |ULTIMATE.start_foo_~i~0#1| 28) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {13550#(< (+ |ULTIMATE.start_foo_~i~0#1| 28) ~n~0)} is VALID [2022-02-20 23:44:23,011 INFO L290 TraceCheckUtils]: 105: Hoare triple {13560#(< (+ |ULTIMATE.start_foo_~i~0#1| 29) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {13550#(< (+ |ULTIMATE.start_foo_~i~0#1| 28) ~n~0)} is VALID [2022-02-20 23:44:23,011 INFO L290 TraceCheckUtils]: 104: Hoare triple {13560#(< (+ |ULTIMATE.start_foo_~i~0#1| 29) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {13560#(< (+ |ULTIMATE.start_foo_~i~0#1| 29) ~n~0)} is VALID [2022-02-20 23:44:23,012 INFO L290 TraceCheckUtils]: 103: Hoare triple {13560#(< (+ |ULTIMATE.start_foo_~i~0#1| 29) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {13560#(< (+ |ULTIMATE.start_foo_~i~0#1| 29) ~n~0)} is VALID [2022-02-20 23:44:23,012 INFO L290 TraceCheckUtils]: 102: Hoare triple {13570#(< (+ |ULTIMATE.start_foo_~i~0#1| 30) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {13560#(< (+ |ULTIMATE.start_foo_~i~0#1| 29) ~n~0)} is VALID [2022-02-20 23:44:23,012 INFO L290 TraceCheckUtils]: 101: Hoare triple {13570#(< (+ |ULTIMATE.start_foo_~i~0#1| 30) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {13570#(< (+ |ULTIMATE.start_foo_~i~0#1| 30) ~n~0)} is VALID [2022-02-20 23:44:23,013 INFO L290 TraceCheckUtils]: 100: Hoare triple {13570#(< (+ |ULTIMATE.start_foo_~i~0#1| 30) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {13570#(< (+ |ULTIMATE.start_foo_~i~0#1| 30) ~n~0)} is VALID [2022-02-20 23:44:23,013 INFO L290 TraceCheckUtils]: 99: Hoare triple {13580#(< (+ |ULTIMATE.start_foo_~i~0#1| 31) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {13570#(< (+ |ULTIMATE.start_foo_~i~0#1| 30) ~n~0)} is VALID [2022-02-20 23:44:23,013 INFO L290 TraceCheckUtils]: 98: Hoare triple {13580#(< (+ |ULTIMATE.start_foo_~i~0#1| 31) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {13580#(< (+ |ULTIMATE.start_foo_~i~0#1| 31) ~n~0)} is VALID [2022-02-20 23:44:23,014 INFO L290 TraceCheckUtils]: 97: Hoare triple {13580#(< (+ |ULTIMATE.start_foo_~i~0#1| 31) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {13580#(< (+ |ULTIMATE.start_foo_~i~0#1| 31) ~n~0)} is VALID [2022-02-20 23:44:23,014 INFO L290 TraceCheckUtils]: 96: Hoare triple {13590#(< (+ |ULTIMATE.start_foo_~i~0#1| 32) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {13580#(< (+ |ULTIMATE.start_foo_~i~0#1| 31) ~n~0)} is VALID [2022-02-20 23:44:23,014 INFO L290 TraceCheckUtils]: 95: Hoare triple {13590#(< (+ |ULTIMATE.start_foo_~i~0#1| 32) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {13590#(< (+ |ULTIMATE.start_foo_~i~0#1| 32) ~n~0)} is VALID [2022-02-20 23:44:23,015 INFO L290 TraceCheckUtils]: 94: Hoare triple {13590#(< (+ |ULTIMATE.start_foo_~i~0#1| 32) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {13590#(< (+ |ULTIMATE.start_foo_~i~0#1| 32) ~n~0)} is VALID [2022-02-20 23:44:23,015 INFO L290 TraceCheckUtils]: 93: Hoare triple {13600#(< (+ |ULTIMATE.start_foo_~i~0#1| 33) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {13590#(< (+ |ULTIMATE.start_foo_~i~0#1| 32) ~n~0)} is VALID [2022-02-20 23:44:23,015 INFO L290 TraceCheckUtils]: 92: Hoare triple {13600#(< (+ |ULTIMATE.start_foo_~i~0#1| 33) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {13600#(< (+ |ULTIMATE.start_foo_~i~0#1| 33) ~n~0)} is VALID [2022-02-20 23:44:23,015 INFO L290 TraceCheckUtils]: 91: Hoare triple {13600#(< (+ |ULTIMATE.start_foo_~i~0#1| 33) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {13600#(< (+ |ULTIMATE.start_foo_~i~0#1| 33) ~n~0)} is VALID [2022-02-20 23:44:23,016 INFO L290 TraceCheckUtils]: 90: Hoare triple {13610#(< (+ |ULTIMATE.start_foo_~i~0#1| 34) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {13600#(< (+ |ULTIMATE.start_foo_~i~0#1| 33) ~n~0)} is VALID [2022-02-20 23:44:23,016 INFO L290 TraceCheckUtils]: 89: Hoare triple {13610#(< (+ |ULTIMATE.start_foo_~i~0#1| 34) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {13610#(< (+ |ULTIMATE.start_foo_~i~0#1| 34) ~n~0)} is VALID [2022-02-20 23:44:23,016 INFO L290 TraceCheckUtils]: 88: Hoare triple {13610#(< (+ |ULTIMATE.start_foo_~i~0#1| 34) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {13610#(< (+ |ULTIMATE.start_foo_~i~0#1| 34) ~n~0)} is VALID [2022-02-20 23:44:23,017 INFO L290 TraceCheckUtils]: 87: Hoare triple {13620#(< (+ |ULTIMATE.start_foo_~i~0#1| 35) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {13610#(< (+ |ULTIMATE.start_foo_~i~0#1| 34) ~n~0)} is VALID [2022-02-20 23:44:23,017 INFO L290 TraceCheckUtils]: 86: Hoare triple {13620#(< (+ |ULTIMATE.start_foo_~i~0#1| 35) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {13620#(< (+ |ULTIMATE.start_foo_~i~0#1| 35) ~n~0)} is VALID [2022-02-20 23:44:23,023 INFO L290 TraceCheckUtils]: 85: Hoare triple {13620#(< (+ |ULTIMATE.start_foo_~i~0#1| 35) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {13620#(< (+ |ULTIMATE.start_foo_~i~0#1| 35) ~n~0)} is VALID [2022-02-20 23:44:23,024 INFO L290 TraceCheckUtils]: 84: Hoare triple {13630#(< (+ |ULTIMATE.start_foo_~i~0#1| 36) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {13620#(< (+ |ULTIMATE.start_foo_~i~0#1| 35) ~n~0)} is VALID [2022-02-20 23:44:23,024 INFO L290 TraceCheckUtils]: 83: Hoare triple {13630#(< (+ |ULTIMATE.start_foo_~i~0#1| 36) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {13630#(< (+ |ULTIMATE.start_foo_~i~0#1| 36) ~n~0)} is VALID [2022-02-20 23:44:23,025 INFO L290 TraceCheckUtils]: 82: Hoare triple {13630#(< (+ |ULTIMATE.start_foo_~i~0#1| 36) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {13630#(< (+ |ULTIMATE.start_foo_~i~0#1| 36) ~n~0)} is VALID [2022-02-20 23:44:23,025 INFO L290 TraceCheckUtils]: 81: Hoare triple {13640#(< (+ |ULTIMATE.start_foo_~i~0#1| 37) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {13630#(< (+ |ULTIMATE.start_foo_~i~0#1| 36) ~n~0)} is VALID [2022-02-20 23:44:23,026 INFO L290 TraceCheckUtils]: 80: Hoare triple {13640#(< (+ |ULTIMATE.start_foo_~i~0#1| 37) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {13640#(< (+ |ULTIMATE.start_foo_~i~0#1| 37) ~n~0)} is VALID [2022-02-20 23:44:23,026 INFO L290 TraceCheckUtils]: 79: Hoare triple {13640#(< (+ |ULTIMATE.start_foo_~i~0#1| 37) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {13640#(< (+ |ULTIMATE.start_foo_~i~0#1| 37) ~n~0)} is VALID [2022-02-20 23:44:23,026 INFO L290 TraceCheckUtils]: 78: Hoare triple {13650#(< (+ |ULTIMATE.start_foo_~i~0#1| 38) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {13640#(< (+ |ULTIMATE.start_foo_~i~0#1| 37) ~n~0)} is VALID [2022-02-20 23:44:23,027 INFO L290 TraceCheckUtils]: 77: Hoare triple {13650#(< (+ |ULTIMATE.start_foo_~i~0#1| 38) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {13650#(< (+ |ULTIMATE.start_foo_~i~0#1| 38) ~n~0)} is VALID [2022-02-20 23:44:23,027 INFO L290 TraceCheckUtils]: 76: Hoare triple {13650#(< (+ |ULTIMATE.start_foo_~i~0#1| 38) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {13650#(< (+ |ULTIMATE.start_foo_~i~0#1| 38) ~n~0)} is VALID [2022-02-20 23:44:23,028 INFO L290 TraceCheckUtils]: 75: Hoare triple {13660#(< (+ |ULTIMATE.start_foo_~i~0#1| 39) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {13650#(< (+ |ULTIMATE.start_foo_~i~0#1| 38) ~n~0)} is VALID [2022-02-20 23:44:23,028 INFO L290 TraceCheckUtils]: 74: Hoare triple {13660#(< (+ |ULTIMATE.start_foo_~i~0#1| 39) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {13660#(< (+ |ULTIMATE.start_foo_~i~0#1| 39) ~n~0)} is VALID [2022-02-20 23:44:23,028 INFO L290 TraceCheckUtils]: 73: Hoare triple {13660#(< (+ |ULTIMATE.start_foo_~i~0#1| 39) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {13660#(< (+ |ULTIMATE.start_foo_~i~0#1| 39) ~n~0)} is VALID [2022-02-20 23:44:23,029 INFO L290 TraceCheckUtils]: 72: Hoare triple {13670#(< (+ 40 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {13660#(< (+ |ULTIMATE.start_foo_~i~0#1| 39) ~n~0)} is VALID [2022-02-20 23:44:23,029 INFO L290 TraceCheckUtils]: 71: Hoare triple {13670#(< (+ 40 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {13670#(< (+ 40 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:23,029 INFO L290 TraceCheckUtils]: 70: Hoare triple {13670#(< (+ 40 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {13670#(< (+ 40 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:23,029 INFO L290 TraceCheckUtils]: 69: Hoare triple {13680#(< (+ 41 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {13670#(< (+ 40 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:23,030 INFO L290 TraceCheckUtils]: 68: Hoare triple {13680#(< (+ 41 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {13680#(< (+ 41 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:23,030 INFO L290 TraceCheckUtils]: 67: Hoare triple {13680#(< (+ 41 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {13680#(< (+ 41 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:23,030 INFO L290 TraceCheckUtils]: 66: Hoare triple {13690#(< (+ |ULTIMATE.start_foo_~i~0#1| 42) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {13680#(< (+ 41 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:23,031 INFO L290 TraceCheckUtils]: 65: Hoare triple {13690#(< (+ |ULTIMATE.start_foo_~i~0#1| 42) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {13690#(< (+ |ULTIMATE.start_foo_~i~0#1| 42) ~n~0)} is VALID [2022-02-20 23:44:23,031 INFO L290 TraceCheckUtils]: 64: Hoare triple {13690#(< (+ |ULTIMATE.start_foo_~i~0#1| 42) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {13690#(< (+ |ULTIMATE.start_foo_~i~0#1| 42) ~n~0)} is VALID [2022-02-20 23:44:23,031 INFO L290 TraceCheckUtils]: 63: Hoare triple {13700#(< (+ |ULTIMATE.start_foo_~i~0#1| 43) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {13690#(< (+ |ULTIMATE.start_foo_~i~0#1| 42) ~n~0)} is VALID [2022-02-20 23:44:23,032 INFO L290 TraceCheckUtils]: 62: Hoare triple {13700#(< (+ |ULTIMATE.start_foo_~i~0#1| 43) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {13700#(< (+ |ULTIMATE.start_foo_~i~0#1| 43) ~n~0)} is VALID [2022-02-20 23:44:23,032 INFO L290 TraceCheckUtils]: 61: Hoare triple {13700#(< (+ |ULTIMATE.start_foo_~i~0#1| 43) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {13700#(< (+ |ULTIMATE.start_foo_~i~0#1| 43) ~n~0)} is VALID [2022-02-20 23:44:23,032 INFO L290 TraceCheckUtils]: 60: Hoare triple {13710#(< (+ |ULTIMATE.start_foo_~i~0#1| 44) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {13700#(< (+ |ULTIMATE.start_foo_~i~0#1| 43) ~n~0)} is VALID [2022-02-20 23:44:23,033 INFO L290 TraceCheckUtils]: 59: Hoare triple {13710#(< (+ |ULTIMATE.start_foo_~i~0#1| 44) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {13710#(< (+ |ULTIMATE.start_foo_~i~0#1| 44) ~n~0)} is VALID [2022-02-20 23:44:23,033 INFO L290 TraceCheckUtils]: 58: Hoare triple {13710#(< (+ |ULTIMATE.start_foo_~i~0#1| 44) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {13710#(< (+ |ULTIMATE.start_foo_~i~0#1| 44) ~n~0)} is VALID [2022-02-20 23:44:23,033 INFO L290 TraceCheckUtils]: 57: Hoare triple {13720#(< (+ |ULTIMATE.start_foo_~i~0#1| 45) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {13710#(< (+ |ULTIMATE.start_foo_~i~0#1| 44) ~n~0)} is VALID [2022-02-20 23:44:23,034 INFO L290 TraceCheckUtils]: 56: Hoare triple {13720#(< (+ |ULTIMATE.start_foo_~i~0#1| 45) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {13720#(< (+ |ULTIMATE.start_foo_~i~0#1| 45) ~n~0)} is VALID [2022-02-20 23:44:23,034 INFO L290 TraceCheckUtils]: 55: Hoare triple {13720#(< (+ |ULTIMATE.start_foo_~i~0#1| 45) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {13720#(< (+ |ULTIMATE.start_foo_~i~0#1| 45) ~n~0)} is VALID [2022-02-20 23:44:23,034 INFO L290 TraceCheckUtils]: 54: Hoare triple {13730#(< (+ |ULTIMATE.start_foo_~i~0#1| 46) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {13720#(< (+ |ULTIMATE.start_foo_~i~0#1| 45) ~n~0)} is VALID [2022-02-20 23:44:23,034 INFO L290 TraceCheckUtils]: 53: Hoare triple {13730#(< (+ |ULTIMATE.start_foo_~i~0#1| 46) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {13730#(< (+ |ULTIMATE.start_foo_~i~0#1| 46) ~n~0)} is VALID [2022-02-20 23:44:23,035 INFO L290 TraceCheckUtils]: 52: Hoare triple {13730#(< (+ |ULTIMATE.start_foo_~i~0#1| 46) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {13730#(< (+ |ULTIMATE.start_foo_~i~0#1| 46) ~n~0)} is VALID [2022-02-20 23:44:23,035 INFO L290 TraceCheckUtils]: 51: Hoare triple {13740#(< (+ |ULTIMATE.start_foo_~i~0#1| 47) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {13730#(< (+ |ULTIMATE.start_foo_~i~0#1| 46) ~n~0)} is VALID [2022-02-20 23:44:23,036 INFO L290 TraceCheckUtils]: 50: Hoare triple {13740#(< (+ |ULTIMATE.start_foo_~i~0#1| 47) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {13740#(< (+ |ULTIMATE.start_foo_~i~0#1| 47) ~n~0)} is VALID [2022-02-20 23:44:23,036 INFO L290 TraceCheckUtils]: 49: Hoare triple {13740#(< (+ |ULTIMATE.start_foo_~i~0#1| 47) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {13740#(< (+ |ULTIMATE.start_foo_~i~0#1| 47) ~n~0)} is VALID [2022-02-20 23:44:23,036 INFO L290 TraceCheckUtils]: 48: Hoare triple {13750#(< (+ |ULTIMATE.start_foo_~i~0#1| 48) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {13740#(< (+ |ULTIMATE.start_foo_~i~0#1| 47) ~n~0)} is VALID [2022-02-20 23:44:23,036 INFO L290 TraceCheckUtils]: 47: Hoare triple {13750#(< (+ |ULTIMATE.start_foo_~i~0#1| 48) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {13750#(< (+ |ULTIMATE.start_foo_~i~0#1| 48) ~n~0)} is VALID [2022-02-20 23:44:23,037 INFO L290 TraceCheckUtils]: 46: Hoare triple {13750#(< (+ |ULTIMATE.start_foo_~i~0#1| 48) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {13750#(< (+ |ULTIMATE.start_foo_~i~0#1| 48) ~n~0)} is VALID [2022-02-20 23:44:23,037 INFO L290 TraceCheckUtils]: 45: Hoare triple {13760#(< (+ |ULTIMATE.start_foo_~i~0#1| 49) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {13750#(< (+ |ULTIMATE.start_foo_~i~0#1| 48) ~n~0)} is VALID [2022-02-20 23:44:23,037 INFO L290 TraceCheckUtils]: 44: Hoare triple {13760#(< (+ |ULTIMATE.start_foo_~i~0#1| 49) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {13760#(< (+ |ULTIMATE.start_foo_~i~0#1| 49) ~n~0)} is VALID [2022-02-20 23:44:23,038 INFO L290 TraceCheckUtils]: 43: Hoare triple {13760#(< (+ |ULTIMATE.start_foo_~i~0#1| 49) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {13760#(< (+ |ULTIMATE.start_foo_~i~0#1| 49) ~n~0)} is VALID [2022-02-20 23:44:23,038 INFO L290 TraceCheckUtils]: 42: Hoare triple {13770#(< (+ |ULTIMATE.start_foo_~i~0#1| 50) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {13760#(< (+ |ULTIMATE.start_foo_~i~0#1| 49) ~n~0)} is VALID [2022-02-20 23:44:23,038 INFO L290 TraceCheckUtils]: 41: Hoare triple {13770#(< (+ |ULTIMATE.start_foo_~i~0#1| 50) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {13770#(< (+ |ULTIMATE.start_foo_~i~0#1| 50) ~n~0)} is VALID [2022-02-20 23:44:23,039 INFO L290 TraceCheckUtils]: 40: Hoare triple {13770#(< (+ |ULTIMATE.start_foo_~i~0#1| 50) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {13770#(< (+ |ULTIMATE.start_foo_~i~0#1| 50) ~n~0)} is VALID [2022-02-20 23:44:23,039 INFO L290 TraceCheckUtils]: 39: Hoare triple {13780#(< (+ |ULTIMATE.start_foo_~i~0#1| 51) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {13770#(< (+ |ULTIMATE.start_foo_~i~0#1| 50) ~n~0)} is VALID [2022-02-20 23:44:23,039 INFO L290 TraceCheckUtils]: 38: Hoare triple {13780#(< (+ |ULTIMATE.start_foo_~i~0#1| 51) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {13780#(< (+ |ULTIMATE.start_foo_~i~0#1| 51) ~n~0)} is VALID [2022-02-20 23:44:23,040 INFO L290 TraceCheckUtils]: 37: Hoare triple {13780#(< (+ |ULTIMATE.start_foo_~i~0#1| 51) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {13780#(< (+ |ULTIMATE.start_foo_~i~0#1| 51) ~n~0)} is VALID [2022-02-20 23:44:23,040 INFO L290 TraceCheckUtils]: 36: Hoare triple {13790#(< (+ |ULTIMATE.start_foo_~i~0#1| 52) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {13780#(< (+ |ULTIMATE.start_foo_~i~0#1| 51) ~n~0)} is VALID [2022-02-20 23:44:23,040 INFO L290 TraceCheckUtils]: 35: Hoare triple {13790#(< (+ |ULTIMATE.start_foo_~i~0#1| 52) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {13790#(< (+ |ULTIMATE.start_foo_~i~0#1| 52) ~n~0)} is VALID [2022-02-20 23:44:23,041 INFO L290 TraceCheckUtils]: 34: Hoare triple {13790#(< (+ |ULTIMATE.start_foo_~i~0#1| 52) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {13790#(< (+ |ULTIMATE.start_foo_~i~0#1| 52) ~n~0)} is VALID [2022-02-20 23:44:23,041 INFO L290 TraceCheckUtils]: 33: Hoare triple {13800#(< (+ 53 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {13790#(< (+ |ULTIMATE.start_foo_~i~0#1| 52) ~n~0)} is VALID [2022-02-20 23:44:23,041 INFO L290 TraceCheckUtils]: 32: Hoare triple {13800#(< (+ 53 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {13800#(< (+ 53 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:23,041 INFO L290 TraceCheckUtils]: 31: Hoare triple {13800#(< (+ 53 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {13800#(< (+ 53 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:23,042 INFO L290 TraceCheckUtils]: 30: Hoare triple {13810#(< (+ |ULTIMATE.start_foo_~i~0#1| 54) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {13800#(< (+ 53 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:23,042 INFO L290 TraceCheckUtils]: 29: Hoare triple {13810#(< (+ |ULTIMATE.start_foo_~i~0#1| 54) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {13810#(< (+ |ULTIMATE.start_foo_~i~0#1| 54) ~n~0)} is VALID [2022-02-20 23:44:23,042 INFO L290 TraceCheckUtils]: 28: Hoare triple {13810#(< (+ |ULTIMATE.start_foo_~i~0#1| 54) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {13810#(< (+ |ULTIMATE.start_foo_~i~0#1| 54) ~n~0)} is VALID [2022-02-20 23:44:23,043 INFO L290 TraceCheckUtils]: 27: Hoare triple {13820#(< (+ |ULTIMATE.start_foo_~i~0#1| 55) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {13810#(< (+ |ULTIMATE.start_foo_~i~0#1| 54) ~n~0)} is VALID [2022-02-20 23:44:23,043 INFO L290 TraceCheckUtils]: 26: Hoare triple {13820#(< (+ |ULTIMATE.start_foo_~i~0#1| 55) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {13820#(< (+ |ULTIMATE.start_foo_~i~0#1| 55) ~n~0)} is VALID [2022-02-20 23:44:23,043 INFO L290 TraceCheckUtils]: 25: Hoare triple {13820#(< (+ |ULTIMATE.start_foo_~i~0#1| 55) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {13820#(< (+ |ULTIMATE.start_foo_~i~0#1| 55) ~n~0)} is VALID [2022-02-20 23:44:23,044 INFO L290 TraceCheckUtils]: 24: Hoare triple {13830#(< (+ 56 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {13820#(< (+ |ULTIMATE.start_foo_~i~0#1| 55) ~n~0)} is VALID [2022-02-20 23:44:23,044 INFO L290 TraceCheckUtils]: 23: Hoare triple {13830#(< (+ 56 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {13830#(< (+ 56 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:23,044 INFO L290 TraceCheckUtils]: 22: Hoare triple {13830#(< (+ 56 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {13830#(< (+ 56 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:23,044 INFO L290 TraceCheckUtils]: 21: Hoare triple {13840#(< (+ |ULTIMATE.start_foo_~i~0#1| 57) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {13830#(< (+ 56 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:23,045 INFO L290 TraceCheckUtils]: 20: Hoare triple {13840#(< (+ |ULTIMATE.start_foo_~i~0#1| 57) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {13840#(< (+ |ULTIMATE.start_foo_~i~0#1| 57) ~n~0)} is VALID [2022-02-20 23:44:23,045 INFO L290 TraceCheckUtils]: 19: Hoare triple {13840#(< (+ |ULTIMATE.start_foo_~i~0#1| 57) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {13840#(< (+ |ULTIMATE.start_foo_~i~0#1| 57) ~n~0)} is VALID [2022-02-20 23:44:23,045 INFO L290 TraceCheckUtils]: 18: Hoare triple {13850#(< (+ |ULTIMATE.start_foo_~i~0#1| 58) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {13840#(< (+ |ULTIMATE.start_foo_~i~0#1| 57) ~n~0)} is VALID [2022-02-20 23:44:23,046 INFO L290 TraceCheckUtils]: 17: Hoare triple {13850#(< (+ |ULTIMATE.start_foo_~i~0#1| 58) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {13850#(< (+ |ULTIMATE.start_foo_~i~0#1| 58) ~n~0)} is VALID [2022-02-20 23:44:23,046 INFO L290 TraceCheckUtils]: 16: Hoare triple {13850#(< (+ |ULTIMATE.start_foo_~i~0#1| 58) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {13850#(< (+ |ULTIMATE.start_foo_~i~0#1| 58) ~n~0)} is VALID [2022-02-20 23:44:23,046 INFO L290 TraceCheckUtils]: 15: Hoare triple {13860#(< (+ |ULTIMATE.start_foo_~i~0#1| 59) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {13850#(< (+ |ULTIMATE.start_foo_~i~0#1| 58) ~n~0)} is VALID [2022-02-20 23:44:23,047 INFO L290 TraceCheckUtils]: 14: Hoare triple {13860#(< (+ |ULTIMATE.start_foo_~i~0#1| 59) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {13860#(< (+ |ULTIMATE.start_foo_~i~0#1| 59) ~n~0)} is VALID [2022-02-20 23:44:23,047 INFO L290 TraceCheckUtils]: 13: Hoare triple {13860#(< (+ |ULTIMATE.start_foo_~i~0#1| 59) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {13860#(< (+ |ULTIMATE.start_foo_~i~0#1| 59) ~n~0)} is VALID [2022-02-20 23:44:23,047 INFO L290 TraceCheckUtils]: 12: Hoare triple {13870#(< (+ |ULTIMATE.start_foo_~i~0#1| 60) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {13860#(< (+ |ULTIMATE.start_foo_~i~0#1| 59) ~n~0)} is VALID [2022-02-20 23:44:23,048 INFO L290 TraceCheckUtils]: 11: Hoare triple {13870#(< (+ |ULTIMATE.start_foo_~i~0#1| 60) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {13870#(< (+ |ULTIMATE.start_foo_~i~0#1| 60) ~n~0)} is VALID [2022-02-20 23:44:23,048 INFO L290 TraceCheckUtils]: 10: Hoare triple {13870#(< (+ |ULTIMATE.start_foo_~i~0#1| 60) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {13870#(< (+ |ULTIMATE.start_foo_~i~0#1| 60) ~n~0)} is VALID [2022-02-20 23:44:23,048 INFO L290 TraceCheckUtils]: 9: Hoare triple {13880#(< (+ |ULTIMATE.start_foo_~i~0#1| 61) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {13870#(< (+ |ULTIMATE.start_foo_~i~0#1| 60) ~n~0)} is VALID [2022-02-20 23:44:23,048 INFO L290 TraceCheckUtils]: 8: Hoare triple {13880#(< (+ |ULTIMATE.start_foo_~i~0#1| 61) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {13880#(< (+ |ULTIMATE.start_foo_~i~0#1| 61) ~n~0)} is VALID [2022-02-20 23:44:23,049 INFO L290 TraceCheckUtils]: 7: Hoare triple {13880#(< (+ |ULTIMATE.start_foo_~i~0#1| 61) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {13880#(< (+ |ULTIMATE.start_foo_~i~0#1| 61) ~n~0)} is VALID [2022-02-20 23:44:23,049 INFO L290 TraceCheckUtils]: 6: Hoare triple {13890#(< (+ |ULTIMATE.start_foo_~i~0#1| 62) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {13880#(< (+ |ULTIMATE.start_foo_~i~0#1| 61) ~n~0)} is VALID [2022-02-20 23:44:23,049 INFO L290 TraceCheckUtils]: 5: Hoare triple {13890#(< (+ |ULTIMATE.start_foo_~i~0#1| 62) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {13890#(< (+ |ULTIMATE.start_foo_~i~0#1| 62) ~n~0)} is VALID [2022-02-20 23:44:23,050 INFO L290 TraceCheckUtils]: 4: Hoare triple {13890#(< (+ |ULTIMATE.start_foo_~i~0#1| 62) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {13890#(< (+ |ULTIMATE.start_foo_~i~0#1| 62) ~n~0)} is VALID [2022-02-20 23:44:23,050 INFO L290 TraceCheckUtils]: 3: Hoare triple {13900#(< 62 ~n~0)} havoc main_#t~post7#1.base, main_#t~post7#1.offset;assume { :begin_inline_foo } true;havoc foo_#t~post3#1, foo_#t~post4#1, foo_~i~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {13890#(< (+ |ULTIMATE.start_foo_~i~0#1| 62) ~n~0)} is VALID [2022-02-20 23:44:23,050 INFO L290 TraceCheckUtils]: 2: Hoare triple {13900#(< 62 ~n~0)} SUMMARY for call write~int(0, main_#t~post7#1.base, main_#t~post7#1.offset, 4); srcloc: L538 {13900#(< 62 ~n~0)} is VALID [2022-02-20 23:44:23,051 INFO L290 TraceCheckUtils]: 1: Hoare triple {11993#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~post7#1.base, main_#t~post7#1.offset, main_#t~mem8#1;~n~0 := 32768;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~a~0.base, ~a~0.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~b~0.base, ~b~0.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_#t~post7#1.base, main_#t~post7#1.offset := ~b~0.base, ~b~0.offset;~b~0.base, ~b~0.offset := main_#t~post7#1.base, 4 + main_#t~post7#1.offset; {13900#(< 62 ~n~0)} is VALID [2022-02-20 23:44:23,051 INFO L290 TraceCheckUtils]: 0: Hoare triple {11993#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);~a~0.base, ~a~0.offset := 0, 0;~b~0.base, ~b~0.offset := 0, 0;~n~0 := 0; {11993#true} is VALID [2022-02-20 23:44:23,053 INFO L134 CoverageAnalysis]: Checked inductivity of 7161 backedges. 0 proven. 5735 refuted. 0 times theorem prover too weak. 1426 trivial. 0 not checked. [2022-02-20 23:44:23,054 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440019057] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:44:23,054 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:44:23,054 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 66, 66] total 162 [2022-02-20 23:44:23,054 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718668394] [2022-02-20 23:44:23,054 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:44:23,055 INFO L78 Accepts]: Start accepts. Automaton has has 162 states, 162 states have (on average 3.0555555555555554) internal successors, (495), 162 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 293 [2022-02-20 23:44:23,056 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:23,056 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 162 states, 162 states have (on average 3.0555555555555554) internal successors, (495), 162 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:23,370 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 495 edges. 495 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:23,370 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 162 states [2022-02-20 23:44:23,370 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:44:23,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2022-02-20 23:44:23,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9346, Invalid=16736, Unknown=0, NotChecked=0, Total=26082 [2022-02-20 23:44:23,376 INFO L87 Difference]: Start difference. First operand 305 states and 306 transitions. Second operand has 162 states, 162 states have (on average 3.0555555555555554) internal successors, (495), 162 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:34,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:34,737 INFO L93 Difference]: Finished difference Result 1957 states and 1958 transitions. [2022-02-20 23:44:34,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2022-02-20 23:44:34,738 INFO L78 Accepts]: Start accepts. Automaton has has 162 states, 162 states have (on average 3.0555555555555554) internal successors, (495), 162 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 293 [2022-02-20 23:44:34,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:34,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 162 states have (on average 3.0555555555555554) internal successors, (495), 162 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:34,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 2054 transitions. [2022-02-20 23:44:34,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 162 states have (on average 3.0555555555555554) internal successors, (495), 162 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:34,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 2054 transitions. [2022-02-20 23:44:34,768 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 129 states and 2054 transitions. [2022-02-20 23:44:36,083 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2054 edges. 2054 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:36,177 INFO L225 Difference]: With dead ends: 1957 [2022-02-20 23:44:36,177 INFO L226 Difference]: Without dead ends: 1957 [2022-02-20 23:44:36,181 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 746 GetRequests, 522 SyntacticMatches, 0 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16093 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=17761, Invalid=33089, Unknown=0, NotChecked=0, Total=50850 [2022-02-20 23:44:36,181 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 8519 mSDsluCounter, 1284 mSDsCounter, 0 mSdLazyCounter, 980 mSolverCounterSat, 1025 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8519 SdHoareTripleChecker+Valid, 1307 SdHoareTripleChecker+Invalid, 2005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1025 IncrementalHoareTripleChecker+Valid, 980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:36,181 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8519 Valid, 1307 Invalid, 2005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1025 Valid, 980 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-20 23:44:36,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1957 states. [2022-02-20 23:44:36,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1957 to 593. [2022-02-20 23:44:36,191 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:36,192 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1957 states. Second operand has 593 states, 589 states have (on average 1.0084889643463497) internal successors, (594), 592 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:36,192 INFO L74 IsIncluded]: Start isIncluded. First operand 1957 states. Second operand has 593 states, 589 states have (on average 1.0084889643463497) internal successors, (594), 592 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:36,193 INFO L87 Difference]: Start difference. First operand 1957 states. Second operand has 593 states, 589 states have (on average 1.0084889643463497) internal successors, (594), 592 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:36,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:36,287 INFO L93 Difference]: Finished difference Result 1957 states and 1958 transitions. [2022-02-20 23:44:36,287 INFO L276 IsEmpty]: Start isEmpty. Operand 1957 states and 1958 transitions. [2022-02-20 23:44:36,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:36,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:36,290 INFO L74 IsIncluded]: Start isIncluded. First operand has 593 states, 589 states have (on average 1.0084889643463497) internal successors, (594), 592 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 1957 states. [2022-02-20 23:44:36,290 INFO L87 Difference]: Start difference. First operand has 593 states, 589 states have (on average 1.0084889643463497) internal successors, (594), 592 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 1957 states. [2022-02-20 23:44:36,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:36,383 INFO L93 Difference]: Finished difference Result 1957 states and 1958 transitions. [2022-02-20 23:44:36,383 INFO L276 IsEmpty]: Start isEmpty. Operand 1957 states and 1958 transitions. [2022-02-20 23:44:36,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:36,385 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:36,385 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:36,385 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:36,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 589 states have (on average 1.0084889643463497) internal successors, (594), 592 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:36,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 594 transitions. [2022-02-20 23:44:36,400 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 594 transitions. Word has length 293 [2022-02-20 23:44:36,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:36,400 INFO L470 AbstractCegarLoop]: Abstraction has 593 states and 594 transitions. [2022-02-20 23:44:36,402 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 162 states, 162 states have (on average 3.0555555555555554) internal successors, (495), 162 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:36,402 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 594 transitions. [2022-02-20 23:44:36,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 582 [2022-02-20 23:44:36,407 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:36,408 INFO L514 BasicCegarLoop]: trace histogram [126, 126, 126, 63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:44:36,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-02-20 23:44:36,625 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-02-20 23:44:36,626 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2022-02-20 23:44:36,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:36,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1238151685, now seen corresponding path program 3 times [2022-02-20 23:44:36,626 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:44:36,626 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757506102] [2022-02-20 23:44:36,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:36,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:44:36,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:38,304 INFO L290 TraceCheckUtils]: 0: Hoare triple {20565#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);~a~0.base, ~a~0.offset := 0, 0;~b~0.base, ~b~0.offset := 0, 0;~n~0 := 0; {20565#true} is VALID [2022-02-20 23:44:38,305 INFO L290 TraceCheckUtils]: 1: Hoare triple {20565#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~post7#1.base, main_#t~post7#1.offset, main_#t~mem8#1;~n~0 := 32768;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~a~0.base, ~a~0.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~b~0.base, ~b~0.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_#t~post7#1.base, main_#t~post7#1.offset := ~b~0.base, ~b~0.offset;~b~0.base, ~b~0.offset := main_#t~post7#1.base, 4 + main_#t~post7#1.offset; {20565#true} is VALID [2022-02-20 23:44:38,305 INFO L290 TraceCheckUtils]: 2: Hoare triple {20565#true} SUMMARY for call write~int(0, main_#t~post7#1.base, main_#t~post7#1.offset, 4); srcloc: L538 {20565#true} is VALID [2022-02-20 23:44:38,305 INFO L290 TraceCheckUtils]: 3: Hoare triple {20565#true} havoc main_#t~post7#1.base, main_#t~post7#1.offset;assume { :begin_inline_foo } true;havoc foo_#t~post3#1, foo_#t~post4#1, foo_~i~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {20565#true} is VALID [2022-02-20 23:44:38,305 INFO L290 TraceCheckUtils]: 4: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,305 INFO L290 TraceCheckUtils]: 5: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,305 INFO L290 TraceCheckUtils]: 6: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,305 INFO L290 TraceCheckUtils]: 7: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,305 INFO L290 TraceCheckUtils]: 8: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,305 INFO L290 TraceCheckUtils]: 9: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,305 INFO L290 TraceCheckUtils]: 10: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,305 INFO L290 TraceCheckUtils]: 11: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,305 INFO L290 TraceCheckUtils]: 12: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,305 INFO L290 TraceCheckUtils]: 13: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,305 INFO L290 TraceCheckUtils]: 14: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,305 INFO L290 TraceCheckUtils]: 15: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,305 INFO L290 TraceCheckUtils]: 16: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,305 INFO L290 TraceCheckUtils]: 17: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,305 INFO L290 TraceCheckUtils]: 18: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,305 INFO L290 TraceCheckUtils]: 19: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,305 INFO L290 TraceCheckUtils]: 20: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,305 INFO L290 TraceCheckUtils]: 21: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,305 INFO L290 TraceCheckUtils]: 22: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,306 INFO L290 TraceCheckUtils]: 23: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,306 INFO L290 TraceCheckUtils]: 24: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,306 INFO L290 TraceCheckUtils]: 25: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,306 INFO L290 TraceCheckUtils]: 26: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,306 INFO L290 TraceCheckUtils]: 27: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,306 INFO L290 TraceCheckUtils]: 28: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,306 INFO L290 TraceCheckUtils]: 29: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,306 INFO L290 TraceCheckUtils]: 30: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,306 INFO L290 TraceCheckUtils]: 31: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,306 INFO L290 TraceCheckUtils]: 32: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,306 INFO L290 TraceCheckUtils]: 33: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,306 INFO L290 TraceCheckUtils]: 34: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,306 INFO L290 TraceCheckUtils]: 35: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,306 INFO L290 TraceCheckUtils]: 36: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,306 INFO L290 TraceCheckUtils]: 37: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,306 INFO L290 TraceCheckUtils]: 38: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,306 INFO L290 TraceCheckUtils]: 39: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,306 INFO L290 TraceCheckUtils]: 40: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,306 INFO L290 TraceCheckUtils]: 41: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,306 INFO L290 TraceCheckUtils]: 42: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,306 INFO L290 TraceCheckUtils]: 43: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,306 INFO L290 TraceCheckUtils]: 44: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,306 INFO L290 TraceCheckUtils]: 45: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,306 INFO L290 TraceCheckUtils]: 46: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,307 INFO L290 TraceCheckUtils]: 47: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,307 INFO L290 TraceCheckUtils]: 48: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,307 INFO L290 TraceCheckUtils]: 49: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,307 INFO L290 TraceCheckUtils]: 50: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,307 INFO L290 TraceCheckUtils]: 51: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,307 INFO L290 TraceCheckUtils]: 52: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,307 INFO L290 TraceCheckUtils]: 53: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,307 INFO L290 TraceCheckUtils]: 54: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,307 INFO L290 TraceCheckUtils]: 55: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,307 INFO L290 TraceCheckUtils]: 56: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,307 INFO L290 TraceCheckUtils]: 57: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,307 INFO L290 TraceCheckUtils]: 58: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,307 INFO L290 TraceCheckUtils]: 59: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,307 INFO L290 TraceCheckUtils]: 60: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,307 INFO L290 TraceCheckUtils]: 61: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,307 INFO L290 TraceCheckUtils]: 62: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,307 INFO L290 TraceCheckUtils]: 63: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,307 INFO L290 TraceCheckUtils]: 64: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,307 INFO L290 TraceCheckUtils]: 65: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,307 INFO L290 TraceCheckUtils]: 66: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,307 INFO L290 TraceCheckUtils]: 67: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,307 INFO L290 TraceCheckUtils]: 68: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,307 INFO L290 TraceCheckUtils]: 69: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,307 INFO L290 TraceCheckUtils]: 70: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,308 INFO L290 TraceCheckUtils]: 71: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,308 INFO L290 TraceCheckUtils]: 72: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,308 INFO L290 TraceCheckUtils]: 73: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,308 INFO L290 TraceCheckUtils]: 74: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,308 INFO L290 TraceCheckUtils]: 75: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,308 INFO L290 TraceCheckUtils]: 76: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,308 INFO L290 TraceCheckUtils]: 77: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,308 INFO L290 TraceCheckUtils]: 78: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,308 INFO L290 TraceCheckUtils]: 79: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,308 INFO L290 TraceCheckUtils]: 80: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,308 INFO L290 TraceCheckUtils]: 81: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,308 INFO L290 TraceCheckUtils]: 82: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,308 INFO L290 TraceCheckUtils]: 83: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,308 INFO L290 TraceCheckUtils]: 84: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,308 INFO L290 TraceCheckUtils]: 85: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,308 INFO L290 TraceCheckUtils]: 86: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,308 INFO L290 TraceCheckUtils]: 87: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,308 INFO L290 TraceCheckUtils]: 88: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,308 INFO L290 TraceCheckUtils]: 89: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,308 INFO L290 TraceCheckUtils]: 90: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,308 INFO L290 TraceCheckUtils]: 91: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,308 INFO L290 TraceCheckUtils]: 92: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,308 INFO L290 TraceCheckUtils]: 93: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,308 INFO L290 TraceCheckUtils]: 94: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,309 INFO L290 TraceCheckUtils]: 95: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,309 INFO L290 TraceCheckUtils]: 96: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,309 INFO L290 TraceCheckUtils]: 97: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,309 INFO L290 TraceCheckUtils]: 98: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,309 INFO L290 TraceCheckUtils]: 99: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,309 INFO L290 TraceCheckUtils]: 100: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,309 INFO L290 TraceCheckUtils]: 101: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,309 INFO L290 TraceCheckUtils]: 102: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,309 INFO L290 TraceCheckUtils]: 103: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,309 INFO L290 TraceCheckUtils]: 104: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,309 INFO L290 TraceCheckUtils]: 105: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,309 INFO L290 TraceCheckUtils]: 106: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,309 INFO L290 TraceCheckUtils]: 107: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,309 INFO L290 TraceCheckUtils]: 108: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,309 INFO L290 TraceCheckUtils]: 109: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,309 INFO L290 TraceCheckUtils]: 110: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,309 INFO L290 TraceCheckUtils]: 111: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,309 INFO L290 TraceCheckUtils]: 112: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,309 INFO L290 TraceCheckUtils]: 113: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,309 INFO L290 TraceCheckUtils]: 114: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,309 INFO L290 TraceCheckUtils]: 115: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,309 INFO L290 TraceCheckUtils]: 116: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,309 INFO L290 TraceCheckUtils]: 117: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,309 INFO L290 TraceCheckUtils]: 118: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,310 INFO L290 TraceCheckUtils]: 119: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,310 INFO L290 TraceCheckUtils]: 120: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,310 INFO L290 TraceCheckUtils]: 121: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,310 INFO L290 TraceCheckUtils]: 122: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,310 INFO L290 TraceCheckUtils]: 123: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,310 INFO L290 TraceCheckUtils]: 124: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,310 INFO L290 TraceCheckUtils]: 125: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,310 INFO L290 TraceCheckUtils]: 126: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,310 INFO L290 TraceCheckUtils]: 127: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,310 INFO L290 TraceCheckUtils]: 128: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,310 INFO L290 TraceCheckUtils]: 129: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,310 INFO L290 TraceCheckUtils]: 130: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,310 INFO L290 TraceCheckUtils]: 131: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,310 INFO L290 TraceCheckUtils]: 132: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,310 INFO L290 TraceCheckUtils]: 133: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,310 INFO L290 TraceCheckUtils]: 134: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,310 INFO L290 TraceCheckUtils]: 135: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,310 INFO L290 TraceCheckUtils]: 136: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,310 INFO L290 TraceCheckUtils]: 137: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,310 INFO L290 TraceCheckUtils]: 138: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,310 INFO L290 TraceCheckUtils]: 139: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,310 INFO L290 TraceCheckUtils]: 140: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,310 INFO L290 TraceCheckUtils]: 141: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,310 INFO L290 TraceCheckUtils]: 142: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,310 INFO L290 TraceCheckUtils]: 143: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,311 INFO L290 TraceCheckUtils]: 144: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,311 INFO L290 TraceCheckUtils]: 145: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,311 INFO L290 TraceCheckUtils]: 146: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,311 INFO L290 TraceCheckUtils]: 147: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,311 INFO L290 TraceCheckUtils]: 148: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,311 INFO L290 TraceCheckUtils]: 149: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,311 INFO L290 TraceCheckUtils]: 150: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,311 INFO L290 TraceCheckUtils]: 151: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,311 INFO L290 TraceCheckUtils]: 152: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,311 INFO L290 TraceCheckUtils]: 153: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,311 INFO L290 TraceCheckUtils]: 154: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,311 INFO L290 TraceCheckUtils]: 155: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,311 INFO L290 TraceCheckUtils]: 156: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,311 INFO L290 TraceCheckUtils]: 157: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,311 INFO L290 TraceCheckUtils]: 158: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,311 INFO L290 TraceCheckUtils]: 159: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,311 INFO L290 TraceCheckUtils]: 160: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,311 INFO L290 TraceCheckUtils]: 161: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,311 INFO L290 TraceCheckUtils]: 162: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,311 INFO L290 TraceCheckUtils]: 163: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,311 INFO L290 TraceCheckUtils]: 164: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,311 INFO L290 TraceCheckUtils]: 165: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,311 INFO L290 TraceCheckUtils]: 166: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,311 INFO L290 TraceCheckUtils]: 167: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,312 INFO L290 TraceCheckUtils]: 168: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,312 INFO L290 TraceCheckUtils]: 169: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,312 INFO L290 TraceCheckUtils]: 170: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,312 INFO L290 TraceCheckUtils]: 171: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,312 INFO L290 TraceCheckUtils]: 172: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,312 INFO L290 TraceCheckUtils]: 173: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,312 INFO L290 TraceCheckUtils]: 174: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,312 INFO L290 TraceCheckUtils]: 175: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,312 INFO L290 TraceCheckUtils]: 176: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,312 INFO L290 TraceCheckUtils]: 177: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,312 INFO L290 TraceCheckUtils]: 178: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,312 INFO L290 TraceCheckUtils]: 179: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,312 INFO L290 TraceCheckUtils]: 180: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,312 INFO L290 TraceCheckUtils]: 181: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,312 INFO L290 TraceCheckUtils]: 182: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,312 INFO L290 TraceCheckUtils]: 183: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,312 INFO L290 TraceCheckUtils]: 184: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,312 INFO L290 TraceCheckUtils]: 185: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,312 INFO L290 TraceCheckUtils]: 186: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,312 INFO L290 TraceCheckUtils]: 187: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,312 INFO L290 TraceCheckUtils]: 188: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,312 INFO L290 TraceCheckUtils]: 189: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,312 INFO L290 TraceCheckUtils]: 190: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,312 INFO L290 TraceCheckUtils]: 191: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,313 INFO L290 TraceCheckUtils]: 192: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,313 INFO L290 TraceCheckUtils]: 193: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,313 INFO L290 TraceCheckUtils]: 194: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,313 INFO L290 TraceCheckUtils]: 195: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,313 INFO L290 TraceCheckUtils]: 196: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,313 INFO L290 TraceCheckUtils]: 197: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,313 INFO L290 TraceCheckUtils]: 198: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,313 INFO L290 TraceCheckUtils]: 199: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,313 INFO L290 TraceCheckUtils]: 200: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,313 INFO L290 TraceCheckUtils]: 201: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,313 INFO L290 TraceCheckUtils]: 202: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,313 INFO L290 TraceCheckUtils]: 203: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,313 INFO L290 TraceCheckUtils]: 204: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,313 INFO L290 TraceCheckUtils]: 205: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,313 INFO L290 TraceCheckUtils]: 206: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,313 INFO L290 TraceCheckUtils]: 207: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,313 INFO L290 TraceCheckUtils]: 208: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,313 INFO L290 TraceCheckUtils]: 209: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,313 INFO L290 TraceCheckUtils]: 210: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,313 INFO L290 TraceCheckUtils]: 211: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,313 INFO L290 TraceCheckUtils]: 212: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,313 INFO L290 TraceCheckUtils]: 213: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,314 INFO L290 TraceCheckUtils]: 214: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,314 INFO L290 TraceCheckUtils]: 215: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,314 INFO L290 TraceCheckUtils]: 216: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,314 INFO L290 TraceCheckUtils]: 217: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,314 INFO L290 TraceCheckUtils]: 218: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,314 INFO L290 TraceCheckUtils]: 219: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,314 INFO L290 TraceCheckUtils]: 220: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,314 INFO L290 TraceCheckUtils]: 221: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,314 INFO L290 TraceCheckUtils]: 222: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,314 INFO L290 TraceCheckUtils]: 223: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,315 INFO L290 TraceCheckUtils]: 224: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,315 INFO L290 TraceCheckUtils]: 225: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,315 INFO L290 TraceCheckUtils]: 226: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,315 INFO L290 TraceCheckUtils]: 227: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,315 INFO L290 TraceCheckUtils]: 228: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,315 INFO L290 TraceCheckUtils]: 229: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,315 INFO L290 TraceCheckUtils]: 230: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,315 INFO L290 TraceCheckUtils]: 231: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,315 INFO L290 TraceCheckUtils]: 232: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,315 INFO L290 TraceCheckUtils]: 233: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,315 INFO L290 TraceCheckUtils]: 234: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,316 INFO L290 TraceCheckUtils]: 235: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,316 INFO L290 TraceCheckUtils]: 236: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,316 INFO L290 TraceCheckUtils]: 237: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,316 INFO L290 TraceCheckUtils]: 238: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,316 INFO L290 TraceCheckUtils]: 239: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,316 INFO L290 TraceCheckUtils]: 240: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,316 INFO L290 TraceCheckUtils]: 241: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,316 INFO L290 TraceCheckUtils]: 242: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,316 INFO L290 TraceCheckUtils]: 243: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,316 INFO L290 TraceCheckUtils]: 244: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,317 INFO L290 TraceCheckUtils]: 245: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,317 INFO L290 TraceCheckUtils]: 246: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,317 INFO L290 TraceCheckUtils]: 247: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,317 INFO L290 TraceCheckUtils]: 248: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,317 INFO L290 TraceCheckUtils]: 249: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,317 INFO L290 TraceCheckUtils]: 250: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,317 INFO L290 TraceCheckUtils]: 251: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,317 INFO L290 TraceCheckUtils]: 252: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,317 INFO L290 TraceCheckUtils]: 253: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,317 INFO L290 TraceCheckUtils]: 254: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,318 INFO L290 TraceCheckUtils]: 255: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,318 INFO L290 TraceCheckUtils]: 256: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,318 INFO L290 TraceCheckUtils]: 257: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,318 INFO L290 TraceCheckUtils]: 258: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,318 INFO L290 TraceCheckUtils]: 259: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,318 INFO L290 TraceCheckUtils]: 260: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,318 INFO L290 TraceCheckUtils]: 261: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,318 INFO L290 TraceCheckUtils]: 262: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,318 INFO L290 TraceCheckUtils]: 263: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,318 INFO L290 TraceCheckUtils]: 264: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,318 INFO L290 TraceCheckUtils]: 265: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,319 INFO L290 TraceCheckUtils]: 266: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,319 INFO L290 TraceCheckUtils]: 267: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,319 INFO L290 TraceCheckUtils]: 268: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,319 INFO L290 TraceCheckUtils]: 269: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,319 INFO L290 TraceCheckUtils]: 270: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,319 INFO L290 TraceCheckUtils]: 271: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,319 INFO L290 TraceCheckUtils]: 272: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,319 INFO L290 TraceCheckUtils]: 273: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,319 INFO L290 TraceCheckUtils]: 274: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,319 INFO L290 TraceCheckUtils]: 275: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,320 INFO L290 TraceCheckUtils]: 276: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,320 INFO L290 TraceCheckUtils]: 277: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,320 INFO L290 TraceCheckUtils]: 278: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,320 INFO L290 TraceCheckUtils]: 279: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,320 INFO L290 TraceCheckUtils]: 280: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,320 INFO L290 TraceCheckUtils]: 281: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,320 INFO L290 TraceCheckUtils]: 282: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,320 INFO L290 TraceCheckUtils]: 283: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,320 INFO L290 TraceCheckUtils]: 284: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,320 INFO L290 TraceCheckUtils]: 285: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,320 INFO L290 TraceCheckUtils]: 286: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,320 INFO L290 TraceCheckUtils]: 287: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,320 INFO L290 TraceCheckUtils]: 288: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,320 INFO L290 TraceCheckUtils]: 289: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,320 INFO L290 TraceCheckUtils]: 290: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,320 INFO L290 TraceCheckUtils]: 291: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,320 INFO L290 TraceCheckUtils]: 292: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,320 INFO L290 TraceCheckUtils]: 293: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,320 INFO L290 TraceCheckUtils]: 294: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,321 INFO L290 TraceCheckUtils]: 295: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,321 INFO L290 TraceCheckUtils]: 296: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,321 INFO L290 TraceCheckUtils]: 297: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,321 INFO L290 TraceCheckUtils]: 298: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,321 INFO L290 TraceCheckUtils]: 299: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,321 INFO L290 TraceCheckUtils]: 300: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,321 INFO L290 TraceCheckUtils]: 301: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,321 INFO L290 TraceCheckUtils]: 302: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,321 INFO L290 TraceCheckUtils]: 303: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,321 INFO L290 TraceCheckUtils]: 304: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,321 INFO L290 TraceCheckUtils]: 305: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,321 INFO L290 TraceCheckUtils]: 306: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,321 INFO L290 TraceCheckUtils]: 307: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,321 INFO L290 TraceCheckUtils]: 308: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,321 INFO L290 TraceCheckUtils]: 309: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,321 INFO L290 TraceCheckUtils]: 310: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,321 INFO L290 TraceCheckUtils]: 311: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,321 INFO L290 TraceCheckUtils]: 312: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,321 INFO L290 TraceCheckUtils]: 313: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,321 INFO L290 TraceCheckUtils]: 314: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,321 INFO L290 TraceCheckUtils]: 315: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,321 INFO L290 TraceCheckUtils]: 316: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,321 INFO L290 TraceCheckUtils]: 317: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,321 INFO L290 TraceCheckUtils]: 318: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,322 INFO L290 TraceCheckUtils]: 319: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,322 INFO L290 TraceCheckUtils]: 320: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,322 INFO L290 TraceCheckUtils]: 321: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,322 INFO L290 TraceCheckUtils]: 322: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,322 INFO L290 TraceCheckUtils]: 323: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,322 INFO L290 TraceCheckUtils]: 324: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,322 INFO L290 TraceCheckUtils]: 325: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,322 INFO L290 TraceCheckUtils]: 326: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,322 INFO L290 TraceCheckUtils]: 327: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,322 INFO L290 TraceCheckUtils]: 328: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,322 INFO L290 TraceCheckUtils]: 329: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,322 INFO L290 TraceCheckUtils]: 330: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,322 INFO L290 TraceCheckUtils]: 331: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,322 INFO L290 TraceCheckUtils]: 332: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,322 INFO L290 TraceCheckUtils]: 333: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,322 INFO L290 TraceCheckUtils]: 334: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,322 INFO L290 TraceCheckUtils]: 335: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,322 INFO L290 TraceCheckUtils]: 336: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,322 INFO L290 TraceCheckUtils]: 337: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,322 INFO L290 TraceCheckUtils]: 338: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,322 INFO L290 TraceCheckUtils]: 339: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,322 INFO L290 TraceCheckUtils]: 340: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,322 INFO L290 TraceCheckUtils]: 341: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,323 INFO L290 TraceCheckUtils]: 342: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,323 INFO L290 TraceCheckUtils]: 343: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,323 INFO L290 TraceCheckUtils]: 344: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,323 INFO L290 TraceCheckUtils]: 345: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,323 INFO L290 TraceCheckUtils]: 346: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,323 INFO L290 TraceCheckUtils]: 347: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,323 INFO L290 TraceCheckUtils]: 348: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,323 INFO L290 TraceCheckUtils]: 349: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,323 INFO L290 TraceCheckUtils]: 350: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,323 INFO L290 TraceCheckUtils]: 351: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,323 INFO L290 TraceCheckUtils]: 352: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,323 INFO L290 TraceCheckUtils]: 353: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,323 INFO L290 TraceCheckUtils]: 354: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,323 INFO L290 TraceCheckUtils]: 355: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,323 INFO L290 TraceCheckUtils]: 356: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,323 INFO L290 TraceCheckUtils]: 357: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,323 INFO L290 TraceCheckUtils]: 358: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,323 INFO L290 TraceCheckUtils]: 359: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,323 INFO L290 TraceCheckUtils]: 360: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,323 INFO L290 TraceCheckUtils]: 361: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,323 INFO L290 TraceCheckUtils]: 362: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,323 INFO L290 TraceCheckUtils]: 363: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,323 INFO L290 TraceCheckUtils]: 364: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,323 INFO L290 TraceCheckUtils]: 365: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,323 INFO L290 TraceCheckUtils]: 366: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,324 INFO L290 TraceCheckUtils]: 367: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,324 INFO L290 TraceCheckUtils]: 368: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,324 INFO L290 TraceCheckUtils]: 369: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,324 INFO L290 TraceCheckUtils]: 370: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,324 INFO L290 TraceCheckUtils]: 371: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,324 INFO L290 TraceCheckUtils]: 372: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,324 INFO L290 TraceCheckUtils]: 373: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,324 INFO L290 TraceCheckUtils]: 374: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,324 INFO L290 TraceCheckUtils]: 375: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,324 INFO L290 TraceCheckUtils]: 376: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,324 INFO L290 TraceCheckUtils]: 377: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,324 INFO L290 TraceCheckUtils]: 378: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,324 INFO L290 TraceCheckUtils]: 379: Hoare triple {20565#true} assume !!(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,324 INFO L290 TraceCheckUtils]: 380: Hoare triple {20565#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {20565#true} is VALID [2022-02-20 23:44:38,324 INFO L290 TraceCheckUtils]: 381: Hoare triple {20565#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {20565#true} is VALID [2022-02-20 23:44:38,324 INFO L290 TraceCheckUtils]: 382: Hoare triple {20565#true} assume !(foo_~i~0#1 < ~n~0); {20565#true} is VALID [2022-02-20 23:44:38,324 INFO L290 TraceCheckUtils]: 383: Hoare triple {20565#true} foo_~i~0#1 := 0; {20567#(= |ULTIMATE.start_foo_~i~0#1| 0)} is VALID [2022-02-20 23:44:38,325 INFO L290 TraceCheckUtils]: 384: Hoare triple {20567#(= |ULTIMATE.start_foo_~i~0#1| 0)} assume !!(foo_~i~0#1 < 32767); {20567#(= |ULTIMATE.start_foo_~i~0#1| 0)} is VALID [2022-02-20 23:44:38,325 INFO L290 TraceCheckUtils]: 385: Hoare triple {20567#(= |ULTIMATE.start_foo_~i~0#1| 0)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {20567#(= |ULTIMATE.start_foo_~i~0#1| 0)} is VALID [2022-02-20 23:44:38,325 INFO L290 TraceCheckUtils]: 386: Hoare triple {20567#(= |ULTIMATE.start_foo_~i~0#1| 0)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {20568#(<= |ULTIMATE.start_foo_~i~0#1| 1)} is VALID [2022-02-20 23:44:38,325 INFO L290 TraceCheckUtils]: 387: Hoare triple {20568#(<= |ULTIMATE.start_foo_~i~0#1| 1)} assume !!(foo_~i~0#1 < 32767); {20568#(<= |ULTIMATE.start_foo_~i~0#1| 1)} is VALID [2022-02-20 23:44:38,326 INFO L290 TraceCheckUtils]: 388: Hoare triple {20568#(<= |ULTIMATE.start_foo_~i~0#1| 1)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {20568#(<= |ULTIMATE.start_foo_~i~0#1| 1)} is VALID [2022-02-20 23:44:38,326 INFO L290 TraceCheckUtils]: 389: Hoare triple {20568#(<= |ULTIMATE.start_foo_~i~0#1| 1)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {20569#(<= |ULTIMATE.start_foo_~i~0#1| 2)} is VALID [2022-02-20 23:44:38,326 INFO L290 TraceCheckUtils]: 390: Hoare triple {20569#(<= |ULTIMATE.start_foo_~i~0#1| 2)} assume !!(foo_~i~0#1 < 32767); {20569#(<= |ULTIMATE.start_foo_~i~0#1| 2)} is VALID [2022-02-20 23:44:38,327 INFO L290 TraceCheckUtils]: 391: Hoare triple {20569#(<= |ULTIMATE.start_foo_~i~0#1| 2)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {20569#(<= |ULTIMATE.start_foo_~i~0#1| 2)} is VALID [2022-02-20 23:44:38,327 INFO L290 TraceCheckUtils]: 392: Hoare triple {20569#(<= |ULTIMATE.start_foo_~i~0#1| 2)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {20570#(<= |ULTIMATE.start_foo_~i~0#1| 3)} is VALID [2022-02-20 23:44:38,327 INFO L290 TraceCheckUtils]: 393: Hoare triple {20570#(<= |ULTIMATE.start_foo_~i~0#1| 3)} assume !!(foo_~i~0#1 < 32767); {20570#(<= |ULTIMATE.start_foo_~i~0#1| 3)} is VALID [2022-02-20 23:44:38,327 INFO L290 TraceCheckUtils]: 394: Hoare triple {20570#(<= |ULTIMATE.start_foo_~i~0#1| 3)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {20570#(<= |ULTIMATE.start_foo_~i~0#1| 3)} is VALID [2022-02-20 23:44:38,328 INFO L290 TraceCheckUtils]: 395: Hoare triple {20570#(<= |ULTIMATE.start_foo_~i~0#1| 3)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {20571#(<= |ULTIMATE.start_foo_~i~0#1| 4)} is VALID [2022-02-20 23:44:38,328 INFO L290 TraceCheckUtils]: 396: Hoare triple {20571#(<= |ULTIMATE.start_foo_~i~0#1| 4)} assume !!(foo_~i~0#1 < 32767); {20571#(<= |ULTIMATE.start_foo_~i~0#1| 4)} is VALID [2022-02-20 23:44:38,328 INFO L290 TraceCheckUtils]: 397: Hoare triple {20571#(<= |ULTIMATE.start_foo_~i~0#1| 4)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {20571#(<= |ULTIMATE.start_foo_~i~0#1| 4)} is VALID [2022-02-20 23:44:38,328 INFO L290 TraceCheckUtils]: 398: Hoare triple {20571#(<= |ULTIMATE.start_foo_~i~0#1| 4)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {20572#(<= |ULTIMATE.start_foo_~i~0#1| 5)} is VALID [2022-02-20 23:44:38,329 INFO L290 TraceCheckUtils]: 399: Hoare triple {20572#(<= |ULTIMATE.start_foo_~i~0#1| 5)} assume !!(foo_~i~0#1 < 32767); {20572#(<= |ULTIMATE.start_foo_~i~0#1| 5)} is VALID [2022-02-20 23:44:38,329 INFO L290 TraceCheckUtils]: 400: Hoare triple {20572#(<= |ULTIMATE.start_foo_~i~0#1| 5)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {20572#(<= |ULTIMATE.start_foo_~i~0#1| 5)} is VALID [2022-02-20 23:44:38,329 INFO L290 TraceCheckUtils]: 401: Hoare triple {20572#(<= |ULTIMATE.start_foo_~i~0#1| 5)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {20573#(<= |ULTIMATE.start_foo_~i~0#1| 6)} is VALID [2022-02-20 23:44:38,329 INFO L290 TraceCheckUtils]: 402: Hoare triple {20573#(<= |ULTIMATE.start_foo_~i~0#1| 6)} assume !!(foo_~i~0#1 < 32767); {20573#(<= |ULTIMATE.start_foo_~i~0#1| 6)} is VALID [2022-02-20 23:44:38,330 INFO L290 TraceCheckUtils]: 403: Hoare triple {20573#(<= |ULTIMATE.start_foo_~i~0#1| 6)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {20573#(<= |ULTIMATE.start_foo_~i~0#1| 6)} is VALID [2022-02-20 23:44:38,330 INFO L290 TraceCheckUtils]: 404: Hoare triple {20573#(<= |ULTIMATE.start_foo_~i~0#1| 6)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {20574#(<= |ULTIMATE.start_foo_~i~0#1| 7)} is VALID [2022-02-20 23:44:38,330 INFO L290 TraceCheckUtils]: 405: Hoare triple {20574#(<= |ULTIMATE.start_foo_~i~0#1| 7)} assume !!(foo_~i~0#1 < 32767); {20574#(<= |ULTIMATE.start_foo_~i~0#1| 7)} is VALID [2022-02-20 23:44:38,331 INFO L290 TraceCheckUtils]: 406: Hoare triple {20574#(<= |ULTIMATE.start_foo_~i~0#1| 7)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {20574#(<= |ULTIMATE.start_foo_~i~0#1| 7)} is VALID [2022-02-20 23:44:38,331 INFO L290 TraceCheckUtils]: 407: Hoare triple {20574#(<= |ULTIMATE.start_foo_~i~0#1| 7)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {20575#(<= |ULTIMATE.start_foo_~i~0#1| 8)} is VALID [2022-02-20 23:44:38,331 INFO L290 TraceCheckUtils]: 408: Hoare triple {20575#(<= |ULTIMATE.start_foo_~i~0#1| 8)} assume !!(foo_~i~0#1 < 32767); {20575#(<= |ULTIMATE.start_foo_~i~0#1| 8)} is VALID [2022-02-20 23:44:38,331 INFO L290 TraceCheckUtils]: 409: Hoare triple {20575#(<= |ULTIMATE.start_foo_~i~0#1| 8)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {20575#(<= |ULTIMATE.start_foo_~i~0#1| 8)} is VALID [2022-02-20 23:44:38,332 INFO L290 TraceCheckUtils]: 410: Hoare triple {20575#(<= |ULTIMATE.start_foo_~i~0#1| 8)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {20576#(<= |ULTIMATE.start_foo_~i~0#1| 9)} is VALID [2022-02-20 23:44:38,332 INFO L290 TraceCheckUtils]: 411: Hoare triple {20576#(<= |ULTIMATE.start_foo_~i~0#1| 9)} assume !!(foo_~i~0#1 < 32767); {20576#(<= |ULTIMATE.start_foo_~i~0#1| 9)} is VALID [2022-02-20 23:44:38,332 INFO L290 TraceCheckUtils]: 412: Hoare triple {20576#(<= |ULTIMATE.start_foo_~i~0#1| 9)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {20576#(<= |ULTIMATE.start_foo_~i~0#1| 9)} is VALID [2022-02-20 23:44:38,332 INFO L290 TraceCheckUtils]: 413: Hoare triple {20576#(<= |ULTIMATE.start_foo_~i~0#1| 9)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {20577#(<= |ULTIMATE.start_foo_~i~0#1| 10)} is VALID [2022-02-20 23:44:38,333 INFO L290 TraceCheckUtils]: 414: Hoare triple {20577#(<= |ULTIMATE.start_foo_~i~0#1| 10)} assume !!(foo_~i~0#1 < 32767); {20577#(<= |ULTIMATE.start_foo_~i~0#1| 10)} is VALID [2022-02-20 23:44:38,333 INFO L290 TraceCheckUtils]: 415: Hoare triple {20577#(<= |ULTIMATE.start_foo_~i~0#1| 10)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {20577#(<= |ULTIMATE.start_foo_~i~0#1| 10)} is VALID [2022-02-20 23:44:38,333 INFO L290 TraceCheckUtils]: 416: Hoare triple {20577#(<= |ULTIMATE.start_foo_~i~0#1| 10)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {20578#(<= |ULTIMATE.start_foo_~i~0#1| 11)} is VALID [2022-02-20 23:44:38,333 INFO L290 TraceCheckUtils]: 417: Hoare triple {20578#(<= |ULTIMATE.start_foo_~i~0#1| 11)} assume !!(foo_~i~0#1 < 32767); {20578#(<= |ULTIMATE.start_foo_~i~0#1| 11)} is VALID [2022-02-20 23:44:38,334 INFO L290 TraceCheckUtils]: 418: Hoare triple {20578#(<= |ULTIMATE.start_foo_~i~0#1| 11)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {20578#(<= |ULTIMATE.start_foo_~i~0#1| 11)} is VALID [2022-02-20 23:44:38,334 INFO L290 TraceCheckUtils]: 419: Hoare triple {20578#(<= |ULTIMATE.start_foo_~i~0#1| 11)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {20579#(<= |ULTIMATE.start_foo_~i~0#1| 12)} is VALID [2022-02-20 23:44:38,334 INFO L290 TraceCheckUtils]: 420: Hoare triple {20579#(<= |ULTIMATE.start_foo_~i~0#1| 12)} assume !!(foo_~i~0#1 < 32767); {20579#(<= |ULTIMATE.start_foo_~i~0#1| 12)} is VALID [2022-02-20 23:44:38,334 INFO L290 TraceCheckUtils]: 421: Hoare triple {20579#(<= |ULTIMATE.start_foo_~i~0#1| 12)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {20579#(<= |ULTIMATE.start_foo_~i~0#1| 12)} is VALID [2022-02-20 23:44:38,335 INFO L290 TraceCheckUtils]: 422: Hoare triple {20579#(<= |ULTIMATE.start_foo_~i~0#1| 12)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {20580#(<= |ULTIMATE.start_foo_~i~0#1| 13)} is VALID [2022-02-20 23:44:38,335 INFO L290 TraceCheckUtils]: 423: Hoare triple {20580#(<= |ULTIMATE.start_foo_~i~0#1| 13)} assume !!(foo_~i~0#1 < 32767); {20580#(<= |ULTIMATE.start_foo_~i~0#1| 13)} is VALID [2022-02-20 23:44:38,335 INFO L290 TraceCheckUtils]: 424: Hoare triple {20580#(<= |ULTIMATE.start_foo_~i~0#1| 13)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {20580#(<= |ULTIMATE.start_foo_~i~0#1| 13)} is VALID [2022-02-20 23:44:38,336 INFO L290 TraceCheckUtils]: 425: Hoare triple {20580#(<= |ULTIMATE.start_foo_~i~0#1| 13)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {20581#(<= |ULTIMATE.start_foo_~i~0#1| 14)} is VALID [2022-02-20 23:44:38,336 INFO L290 TraceCheckUtils]: 426: Hoare triple {20581#(<= |ULTIMATE.start_foo_~i~0#1| 14)} assume !!(foo_~i~0#1 < 32767); {20581#(<= |ULTIMATE.start_foo_~i~0#1| 14)} is VALID [2022-02-20 23:44:38,336 INFO L290 TraceCheckUtils]: 427: Hoare triple {20581#(<= |ULTIMATE.start_foo_~i~0#1| 14)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {20581#(<= |ULTIMATE.start_foo_~i~0#1| 14)} is VALID [2022-02-20 23:44:38,336 INFO L290 TraceCheckUtils]: 428: Hoare triple {20581#(<= |ULTIMATE.start_foo_~i~0#1| 14)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {20582#(<= |ULTIMATE.start_foo_~i~0#1| 15)} is VALID [2022-02-20 23:44:38,337 INFO L290 TraceCheckUtils]: 429: Hoare triple {20582#(<= |ULTIMATE.start_foo_~i~0#1| 15)} assume !!(foo_~i~0#1 < 32767); {20582#(<= |ULTIMATE.start_foo_~i~0#1| 15)} is VALID [2022-02-20 23:44:38,337 INFO L290 TraceCheckUtils]: 430: Hoare triple {20582#(<= |ULTIMATE.start_foo_~i~0#1| 15)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {20582#(<= |ULTIMATE.start_foo_~i~0#1| 15)} is VALID [2022-02-20 23:44:38,337 INFO L290 TraceCheckUtils]: 431: Hoare triple {20582#(<= |ULTIMATE.start_foo_~i~0#1| 15)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {20583#(<= |ULTIMATE.start_foo_~i~0#1| 16)} is VALID [2022-02-20 23:44:38,337 INFO L290 TraceCheckUtils]: 432: Hoare triple {20583#(<= |ULTIMATE.start_foo_~i~0#1| 16)} assume !!(foo_~i~0#1 < 32767); {20583#(<= |ULTIMATE.start_foo_~i~0#1| 16)} is VALID [2022-02-20 23:44:38,338 INFO L290 TraceCheckUtils]: 433: Hoare triple {20583#(<= |ULTIMATE.start_foo_~i~0#1| 16)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {20583#(<= |ULTIMATE.start_foo_~i~0#1| 16)} is VALID [2022-02-20 23:44:38,338 INFO L290 TraceCheckUtils]: 434: Hoare triple {20583#(<= |ULTIMATE.start_foo_~i~0#1| 16)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {20584#(<= |ULTIMATE.start_foo_~i~0#1| 17)} is VALID [2022-02-20 23:44:38,338 INFO L290 TraceCheckUtils]: 435: Hoare triple {20584#(<= |ULTIMATE.start_foo_~i~0#1| 17)} assume !!(foo_~i~0#1 < 32767); {20584#(<= |ULTIMATE.start_foo_~i~0#1| 17)} is VALID [2022-02-20 23:44:38,338 INFO L290 TraceCheckUtils]: 436: Hoare triple {20584#(<= |ULTIMATE.start_foo_~i~0#1| 17)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {20584#(<= |ULTIMATE.start_foo_~i~0#1| 17)} is VALID [2022-02-20 23:44:38,339 INFO L290 TraceCheckUtils]: 437: Hoare triple {20584#(<= |ULTIMATE.start_foo_~i~0#1| 17)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {20585#(<= |ULTIMATE.start_foo_~i~0#1| 18)} is VALID [2022-02-20 23:44:38,339 INFO L290 TraceCheckUtils]: 438: Hoare triple {20585#(<= |ULTIMATE.start_foo_~i~0#1| 18)} assume !!(foo_~i~0#1 < 32767); {20585#(<= |ULTIMATE.start_foo_~i~0#1| 18)} is VALID [2022-02-20 23:44:38,339 INFO L290 TraceCheckUtils]: 439: Hoare triple {20585#(<= |ULTIMATE.start_foo_~i~0#1| 18)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {20585#(<= |ULTIMATE.start_foo_~i~0#1| 18)} is VALID [2022-02-20 23:44:38,339 INFO L290 TraceCheckUtils]: 440: Hoare triple {20585#(<= |ULTIMATE.start_foo_~i~0#1| 18)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {20586#(<= |ULTIMATE.start_foo_~i~0#1| 19)} is VALID [2022-02-20 23:44:38,340 INFO L290 TraceCheckUtils]: 441: Hoare triple {20586#(<= |ULTIMATE.start_foo_~i~0#1| 19)} assume !!(foo_~i~0#1 < 32767); {20586#(<= |ULTIMATE.start_foo_~i~0#1| 19)} is VALID [2022-02-20 23:44:38,340 INFO L290 TraceCheckUtils]: 442: Hoare triple {20586#(<= |ULTIMATE.start_foo_~i~0#1| 19)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {20586#(<= |ULTIMATE.start_foo_~i~0#1| 19)} is VALID [2022-02-20 23:44:38,340 INFO L290 TraceCheckUtils]: 443: Hoare triple {20586#(<= |ULTIMATE.start_foo_~i~0#1| 19)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {20587#(<= |ULTIMATE.start_foo_~i~0#1| 20)} is VALID [2022-02-20 23:44:38,340 INFO L290 TraceCheckUtils]: 444: Hoare triple {20587#(<= |ULTIMATE.start_foo_~i~0#1| 20)} assume !!(foo_~i~0#1 < 32767); {20587#(<= |ULTIMATE.start_foo_~i~0#1| 20)} is VALID [2022-02-20 23:44:38,341 INFO L290 TraceCheckUtils]: 445: Hoare triple {20587#(<= |ULTIMATE.start_foo_~i~0#1| 20)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {20587#(<= |ULTIMATE.start_foo_~i~0#1| 20)} is VALID [2022-02-20 23:44:38,341 INFO L290 TraceCheckUtils]: 446: Hoare triple {20587#(<= |ULTIMATE.start_foo_~i~0#1| 20)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {20588#(<= |ULTIMATE.start_foo_~i~0#1| 21)} is VALID [2022-02-20 23:44:38,341 INFO L290 TraceCheckUtils]: 447: Hoare triple {20588#(<= |ULTIMATE.start_foo_~i~0#1| 21)} assume !!(foo_~i~0#1 < 32767); {20588#(<= |ULTIMATE.start_foo_~i~0#1| 21)} is VALID [2022-02-20 23:44:38,341 INFO L290 TraceCheckUtils]: 448: Hoare triple {20588#(<= |ULTIMATE.start_foo_~i~0#1| 21)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {20588#(<= |ULTIMATE.start_foo_~i~0#1| 21)} is VALID [2022-02-20 23:44:38,342 INFO L290 TraceCheckUtils]: 449: Hoare triple {20588#(<= |ULTIMATE.start_foo_~i~0#1| 21)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {20589#(<= |ULTIMATE.start_foo_~i~0#1| 22)} is VALID [2022-02-20 23:44:38,342 INFO L290 TraceCheckUtils]: 450: Hoare triple {20589#(<= |ULTIMATE.start_foo_~i~0#1| 22)} assume !!(foo_~i~0#1 < 32767); {20589#(<= |ULTIMATE.start_foo_~i~0#1| 22)} is VALID [2022-02-20 23:44:38,342 INFO L290 TraceCheckUtils]: 451: Hoare triple {20589#(<= |ULTIMATE.start_foo_~i~0#1| 22)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {20589#(<= |ULTIMATE.start_foo_~i~0#1| 22)} is VALID [2022-02-20 23:44:38,343 INFO L290 TraceCheckUtils]: 452: Hoare triple {20589#(<= |ULTIMATE.start_foo_~i~0#1| 22)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {20590#(<= |ULTIMATE.start_foo_~i~0#1| 23)} is VALID [2022-02-20 23:44:38,343 INFO L290 TraceCheckUtils]: 453: Hoare triple {20590#(<= |ULTIMATE.start_foo_~i~0#1| 23)} assume !!(foo_~i~0#1 < 32767); {20590#(<= |ULTIMATE.start_foo_~i~0#1| 23)} is VALID [2022-02-20 23:44:38,343 INFO L290 TraceCheckUtils]: 454: Hoare triple {20590#(<= |ULTIMATE.start_foo_~i~0#1| 23)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {20590#(<= |ULTIMATE.start_foo_~i~0#1| 23)} is VALID [2022-02-20 23:44:38,343 INFO L290 TraceCheckUtils]: 455: Hoare triple {20590#(<= |ULTIMATE.start_foo_~i~0#1| 23)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {20591#(<= |ULTIMATE.start_foo_~i~0#1| 24)} is VALID [2022-02-20 23:44:38,344 INFO L290 TraceCheckUtils]: 456: Hoare triple {20591#(<= |ULTIMATE.start_foo_~i~0#1| 24)} assume !!(foo_~i~0#1 < 32767); {20591#(<= |ULTIMATE.start_foo_~i~0#1| 24)} is VALID [2022-02-20 23:44:38,344 INFO L290 TraceCheckUtils]: 457: Hoare triple {20591#(<= |ULTIMATE.start_foo_~i~0#1| 24)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {20591#(<= |ULTIMATE.start_foo_~i~0#1| 24)} is VALID [2022-02-20 23:44:38,344 INFO L290 TraceCheckUtils]: 458: Hoare triple {20591#(<= |ULTIMATE.start_foo_~i~0#1| 24)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {20592#(<= |ULTIMATE.start_foo_~i~0#1| 25)} is VALID [2022-02-20 23:44:38,344 INFO L290 TraceCheckUtils]: 459: Hoare triple {20592#(<= |ULTIMATE.start_foo_~i~0#1| 25)} assume !!(foo_~i~0#1 < 32767); {20592#(<= |ULTIMATE.start_foo_~i~0#1| 25)} is VALID [2022-02-20 23:44:38,345 INFO L290 TraceCheckUtils]: 460: Hoare triple {20592#(<= |ULTIMATE.start_foo_~i~0#1| 25)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {20592#(<= |ULTIMATE.start_foo_~i~0#1| 25)} is VALID [2022-02-20 23:44:38,345 INFO L290 TraceCheckUtils]: 461: Hoare triple {20592#(<= |ULTIMATE.start_foo_~i~0#1| 25)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {20593#(<= |ULTIMATE.start_foo_~i~0#1| 26)} is VALID [2022-02-20 23:44:38,345 INFO L290 TraceCheckUtils]: 462: Hoare triple {20593#(<= |ULTIMATE.start_foo_~i~0#1| 26)} assume !!(foo_~i~0#1 < 32767); {20593#(<= |ULTIMATE.start_foo_~i~0#1| 26)} is VALID [2022-02-20 23:44:38,345 INFO L290 TraceCheckUtils]: 463: Hoare triple {20593#(<= |ULTIMATE.start_foo_~i~0#1| 26)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {20593#(<= |ULTIMATE.start_foo_~i~0#1| 26)} is VALID [2022-02-20 23:44:38,346 INFO L290 TraceCheckUtils]: 464: Hoare triple {20593#(<= |ULTIMATE.start_foo_~i~0#1| 26)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {20594#(<= |ULTIMATE.start_foo_~i~0#1| 27)} is VALID [2022-02-20 23:44:38,346 INFO L290 TraceCheckUtils]: 465: Hoare triple {20594#(<= |ULTIMATE.start_foo_~i~0#1| 27)} assume !!(foo_~i~0#1 < 32767); {20594#(<= |ULTIMATE.start_foo_~i~0#1| 27)} is VALID [2022-02-20 23:44:38,346 INFO L290 TraceCheckUtils]: 466: Hoare triple {20594#(<= |ULTIMATE.start_foo_~i~0#1| 27)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {20594#(<= |ULTIMATE.start_foo_~i~0#1| 27)} is VALID [2022-02-20 23:44:38,346 INFO L290 TraceCheckUtils]: 467: Hoare triple {20594#(<= |ULTIMATE.start_foo_~i~0#1| 27)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {20595#(<= |ULTIMATE.start_foo_~i~0#1| 28)} is VALID [2022-02-20 23:44:38,347 INFO L290 TraceCheckUtils]: 468: Hoare triple {20595#(<= |ULTIMATE.start_foo_~i~0#1| 28)} assume !!(foo_~i~0#1 < 32767); {20595#(<= |ULTIMATE.start_foo_~i~0#1| 28)} is VALID [2022-02-20 23:44:38,347 INFO L290 TraceCheckUtils]: 469: Hoare triple {20595#(<= |ULTIMATE.start_foo_~i~0#1| 28)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {20595#(<= |ULTIMATE.start_foo_~i~0#1| 28)} is VALID [2022-02-20 23:44:38,347 INFO L290 TraceCheckUtils]: 470: Hoare triple {20595#(<= |ULTIMATE.start_foo_~i~0#1| 28)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {20596#(<= |ULTIMATE.start_foo_~i~0#1| 29)} is VALID [2022-02-20 23:44:38,347 INFO L290 TraceCheckUtils]: 471: Hoare triple {20596#(<= |ULTIMATE.start_foo_~i~0#1| 29)} assume !!(foo_~i~0#1 < 32767); {20596#(<= |ULTIMATE.start_foo_~i~0#1| 29)} is VALID [2022-02-20 23:44:38,348 INFO L290 TraceCheckUtils]: 472: Hoare triple {20596#(<= |ULTIMATE.start_foo_~i~0#1| 29)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {20596#(<= |ULTIMATE.start_foo_~i~0#1| 29)} is VALID [2022-02-20 23:44:38,348 INFO L290 TraceCheckUtils]: 473: Hoare triple {20596#(<= |ULTIMATE.start_foo_~i~0#1| 29)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {20597#(<= |ULTIMATE.start_foo_~i~0#1| 30)} is VALID [2022-02-20 23:44:38,348 INFO L290 TraceCheckUtils]: 474: Hoare triple {20597#(<= |ULTIMATE.start_foo_~i~0#1| 30)} assume !!(foo_~i~0#1 < 32767); {20597#(<= |ULTIMATE.start_foo_~i~0#1| 30)} is VALID [2022-02-20 23:44:38,348 INFO L290 TraceCheckUtils]: 475: Hoare triple {20597#(<= |ULTIMATE.start_foo_~i~0#1| 30)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {20597#(<= |ULTIMATE.start_foo_~i~0#1| 30)} is VALID [2022-02-20 23:44:38,349 INFO L290 TraceCheckUtils]: 476: Hoare triple {20597#(<= |ULTIMATE.start_foo_~i~0#1| 30)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {20598#(<= |ULTIMATE.start_foo_~i~0#1| 31)} is VALID [2022-02-20 23:44:38,349 INFO L290 TraceCheckUtils]: 477: Hoare triple {20598#(<= |ULTIMATE.start_foo_~i~0#1| 31)} assume !!(foo_~i~0#1 < 32767); {20598#(<= |ULTIMATE.start_foo_~i~0#1| 31)} is VALID [2022-02-20 23:44:38,349 INFO L290 TraceCheckUtils]: 478: Hoare triple {20598#(<= |ULTIMATE.start_foo_~i~0#1| 31)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {20598#(<= |ULTIMATE.start_foo_~i~0#1| 31)} is VALID [2022-02-20 23:44:38,350 INFO L290 TraceCheckUtils]: 479: Hoare triple {20598#(<= |ULTIMATE.start_foo_~i~0#1| 31)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {20599#(<= |ULTIMATE.start_foo_~i~0#1| 32)} is VALID [2022-02-20 23:44:38,350 INFO L290 TraceCheckUtils]: 480: Hoare triple {20599#(<= |ULTIMATE.start_foo_~i~0#1| 32)} assume !!(foo_~i~0#1 < 32767); {20599#(<= |ULTIMATE.start_foo_~i~0#1| 32)} is VALID [2022-02-20 23:44:38,350 INFO L290 TraceCheckUtils]: 481: Hoare triple {20599#(<= |ULTIMATE.start_foo_~i~0#1| 32)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {20599#(<= |ULTIMATE.start_foo_~i~0#1| 32)} is VALID [2022-02-20 23:44:38,350 INFO L290 TraceCheckUtils]: 482: Hoare triple {20599#(<= |ULTIMATE.start_foo_~i~0#1| 32)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {20600#(<= |ULTIMATE.start_foo_~i~0#1| 33)} is VALID [2022-02-20 23:44:38,351 INFO L290 TraceCheckUtils]: 483: Hoare triple {20600#(<= |ULTIMATE.start_foo_~i~0#1| 33)} assume !!(foo_~i~0#1 < 32767); {20600#(<= |ULTIMATE.start_foo_~i~0#1| 33)} is VALID [2022-02-20 23:44:38,351 INFO L290 TraceCheckUtils]: 484: Hoare triple {20600#(<= |ULTIMATE.start_foo_~i~0#1| 33)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {20600#(<= |ULTIMATE.start_foo_~i~0#1| 33)} is VALID [2022-02-20 23:44:38,351 INFO L290 TraceCheckUtils]: 485: Hoare triple {20600#(<= |ULTIMATE.start_foo_~i~0#1| 33)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {20601#(<= |ULTIMATE.start_foo_~i~0#1| 34)} is VALID [2022-02-20 23:44:38,351 INFO L290 TraceCheckUtils]: 486: Hoare triple {20601#(<= |ULTIMATE.start_foo_~i~0#1| 34)} assume !!(foo_~i~0#1 < 32767); {20601#(<= |ULTIMATE.start_foo_~i~0#1| 34)} is VALID [2022-02-20 23:44:38,352 INFO L290 TraceCheckUtils]: 487: Hoare triple {20601#(<= |ULTIMATE.start_foo_~i~0#1| 34)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {20601#(<= |ULTIMATE.start_foo_~i~0#1| 34)} is VALID [2022-02-20 23:44:38,352 INFO L290 TraceCheckUtils]: 488: Hoare triple {20601#(<= |ULTIMATE.start_foo_~i~0#1| 34)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {20602#(<= |ULTIMATE.start_foo_~i~0#1| 35)} is VALID [2022-02-20 23:44:38,352 INFO L290 TraceCheckUtils]: 489: Hoare triple {20602#(<= |ULTIMATE.start_foo_~i~0#1| 35)} assume !!(foo_~i~0#1 < 32767); {20602#(<= |ULTIMATE.start_foo_~i~0#1| 35)} is VALID [2022-02-20 23:44:38,352 INFO L290 TraceCheckUtils]: 490: Hoare triple {20602#(<= |ULTIMATE.start_foo_~i~0#1| 35)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {20602#(<= |ULTIMATE.start_foo_~i~0#1| 35)} is VALID [2022-02-20 23:44:38,353 INFO L290 TraceCheckUtils]: 491: Hoare triple {20602#(<= |ULTIMATE.start_foo_~i~0#1| 35)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {20603#(<= |ULTIMATE.start_foo_~i~0#1| 36)} is VALID [2022-02-20 23:44:38,353 INFO L290 TraceCheckUtils]: 492: Hoare triple {20603#(<= |ULTIMATE.start_foo_~i~0#1| 36)} assume !!(foo_~i~0#1 < 32767); {20603#(<= |ULTIMATE.start_foo_~i~0#1| 36)} is VALID [2022-02-20 23:44:38,353 INFO L290 TraceCheckUtils]: 493: Hoare triple {20603#(<= |ULTIMATE.start_foo_~i~0#1| 36)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {20603#(<= |ULTIMATE.start_foo_~i~0#1| 36)} is VALID [2022-02-20 23:44:38,354 INFO L290 TraceCheckUtils]: 494: Hoare triple {20603#(<= |ULTIMATE.start_foo_~i~0#1| 36)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {20604#(<= |ULTIMATE.start_foo_~i~0#1| 37)} is VALID [2022-02-20 23:44:38,354 INFO L290 TraceCheckUtils]: 495: Hoare triple {20604#(<= |ULTIMATE.start_foo_~i~0#1| 37)} assume !!(foo_~i~0#1 < 32767); {20604#(<= |ULTIMATE.start_foo_~i~0#1| 37)} is VALID [2022-02-20 23:44:38,354 INFO L290 TraceCheckUtils]: 496: Hoare triple {20604#(<= |ULTIMATE.start_foo_~i~0#1| 37)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {20604#(<= |ULTIMATE.start_foo_~i~0#1| 37)} is VALID [2022-02-20 23:44:38,354 INFO L290 TraceCheckUtils]: 497: Hoare triple {20604#(<= |ULTIMATE.start_foo_~i~0#1| 37)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {20605#(<= |ULTIMATE.start_foo_~i~0#1| 38)} is VALID [2022-02-20 23:44:38,355 INFO L290 TraceCheckUtils]: 498: Hoare triple {20605#(<= |ULTIMATE.start_foo_~i~0#1| 38)} assume !!(foo_~i~0#1 < 32767); {20605#(<= |ULTIMATE.start_foo_~i~0#1| 38)} is VALID [2022-02-20 23:44:38,355 INFO L290 TraceCheckUtils]: 499: Hoare triple {20605#(<= |ULTIMATE.start_foo_~i~0#1| 38)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {20605#(<= |ULTIMATE.start_foo_~i~0#1| 38)} is VALID [2022-02-20 23:44:38,355 INFO L290 TraceCheckUtils]: 500: Hoare triple {20605#(<= |ULTIMATE.start_foo_~i~0#1| 38)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {20606#(<= |ULTIMATE.start_foo_~i~0#1| 39)} is VALID [2022-02-20 23:44:38,355 INFO L290 TraceCheckUtils]: 501: Hoare triple {20606#(<= |ULTIMATE.start_foo_~i~0#1| 39)} assume !!(foo_~i~0#1 < 32767); {20606#(<= |ULTIMATE.start_foo_~i~0#1| 39)} is VALID [2022-02-20 23:44:38,356 INFO L290 TraceCheckUtils]: 502: Hoare triple {20606#(<= |ULTIMATE.start_foo_~i~0#1| 39)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {20606#(<= |ULTIMATE.start_foo_~i~0#1| 39)} is VALID [2022-02-20 23:44:38,356 INFO L290 TraceCheckUtils]: 503: Hoare triple {20606#(<= |ULTIMATE.start_foo_~i~0#1| 39)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {20607#(<= |ULTIMATE.start_foo_~i~0#1| 40)} is VALID [2022-02-20 23:44:38,356 INFO L290 TraceCheckUtils]: 504: Hoare triple {20607#(<= |ULTIMATE.start_foo_~i~0#1| 40)} assume !!(foo_~i~0#1 < 32767); {20607#(<= |ULTIMATE.start_foo_~i~0#1| 40)} is VALID [2022-02-20 23:44:38,356 INFO L290 TraceCheckUtils]: 505: Hoare triple {20607#(<= |ULTIMATE.start_foo_~i~0#1| 40)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {20607#(<= |ULTIMATE.start_foo_~i~0#1| 40)} is VALID [2022-02-20 23:44:38,357 INFO L290 TraceCheckUtils]: 506: Hoare triple {20607#(<= |ULTIMATE.start_foo_~i~0#1| 40)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {20608#(<= |ULTIMATE.start_foo_~i~0#1| 41)} is VALID [2022-02-20 23:44:38,357 INFO L290 TraceCheckUtils]: 507: Hoare triple {20608#(<= |ULTIMATE.start_foo_~i~0#1| 41)} assume !!(foo_~i~0#1 < 32767); {20608#(<= |ULTIMATE.start_foo_~i~0#1| 41)} is VALID [2022-02-20 23:44:38,357 INFO L290 TraceCheckUtils]: 508: Hoare triple {20608#(<= |ULTIMATE.start_foo_~i~0#1| 41)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {20608#(<= |ULTIMATE.start_foo_~i~0#1| 41)} is VALID [2022-02-20 23:44:38,357 INFO L290 TraceCheckUtils]: 509: Hoare triple {20608#(<= |ULTIMATE.start_foo_~i~0#1| 41)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {20609#(<= |ULTIMATE.start_foo_~i~0#1| 42)} is VALID [2022-02-20 23:44:38,358 INFO L290 TraceCheckUtils]: 510: Hoare triple {20609#(<= |ULTIMATE.start_foo_~i~0#1| 42)} assume !!(foo_~i~0#1 < 32767); {20609#(<= |ULTIMATE.start_foo_~i~0#1| 42)} is VALID [2022-02-20 23:44:38,358 INFO L290 TraceCheckUtils]: 511: Hoare triple {20609#(<= |ULTIMATE.start_foo_~i~0#1| 42)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {20609#(<= |ULTIMATE.start_foo_~i~0#1| 42)} is VALID [2022-02-20 23:44:38,358 INFO L290 TraceCheckUtils]: 512: Hoare triple {20609#(<= |ULTIMATE.start_foo_~i~0#1| 42)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {20610#(<= |ULTIMATE.start_foo_~i~0#1| 43)} is VALID [2022-02-20 23:44:38,358 INFO L290 TraceCheckUtils]: 513: Hoare triple {20610#(<= |ULTIMATE.start_foo_~i~0#1| 43)} assume !!(foo_~i~0#1 < 32767); {20610#(<= |ULTIMATE.start_foo_~i~0#1| 43)} is VALID [2022-02-20 23:44:38,359 INFO L290 TraceCheckUtils]: 514: Hoare triple {20610#(<= |ULTIMATE.start_foo_~i~0#1| 43)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {20610#(<= |ULTIMATE.start_foo_~i~0#1| 43)} is VALID [2022-02-20 23:44:38,359 INFO L290 TraceCheckUtils]: 515: Hoare triple {20610#(<= |ULTIMATE.start_foo_~i~0#1| 43)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {20611#(<= |ULTIMATE.start_foo_~i~0#1| 44)} is VALID [2022-02-20 23:44:38,359 INFO L290 TraceCheckUtils]: 516: Hoare triple {20611#(<= |ULTIMATE.start_foo_~i~0#1| 44)} assume !!(foo_~i~0#1 < 32767); {20611#(<= |ULTIMATE.start_foo_~i~0#1| 44)} is VALID [2022-02-20 23:44:38,359 INFO L290 TraceCheckUtils]: 517: Hoare triple {20611#(<= |ULTIMATE.start_foo_~i~0#1| 44)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {20611#(<= |ULTIMATE.start_foo_~i~0#1| 44)} is VALID [2022-02-20 23:44:38,360 INFO L290 TraceCheckUtils]: 518: Hoare triple {20611#(<= |ULTIMATE.start_foo_~i~0#1| 44)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {20612#(<= |ULTIMATE.start_foo_~i~0#1| 45)} is VALID [2022-02-20 23:44:38,360 INFO L290 TraceCheckUtils]: 519: Hoare triple {20612#(<= |ULTIMATE.start_foo_~i~0#1| 45)} assume !!(foo_~i~0#1 < 32767); {20612#(<= |ULTIMATE.start_foo_~i~0#1| 45)} is VALID [2022-02-20 23:44:38,360 INFO L290 TraceCheckUtils]: 520: Hoare triple {20612#(<= |ULTIMATE.start_foo_~i~0#1| 45)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {20612#(<= |ULTIMATE.start_foo_~i~0#1| 45)} is VALID [2022-02-20 23:44:38,361 INFO L290 TraceCheckUtils]: 521: Hoare triple {20612#(<= |ULTIMATE.start_foo_~i~0#1| 45)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {20613#(<= |ULTIMATE.start_foo_~i~0#1| 46)} is VALID [2022-02-20 23:44:38,361 INFO L290 TraceCheckUtils]: 522: Hoare triple {20613#(<= |ULTIMATE.start_foo_~i~0#1| 46)} assume !!(foo_~i~0#1 < 32767); {20613#(<= |ULTIMATE.start_foo_~i~0#1| 46)} is VALID [2022-02-20 23:44:38,361 INFO L290 TraceCheckUtils]: 523: Hoare triple {20613#(<= |ULTIMATE.start_foo_~i~0#1| 46)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {20613#(<= |ULTIMATE.start_foo_~i~0#1| 46)} is VALID [2022-02-20 23:44:38,361 INFO L290 TraceCheckUtils]: 524: Hoare triple {20613#(<= |ULTIMATE.start_foo_~i~0#1| 46)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {20614#(<= |ULTIMATE.start_foo_~i~0#1| 47)} is VALID [2022-02-20 23:44:38,362 INFO L290 TraceCheckUtils]: 525: Hoare triple {20614#(<= |ULTIMATE.start_foo_~i~0#1| 47)} assume !!(foo_~i~0#1 < 32767); {20614#(<= |ULTIMATE.start_foo_~i~0#1| 47)} is VALID [2022-02-20 23:44:38,362 INFO L290 TraceCheckUtils]: 526: Hoare triple {20614#(<= |ULTIMATE.start_foo_~i~0#1| 47)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {20614#(<= |ULTIMATE.start_foo_~i~0#1| 47)} is VALID [2022-02-20 23:44:38,362 INFO L290 TraceCheckUtils]: 527: Hoare triple {20614#(<= |ULTIMATE.start_foo_~i~0#1| 47)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {20615#(<= |ULTIMATE.start_foo_~i~0#1| 48)} is VALID [2022-02-20 23:44:38,362 INFO L290 TraceCheckUtils]: 528: Hoare triple {20615#(<= |ULTIMATE.start_foo_~i~0#1| 48)} assume !!(foo_~i~0#1 < 32767); {20615#(<= |ULTIMATE.start_foo_~i~0#1| 48)} is VALID [2022-02-20 23:44:38,363 INFO L290 TraceCheckUtils]: 529: Hoare triple {20615#(<= |ULTIMATE.start_foo_~i~0#1| 48)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {20615#(<= |ULTIMATE.start_foo_~i~0#1| 48)} is VALID [2022-02-20 23:44:38,363 INFO L290 TraceCheckUtils]: 530: Hoare triple {20615#(<= |ULTIMATE.start_foo_~i~0#1| 48)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {20616#(<= |ULTIMATE.start_foo_~i~0#1| 49)} is VALID [2022-02-20 23:44:38,363 INFO L290 TraceCheckUtils]: 531: Hoare triple {20616#(<= |ULTIMATE.start_foo_~i~0#1| 49)} assume !!(foo_~i~0#1 < 32767); {20616#(<= |ULTIMATE.start_foo_~i~0#1| 49)} is VALID [2022-02-20 23:44:38,363 INFO L290 TraceCheckUtils]: 532: Hoare triple {20616#(<= |ULTIMATE.start_foo_~i~0#1| 49)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {20616#(<= |ULTIMATE.start_foo_~i~0#1| 49)} is VALID [2022-02-20 23:44:38,364 INFO L290 TraceCheckUtils]: 533: Hoare triple {20616#(<= |ULTIMATE.start_foo_~i~0#1| 49)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {20617#(<= |ULTIMATE.start_foo_~i~0#1| 50)} is VALID [2022-02-20 23:44:38,364 INFO L290 TraceCheckUtils]: 534: Hoare triple {20617#(<= |ULTIMATE.start_foo_~i~0#1| 50)} assume !!(foo_~i~0#1 < 32767); {20617#(<= |ULTIMATE.start_foo_~i~0#1| 50)} is VALID [2022-02-20 23:44:38,364 INFO L290 TraceCheckUtils]: 535: Hoare triple {20617#(<= |ULTIMATE.start_foo_~i~0#1| 50)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {20617#(<= |ULTIMATE.start_foo_~i~0#1| 50)} is VALID [2022-02-20 23:44:38,364 INFO L290 TraceCheckUtils]: 536: Hoare triple {20617#(<= |ULTIMATE.start_foo_~i~0#1| 50)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {20618#(<= |ULTIMATE.start_foo_~i~0#1| 51)} is VALID [2022-02-20 23:44:38,365 INFO L290 TraceCheckUtils]: 537: Hoare triple {20618#(<= |ULTIMATE.start_foo_~i~0#1| 51)} assume !!(foo_~i~0#1 < 32767); {20618#(<= |ULTIMATE.start_foo_~i~0#1| 51)} is VALID [2022-02-20 23:44:38,365 INFO L290 TraceCheckUtils]: 538: Hoare triple {20618#(<= |ULTIMATE.start_foo_~i~0#1| 51)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {20618#(<= |ULTIMATE.start_foo_~i~0#1| 51)} is VALID [2022-02-20 23:44:38,365 INFO L290 TraceCheckUtils]: 539: Hoare triple {20618#(<= |ULTIMATE.start_foo_~i~0#1| 51)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {20619#(<= |ULTIMATE.start_foo_~i~0#1| 52)} is VALID [2022-02-20 23:44:38,365 INFO L290 TraceCheckUtils]: 540: Hoare triple {20619#(<= |ULTIMATE.start_foo_~i~0#1| 52)} assume !!(foo_~i~0#1 < 32767); {20619#(<= |ULTIMATE.start_foo_~i~0#1| 52)} is VALID [2022-02-20 23:44:38,366 INFO L290 TraceCheckUtils]: 541: Hoare triple {20619#(<= |ULTIMATE.start_foo_~i~0#1| 52)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {20619#(<= |ULTIMATE.start_foo_~i~0#1| 52)} is VALID [2022-02-20 23:44:38,366 INFO L290 TraceCheckUtils]: 542: Hoare triple {20619#(<= |ULTIMATE.start_foo_~i~0#1| 52)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {20620#(<= |ULTIMATE.start_foo_~i~0#1| 53)} is VALID [2022-02-20 23:44:38,366 INFO L290 TraceCheckUtils]: 543: Hoare triple {20620#(<= |ULTIMATE.start_foo_~i~0#1| 53)} assume !!(foo_~i~0#1 < 32767); {20620#(<= |ULTIMATE.start_foo_~i~0#1| 53)} is VALID [2022-02-20 23:44:38,366 INFO L290 TraceCheckUtils]: 544: Hoare triple {20620#(<= |ULTIMATE.start_foo_~i~0#1| 53)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {20620#(<= |ULTIMATE.start_foo_~i~0#1| 53)} is VALID [2022-02-20 23:44:38,367 INFO L290 TraceCheckUtils]: 545: Hoare triple {20620#(<= |ULTIMATE.start_foo_~i~0#1| 53)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {20621#(<= |ULTIMATE.start_foo_~i~0#1| 54)} is VALID [2022-02-20 23:44:38,367 INFO L290 TraceCheckUtils]: 546: Hoare triple {20621#(<= |ULTIMATE.start_foo_~i~0#1| 54)} assume !!(foo_~i~0#1 < 32767); {20621#(<= |ULTIMATE.start_foo_~i~0#1| 54)} is VALID [2022-02-20 23:44:38,367 INFO L290 TraceCheckUtils]: 547: Hoare triple {20621#(<= |ULTIMATE.start_foo_~i~0#1| 54)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {20621#(<= |ULTIMATE.start_foo_~i~0#1| 54)} is VALID [2022-02-20 23:44:38,368 INFO L290 TraceCheckUtils]: 548: Hoare triple {20621#(<= |ULTIMATE.start_foo_~i~0#1| 54)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {20622#(<= |ULTIMATE.start_foo_~i~0#1| 55)} is VALID [2022-02-20 23:44:38,368 INFO L290 TraceCheckUtils]: 549: Hoare triple {20622#(<= |ULTIMATE.start_foo_~i~0#1| 55)} assume !!(foo_~i~0#1 < 32767); {20622#(<= |ULTIMATE.start_foo_~i~0#1| 55)} is VALID [2022-02-20 23:44:38,368 INFO L290 TraceCheckUtils]: 550: Hoare triple {20622#(<= |ULTIMATE.start_foo_~i~0#1| 55)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {20622#(<= |ULTIMATE.start_foo_~i~0#1| 55)} is VALID [2022-02-20 23:44:38,368 INFO L290 TraceCheckUtils]: 551: Hoare triple {20622#(<= |ULTIMATE.start_foo_~i~0#1| 55)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {20623#(<= |ULTIMATE.start_foo_~i~0#1| 56)} is VALID [2022-02-20 23:44:38,369 INFO L290 TraceCheckUtils]: 552: Hoare triple {20623#(<= |ULTIMATE.start_foo_~i~0#1| 56)} assume !!(foo_~i~0#1 < 32767); {20623#(<= |ULTIMATE.start_foo_~i~0#1| 56)} is VALID [2022-02-20 23:44:38,369 INFO L290 TraceCheckUtils]: 553: Hoare triple {20623#(<= |ULTIMATE.start_foo_~i~0#1| 56)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {20623#(<= |ULTIMATE.start_foo_~i~0#1| 56)} is VALID [2022-02-20 23:44:38,369 INFO L290 TraceCheckUtils]: 554: Hoare triple {20623#(<= |ULTIMATE.start_foo_~i~0#1| 56)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {20624#(<= |ULTIMATE.start_foo_~i~0#1| 57)} is VALID [2022-02-20 23:44:38,369 INFO L290 TraceCheckUtils]: 555: Hoare triple {20624#(<= |ULTIMATE.start_foo_~i~0#1| 57)} assume !!(foo_~i~0#1 < 32767); {20624#(<= |ULTIMATE.start_foo_~i~0#1| 57)} is VALID [2022-02-20 23:44:38,370 INFO L290 TraceCheckUtils]: 556: Hoare triple {20624#(<= |ULTIMATE.start_foo_~i~0#1| 57)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {20624#(<= |ULTIMATE.start_foo_~i~0#1| 57)} is VALID [2022-02-20 23:44:38,370 INFO L290 TraceCheckUtils]: 557: Hoare triple {20624#(<= |ULTIMATE.start_foo_~i~0#1| 57)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {20625#(<= |ULTIMATE.start_foo_~i~0#1| 58)} is VALID [2022-02-20 23:44:38,370 INFO L290 TraceCheckUtils]: 558: Hoare triple {20625#(<= |ULTIMATE.start_foo_~i~0#1| 58)} assume !!(foo_~i~0#1 < 32767); {20625#(<= |ULTIMATE.start_foo_~i~0#1| 58)} is VALID [2022-02-20 23:44:38,375 INFO L290 TraceCheckUtils]: 559: Hoare triple {20625#(<= |ULTIMATE.start_foo_~i~0#1| 58)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {20625#(<= |ULTIMATE.start_foo_~i~0#1| 58)} is VALID [2022-02-20 23:44:38,375 INFO L290 TraceCheckUtils]: 560: Hoare triple {20625#(<= |ULTIMATE.start_foo_~i~0#1| 58)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {20626#(<= |ULTIMATE.start_foo_~i~0#1| 59)} is VALID [2022-02-20 23:44:38,375 INFO L290 TraceCheckUtils]: 561: Hoare triple {20626#(<= |ULTIMATE.start_foo_~i~0#1| 59)} assume !!(foo_~i~0#1 < 32767); {20626#(<= |ULTIMATE.start_foo_~i~0#1| 59)} is VALID [2022-02-20 23:44:38,376 INFO L290 TraceCheckUtils]: 562: Hoare triple {20626#(<= |ULTIMATE.start_foo_~i~0#1| 59)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {20626#(<= |ULTIMATE.start_foo_~i~0#1| 59)} is VALID [2022-02-20 23:44:38,377 INFO L290 TraceCheckUtils]: 563: Hoare triple {20626#(<= |ULTIMATE.start_foo_~i~0#1| 59)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {20627#(<= |ULTIMATE.start_foo_~i~0#1| 60)} is VALID [2022-02-20 23:44:38,377 INFO L290 TraceCheckUtils]: 564: Hoare triple {20627#(<= |ULTIMATE.start_foo_~i~0#1| 60)} assume !!(foo_~i~0#1 < 32767); {20627#(<= |ULTIMATE.start_foo_~i~0#1| 60)} is VALID [2022-02-20 23:44:38,378 INFO L290 TraceCheckUtils]: 565: Hoare triple {20627#(<= |ULTIMATE.start_foo_~i~0#1| 60)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {20627#(<= |ULTIMATE.start_foo_~i~0#1| 60)} is VALID [2022-02-20 23:44:38,378 INFO L290 TraceCheckUtils]: 566: Hoare triple {20627#(<= |ULTIMATE.start_foo_~i~0#1| 60)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {20628#(<= |ULTIMATE.start_foo_~i~0#1| 61)} is VALID [2022-02-20 23:44:38,378 INFO L290 TraceCheckUtils]: 567: Hoare triple {20628#(<= |ULTIMATE.start_foo_~i~0#1| 61)} assume !!(foo_~i~0#1 < 32767); {20628#(<= |ULTIMATE.start_foo_~i~0#1| 61)} is VALID [2022-02-20 23:44:38,379 INFO L290 TraceCheckUtils]: 568: Hoare triple {20628#(<= |ULTIMATE.start_foo_~i~0#1| 61)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {20628#(<= |ULTIMATE.start_foo_~i~0#1| 61)} is VALID [2022-02-20 23:44:38,380 INFO L290 TraceCheckUtils]: 569: Hoare triple {20628#(<= |ULTIMATE.start_foo_~i~0#1| 61)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {20629#(<= |ULTIMATE.start_foo_~i~0#1| 62)} is VALID [2022-02-20 23:44:38,380 INFO L290 TraceCheckUtils]: 570: Hoare triple {20629#(<= |ULTIMATE.start_foo_~i~0#1| 62)} assume !!(foo_~i~0#1 < 32767); {20629#(<= |ULTIMATE.start_foo_~i~0#1| 62)} is VALID [2022-02-20 23:44:38,380 INFO L290 TraceCheckUtils]: 571: Hoare triple {20629#(<= |ULTIMATE.start_foo_~i~0#1| 62)} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {20629#(<= |ULTIMATE.start_foo_~i~0#1| 62)} is VALID [2022-02-20 23:44:38,383 INFO L290 TraceCheckUtils]: 572: Hoare triple {20629#(<= |ULTIMATE.start_foo_~i~0#1| 62)} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {20630#(<= |ULTIMATE.start_foo_~i~0#1| 63)} is VALID [2022-02-20 23:44:38,383 INFO L290 TraceCheckUtils]: 573: Hoare triple {20630#(<= |ULTIMATE.start_foo_~i~0#1| 63)} assume !(foo_~i~0#1 < 32767); {20566#false} is VALID [2022-02-20 23:44:38,384 INFO L290 TraceCheckUtils]: 574: Hoare triple {20566#false} assume { :end_inline_foo } true; {20566#false} is VALID [2022-02-20 23:44:38,384 INFO L290 TraceCheckUtils]: 575: Hoare triple {20566#false} SUMMARY for call main_#t~mem8#1 := read~int(~b~0.base, -4 + ~b~0.offset, 4); srcloc: L540 {20566#false} is VALID [2022-02-20 23:44:38,384 INFO L290 TraceCheckUtils]: 576: Hoare triple {20566#false} assume 0 != main_#t~mem8#1;havoc main_#t~mem8#1; {20566#false} is VALID [2022-02-20 23:44:38,384 INFO L290 TraceCheckUtils]: 577: Hoare triple {20566#false} assume 0 == ~a~0.offset; {20566#false} is VALID [2022-02-20 23:44:38,384 INFO L290 TraceCheckUtils]: 578: Hoare triple {20566#false} assume ~a~0.base < #StackHeapBarrier; {20566#false} is VALID [2022-02-20 23:44:38,384 INFO L290 TraceCheckUtils]: 579: Hoare triple {20566#false} assume 0 == ~a~0.base || 1 == #valid[~a~0.base];call ULTIMATE.dealloc(~a~0.base, ~a~0.offset); {20566#false} is VALID [2022-02-20 23:44:38,384 INFO L290 TraceCheckUtils]: 580: Hoare triple {20566#false} assume !(0 == ~b~0.offset); {20566#false} is VALID [2022-02-20 23:44:38,390 INFO L134 CoverageAnalysis]: Checked inductivity of 29673 backedges. 0 proven. 5922 refuted. 0 times theorem prover too weak. 23751 trivial. 0 not checked. [2022-02-20 23:44:38,390 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:44:38,391 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757506102] [2022-02-20 23:44:38,391 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757506102] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:44:38,391 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773551959] [2022-02-20 23:44:38,391 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 23:44:38,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:44:38,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:44:38,392 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:44:38,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process