./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/960521-1-1.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-1.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 4591ef5e575ce80e216cc4837705a7c6f141a943d9af6ca1eb606ab877abd06b --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:43:43,853 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:43:43,855 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:43:43,874 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:43:43,875 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:43:43,875 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:43:43,876 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:43:43,877 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:43:43,878 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:43:43,879 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:43:43,879 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:43:43,880 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:43:43,880 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:43:43,881 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:43:43,882 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:43:43,882 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:43:43,883 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:43:43,884 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:43:43,885 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:43:43,887 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:43:43,888 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:43:43,889 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:43:43,890 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:43:43,891 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:43:43,892 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:43:43,894 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:43:43,894 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:43:43,895 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:43:43,895 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:43:43,896 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:43:43,896 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:43:43,896 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:43:43,897 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:43:43,897 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:43:43,898 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:43:43,898 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:43:43,899 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:43:43,899 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:43:43,900 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:43:43,901 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:43:43,902 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:43:43,903 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:43,919 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:43:43,919 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:43:43,920 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:43:43,920 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:43:43,920 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:43:43,920 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:43:43,921 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:43:43,921 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:43:43,921 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:43:43,921 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:43:43,921 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:43:43,921 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:43:43,922 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:43:43,922 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:43:43,922 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:43:43,922 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:43:43,922 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:43:43,922 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:43:43,923 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:43:43,923 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:43:43,923 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:43:43,923 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:43:43,923 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:43:43,923 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:43:43,923 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:43:43,924 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:43:43,924 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:43:43,924 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:43:43,924 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:43:43,924 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:43:43,924 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 -> 4591ef5e575ce80e216cc4837705a7c6f141a943d9af6ca1eb606ab877abd06b [2022-02-20 23:43:44,095 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:43:44,111 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:43:44,113 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:43:44,113 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:43:44,116 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:43:44,117 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/960521-1-1.i [2022-02-20 23:43:44,159 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dafb524e2/65f987df896e427d982858b5ff77177e/FLAG92895876d [2022-02-20 23:43:44,523 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:43:44,524 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/960521-1-1.i [2022-02-20 23:43:44,553 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dafb524e2/65f987df896e427d982858b5ff77177e/FLAG92895876d [2022-02-20 23:43:44,933 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dafb524e2/65f987df896e427d982858b5ff77177e [2022-02-20 23:43:44,935 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:43:44,935 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:43:44,938 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:43:44,939 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:43:44,948 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:43:44,949 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:43:44" (1/1) ... [2022-02-20 23:43:44,951 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37a03b3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:44, skipping insertion in model container [2022-02-20 23:43:44,951 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:43:44" (1/1) ... [2022-02-20 23:43:44,956 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:43:44,990 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:43:45,208 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:43:45,214 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:43:45,266 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:43:45,289 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:43:45,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:45 WrapperNode [2022-02-20 23:43:45,293 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:43:45,294 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:43:45,294 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:43:45,294 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:43:45,300 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:45" (1/1) ... [2022-02-20 23:43:45,311 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:45" (1/1) ... [2022-02-20 23:43:45,330 INFO L137 Inliner]: procedures = 121, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 65 [2022-02-20 23:43:45,330 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:43:45,331 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:43:45,331 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:43:45,331 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:43:45,336 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:45" (1/1) ... [2022-02-20 23:43:45,336 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:45" (1/1) ... [2022-02-20 23:43:45,337 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:45" (1/1) ... [2022-02-20 23:43:45,338 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:45" (1/1) ... [2022-02-20 23:43:45,349 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:45" (1/1) ... [2022-02-20 23:43:45,351 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:45" (1/1) ... [2022-02-20 23:43:45,352 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:45" (1/1) ... [2022-02-20 23:43:45,354 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:43:45,354 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:43:45,355 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:43:45,355 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:43:45,355 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:45" (1/1) ... [2022-02-20 23:43:45,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:43:45,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:43:45,381 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:45,382 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:45,406 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 23:43:45,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 23:43:45,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:43:45,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:43:45,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:43:45,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 23:43:45,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:43:45,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:43:45,485 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:43:45,486 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:43:45,689 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:43:45,694 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:43:45,694 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 23:43:45,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:43:45 BoogieIcfgContainer [2022-02-20 23:43:45,695 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:43:45,696 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:43:45,696 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:43:45,698 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:43:45,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:43:44" (1/3) ... [2022-02-20 23:43:45,699 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ed3a435 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:43:45, skipping insertion in model container [2022-02-20 23:43:45,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:45" (2/3) ... [2022-02-20 23:43:45,699 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ed3a435 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:43:45, skipping insertion in model container [2022-02-20 23:43:45,700 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:43:45" (3/3) ... [2022-02-20 23:43:45,700 INFO L111 eAbstractionObserver]: Analyzing ICFG 960521-1-1.i [2022-02-20 23:43:45,703 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:43:45,703 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 21 error locations. [2022-02-20 23:43:45,733 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:43:45,739 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:45,740 INFO L340 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2022-02-20 23:43:45,773 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:45,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-20 23:43:45,779 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:43:45,780 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-20 23:43:45,780 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:45,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:43:45,787 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-02-20 23:43:45,793 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:43:45,794 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809425278] [2022-02-20 23:43:45,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:45,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:43:45,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:45,949 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:45,952 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 := 128;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:45,952 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:45,953 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:45,953 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:43:45,954 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809425278] [2022-02-20 23:43:45,954 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809425278] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:43:45,954 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:43:45,955 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:43:45,957 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046890021] [2022-02-20 23:43:45,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:43:45,961 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:45,962 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:43:45,964 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:45,970 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:45,970 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:43:45,970 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:43:45,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:43:45,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:43:45,994 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:46,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:46,107 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2022-02-20 23:43:46,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:43:46,107 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:46,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:43:46,108 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:46,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-02-20 23:43:46,119 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:46,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-02-20 23:43:46,122 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 55 transitions. [2022-02-20 23:43:46,167 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:46,176 INFO L225 Difference]: With dead ends: 50 [2022-02-20 23:43:46,177 INFO L226 Difference]: Without dead ends: 48 [2022-02-20 23:43:46,178 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:46,180 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:46,180 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:46,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-02-20 23:43:46,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-02-20 23:43:46,200 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:43:46,201 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:46,202 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:46,204 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:46,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:46,208 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2022-02-20 23:43:46,208 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2022-02-20 23:43:46,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:46,209 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:46,209 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:46,210 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:46,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:46,214 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2022-02-20 23:43:46,214 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2022-02-20 23:43:46,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:46,215 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:46,215 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:43:46,215 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:43:46,217 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:46,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2022-02-20 23:43:46,222 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 3 [2022-02-20 23:43:46,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:43:46,223 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2022-02-20 23:43:46,223 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:46,223 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2022-02-20 23:43:46,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-20 23:43:46,224 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:43:46,224 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-20 23:43:46,225 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 23:43:46,225 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:46,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:43:46,228 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-02-20 23:43:46,228 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:43:46,229 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364477024] [2022-02-20 23:43:46,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:46,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:43:46,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:46,274 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:46,275 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 := 128;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 (<= 512 (select |#length| |ULTIMATE.start_main_#t~post7#1.base|)) (= 0 |ULTIMATE.start_main_#t~post7#1.offset|))} is VALID [2022-02-20 23:43:46,276 INFO L290 TraceCheckUtils]: 2: Hoare triple {255#(and (<= 512 (select |#length| |ULTIMATE.start_main_#t~post7#1.base|)) (= 0 |ULTIMATE.start_main_#t~post7#1.offset|))} 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:46,276 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:46,276 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:43:46,277 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364477024] [2022-02-20 23:43:46,277 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364477024] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:43:46,277 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:43:46,277 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:43:46,277 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943212476] [2022-02-20 23:43:46,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:43:46,278 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:46,278 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:43:46,278 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:46,283 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:46,283 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:43:46,283 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:43:46,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:43:46,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:43:46,284 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:46,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:46,336 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2022-02-20 23:43:46,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:43:46,336 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:46,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:43:46,337 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:46,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-02-20 23:43:46,338 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:46,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-02-20 23:43:46,339 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 50 transitions. [2022-02-20 23:43:46,370 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:46,372 INFO L225 Difference]: With dead ends: 47 [2022-02-20 23:43:46,372 INFO L226 Difference]: Without dead ends: 47 [2022-02-20 23:43:46,372 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:46,377 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:46,378 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:46,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-02-20 23:43:46,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-02-20 23:43:46,387 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:43:46,388 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:46,389 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:46,389 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:46,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:46,399 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2022-02-20 23:43:46,399 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-02-20 23:43:46,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:46,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:46,400 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:46,400 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:46,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:46,404 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2022-02-20 23:43:46,404 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-02-20 23:43:46,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:46,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:46,406 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:43:46,406 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:43:46,406 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:46,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2022-02-20 23:43:46,408 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 3 [2022-02-20 23:43:46,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:43:46,408 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2022-02-20 23:43:46,408 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:46,409 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-02-20 23:43:46,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 23:43:46,409 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:43:46,409 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 23:43:46,409 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 23:43:46,410 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:46,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:43:46,410 INFO L85 PathProgramCache]: Analyzing trace with hash 889446312, now seen corresponding path program 1 times [2022-02-20 23:43:46,410 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:43:46,411 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825917668] [2022-02-20 23:43:46,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:46,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:43:46,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:46,459 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:46,460 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 := 128;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:46,460 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:46,461 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:46,461 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:46,462 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:46,462 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:46,462 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:43:46,462 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825917668] [2022-02-20 23:43:46,462 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825917668] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:43:46,462 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:43:46,463 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:43:46,463 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810370999] [2022-02-20 23:43:46,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:43:46,463 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:46,463 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:43:46,464 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:46,468 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:46,469 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:43:46,469 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:43:46,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:43:46,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:43:46,469 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:46,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:46,549 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-02-20 23:43:46,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:43:46,549 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:46,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:43:46,549 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:46,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2022-02-20 23:43:46,550 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:46,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2022-02-20 23:43:46,551 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 49 transitions. [2022-02-20 23:43:46,582 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:46,583 INFO L225 Difference]: With dead ends: 44 [2022-02-20 23:43:46,583 INFO L226 Difference]: Without dead ends: 44 [2022-02-20 23:43:46,584 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:46,589 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:46,590 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:46,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-02-20 23:43:46,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-02-20 23:43:46,596 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:43:46,596 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:46,596 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:46,597 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:46,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:46,599 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-02-20 23:43:46,599 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-02-20 23:43:46,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:46,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:46,601 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:46,601 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:46,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:46,604 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-02-20 23:43:46,604 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-02-20 23:43:46,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:46,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:46,607 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:43:46,607 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:43:46,610 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:46,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2022-02-20 23:43:46,611 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 6 [2022-02-20 23:43:46,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:43:46,611 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2022-02-20 23:43:46,612 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:46,612 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-02-20 23:43:46,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 23:43:46,613 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:43:46,617 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 23:43:46,617 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 23:43:46,618 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:46,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:43:46,618 INFO L85 PathProgramCache]: Analyzing trace with hash 889446313, now seen corresponding path program 1 times [2022-02-20 23:43:46,619 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:43:46,619 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016910098] [2022-02-20 23:43:46,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:46,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:43:46,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:46,742 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:46,743 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 := 128;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 (<= 128 ~n~0) (= ~a~0.offset 0) (= (* ~n~0 4) (select |#length| ~a~0.base)))} is VALID [2022-02-20 23:43:46,743 INFO L290 TraceCheckUtils]: 2: Hoare triple {630#(and (<= 128 ~n~0) (= ~a~0.offset 0) (= (* ~n~0 4) (select |#length| ~a~0.base)))} SUMMARY for call write~int(0, main_#t~post7#1.base, main_#t~post7#1.offset, 4); srcloc: L538 {630#(and (<= 128 ~n~0) (= ~a~0.offset 0) (= (* ~n~0 4) (select |#length| ~a~0.base)))} is VALID [2022-02-20 23:43:46,744 INFO L290 TraceCheckUtils]: 3: Hoare triple {630#(and (<= 128 ~n~0) (= ~a~0.offset 0) (= (* ~n~0 4) (select |#length| ~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; {631#(and (<= 128 ~n~0) (= ~a~0.offset 0) (= |ULTIMATE.start_foo_~i~0#1| 0) (= (* ~n~0 4) (select |#length| ~a~0.base)))} is VALID [2022-02-20 23:43:46,744 INFO L290 TraceCheckUtils]: 4: Hoare triple {631#(and (<= 128 ~n~0) (= ~a~0.offset 0) (= |ULTIMATE.start_foo_~i~0#1| 0) (= (* ~n~0 4) (select |#length| ~a~0.base)))} assume !!(foo_~i~0#1 < ~n~0); {632#(and (= ~a~0.offset 0) (= |ULTIMATE.start_foo_~i~0#1| 0) (<= 512 (select |#length| ~a~0.base)))} is VALID [2022-02-20 23:43:46,745 INFO L290 TraceCheckUtils]: 5: Hoare triple {632#(and (= ~a~0.offset 0) (= |ULTIMATE.start_foo_~i~0#1| 0) (<= 512 (select |#length| ~a~0.base)))} 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:46,746 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:46,746 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:43:46,746 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016910098] [2022-02-20 23:43:46,746 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016910098] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:43:46,746 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:43:46,747 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:43:46,747 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631573579] [2022-02-20 23:43:46,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:43:46,747 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:46,748 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:43:46,748 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:46,753 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:46,753 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:43:46,753 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:43:46,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:43:46,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:43:46,755 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:46,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:46,884 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2022-02-20 23:43:46,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:43:46,885 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:46,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:43:46,886 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:46,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2022-02-20 23:43:46,887 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:46,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2022-02-20 23:43:46,888 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 57 transitions. [2022-02-20 23:43:46,932 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:46,933 INFO L225 Difference]: With dead ends: 50 [2022-02-20 23:43:46,933 INFO L226 Difference]: Without dead ends: 50 [2022-02-20 23:43:46,933 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:46,937 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:46,938 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:46,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-02-20 23:43:46,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2022-02-20 23:43:46,941 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:43:46,941 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:46,942 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:46,942 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:46,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:46,944 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2022-02-20 23:43:46,944 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2022-02-20 23:43:46,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:46,945 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:46,945 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:46,945 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:46,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:46,948 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2022-02-20 23:43:46,948 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2022-02-20 23:43:46,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:46,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:46,950 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:43:46,950 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:43:46,950 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:46,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2022-02-20 23:43:46,951 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 6 [2022-02-20 23:43:46,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:43:46,951 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2022-02-20 23:43:46,951 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:46,951 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2022-02-20 23:43:46,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 23:43:46,952 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:43:46,952 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:43:46,952 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 23:43:46,952 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:46,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:43:46,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1841820687, now seen corresponding path program 1 times [2022-02-20 23:43:46,954 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:43:46,954 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699302878] [2022-02-20 23:43:46,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:46,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:43:47,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:47,082 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:47,083 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 := 128;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 (= ~a~0.offset 0) (not (= ~a~0.base |ULTIMATE.start_main_#t~post7#1.base|)) (<= 512 (select |#length| ~a~0.base)))} is VALID [2022-02-20 23:43:47,084 INFO L290 TraceCheckUtils]: 2: Hoare triple {832#(and (= ~a~0.offset 0) (not (= ~a~0.base |ULTIMATE.start_main_#t~post7#1.base|)) (<= 512 (select |#length| ~a~0.base)))} SUMMARY for call write~int(0, main_#t~post7#1.base, main_#t~post7#1.offset, 4); srcloc: L538 {833#(and (= ~a~0.offset 0) (<= 512 (select |#length| ~a~0.base)))} is VALID [2022-02-20 23:43:47,084 INFO L290 TraceCheckUtils]: 3: Hoare triple {833#(and (= ~a~0.offset 0) (<= 512 (select |#length| ~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; {834#(and (= ~a~0.offset 0) (= |ULTIMATE.start_foo_~i~0#1| 0) (<= 512 (select |#length| ~a~0.base)))} is VALID [2022-02-20 23:43:47,084 INFO L290 TraceCheckUtils]: 4: Hoare triple {834#(and (= ~a~0.offset 0) (= |ULTIMATE.start_foo_~i~0#1| 0) (<= 512 (select |#length| ~a~0.base)))} assume !!(foo_~i~0#1 < ~n~0); {834#(and (= ~a~0.offset 0) (= |ULTIMATE.start_foo_~i~0#1| 0) (<= 512 (select |#length| ~a~0.base)))} is VALID [2022-02-20 23:43:47,085 INFO L290 TraceCheckUtils]: 5: Hoare triple {834#(and (= ~a~0.offset 0) (= |ULTIMATE.start_foo_~i~0#1| 0) (<= 512 (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 {834#(and (= ~a~0.offset 0) (= |ULTIMATE.start_foo_~i~0#1| 0) (<= 512 (select |#length| ~a~0.base)))} is VALID [2022-02-20 23:43:47,086 INFO L290 TraceCheckUtils]: 6: Hoare triple {834#(and (= ~a~0.offset 0) (= |ULTIMATE.start_foo_~i~0#1| 0) (<= 512 (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; {835#(and (<= (+ 508 (* |ULTIMATE.start_foo_~i~0#1| 4)) (select |#length| ~a~0.base)) (= ~a~0.offset 0) (<= 1 |ULTIMATE.start_foo_~i~0#1|))} is VALID [2022-02-20 23:43:47,086 INFO L290 TraceCheckUtils]: 7: Hoare triple {835#(and (<= (+ 508 (* |ULTIMATE.start_foo_~i~0#1| 4)) (select |#length| ~a~0.base)) (= ~a~0.offset 0) (<= 1 |ULTIMATE.start_foo_~i~0#1|))} assume !!(foo_~i~0#1 < ~n~0); {835#(and (<= (+ 508 (* |ULTIMATE.start_foo_~i~0#1| 4)) (select |#length| ~a~0.base)) (= ~a~0.offset 0) (<= 1 |ULTIMATE.start_foo_~i~0#1|))} is VALID [2022-02-20 23:43:47,087 INFO L290 TraceCheckUtils]: 8: Hoare triple {835#(and (<= (+ 508 (* |ULTIMATE.start_foo_~i~0#1| 4)) (select |#length| ~a~0.base)) (= ~a~0.offset 0) (<= 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:47,087 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:47,088 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:43:47,088 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699302878] [2022-02-20 23:43:47,088 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699302878] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:43:47,088 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006138587] [2022-02-20 23:43:47,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:47,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:43:47,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:43:47,102 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:47,110 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:47,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:47,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-20 23:43:47,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:47,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:43:47,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:43:47,360 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:47,388 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:47,514 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:47,515 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 := 128;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 (= ~a~0.offset 0) (<= 512 (select |#length| ~a~0.base)))} is VALID [2022-02-20 23:43:47,516 INFO L290 TraceCheckUtils]: 2: Hoare triple {833#(and (= ~a~0.offset 0) (<= 512 (select |#length| ~a~0.base)))} SUMMARY for call write~int(0, main_#t~post7#1.base, main_#t~post7#1.offset, 4); srcloc: L538 {833#(and (= ~a~0.offset 0) (<= 512 (select |#length| ~a~0.base)))} is VALID [2022-02-20 23:43:47,516 INFO L290 TraceCheckUtils]: 3: Hoare triple {833#(and (= ~a~0.offset 0) (<= 512 (select |#length| ~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; {834#(and (= ~a~0.offset 0) (= |ULTIMATE.start_foo_~i~0#1| 0) (<= 512 (select |#length| ~a~0.base)))} is VALID [2022-02-20 23:43:47,518 INFO L290 TraceCheckUtils]: 4: Hoare triple {834#(and (= ~a~0.offset 0) (= |ULTIMATE.start_foo_~i~0#1| 0) (<= 512 (select |#length| ~a~0.base)))} assume !!(foo_~i~0#1 < ~n~0); {834#(and (= ~a~0.offset 0) (= |ULTIMATE.start_foo_~i~0#1| 0) (<= 512 (select |#length| ~a~0.base)))} is VALID [2022-02-20 23:43:47,519 INFO L290 TraceCheckUtils]: 5: Hoare triple {834#(and (= ~a~0.offset 0) (= |ULTIMATE.start_foo_~i~0#1| 0) (<= 512 (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 {834#(and (= ~a~0.offset 0) (= |ULTIMATE.start_foo_~i~0#1| 0) (<= 512 (select |#length| ~a~0.base)))} is VALID [2022-02-20 23:43:47,519 INFO L290 TraceCheckUtils]: 6: Hoare triple {834#(and (= ~a~0.offset 0) (= |ULTIMATE.start_foo_~i~0#1| 0) (<= 512 (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; {857#(and (= (+ (- 1) |ULTIMATE.start_foo_~i~0#1|) 0) (= ~a~0.offset 0) (<= 512 (select |#length| ~a~0.base)))} is VALID [2022-02-20 23:43:47,520 INFO L290 TraceCheckUtils]: 7: Hoare triple {857#(and (= (+ (- 1) |ULTIMATE.start_foo_~i~0#1|) 0) (= ~a~0.offset 0) (<= 512 (select |#length| ~a~0.base)))} assume !!(foo_~i~0#1 < ~n~0); {857#(and (= (+ (- 1) |ULTIMATE.start_foo_~i~0#1|) 0) (= ~a~0.offset 0) (<= 512 (select |#length| ~a~0.base)))} is VALID [2022-02-20 23:43:47,520 INFO L290 TraceCheckUtils]: 8: Hoare triple {857#(and (= (+ (- 1) |ULTIMATE.start_foo_~i~0#1|) 0) (= ~a~0.offset 0) (<= 512 (select |#length| ~a~0.base)))} 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:47,521 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:47,521 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:43:47,807 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:47,808 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:47,809 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:47,811 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:47,812 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:47,812 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:47,813 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:47,814 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 := 128;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:47,814 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:47,814 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:47,814 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1006138587] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:43:47,814 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:43:47,814 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2022-02-20 23:43:47,815 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363450590] [2022-02-20 23:43:47,815 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:43:47,815 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:47,815 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:43:47,815 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:47,830 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:47,830 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 23:43:47,830 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:43:47,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 23:43:47,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:43:47,831 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:48,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:48,254 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2022-02-20 23:43:48,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:43:48,254 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:48,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:43:48,254 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:48,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 105 transitions. [2022-02-20 23:43:48,255 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:48,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 105 transitions. [2022-02-20 23:43:48,256 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 105 transitions. [2022-02-20 23:43:48,339 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:48,341 INFO L225 Difference]: With dead ends: 95 [2022-02-20 23:43:48,341 INFO L226 Difference]: Without dead ends: 95 [2022-02-20 23:43:48,341 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:48,341 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:48,341 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:48,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-02-20 23:43:48,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 57. [2022-02-20 23:43:48,344 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:43:48,344 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:48,344 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:48,344 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:48,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:48,346 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2022-02-20 23:43:48,346 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2022-02-20 23:43:48,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:48,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:48,346 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:48,346 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:48,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:48,348 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2022-02-20 23:43:48,348 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2022-02-20 23:43:48,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:48,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:48,348 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:43:48,348 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:43:48,348 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:48,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2022-02-20 23:43:48,349 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 9 [2022-02-20 23:43:48,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:43:48,350 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2022-02-20 23:43:48,350 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:48,350 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2022-02-20 23:43:48,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 23:43:48,350 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:43:48,350 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:43:48,373 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:48,566 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:48,567 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:48,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:43:48,567 INFO L85 PathProgramCache]: Analyzing trace with hash 463101433, now seen corresponding path program 1 times [2022-02-20 23:43:48,567 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:43:48,567 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480711560] [2022-02-20 23:43:48,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:48,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:43:48,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:48,634 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:48,634 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 := 128;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:48,635 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:48,635 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:48,636 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:48,636 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:48,636 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:48,637 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:48,637 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:48,637 INFO L290 TraceCheckUtils]: 9: Hoare triple {1239#(= (select |#valid| ~b~0.base) 1)} assume !!(foo_~i~0#1 < 127); {1239#(= (select |#valid| ~b~0.base) 1)} is VALID [2022-02-20 23:43:48,638 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:48,638 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:48,638 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:43:48,638 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480711560] [2022-02-20 23:43:48,638 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480711560] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:43:48,638 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:43:48,638 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:43:48,638 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125432539] [2022-02-20 23:43:48,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:43:48,639 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:48,639 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:43:48,639 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:48,647 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:48,647 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:43:48,647 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:43:48,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:43:48,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:43:48,647 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:48,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:48,721 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2022-02-20 23:43:48,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:43:48,722 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:48,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:43:48,722 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:48,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-02-20 23:43:48,723 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:48,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-02-20 23:43:48,723 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 44 transitions. [2022-02-20 23:43:48,750 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:48,751 INFO L225 Difference]: With dead ends: 55 [2022-02-20 23:43:48,751 INFO L226 Difference]: Without dead ends: 55 [2022-02-20 23:43:48,751 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:48,752 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:48,752 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:48,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-02-20 23:43:48,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-02-20 23:43:48,754 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:43:48,754 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:48,754 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:48,755 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:48,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:48,756 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2022-02-20 23:43:48,756 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2022-02-20 23:43:48,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:48,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:48,756 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:48,756 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:48,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:48,757 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2022-02-20 23:43:48,757 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2022-02-20 23:43:48,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:48,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:48,758 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:43:48,758 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:43:48,758 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:48,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2022-02-20 23:43:48,759 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 11 [2022-02-20 23:43:48,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:43:48,759 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2022-02-20 23:43:48,759 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:48,760 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2022-02-20 23:43:48,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 23:43:48,760 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:43:48,760 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:43:48,760 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 23:43:48,760 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:48,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:43:48,761 INFO L85 PathProgramCache]: Analyzing trace with hash 463101434, now seen corresponding path program 1 times [2022-02-20 23:43:48,761 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:43:48,761 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688239093] [2022-02-20 23:43:48,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:48,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:43:48,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:48,814 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:48,815 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 := 128;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#(<= 128 ~n~0)} is VALID [2022-02-20 23:43:48,817 INFO L290 TraceCheckUtils]: 2: Hoare triple {1466#(<= 128 ~n~0)} SUMMARY for call write~int(0, main_#t~post7#1.base, main_#t~post7#1.offset, 4); srcloc: L538 {1466#(<= 128 ~n~0)} is VALID [2022-02-20 23:43:48,817 INFO L290 TraceCheckUtils]: 3: Hoare triple {1466#(<= 128 ~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 (<= 128 ~n~0) (= |ULTIMATE.start_foo_~i~0#1| 0))} is VALID [2022-02-20 23:43:48,818 INFO L290 TraceCheckUtils]: 4: Hoare triple {1467#(and (<= 128 ~n~0) (= |ULTIMATE.start_foo_~i~0#1| 0))} assume !!(foo_~i~0#1 < ~n~0); {1467#(and (<= 128 ~n~0) (= |ULTIMATE.start_foo_~i~0#1| 0))} is VALID [2022-02-20 23:43:48,818 INFO L290 TraceCheckUtils]: 5: Hoare triple {1467#(and (<= 128 ~n~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 {1467#(and (<= 128 ~n~0) (= |ULTIMATE.start_foo_~i~0#1| 0))} is VALID [2022-02-20 23:43:48,819 INFO L290 TraceCheckUtils]: 6: Hoare triple {1467#(and (<= 128 ~n~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; {1468#(<= (+ |ULTIMATE.start_foo_~i~0#1| 127) ~n~0)} is VALID [2022-02-20 23:43:48,819 INFO L290 TraceCheckUtils]: 7: Hoare triple {1468#(<= (+ |ULTIMATE.start_foo_~i~0#1| 127) ~n~0)} assume !(foo_~i~0#1 < ~n~0); {1465#false} is VALID [2022-02-20 23:43:48,819 INFO L290 TraceCheckUtils]: 8: Hoare triple {1465#false} foo_~i~0#1 := 0; {1465#false} is VALID [2022-02-20 23:43:48,819 INFO L290 TraceCheckUtils]: 9: Hoare triple {1465#false} assume !!(foo_~i~0#1 < 127); {1465#false} is VALID [2022-02-20 23:43:48,820 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:48,820 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:48,820 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:43:48,820 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688239093] [2022-02-20 23:43:48,820 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688239093] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:43:48,820 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563994012] [2022-02-20 23:43:48,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:48,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:43:48,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:43:48,822 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:48,823 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:48,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:48,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:43:48,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:48,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:43:48,951 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:48,952 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 := 128;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#(<= 128 ~n~0)} is VALID [2022-02-20 23:43:48,952 INFO L290 TraceCheckUtils]: 2: Hoare triple {1466#(<= 128 ~n~0)} SUMMARY for call write~int(0, main_#t~post7#1.base, main_#t~post7#1.offset, 4); srcloc: L538 {1466#(<= 128 ~n~0)} is VALID [2022-02-20 23:43:48,952 INFO L290 TraceCheckUtils]: 3: Hoare triple {1466#(<= 128 ~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) (<= 128 ~n~0))} is VALID [2022-02-20 23:43:48,953 INFO L290 TraceCheckUtils]: 4: Hoare triple {1481#(and (<= |ULTIMATE.start_foo_~i~0#1| 0) (<= 128 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {1481#(and (<= |ULTIMATE.start_foo_~i~0#1| 0) (<= 128 ~n~0))} is VALID [2022-02-20 23:43:48,954 INFO L290 TraceCheckUtils]: 5: Hoare triple {1481#(and (<= |ULTIMATE.start_foo_~i~0#1| 0) (<= 128 ~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) (<= 128 ~n~0))} is VALID [2022-02-20 23:43:48,954 INFO L290 TraceCheckUtils]: 6: Hoare triple {1481#(and (<= |ULTIMATE.start_foo_~i~0#1| 0) (<= 128 ~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) (<= 128 ~n~0))} is VALID [2022-02-20 23:43:48,955 INFO L290 TraceCheckUtils]: 7: Hoare triple {1491#(and (<= |ULTIMATE.start_foo_~i~0#1| 1) (<= 128 ~n~0))} assume !(foo_~i~0#1 < ~n~0); {1465#false} is VALID [2022-02-20 23:43:48,955 INFO L290 TraceCheckUtils]: 8: Hoare triple {1465#false} foo_~i~0#1 := 0; {1465#false} is VALID [2022-02-20 23:43:48,955 INFO L290 TraceCheckUtils]: 9: Hoare triple {1465#false} assume !!(foo_~i~0#1 < 127); {1465#false} is VALID [2022-02-20 23:43:48,955 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:48,955 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:48,956 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:43:49,008 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:49,008 INFO L290 TraceCheckUtils]: 9: Hoare triple {1465#false} assume !!(foo_~i~0#1 < 127); {1465#false} is VALID [2022-02-20 23:43:49,009 INFO L290 TraceCheckUtils]: 8: Hoare triple {1465#false} foo_~i~0#1 := 0; {1465#false} is VALID [2022-02-20 23:43:49,009 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:49,009 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:49,010 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:49,010 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:49,010 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:49,011 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:49,011 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 := 128;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:49,011 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:49,012 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:49,012 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1563994012] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:43:49,012 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:43:49,012 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-02-20 23:43:49,012 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437337609] [2022-02-20 23:43:49,012 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:43:49,013 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:49,013 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:43:49,013 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:49,026 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:49,026 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 23:43:49,026 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:43:49,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 23:43:49,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:43:49,027 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:49,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:49,235 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2022-02-20 23:43:49,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:43:49,235 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:49,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:43:49,235 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:49,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 92 transitions. [2022-02-20 23:43:49,236 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:49,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 92 transitions. [2022-02-20 23:43:49,237 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 92 transitions. [2022-02-20 23:43:49,297 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:49,298 INFO L225 Difference]: With dead ends: 87 [2022-02-20 23:43:49,298 INFO L226 Difference]: Without dead ends: 87 [2022-02-20 23:43:49,299 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:49,299 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 211 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:43:49,299 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.1s Time] [2022-02-20 23:43:49,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-02-20 23:43:49,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 55. [2022-02-20 23:43:49,301 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:43:49,301 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:49,301 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:49,301 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:49,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:49,305 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2022-02-20 23:43:49,305 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 90 transitions. [2022-02-20 23:43:49,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:49,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:49,305 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:49,306 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:49,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:49,308 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2022-02-20 23:43:49,308 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 90 transitions. [2022-02-20 23:43:49,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:49,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:49,308 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:43:49,308 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:43:49,308 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:49,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2022-02-20 23:43:49,309 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 11 [2022-02-20 23:43:49,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:43:49,310 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2022-02-20 23:43:49,310 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:49,310 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2022-02-20 23:43:49,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 23:43:49,310 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:43:49,310 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1] [2022-02-20 23:43:49,345 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:49,515 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:49,515 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:49,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:43:49,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1941957673, now seen corresponding path program 2 times [2022-02-20 23:43:49,516 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:43:49,516 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934789464] [2022-02-20 23:43:49,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:49,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:43:49,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:49,701 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:49,703 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 := 128;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 (<= 128 ~n~0) (= ~a~0.offset 0) (= (* ~n~0 4) (select |#length| ~a~0.base)) (not (= ~a~0.base |ULTIMATE.start_main_#t~post7#1.base|)))} is VALID [2022-02-20 23:43:49,704 INFO L290 TraceCheckUtils]: 2: Hoare triple {1858#(and (<= 128 ~n~0) (= ~a~0.offset 0) (= (* ~n~0 4) (select |#length| ~a~0.base)) (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 {1859#(and (<= 128 ~n~0) (= ~a~0.offset 0) (= (* ~n~0 4) (select |#length| ~a~0.base)))} is VALID [2022-02-20 23:43:49,704 INFO L290 TraceCheckUtils]: 3: Hoare triple {1859#(and (<= 128 ~n~0) (= ~a~0.offset 0) (= (* ~n~0 4) (select |#length| ~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; {1860#(and (<= 128 ~n~0) (= ~a~0.offset 0) (= |ULTIMATE.start_foo_~i~0#1| 0) (= (* ~n~0 4) (select |#length| ~a~0.base)))} is VALID [2022-02-20 23:43:49,704 INFO L290 TraceCheckUtils]: 4: Hoare triple {1860#(and (<= 128 ~n~0) (= ~a~0.offset 0) (= |ULTIMATE.start_foo_~i~0#1| 0) (= (* ~n~0 4) (select |#length| ~a~0.base)))} assume !!(foo_~i~0#1 < ~n~0); {1860#(and (<= 128 ~n~0) (= ~a~0.offset 0) (= |ULTIMATE.start_foo_~i~0#1| 0) (= (* ~n~0 4) (select |#length| ~a~0.base)))} is VALID [2022-02-20 23:43:49,712 INFO L290 TraceCheckUtils]: 5: Hoare triple {1860#(and (<= 128 ~n~0) (= ~a~0.offset 0) (= |ULTIMATE.start_foo_~i~0#1| 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 {1860#(and (<= 128 ~n~0) (= ~a~0.offset 0) (= |ULTIMATE.start_foo_~i~0#1| 0) (= (* ~n~0 4) (select |#length| ~a~0.base)))} is VALID [2022-02-20 23:43:49,713 INFO L290 TraceCheckUtils]: 6: Hoare triple {1860#(and (<= 128 ~n~0) (= ~a~0.offset 0) (= |ULTIMATE.start_foo_~i~0#1| 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; {1861#(and (<= (+ |ULTIMATE.start_foo_~i~0#1| 127) ~n~0) (= ~a~0.offset 0) (= (* ~n~0 4) (select |#length| ~a~0.base)) (<= 1 |ULTIMATE.start_foo_~i~0#1|))} is VALID [2022-02-20 23:43:49,714 INFO L290 TraceCheckUtils]: 7: Hoare triple {1861#(and (<= (+ |ULTIMATE.start_foo_~i~0#1| 127) ~n~0) (= ~a~0.offset 0) (= (* ~n~0 4) (select |#length| ~a~0.base)) (<= 1 |ULTIMATE.start_foo_~i~0#1|))} assume !!(foo_~i~0#1 < ~n~0); {1861#(and (<= (+ |ULTIMATE.start_foo_~i~0#1| 127) ~n~0) (= ~a~0.offset 0) (= (* ~n~0 4) (select |#length| ~a~0.base)) (<= 1 |ULTIMATE.start_foo_~i~0#1|))} is VALID [2022-02-20 23:43:49,714 INFO L290 TraceCheckUtils]: 8: Hoare triple {1861#(and (<= (+ |ULTIMATE.start_foo_~i~0#1| 127) ~n~0) (= ~a~0.offset 0) (= (* ~n~0 4) (select |#length| ~a~0.base)) (<= 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 (<= (+ |ULTIMATE.start_foo_~i~0#1| 127) ~n~0) (= ~a~0.offset 0) (= (* ~n~0 4) (select |#length| ~a~0.base)) (<= 1 |ULTIMATE.start_foo_~i~0#1|))} is VALID [2022-02-20 23:43:49,715 INFO L290 TraceCheckUtils]: 9: Hoare triple {1861#(and (<= (+ |ULTIMATE.start_foo_~i~0#1| 127) ~n~0) (= ~a~0.offset 0) (= (* ~n~0 4) (select |#length| ~a~0.base)) (<= 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 (<= (+ |ULTIMATE.start_foo_~i~0#1| 126) ~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:49,715 INFO L290 TraceCheckUtils]: 10: Hoare triple {1862#(and (<= (+ |ULTIMATE.start_foo_~i~0#1| 126) ~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 (<= (+ |ULTIMATE.start_foo_~i~0#1| 126) ~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:49,716 INFO L290 TraceCheckUtils]: 11: Hoare triple {1862#(and (<= (+ |ULTIMATE.start_foo_~i~0#1| 126) ~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 (<= (+ |ULTIMATE.start_foo_~i~0#1| 126) ~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:49,717 INFO L290 TraceCheckUtils]: 12: Hoare triple {1862#(and (<= (+ |ULTIMATE.start_foo_~i~0#1| 126) ~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 (<= 3 |ULTIMATE.start_foo_~i~0#1|) (<= (+ 125 |ULTIMATE.start_foo_~i~0#1|) ~n~0) (= ~a~0.offset 0) (= (* ~n~0 4) (select |#length| ~a~0.base)))} is VALID [2022-02-20 23:43:49,717 INFO L290 TraceCheckUtils]: 13: Hoare triple {1863#(and (<= 3 |ULTIMATE.start_foo_~i~0#1|) (<= (+ 125 |ULTIMATE.start_foo_~i~0#1|) ~n~0) (= ~a~0.offset 0) (= (* ~n~0 4) (select |#length| ~a~0.base)))} assume !!(foo_~i~0#1 < ~n~0); {1863#(and (<= 3 |ULTIMATE.start_foo_~i~0#1|) (<= (+ 125 |ULTIMATE.start_foo_~i~0#1|) ~n~0) (= ~a~0.offset 0) (= (* ~n~0 4) (select |#length| ~a~0.base)))} is VALID [2022-02-20 23:43:49,718 INFO L290 TraceCheckUtils]: 14: Hoare triple {1863#(and (<= 3 |ULTIMATE.start_foo_~i~0#1|) (<= (+ 125 |ULTIMATE.start_foo_~i~0#1|) ~n~0) (= ~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 (<= 3 |ULTIMATE.start_foo_~i~0#1|) (<= (+ 125 |ULTIMATE.start_foo_~i~0#1|) ~n~0) (= ~a~0.offset 0) (= (* ~n~0 4) (select |#length| ~a~0.base)))} is VALID [2022-02-20 23:43:49,718 INFO L290 TraceCheckUtils]: 15: Hoare triple {1863#(and (<= 3 |ULTIMATE.start_foo_~i~0#1|) (<= (+ 125 |ULTIMATE.start_foo_~i~0#1|) ~n~0) (= ~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 (<= 4 |ULTIMATE.start_foo_~i~0#1|) (<= (+ |ULTIMATE.start_foo_~i~0#1| 124) ~n~0) (= ~a~0.offset 0) (= (* ~n~0 4) (select |#length| ~a~0.base)))} is VALID [2022-02-20 23:43:49,719 INFO L290 TraceCheckUtils]: 16: Hoare triple {1864#(and (<= 4 |ULTIMATE.start_foo_~i~0#1|) (<= (+ |ULTIMATE.start_foo_~i~0#1| 124) ~n~0) (= ~a~0.offset 0) (= (* ~n~0 4) (select |#length| ~a~0.base)))} assume !!(foo_~i~0#1 < ~n~0); {1865#(and (<= 4 |ULTIMATE.start_foo_~i~0#1|) (<= (+ 496 (* |ULTIMATE.start_foo_~i~0#1| 4)) (select |#length| ~a~0.base)) (= ~a~0.offset 0))} is VALID [2022-02-20 23:43:49,720 INFO L290 TraceCheckUtils]: 17: Hoare triple {1865#(and (<= 4 |ULTIMATE.start_foo_~i~0#1|) (<= (+ 496 (* |ULTIMATE.start_foo_~i~0#1| 4)) (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); {1857#false} is VALID [2022-02-20 23:43:49,720 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:49,720 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:43:49,720 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934789464] [2022-02-20 23:43:49,720 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934789464] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:43:49,720 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136985319] [2022-02-20 23:43:49,720 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 23:43:49,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:43:49,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:43:49,722 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:49,723 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:49,768 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 23:43:49,768 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 23:43:49,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 15 conjunts are in the unsatisfiable core [2022-02-20 23:43:49,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:49,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:43:49,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:43:49,822 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:49,830 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:50,077 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:50,078 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 := 128;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:50,078 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:50,079 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:50,079 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:50,080 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:50,080 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:50,081 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:50,081 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:50,082 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:50,082 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:50,083 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:50,083 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:50,084 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:50,085 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:50,086 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:50,096 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:50,099 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:50,099 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:50,099 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:43:50,996 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:50,996 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:50,997 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:50,998 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:50,999 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:50,999 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:51,000 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:51,001 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:51,001 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:51,002 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:51,003 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:51,004 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:51,004 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:51,005 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:51,006 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:51,006 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:51,007 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 := 128;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:51,007 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:51,008 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:51,008 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1136985319] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:43:51,008 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:43:51,008 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23 [2022-02-20 23:43:51,009 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305959004] [2022-02-20 23:43:51,009 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:43:51,009 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:51,009 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:43:51,010 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:51,055 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:51,055 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-02-20 23:43:51,056 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:43:51,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-02-20 23:43:51,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=382, Unknown=0, NotChecked=0, Total=552 [2022-02-20 23:43:51,056 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:52,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:52,277 INFO L93 Difference]: Finished difference Result 184 states and 190 transitions. [2022-02-20 23:43:52,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 23:43:52,278 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:52,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:43:52,278 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:52,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 194 transitions. [2022-02-20 23:43:52,280 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:52,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 194 transitions. [2022-02-20 23:43:52,281 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 194 transitions. [2022-02-20 23:43:52,431 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:52,433 INFO L225 Difference]: With dead ends: 184 [2022-02-20 23:43:52,433 INFO L226 Difference]: Without dead ends: 184 [2022-02-20 23:43:52,433 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:52,434 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 897 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:43:52,434 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.4s Time] [2022-02-20 23:43:52,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-02-20 23:43:52,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 59. [2022-02-20 23:43:52,445 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:43:52,445 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:52,445 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:52,445 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:52,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:52,449 INFO L93 Difference]: Finished difference Result 184 states and 190 transitions. [2022-02-20 23:43:52,449 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 190 transitions. [2022-02-20 23:43:52,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:52,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:52,450 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:52,450 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:52,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:52,453 INFO L93 Difference]: Finished difference Result 184 states and 190 transitions. [2022-02-20 23:43:52,453 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 190 transitions. [2022-02-20 23:43:52,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:52,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:52,454 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:43:52,454 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:43:52,454 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:52,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2022-02-20 23:43:52,455 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 18 [2022-02-20 23:43:52,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:43:52,456 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2022-02-20 23:43:52,457 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:52,457 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2022-02-20 23:43:52,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 23:43:52,457 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:43:52,457 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:43:52,474 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:52,667 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:52,667 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:52,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:43:52,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1502042668, now seen corresponding path program 2 times [2022-02-20 23:43:52,668 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:43:52,668 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453945145] [2022-02-20 23:43:52,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:52,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:43:52,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:52,789 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:52,790 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 := 128;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#(<= 128 ~n~0)} is VALID [2022-02-20 23:43:52,790 INFO L290 TraceCheckUtils]: 2: Hoare triple {2605#(<= 128 ~n~0)} SUMMARY for call write~int(0, main_#t~post7#1.base, main_#t~post7#1.offset, 4); srcloc: L538 {2605#(<= 128 ~n~0)} is VALID [2022-02-20 23:43:52,791 INFO L290 TraceCheckUtils]: 3: Hoare triple {2605#(<= 128 ~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 (<= 128 ~n~0) (= |ULTIMATE.start_foo_~i~0#1| 0))} is VALID [2022-02-20 23:43:52,791 INFO L290 TraceCheckUtils]: 4: Hoare triple {2606#(and (<= 128 ~n~0) (= |ULTIMATE.start_foo_~i~0#1| 0))} assume !!(foo_~i~0#1 < ~n~0); {2606#(and (<= 128 ~n~0) (= |ULTIMATE.start_foo_~i~0#1| 0))} is VALID [2022-02-20 23:43:52,792 INFO L290 TraceCheckUtils]: 5: Hoare triple {2606#(and (<= 128 ~n~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 {2606#(and (<= 128 ~n~0) (= |ULTIMATE.start_foo_~i~0#1| 0))} is VALID [2022-02-20 23:43:52,792 INFO L290 TraceCheckUtils]: 6: Hoare triple {2606#(and (<= 128 ~n~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; {2607#(<= (+ |ULTIMATE.start_foo_~i~0#1| 127) ~n~0)} is VALID [2022-02-20 23:43:52,792 INFO L290 TraceCheckUtils]: 7: Hoare triple {2607#(<= (+ |ULTIMATE.start_foo_~i~0#1| 127) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {2607#(<= (+ |ULTIMATE.start_foo_~i~0#1| 127) ~n~0)} is VALID [2022-02-20 23:43:52,795 INFO L290 TraceCheckUtils]: 8: Hoare triple {2607#(<= (+ |ULTIMATE.start_foo_~i~0#1| 127) ~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| 127) ~n~0)} is VALID [2022-02-20 23:43:52,796 INFO L290 TraceCheckUtils]: 9: Hoare triple {2607#(<= (+ |ULTIMATE.start_foo_~i~0#1| 127) ~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#(<= (+ |ULTIMATE.start_foo_~i~0#1| 126) ~n~0)} is VALID [2022-02-20 23:43:52,796 INFO L290 TraceCheckUtils]: 10: Hoare triple {2608#(<= (+ |ULTIMATE.start_foo_~i~0#1| 126) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {2608#(<= (+ |ULTIMATE.start_foo_~i~0#1| 126) ~n~0)} is VALID [2022-02-20 23:43:52,796 INFO L290 TraceCheckUtils]: 11: Hoare triple {2608#(<= (+ |ULTIMATE.start_foo_~i~0#1| 126) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {2608#(<= (+ |ULTIMATE.start_foo_~i~0#1| 126) ~n~0)} is VALID [2022-02-20 23:43:52,797 INFO L290 TraceCheckUtils]: 12: Hoare triple {2608#(<= (+ |ULTIMATE.start_foo_~i~0#1| 126) ~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#(<= (+ 125 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:43:52,797 INFO L290 TraceCheckUtils]: 13: Hoare triple {2609#(<= (+ 125 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {2609#(<= (+ 125 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:43:52,798 INFO L290 TraceCheckUtils]: 14: Hoare triple {2609#(<= (+ 125 |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 {2609#(<= (+ 125 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:43:52,798 INFO L290 TraceCheckUtils]: 15: Hoare triple {2609#(<= (+ 125 |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; {2610#(<= (+ |ULTIMATE.start_foo_~i~0#1| 124) ~n~0)} is VALID [2022-02-20 23:43:52,799 INFO L290 TraceCheckUtils]: 16: Hoare triple {2610#(<= (+ |ULTIMATE.start_foo_~i~0#1| 124) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {2610#(<= (+ |ULTIMATE.start_foo_~i~0#1| 124) ~n~0)} is VALID [2022-02-20 23:43:52,799 INFO L290 TraceCheckUtils]: 17: Hoare triple {2610#(<= (+ |ULTIMATE.start_foo_~i~0#1| 124) ~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| 124) ~n~0)} is VALID [2022-02-20 23:43:52,799 INFO L290 TraceCheckUtils]: 18: Hoare triple {2610#(<= (+ |ULTIMATE.start_foo_~i~0#1| 124) ~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| 123) ~n~0)} is VALID [2022-02-20 23:43:52,800 INFO L290 TraceCheckUtils]: 19: Hoare triple {2611#(<= (+ |ULTIMATE.start_foo_~i~0#1| 123) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {2611#(<= (+ |ULTIMATE.start_foo_~i~0#1| 123) ~n~0)} is VALID [2022-02-20 23:43:52,800 INFO L290 TraceCheckUtils]: 20: Hoare triple {2611#(<= (+ |ULTIMATE.start_foo_~i~0#1| 123) ~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| 123) ~n~0)} is VALID [2022-02-20 23:43:52,800 INFO L290 TraceCheckUtils]: 21: Hoare triple {2611#(<= (+ |ULTIMATE.start_foo_~i~0#1| 123) ~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| 122) ~n~0)} is VALID [2022-02-20 23:43:52,801 INFO L290 TraceCheckUtils]: 22: Hoare triple {2612#(<= (+ |ULTIMATE.start_foo_~i~0#1| 122) ~n~0)} assume !(foo_~i~0#1 < ~n~0); {2604#false} is VALID [2022-02-20 23:43:52,801 INFO L290 TraceCheckUtils]: 23: Hoare triple {2604#false} foo_~i~0#1 := 0; {2604#false} is VALID [2022-02-20 23:43:52,801 INFO L290 TraceCheckUtils]: 24: Hoare triple {2604#false} assume !!(foo_~i~0#1 < 127); {2604#false} is VALID [2022-02-20 23:43:52,801 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:52,801 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:52,801 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:43:52,801 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453945145] [2022-02-20 23:43:52,801 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453945145] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:43:52,801 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754020287] [2022-02-20 23:43:52,801 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 23:43:52,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:43:52,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:43:52,802 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:52,803 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:52,856 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-20 23:43:52,856 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 23:43:52,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 23:43:52,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:52,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:43:52,952 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-20 23:43:52,952 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:53,130 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:53,131 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 := 128;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 (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:43:53,132 INFO L290 TraceCheckUtils]: 2: Hoare triple {2619#(and (<= 128 (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 (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:43:53,132 INFO L290 TraceCheckUtils]: 3: Hoare triple {2619#(and (<= 128 (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 (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:43:53,132 INFO L290 TraceCheckUtils]: 4: Hoare triple {2619#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} assume !!(foo_~i~0#1 < ~n~0); {2619#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:43:53,133 INFO L290 TraceCheckUtils]: 5: Hoare triple {2619#(and (<= 128 (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 (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:43:53,133 INFO L290 TraceCheckUtils]: 6: Hoare triple {2619#(and (<= 128 (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 (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:43:53,133 INFO L290 TraceCheckUtils]: 7: Hoare triple {2619#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} assume !!(foo_~i~0#1 < ~n~0); {2619#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:43:53,134 INFO L290 TraceCheckUtils]: 8: Hoare triple {2619#(and (<= 128 (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 (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:43:53,134 INFO L290 TraceCheckUtils]: 9: Hoare triple {2619#(and (<= 128 (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 (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:43:53,135 INFO L290 TraceCheckUtils]: 10: Hoare triple {2619#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} assume !!(foo_~i~0#1 < ~n~0); {2619#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:43:53,135 INFO L290 TraceCheckUtils]: 11: Hoare triple {2619#(and (<= 128 (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 (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:43:53,135 INFO L290 TraceCheckUtils]: 12: Hoare triple {2619#(and (<= 128 (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 (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:43:53,136 INFO L290 TraceCheckUtils]: 13: Hoare triple {2619#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} assume !!(foo_~i~0#1 < ~n~0); {2619#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:43:53,136 INFO L290 TraceCheckUtils]: 14: Hoare triple {2619#(and (<= 128 (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 (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:43:53,137 INFO L290 TraceCheckUtils]: 15: Hoare triple {2619#(and (<= 128 (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 (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:43:53,137 INFO L290 TraceCheckUtils]: 16: Hoare triple {2619#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} assume !!(foo_~i~0#1 < ~n~0); {2619#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:43:53,137 INFO L290 TraceCheckUtils]: 17: Hoare triple {2619#(and (<= 128 (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 (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:43:53,138 INFO L290 TraceCheckUtils]: 18: Hoare triple {2619#(and (<= 128 (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 (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:43:53,138 INFO L290 TraceCheckUtils]: 19: Hoare triple {2619#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} assume !!(foo_~i~0#1 < ~n~0); {2619#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:43:53,138 INFO L290 TraceCheckUtils]: 20: Hoare triple {2619#(and (<= 128 (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 (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:43:53,139 INFO L290 TraceCheckUtils]: 21: Hoare triple {2619#(and (<= 128 (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 (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:43:53,139 INFO L290 TraceCheckUtils]: 22: Hoare triple {2619#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} assume !(foo_~i~0#1 < ~n~0); {2619#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:43:53,139 INFO L290 TraceCheckUtils]: 23: Hoare triple {2619#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} foo_~i~0#1 := 0; {2686#(and (<= 128 (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:53,140 INFO L290 TraceCheckUtils]: 24: Hoare triple {2686#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4) (= |ULTIMATE.start_foo_~i~0#1| 0))} assume !!(foo_~i~0#1 < 127); {2686#(and (<= 128 (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:53,140 INFO L290 TraceCheckUtils]: 25: Hoare triple {2686#(and (<= 128 (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:53,140 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:53,140 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:43:53,141 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754020287] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:43:53,141 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 23:43:53,141 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 12 [2022-02-20 23:43:53,141 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365761030] [2022-02-20 23:43:53,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:43:53,141 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:53,141 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:43:53,141 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,149 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,149 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:43:53,149 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:43:53,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:43:53,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-02-20 23:43:53,149 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:53,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:53,200 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2022-02-20 23:43:53,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:43:53,201 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:53,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:43:53,201 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:53,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-02-20 23:43:53,201 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:53,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-02-20 23:43:53,202 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2022-02-20 23:43:53,252 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:53,253 INFO L225 Difference]: With dead ends: 47 [2022-02-20 23:43:53,253 INFO L226 Difference]: Without dead ends: 47 [2022-02-20 23:43:53,253 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:53,255 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 24 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:43:53,255 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 28 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:43:53,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-02-20 23:43:53,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-02-20 23:43:53,257 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:43:53,258 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 46 states have internal predecessors, (48), 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,258 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 46 states have internal predecessors, (48), 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,258 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 46 states have internal predecessors, (48), 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,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:53,259 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2022-02-20 23:43:53,259 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2022-02-20 23:43:53,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:53,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:53,259 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 46 states have internal predecessors, (48), 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:53,260 INFO L87 Difference]: Start difference. First operand has 47 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 46 states have internal predecessors, (48), 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:53,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:53,260 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2022-02-20 23:43:53,260 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2022-02-20 23:43:53,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:53,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:53,261 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:43:53,261 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:43:53,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 46 states have internal predecessors, (48), 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,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2022-02-20 23:43:53,261 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 26 [2022-02-20 23:43:53,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:43:53,263 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2022-02-20 23:43:53,263 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:53,263 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2022-02-20 23:43:53,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 23:43:53,263 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:43:53,263 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:43:53,280 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:53,473 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:53,473 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:53,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:43:53,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1911110645, now seen corresponding path program 1 times [2022-02-20 23:43:53,474 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:43:53,474 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079739774] [2022-02-20 23:43:53,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:53,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:43:53,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:53,565 INFO L290 TraceCheckUtils]: 0: Hoare triple {2880#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; {2880#true} is VALID [2022-02-20 23:43:53,566 INFO L290 TraceCheckUtils]: 1: Hoare triple {2880#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 := 128;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; {2882#(<= 128 ~n~0)} is VALID [2022-02-20 23:43:53,566 INFO L290 TraceCheckUtils]: 2: Hoare triple {2882#(<= 128 ~n~0)} SUMMARY for call write~int(0, main_#t~post7#1.base, main_#t~post7#1.offset, 4); srcloc: L538 {2882#(<= 128 ~n~0)} is VALID [2022-02-20 23:43:53,566 INFO L290 TraceCheckUtils]: 3: Hoare triple {2882#(<= 128 ~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; {2883#(and (<= 128 ~n~0) (= |ULTIMATE.start_foo_~i~0#1| 0))} is VALID [2022-02-20 23:43:53,567 INFO L290 TraceCheckUtils]: 4: Hoare triple {2883#(and (<= 128 ~n~0) (= |ULTIMATE.start_foo_~i~0#1| 0))} assume !!(foo_~i~0#1 < ~n~0); {2883#(and (<= 128 ~n~0) (= |ULTIMATE.start_foo_~i~0#1| 0))} is VALID [2022-02-20 23:43:53,567 INFO L290 TraceCheckUtils]: 5: Hoare triple {2883#(and (<= 128 ~n~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 {2883#(and (<= 128 ~n~0) (= |ULTIMATE.start_foo_~i~0#1| 0))} is VALID [2022-02-20 23:43:53,567 INFO L290 TraceCheckUtils]: 6: Hoare triple {2883#(and (<= 128 ~n~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; {2884#(<= (+ |ULTIMATE.start_foo_~i~0#1| 127) ~n~0)} is VALID [2022-02-20 23:43:53,568 INFO L290 TraceCheckUtils]: 7: Hoare triple {2884#(<= (+ |ULTIMATE.start_foo_~i~0#1| 127) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {2884#(<= (+ |ULTIMATE.start_foo_~i~0#1| 127) ~n~0)} is VALID [2022-02-20 23:43:53,568 INFO L290 TraceCheckUtils]: 8: Hoare triple {2884#(<= (+ |ULTIMATE.start_foo_~i~0#1| 127) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {2884#(<= (+ |ULTIMATE.start_foo_~i~0#1| 127) ~n~0)} is VALID [2022-02-20 23:43:53,571 INFO L290 TraceCheckUtils]: 9: Hoare triple {2884#(<= (+ |ULTIMATE.start_foo_~i~0#1| 127) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {2885#(<= (+ |ULTIMATE.start_foo_~i~0#1| 126) ~n~0)} is VALID [2022-02-20 23:43:53,571 INFO L290 TraceCheckUtils]: 10: Hoare triple {2885#(<= (+ |ULTIMATE.start_foo_~i~0#1| 126) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {2885#(<= (+ |ULTIMATE.start_foo_~i~0#1| 126) ~n~0)} is VALID [2022-02-20 23:43:53,572 INFO L290 TraceCheckUtils]: 11: Hoare triple {2885#(<= (+ |ULTIMATE.start_foo_~i~0#1| 126) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {2885#(<= (+ |ULTIMATE.start_foo_~i~0#1| 126) ~n~0)} is VALID [2022-02-20 23:43:53,572 INFO L290 TraceCheckUtils]: 12: Hoare triple {2885#(<= (+ |ULTIMATE.start_foo_~i~0#1| 126) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {2886#(<= (+ 125 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:43:53,572 INFO L290 TraceCheckUtils]: 13: Hoare triple {2886#(<= (+ 125 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {2886#(<= (+ 125 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:43:53,572 INFO L290 TraceCheckUtils]: 14: Hoare triple {2886#(<= (+ 125 |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 {2886#(<= (+ 125 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:43:53,573 INFO L290 TraceCheckUtils]: 15: Hoare triple {2886#(<= (+ 125 |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; {2887#(<= (+ |ULTIMATE.start_foo_~i~0#1| 124) ~n~0)} is VALID [2022-02-20 23:43:53,573 INFO L290 TraceCheckUtils]: 16: Hoare triple {2887#(<= (+ |ULTIMATE.start_foo_~i~0#1| 124) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {2887#(<= (+ |ULTIMATE.start_foo_~i~0#1| 124) ~n~0)} is VALID [2022-02-20 23:43:53,573 INFO L290 TraceCheckUtils]: 17: Hoare triple {2887#(<= (+ |ULTIMATE.start_foo_~i~0#1| 124) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {2887#(<= (+ |ULTIMATE.start_foo_~i~0#1| 124) ~n~0)} is VALID [2022-02-20 23:43:53,574 INFO L290 TraceCheckUtils]: 18: Hoare triple {2887#(<= (+ |ULTIMATE.start_foo_~i~0#1| 124) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {2888#(<= (+ |ULTIMATE.start_foo_~i~0#1| 123) ~n~0)} is VALID [2022-02-20 23:43:53,574 INFO L290 TraceCheckUtils]: 19: Hoare triple {2888#(<= (+ |ULTIMATE.start_foo_~i~0#1| 123) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {2888#(<= (+ |ULTIMATE.start_foo_~i~0#1| 123) ~n~0)} is VALID [2022-02-20 23:43:53,574 INFO L290 TraceCheckUtils]: 20: Hoare triple {2888#(<= (+ |ULTIMATE.start_foo_~i~0#1| 123) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {2888#(<= (+ |ULTIMATE.start_foo_~i~0#1| 123) ~n~0)} is VALID [2022-02-20 23:43:53,575 INFO L290 TraceCheckUtils]: 21: Hoare triple {2888#(<= (+ |ULTIMATE.start_foo_~i~0#1| 123) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {2889#(<= (+ |ULTIMATE.start_foo_~i~0#1| 122) ~n~0)} is VALID [2022-02-20 23:43:53,575 INFO L290 TraceCheckUtils]: 22: Hoare triple {2889#(<= (+ |ULTIMATE.start_foo_~i~0#1| 122) ~n~0)} assume !(foo_~i~0#1 < ~n~0); {2881#false} is VALID [2022-02-20 23:43:53,575 INFO L290 TraceCheckUtils]: 23: Hoare triple {2881#false} foo_~i~0#1 := 0; {2881#false} is VALID [2022-02-20 23:43:53,575 INFO L290 TraceCheckUtils]: 24: Hoare triple {2881#false} assume !!(foo_~i~0#1 < 127); {2881#false} is VALID [2022-02-20 23:43:53,575 INFO L290 TraceCheckUtils]: 25: Hoare triple {2881#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {2881#false} is VALID [2022-02-20 23:43:53,575 INFO L290 TraceCheckUtils]: 26: Hoare triple {2881#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {2881#false} is VALID [2022-02-20 23:43:53,575 INFO L290 TraceCheckUtils]: 27: Hoare triple {2881#false} assume !!(foo_~i~0#1 < 127); {2881#false} is VALID [2022-02-20 23:43:53,575 INFO L290 TraceCheckUtils]: 28: Hoare triple {2881#false} assume !(4 + (~b~0.offset + 4 * foo_~i~0#1) <= #length[~b~0.base] && 0 <= ~b~0.offset + 4 * foo_~i~0#1); {2881#false} is VALID [2022-02-20 23:43:53,576 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:53,576 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:43:53,576 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079739774] [2022-02-20 23:43:53,576 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079739774] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:43:53,577 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1014180192] [2022-02-20 23:43:53,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:53,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:43:53,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:43:53,578 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:53,579 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:53,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:53,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 23:43:53,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:53,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:43:53,915 INFO L290 TraceCheckUtils]: 0: Hoare triple {2880#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; {2880#true} is VALID [2022-02-20 23:43:53,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {2880#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 := 128;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; {2882#(<= 128 ~n~0)} is VALID [2022-02-20 23:43:53,916 INFO L290 TraceCheckUtils]: 2: Hoare triple {2882#(<= 128 ~n~0)} SUMMARY for call write~int(0, main_#t~post7#1.base, main_#t~post7#1.offset, 4); srcloc: L538 {2882#(<= 128 ~n~0)} is VALID [2022-02-20 23:43:53,917 INFO L290 TraceCheckUtils]: 3: Hoare triple {2882#(<= 128 ~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; {2902#(and (<= |ULTIMATE.start_foo_~i~0#1| 0) (<= 128 ~n~0))} is VALID [2022-02-20 23:43:53,917 INFO L290 TraceCheckUtils]: 4: Hoare triple {2902#(and (<= |ULTIMATE.start_foo_~i~0#1| 0) (<= 128 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {2902#(and (<= |ULTIMATE.start_foo_~i~0#1| 0) (<= 128 ~n~0))} is VALID [2022-02-20 23:43:53,918 INFO L290 TraceCheckUtils]: 5: Hoare triple {2902#(and (<= |ULTIMATE.start_foo_~i~0#1| 0) (<= 128 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {2902#(and (<= |ULTIMATE.start_foo_~i~0#1| 0) (<= 128 ~n~0))} is VALID [2022-02-20 23:43:53,918 INFO L290 TraceCheckUtils]: 6: Hoare triple {2902#(and (<= |ULTIMATE.start_foo_~i~0#1| 0) (<= 128 ~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#(and (<= |ULTIMATE.start_foo_~i~0#1| 1) (<= 128 ~n~0))} is VALID [2022-02-20 23:43:53,919 INFO L290 TraceCheckUtils]: 7: Hoare triple {2912#(and (<= |ULTIMATE.start_foo_~i~0#1| 1) (<= 128 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {2912#(and (<= |ULTIMATE.start_foo_~i~0#1| 1) (<= 128 ~n~0))} is VALID [2022-02-20 23:43:53,919 INFO L290 TraceCheckUtils]: 8: Hoare triple {2912#(and (<= |ULTIMATE.start_foo_~i~0#1| 1) (<= 128 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {2912#(and (<= |ULTIMATE.start_foo_~i~0#1| 1) (<= 128 ~n~0))} is VALID [2022-02-20 23:43:53,920 INFO L290 TraceCheckUtils]: 9: Hoare triple {2912#(and (<= |ULTIMATE.start_foo_~i~0#1| 1) (<= 128 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {2922#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 2))} is VALID [2022-02-20 23:43:53,920 INFO L290 TraceCheckUtils]: 10: Hoare triple {2922#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 2))} assume !!(foo_~i~0#1 < ~n~0); {2922#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 2))} is VALID [2022-02-20 23:43:53,920 INFO L290 TraceCheckUtils]: 11: Hoare triple {2922#(and (<= 128 ~n~0) (<= |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 {2922#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 2))} is VALID [2022-02-20 23:43:53,921 INFO L290 TraceCheckUtils]: 12: Hoare triple {2922#(and (<= 128 ~n~0) (<= |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; {2932#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 3))} is VALID [2022-02-20 23:43:53,921 INFO L290 TraceCheckUtils]: 13: Hoare triple {2932#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 3))} assume !!(foo_~i~0#1 < ~n~0); {2932#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 3))} is VALID [2022-02-20 23:43:53,922 INFO L290 TraceCheckUtils]: 14: Hoare triple {2932#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 3))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {2932#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 3))} is VALID [2022-02-20 23:43:53,922 INFO L290 TraceCheckUtils]: 15: Hoare triple {2932#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 3))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {2942#(and (<= |ULTIMATE.start_foo_~i~0#1| 4) (<= 128 ~n~0))} is VALID [2022-02-20 23:43:53,922 INFO L290 TraceCheckUtils]: 16: Hoare triple {2942#(and (<= |ULTIMATE.start_foo_~i~0#1| 4) (<= 128 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {2942#(and (<= |ULTIMATE.start_foo_~i~0#1| 4) (<= 128 ~n~0))} is VALID [2022-02-20 23:43:53,923 INFO L290 TraceCheckUtils]: 17: Hoare triple {2942#(and (<= |ULTIMATE.start_foo_~i~0#1| 4) (<= 128 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {2942#(and (<= |ULTIMATE.start_foo_~i~0#1| 4) (<= 128 ~n~0))} is VALID [2022-02-20 23:43:53,923 INFO L290 TraceCheckUtils]: 18: Hoare triple {2942#(and (<= |ULTIMATE.start_foo_~i~0#1| 4) (<= 128 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {2952#(and (<= |ULTIMATE.start_foo_~i~0#1| 5) (<= 128 ~n~0))} is VALID [2022-02-20 23:43:53,924 INFO L290 TraceCheckUtils]: 19: Hoare triple {2952#(and (<= |ULTIMATE.start_foo_~i~0#1| 5) (<= 128 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {2952#(and (<= |ULTIMATE.start_foo_~i~0#1| 5) (<= 128 ~n~0))} is VALID [2022-02-20 23:43:53,924 INFO L290 TraceCheckUtils]: 20: Hoare triple {2952#(and (<= |ULTIMATE.start_foo_~i~0#1| 5) (<= 128 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {2952#(and (<= |ULTIMATE.start_foo_~i~0#1| 5) (<= 128 ~n~0))} is VALID [2022-02-20 23:43:53,925 INFO L290 TraceCheckUtils]: 21: Hoare triple {2952#(and (<= |ULTIMATE.start_foo_~i~0#1| 5) (<= 128 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {2962#(and (<= |ULTIMATE.start_foo_~i~0#1| 6) (<= 128 ~n~0))} is VALID [2022-02-20 23:43:53,925 INFO L290 TraceCheckUtils]: 22: Hoare triple {2962#(and (<= |ULTIMATE.start_foo_~i~0#1| 6) (<= 128 ~n~0))} assume !(foo_~i~0#1 < ~n~0); {2881#false} is VALID [2022-02-20 23:43:53,925 INFO L290 TraceCheckUtils]: 23: Hoare triple {2881#false} foo_~i~0#1 := 0; {2881#false} is VALID [2022-02-20 23:43:53,926 INFO L290 TraceCheckUtils]: 24: Hoare triple {2881#false} assume !!(foo_~i~0#1 < 127); {2881#false} is VALID [2022-02-20 23:43:53,926 INFO L290 TraceCheckUtils]: 25: Hoare triple {2881#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {2881#false} is VALID [2022-02-20 23:43:53,926 INFO L290 TraceCheckUtils]: 26: Hoare triple {2881#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {2881#false} is VALID [2022-02-20 23:43:53,926 INFO L290 TraceCheckUtils]: 27: Hoare triple {2881#false} assume !!(foo_~i~0#1 < 127); {2881#false} is VALID [2022-02-20 23:43:53,926 INFO L290 TraceCheckUtils]: 28: Hoare triple {2881#false} assume !(4 + (~b~0.offset + 4 * foo_~i~0#1) <= #length[~b~0.base] && 0 <= ~b~0.offset + 4 * foo_~i~0#1); {2881#false} is VALID [2022-02-20 23:43:53,926 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:53,926 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:43:54,130 INFO L290 TraceCheckUtils]: 28: Hoare triple {2881#false} assume !(4 + (~b~0.offset + 4 * foo_~i~0#1) <= #length[~b~0.base] && 0 <= ~b~0.offset + 4 * foo_~i~0#1); {2881#false} is VALID [2022-02-20 23:43:54,131 INFO L290 TraceCheckUtils]: 27: Hoare triple {2881#false} assume !!(foo_~i~0#1 < 127); {2881#false} is VALID [2022-02-20 23:43:54,131 INFO L290 TraceCheckUtils]: 26: Hoare triple {2881#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {2881#false} is VALID [2022-02-20 23:43:54,131 INFO L290 TraceCheckUtils]: 25: Hoare triple {2881#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {2881#false} is VALID [2022-02-20 23:43:54,131 INFO L290 TraceCheckUtils]: 24: Hoare triple {2881#false} assume !!(foo_~i~0#1 < 127); {2881#false} is VALID [2022-02-20 23:43:54,131 INFO L290 TraceCheckUtils]: 23: Hoare triple {2881#false} foo_~i~0#1 := 0; {2881#false} is VALID [2022-02-20 23:43:54,134 INFO L290 TraceCheckUtils]: 22: Hoare triple {3002#(< |ULTIMATE.start_foo_~i~0#1| ~n~0)} assume !(foo_~i~0#1 < ~n~0); {2881#false} is VALID [2022-02-20 23:43:54,134 INFO L290 TraceCheckUtils]: 21: Hoare triple {3006#(< (+ |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; {3002#(< |ULTIMATE.start_foo_~i~0#1| ~n~0)} is VALID [2022-02-20 23:43:54,134 INFO L290 TraceCheckUtils]: 20: Hoare triple {3006#(< (+ |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 {3006#(< (+ |ULTIMATE.start_foo_~i~0#1| 1) ~n~0)} is VALID [2022-02-20 23:43:54,135 INFO L290 TraceCheckUtils]: 19: Hoare triple {3006#(< (+ |ULTIMATE.start_foo_~i~0#1| 1) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {3006#(< (+ |ULTIMATE.start_foo_~i~0#1| 1) ~n~0)} is VALID [2022-02-20 23:43:54,135 INFO L290 TraceCheckUtils]: 18: Hoare triple {3016#(< (+ |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; {3006#(< (+ |ULTIMATE.start_foo_~i~0#1| 1) ~n~0)} is VALID [2022-02-20 23:43:54,135 INFO L290 TraceCheckUtils]: 17: Hoare triple {3016#(< (+ |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 {3016#(< (+ |ULTIMATE.start_foo_~i~0#1| 2) ~n~0)} is VALID [2022-02-20 23:43:54,136 INFO L290 TraceCheckUtils]: 16: Hoare triple {3016#(< (+ |ULTIMATE.start_foo_~i~0#1| 2) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {3016#(< (+ |ULTIMATE.start_foo_~i~0#1| 2) ~n~0)} is VALID [2022-02-20 23:43:54,136 INFO L290 TraceCheckUtils]: 15: Hoare triple {3026#(< (+ |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; {3016#(< (+ |ULTIMATE.start_foo_~i~0#1| 2) ~n~0)} is VALID [2022-02-20 23:43:54,137 INFO L290 TraceCheckUtils]: 14: Hoare triple {3026#(< (+ |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 {3026#(< (+ |ULTIMATE.start_foo_~i~0#1| 3) ~n~0)} is VALID [2022-02-20 23:43:54,137 INFO L290 TraceCheckUtils]: 13: Hoare triple {3026#(< (+ |ULTIMATE.start_foo_~i~0#1| 3) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {3026#(< (+ |ULTIMATE.start_foo_~i~0#1| 3) ~n~0)} is VALID [2022-02-20 23:43:54,137 INFO L290 TraceCheckUtils]: 12: Hoare triple {3036#(< (+ |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; {3026#(< (+ |ULTIMATE.start_foo_~i~0#1| 3) ~n~0)} is VALID [2022-02-20 23:43:54,140 INFO L290 TraceCheckUtils]: 11: Hoare triple {3036#(< (+ |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 {3036#(< (+ |ULTIMATE.start_foo_~i~0#1| 4) ~n~0)} is VALID [2022-02-20 23:43:54,140 INFO L290 TraceCheckUtils]: 10: Hoare triple {3036#(< (+ |ULTIMATE.start_foo_~i~0#1| 4) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {3036#(< (+ |ULTIMATE.start_foo_~i~0#1| 4) ~n~0)} is VALID [2022-02-20 23:43:54,140 INFO L290 TraceCheckUtils]: 9: Hoare triple {3046#(< (+ |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; {3036#(< (+ |ULTIMATE.start_foo_~i~0#1| 4) ~n~0)} is VALID [2022-02-20 23:43:54,141 INFO L290 TraceCheckUtils]: 8: Hoare triple {3046#(< (+ |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 {3046#(< (+ |ULTIMATE.start_foo_~i~0#1| 5) ~n~0)} is VALID [2022-02-20 23:43:54,141 INFO L290 TraceCheckUtils]: 7: Hoare triple {3046#(< (+ |ULTIMATE.start_foo_~i~0#1| 5) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {3046#(< (+ |ULTIMATE.start_foo_~i~0#1| 5) ~n~0)} is VALID [2022-02-20 23:43:54,141 INFO L290 TraceCheckUtils]: 6: Hoare triple {3056#(< (+ |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; {3046#(< (+ |ULTIMATE.start_foo_~i~0#1| 5) ~n~0)} is VALID [2022-02-20 23:43:54,142 INFO L290 TraceCheckUtils]: 5: Hoare triple {3056#(< (+ |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 {3056#(< (+ |ULTIMATE.start_foo_~i~0#1| 6) ~n~0)} is VALID [2022-02-20 23:43:54,142 INFO L290 TraceCheckUtils]: 4: Hoare triple {3056#(< (+ |ULTIMATE.start_foo_~i~0#1| 6) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {3056#(< (+ |ULTIMATE.start_foo_~i~0#1| 6) ~n~0)} is VALID [2022-02-20 23:43:54,142 INFO L290 TraceCheckUtils]: 3: Hoare triple {3066#(< 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; {3056#(< (+ |ULTIMATE.start_foo_~i~0#1| 6) ~n~0)} is VALID [2022-02-20 23:43:54,143 INFO L290 TraceCheckUtils]: 2: Hoare triple {3066#(< 6 ~n~0)} SUMMARY for call write~int(0, main_#t~post7#1.base, main_#t~post7#1.offset, 4); srcloc: L538 {3066#(< 6 ~n~0)} is VALID [2022-02-20 23:43:54,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {2880#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 := 128;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; {3066#(< 6 ~n~0)} is VALID [2022-02-20 23:43:54,143 INFO L290 TraceCheckUtils]: 0: Hoare triple {2880#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; {2880#true} is VALID [2022-02-20 23:43:54,143 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:54,144 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1014180192] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:43:54,144 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:43:54,144 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2022-02-20 23:43:54,144 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059201172] [2022-02-20 23:43:54,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:43:54,144 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:54,144 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:43:54,144 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:54,191 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:54,191 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-02-20 23:43:54,192 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:43:54,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-02-20 23:43:54,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=341, Unknown=0, NotChecked=0, Total=600 [2022-02-20 23:43:54,192 INFO L87 Difference]: Start difference. First operand 47 states and 48 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:43:54,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:54,830 INFO L93 Difference]: Finished difference Result 205 states and 206 transitions. [2022-02-20 23:43:54,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-20 23:43:54,830 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:54,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:43:54,830 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:43:54,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 219 transitions. [2022-02-20 23:43:54,832 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:43:54,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 219 transitions. [2022-02-20 23:43:54,833 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 219 transitions. [2022-02-20 23:43:54,984 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 219 edges. 219 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:54,986 INFO L225 Difference]: With dead ends: 205 [2022-02-20 23:43:54,986 INFO L226 Difference]: Without dead ends: 205 [2022-02-20 23:43:54,987 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:43:54,987 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 772 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 772 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:43:54,987 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [772 Valid, 190 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:43:54,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-02-20 23:43:54,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 86. [2022-02-20 23:43:54,992 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:43:54,992 INFO L82 GeneralOperation]: Start isEquivalent. First operand 205 states. Second operand has 86 states, 81 states have (on average 1.1358024691358024) internal successors, (92), 85 states have internal predecessors, (92), 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,992 INFO L74 IsIncluded]: Start isIncluded. First operand 205 states. Second operand has 86 states, 81 states have (on average 1.1358024691358024) internal successors, (92), 85 states have internal predecessors, (92), 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,992 INFO L87 Difference]: Start difference. First operand 205 states. Second operand has 86 states, 81 states have (on average 1.1358024691358024) internal successors, (92), 85 states have internal predecessors, (92), 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,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:54,995 INFO L93 Difference]: Finished difference Result 205 states and 206 transitions. [2022-02-20 23:43:54,995 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 206 transitions. [2022-02-20 23:43:54,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:54,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:54,995 INFO L74 IsIncluded]: Start isIncluded. First operand has 86 states, 81 states have (on average 1.1358024691358024) internal successors, (92), 85 states have internal predecessors, (92), 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 205 states. [2022-02-20 23:43:54,995 INFO L87 Difference]: Start difference. First operand has 86 states, 81 states have (on average 1.1358024691358024) internal successors, (92), 85 states have internal predecessors, (92), 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 205 states. [2022-02-20 23:43:55,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:55,002 INFO L93 Difference]: Finished difference Result 205 states and 206 transitions. [2022-02-20 23:43:55,003 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 206 transitions. [2022-02-20 23:43:55,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:55,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:55,003 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:43:55,003 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:43:55,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 81 states have (on average 1.1358024691358024) internal successors, (92), 85 states have internal predecessors, (92), 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:55,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2022-02-20 23:43:55,006 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 29 [2022-02-20 23:43:55,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:43:55,007 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2022-02-20 23:43:55,007 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:43:55,007 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2022-02-20 23:43:55,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-20 23:43:55,008 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:43:55,008 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 14, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:43:55,030 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:43:55,224 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:43:55,226 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:43:55,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:43:55,227 INFO L85 PathProgramCache]: Analyzing trace with hash -248790283, now seen corresponding path program 2 times [2022-02-20 23:43:55,227 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:43:55,227 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701324611] [2022-02-20 23:43:55,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:55,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:43:55,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:55,507 INFO L290 TraceCheckUtils]: 0: Hoare triple {3790#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; {3790#true} is VALID [2022-02-20 23:43:55,509 INFO L290 TraceCheckUtils]: 1: Hoare triple {3790#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 := 128;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; {3792#(<= 128 ~n~0)} is VALID [2022-02-20 23:43:55,509 INFO L290 TraceCheckUtils]: 2: Hoare triple {3792#(<= 128 ~n~0)} SUMMARY for call write~int(0, main_#t~post7#1.base, main_#t~post7#1.offset, 4); srcloc: L538 {3792#(<= 128 ~n~0)} is VALID [2022-02-20 23:43:55,509 INFO L290 TraceCheckUtils]: 3: Hoare triple {3792#(<= 128 ~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; {3793#(and (<= 128 ~n~0) (= |ULTIMATE.start_foo_~i~0#1| 0))} is VALID [2022-02-20 23:43:55,510 INFO L290 TraceCheckUtils]: 4: Hoare triple {3793#(and (<= 128 ~n~0) (= |ULTIMATE.start_foo_~i~0#1| 0))} assume !!(foo_~i~0#1 < ~n~0); {3793#(and (<= 128 ~n~0) (= |ULTIMATE.start_foo_~i~0#1| 0))} is VALID [2022-02-20 23:43:55,510 INFO L290 TraceCheckUtils]: 5: Hoare triple {3793#(and (<= 128 ~n~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 {3793#(and (<= 128 ~n~0) (= |ULTIMATE.start_foo_~i~0#1| 0))} is VALID [2022-02-20 23:43:55,511 INFO L290 TraceCheckUtils]: 6: Hoare triple {3793#(and (<= 128 ~n~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; {3794#(<= (+ |ULTIMATE.start_foo_~i~0#1| 127) ~n~0)} is VALID [2022-02-20 23:43:55,511 INFO L290 TraceCheckUtils]: 7: Hoare triple {3794#(<= (+ |ULTIMATE.start_foo_~i~0#1| 127) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {3794#(<= (+ |ULTIMATE.start_foo_~i~0#1| 127) ~n~0)} is VALID [2022-02-20 23:43:55,511 INFO L290 TraceCheckUtils]: 8: Hoare triple {3794#(<= (+ |ULTIMATE.start_foo_~i~0#1| 127) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {3794#(<= (+ |ULTIMATE.start_foo_~i~0#1| 127) ~n~0)} is VALID [2022-02-20 23:43:55,512 INFO L290 TraceCheckUtils]: 9: Hoare triple {3794#(<= (+ |ULTIMATE.start_foo_~i~0#1| 127) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {3795#(<= (+ |ULTIMATE.start_foo_~i~0#1| 126) ~n~0)} is VALID [2022-02-20 23:43:55,512 INFO L290 TraceCheckUtils]: 10: Hoare triple {3795#(<= (+ |ULTIMATE.start_foo_~i~0#1| 126) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {3795#(<= (+ |ULTIMATE.start_foo_~i~0#1| 126) ~n~0)} is VALID [2022-02-20 23:43:55,512 INFO L290 TraceCheckUtils]: 11: Hoare triple {3795#(<= (+ |ULTIMATE.start_foo_~i~0#1| 126) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {3795#(<= (+ |ULTIMATE.start_foo_~i~0#1| 126) ~n~0)} is VALID [2022-02-20 23:43:55,513 INFO L290 TraceCheckUtils]: 12: Hoare triple {3795#(<= (+ |ULTIMATE.start_foo_~i~0#1| 126) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {3796#(<= (+ 125 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:43:55,513 INFO L290 TraceCheckUtils]: 13: Hoare triple {3796#(<= (+ 125 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {3796#(<= (+ 125 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:43:55,514 INFO L290 TraceCheckUtils]: 14: Hoare triple {3796#(<= (+ 125 |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 {3796#(<= (+ 125 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:43:55,514 INFO L290 TraceCheckUtils]: 15: Hoare triple {3796#(<= (+ 125 |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; {3797#(<= (+ |ULTIMATE.start_foo_~i~0#1| 124) ~n~0)} is VALID [2022-02-20 23:43:55,514 INFO L290 TraceCheckUtils]: 16: Hoare triple {3797#(<= (+ |ULTIMATE.start_foo_~i~0#1| 124) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {3797#(<= (+ |ULTIMATE.start_foo_~i~0#1| 124) ~n~0)} is VALID [2022-02-20 23:43:55,515 INFO L290 TraceCheckUtils]: 17: Hoare triple {3797#(<= (+ |ULTIMATE.start_foo_~i~0#1| 124) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {3797#(<= (+ |ULTIMATE.start_foo_~i~0#1| 124) ~n~0)} is VALID [2022-02-20 23:43:55,515 INFO L290 TraceCheckUtils]: 18: Hoare triple {3797#(<= (+ |ULTIMATE.start_foo_~i~0#1| 124) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {3798#(<= (+ |ULTIMATE.start_foo_~i~0#1| 123) ~n~0)} is VALID [2022-02-20 23:43:55,516 INFO L290 TraceCheckUtils]: 19: Hoare triple {3798#(<= (+ |ULTIMATE.start_foo_~i~0#1| 123) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {3798#(<= (+ |ULTIMATE.start_foo_~i~0#1| 123) ~n~0)} is VALID [2022-02-20 23:43:55,516 INFO L290 TraceCheckUtils]: 20: Hoare triple {3798#(<= (+ |ULTIMATE.start_foo_~i~0#1| 123) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {3798#(<= (+ |ULTIMATE.start_foo_~i~0#1| 123) ~n~0)} is VALID [2022-02-20 23:43:55,517 INFO L290 TraceCheckUtils]: 21: Hoare triple {3798#(<= (+ |ULTIMATE.start_foo_~i~0#1| 123) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {3799#(<= (+ |ULTIMATE.start_foo_~i~0#1| 122) ~n~0)} is VALID [2022-02-20 23:43:55,517 INFO L290 TraceCheckUtils]: 22: Hoare triple {3799#(<= (+ |ULTIMATE.start_foo_~i~0#1| 122) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {3799#(<= (+ |ULTIMATE.start_foo_~i~0#1| 122) ~n~0)} is VALID [2022-02-20 23:43:55,518 INFO L290 TraceCheckUtils]: 23: Hoare triple {3799#(<= (+ |ULTIMATE.start_foo_~i~0#1| 122) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {3799#(<= (+ |ULTIMATE.start_foo_~i~0#1| 122) ~n~0)} is VALID [2022-02-20 23:43:55,518 INFO L290 TraceCheckUtils]: 24: Hoare triple {3799#(<= (+ |ULTIMATE.start_foo_~i~0#1| 122) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {3800#(<= (+ |ULTIMATE.start_foo_~i~0#1| 121) ~n~0)} is VALID [2022-02-20 23:43:55,518 INFO L290 TraceCheckUtils]: 25: Hoare triple {3800#(<= (+ |ULTIMATE.start_foo_~i~0#1| 121) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {3800#(<= (+ |ULTIMATE.start_foo_~i~0#1| 121) ~n~0)} is VALID [2022-02-20 23:43:55,519 INFO L290 TraceCheckUtils]: 26: Hoare triple {3800#(<= (+ |ULTIMATE.start_foo_~i~0#1| 121) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {3800#(<= (+ |ULTIMATE.start_foo_~i~0#1| 121) ~n~0)} is VALID [2022-02-20 23:43:55,519 INFO L290 TraceCheckUtils]: 27: Hoare triple {3800#(<= (+ |ULTIMATE.start_foo_~i~0#1| 121) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {3801#(<= (+ |ULTIMATE.start_foo_~i~0#1| 120) ~n~0)} is VALID [2022-02-20 23:43:55,520 INFO L290 TraceCheckUtils]: 28: Hoare triple {3801#(<= (+ |ULTIMATE.start_foo_~i~0#1| 120) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {3801#(<= (+ |ULTIMATE.start_foo_~i~0#1| 120) ~n~0)} is VALID [2022-02-20 23:43:55,521 INFO L290 TraceCheckUtils]: 29: Hoare triple {3801#(<= (+ |ULTIMATE.start_foo_~i~0#1| 120) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {3801#(<= (+ |ULTIMATE.start_foo_~i~0#1| 120) ~n~0)} is VALID [2022-02-20 23:43:55,521 INFO L290 TraceCheckUtils]: 30: Hoare triple {3801#(<= (+ |ULTIMATE.start_foo_~i~0#1| 120) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {3802#(<= (+ 119 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:43:55,522 INFO L290 TraceCheckUtils]: 31: Hoare triple {3802#(<= (+ 119 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {3802#(<= (+ 119 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:43:55,522 INFO L290 TraceCheckUtils]: 32: Hoare triple {3802#(<= (+ 119 |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 {3802#(<= (+ 119 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:43:55,523 INFO L290 TraceCheckUtils]: 33: Hoare triple {3802#(<= (+ 119 |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; {3803#(<= (+ |ULTIMATE.start_foo_~i~0#1| 118) ~n~0)} is VALID [2022-02-20 23:43:55,523 INFO L290 TraceCheckUtils]: 34: Hoare triple {3803#(<= (+ |ULTIMATE.start_foo_~i~0#1| 118) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {3803#(<= (+ |ULTIMATE.start_foo_~i~0#1| 118) ~n~0)} is VALID [2022-02-20 23:43:55,523 INFO L290 TraceCheckUtils]: 35: Hoare triple {3803#(<= (+ |ULTIMATE.start_foo_~i~0#1| 118) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {3803#(<= (+ |ULTIMATE.start_foo_~i~0#1| 118) ~n~0)} is VALID [2022-02-20 23:43:55,524 INFO L290 TraceCheckUtils]: 36: Hoare triple {3803#(<= (+ |ULTIMATE.start_foo_~i~0#1| 118) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {3804#(<= (+ |ULTIMATE.start_foo_~i~0#1| 117) ~n~0)} is VALID [2022-02-20 23:43:55,524 INFO L290 TraceCheckUtils]: 37: Hoare triple {3804#(<= (+ |ULTIMATE.start_foo_~i~0#1| 117) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {3804#(<= (+ |ULTIMATE.start_foo_~i~0#1| 117) ~n~0)} is VALID [2022-02-20 23:43:55,525 INFO L290 TraceCheckUtils]: 38: Hoare triple {3804#(<= (+ |ULTIMATE.start_foo_~i~0#1| 117) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {3804#(<= (+ |ULTIMATE.start_foo_~i~0#1| 117) ~n~0)} is VALID [2022-02-20 23:43:55,525 INFO L290 TraceCheckUtils]: 39: Hoare triple {3804#(<= (+ |ULTIMATE.start_foo_~i~0#1| 117) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {3805#(<= (+ 116 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:43:55,526 INFO L290 TraceCheckUtils]: 40: Hoare triple {3805#(<= (+ 116 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {3805#(<= (+ 116 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:43:55,526 INFO L290 TraceCheckUtils]: 41: Hoare triple {3805#(<= (+ 116 |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 {3805#(<= (+ 116 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:43:55,527 INFO L290 TraceCheckUtils]: 42: Hoare triple {3805#(<= (+ 116 |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; {3806#(<= (+ 115 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:43:55,527 INFO L290 TraceCheckUtils]: 43: Hoare triple {3806#(<= (+ 115 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {3806#(<= (+ 115 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:43:55,527 INFO L290 TraceCheckUtils]: 44: Hoare triple {3806#(<= (+ 115 |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 {3806#(<= (+ 115 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:43:55,528 INFO L290 TraceCheckUtils]: 45: Hoare triple {3806#(<= (+ 115 |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; {3807#(<= (+ |ULTIMATE.start_foo_~i~0#1| 114) ~n~0)} is VALID [2022-02-20 23:43:55,528 INFO L290 TraceCheckUtils]: 46: Hoare triple {3807#(<= (+ |ULTIMATE.start_foo_~i~0#1| 114) ~n~0)} assume !(foo_~i~0#1 < ~n~0); {3791#false} is VALID [2022-02-20 23:43:55,528 INFO L290 TraceCheckUtils]: 47: Hoare triple {3791#false} foo_~i~0#1 := 0; {3791#false} is VALID [2022-02-20 23:43:55,529 INFO L290 TraceCheckUtils]: 48: Hoare triple {3791#false} assume !!(foo_~i~0#1 < 127); {3791#false} is VALID [2022-02-20 23:43:55,529 INFO L290 TraceCheckUtils]: 49: Hoare triple {3791#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {3791#false} is VALID [2022-02-20 23:43:55,529 INFO L290 TraceCheckUtils]: 50: Hoare triple {3791#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {3791#false} is VALID [2022-02-20 23:43:55,529 INFO L290 TraceCheckUtils]: 51: Hoare triple {3791#false} assume !!(foo_~i~0#1 < 127); {3791#false} is VALID [2022-02-20 23:43:55,529 INFO L290 TraceCheckUtils]: 52: Hoare triple {3791#false} assume !(4 + (~b~0.offset + 4 * foo_~i~0#1) <= #length[~b~0.base] && 0 <= ~b~0.offset + 4 * foo_~i~0#1); {3791#false} is VALID [2022-02-20 23:43:55,530 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:43:55,530 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:43:55,530 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701324611] [2022-02-20 23:43:55,530 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701324611] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:43:55,531 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [504330992] [2022-02-20 23:43:55,531 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 23:43:55,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:43:55,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:43:55,532 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:43:55,533 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:43:55,611 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 23:43:55,611 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 23:43:55,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 17 conjunts are in the unsatisfiable core [2022-02-20 23:43:55,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:55,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:43:56,213 INFO L290 TraceCheckUtils]: 0: Hoare triple {3790#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; {3790#true} is VALID [2022-02-20 23:43:56,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {3790#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 := 128;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; {3792#(<= 128 ~n~0)} is VALID [2022-02-20 23:43:56,214 INFO L290 TraceCheckUtils]: 2: Hoare triple {3792#(<= 128 ~n~0)} SUMMARY for call write~int(0, main_#t~post7#1.base, main_#t~post7#1.offset, 4); srcloc: L538 {3792#(<= 128 ~n~0)} is VALID [2022-02-20 23:43:56,215 INFO L290 TraceCheckUtils]: 3: Hoare triple {3792#(<= 128 ~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; {3820#(and (<= |ULTIMATE.start_foo_~i~0#1| 0) (<= 128 ~n~0))} is VALID [2022-02-20 23:43:56,215 INFO L290 TraceCheckUtils]: 4: Hoare triple {3820#(and (<= |ULTIMATE.start_foo_~i~0#1| 0) (<= 128 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {3820#(and (<= |ULTIMATE.start_foo_~i~0#1| 0) (<= 128 ~n~0))} is VALID [2022-02-20 23:43:56,215 INFO L290 TraceCheckUtils]: 5: Hoare triple {3820#(and (<= |ULTIMATE.start_foo_~i~0#1| 0) (<= 128 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {3820#(and (<= |ULTIMATE.start_foo_~i~0#1| 0) (<= 128 ~n~0))} is VALID [2022-02-20 23:43:56,216 INFO L290 TraceCheckUtils]: 6: Hoare triple {3820#(and (<= |ULTIMATE.start_foo_~i~0#1| 0) (<= 128 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {3830#(and (<= |ULTIMATE.start_foo_~i~0#1| 1) (<= 128 ~n~0))} is VALID [2022-02-20 23:43:56,217 INFO L290 TraceCheckUtils]: 7: Hoare triple {3830#(and (<= |ULTIMATE.start_foo_~i~0#1| 1) (<= 128 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {3830#(and (<= |ULTIMATE.start_foo_~i~0#1| 1) (<= 128 ~n~0))} is VALID [2022-02-20 23:43:56,217 INFO L290 TraceCheckUtils]: 8: Hoare triple {3830#(and (<= |ULTIMATE.start_foo_~i~0#1| 1) (<= 128 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {3830#(and (<= |ULTIMATE.start_foo_~i~0#1| 1) (<= 128 ~n~0))} is VALID [2022-02-20 23:43:56,218 INFO L290 TraceCheckUtils]: 9: Hoare triple {3830#(and (<= |ULTIMATE.start_foo_~i~0#1| 1) (<= 128 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {3840#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 2))} is VALID [2022-02-20 23:43:56,218 INFO L290 TraceCheckUtils]: 10: Hoare triple {3840#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 2))} assume !!(foo_~i~0#1 < ~n~0); {3840#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 2))} is VALID [2022-02-20 23:43:56,218 INFO L290 TraceCheckUtils]: 11: Hoare triple {3840#(and (<= 128 ~n~0) (<= |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 {3840#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 2))} is VALID [2022-02-20 23:43:56,219 INFO L290 TraceCheckUtils]: 12: Hoare triple {3840#(and (<= 128 ~n~0) (<= |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; {3850#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 3))} is VALID [2022-02-20 23:43:56,219 INFO L290 TraceCheckUtils]: 13: Hoare triple {3850#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 3))} assume !!(foo_~i~0#1 < ~n~0); {3850#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 3))} is VALID [2022-02-20 23:43:56,220 INFO L290 TraceCheckUtils]: 14: Hoare triple {3850#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 3))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {3850#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 3))} is VALID [2022-02-20 23:43:56,220 INFO L290 TraceCheckUtils]: 15: Hoare triple {3850#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 3))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {3860#(and (<= |ULTIMATE.start_foo_~i~0#1| 4) (<= 128 ~n~0))} is VALID [2022-02-20 23:43:56,220 INFO L290 TraceCheckUtils]: 16: Hoare triple {3860#(and (<= |ULTIMATE.start_foo_~i~0#1| 4) (<= 128 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {3860#(and (<= |ULTIMATE.start_foo_~i~0#1| 4) (<= 128 ~n~0))} is VALID [2022-02-20 23:43:56,221 INFO L290 TraceCheckUtils]: 17: Hoare triple {3860#(and (<= |ULTIMATE.start_foo_~i~0#1| 4) (<= 128 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {3860#(and (<= |ULTIMATE.start_foo_~i~0#1| 4) (<= 128 ~n~0))} is VALID [2022-02-20 23:43:56,221 INFO L290 TraceCheckUtils]: 18: Hoare triple {3860#(and (<= |ULTIMATE.start_foo_~i~0#1| 4) (<= 128 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {3870#(and (<= |ULTIMATE.start_foo_~i~0#1| 5) (<= 128 ~n~0))} is VALID [2022-02-20 23:43:56,221 INFO L290 TraceCheckUtils]: 19: Hoare triple {3870#(and (<= |ULTIMATE.start_foo_~i~0#1| 5) (<= 128 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {3870#(and (<= |ULTIMATE.start_foo_~i~0#1| 5) (<= 128 ~n~0))} is VALID [2022-02-20 23:43:56,222 INFO L290 TraceCheckUtils]: 20: Hoare triple {3870#(and (<= |ULTIMATE.start_foo_~i~0#1| 5) (<= 128 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {3870#(and (<= |ULTIMATE.start_foo_~i~0#1| 5) (<= 128 ~n~0))} is VALID [2022-02-20 23:43:56,223 INFO L290 TraceCheckUtils]: 21: Hoare triple {3870#(and (<= |ULTIMATE.start_foo_~i~0#1| 5) (<= 128 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {3880#(and (<= |ULTIMATE.start_foo_~i~0#1| 6) (<= 128 ~n~0))} is VALID [2022-02-20 23:43:56,223 INFO L290 TraceCheckUtils]: 22: Hoare triple {3880#(and (<= |ULTIMATE.start_foo_~i~0#1| 6) (<= 128 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {3880#(and (<= |ULTIMATE.start_foo_~i~0#1| 6) (<= 128 ~n~0))} is VALID [2022-02-20 23:43:56,223 INFO L290 TraceCheckUtils]: 23: Hoare triple {3880#(and (<= |ULTIMATE.start_foo_~i~0#1| 6) (<= 128 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {3880#(and (<= |ULTIMATE.start_foo_~i~0#1| 6) (<= 128 ~n~0))} is VALID [2022-02-20 23:43:56,224 INFO L290 TraceCheckUtils]: 24: Hoare triple {3880#(and (<= |ULTIMATE.start_foo_~i~0#1| 6) (<= 128 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {3890#(and (<= |ULTIMATE.start_foo_~i~0#1| 7) (<= 128 ~n~0))} is VALID [2022-02-20 23:43:56,224 INFO L290 TraceCheckUtils]: 25: Hoare triple {3890#(and (<= |ULTIMATE.start_foo_~i~0#1| 7) (<= 128 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {3890#(and (<= |ULTIMATE.start_foo_~i~0#1| 7) (<= 128 ~n~0))} is VALID [2022-02-20 23:43:56,225 INFO L290 TraceCheckUtils]: 26: Hoare triple {3890#(and (<= |ULTIMATE.start_foo_~i~0#1| 7) (<= 128 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {3890#(and (<= |ULTIMATE.start_foo_~i~0#1| 7) (<= 128 ~n~0))} is VALID [2022-02-20 23:43:56,225 INFO L290 TraceCheckUtils]: 27: Hoare triple {3890#(and (<= |ULTIMATE.start_foo_~i~0#1| 7) (<= 128 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {3900#(and (<= |ULTIMATE.start_foo_~i~0#1| 8) (<= 128 ~n~0))} is VALID [2022-02-20 23:43:56,225 INFO L290 TraceCheckUtils]: 28: Hoare triple {3900#(and (<= |ULTIMATE.start_foo_~i~0#1| 8) (<= 128 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {3900#(and (<= |ULTIMATE.start_foo_~i~0#1| 8) (<= 128 ~n~0))} is VALID [2022-02-20 23:43:56,226 INFO L290 TraceCheckUtils]: 29: Hoare triple {3900#(and (<= |ULTIMATE.start_foo_~i~0#1| 8) (<= 128 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {3900#(and (<= |ULTIMATE.start_foo_~i~0#1| 8) (<= 128 ~n~0))} is VALID [2022-02-20 23:43:56,226 INFO L290 TraceCheckUtils]: 30: Hoare triple {3900#(and (<= |ULTIMATE.start_foo_~i~0#1| 8) (<= 128 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {3910#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 9))} is VALID [2022-02-20 23:43:56,227 INFO L290 TraceCheckUtils]: 31: Hoare triple {3910#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 9))} assume !!(foo_~i~0#1 < ~n~0); {3910#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 9))} is VALID [2022-02-20 23:43:56,227 INFO L290 TraceCheckUtils]: 32: Hoare triple {3910#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 9))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {3910#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 9))} is VALID [2022-02-20 23:43:56,227 INFO L290 TraceCheckUtils]: 33: Hoare triple {3910#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 9))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {3920#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 10))} is VALID [2022-02-20 23:43:56,228 INFO L290 TraceCheckUtils]: 34: Hoare triple {3920#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 10))} assume !!(foo_~i~0#1 < ~n~0); {3920#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 10))} is VALID [2022-02-20 23:43:56,228 INFO L290 TraceCheckUtils]: 35: Hoare triple {3920#(and (<= 128 ~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 {3920#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 10))} is VALID [2022-02-20 23:43:56,229 INFO L290 TraceCheckUtils]: 36: Hoare triple {3920#(and (<= 128 ~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; {3930#(and (<= |ULTIMATE.start_foo_~i~0#1| 11) (<= 128 ~n~0))} is VALID [2022-02-20 23:43:56,229 INFO L290 TraceCheckUtils]: 37: Hoare triple {3930#(and (<= |ULTIMATE.start_foo_~i~0#1| 11) (<= 128 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {3930#(and (<= |ULTIMATE.start_foo_~i~0#1| 11) (<= 128 ~n~0))} is VALID [2022-02-20 23:43:56,229 INFO L290 TraceCheckUtils]: 38: Hoare triple {3930#(and (<= |ULTIMATE.start_foo_~i~0#1| 11) (<= 128 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {3930#(and (<= |ULTIMATE.start_foo_~i~0#1| 11) (<= 128 ~n~0))} is VALID [2022-02-20 23:43:56,230 INFO L290 TraceCheckUtils]: 39: Hoare triple {3930#(and (<= |ULTIMATE.start_foo_~i~0#1| 11) (<= 128 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {3940#(and (<= |ULTIMATE.start_foo_~i~0#1| 12) (<= 128 ~n~0))} is VALID [2022-02-20 23:43:56,230 INFO L290 TraceCheckUtils]: 40: Hoare triple {3940#(and (<= |ULTIMATE.start_foo_~i~0#1| 12) (<= 128 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {3940#(and (<= |ULTIMATE.start_foo_~i~0#1| 12) (<= 128 ~n~0))} is VALID [2022-02-20 23:43:56,231 INFO L290 TraceCheckUtils]: 41: Hoare triple {3940#(and (<= |ULTIMATE.start_foo_~i~0#1| 12) (<= 128 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {3940#(and (<= |ULTIMATE.start_foo_~i~0#1| 12) (<= 128 ~n~0))} is VALID [2022-02-20 23:43:56,233 INFO L290 TraceCheckUtils]: 42: Hoare triple {3940#(and (<= |ULTIMATE.start_foo_~i~0#1| 12) (<= 128 ~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#(and (<= |ULTIMATE.start_foo_~i~0#1| 13) (<= 128 ~n~0))} is VALID [2022-02-20 23:43:56,234 INFO L290 TraceCheckUtils]: 43: Hoare triple {3950#(and (<= |ULTIMATE.start_foo_~i~0#1| 13) (<= 128 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {3950#(and (<= |ULTIMATE.start_foo_~i~0#1| 13) (<= 128 ~n~0))} is VALID [2022-02-20 23:43:56,236 INFO L290 TraceCheckUtils]: 44: Hoare triple {3950#(and (<= |ULTIMATE.start_foo_~i~0#1| 13) (<= 128 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {3950#(and (<= |ULTIMATE.start_foo_~i~0#1| 13) (<= 128 ~n~0))} is VALID [2022-02-20 23:43:56,242 INFO L290 TraceCheckUtils]: 45: Hoare triple {3950#(and (<= |ULTIMATE.start_foo_~i~0#1| 13) (<= 128 ~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#(and (<= |ULTIMATE.start_foo_~i~0#1| 14) (<= 128 ~n~0))} is VALID [2022-02-20 23:43:56,255 INFO L290 TraceCheckUtils]: 46: Hoare triple {3960#(and (<= |ULTIMATE.start_foo_~i~0#1| 14) (<= 128 ~n~0))} assume !(foo_~i~0#1 < ~n~0); {3791#false} is VALID [2022-02-20 23:43:56,256 INFO L290 TraceCheckUtils]: 47: Hoare triple {3791#false} foo_~i~0#1 := 0; {3791#false} is VALID [2022-02-20 23:43:56,256 INFO L290 TraceCheckUtils]: 48: Hoare triple {3791#false} assume !!(foo_~i~0#1 < 127); {3791#false} is VALID [2022-02-20 23:43:56,256 INFO L290 TraceCheckUtils]: 49: Hoare triple {3791#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {3791#false} is VALID [2022-02-20 23:43:56,256 INFO L290 TraceCheckUtils]: 50: Hoare triple {3791#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {3791#false} is VALID [2022-02-20 23:43:56,256 INFO L290 TraceCheckUtils]: 51: Hoare triple {3791#false} assume !!(foo_~i~0#1 < 127); {3791#false} is VALID [2022-02-20 23:43:56,256 INFO L290 TraceCheckUtils]: 52: Hoare triple {3791#false} assume !(4 + (~b~0.offset + 4 * foo_~i~0#1) <= #length[~b~0.base] && 0 <= ~b~0.offset + 4 * foo_~i~0#1); {3791#false} is VALID [2022-02-20 23:43:56,256 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:43:56,256 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:43:56,796 INFO L290 TraceCheckUtils]: 52: Hoare triple {3791#false} assume !(4 + (~b~0.offset + 4 * foo_~i~0#1) <= #length[~b~0.base] && 0 <= ~b~0.offset + 4 * foo_~i~0#1); {3791#false} is VALID [2022-02-20 23:43:56,796 INFO L290 TraceCheckUtils]: 51: Hoare triple {3791#false} assume !!(foo_~i~0#1 < 127); {3791#false} is VALID [2022-02-20 23:43:56,796 INFO L290 TraceCheckUtils]: 50: Hoare triple {3791#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {3791#false} is VALID [2022-02-20 23:43:56,796 INFO L290 TraceCheckUtils]: 49: Hoare triple {3791#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {3791#false} is VALID [2022-02-20 23:43:56,796 INFO L290 TraceCheckUtils]: 48: Hoare triple {3791#false} assume !!(foo_~i~0#1 < 127); {3791#false} is VALID [2022-02-20 23:43:56,796 INFO L290 TraceCheckUtils]: 47: Hoare triple {3791#false} foo_~i~0#1 := 0; {3791#false} is VALID [2022-02-20 23:43:56,797 INFO L290 TraceCheckUtils]: 46: Hoare triple {4000#(< |ULTIMATE.start_foo_~i~0#1| ~n~0)} assume !(foo_~i~0#1 < ~n~0); {3791#false} is VALID [2022-02-20 23:43:56,797 INFO L290 TraceCheckUtils]: 45: Hoare triple {4004#(< (+ |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; {4000#(< |ULTIMATE.start_foo_~i~0#1| ~n~0)} is VALID [2022-02-20 23:43:56,798 INFO L290 TraceCheckUtils]: 44: Hoare triple {4004#(< (+ |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 {4004#(< (+ |ULTIMATE.start_foo_~i~0#1| 1) ~n~0)} is VALID [2022-02-20 23:43:56,798 INFO L290 TraceCheckUtils]: 43: Hoare triple {4004#(< (+ |ULTIMATE.start_foo_~i~0#1| 1) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {4004#(< (+ |ULTIMATE.start_foo_~i~0#1| 1) ~n~0)} is VALID [2022-02-20 23:43:56,799 INFO L290 TraceCheckUtils]: 42: Hoare triple {4014#(< (+ |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; {4004#(< (+ |ULTIMATE.start_foo_~i~0#1| 1) ~n~0)} is VALID [2022-02-20 23:43:56,799 INFO L290 TraceCheckUtils]: 41: Hoare triple {4014#(< (+ |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 {4014#(< (+ |ULTIMATE.start_foo_~i~0#1| 2) ~n~0)} is VALID [2022-02-20 23:43:56,799 INFO L290 TraceCheckUtils]: 40: Hoare triple {4014#(< (+ |ULTIMATE.start_foo_~i~0#1| 2) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {4014#(< (+ |ULTIMATE.start_foo_~i~0#1| 2) ~n~0)} is VALID [2022-02-20 23:43:56,814 INFO L290 TraceCheckUtils]: 39: Hoare triple {4024#(< (+ |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; {4014#(< (+ |ULTIMATE.start_foo_~i~0#1| 2) ~n~0)} is VALID [2022-02-20 23:43:56,815 INFO L290 TraceCheckUtils]: 38: Hoare triple {4024#(< (+ |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 {4024#(< (+ |ULTIMATE.start_foo_~i~0#1| 3) ~n~0)} is VALID [2022-02-20 23:43:56,815 INFO L290 TraceCheckUtils]: 37: Hoare triple {4024#(< (+ |ULTIMATE.start_foo_~i~0#1| 3) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {4024#(< (+ |ULTIMATE.start_foo_~i~0#1| 3) ~n~0)} is VALID [2022-02-20 23:43:56,816 INFO L290 TraceCheckUtils]: 36: Hoare triple {4034#(< (+ |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; {4024#(< (+ |ULTIMATE.start_foo_~i~0#1| 3) ~n~0)} is VALID [2022-02-20 23:43:56,816 INFO L290 TraceCheckUtils]: 35: Hoare triple {4034#(< (+ |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 {4034#(< (+ |ULTIMATE.start_foo_~i~0#1| 4) ~n~0)} is VALID [2022-02-20 23:43:56,816 INFO L290 TraceCheckUtils]: 34: Hoare triple {4034#(< (+ |ULTIMATE.start_foo_~i~0#1| 4) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {4034#(< (+ |ULTIMATE.start_foo_~i~0#1| 4) ~n~0)} is VALID [2022-02-20 23:43:56,817 INFO L290 TraceCheckUtils]: 33: Hoare triple {4044#(< (+ |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; {4034#(< (+ |ULTIMATE.start_foo_~i~0#1| 4) ~n~0)} is VALID [2022-02-20 23:43:56,817 INFO L290 TraceCheckUtils]: 32: Hoare triple {4044#(< (+ |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 {4044#(< (+ |ULTIMATE.start_foo_~i~0#1| 5) ~n~0)} is VALID [2022-02-20 23:43:56,817 INFO L290 TraceCheckUtils]: 31: Hoare triple {4044#(< (+ |ULTIMATE.start_foo_~i~0#1| 5) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {4044#(< (+ |ULTIMATE.start_foo_~i~0#1| 5) ~n~0)} is VALID [2022-02-20 23:43:56,818 INFO L290 TraceCheckUtils]: 30: Hoare triple {4054#(< (+ |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; {4044#(< (+ |ULTIMATE.start_foo_~i~0#1| 5) ~n~0)} is VALID [2022-02-20 23:43:56,818 INFO L290 TraceCheckUtils]: 29: Hoare triple {4054#(< (+ |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 {4054#(< (+ |ULTIMATE.start_foo_~i~0#1| 6) ~n~0)} is VALID [2022-02-20 23:43:56,818 INFO L290 TraceCheckUtils]: 28: Hoare triple {4054#(< (+ |ULTIMATE.start_foo_~i~0#1| 6) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {4054#(< (+ |ULTIMATE.start_foo_~i~0#1| 6) ~n~0)} is VALID [2022-02-20 23:43:56,819 INFO L290 TraceCheckUtils]: 27: Hoare triple {4064#(< (+ 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; {4054#(< (+ |ULTIMATE.start_foo_~i~0#1| 6) ~n~0)} is VALID [2022-02-20 23:43:56,819 INFO L290 TraceCheckUtils]: 26: Hoare triple {4064#(< (+ 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 {4064#(< (+ 7 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:43:56,819 INFO L290 TraceCheckUtils]: 25: Hoare triple {4064#(< (+ 7 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {4064#(< (+ 7 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:43:56,820 INFO L290 TraceCheckUtils]: 24: Hoare triple {4074#(< (+ |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; {4064#(< (+ 7 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:43:56,820 INFO L290 TraceCheckUtils]: 23: Hoare triple {4074#(< (+ |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 {4074#(< (+ |ULTIMATE.start_foo_~i~0#1| 8) ~n~0)} is VALID [2022-02-20 23:43:56,820 INFO L290 TraceCheckUtils]: 22: Hoare triple {4074#(< (+ |ULTIMATE.start_foo_~i~0#1| 8) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {4074#(< (+ |ULTIMATE.start_foo_~i~0#1| 8) ~n~0)} is VALID [2022-02-20 23:43:56,821 INFO L290 TraceCheckUtils]: 21: Hoare triple {4084#(< (+ |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; {4074#(< (+ |ULTIMATE.start_foo_~i~0#1| 8) ~n~0)} is VALID [2022-02-20 23:43:56,821 INFO L290 TraceCheckUtils]: 20: Hoare triple {4084#(< (+ |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 {4084#(< (+ |ULTIMATE.start_foo_~i~0#1| 9) ~n~0)} is VALID [2022-02-20 23:43:56,821 INFO L290 TraceCheckUtils]: 19: Hoare triple {4084#(< (+ |ULTIMATE.start_foo_~i~0#1| 9) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {4084#(< (+ |ULTIMATE.start_foo_~i~0#1| 9) ~n~0)} is VALID [2022-02-20 23:43:56,822 INFO L290 TraceCheckUtils]: 18: Hoare triple {4094#(< (+ |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; {4084#(< (+ |ULTIMATE.start_foo_~i~0#1| 9) ~n~0)} is VALID [2022-02-20 23:43:56,822 INFO L290 TraceCheckUtils]: 17: Hoare triple {4094#(< (+ |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 {4094#(< (+ |ULTIMATE.start_foo_~i~0#1| 10) ~n~0)} is VALID [2022-02-20 23:43:56,822 INFO L290 TraceCheckUtils]: 16: Hoare triple {4094#(< (+ |ULTIMATE.start_foo_~i~0#1| 10) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {4094#(< (+ |ULTIMATE.start_foo_~i~0#1| 10) ~n~0)} is VALID [2022-02-20 23:43:56,823 INFO L290 TraceCheckUtils]: 15: Hoare triple {4104#(< (+ |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; {4094#(< (+ |ULTIMATE.start_foo_~i~0#1| 10) ~n~0)} is VALID [2022-02-20 23:43:56,823 INFO L290 TraceCheckUtils]: 14: Hoare triple {4104#(< (+ |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 {4104#(< (+ |ULTIMATE.start_foo_~i~0#1| 11) ~n~0)} is VALID [2022-02-20 23:43:56,823 INFO L290 TraceCheckUtils]: 13: Hoare triple {4104#(< (+ |ULTIMATE.start_foo_~i~0#1| 11) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {4104#(< (+ |ULTIMATE.start_foo_~i~0#1| 11) ~n~0)} is VALID [2022-02-20 23:43:56,824 INFO L290 TraceCheckUtils]: 12: Hoare triple {4114#(< (+ |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; {4104#(< (+ |ULTIMATE.start_foo_~i~0#1| 11) ~n~0)} is VALID [2022-02-20 23:43:56,824 INFO L290 TraceCheckUtils]: 11: Hoare triple {4114#(< (+ |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 {4114#(< (+ |ULTIMATE.start_foo_~i~0#1| 12) ~n~0)} is VALID [2022-02-20 23:43:56,824 INFO L290 TraceCheckUtils]: 10: Hoare triple {4114#(< (+ |ULTIMATE.start_foo_~i~0#1| 12) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {4114#(< (+ |ULTIMATE.start_foo_~i~0#1| 12) ~n~0)} is VALID [2022-02-20 23:43:56,825 INFO L290 TraceCheckUtils]: 9: Hoare triple {4124#(< (+ |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; {4114#(< (+ |ULTIMATE.start_foo_~i~0#1| 12) ~n~0)} is VALID [2022-02-20 23:43:56,825 INFO L290 TraceCheckUtils]: 8: Hoare triple {4124#(< (+ |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 {4124#(< (+ |ULTIMATE.start_foo_~i~0#1| 13) ~n~0)} is VALID [2022-02-20 23:43:56,825 INFO L290 TraceCheckUtils]: 7: Hoare triple {4124#(< (+ |ULTIMATE.start_foo_~i~0#1| 13) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {4124#(< (+ |ULTIMATE.start_foo_~i~0#1| 13) ~n~0)} is VALID [2022-02-20 23:43:56,825 INFO L290 TraceCheckUtils]: 6: Hoare triple {4134#(< (+ |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; {4124#(< (+ |ULTIMATE.start_foo_~i~0#1| 13) ~n~0)} is VALID [2022-02-20 23:43:56,826 INFO L290 TraceCheckUtils]: 5: Hoare triple {4134#(< (+ |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 {4134#(< (+ |ULTIMATE.start_foo_~i~0#1| 14) ~n~0)} is VALID [2022-02-20 23:43:56,826 INFO L290 TraceCheckUtils]: 4: Hoare triple {4134#(< (+ |ULTIMATE.start_foo_~i~0#1| 14) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {4134#(< (+ |ULTIMATE.start_foo_~i~0#1| 14) ~n~0)} is VALID [2022-02-20 23:43:56,826 INFO L290 TraceCheckUtils]: 3: Hoare triple {4144#(< 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; {4134#(< (+ |ULTIMATE.start_foo_~i~0#1| 14) ~n~0)} is VALID [2022-02-20 23:43:56,827 INFO L290 TraceCheckUtils]: 2: Hoare triple {4144#(< 14 ~n~0)} SUMMARY for call write~int(0, main_#t~post7#1.base, main_#t~post7#1.offset, 4); srcloc: L538 {4144#(< 14 ~n~0)} is VALID [2022-02-20 23:43:56,827 INFO L290 TraceCheckUtils]: 1: Hoare triple {3790#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 := 128;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; {4144#(< 14 ~n~0)} is VALID [2022-02-20 23:43:56,827 INFO L290 TraceCheckUtils]: 0: Hoare triple {3790#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; {3790#true} is VALID [2022-02-20 23:43:56,828 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:43:56,828 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [504330992] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:43:56,828 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:43:56,828 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 49 [2022-02-20 23:43:56,828 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843260143] [2022-02-20 23:43:56,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:43:56,829 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:43:56,829 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:43:56,829 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:43:56,920 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:43:56,920 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-02-20 23:43:56,920 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:43:56,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-02-20 23:43:56,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1027, Invalid=1325, Unknown=0, NotChecked=0, Total=2352 [2022-02-20 23:43:56,921 INFO L87 Difference]: Start difference. First operand 86 states and 92 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:43:58,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:58,279 INFO L93 Difference]: Finished difference Result 437 states and 438 transitions. [2022-02-20 23:43:58,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-02-20 23:43:58,280 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:43:58,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:43:58,280 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:43:58,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 462 transitions. [2022-02-20 23:43:58,282 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:43:58,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 462 transitions. [2022-02-20 23:43:58,284 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 462 transitions. [2022-02-20 23:43:58,567 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 462 edges. 462 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:58,585 INFO L225 Difference]: With dead ends: 437 [2022-02-20 23:43:58,585 INFO L226 Difference]: Without dead ends: 437 [2022-02-20 23:43:58,586 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1377 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1552, Invalid=2480, Unknown=0, NotChecked=0, Total=4032 [2022-02-20 23:43:58,586 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 1569 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1569 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:43:58,586 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1569 Valid, 275 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:43:58,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2022-02-20 23:43:58,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 158. [2022-02-20 23:43:58,589 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:43:58,589 INFO L82 GeneralOperation]: Start isEquivalent. First operand 437 states. Second operand has 158 states, 153 states have (on average 1.1241830065359477) internal successors, (172), 157 states have internal predecessors, (172), 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,589 INFO L74 IsIncluded]: Start isIncluded. First operand 437 states. Second operand has 158 states, 153 states have (on average 1.1241830065359477) internal successors, (172), 157 states have internal predecessors, (172), 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,589 INFO L87 Difference]: Start difference. First operand 437 states. Second operand has 158 states, 153 states have (on average 1.1241830065359477) internal successors, (172), 157 states have internal predecessors, (172), 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,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:58,597 INFO L93 Difference]: Finished difference Result 437 states and 438 transitions. [2022-02-20 23:43:58,597 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 438 transitions. [2022-02-20 23:43:58,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:58,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:58,597 INFO L74 IsIncluded]: Start isIncluded. First operand has 158 states, 153 states have (on average 1.1241830065359477) internal successors, (172), 157 states have internal predecessors, (172), 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 437 states. [2022-02-20 23:43:58,598 INFO L87 Difference]: Start difference. First operand has 158 states, 153 states have (on average 1.1241830065359477) internal successors, (172), 157 states have internal predecessors, (172), 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 437 states. [2022-02-20 23:43:58,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:58,605 INFO L93 Difference]: Finished difference Result 437 states and 438 transitions. [2022-02-20 23:43:58,605 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 438 transitions. [2022-02-20 23:43:58,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:58,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:58,605 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:43:58,605 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:43:58,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 153 states have (on average 1.1241830065359477) internal successors, (172), 157 states have internal predecessors, (172), 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,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 172 transitions. [2022-02-20 23:43:58,607 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 172 transitions. Word has length 53 [2022-02-20 23:43:58,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:43:58,607 INFO L470 AbstractCegarLoop]: Abstraction has 158 states and 172 transitions. [2022-02-20 23:43:58,608 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:43:58,608 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 172 transitions. [2022-02-20 23:43:58,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-02-20 23:43:58,609 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:43:58,609 INFO L514 BasicCegarLoop]: trace histogram [30, 30, 30, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:43:58,628 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:43:58,824 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:43:58,824 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:43:58,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:43:58,825 INFO L85 PathProgramCache]: Analyzing trace with hash -2038312715, now seen corresponding path program 3 times [2022-02-20 23:43:58,825 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:43:58,825 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437064719] [2022-02-20 23:43:58,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:58,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:43:58,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:59,370 INFO L290 TraceCheckUtils]: 0: Hoare triple {5652#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; {5652#true} is VALID [2022-02-20 23:43:59,371 INFO L290 TraceCheckUtils]: 1: Hoare triple {5652#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 := 128;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; {5654#(<= 128 ~n~0)} is VALID [2022-02-20 23:43:59,371 INFO L290 TraceCheckUtils]: 2: Hoare triple {5654#(<= 128 ~n~0)} SUMMARY for call write~int(0, main_#t~post7#1.base, main_#t~post7#1.offset, 4); srcloc: L538 {5654#(<= 128 ~n~0)} is VALID [2022-02-20 23:43:59,371 INFO L290 TraceCheckUtils]: 3: Hoare triple {5654#(<= 128 ~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; {5655#(and (<= 128 ~n~0) (= |ULTIMATE.start_foo_~i~0#1| 0))} is VALID [2022-02-20 23:43:59,372 INFO L290 TraceCheckUtils]: 4: Hoare triple {5655#(and (<= 128 ~n~0) (= |ULTIMATE.start_foo_~i~0#1| 0))} assume !!(foo_~i~0#1 < ~n~0); {5655#(and (<= 128 ~n~0) (= |ULTIMATE.start_foo_~i~0#1| 0))} is VALID [2022-02-20 23:43:59,372 INFO L290 TraceCheckUtils]: 5: Hoare triple {5655#(and (<= 128 ~n~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 {5655#(and (<= 128 ~n~0) (= |ULTIMATE.start_foo_~i~0#1| 0))} is VALID [2022-02-20 23:43:59,372 INFO L290 TraceCheckUtils]: 6: Hoare triple {5655#(and (<= 128 ~n~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; {5656#(<= (+ |ULTIMATE.start_foo_~i~0#1| 127) ~n~0)} is VALID [2022-02-20 23:43:59,373 INFO L290 TraceCheckUtils]: 7: Hoare triple {5656#(<= (+ |ULTIMATE.start_foo_~i~0#1| 127) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {5656#(<= (+ |ULTIMATE.start_foo_~i~0#1| 127) ~n~0)} is VALID [2022-02-20 23:43:59,373 INFO L290 TraceCheckUtils]: 8: Hoare triple {5656#(<= (+ |ULTIMATE.start_foo_~i~0#1| 127) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {5656#(<= (+ |ULTIMATE.start_foo_~i~0#1| 127) ~n~0)} is VALID [2022-02-20 23:43:59,373 INFO L290 TraceCheckUtils]: 9: Hoare triple {5656#(<= (+ |ULTIMATE.start_foo_~i~0#1| 127) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {5657#(<= (+ |ULTIMATE.start_foo_~i~0#1| 126) ~n~0)} is VALID [2022-02-20 23:43:59,373 INFO L290 TraceCheckUtils]: 10: Hoare triple {5657#(<= (+ |ULTIMATE.start_foo_~i~0#1| 126) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {5657#(<= (+ |ULTIMATE.start_foo_~i~0#1| 126) ~n~0)} is VALID [2022-02-20 23:43:59,374 INFO L290 TraceCheckUtils]: 11: Hoare triple {5657#(<= (+ |ULTIMATE.start_foo_~i~0#1| 126) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {5657#(<= (+ |ULTIMATE.start_foo_~i~0#1| 126) ~n~0)} is VALID [2022-02-20 23:43:59,374 INFO L290 TraceCheckUtils]: 12: Hoare triple {5657#(<= (+ |ULTIMATE.start_foo_~i~0#1| 126) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {5658#(<= (+ 125 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:43:59,374 INFO L290 TraceCheckUtils]: 13: Hoare triple {5658#(<= (+ 125 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {5658#(<= (+ 125 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:43:59,375 INFO L290 TraceCheckUtils]: 14: Hoare triple {5658#(<= (+ 125 |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 {5658#(<= (+ 125 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:43:59,375 INFO L290 TraceCheckUtils]: 15: Hoare triple {5658#(<= (+ 125 |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; {5659#(<= (+ |ULTIMATE.start_foo_~i~0#1| 124) ~n~0)} is VALID [2022-02-20 23:43:59,375 INFO L290 TraceCheckUtils]: 16: Hoare triple {5659#(<= (+ |ULTIMATE.start_foo_~i~0#1| 124) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {5659#(<= (+ |ULTIMATE.start_foo_~i~0#1| 124) ~n~0)} is VALID [2022-02-20 23:43:59,376 INFO L290 TraceCheckUtils]: 17: Hoare triple {5659#(<= (+ |ULTIMATE.start_foo_~i~0#1| 124) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {5659#(<= (+ |ULTIMATE.start_foo_~i~0#1| 124) ~n~0)} is VALID [2022-02-20 23:43:59,376 INFO L290 TraceCheckUtils]: 18: Hoare triple {5659#(<= (+ |ULTIMATE.start_foo_~i~0#1| 124) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {5660#(<= (+ |ULTIMATE.start_foo_~i~0#1| 123) ~n~0)} is VALID [2022-02-20 23:43:59,376 INFO L290 TraceCheckUtils]: 19: Hoare triple {5660#(<= (+ |ULTIMATE.start_foo_~i~0#1| 123) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {5660#(<= (+ |ULTIMATE.start_foo_~i~0#1| 123) ~n~0)} is VALID [2022-02-20 23:43:59,376 INFO L290 TraceCheckUtils]: 20: Hoare triple {5660#(<= (+ |ULTIMATE.start_foo_~i~0#1| 123) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {5660#(<= (+ |ULTIMATE.start_foo_~i~0#1| 123) ~n~0)} is VALID [2022-02-20 23:43:59,377 INFO L290 TraceCheckUtils]: 21: Hoare triple {5660#(<= (+ |ULTIMATE.start_foo_~i~0#1| 123) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {5661#(<= (+ |ULTIMATE.start_foo_~i~0#1| 122) ~n~0)} is VALID [2022-02-20 23:43:59,377 INFO L290 TraceCheckUtils]: 22: Hoare triple {5661#(<= (+ |ULTIMATE.start_foo_~i~0#1| 122) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {5661#(<= (+ |ULTIMATE.start_foo_~i~0#1| 122) ~n~0)} is VALID [2022-02-20 23:43:59,377 INFO L290 TraceCheckUtils]: 23: Hoare triple {5661#(<= (+ |ULTIMATE.start_foo_~i~0#1| 122) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {5661#(<= (+ |ULTIMATE.start_foo_~i~0#1| 122) ~n~0)} is VALID [2022-02-20 23:43:59,378 INFO L290 TraceCheckUtils]: 24: Hoare triple {5661#(<= (+ |ULTIMATE.start_foo_~i~0#1| 122) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {5662#(<= (+ |ULTIMATE.start_foo_~i~0#1| 121) ~n~0)} is VALID [2022-02-20 23:43:59,378 INFO L290 TraceCheckUtils]: 25: Hoare triple {5662#(<= (+ |ULTIMATE.start_foo_~i~0#1| 121) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {5662#(<= (+ |ULTIMATE.start_foo_~i~0#1| 121) ~n~0)} is VALID [2022-02-20 23:43:59,378 INFO L290 TraceCheckUtils]: 26: Hoare triple {5662#(<= (+ |ULTIMATE.start_foo_~i~0#1| 121) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {5662#(<= (+ |ULTIMATE.start_foo_~i~0#1| 121) ~n~0)} is VALID [2022-02-20 23:43:59,379 INFO L290 TraceCheckUtils]: 27: Hoare triple {5662#(<= (+ |ULTIMATE.start_foo_~i~0#1| 121) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {5663#(<= (+ |ULTIMATE.start_foo_~i~0#1| 120) ~n~0)} is VALID [2022-02-20 23:43:59,379 INFO L290 TraceCheckUtils]: 28: Hoare triple {5663#(<= (+ |ULTIMATE.start_foo_~i~0#1| 120) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {5663#(<= (+ |ULTIMATE.start_foo_~i~0#1| 120) ~n~0)} is VALID [2022-02-20 23:43:59,379 INFO L290 TraceCheckUtils]: 29: Hoare triple {5663#(<= (+ |ULTIMATE.start_foo_~i~0#1| 120) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {5663#(<= (+ |ULTIMATE.start_foo_~i~0#1| 120) ~n~0)} is VALID [2022-02-20 23:43:59,379 INFO L290 TraceCheckUtils]: 30: Hoare triple {5663#(<= (+ |ULTIMATE.start_foo_~i~0#1| 120) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {5664#(<= (+ 119 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:43:59,380 INFO L290 TraceCheckUtils]: 31: Hoare triple {5664#(<= (+ 119 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {5664#(<= (+ 119 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:43:59,380 INFO L290 TraceCheckUtils]: 32: Hoare triple {5664#(<= (+ 119 |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 {5664#(<= (+ 119 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:43:59,380 INFO L290 TraceCheckUtils]: 33: Hoare triple {5664#(<= (+ 119 |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; {5665#(<= (+ |ULTIMATE.start_foo_~i~0#1| 118) ~n~0)} is VALID [2022-02-20 23:43:59,381 INFO L290 TraceCheckUtils]: 34: Hoare triple {5665#(<= (+ |ULTIMATE.start_foo_~i~0#1| 118) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {5665#(<= (+ |ULTIMATE.start_foo_~i~0#1| 118) ~n~0)} is VALID [2022-02-20 23:43:59,381 INFO L290 TraceCheckUtils]: 35: Hoare triple {5665#(<= (+ |ULTIMATE.start_foo_~i~0#1| 118) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {5665#(<= (+ |ULTIMATE.start_foo_~i~0#1| 118) ~n~0)} is VALID [2022-02-20 23:43:59,381 INFO L290 TraceCheckUtils]: 36: Hoare triple {5665#(<= (+ |ULTIMATE.start_foo_~i~0#1| 118) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {5666#(<= (+ |ULTIMATE.start_foo_~i~0#1| 117) ~n~0)} is VALID [2022-02-20 23:43:59,382 INFO L290 TraceCheckUtils]: 37: Hoare triple {5666#(<= (+ |ULTIMATE.start_foo_~i~0#1| 117) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {5666#(<= (+ |ULTIMATE.start_foo_~i~0#1| 117) ~n~0)} is VALID [2022-02-20 23:43:59,382 INFO L290 TraceCheckUtils]: 38: Hoare triple {5666#(<= (+ |ULTIMATE.start_foo_~i~0#1| 117) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {5666#(<= (+ |ULTIMATE.start_foo_~i~0#1| 117) ~n~0)} is VALID [2022-02-20 23:43:59,382 INFO L290 TraceCheckUtils]: 39: Hoare triple {5666#(<= (+ |ULTIMATE.start_foo_~i~0#1| 117) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {5667#(<= (+ 116 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:43:59,383 INFO L290 TraceCheckUtils]: 40: Hoare triple {5667#(<= (+ 116 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {5667#(<= (+ 116 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:43:59,383 INFO L290 TraceCheckUtils]: 41: Hoare triple {5667#(<= (+ 116 |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 {5667#(<= (+ 116 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:43:59,383 INFO L290 TraceCheckUtils]: 42: Hoare triple {5667#(<= (+ 116 |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; {5668#(<= (+ 115 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:43:59,384 INFO L290 TraceCheckUtils]: 43: Hoare triple {5668#(<= (+ 115 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {5668#(<= (+ 115 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:43:59,384 INFO L290 TraceCheckUtils]: 44: Hoare triple {5668#(<= (+ 115 |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 {5668#(<= (+ 115 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:43:59,384 INFO L290 TraceCheckUtils]: 45: Hoare triple {5668#(<= (+ 115 |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; {5669#(<= (+ |ULTIMATE.start_foo_~i~0#1| 114) ~n~0)} is VALID [2022-02-20 23:43:59,384 INFO L290 TraceCheckUtils]: 46: Hoare triple {5669#(<= (+ |ULTIMATE.start_foo_~i~0#1| 114) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {5669#(<= (+ |ULTIMATE.start_foo_~i~0#1| 114) ~n~0)} is VALID [2022-02-20 23:43:59,385 INFO L290 TraceCheckUtils]: 47: Hoare triple {5669#(<= (+ |ULTIMATE.start_foo_~i~0#1| 114) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {5669#(<= (+ |ULTIMATE.start_foo_~i~0#1| 114) ~n~0)} is VALID [2022-02-20 23:43:59,385 INFO L290 TraceCheckUtils]: 48: Hoare triple {5669#(<= (+ |ULTIMATE.start_foo_~i~0#1| 114) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {5670#(<= (+ |ULTIMATE.start_foo_~i~0#1| 113) ~n~0)} is VALID [2022-02-20 23:43:59,385 INFO L290 TraceCheckUtils]: 49: Hoare triple {5670#(<= (+ |ULTIMATE.start_foo_~i~0#1| 113) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {5670#(<= (+ |ULTIMATE.start_foo_~i~0#1| 113) ~n~0)} is VALID [2022-02-20 23:43:59,386 INFO L290 TraceCheckUtils]: 50: Hoare triple {5670#(<= (+ |ULTIMATE.start_foo_~i~0#1| 113) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {5670#(<= (+ |ULTIMATE.start_foo_~i~0#1| 113) ~n~0)} is VALID [2022-02-20 23:43:59,386 INFO L290 TraceCheckUtils]: 51: Hoare triple {5670#(<= (+ |ULTIMATE.start_foo_~i~0#1| 113) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {5671#(<= (+ 112 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:43:59,386 INFO L290 TraceCheckUtils]: 52: Hoare triple {5671#(<= (+ 112 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {5671#(<= (+ 112 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:43:59,386 INFO L290 TraceCheckUtils]: 53: Hoare triple {5671#(<= (+ 112 |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 {5671#(<= (+ 112 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:43:59,387 INFO L290 TraceCheckUtils]: 54: Hoare triple {5671#(<= (+ 112 |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; {5672#(<= (+ |ULTIMATE.start_foo_~i~0#1| 111) ~n~0)} is VALID [2022-02-20 23:43:59,391 INFO L290 TraceCheckUtils]: 55: Hoare triple {5672#(<= (+ |ULTIMATE.start_foo_~i~0#1| 111) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {5672#(<= (+ |ULTIMATE.start_foo_~i~0#1| 111) ~n~0)} is VALID [2022-02-20 23:43:59,392 INFO L290 TraceCheckUtils]: 56: Hoare triple {5672#(<= (+ |ULTIMATE.start_foo_~i~0#1| 111) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {5672#(<= (+ |ULTIMATE.start_foo_~i~0#1| 111) ~n~0)} is VALID [2022-02-20 23:43:59,392 INFO L290 TraceCheckUtils]: 57: Hoare triple {5672#(<= (+ |ULTIMATE.start_foo_~i~0#1| 111) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {5673#(<= (+ |ULTIMATE.start_foo_~i~0#1| 110) ~n~0)} is VALID [2022-02-20 23:43:59,393 INFO L290 TraceCheckUtils]: 58: Hoare triple {5673#(<= (+ |ULTIMATE.start_foo_~i~0#1| 110) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {5673#(<= (+ |ULTIMATE.start_foo_~i~0#1| 110) ~n~0)} is VALID [2022-02-20 23:43:59,393 INFO L290 TraceCheckUtils]: 59: Hoare triple {5673#(<= (+ |ULTIMATE.start_foo_~i~0#1| 110) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {5673#(<= (+ |ULTIMATE.start_foo_~i~0#1| 110) ~n~0)} is VALID [2022-02-20 23:43:59,394 INFO L290 TraceCheckUtils]: 60: Hoare triple {5673#(<= (+ |ULTIMATE.start_foo_~i~0#1| 110) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {5674#(<= (+ |ULTIMATE.start_foo_~i~0#1| 109) ~n~0)} is VALID [2022-02-20 23:43:59,394 INFO L290 TraceCheckUtils]: 61: Hoare triple {5674#(<= (+ |ULTIMATE.start_foo_~i~0#1| 109) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {5674#(<= (+ |ULTIMATE.start_foo_~i~0#1| 109) ~n~0)} is VALID [2022-02-20 23:43:59,394 INFO L290 TraceCheckUtils]: 62: Hoare triple {5674#(<= (+ |ULTIMATE.start_foo_~i~0#1| 109) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {5674#(<= (+ |ULTIMATE.start_foo_~i~0#1| 109) ~n~0)} is VALID [2022-02-20 23:43:59,395 INFO L290 TraceCheckUtils]: 63: Hoare triple {5674#(<= (+ |ULTIMATE.start_foo_~i~0#1| 109) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {5675#(<= (+ |ULTIMATE.start_foo_~i~0#1| 108) ~n~0)} is VALID [2022-02-20 23:43:59,395 INFO L290 TraceCheckUtils]: 64: Hoare triple {5675#(<= (+ |ULTIMATE.start_foo_~i~0#1| 108) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {5675#(<= (+ |ULTIMATE.start_foo_~i~0#1| 108) ~n~0)} is VALID [2022-02-20 23:43:59,396 INFO L290 TraceCheckUtils]: 65: Hoare triple {5675#(<= (+ |ULTIMATE.start_foo_~i~0#1| 108) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {5675#(<= (+ |ULTIMATE.start_foo_~i~0#1| 108) ~n~0)} is VALID [2022-02-20 23:43:59,397 INFO L290 TraceCheckUtils]: 66: Hoare triple {5675#(<= (+ |ULTIMATE.start_foo_~i~0#1| 108) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {5676#(<= (+ |ULTIMATE.start_foo_~i~0#1| 107) ~n~0)} is VALID [2022-02-20 23:43:59,397 INFO L290 TraceCheckUtils]: 67: Hoare triple {5676#(<= (+ |ULTIMATE.start_foo_~i~0#1| 107) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {5676#(<= (+ |ULTIMATE.start_foo_~i~0#1| 107) ~n~0)} is VALID [2022-02-20 23:43:59,397 INFO L290 TraceCheckUtils]: 68: Hoare triple {5676#(<= (+ |ULTIMATE.start_foo_~i~0#1| 107) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {5676#(<= (+ |ULTIMATE.start_foo_~i~0#1| 107) ~n~0)} is VALID [2022-02-20 23:43:59,398 INFO L290 TraceCheckUtils]: 69: Hoare triple {5676#(<= (+ |ULTIMATE.start_foo_~i~0#1| 107) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {5677#(<= (+ 106 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:43:59,398 INFO L290 TraceCheckUtils]: 70: Hoare triple {5677#(<= (+ 106 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {5677#(<= (+ 106 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:43:59,399 INFO L290 TraceCheckUtils]: 71: Hoare triple {5677#(<= (+ 106 |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 {5677#(<= (+ 106 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:43:59,399 INFO L290 TraceCheckUtils]: 72: Hoare triple {5677#(<= (+ 106 |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; {5678#(<= (+ |ULTIMATE.start_foo_~i~0#1| 105) ~n~0)} is VALID [2022-02-20 23:43:59,400 INFO L290 TraceCheckUtils]: 73: Hoare triple {5678#(<= (+ |ULTIMATE.start_foo_~i~0#1| 105) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {5678#(<= (+ |ULTIMATE.start_foo_~i~0#1| 105) ~n~0)} is VALID [2022-02-20 23:43:59,400 INFO L290 TraceCheckUtils]: 74: Hoare triple {5678#(<= (+ |ULTIMATE.start_foo_~i~0#1| 105) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {5678#(<= (+ |ULTIMATE.start_foo_~i~0#1| 105) ~n~0)} is VALID [2022-02-20 23:43:59,400 INFO L290 TraceCheckUtils]: 75: Hoare triple {5678#(<= (+ |ULTIMATE.start_foo_~i~0#1| 105) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {5679#(<= (+ |ULTIMATE.start_foo_~i~0#1| 104) ~n~0)} is VALID [2022-02-20 23:43:59,401 INFO L290 TraceCheckUtils]: 76: Hoare triple {5679#(<= (+ |ULTIMATE.start_foo_~i~0#1| 104) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {5679#(<= (+ |ULTIMATE.start_foo_~i~0#1| 104) ~n~0)} is VALID [2022-02-20 23:43:59,401 INFO L290 TraceCheckUtils]: 77: Hoare triple {5679#(<= (+ |ULTIMATE.start_foo_~i~0#1| 104) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {5679#(<= (+ |ULTIMATE.start_foo_~i~0#1| 104) ~n~0)} is VALID [2022-02-20 23:43:59,402 INFO L290 TraceCheckUtils]: 78: Hoare triple {5679#(<= (+ |ULTIMATE.start_foo_~i~0#1| 104) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {5680#(<= (+ |ULTIMATE.start_foo_~i~0#1| 103) ~n~0)} is VALID [2022-02-20 23:43:59,402 INFO L290 TraceCheckUtils]: 79: Hoare triple {5680#(<= (+ |ULTIMATE.start_foo_~i~0#1| 103) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {5680#(<= (+ |ULTIMATE.start_foo_~i~0#1| 103) ~n~0)} is VALID [2022-02-20 23:43:59,402 INFO L290 TraceCheckUtils]: 80: Hoare triple {5680#(<= (+ |ULTIMATE.start_foo_~i~0#1| 103) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {5680#(<= (+ |ULTIMATE.start_foo_~i~0#1| 103) ~n~0)} is VALID [2022-02-20 23:43:59,403 INFO L290 TraceCheckUtils]: 81: Hoare triple {5680#(<= (+ |ULTIMATE.start_foo_~i~0#1| 103) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {5681#(<= (+ |ULTIMATE.start_foo_~i~0#1| 102) ~n~0)} is VALID [2022-02-20 23:43:59,403 INFO L290 TraceCheckUtils]: 82: Hoare triple {5681#(<= (+ |ULTIMATE.start_foo_~i~0#1| 102) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {5681#(<= (+ |ULTIMATE.start_foo_~i~0#1| 102) ~n~0)} is VALID [2022-02-20 23:43:59,404 INFO L290 TraceCheckUtils]: 83: Hoare triple {5681#(<= (+ |ULTIMATE.start_foo_~i~0#1| 102) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {5681#(<= (+ |ULTIMATE.start_foo_~i~0#1| 102) ~n~0)} is VALID [2022-02-20 23:43:59,404 INFO L290 TraceCheckUtils]: 84: Hoare triple {5681#(<= (+ |ULTIMATE.start_foo_~i~0#1| 102) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {5682#(<= (+ 101 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:43:59,404 INFO L290 TraceCheckUtils]: 85: Hoare triple {5682#(<= (+ 101 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {5682#(<= (+ 101 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:43:59,405 INFO L290 TraceCheckUtils]: 86: Hoare triple {5682#(<= (+ 101 |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 {5682#(<= (+ 101 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:43:59,405 INFO L290 TraceCheckUtils]: 87: Hoare triple {5682#(<= (+ 101 |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; {5683#(<= (+ |ULTIMATE.start_foo_~i~0#1| 100) ~n~0)} is VALID [2022-02-20 23:43:59,406 INFO L290 TraceCheckUtils]: 88: Hoare triple {5683#(<= (+ |ULTIMATE.start_foo_~i~0#1| 100) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {5683#(<= (+ |ULTIMATE.start_foo_~i~0#1| 100) ~n~0)} is VALID [2022-02-20 23:43:59,406 INFO L290 TraceCheckUtils]: 89: Hoare triple {5683#(<= (+ |ULTIMATE.start_foo_~i~0#1| 100) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {5683#(<= (+ |ULTIMATE.start_foo_~i~0#1| 100) ~n~0)} is VALID [2022-02-20 23:43:59,406 INFO L290 TraceCheckUtils]: 90: Hoare triple {5683#(<= (+ |ULTIMATE.start_foo_~i~0#1| 100) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {5684#(<= (+ |ULTIMATE.start_foo_~i~0#1| 99) ~n~0)} is VALID [2022-02-20 23:43:59,407 INFO L290 TraceCheckUtils]: 91: Hoare triple {5684#(<= (+ |ULTIMATE.start_foo_~i~0#1| 99) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {5684#(<= (+ |ULTIMATE.start_foo_~i~0#1| 99) ~n~0)} is VALID [2022-02-20 23:43:59,407 INFO L290 TraceCheckUtils]: 92: Hoare triple {5684#(<= (+ |ULTIMATE.start_foo_~i~0#1| 99) ~n~0)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {5684#(<= (+ |ULTIMATE.start_foo_~i~0#1| 99) ~n~0)} is VALID [2022-02-20 23:43:59,408 INFO L290 TraceCheckUtils]: 93: Hoare triple {5684#(<= (+ |ULTIMATE.start_foo_~i~0#1| 99) ~n~0)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {5685#(<= (+ |ULTIMATE.start_foo_~i~0#1| 98) ~n~0)} is VALID [2022-02-20 23:43:59,408 INFO L290 TraceCheckUtils]: 94: Hoare triple {5685#(<= (+ |ULTIMATE.start_foo_~i~0#1| 98) ~n~0)} assume !(foo_~i~0#1 < ~n~0); {5653#false} is VALID [2022-02-20 23:43:59,408 INFO L290 TraceCheckUtils]: 95: Hoare triple {5653#false} foo_~i~0#1 := 0; {5653#false} is VALID [2022-02-20 23:43:59,408 INFO L290 TraceCheckUtils]: 96: Hoare triple {5653#false} assume !!(foo_~i~0#1 < 127); {5653#false} is VALID [2022-02-20 23:43:59,408 INFO L290 TraceCheckUtils]: 97: Hoare triple {5653#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {5653#false} is VALID [2022-02-20 23:43:59,409 INFO L290 TraceCheckUtils]: 98: Hoare triple {5653#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {5653#false} is VALID [2022-02-20 23:43:59,409 INFO L290 TraceCheckUtils]: 99: Hoare triple {5653#false} assume !!(foo_~i~0#1 < 127); {5653#false} is VALID [2022-02-20 23:43:59,409 INFO L290 TraceCheckUtils]: 100: Hoare triple {5653#false} assume !(4 + (~b~0.offset + 4 * foo_~i~0#1) <= #length[~b~0.base] && 0 <= ~b~0.offset + 4 * foo_~i~0#1); {5653#false} is VALID [2022-02-20 23:43:59,410 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:43:59,410 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:43:59,410 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437064719] [2022-02-20 23:43:59,410 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437064719] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:43:59,410 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332493008] [2022-02-20 23:43:59,410 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 23:43:59,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:43:59,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:43:59,411 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:43:59,439 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:43:59,496 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-02-20 23:43:59,496 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 23:43:59,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-20 23:43:59,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:59,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:43:59,594 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-20 23:43:59,594 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:00,333 INFO L290 TraceCheckUtils]: 0: Hoare triple {5652#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; {5652#true} is VALID [2022-02-20 23:44:00,334 INFO L290 TraceCheckUtils]: 1: Hoare triple {5652#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 := 128;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; {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,334 INFO L290 TraceCheckUtils]: 2: Hoare triple {5692#(and (<= 128 (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 {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,335 INFO L290 TraceCheckUtils]: 3: Hoare triple {5692#(and (<= 128 (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; {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,335 INFO L290 TraceCheckUtils]: 4: Hoare triple {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} assume !!(foo_~i~0#1 < ~n~0); {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,336 INFO L290 TraceCheckUtils]: 5: Hoare triple {5692#(and (<= 128 (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 {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,336 INFO L290 TraceCheckUtils]: 6: Hoare triple {5692#(and (<= 128 (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; {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,336 INFO L290 TraceCheckUtils]: 7: Hoare triple {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} assume !!(foo_~i~0#1 < ~n~0); {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,337 INFO L290 TraceCheckUtils]: 8: Hoare triple {5692#(and (<= 128 (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 {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,337 INFO L290 TraceCheckUtils]: 9: Hoare triple {5692#(and (<= 128 (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; {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,337 INFO L290 TraceCheckUtils]: 10: Hoare triple {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} assume !!(foo_~i~0#1 < ~n~0); {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,338 INFO L290 TraceCheckUtils]: 11: Hoare triple {5692#(and (<= 128 (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 {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,338 INFO L290 TraceCheckUtils]: 12: Hoare triple {5692#(and (<= 128 (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; {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,338 INFO L290 TraceCheckUtils]: 13: Hoare triple {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} assume !!(foo_~i~0#1 < ~n~0); {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,339 INFO L290 TraceCheckUtils]: 14: Hoare triple {5692#(and (<= 128 (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 {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,339 INFO L290 TraceCheckUtils]: 15: Hoare triple {5692#(and (<= 128 (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; {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,339 INFO L290 TraceCheckUtils]: 16: Hoare triple {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} assume !!(foo_~i~0#1 < ~n~0); {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,340 INFO L290 TraceCheckUtils]: 17: Hoare triple {5692#(and (<= 128 (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 {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,340 INFO L290 TraceCheckUtils]: 18: Hoare triple {5692#(and (<= 128 (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; {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,341 INFO L290 TraceCheckUtils]: 19: Hoare triple {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} assume !!(foo_~i~0#1 < ~n~0); {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,341 INFO L290 TraceCheckUtils]: 20: Hoare triple {5692#(and (<= 128 (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 {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,341 INFO L290 TraceCheckUtils]: 21: Hoare triple {5692#(and (<= 128 (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; {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,342 INFO L290 TraceCheckUtils]: 22: Hoare triple {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} assume !!(foo_~i~0#1 < ~n~0); {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,342 INFO L290 TraceCheckUtils]: 23: Hoare triple {5692#(and (<= 128 (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 {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,342 INFO L290 TraceCheckUtils]: 24: Hoare triple {5692#(and (<= 128 (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; {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,343 INFO L290 TraceCheckUtils]: 25: Hoare triple {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} assume !!(foo_~i~0#1 < ~n~0); {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,343 INFO L290 TraceCheckUtils]: 26: Hoare triple {5692#(and (<= 128 (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 {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,343 INFO L290 TraceCheckUtils]: 27: Hoare triple {5692#(and (<= 128 (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; {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,344 INFO L290 TraceCheckUtils]: 28: Hoare triple {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} assume !!(foo_~i~0#1 < ~n~0); {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,344 INFO L290 TraceCheckUtils]: 29: Hoare triple {5692#(and (<= 128 (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 {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,345 INFO L290 TraceCheckUtils]: 30: Hoare triple {5692#(and (<= 128 (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; {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,345 INFO L290 TraceCheckUtils]: 31: Hoare triple {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} assume !!(foo_~i~0#1 < ~n~0); {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,345 INFO L290 TraceCheckUtils]: 32: Hoare triple {5692#(and (<= 128 (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 {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,346 INFO L290 TraceCheckUtils]: 33: Hoare triple {5692#(and (<= 128 (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; {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,346 INFO L290 TraceCheckUtils]: 34: Hoare triple {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} assume !!(foo_~i~0#1 < ~n~0); {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,346 INFO L290 TraceCheckUtils]: 35: Hoare triple {5692#(and (<= 128 (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 {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,347 INFO L290 TraceCheckUtils]: 36: Hoare triple {5692#(and (<= 128 (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; {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,347 INFO L290 TraceCheckUtils]: 37: Hoare triple {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} assume !!(foo_~i~0#1 < ~n~0); {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,347 INFO L290 TraceCheckUtils]: 38: Hoare triple {5692#(and (<= 128 (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 {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,348 INFO L290 TraceCheckUtils]: 39: Hoare triple {5692#(and (<= 128 (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; {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,348 INFO L290 TraceCheckUtils]: 40: Hoare triple {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} assume !!(foo_~i~0#1 < ~n~0); {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,349 INFO L290 TraceCheckUtils]: 41: Hoare triple {5692#(and (<= 128 (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 {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,349 INFO L290 TraceCheckUtils]: 42: Hoare triple {5692#(and (<= 128 (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; {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,349 INFO L290 TraceCheckUtils]: 43: Hoare triple {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} assume !!(foo_~i~0#1 < ~n~0); {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,350 INFO L290 TraceCheckUtils]: 44: Hoare triple {5692#(and (<= 128 (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 {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,350 INFO L290 TraceCheckUtils]: 45: Hoare triple {5692#(and (<= 128 (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; {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,350 INFO L290 TraceCheckUtils]: 46: Hoare triple {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} assume !!(foo_~i~0#1 < ~n~0); {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,351 INFO L290 TraceCheckUtils]: 47: Hoare triple {5692#(and (<= 128 (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 {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,351 INFO L290 TraceCheckUtils]: 48: Hoare triple {5692#(and (<= 128 (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; {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,351 INFO L290 TraceCheckUtils]: 49: Hoare triple {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} assume !!(foo_~i~0#1 < ~n~0); {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,352 INFO L290 TraceCheckUtils]: 50: Hoare triple {5692#(and (<= 128 (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 {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,352 INFO L290 TraceCheckUtils]: 51: Hoare triple {5692#(and (<= 128 (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; {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,352 INFO L290 TraceCheckUtils]: 52: Hoare triple {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} assume !!(foo_~i~0#1 < ~n~0); {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,353 INFO L290 TraceCheckUtils]: 53: Hoare triple {5692#(and (<= 128 (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 {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,353 INFO L290 TraceCheckUtils]: 54: Hoare triple {5692#(and (<= 128 (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; {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,353 INFO L290 TraceCheckUtils]: 55: Hoare triple {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} assume !!(foo_~i~0#1 < ~n~0); {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,354 INFO L290 TraceCheckUtils]: 56: Hoare triple {5692#(and (<= 128 (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 {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,354 INFO L290 TraceCheckUtils]: 57: Hoare triple {5692#(and (<= 128 (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; {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,355 INFO L290 TraceCheckUtils]: 58: Hoare triple {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} assume !!(foo_~i~0#1 < ~n~0); {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,355 INFO L290 TraceCheckUtils]: 59: Hoare triple {5692#(and (<= 128 (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 {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,356 INFO L290 TraceCheckUtils]: 60: Hoare triple {5692#(and (<= 128 (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; {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,356 INFO L290 TraceCheckUtils]: 61: Hoare triple {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} assume !!(foo_~i~0#1 < ~n~0); {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,357 INFO L290 TraceCheckUtils]: 62: Hoare triple {5692#(and (<= 128 (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 {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,357 INFO L290 TraceCheckUtils]: 63: Hoare triple {5692#(and (<= 128 (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; {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,358 INFO L290 TraceCheckUtils]: 64: Hoare triple {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} assume !!(foo_~i~0#1 < ~n~0); {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,358 INFO L290 TraceCheckUtils]: 65: Hoare triple {5692#(and (<= 128 (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 {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,358 INFO L290 TraceCheckUtils]: 66: Hoare triple {5692#(and (<= 128 (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; {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,359 INFO L290 TraceCheckUtils]: 67: Hoare triple {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} assume !!(foo_~i~0#1 < ~n~0); {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,359 INFO L290 TraceCheckUtils]: 68: Hoare triple {5692#(and (<= 128 (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 {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,359 INFO L290 TraceCheckUtils]: 69: Hoare triple {5692#(and (<= 128 (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; {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,360 INFO L290 TraceCheckUtils]: 70: Hoare triple {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} assume !!(foo_~i~0#1 < ~n~0); {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,360 INFO L290 TraceCheckUtils]: 71: Hoare triple {5692#(and (<= 128 (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 {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,360 INFO L290 TraceCheckUtils]: 72: Hoare triple {5692#(and (<= 128 (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; {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,361 INFO L290 TraceCheckUtils]: 73: Hoare triple {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} assume !!(foo_~i~0#1 < ~n~0); {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,361 INFO L290 TraceCheckUtils]: 74: Hoare triple {5692#(and (<= 128 (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 {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,362 INFO L290 TraceCheckUtils]: 75: Hoare triple {5692#(and (<= 128 (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; {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,362 INFO L290 TraceCheckUtils]: 76: Hoare triple {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} assume !!(foo_~i~0#1 < ~n~0); {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,363 INFO L290 TraceCheckUtils]: 77: Hoare triple {5692#(and (<= 128 (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 {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,363 INFO L290 TraceCheckUtils]: 78: Hoare triple {5692#(and (<= 128 (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; {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,364 INFO L290 TraceCheckUtils]: 79: Hoare triple {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} assume !!(foo_~i~0#1 < ~n~0); {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,364 INFO L290 TraceCheckUtils]: 80: Hoare triple {5692#(and (<= 128 (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 {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,364 INFO L290 TraceCheckUtils]: 81: Hoare triple {5692#(and (<= 128 (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; {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,365 INFO L290 TraceCheckUtils]: 82: Hoare triple {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} assume !!(foo_~i~0#1 < ~n~0); {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,365 INFO L290 TraceCheckUtils]: 83: Hoare triple {5692#(and (<= 128 (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 {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,366 INFO L290 TraceCheckUtils]: 84: Hoare triple {5692#(and (<= 128 (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; {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,366 INFO L290 TraceCheckUtils]: 85: Hoare triple {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} assume !!(foo_~i~0#1 < ~n~0); {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,367 INFO L290 TraceCheckUtils]: 86: Hoare triple {5692#(and (<= 128 (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 {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,367 INFO L290 TraceCheckUtils]: 87: Hoare triple {5692#(and (<= 128 (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; {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,367 INFO L290 TraceCheckUtils]: 88: Hoare triple {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} assume !!(foo_~i~0#1 < ~n~0); {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,368 INFO L290 TraceCheckUtils]: 89: Hoare triple {5692#(and (<= 128 (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 {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,368 INFO L290 TraceCheckUtils]: 90: Hoare triple {5692#(and (<= 128 (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; {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,369 INFO L290 TraceCheckUtils]: 91: Hoare triple {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} assume !!(foo_~i~0#1 < ~n~0); {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,370 INFO L290 TraceCheckUtils]: 92: Hoare triple {5692#(and (<= 128 (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 {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,370 INFO L290 TraceCheckUtils]: 93: Hoare triple {5692#(and (<= 128 (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; {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,371 INFO L290 TraceCheckUtils]: 94: Hoare triple {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} assume !(foo_~i~0#1 < ~n~0); {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:44:00,371 INFO L290 TraceCheckUtils]: 95: Hoare triple {5692#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} foo_~i~0#1 := 0; {5975#(and (<= 128 (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:00,371 INFO L290 TraceCheckUtils]: 96: Hoare triple {5975#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4) (<= 0 |ULTIMATE.start_foo_~i~0#1|))} assume !!(foo_~i~0#1 < 127); {5975#(and (<= 128 (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:00,372 INFO L290 TraceCheckUtils]: 97: Hoare triple {5975#(and (<= 128 (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 {5975#(and (<= 128 (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:00,372 INFO L290 TraceCheckUtils]: 98: Hoare triple {5975#(and (<= 128 (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; {5985#(and (<= 128 (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:00,373 INFO L290 TraceCheckUtils]: 99: Hoare triple {5985#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4) (<= 1 |ULTIMATE.start_foo_~i~0#1|))} assume !!(foo_~i~0#1 < 127); {5989#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (< |ULTIMATE.start_foo_~i~0#1| 127) (= ~b~0.offset 4) (<= 1 |ULTIMATE.start_foo_~i~0#1|))} is VALID [2022-02-20 23:44:00,373 INFO L290 TraceCheckUtils]: 100: Hoare triple {5989#(and (<= 128 (div (select |#length| ~b~0.base) 4)) (< |ULTIMATE.start_foo_~i~0#1| 127) (= ~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); {5653#false} is VALID [2022-02-20 23:44:00,374 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:00,374 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:44:00,374 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1332493008] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:44:00,374 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 23:44:00,374 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [34] total 38 [2022-02-20 23:44:00,374 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406610914] [2022-02-20 23:44:00,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:44:00,374 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:00,375 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:00,375 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:00,385 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:00,385 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:44:00,385 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:44:00,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:44:00,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=545, Invalid=861, Unknown=0, NotChecked=0, Total=1406 [2022-02-20 23:44:00,386 INFO L87 Difference]: Start difference. First operand 158 states and 172 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:00,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:00,466 INFO L93 Difference]: Finished difference Result 157 states and 158 transitions. [2022-02-20 23:44:00,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:44:00,466 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:00,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:00,466 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:00,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2022-02-20 23:44:00,466 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:00,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2022-02-20 23:44:00,467 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 34 transitions. [2022-02-20 23:44:00,495 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:00,497 INFO L225 Difference]: With dead ends: 157 [2022-02-20 23:44:00,497 INFO L226 Difference]: Without dead ends: 157 [2022-02-20 23:44:00,497 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:00,497 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 25 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:00,497 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 26 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:44:00,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-02-20 23:44:00,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2022-02-20 23:44:00,499 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:00,499 INFO L82 GeneralOperation]: Start isEquivalent. First operand 157 states. Second operand has 157 states, 153 states have (on average 1.0326797385620916) internal successors, (158), 156 states have internal predecessors, (158), 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,500 INFO L74 IsIncluded]: Start isIncluded. First operand 157 states. Second operand has 157 states, 153 states have (on average 1.0326797385620916) internal successors, (158), 156 states have internal predecessors, (158), 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,500 INFO L87 Difference]: Start difference. First operand 157 states. Second operand has 157 states, 153 states have (on average 1.0326797385620916) internal successors, (158), 156 states have internal predecessors, (158), 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,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:00,501 INFO L93 Difference]: Finished difference Result 157 states and 158 transitions. [2022-02-20 23:44:00,501 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2022-02-20 23:44:00,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:00,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:00,502 INFO L74 IsIncluded]: Start isIncluded. First operand has 157 states, 153 states have (on average 1.0326797385620916) internal successors, (158), 156 states have internal predecessors, (158), 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 157 states. [2022-02-20 23:44:00,502 INFO L87 Difference]: Start difference. First operand has 157 states, 153 states have (on average 1.0326797385620916) internal successors, (158), 156 states have internal predecessors, (158), 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 157 states. [2022-02-20 23:44:00,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:00,510 INFO L93 Difference]: Finished difference Result 157 states and 158 transitions. [2022-02-20 23:44:00,510 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2022-02-20 23:44:00,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:00,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:00,510 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:00,510 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:00,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 153 states have (on average 1.0326797385620916) internal successors, (158), 156 states have internal predecessors, (158), 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,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2022-02-20 23:44:00,512 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 101 [2022-02-20 23:44:00,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:00,512 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2022-02-20 23:44:00,513 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:00,513 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2022-02-20 23:44:00,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-02-20 23:44:00,514 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:00,514 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:00,537 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:00,727 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:00,727 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:00,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:00,728 INFO L85 PathProgramCache]: Analyzing trace with hash -376576047, now seen corresponding path program 1 times [2022-02-20 23:44:00,728 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:44:00,728 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050234846] [2022-02-20 23:44:00,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:00,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:44:00,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:00,855 INFO L290 TraceCheckUtils]: 0: Hoare triple {6620#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; {6620#true} is VALID [2022-02-20 23:44:00,856 INFO L290 TraceCheckUtils]: 1: Hoare triple {6620#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 := 128;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; {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,856 INFO L290 TraceCheckUtils]: 2: Hoare triple {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} SUMMARY for call write~int(0, main_#t~post7#1.base, main_#t~post7#1.offset, 4); srcloc: L538 {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,857 INFO L290 TraceCheckUtils]: 3: Hoare triple {6622#(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; {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,857 INFO L290 TraceCheckUtils]: 4: Hoare triple {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < ~n~0); {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,857 INFO L290 TraceCheckUtils]: 5: Hoare triple {6622#(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 {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,857 INFO L290 TraceCheckUtils]: 6: Hoare triple {6622#(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; {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,858 INFO L290 TraceCheckUtils]: 7: Hoare triple {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < ~n~0); {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,858 INFO L290 TraceCheckUtils]: 8: Hoare triple {6622#(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 {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,858 INFO L290 TraceCheckUtils]: 9: Hoare triple {6622#(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; {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,858 INFO L290 TraceCheckUtils]: 10: Hoare triple {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < ~n~0); {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,859 INFO L290 TraceCheckUtils]: 11: Hoare triple {6622#(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 {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,859 INFO L290 TraceCheckUtils]: 12: Hoare triple {6622#(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; {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,859 INFO L290 TraceCheckUtils]: 13: Hoare triple {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < ~n~0); {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,859 INFO L290 TraceCheckUtils]: 14: Hoare triple {6622#(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 {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,860 INFO L290 TraceCheckUtils]: 15: Hoare triple {6622#(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; {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,860 INFO L290 TraceCheckUtils]: 16: Hoare triple {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < ~n~0); {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,860 INFO L290 TraceCheckUtils]: 17: Hoare triple {6622#(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 {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,860 INFO L290 TraceCheckUtils]: 18: Hoare triple {6622#(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; {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,861 INFO L290 TraceCheckUtils]: 19: Hoare triple {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < ~n~0); {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,861 INFO L290 TraceCheckUtils]: 20: Hoare triple {6622#(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 {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,861 INFO L290 TraceCheckUtils]: 21: Hoare triple {6622#(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; {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,861 INFO L290 TraceCheckUtils]: 22: Hoare triple {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < ~n~0); {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,862 INFO L290 TraceCheckUtils]: 23: Hoare triple {6622#(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 {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,862 INFO L290 TraceCheckUtils]: 24: Hoare triple {6622#(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; {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,862 INFO L290 TraceCheckUtils]: 25: Hoare triple {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < ~n~0); {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,862 INFO L290 TraceCheckUtils]: 26: Hoare triple {6622#(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 {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,863 INFO L290 TraceCheckUtils]: 27: Hoare triple {6622#(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; {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,863 INFO L290 TraceCheckUtils]: 28: Hoare triple {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < ~n~0); {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,863 INFO L290 TraceCheckUtils]: 29: Hoare triple {6622#(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 {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,863 INFO L290 TraceCheckUtils]: 30: Hoare triple {6622#(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; {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,864 INFO L290 TraceCheckUtils]: 31: Hoare triple {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < ~n~0); {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,864 INFO L290 TraceCheckUtils]: 32: Hoare triple {6622#(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 {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,864 INFO L290 TraceCheckUtils]: 33: Hoare triple {6622#(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; {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,865 INFO L290 TraceCheckUtils]: 34: Hoare triple {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < ~n~0); {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,865 INFO L290 TraceCheckUtils]: 35: Hoare triple {6622#(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 {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,865 INFO L290 TraceCheckUtils]: 36: Hoare triple {6622#(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; {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,865 INFO L290 TraceCheckUtils]: 37: Hoare triple {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < ~n~0); {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,866 INFO L290 TraceCheckUtils]: 38: Hoare triple {6622#(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 {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,866 INFO L290 TraceCheckUtils]: 39: Hoare triple {6622#(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; {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,866 INFO L290 TraceCheckUtils]: 40: Hoare triple {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < ~n~0); {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,866 INFO L290 TraceCheckUtils]: 41: Hoare triple {6622#(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 {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,867 INFO L290 TraceCheckUtils]: 42: Hoare triple {6622#(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; {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,867 INFO L290 TraceCheckUtils]: 43: Hoare triple {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < ~n~0); {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,867 INFO L290 TraceCheckUtils]: 44: Hoare triple {6622#(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 {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,867 INFO L290 TraceCheckUtils]: 45: Hoare triple {6622#(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; {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,868 INFO L290 TraceCheckUtils]: 46: Hoare triple {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < ~n~0); {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,869 INFO L290 TraceCheckUtils]: 47: Hoare triple {6622#(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 {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,869 INFO L290 TraceCheckUtils]: 48: Hoare triple {6622#(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; {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,869 INFO L290 TraceCheckUtils]: 49: Hoare triple {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < ~n~0); {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,870 INFO L290 TraceCheckUtils]: 50: Hoare triple {6622#(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 {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,870 INFO L290 TraceCheckUtils]: 51: Hoare triple {6622#(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; {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,870 INFO L290 TraceCheckUtils]: 52: Hoare triple {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < ~n~0); {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,870 INFO L290 TraceCheckUtils]: 53: Hoare triple {6622#(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 {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,871 INFO L290 TraceCheckUtils]: 54: Hoare triple {6622#(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; {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,871 INFO L290 TraceCheckUtils]: 55: Hoare triple {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < ~n~0); {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,871 INFO L290 TraceCheckUtils]: 56: Hoare triple {6622#(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 {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,871 INFO L290 TraceCheckUtils]: 57: Hoare triple {6622#(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; {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,872 INFO L290 TraceCheckUtils]: 58: Hoare triple {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < ~n~0); {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,872 INFO L290 TraceCheckUtils]: 59: Hoare triple {6622#(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 {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,872 INFO L290 TraceCheckUtils]: 60: Hoare triple {6622#(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; {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,872 INFO L290 TraceCheckUtils]: 61: Hoare triple {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < ~n~0); {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,873 INFO L290 TraceCheckUtils]: 62: Hoare triple {6622#(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 {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,873 INFO L290 TraceCheckUtils]: 63: Hoare triple {6622#(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; {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,873 INFO L290 TraceCheckUtils]: 64: Hoare triple {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < ~n~0); {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,873 INFO L290 TraceCheckUtils]: 65: Hoare triple {6622#(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 {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,874 INFO L290 TraceCheckUtils]: 66: Hoare triple {6622#(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; {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,874 INFO L290 TraceCheckUtils]: 67: Hoare triple {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < ~n~0); {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,874 INFO L290 TraceCheckUtils]: 68: Hoare triple {6622#(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 {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,874 INFO L290 TraceCheckUtils]: 69: Hoare triple {6622#(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; {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,875 INFO L290 TraceCheckUtils]: 70: Hoare triple {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < ~n~0); {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,875 INFO L290 TraceCheckUtils]: 71: Hoare triple {6622#(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 {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,875 INFO L290 TraceCheckUtils]: 72: Hoare triple {6622#(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; {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,875 INFO L290 TraceCheckUtils]: 73: Hoare triple {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < ~n~0); {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,876 INFO L290 TraceCheckUtils]: 74: Hoare triple {6622#(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 {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,876 INFO L290 TraceCheckUtils]: 75: Hoare triple {6622#(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; {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,876 INFO L290 TraceCheckUtils]: 76: Hoare triple {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < ~n~0); {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,876 INFO L290 TraceCheckUtils]: 77: Hoare triple {6622#(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 {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,877 INFO L290 TraceCheckUtils]: 78: Hoare triple {6622#(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; {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,877 INFO L290 TraceCheckUtils]: 79: Hoare triple {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < ~n~0); {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,877 INFO L290 TraceCheckUtils]: 80: Hoare triple {6622#(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 {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,877 INFO L290 TraceCheckUtils]: 81: Hoare triple {6622#(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; {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,878 INFO L290 TraceCheckUtils]: 82: Hoare triple {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < ~n~0); {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,878 INFO L290 TraceCheckUtils]: 83: Hoare triple {6622#(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 {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,878 INFO L290 TraceCheckUtils]: 84: Hoare triple {6622#(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; {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,879 INFO L290 TraceCheckUtils]: 85: Hoare triple {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < ~n~0); {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,879 INFO L290 TraceCheckUtils]: 86: Hoare triple {6622#(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 {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,879 INFO L290 TraceCheckUtils]: 87: Hoare triple {6622#(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; {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,879 INFO L290 TraceCheckUtils]: 88: Hoare triple {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < ~n~0); {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,880 INFO L290 TraceCheckUtils]: 89: Hoare triple {6622#(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 {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,880 INFO L290 TraceCheckUtils]: 90: Hoare triple {6622#(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; {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,880 INFO L290 TraceCheckUtils]: 91: Hoare triple {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < ~n~0); {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,880 INFO L290 TraceCheckUtils]: 92: Hoare triple {6622#(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 {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,881 INFO L290 TraceCheckUtils]: 93: Hoare triple {6622#(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; {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,881 INFO L290 TraceCheckUtils]: 94: Hoare triple {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !(foo_~i~0#1 < ~n~0); {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,881 INFO L290 TraceCheckUtils]: 95: Hoare triple {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} foo_~i~0#1 := 0; {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,881 INFO L290 TraceCheckUtils]: 96: Hoare triple {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < 127); {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,882 INFO L290 TraceCheckUtils]: 97: Hoare triple {6622#(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 {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,882 INFO L290 TraceCheckUtils]: 98: Hoare triple {6622#(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; {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,882 INFO L290 TraceCheckUtils]: 99: Hoare triple {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < 127); {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,882 INFO L290 TraceCheckUtils]: 100: Hoare triple {6622#(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 {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,883 INFO L290 TraceCheckUtils]: 101: Hoare triple {6622#(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; {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,883 INFO L290 TraceCheckUtils]: 102: Hoare triple {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < 127); {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,883 INFO L290 TraceCheckUtils]: 103: Hoare triple {6622#(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 {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,883 INFO L290 TraceCheckUtils]: 104: Hoare triple {6622#(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; {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,884 INFO L290 TraceCheckUtils]: 105: Hoare triple {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < 127); {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,884 INFO L290 TraceCheckUtils]: 106: Hoare triple {6622#(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 {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,884 INFO L290 TraceCheckUtils]: 107: Hoare triple {6622#(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; {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,884 INFO L290 TraceCheckUtils]: 108: Hoare triple {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < 127); {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,885 INFO L290 TraceCheckUtils]: 109: Hoare triple {6622#(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 {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,885 INFO L290 TraceCheckUtils]: 110: Hoare triple {6622#(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; {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,885 INFO L290 TraceCheckUtils]: 111: Hoare triple {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < 127); {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,885 INFO L290 TraceCheckUtils]: 112: Hoare triple {6622#(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 {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,886 INFO L290 TraceCheckUtils]: 113: Hoare triple {6622#(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; {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,886 INFO L290 TraceCheckUtils]: 114: Hoare triple {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < 127); {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,886 INFO L290 TraceCheckUtils]: 115: Hoare triple {6622#(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 {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,886 INFO L290 TraceCheckUtils]: 116: Hoare triple {6622#(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; {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,887 INFO L290 TraceCheckUtils]: 117: Hoare triple {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < 127); {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,887 INFO L290 TraceCheckUtils]: 118: Hoare triple {6622#(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 {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,887 INFO L290 TraceCheckUtils]: 119: Hoare triple {6622#(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; {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,887 INFO L290 TraceCheckUtils]: 120: Hoare triple {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < 127); {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,888 INFO L290 TraceCheckUtils]: 121: Hoare triple {6622#(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 {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,888 INFO L290 TraceCheckUtils]: 122: Hoare triple {6622#(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; {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,888 INFO L290 TraceCheckUtils]: 123: Hoare triple {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < 127); {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,888 INFO L290 TraceCheckUtils]: 124: Hoare triple {6622#(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 {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,889 INFO L290 TraceCheckUtils]: 125: Hoare triple {6622#(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; {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,889 INFO L290 TraceCheckUtils]: 126: Hoare triple {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < 127); {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,889 INFO L290 TraceCheckUtils]: 127: Hoare triple {6622#(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 {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,889 INFO L290 TraceCheckUtils]: 128: Hoare triple {6622#(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; {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,890 INFO L290 TraceCheckUtils]: 129: Hoare triple {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < 127); {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,890 INFO L290 TraceCheckUtils]: 130: Hoare triple {6622#(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 {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,890 INFO L290 TraceCheckUtils]: 131: Hoare triple {6622#(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; {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,890 INFO L290 TraceCheckUtils]: 132: Hoare triple {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < 127); {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,891 INFO L290 TraceCheckUtils]: 133: Hoare triple {6622#(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 {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,891 INFO L290 TraceCheckUtils]: 134: Hoare triple {6622#(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; {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,891 INFO L290 TraceCheckUtils]: 135: Hoare triple {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < 127); {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,891 INFO L290 TraceCheckUtils]: 136: Hoare triple {6622#(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 {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,892 INFO L290 TraceCheckUtils]: 137: Hoare triple {6622#(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; {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,892 INFO L290 TraceCheckUtils]: 138: Hoare triple {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < 127); {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,892 INFO L290 TraceCheckUtils]: 139: Hoare triple {6622#(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 {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,892 INFO L290 TraceCheckUtils]: 140: Hoare triple {6622#(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; {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,893 INFO L290 TraceCheckUtils]: 141: Hoare triple {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !(foo_~i~0#1 < 127); {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,893 INFO L290 TraceCheckUtils]: 142: Hoare triple {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} assume { :end_inline_foo } true; {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,893 INFO L290 TraceCheckUtils]: 143: Hoare triple {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} SUMMARY for call main_#t~mem8#1 := read~int(~b~0.base, -4 + ~b~0.offset, 4); srcloc: L540 {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,894 INFO L290 TraceCheckUtils]: 144: Hoare triple {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !(0 != main_#t~mem8#1);havoc main_#t~mem8#1; {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,894 INFO L290 TraceCheckUtils]: 145: Hoare triple {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} assume 0 == ~a~0.offset; {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:44:00,894 INFO L290 TraceCheckUtils]: 146: Hoare triple {6622#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !(~a~0.base < #StackHeapBarrier); {6621#false} is VALID [2022-02-20 23:44:00,895 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:00,895 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:44:00,895 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050234846] [2022-02-20 23:44:00,895 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050234846] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:44:00,895 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:44:00,895 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:44:00,895 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735199882] [2022-02-20 23:44:00,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:44:00,895 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:00,896 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:00,896 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:00,906 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:00,906 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:44:00,906 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:44:00,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:44:00,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:44:00,906 INFO L87 Difference]: Start difference. First operand 157 states and 158 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:00,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:00,921 INFO L93 Difference]: Finished difference Result 155 states and 156 transitions. [2022-02-20 23:44:00,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:44:00,922 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:00,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:00,923 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:00,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2022-02-20 23:44:00,923 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:00,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2022-02-20 23:44:00,924 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 27 transitions. [2022-02-20 23:44:00,940 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:00,941 INFO L225 Difference]: With dead ends: 155 [2022-02-20 23:44:00,941 INFO L226 Difference]: Without dead ends: 155 [2022-02-20 23:44:00,941 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:00,942 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 8 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:00,942 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 19 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:44:00,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-02-20 23:44:00,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2022-02-20 23:44:00,944 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:00,944 INFO L82 GeneralOperation]: Start isEquivalent. First operand 155 states. Second operand has 155 states, 153 states have (on average 1.0196078431372548) internal successors, (156), 154 states have internal predecessors, (156), 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,944 INFO L74 IsIncluded]: Start isIncluded. First operand 155 states. Second operand has 155 states, 153 states have (on average 1.0196078431372548) internal successors, (156), 154 states have internal predecessors, (156), 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,944 INFO L87 Difference]: Start difference. First operand 155 states. Second operand has 155 states, 153 states have (on average 1.0196078431372548) internal successors, (156), 154 states have internal predecessors, (156), 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,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:00,946 INFO L93 Difference]: Finished difference Result 155 states and 156 transitions. [2022-02-20 23:44:00,946 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 156 transitions. [2022-02-20 23:44:00,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:00,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:00,946 INFO L74 IsIncluded]: Start isIncluded. First operand has 155 states, 153 states have (on average 1.0196078431372548) internal successors, (156), 154 states have internal predecessors, (156), 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 155 states. [2022-02-20 23:44:00,946 INFO L87 Difference]: Start difference. First operand has 155 states, 153 states have (on average 1.0196078431372548) internal successors, (156), 154 states have internal predecessors, (156), 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 155 states. [2022-02-20 23:44:00,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:00,948 INFO L93 Difference]: Finished difference Result 155 states and 156 transitions. [2022-02-20 23:44:00,948 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 156 transitions. [2022-02-20 23:44:00,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:00,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:00,948 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:00,948 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:00,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 153 states have (on average 1.0196078431372548) internal successors, (156), 154 states have internal predecessors, (156), 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,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 156 transitions. [2022-02-20 23:44:00,950 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 156 transitions. Word has length 147 [2022-02-20 23:44:00,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:00,950 INFO L470 AbstractCegarLoop]: Abstraction has 155 states and 156 transitions. [2022-02-20 23:44:00,950 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:00,950 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 156 transitions. [2022-02-20 23:44:00,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-02-20 23:44:00,951 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:00,951 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:00,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-20 23:44:00,951 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2022-02-20 23:44:00,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:00,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1112325229, now seen corresponding path program 1 times [2022-02-20 23:44:00,952 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:44:00,952 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864148304] [2022-02-20 23:44:00,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:00,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:44:01,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:01,149 INFO L290 TraceCheckUtils]: 0: Hoare triple {7245#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; {7245#true} is VALID [2022-02-20 23:44:01,149 INFO L290 TraceCheckUtils]: 1: Hoare triple {7245#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 := 128;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; {7245#true} is VALID [2022-02-20 23:44:01,149 INFO L290 TraceCheckUtils]: 2: Hoare triple {7245#true} SUMMARY for call write~int(0, main_#t~post7#1.base, main_#t~post7#1.offset, 4); srcloc: L538 {7245#true} is VALID [2022-02-20 23:44:01,150 INFO L290 TraceCheckUtils]: 3: Hoare triple {7245#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; {7245#true} is VALID [2022-02-20 23:44:01,150 INFO L290 TraceCheckUtils]: 4: Hoare triple {7245#true} assume !!(foo_~i~0#1 < ~n~0); {7245#true} is VALID [2022-02-20 23:44:01,150 INFO L290 TraceCheckUtils]: 5: Hoare triple {7245#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7245#true} is VALID [2022-02-20 23:44:01,150 INFO L290 TraceCheckUtils]: 6: Hoare triple {7245#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7245#true} is VALID [2022-02-20 23:44:01,150 INFO L290 TraceCheckUtils]: 7: Hoare triple {7245#true} assume !!(foo_~i~0#1 < ~n~0); {7245#true} is VALID [2022-02-20 23:44:01,150 INFO L290 TraceCheckUtils]: 8: Hoare triple {7245#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7245#true} is VALID [2022-02-20 23:44:01,150 INFO L290 TraceCheckUtils]: 9: Hoare triple {7245#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7245#true} is VALID [2022-02-20 23:44:01,150 INFO L290 TraceCheckUtils]: 10: Hoare triple {7245#true} assume !!(foo_~i~0#1 < ~n~0); {7245#true} is VALID [2022-02-20 23:44:01,150 INFO L290 TraceCheckUtils]: 11: Hoare triple {7245#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7245#true} is VALID [2022-02-20 23:44:01,151 INFO L290 TraceCheckUtils]: 12: Hoare triple {7245#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7245#true} is VALID [2022-02-20 23:44:01,151 INFO L290 TraceCheckUtils]: 13: Hoare triple {7245#true} assume !!(foo_~i~0#1 < ~n~0); {7245#true} is VALID [2022-02-20 23:44:01,151 INFO L290 TraceCheckUtils]: 14: Hoare triple {7245#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7245#true} is VALID [2022-02-20 23:44:01,151 INFO L290 TraceCheckUtils]: 15: Hoare triple {7245#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7245#true} is VALID [2022-02-20 23:44:01,151 INFO L290 TraceCheckUtils]: 16: Hoare triple {7245#true} assume !!(foo_~i~0#1 < ~n~0); {7245#true} is VALID [2022-02-20 23:44:01,151 INFO L290 TraceCheckUtils]: 17: Hoare triple {7245#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7245#true} is VALID [2022-02-20 23:44:01,151 INFO L290 TraceCheckUtils]: 18: Hoare triple {7245#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7245#true} is VALID [2022-02-20 23:44:01,151 INFO L290 TraceCheckUtils]: 19: Hoare triple {7245#true} assume !!(foo_~i~0#1 < ~n~0); {7245#true} is VALID [2022-02-20 23:44:01,151 INFO L290 TraceCheckUtils]: 20: Hoare triple {7245#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7245#true} is VALID [2022-02-20 23:44:01,152 INFO L290 TraceCheckUtils]: 21: Hoare triple {7245#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7245#true} is VALID [2022-02-20 23:44:01,152 INFO L290 TraceCheckUtils]: 22: Hoare triple {7245#true} assume !!(foo_~i~0#1 < ~n~0); {7245#true} is VALID [2022-02-20 23:44:01,152 INFO L290 TraceCheckUtils]: 23: Hoare triple {7245#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7245#true} is VALID [2022-02-20 23:44:01,152 INFO L290 TraceCheckUtils]: 24: Hoare triple {7245#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7245#true} is VALID [2022-02-20 23:44:01,152 INFO L290 TraceCheckUtils]: 25: Hoare triple {7245#true} assume !!(foo_~i~0#1 < ~n~0); {7245#true} is VALID [2022-02-20 23:44:01,152 INFO L290 TraceCheckUtils]: 26: Hoare triple {7245#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7245#true} is VALID [2022-02-20 23:44:01,152 INFO L290 TraceCheckUtils]: 27: Hoare triple {7245#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7245#true} is VALID [2022-02-20 23:44:01,152 INFO L290 TraceCheckUtils]: 28: Hoare triple {7245#true} assume !!(foo_~i~0#1 < ~n~0); {7245#true} is VALID [2022-02-20 23:44:01,152 INFO L290 TraceCheckUtils]: 29: Hoare triple {7245#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7245#true} is VALID [2022-02-20 23:44:01,153 INFO L290 TraceCheckUtils]: 30: Hoare triple {7245#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7245#true} is VALID [2022-02-20 23:44:01,153 INFO L290 TraceCheckUtils]: 31: Hoare triple {7245#true} assume !!(foo_~i~0#1 < ~n~0); {7245#true} is VALID [2022-02-20 23:44:01,153 INFO L290 TraceCheckUtils]: 32: Hoare triple {7245#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7245#true} is VALID [2022-02-20 23:44:01,153 INFO L290 TraceCheckUtils]: 33: Hoare triple {7245#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7245#true} is VALID [2022-02-20 23:44:01,154 INFO L290 TraceCheckUtils]: 34: Hoare triple {7245#true} assume !!(foo_~i~0#1 < ~n~0); {7245#true} is VALID [2022-02-20 23:44:01,154 INFO L290 TraceCheckUtils]: 35: Hoare triple {7245#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7245#true} is VALID [2022-02-20 23:44:01,154 INFO L290 TraceCheckUtils]: 36: Hoare triple {7245#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7245#true} is VALID [2022-02-20 23:44:01,154 INFO L290 TraceCheckUtils]: 37: Hoare triple {7245#true} assume !!(foo_~i~0#1 < ~n~0); {7245#true} is VALID [2022-02-20 23:44:01,154 INFO L290 TraceCheckUtils]: 38: Hoare triple {7245#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7245#true} is VALID [2022-02-20 23:44:01,154 INFO L290 TraceCheckUtils]: 39: Hoare triple {7245#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7245#true} is VALID [2022-02-20 23:44:01,154 INFO L290 TraceCheckUtils]: 40: Hoare triple {7245#true} assume !!(foo_~i~0#1 < ~n~0); {7245#true} is VALID [2022-02-20 23:44:01,154 INFO L290 TraceCheckUtils]: 41: Hoare triple {7245#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7245#true} is VALID [2022-02-20 23:44:01,154 INFO L290 TraceCheckUtils]: 42: Hoare triple {7245#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7245#true} is VALID [2022-02-20 23:44:01,154 INFO L290 TraceCheckUtils]: 43: Hoare triple {7245#true} assume !!(foo_~i~0#1 < ~n~0); {7245#true} is VALID [2022-02-20 23:44:01,155 INFO L290 TraceCheckUtils]: 44: Hoare triple {7245#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7245#true} is VALID [2022-02-20 23:44:01,155 INFO L290 TraceCheckUtils]: 45: Hoare triple {7245#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7245#true} is VALID [2022-02-20 23:44:01,155 INFO L290 TraceCheckUtils]: 46: Hoare triple {7245#true} assume !!(foo_~i~0#1 < ~n~0); {7245#true} is VALID [2022-02-20 23:44:01,155 INFO L290 TraceCheckUtils]: 47: Hoare triple {7245#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7245#true} is VALID [2022-02-20 23:44:01,155 INFO L290 TraceCheckUtils]: 48: Hoare triple {7245#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7245#true} is VALID [2022-02-20 23:44:01,155 INFO L290 TraceCheckUtils]: 49: Hoare triple {7245#true} assume !!(foo_~i~0#1 < ~n~0); {7245#true} is VALID [2022-02-20 23:44:01,155 INFO L290 TraceCheckUtils]: 50: Hoare triple {7245#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7245#true} is VALID [2022-02-20 23:44:01,155 INFO L290 TraceCheckUtils]: 51: Hoare triple {7245#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7245#true} is VALID [2022-02-20 23:44:01,155 INFO L290 TraceCheckUtils]: 52: Hoare triple {7245#true} assume !!(foo_~i~0#1 < ~n~0); {7245#true} is VALID [2022-02-20 23:44:01,156 INFO L290 TraceCheckUtils]: 53: Hoare triple {7245#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7245#true} is VALID [2022-02-20 23:44:01,156 INFO L290 TraceCheckUtils]: 54: Hoare triple {7245#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7245#true} is VALID [2022-02-20 23:44:01,156 INFO L290 TraceCheckUtils]: 55: Hoare triple {7245#true} assume !!(foo_~i~0#1 < ~n~0); {7245#true} is VALID [2022-02-20 23:44:01,156 INFO L290 TraceCheckUtils]: 56: Hoare triple {7245#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7245#true} is VALID [2022-02-20 23:44:01,156 INFO L290 TraceCheckUtils]: 57: Hoare triple {7245#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7245#true} is VALID [2022-02-20 23:44:01,156 INFO L290 TraceCheckUtils]: 58: Hoare triple {7245#true} assume !!(foo_~i~0#1 < ~n~0); {7245#true} is VALID [2022-02-20 23:44:01,156 INFO L290 TraceCheckUtils]: 59: Hoare triple {7245#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7245#true} is VALID [2022-02-20 23:44:01,156 INFO L290 TraceCheckUtils]: 60: Hoare triple {7245#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7245#true} is VALID [2022-02-20 23:44:01,156 INFO L290 TraceCheckUtils]: 61: Hoare triple {7245#true} assume !!(foo_~i~0#1 < ~n~0); {7245#true} is VALID [2022-02-20 23:44:01,156 INFO L290 TraceCheckUtils]: 62: Hoare triple {7245#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7245#true} is VALID [2022-02-20 23:44:01,157 INFO L290 TraceCheckUtils]: 63: Hoare triple {7245#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7245#true} is VALID [2022-02-20 23:44:01,157 INFO L290 TraceCheckUtils]: 64: Hoare triple {7245#true} assume !!(foo_~i~0#1 < ~n~0); {7245#true} is VALID [2022-02-20 23:44:01,157 INFO L290 TraceCheckUtils]: 65: Hoare triple {7245#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7245#true} is VALID [2022-02-20 23:44:01,157 INFO L290 TraceCheckUtils]: 66: Hoare triple {7245#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7245#true} is VALID [2022-02-20 23:44:01,157 INFO L290 TraceCheckUtils]: 67: Hoare triple {7245#true} assume !!(foo_~i~0#1 < ~n~0); {7245#true} is VALID [2022-02-20 23:44:01,157 INFO L290 TraceCheckUtils]: 68: Hoare triple {7245#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7245#true} is VALID [2022-02-20 23:44:01,157 INFO L290 TraceCheckUtils]: 69: Hoare triple {7245#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7245#true} is VALID [2022-02-20 23:44:01,157 INFO L290 TraceCheckUtils]: 70: Hoare triple {7245#true} assume !!(foo_~i~0#1 < ~n~0); {7245#true} is VALID [2022-02-20 23:44:01,157 INFO L290 TraceCheckUtils]: 71: Hoare triple {7245#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7245#true} is VALID [2022-02-20 23:44:01,158 INFO L290 TraceCheckUtils]: 72: Hoare triple {7245#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7245#true} is VALID [2022-02-20 23:44:01,158 INFO L290 TraceCheckUtils]: 73: Hoare triple {7245#true} assume !!(foo_~i~0#1 < ~n~0); {7245#true} is VALID [2022-02-20 23:44:01,158 INFO L290 TraceCheckUtils]: 74: Hoare triple {7245#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7245#true} is VALID [2022-02-20 23:44:01,158 INFO L290 TraceCheckUtils]: 75: Hoare triple {7245#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7245#true} is VALID [2022-02-20 23:44:01,158 INFO L290 TraceCheckUtils]: 76: Hoare triple {7245#true} assume !!(foo_~i~0#1 < ~n~0); {7245#true} is VALID [2022-02-20 23:44:01,158 INFO L290 TraceCheckUtils]: 77: Hoare triple {7245#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7245#true} is VALID [2022-02-20 23:44:01,158 INFO L290 TraceCheckUtils]: 78: Hoare triple {7245#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7245#true} is VALID [2022-02-20 23:44:01,158 INFO L290 TraceCheckUtils]: 79: Hoare triple {7245#true} assume !!(foo_~i~0#1 < ~n~0); {7245#true} is VALID [2022-02-20 23:44:01,158 INFO L290 TraceCheckUtils]: 80: Hoare triple {7245#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7245#true} is VALID [2022-02-20 23:44:01,158 INFO L290 TraceCheckUtils]: 81: Hoare triple {7245#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7245#true} is VALID [2022-02-20 23:44:01,159 INFO L290 TraceCheckUtils]: 82: Hoare triple {7245#true} assume !!(foo_~i~0#1 < ~n~0); {7245#true} is VALID [2022-02-20 23:44:01,159 INFO L290 TraceCheckUtils]: 83: Hoare triple {7245#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7245#true} is VALID [2022-02-20 23:44:01,160 INFO L290 TraceCheckUtils]: 84: Hoare triple {7245#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7245#true} is VALID [2022-02-20 23:44:01,160 INFO L290 TraceCheckUtils]: 85: Hoare triple {7245#true} assume !!(foo_~i~0#1 < ~n~0); {7245#true} is VALID [2022-02-20 23:44:01,160 INFO L290 TraceCheckUtils]: 86: Hoare triple {7245#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7245#true} is VALID [2022-02-20 23:44:01,160 INFO L290 TraceCheckUtils]: 87: Hoare triple {7245#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7245#true} is VALID [2022-02-20 23:44:01,160 INFO L290 TraceCheckUtils]: 88: Hoare triple {7245#true} assume !!(foo_~i~0#1 < ~n~0); {7245#true} is VALID [2022-02-20 23:44:01,160 INFO L290 TraceCheckUtils]: 89: Hoare triple {7245#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7245#true} is VALID [2022-02-20 23:44:01,160 INFO L290 TraceCheckUtils]: 90: Hoare triple {7245#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7245#true} is VALID [2022-02-20 23:44:01,160 INFO L290 TraceCheckUtils]: 91: Hoare triple {7245#true} assume !!(foo_~i~0#1 < ~n~0); {7245#true} is VALID [2022-02-20 23:44:01,160 INFO L290 TraceCheckUtils]: 92: Hoare triple {7245#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7245#true} is VALID [2022-02-20 23:44:01,160 INFO L290 TraceCheckUtils]: 93: Hoare triple {7245#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7245#true} is VALID [2022-02-20 23:44:01,161 INFO L290 TraceCheckUtils]: 94: Hoare triple {7245#true} assume !(foo_~i~0#1 < ~n~0); {7245#true} is VALID [2022-02-20 23:44:01,161 INFO L290 TraceCheckUtils]: 95: Hoare triple {7245#true} foo_~i~0#1 := 0; {7247#(= |ULTIMATE.start_foo_~i~0#1| 0)} is VALID [2022-02-20 23:44:01,161 INFO L290 TraceCheckUtils]: 96: Hoare triple {7247#(= |ULTIMATE.start_foo_~i~0#1| 0)} assume !!(foo_~i~0#1 < 127); {7247#(= |ULTIMATE.start_foo_~i~0#1| 0)} is VALID [2022-02-20 23:44:01,162 INFO L290 TraceCheckUtils]: 97: Hoare triple {7247#(= |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 {7247#(= |ULTIMATE.start_foo_~i~0#1| 0)} is VALID [2022-02-20 23:44:01,162 INFO L290 TraceCheckUtils]: 98: Hoare triple {7247#(= |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; {7248#(<= |ULTIMATE.start_foo_~i~0#1| 1)} is VALID [2022-02-20 23:44:01,162 INFO L290 TraceCheckUtils]: 99: Hoare triple {7248#(<= |ULTIMATE.start_foo_~i~0#1| 1)} assume !!(foo_~i~0#1 < 127); {7248#(<= |ULTIMATE.start_foo_~i~0#1| 1)} is VALID [2022-02-20 23:44:01,162 INFO L290 TraceCheckUtils]: 100: Hoare triple {7248#(<= |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 {7248#(<= |ULTIMATE.start_foo_~i~0#1| 1)} is VALID [2022-02-20 23:44:01,163 INFO L290 TraceCheckUtils]: 101: Hoare triple {7248#(<= |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; {7249#(<= |ULTIMATE.start_foo_~i~0#1| 2)} is VALID [2022-02-20 23:44:01,163 INFO L290 TraceCheckUtils]: 102: Hoare triple {7249#(<= |ULTIMATE.start_foo_~i~0#1| 2)} assume !!(foo_~i~0#1 < 127); {7249#(<= |ULTIMATE.start_foo_~i~0#1| 2)} is VALID [2022-02-20 23:44:01,163 INFO L290 TraceCheckUtils]: 103: Hoare triple {7249#(<= |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 {7249#(<= |ULTIMATE.start_foo_~i~0#1| 2)} is VALID [2022-02-20 23:44:01,164 INFO L290 TraceCheckUtils]: 104: Hoare triple {7249#(<= |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; {7250#(<= |ULTIMATE.start_foo_~i~0#1| 3)} is VALID [2022-02-20 23:44:01,164 INFO L290 TraceCheckUtils]: 105: Hoare triple {7250#(<= |ULTIMATE.start_foo_~i~0#1| 3)} assume !!(foo_~i~0#1 < 127); {7250#(<= |ULTIMATE.start_foo_~i~0#1| 3)} is VALID [2022-02-20 23:44:01,164 INFO L290 TraceCheckUtils]: 106: Hoare triple {7250#(<= |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 {7250#(<= |ULTIMATE.start_foo_~i~0#1| 3)} is VALID [2022-02-20 23:44:01,165 INFO L290 TraceCheckUtils]: 107: Hoare triple {7250#(<= |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; {7251#(<= |ULTIMATE.start_foo_~i~0#1| 4)} is VALID [2022-02-20 23:44:01,165 INFO L290 TraceCheckUtils]: 108: Hoare triple {7251#(<= |ULTIMATE.start_foo_~i~0#1| 4)} assume !!(foo_~i~0#1 < 127); {7251#(<= |ULTIMATE.start_foo_~i~0#1| 4)} is VALID [2022-02-20 23:44:01,165 INFO L290 TraceCheckUtils]: 109: Hoare triple {7251#(<= |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 {7251#(<= |ULTIMATE.start_foo_~i~0#1| 4)} is VALID [2022-02-20 23:44:01,166 INFO L290 TraceCheckUtils]: 110: Hoare triple {7251#(<= |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; {7252#(<= |ULTIMATE.start_foo_~i~0#1| 5)} is VALID [2022-02-20 23:44:01,166 INFO L290 TraceCheckUtils]: 111: Hoare triple {7252#(<= |ULTIMATE.start_foo_~i~0#1| 5)} assume !!(foo_~i~0#1 < 127); {7252#(<= |ULTIMATE.start_foo_~i~0#1| 5)} is VALID [2022-02-20 23:44:01,166 INFO L290 TraceCheckUtils]: 112: Hoare triple {7252#(<= |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 {7252#(<= |ULTIMATE.start_foo_~i~0#1| 5)} is VALID [2022-02-20 23:44:01,166 INFO L290 TraceCheckUtils]: 113: Hoare triple {7252#(<= |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; {7253#(<= |ULTIMATE.start_foo_~i~0#1| 6)} is VALID [2022-02-20 23:44:01,167 INFO L290 TraceCheckUtils]: 114: Hoare triple {7253#(<= |ULTIMATE.start_foo_~i~0#1| 6)} assume !!(foo_~i~0#1 < 127); {7253#(<= |ULTIMATE.start_foo_~i~0#1| 6)} is VALID [2022-02-20 23:44:01,167 INFO L290 TraceCheckUtils]: 115: Hoare triple {7253#(<= |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 {7253#(<= |ULTIMATE.start_foo_~i~0#1| 6)} is VALID [2022-02-20 23:44:01,167 INFO L290 TraceCheckUtils]: 116: Hoare triple {7253#(<= |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; {7254#(<= |ULTIMATE.start_foo_~i~0#1| 7)} is VALID [2022-02-20 23:44:01,168 INFO L290 TraceCheckUtils]: 117: Hoare triple {7254#(<= |ULTIMATE.start_foo_~i~0#1| 7)} assume !!(foo_~i~0#1 < 127); {7254#(<= |ULTIMATE.start_foo_~i~0#1| 7)} is VALID [2022-02-20 23:44:01,168 INFO L290 TraceCheckUtils]: 118: Hoare triple {7254#(<= |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 {7254#(<= |ULTIMATE.start_foo_~i~0#1| 7)} is VALID [2022-02-20 23:44:01,168 INFO L290 TraceCheckUtils]: 119: Hoare triple {7254#(<= |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; {7255#(<= |ULTIMATE.start_foo_~i~0#1| 8)} is VALID [2022-02-20 23:44:01,169 INFO L290 TraceCheckUtils]: 120: Hoare triple {7255#(<= |ULTIMATE.start_foo_~i~0#1| 8)} assume !!(foo_~i~0#1 < 127); {7255#(<= |ULTIMATE.start_foo_~i~0#1| 8)} is VALID [2022-02-20 23:44:01,169 INFO L290 TraceCheckUtils]: 121: Hoare triple {7255#(<= |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 {7255#(<= |ULTIMATE.start_foo_~i~0#1| 8)} is VALID [2022-02-20 23:44:01,169 INFO L290 TraceCheckUtils]: 122: Hoare triple {7255#(<= |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; {7256#(<= |ULTIMATE.start_foo_~i~0#1| 9)} is VALID [2022-02-20 23:44:01,169 INFO L290 TraceCheckUtils]: 123: Hoare triple {7256#(<= |ULTIMATE.start_foo_~i~0#1| 9)} assume !!(foo_~i~0#1 < 127); {7256#(<= |ULTIMATE.start_foo_~i~0#1| 9)} is VALID [2022-02-20 23:44:01,170 INFO L290 TraceCheckUtils]: 124: Hoare triple {7256#(<= |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 {7256#(<= |ULTIMATE.start_foo_~i~0#1| 9)} is VALID [2022-02-20 23:44:01,170 INFO L290 TraceCheckUtils]: 125: Hoare triple {7256#(<= |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; {7257#(<= |ULTIMATE.start_foo_~i~0#1| 10)} is VALID [2022-02-20 23:44:01,170 INFO L290 TraceCheckUtils]: 126: Hoare triple {7257#(<= |ULTIMATE.start_foo_~i~0#1| 10)} assume !!(foo_~i~0#1 < 127); {7257#(<= |ULTIMATE.start_foo_~i~0#1| 10)} is VALID [2022-02-20 23:44:01,171 INFO L290 TraceCheckUtils]: 127: Hoare triple {7257#(<= |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 {7257#(<= |ULTIMATE.start_foo_~i~0#1| 10)} is VALID [2022-02-20 23:44:01,171 INFO L290 TraceCheckUtils]: 128: Hoare triple {7257#(<= |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; {7258#(<= |ULTIMATE.start_foo_~i~0#1| 11)} is VALID [2022-02-20 23:44:01,171 INFO L290 TraceCheckUtils]: 129: Hoare triple {7258#(<= |ULTIMATE.start_foo_~i~0#1| 11)} assume !!(foo_~i~0#1 < 127); {7258#(<= |ULTIMATE.start_foo_~i~0#1| 11)} is VALID [2022-02-20 23:44:01,172 INFO L290 TraceCheckUtils]: 130: Hoare triple {7258#(<= |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 {7258#(<= |ULTIMATE.start_foo_~i~0#1| 11)} is VALID [2022-02-20 23:44:01,172 INFO L290 TraceCheckUtils]: 131: Hoare triple {7258#(<= |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; {7259#(<= |ULTIMATE.start_foo_~i~0#1| 12)} is VALID [2022-02-20 23:44:01,172 INFO L290 TraceCheckUtils]: 132: Hoare triple {7259#(<= |ULTIMATE.start_foo_~i~0#1| 12)} assume !!(foo_~i~0#1 < 127); {7259#(<= |ULTIMATE.start_foo_~i~0#1| 12)} is VALID [2022-02-20 23:44:01,172 INFO L290 TraceCheckUtils]: 133: Hoare triple {7259#(<= |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 {7259#(<= |ULTIMATE.start_foo_~i~0#1| 12)} is VALID [2022-02-20 23:44:01,173 INFO L290 TraceCheckUtils]: 134: Hoare triple {7259#(<= |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; {7260#(<= |ULTIMATE.start_foo_~i~0#1| 13)} is VALID [2022-02-20 23:44:01,173 INFO L290 TraceCheckUtils]: 135: Hoare triple {7260#(<= |ULTIMATE.start_foo_~i~0#1| 13)} assume !!(foo_~i~0#1 < 127); {7260#(<= |ULTIMATE.start_foo_~i~0#1| 13)} is VALID [2022-02-20 23:44:01,173 INFO L290 TraceCheckUtils]: 136: Hoare triple {7260#(<= |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 {7260#(<= |ULTIMATE.start_foo_~i~0#1| 13)} is VALID [2022-02-20 23:44:01,174 INFO L290 TraceCheckUtils]: 137: Hoare triple {7260#(<= |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; {7261#(<= |ULTIMATE.start_foo_~i~0#1| 14)} is VALID [2022-02-20 23:44:01,174 INFO L290 TraceCheckUtils]: 138: Hoare triple {7261#(<= |ULTIMATE.start_foo_~i~0#1| 14)} assume !!(foo_~i~0#1 < 127); {7261#(<= |ULTIMATE.start_foo_~i~0#1| 14)} is VALID [2022-02-20 23:44:01,174 INFO L290 TraceCheckUtils]: 139: Hoare triple {7261#(<= |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 {7261#(<= |ULTIMATE.start_foo_~i~0#1| 14)} is VALID [2022-02-20 23:44:01,175 INFO L290 TraceCheckUtils]: 140: Hoare triple {7261#(<= |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; {7262#(<= |ULTIMATE.start_foo_~i~0#1| 15)} is VALID [2022-02-20 23:44:01,175 INFO L290 TraceCheckUtils]: 141: Hoare triple {7262#(<= |ULTIMATE.start_foo_~i~0#1| 15)} assume !(foo_~i~0#1 < 127); {7246#false} is VALID [2022-02-20 23:44:01,175 INFO L290 TraceCheckUtils]: 142: Hoare triple {7246#false} assume { :end_inline_foo } true; {7246#false} is VALID [2022-02-20 23:44:01,175 INFO L290 TraceCheckUtils]: 143: Hoare triple {7246#false} SUMMARY for call main_#t~mem8#1 := read~int(~b~0.base, -4 + ~b~0.offset, 4); srcloc: L540 {7246#false} is VALID [2022-02-20 23:44:01,175 INFO L290 TraceCheckUtils]: 144: Hoare triple {7246#false} assume !(0 != main_#t~mem8#1);havoc main_#t~mem8#1; {7246#false} is VALID [2022-02-20 23:44:01,175 INFO L290 TraceCheckUtils]: 145: Hoare triple {7246#false} assume 0 == ~a~0.offset; {7246#false} is VALID [2022-02-20 23:44:01,175 INFO L290 TraceCheckUtils]: 146: Hoare triple {7246#false} assume ~a~0.base < #StackHeapBarrier; {7246#false} is VALID [2022-02-20 23:44:01,176 INFO L290 TraceCheckUtils]: 147: Hoare triple {7246#false} assume 0 == ~a~0.base || 1 == #valid[~a~0.base];call ULTIMATE.dealloc(~a~0.base, ~a~0.offset); {7246#false} is VALID [2022-02-20 23:44:01,176 INFO L290 TraceCheckUtils]: 148: Hoare triple {7246#false} assume !(0 == ~b~0.offset); {7246#false} is VALID [2022-02-20 23:44:01,176 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:01,176 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:44:01,177 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864148304] [2022-02-20 23:44:01,177 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864148304] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:44:01,177 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545775773] [2022-02-20 23:44:01,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:01,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:44:01,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:44:01,178 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:01,188 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:01,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:01,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 588 conjuncts, 33 conjunts are in the unsatisfiable core [2022-02-20 23:44:01,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:01,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:44:02,741 INFO L290 TraceCheckUtils]: 0: Hoare triple {7245#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; {7245#true} is VALID [2022-02-20 23:44:02,742 INFO L290 TraceCheckUtils]: 1: Hoare triple {7245#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 := 128;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; {7269#(<= 128 ~n~0)} is VALID [2022-02-20 23:44:02,742 INFO L290 TraceCheckUtils]: 2: Hoare triple {7269#(<= 128 ~n~0)} SUMMARY for call write~int(0, main_#t~post7#1.base, main_#t~post7#1.offset, 4); srcloc: L538 {7269#(<= 128 ~n~0)} is VALID [2022-02-20 23:44:02,743 INFO L290 TraceCheckUtils]: 3: Hoare triple {7269#(<= 128 ~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; {7276#(and (<= |ULTIMATE.start_foo_~i~0#1| 0) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:02,743 INFO L290 TraceCheckUtils]: 4: Hoare triple {7276#(and (<= |ULTIMATE.start_foo_~i~0#1| 0) (<= 128 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {7276#(and (<= |ULTIMATE.start_foo_~i~0#1| 0) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:02,743 INFO L290 TraceCheckUtils]: 5: Hoare triple {7276#(and (<= |ULTIMATE.start_foo_~i~0#1| 0) (<= 128 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7276#(and (<= |ULTIMATE.start_foo_~i~0#1| 0) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:02,744 INFO L290 TraceCheckUtils]: 6: Hoare triple {7276#(and (<= |ULTIMATE.start_foo_~i~0#1| 0) (<= 128 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7286#(and (<= |ULTIMATE.start_foo_~i~0#1| 1) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:02,744 INFO L290 TraceCheckUtils]: 7: Hoare triple {7286#(and (<= |ULTIMATE.start_foo_~i~0#1| 1) (<= 128 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {7286#(and (<= |ULTIMATE.start_foo_~i~0#1| 1) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:02,745 INFO L290 TraceCheckUtils]: 8: Hoare triple {7286#(and (<= |ULTIMATE.start_foo_~i~0#1| 1) (<= 128 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7286#(and (<= |ULTIMATE.start_foo_~i~0#1| 1) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:02,745 INFO L290 TraceCheckUtils]: 9: Hoare triple {7286#(and (<= |ULTIMATE.start_foo_~i~0#1| 1) (<= 128 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7296#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 2))} is VALID [2022-02-20 23:44:02,745 INFO L290 TraceCheckUtils]: 10: Hoare triple {7296#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 2))} assume !!(foo_~i~0#1 < ~n~0); {7296#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 2))} is VALID [2022-02-20 23:44:02,746 INFO L290 TraceCheckUtils]: 11: Hoare triple {7296#(and (<= 128 ~n~0) (<= |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 {7296#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 2))} is VALID [2022-02-20 23:44:02,746 INFO L290 TraceCheckUtils]: 12: Hoare triple {7296#(and (<= 128 ~n~0) (<= |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; {7306#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 3))} is VALID [2022-02-20 23:44:02,746 INFO L290 TraceCheckUtils]: 13: Hoare triple {7306#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 3))} assume !!(foo_~i~0#1 < ~n~0); {7306#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 3))} is VALID [2022-02-20 23:44:02,747 INFO L290 TraceCheckUtils]: 14: Hoare triple {7306#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 3))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7306#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 3))} is VALID [2022-02-20 23:44:02,747 INFO L290 TraceCheckUtils]: 15: Hoare triple {7306#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 3))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7316#(and (<= |ULTIMATE.start_foo_~i~0#1| 4) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:02,748 INFO L290 TraceCheckUtils]: 16: Hoare triple {7316#(and (<= |ULTIMATE.start_foo_~i~0#1| 4) (<= 128 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {7316#(and (<= |ULTIMATE.start_foo_~i~0#1| 4) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:02,748 INFO L290 TraceCheckUtils]: 17: Hoare triple {7316#(and (<= |ULTIMATE.start_foo_~i~0#1| 4) (<= 128 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7316#(and (<= |ULTIMATE.start_foo_~i~0#1| 4) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:02,749 INFO L290 TraceCheckUtils]: 18: Hoare triple {7316#(and (<= |ULTIMATE.start_foo_~i~0#1| 4) (<= 128 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7326#(and (<= |ULTIMATE.start_foo_~i~0#1| 5) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:02,749 INFO L290 TraceCheckUtils]: 19: Hoare triple {7326#(and (<= |ULTIMATE.start_foo_~i~0#1| 5) (<= 128 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {7326#(and (<= |ULTIMATE.start_foo_~i~0#1| 5) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:02,749 INFO L290 TraceCheckUtils]: 20: Hoare triple {7326#(and (<= |ULTIMATE.start_foo_~i~0#1| 5) (<= 128 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7326#(and (<= |ULTIMATE.start_foo_~i~0#1| 5) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:02,750 INFO L290 TraceCheckUtils]: 21: Hoare triple {7326#(and (<= |ULTIMATE.start_foo_~i~0#1| 5) (<= 128 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7336#(and (<= |ULTIMATE.start_foo_~i~0#1| 6) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:02,750 INFO L290 TraceCheckUtils]: 22: Hoare triple {7336#(and (<= |ULTIMATE.start_foo_~i~0#1| 6) (<= 128 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {7336#(and (<= |ULTIMATE.start_foo_~i~0#1| 6) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:02,751 INFO L290 TraceCheckUtils]: 23: Hoare triple {7336#(and (<= |ULTIMATE.start_foo_~i~0#1| 6) (<= 128 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7336#(and (<= |ULTIMATE.start_foo_~i~0#1| 6) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:02,751 INFO L290 TraceCheckUtils]: 24: Hoare triple {7336#(and (<= |ULTIMATE.start_foo_~i~0#1| 6) (<= 128 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7346#(and (<= |ULTIMATE.start_foo_~i~0#1| 7) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:02,751 INFO L290 TraceCheckUtils]: 25: Hoare triple {7346#(and (<= |ULTIMATE.start_foo_~i~0#1| 7) (<= 128 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {7346#(and (<= |ULTIMATE.start_foo_~i~0#1| 7) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:02,752 INFO L290 TraceCheckUtils]: 26: Hoare triple {7346#(and (<= |ULTIMATE.start_foo_~i~0#1| 7) (<= 128 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7346#(and (<= |ULTIMATE.start_foo_~i~0#1| 7) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:02,752 INFO L290 TraceCheckUtils]: 27: Hoare triple {7346#(and (<= |ULTIMATE.start_foo_~i~0#1| 7) (<= 128 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7356#(and (<= |ULTIMATE.start_foo_~i~0#1| 8) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:02,753 INFO L290 TraceCheckUtils]: 28: Hoare triple {7356#(and (<= |ULTIMATE.start_foo_~i~0#1| 8) (<= 128 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {7356#(and (<= |ULTIMATE.start_foo_~i~0#1| 8) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:02,753 INFO L290 TraceCheckUtils]: 29: Hoare triple {7356#(and (<= |ULTIMATE.start_foo_~i~0#1| 8) (<= 128 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7356#(and (<= |ULTIMATE.start_foo_~i~0#1| 8) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:02,754 INFO L290 TraceCheckUtils]: 30: Hoare triple {7356#(and (<= |ULTIMATE.start_foo_~i~0#1| 8) (<= 128 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7366#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 9))} is VALID [2022-02-20 23:44:02,754 INFO L290 TraceCheckUtils]: 31: Hoare triple {7366#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 9))} assume !!(foo_~i~0#1 < ~n~0); {7366#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 9))} is VALID [2022-02-20 23:44:02,754 INFO L290 TraceCheckUtils]: 32: Hoare triple {7366#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 9))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7366#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 9))} is VALID [2022-02-20 23:44:02,757 INFO L290 TraceCheckUtils]: 33: Hoare triple {7366#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 9))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7376#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 10))} is VALID [2022-02-20 23:44:02,757 INFO L290 TraceCheckUtils]: 34: Hoare triple {7376#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 10))} assume !!(foo_~i~0#1 < ~n~0); {7376#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 10))} is VALID [2022-02-20 23:44:02,758 INFO L290 TraceCheckUtils]: 35: Hoare triple {7376#(and (<= 128 ~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 {7376#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 10))} is VALID [2022-02-20 23:44:02,758 INFO L290 TraceCheckUtils]: 36: Hoare triple {7376#(and (<= 128 ~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; {7386#(and (<= |ULTIMATE.start_foo_~i~0#1| 11) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:02,759 INFO L290 TraceCheckUtils]: 37: Hoare triple {7386#(and (<= |ULTIMATE.start_foo_~i~0#1| 11) (<= 128 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {7386#(and (<= |ULTIMATE.start_foo_~i~0#1| 11) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:02,759 INFO L290 TraceCheckUtils]: 38: Hoare triple {7386#(and (<= |ULTIMATE.start_foo_~i~0#1| 11) (<= 128 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7386#(and (<= |ULTIMATE.start_foo_~i~0#1| 11) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:02,760 INFO L290 TraceCheckUtils]: 39: Hoare triple {7386#(and (<= |ULTIMATE.start_foo_~i~0#1| 11) (<= 128 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7396#(and (<= |ULTIMATE.start_foo_~i~0#1| 12) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:02,760 INFO L290 TraceCheckUtils]: 40: Hoare triple {7396#(and (<= |ULTIMATE.start_foo_~i~0#1| 12) (<= 128 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {7396#(and (<= |ULTIMATE.start_foo_~i~0#1| 12) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:02,760 INFO L290 TraceCheckUtils]: 41: Hoare triple {7396#(and (<= |ULTIMATE.start_foo_~i~0#1| 12) (<= 128 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7396#(and (<= |ULTIMATE.start_foo_~i~0#1| 12) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:02,761 INFO L290 TraceCheckUtils]: 42: Hoare triple {7396#(and (<= |ULTIMATE.start_foo_~i~0#1| 12) (<= 128 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7406#(and (<= |ULTIMATE.start_foo_~i~0#1| 13) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:02,761 INFO L290 TraceCheckUtils]: 43: Hoare triple {7406#(and (<= |ULTIMATE.start_foo_~i~0#1| 13) (<= 128 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {7406#(and (<= |ULTIMATE.start_foo_~i~0#1| 13) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:02,762 INFO L290 TraceCheckUtils]: 44: Hoare triple {7406#(and (<= |ULTIMATE.start_foo_~i~0#1| 13) (<= 128 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7406#(and (<= |ULTIMATE.start_foo_~i~0#1| 13) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:02,762 INFO L290 TraceCheckUtils]: 45: Hoare triple {7406#(and (<= |ULTIMATE.start_foo_~i~0#1| 13) (<= 128 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7416#(and (<= |ULTIMATE.start_foo_~i~0#1| 14) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:02,762 INFO L290 TraceCheckUtils]: 46: Hoare triple {7416#(and (<= |ULTIMATE.start_foo_~i~0#1| 14) (<= 128 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {7416#(and (<= |ULTIMATE.start_foo_~i~0#1| 14) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:02,763 INFO L290 TraceCheckUtils]: 47: Hoare triple {7416#(and (<= |ULTIMATE.start_foo_~i~0#1| 14) (<= 128 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7416#(and (<= |ULTIMATE.start_foo_~i~0#1| 14) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:02,763 INFO L290 TraceCheckUtils]: 48: Hoare triple {7416#(and (<= |ULTIMATE.start_foo_~i~0#1| 14) (<= 128 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7426#(and (<= |ULTIMATE.start_foo_~i~0#1| 15) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:02,764 INFO L290 TraceCheckUtils]: 49: Hoare triple {7426#(and (<= |ULTIMATE.start_foo_~i~0#1| 15) (<= 128 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {7426#(and (<= |ULTIMATE.start_foo_~i~0#1| 15) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:02,764 INFO L290 TraceCheckUtils]: 50: Hoare triple {7426#(and (<= |ULTIMATE.start_foo_~i~0#1| 15) (<= 128 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7426#(and (<= |ULTIMATE.start_foo_~i~0#1| 15) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:02,764 INFO L290 TraceCheckUtils]: 51: Hoare triple {7426#(and (<= |ULTIMATE.start_foo_~i~0#1| 15) (<= 128 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7436#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 16))} is VALID [2022-02-20 23:44:02,765 INFO L290 TraceCheckUtils]: 52: Hoare triple {7436#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 16))} assume !!(foo_~i~0#1 < ~n~0); {7436#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 16))} is VALID [2022-02-20 23:44:02,765 INFO L290 TraceCheckUtils]: 53: Hoare triple {7436#(and (<= 128 ~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 {7436#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 16))} is VALID [2022-02-20 23:44:02,765 INFO L290 TraceCheckUtils]: 54: Hoare triple {7436#(and (<= 128 ~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; {7446#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 17))} is VALID [2022-02-20 23:44:02,766 INFO L290 TraceCheckUtils]: 55: Hoare triple {7446#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 17))} assume !!(foo_~i~0#1 < ~n~0); {7446#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 17))} is VALID [2022-02-20 23:44:02,766 INFO L290 TraceCheckUtils]: 56: Hoare triple {7446#(and (<= 128 ~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 {7446#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 17))} is VALID [2022-02-20 23:44:02,767 INFO L290 TraceCheckUtils]: 57: Hoare triple {7446#(and (<= 128 ~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; {7456#(and (<= |ULTIMATE.start_foo_~i~0#1| 18) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:02,767 INFO L290 TraceCheckUtils]: 58: Hoare triple {7456#(and (<= |ULTIMATE.start_foo_~i~0#1| 18) (<= 128 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {7456#(and (<= |ULTIMATE.start_foo_~i~0#1| 18) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:02,767 INFO L290 TraceCheckUtils]: 59: Hoare triple {7456#(and (<= |ULTIMATE.start_foo_~i~0#1| 18) (<= 128 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7456#(and (<= |ULTIMATE.start_foo_~i~0#1| 18) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:02,768 INFO L290 TraceCheckUtils]: 60: Hoare triple {7456#(and (<= |ULTIMATE.start_foo_~i~0#1| 18) (<= 128 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7466#(and (<= |ULTIMATE.start_foo_~i~0#1| 19) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:02,768 INFO L290 TraceCheckUtils]: 61: Hoare triple {7466#(and (<= |ULTIMATE.start_foo_~i~0#1| 19) (<= 128 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {7466#(and (<= |ULTIMATE.start_foo_~i~0#1| 19) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:02,768 INFO L290 TraceCheckUtils]: 62: Hoare triple {7466#(and (<= |ULTIMATE.start_foo_~i~0#1| 19) (<= 128 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7466#(and (<= |ULTIMATE.start_foo_~i~0#1| 19) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:02,769 INFO L290 TraceCheckUtils]: 63: Hoare triple {7466#(and (<= |ULTIMATE.start_foo_~i~0#1| 19) (<= 128 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7476#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 20))} is VALID [2022-02-20 23:44:02,769 INFO L290 TraceCheckUtils]: 64: Hoare triple {7476#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 20))} assume !!(foo_~i~0#1 < ~n~0); {7476#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 20))} is VALID [2022-02-20 23:44:02,770 INFO L290 TraceCheckUtils]: 65: Hoare triple {7476#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 20))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7476#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 20))} is VALID [2022-02-20 23:44:02,770 INFO L290 TraceCheckUtils]: 66: Hoare triple {7476#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 20))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7486#(and (<= |ULTIMATE.start_foo_~i~0#1| 21) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:02,770 INFO L290 TraceCheckUtils]: 67: Hoare triple {7486#(and (<= |ULTIMATE.start_foo_~i~0#1| 21) (<= 128 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {7486#(and (<= |ULTIMATE.start_foo_~i~0#1| 21) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:02,771 INFO L290 TraceCheckUtils]: 68: Hoare triple {7486#(and (<= |ULTIMATE.start_foo_~i~0#1| 21) (<= 128 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7486#(and (<= |ULTIMATE.start_foo_~i~0#1| 21) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:02,771 INFO L290 TraceCheckUtils]: 69: Hoare triple {7486#(and (<= |ULTIMATE.start_foo_~i~0#1| 21) (<= 128 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7496#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 22))} is VALID [2022-02-20 23:44:02,771 INFO L290 TraceCheckUtils]: 70: Hoare triple {7496#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 22))} assume !!(foo_~i~0#1 < ~n~0); {7496#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 22))} is VALID [2022-02-20 23:44:02,772 INFO L290 TraceCheckUtils]: 71: Hoare triple {7496#(and (<= 128 ~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 {7496#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 22))} is VALID [2022-02-20 23:44:02,772 INFO L290 TraceCheckUtils]: 72: Hoare triple {7496#(and (<= 128 ~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; {7506#(and (<= |ULTIMATE.start_foo_~i~0#1| 23) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:02,773 INFO L290 TraceCheckUtils]: 73: Hoare triple {7506#(and (<= |ULTIMATE.start_foo_~i~0#1| 23) (<= 128 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {7506#(and (<= |ULTIMATE.start_foo_~i~0#1| 23) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:02,773 INFO L290 TraceCheckUtils]: 74: Hoare triple {7506#(and (<= |ULTIMATE.start_foo_~i~0#1| 23) (<= 128 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7506#(and (<= |ULTIMATE.start_foo_~i~0#1| 23) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:02,777 INFO L290 TraceCheckUtils]: 75: Hoare triple {7506#(and (<= |ULTIMATE.start_foo_~i~0#1| 23) (<= 128 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7516#(and (<= |ULTIMATE.start_foo_~i~0#1| 24) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:02,777 INFO L290 TraceCheckUtils]: 76: Hoare triple {7516#(and (<= |ULTIMATE.start_foo_~i~0#1| 24) (<= 128 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {7516#(and (<= |ULTIMATE.start_foo_~i~0#1| 24) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:02,777 INFO L290 TraceCheckUtils]: 77: Hoare triple {7516#(and (<= |ULTIMATE.start_foo_~i~0#1| 24) (<= 128 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7516#(and (<= |ULTIMATE.start_foo_~i~0#1| 24) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:02,778 INFO L290 TraceCheckUtils]: 78: Hoare triple {7516#(and (<= |ULTIMATE.start_foo_~i~0#1| 24) (<= 128 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7526#(and (<= |ULTIMATE.start_foo_~i~0#1| 25) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:02,778 INFO L290 TraceCheckUtils]: 79: Hoare triple {7526#(and (<= |ULTIMATE.start_foo_~i~0#1| 25) (<= 128 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {7526#(and (<= |ULTIMATE.start_foo_~i~0#1| 25) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:02,778 INFO L290 TraceCheckUtils]: 80: Hoare triple {7526#(and (<= |ULTIMATE.start_foo_~i~0#1| 25) (<= 128 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7526#(and (<= |ULTIMATE.start_foo_~i~0#1| 25) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:02,779 INFO L290 TraceCheckUtils]: 81: Hoare triple {7526#(and (<= |ULTIMATE.start_foo_~i~0#1| 25) (<= 128 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7536#(and (<= |ULTIMATE.start_foo_~i~0#1| 26) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:02,779 INFO L290 TraceCheckUtils]: 82: Hoare triple {7536#(and (<= |ULTIMATE.start_foo_~i~0#1| 26) (<= 128 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {7536#(and (<= |ULTIMATE.start_foo_~i~0#1| 26) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:02,780 INFO L290 TraceCheckUtils]: 83: Hoare triple {7536#(and (<= |ULTIMATE.start_foo_~i~0#1| 26) (<= 128 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7536#(and (<= |ULTIMATE.start_foo_~i~0#1| 26) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:02,780 INFO L290 TraceCheckUtils]: 84: Hoare triple {7536#(and (<= |ULTIMATE.start_foo_~i~0#1| 26) (<= 128 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7546#(and (<= |ULTIMATE.start_foo_~i~0#1| 27) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:02,780 INFO L290 TraceCheckUtils]: 85: Hoare triple {7546#(and (<= |ULTIMATE.start_foo_~i~0#1| 27) (<= 128 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {7546#(and (<= |ULTIMATE.start_foo_~i~0#1| 27) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:02,781 INFO L290 TraceCheckUtils]: 86: Hoare triple {7546#(and (<= |ULTIMATE.start_foo_~i~0#1| 27) (<= 128 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7546#(and (<= |ULTIMATE.start_foo_~i~0#1| 27) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:02,781 INFO L290 TraceCheckUtils]: 87: Hoare triple {7546#(and (<= |ULTIMATE.start_foo_~i~0#1| 27) (<= 128 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7556#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 28))} is VALID [2022-02-20 23:44:02,781 INFO L290 TraceCheckUtils]: 88: Hoare triple {7556#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 28))} assume !!(foo_~i~0#1 < ~n~0); {7556#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 28))} is VALID [2022-02-20 23:44:02,782 INFO L290 TraceCheckUtils]: 89: Hoare triple {7556#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 28))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7556#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 28))} is VALID [2022-02-20 23:44:02,782 INFO L290 TraceCheckUtils]: 90: Hoare triple {7556#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 28))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7566#(and (<= |ULTIMATE.start_foo_~i~0#1| 29) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:02,783 INFO L290 TraceCheckUtils]: 91: Hoare triple {7566#(and (<= |ULTIMATE.start_foo_~i~0#1| 29) (<= 128 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {7566#(and (<= |ULTIMATE.start_foo_~i~0#1| 29) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:02,783 INFO L290 TraceCheckUtils]: 92: Hoare triple {7566#(and (<= |ULTIMATE.start_foo_~i~0#1| 29) (<= 128 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {7566#(and (<= |ULTIMATE.start_foo_~i~0#1| 29) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:02,783 INFO L290 TraceCheckUtils]: 93: Hoare triple {7566#(and (<= |ULTIMATE.start_foo_~i~0#1| 29) (<= 128 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {7576#(and (<= |ULTIMATE.start_foo_~i~0#1| 30) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:02,784 INFO L290 TraceCheckUtils]: 94: Hoare triple {7576#(and (<= |ULTIMATE.start_foo_~i~0#1| 30) (<= 128 ~n~0))} assume !(foo_~i~0#1 < ~n~0); {7246#false} is VALID [2022-02-20 23:44:02,784 INFO L290 TraceCheckUtils]: 95: Hoare triple {7246#false} foo_~i~0#1 := 0; {7246#false} is VALID [2022-02-20 23:44:02,784 INFO L290 TraceCheckUtils]: 96: Hoare triple {7246#false} assume !!(foo_~i~0#1 < 127); {7246#false} is VALID [2022-02-20 23:44:02,784 INFO L290 TraceCheckUtils]: 97: Hoare triple {7246#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7246#false} is VALID [2022-02-20 23:44:02,784 INFO L290 TraceCheckUtils]: 98: Hoare triple {7246#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7246#false} is VALID [2022-02-20 23:44:02,784 INFO L290 TraceCheckUtils]: 99: Hoare triple {7246#false} assume !!(foo_~i~0#1 < 127); {7246#false} is VALID [2022-02-20 23:44:02,784 INFO L290 TraceCheckUtils]: 100: Hoare triple {7246#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7246#false} is VALID [2022-02-20 23:44:02,784 INFO L290 TraceCheckUtils]: 101: Hoare triple {7246#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7246#false} is VALID [2022-02-20 23:44:02,784 INFO L290 TraceCheckUtils]: 102: Hoare triple {7246#false} assume !!(foo_~i~0#1 < 127); {7246#false} is VALID [2022-02-20 23:44:02,784 INFO L290 TraceCheckUtils]: 103: Hoare triple {7246#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7246#false} is VALID [2022-02-20 23:44:02,784 INFO L290 TraceCheckUtils]: 104: Hoare triple {7246#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7246#false} is VALID [2022-02-20 23:44:02,784 INFO L290 TraceCheckUtils]: 105: Hoare triple {7246#false} assume !!(foo_~i~0#1 < 127); {7246#false} is VALID [2022-02-20 23:44:02,784 INFO L290 TraceCheckUtils]: 106: Hoare triple {7246#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7246#false} is VALID [2022-02-20 23:44:02,784 INFO L290 TraceCheckUtils]: 107: Hoare triple {7246#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7246#false} is VALID [2022-02-20 23:44:02,784 INFO L290 TraceCheckUtils]: 108: Hoare triple {7246#false} assume !!(foo_~i~0#1 < 127); {7246#false} is VALID [2022-02-20 23:44:02,784 INFO L290 TraceCheckUtils]: 109: Hoare triple {7246#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7246#false} is VALID [2022-02-20 23:44:02,785 INFO L290 TraceCheckUtils]: 110: Hoare triple {7246#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7246#false} is VALID [2022-02-20 23:44:02,785 INFO L290 TraceCheckUtils]: 111: Hoare triple {7246#false} assume !!(foo_~i~0#1 < 127); {7246#false} is VALID [2022-02-20 23:44:02,785 INFO L290 TraceCheckUtils]: 112: Hoare triple {7246#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7246#false} is VALID [2022-02-20 23:44:02,785 INFO L290 TraceCheckUtils]: 113: Hoare triple {7246#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7246#false} is VALID [2022-02-20 23:44:02,785 INFO L290 TraceCheckUtils]: 114: Hoare triple {7246#false} assume !!(foo_~i~0#1 < 127); {7246#false} is VALID [2022-02-20 23:44:02,785 INFO L290 TraceCheckUtils]: 115: Hoare triple {7246#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7246#false} is VALID [2022-02-20 23:44:02,785 INFO L290 TraceCheckUtils]: 116: Hoare triple {7246#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7246#false} is VALID [2022-02-20 23:44:02,785 INFO L290 TraceCheckUtils]: 117: Hoare triple {7246#false} assume !!(foo_~i~0#1 < 127); {7246#false} is VALID [2022-02-20 23:44:02,785 INFO L290 TraceCheckUtils]: 118: Hoare triple {7246#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7246#false} is VALID [2022-02-20 23:44:02,785 INFO L290 TraceCheckUtils]: 119: Hoare triple {7246#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7246#false} is VALID [2022-02-20 23:44:02,785 INFO L290 TraceCheckUtils]: 120: Hoare triple {7246#false} assume !!(foo_~i~0#1 < 127); {7246#false} is VALID [2022-02-20 23:44:02,785 INFO L290 TraceCheckUtils]: 121: Hoare triple {7246#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7246#false} is VALID [2022-02-20 23:44:02,785 INFO L290 TraceCheckUtils]: 122: Hoare triple {7246#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7246#false} is VALID [2022-02-20 23:44:02,785 INFO L290 TraceCheckUtils]: 123: Hoare triple {7246#false} assume !!(foo_~i~0#1 < 127); {7246#false} is VALID [2022-02-20 23:44:02,785 INFO L290 TraceCheckUtils]: 124: Hoare triple {7246#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7246#false} is VALID [2022-02-20 23:44:02,785 INFO L290 TraceCheckUtils]: 125: Hoare triple {7246#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7246#false} is VALID [2022-02-20 23:44:02,785 INFO L290 TraceCheckUtils]: 126: Hoare triple {7246#false} assume !!(foo_~i~0#1 < 127); {7246#false} is VALID [2022-02-20 23:44:02,785 INFO L290 TraceCheckUtils]: 127: Hoare triple {7246#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7246#false} is VALID [2022-02-20 23:44:02,785 INFO L290 TraceCheckUtils]: 128: Hoare triple {7246#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7246#false} is VALID [2022-02-20 23:44:02,785 INFO L290 TraceCheckUtils]: 129: Hoare triple {7246#false} assume !!(foo_~i~0#1 < 127); {7246#false} is VALID [2022-02-20 23:44:02,785 INFO L290 TraceCheckUtils]: 130: Hoare triple {7246#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7246#false} is VALID [2022-02-20 23:44:02,785 INFO L290 TraceCheckUtils]: 131: Hoare triple {7246#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7246#false} is VALID [2022-02-20 23:44:02,786 INFO L290 TraceCheckUtils]: 132: Hoare triple {7246#false} assume !!(foo_~i~0#1 < 127); {7246#false} is VALID [2022-02-20 23:44:02,786 INFO L290 TraceCheckUtils]: 133: Hoare triple {7246#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7246#false} is VALID [2022-02-20 23:44:02,786 INFO L290 TraceCheckUtils]: 134: Hoare triple {7246#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7246#false} is VALID [2022-02-20 23:44:02,786 INFO L290 TraceCheckUtils]: 135: Hoare triple {7246#false} assume !!(foo_~i~0#1 < 127); {7246#false} is VALID [2022-02-20 23:44:02,786 INFO L290 TraceCheckUtils]: 136: Hoare triple {7246#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7246#false} is VALID [2022-02-20 23:44:02,786 INFO L290 TraceCheckUtils]: 137: Hoare triple {7246#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7246#false} is VALID [2022-02-20 23:44:02,786 INFO L290 TraceCheckUtils]: 138: Hoare triple {7246#false} assume !!(foo_~i~0#1 < 127); {7246#false} is VALID [2022-02-20 23:44:02,786 INFO L290 TraceCheckUtils]: 139: Hoare triple {7246#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7246#false} is VALID [2022-02-20 23:44:02,786 INFO L290 TraceCheckUtils]: 140: Hoare triple {7246#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7246#false} is VALID [2022-02-20 23:44:02,786 INFO L290 TraceCheckUtils]: 141: Hoare triple {7246#false} assume !(foo_~i~0#1 < 127); {7246#false} is VALID [2022-02-20 23:44:02,786 INFO L290 TraceCheckUtils]: 142: Hoare triple {7246#false} assume { :end_inline_foo } true; {7246#false} is VALID [2022-02-20 23:44:02,786 INFO L290 TraceCheckUtils]: 143: Hoare triple {7246#false} SUMMARY for call main_#t~mem8#1 := read~int(~b~0.base, -4 + ~b~0.offset, 4); srcloc: L540 {7246#false} is VALID [2022-02-20 23:44:02,786 INFO L290 TraceCheckUtils]: 144: Hoare triple {7246#false} assume !(0 != main_#t~mem8#1);havoc main_#t~mem8#1; {7246#false} is VALID [2022-02-20 23:44:02,786 INFO L290 TraceCheckUtils]: 145: Hoare triple {7246#false} assume 0 == ~a~0.offset; {7246#false} is VALID [2022-02-20 23:44:02,786 INFO L290 TraceCheckUtils]: 146: Hoare triple {7246#false} assume ~a~0.base < #StackHeapBarrier; {7246#false} is VALID [2022-02-20 23:44:02,786 INFO L290 TraceCheckUtils]: 147: Hoare triple {7246#false} assume 0 == ~a~0.base || 1 == #valid[~a~0.base];call ULTIMATE.dealloc(~a~0.base, ~a~0.offset); {7246#false} is VALID [2022-02-20 23:44:02,786 INFO L290 TraceCheckUtils]: 148: Hoare triple {7246#false} assume !(0 == ~b~0.offset); {7246#false} is VALID [2022-02-20 23:44:02,787 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:02,787 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:44:04,258 INFO L290 TraceCheckUtils]: 148: Hoare triple {7246#false} assume !(0 == ~b~0.offset); {7246#false} is VALID [2022-02-20 23:44:04,258 INFO L290 TraceCheckUtils]: 147: Hoare triple {7246#false} assume 0 == ~a~0.base || 1 == #valid[~a~0.base];call ULTIMATE.dealloc(~a~0.base, ~a~0.offset); {7246#false} is VALID [2022-02-20 23:44:04,258 INFO L290 TraceCheckUtils]: 146: Hoare triple {7246#false} assume ~a~0.base < #StackHeapBarrier; {7246#false} is VALID [2022-02-20 23:44:04,258 INFO L290 TraceCheckUtils]: 145: Hoare triple {7246#false} assume 0 == ~a~0.offset; {7246#false} is VALID [2022-02-20 23:44:04,258 INFO L290 TraceCheckUtils]: 144: Hoare triple {7246#false} assume !(0 != main_#t~mem8#1);havoc main_#t~mem8#1; {7246#false} is VALID [2022-02-20 23:44:04,258 INFO L290 TraceCheckUtils]: 143: Hoare triple {7246#false} SUMMARY for call main_#t~mem8#1 := read~int(~b~0.base, -4 + ~b~0.offset, 4); srcloc: L540 {7246#false} is VALID [2022-02-20 23:44:04,259 INFO L290 TraceCheckUtils]: 142: Hoare triple {7246#false} assume { :end_inline_foo } true; {7246#false} is VALID [2022-02-20 23:44:04,259 INFO L290 TraceCheckUtils]: 141: Hoare triple {7246#false} assume !(foo_~i~0#1 < 127); {7246#false} is VALID [2022-02-20 23:44:04,259 INFO L290 TraceCheckUtils]: 140: Hoare triple {7246#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7246#false} is VALID [2022-02-20 23:44:04,259 INFO L290 TraceCheckUtils]: 139: Hoare triple {7246#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7246#false} is VALID [2022-02-20 23:44:04,259 INFO L290 TraceCheckUtils]: 138: Hoare triple {7246#false} assume !!(foo_~i~0#1 < 127); {7246#false} is VALID [2022-02-20 23:44:04,259 INFO L290 TraceCheckUtils]: 137: Hoare triple {7246#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7246#false} is VALID [2022-02-20 23:44:04,259 INFO L290 TraceCheckUtils]: 136: Hoare triple {7246#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7246#false} is VALID [2022-02-20 23:44:04,259 INFO L290 TraceCheckUtils]: 135: Hoare triple {7246#false} assume !!(foo_~i~0#1 < 127); {7246#false} is VALID [2022-02-20 23:44:04,259 INFO L290 TraceCheckUtils]: 134: Hoare triple {7246#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7246#false} is VALID [2022-02-20 23:44:04,259 INFO L290 TraceCheckUtils]: 133: Hoare triple {7246#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7246#false} is VALID [2022-02-20 23:44:04,259 INFO L290 TraceCheckUtils]: 132: Hoare triple {7246#false} assume !!(foo_~i~0#1 < 127); {7246#false} is VALID [2022-02-20 23:44:04,259 INFO L290 TraceCheckUtils]: 131: Hoare triple {7246#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7246#false} is VALID [2022-02-20 23:44:04,259 INFO L290 TraceCheckUtils]: 130: Hoare triple {7246#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7246#false} is VALID [2022-02-20 23:44:04,259 INFO L290 TraceCheckUtils]: 129: Hoare triple {7246#false} assume !!(foo_~i~0#1 < 127); {7246#false} is VALID [2022-02-20 23:44:04,259 INFO L290 TraceCheckUtils]: 128: Hoare triple {7246#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7246#false} is VALID [2022-02-20 23:44:04,259 INFO L290 TraceCheckUtils]: 127: Hoare triple {7246#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7246#false} is VALID [2022-02-20 23:44:04,259 INFO L290 TraceCheckUtils]: 126: Hoare triple {7246#false} assume !!(foo_~i~0#1 < 127); {7246#false} is VALID [2022-02-20 23:44:04,259 INFO L290 TraceCheckUtils]: 125: Hoare triple {7246#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7246#false} is VALID [2022-02-20 23:44:04,259 INFO L290 TraceCheckUtils]: 124: Hoare triple {7246#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7246#false} is VALID [2022-02-20 23:44:04,259 INFO L290 TraceCheckUtils]: 123: Hoare triple {7246#false} assume !!(foo_~i~0#1 < 127); {7246#false} is VALID [2022-02-20 23:44:04,259 INFO L290 TraceCheckUtils]: 122: Hoare triple {7246#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7246#false} is VALID [2022-02-20 23:44:04,263 INFO L290 TraceCheckUtils]: 121: Hoare triple {7246#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7246#false} is VALID [2022-02-20 23:44:04,263 INFO L290 TraceCheckUtils]: 120: Hoare triple {7246#false} assume !!(foo_~i~0#1 < 127); {7246#false} is VALID [2022-02-20 23:44:04,263 INFO L290 TraceCheckUtils]: 119: Hoare triple {7246#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7246#false} is VALID [2022-02-20 23:44:04,264 INFO L290 TraceCheckUtils]: 118: Hoare triple {7246#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7246#false} is VALID [2022-02-20 23:44:04,264 INFO L290 TraceCheckUtils]: 117: Hoare triple {7246#false} assume !!(foo_~i~0#1 < 127); {7246#false} is VALID [2022-02-20 23:44:04,264 INFO L290 TraceCheckUtils]: 116: Hoare triple {7246#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7246#false} is VALID [2022-02-20 23:44:04,264 INFO L290 TraceCheckUtils]: 115: Hoare triple {7246#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7246#false} is VALID [2022-02-20 23:44:04,264 INFO L290 TraceCheckUtils]: 114: Hoare triple {7246#false} assume !!(foo_~i~0#1 < 127); {7246#false} is VALID [2022-02-20 23:44:04,264 INFO L290 TraceCheckUtils]: 113: Hoare triple {7246#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7246#false} is VALID [2022-02-20 23:44:04,264 INFO L290 TraceCheckUtils]: 112: Hoare triple {7246#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7246#false} is VALID [2022-02-20 23:44:04,264 INFO L290 TraceCheckUtils]: 111: Hoare triple {7246#false} assume !!(foo_~i~0#1 < 127); {7246#false} is VALID [2022-02-20 23:44:04,264 INFO L290 TraceCheckUtils]: 110: Hoare triple {7246#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7246#false} is VALID [2022-02-20 23:44:04,264 INFO L290 TraceCheckUtils]: 109: Hoare triple {7246#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7246#false} is VALID [2022-02-20 23:44:04,265 INFO L290 TraceCheckUtils]: 108: Hoare triple {7246#false} assume !!(foo_~i~0#1 < 127); {7246#false} is VALID [2022-02-20 23:44:04,265 INFO L290 TraceCheckUtils]: 107: Hoare triple {7246#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7246#false} is VALID [2022-02-20 23:44:04,265 INFO L290 TraceCheckUtils]: 106: Hoare triple {7246#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7246#false} is VALID [2022-02-20 23:44:04,265 INFO L290 TraceCheckUtils]: 105: Hoare triple {7246#false} assume !!(foo_~i~0#1 < 127); {7246#false} is VALID [2022-02-20 23:44:04,265 INFO L290 TraceCheckUtils]: 104: Hoare triple {7246#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7246#false} is VALID [2022-02-20 23:44:04,265 INFO L290 TraceCheckUtils]: 103: Hoare triple {7246#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7246#false} is VALID [2022-02-20 23:44:04,265 INFO L290 TraceCheckUtils]: 102: Hoare triple {7246#false} assume !!(foo_~i~0#1 < 127); {7246#false} is VALID [2022-02-20 23:44:04,265 INFO L290 TraceCheckUtils]: 101: Hoare triple {7246#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7246#false} is VALID [2022-02-20 23:44:04,265 INFO L290 TraceCheckUtils]: 100: Hoare triple {7246#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7246#false} is VALID [2022-02-20 23:44:04,266 INFO L290 TraceCheckUtils]: 99: Hoare triple {7246#false} assume !!(foo_~i~0#1 < 127); {7246#false} is VALID [2022-02-20 23:44:04,266 INFO L290 TraceCheckUtils]: 98: Hoare triple {7246#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {7246#false} is VALID [2022-02-20 23:44:04,266 INFO L290 TraceCheckUtils]: 97: Hoare triple {7246#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {7246#false} is VALID [2022-02-20 23:44:04,266 INFO L290 TraceCheckUtils]: 96: Hoare triple {7246#false} assume !!(foo_~i~0#1 < 127); {7246#false} is VALID [2022-02-20 23:44:04,266 INFO L290 TraceCheckUtils]: 95: Hoare triple {7246#false} foo_~i~0#1 := 0; {7246#false} is VALID [2022-02-20 23:44:04,266 INFO L290 TraceCheckUtils]: 94: Hoare triple {7904#(< |ULTIMATE.start_foo_~i~0#1| ~n~0)} assume !(foo_~i~0#1 < ~n~0); {7246#false} is VALID [2022-02-20 23:44:04,267 INFO L290 TraceCheckUtils]: 93: Hoare triple {7908#(< (+ |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; {7904#(< |ULTIMATE.start_foo_~i~0#1| ~n~0)} is VALID [2022-02-20 23:44:04,267 INFO L290 TraceCheckUtils]: 92: Hoare triple {7908#(< (+ |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 {7908#(< (+ |ULTIMATE.start_foo_~i~0#1| 1) ~n~0)} is VALID [2022-02-20 23:44:04,267 INFO L290 TraceCheckUtils]: 91: Hoare triple {7908#(< (+ |ULTIMATE.start_foo_~i~0#1| 1) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {7908#(< (+ |ULTIMATE.start_foo_~i~0#1| 1) ~n~0)} is VALID [2022-02-20 23:44:04,268 INFO L290 TraceCheckUtils]: 90: Hoare triple {7918#(< (+ |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; {7908#(< (+ |ULTIMATE.start_foo_~i~0#1| 1) ~n~0)} is VALID [2022-02-20 23:44:04,268 INFO L290 TraceCheckUtils]: 89: Hoare triple {7918#(< (+ |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 {7918#(< (+ |ULTIMATE.start_foo_~i~0#1| 2) ~n~0)} is VALID [2022-02-20 23:44:04,269 INFO L290 TraceCheckUtils]: 88: Hoare triple {7918#(< (+ |ULTIMATE.start_foo_~i~0#1| 2) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {7918#(< (+ |ULTIMATE.start_foo_~i~0#1| 2) ~n~0)} is VALID [2022-02-20 23:44:04,269 INFO L290 TraceCheckUtils]: 87: Hoare triple {7928#(< (+ |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; {7918#(< (+ |ULTIMATE.start_foo_~i~0#1| 2) ~n~0)} is VALID [2022-02-20 23:44:04,269 INFO L290 TraceCheckUtils]: 86: Hoare triple {7928#(< (+ |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 {7928#(< (+ |ULTIMATE.start_foo_~i~0#1| 3) ~n~0)} is VALID [2022-02-20 23:44:04,270 INFO L290 TraceCheckUtils]: 85: Hoare triple {7928#(< (+ |ULTIMATE.start_foo_~i~0#1| 3) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {7928#(< (+ |ULTIMATE.start_foo_~i~0#1| 3) ~n~0)} is VALID [2022-02-20 23:44:04,270 INFO L290 TraceCheckUtils]: 84: Hoare triple {7938#(< (+ |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; {7928#(< (+ |ULTIMATE.start_foo_~i~0#1| 3) ~n~0)} is VALID [2022-02-20 23:44:04,270 INFO L290 TraceCheckUtils]: 83: Hoare triple {7938#(< (+ |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 {7938#(< (+ |ULTIMATE.start_foo_~i~0#1| 4) ~n~0)} is VALID [2022-02-20 23:44:04,271 INFO L290 TraceCheckUtils]: 82: Hoare triple {7938#(< (+ |ULTIMATE.start_foo_~i~0#1| 4) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {7938#(< (+ |ULTIMATE.start_foo_~i~0#1| 4) ~n~0)} is VALID [2022-02-20 23:44:04,271 INFO L290 TraceCheckUtils]: 81: Hoare triple {7948#(< (+ |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; {7938#(< (+ |ULTIMATE.start_foo_~i~0#1| 4) ~n~0)} is VALID [2022-02-20 23:44:04,272 INFO L290 TraceCheckUtils]: 80: Hoare triple {7948#(< (+ |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 {7948#(< (+ |ULTIMATE.start_foo_~i~0#1| 5) ~n~0)} is VALID [2022-02-20 23:44:04,272 INFO L290 TraceCheckUtils]: 79: Hoare triple {7948#(< (+ |ULTIMATE.start_foo_~i~0#1| 5) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {7948#(< (+ |ULTIMATE.start_foo_~i~0#1| 5) ~n~0)} is VALID [2022-02-20 23:44:04,272 INFO L290 TraceCheckUtils]: 78: Hoare triple {7958#(< (+ |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; {7948#(< (+ |ULTIMATE.start_foo_~i~0#1| 5) ~n~0)} is VALID [2022-02-20 23:44:04,273 INFO L290 TraceCheckUtils]: 77: Hoare triple {7958#(< (+ |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 {7958#(< (+ |ULTIMATE.start_foo_~i~0#1| 6) ~n~0)} is VALID [2022-02-20 23:44:04,273 INFO L290 TraceCheckUtils]: 76: Hoare triple {7958#(< (+ |ULTIMATE.start_foo_~i~0#1| 6) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {7958#(< (+ |ULTIMATE.start_foo_~i~0#1| 6) ~n~0)} is VALID [2022-02-20 23:44:04,273 INFO L290 TraceCheckUtils]: 75: Hoare triple {7968#(< (+ 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; {7958#(< (+ |ULTIMATE.start_foo_~i~0#1| 6) ~n~0)} is VALID [2022-02-20 23:44:04,274 INFO L290 TraceCheckUtils]: 74: Hoare triple {7968#(< (+ 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 {7968#(< (+ 7 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:04,274 INFO L290 TraceCheckUtils]: 73: Hoare triple {7968#(< (+ 7 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {7968#(< (+ 7 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:04,274 INFO L290 TraceCheckUtils]: 72: Hoare triple {7978#(< (+ |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; {7968#(< (+ 7 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:04,274 INFO L290 TraceCheckUtils]: 71: Hoare triple {7978#(< (+ |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 {7978#(< (+ |ULTIMATE.start_foo_~i~0#1| 8) ~n~0)} is VALID [2022-02-20 23:44:04,275 INFO L290 TraceCheckUtils]: 70: Hoare triple {7978#(< (+ |ULTIMATE.start_foo_~i~0#1| 8) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {7978#(< (+ |ULTIMATE.start_foo_~i~0#1| 8) ~n~0)} is VALID [2022-02-20 23:44:04,275 INFO L290 TraceCheckUtils]: 69: Hoare triple {7988#(< (+ |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; {7978#(< (+ |ULTIMATE.start_foo_~i~0#1| 8) ~n~0)} is VALID [2022-02-20 23:44:04,276 INFO L290 TraceCheckUtils]: 68: Hoare triple {7988#(< (+ |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 {7988#(< (+ |ULTIMATE.start_foo_~i~0#1| 9) ~n~0)} is VALID [2022-02-20 23:44:04,276 INFO L290 TraceCheckUtils]: 67: Hoare triple {7988#(< (+ |ULTIMATE.start_foo_~i~0#1| 9) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {7988#(< (+ |ULTIMATE.start_foo_~i~0#1| 9) ~n~0)} is VALID [2022-02-20 23:44:04,276 INFO L290 TraceCheckUtils]: 66: Hoare triple {7998#(< (+ |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; {7988#(< (+ |ULTIMATE.start_foo_~i~0#1| 9) ~n~0)} is VALID [2022-02-20 23:44:04,277 INFO L290 TraceCheckUtils]: 65: Hoare triple {7998#(< (+ |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 {7998#(< (+ |ULTIMATE.start_foo_~i~0#1| 10) ~n~0)} is VALID [2022-02-20 23:44:04,277 INFO L290 TraceCheckUtils]: 64: Hoare triple {7998#(< (+ |ULTIMATE.start_foo_~i~0#1| 10) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {7998#(< (+ |ULTIMATE.start_foo_~i~0#1| 10) ~n~0)} is VALID [2022-02-20 23:44:04,277 INFO L290 TraceCheckUtils]: 63: Hoare triple {8008#(< (+ |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; {7998#(< (+ |ULTIMATE.start_foo_~i~0#1| 10) ~n~0)} is VALID [2022-02-20 23:44:04,277 INFO L290 TraceCheckUtils]: 62: Hoare triple {8008#(< (+ |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 {8008#(< (+ |ULTIMATE.start_foo_~i~0#1| 11) ~n~0)} is VALID [2022-02-20 23:44:04,278 INFO L290 TraceCheckUtils]: 61: Hoare triple {8008#(< (+ |ULTIMATE.start_foo_~i~0#1| 11) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {8008#(< (+ |ULTIMATE.start_foo_~i~0#1| 11) ~n~0)} is VALID [2022-02-20 23:44:04,278 INFO L290 TraceCheckUtils]: 60: Hoare triple {8018#(< (+ |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; {8008#(< (+ |ULTIMATE.start_foo_~i~0#1| 11) ~n~0)} is VALID [2022-02-20 23:44:04,278 INFO L290 TraceCheckUtils]: 59: Hoare triple {8018#(< (+ |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 {8018#(< (+ |ULTIMATE.start_foo_~i~0#1| 12) ~n~0)} is VALID [2022-02-20 23:44:04,279 INFO L290 TraceCheckUtils]: 58: Hoare triple {8018#(< (+ |ULTIMATE.start_foo_~i~0#1| 12) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {8018#(< (+ |ULTIMATE.start_foo_~i~0#1| 12) ~n~0)} is VALID [2022-02-20 23:44:04,279 INFO L290 TraceCheckUtils]: 57: Hoare triple {8028#(< (+ |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; {8018#(< (+ |ULTIMATE.start_foo_~i~0#1| 12) ~n~0)} is VALID [2022-02-20 23:44:04,279 INFO L290 TraceCheckUtils]: 56: Hoare triple {8028#(< (+ |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 {8028#(< (+ |ULTIMATE.start_foo_~i~0#1| 13) ~n~0)} is VALID [2022-02-20 23:44:04,280 INFO L290 TraceCheckUtils]: 55: Hoare triple {8028#(< (+ |ULTIMATE.start_foo_~i~0#1| 13) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {8028#(< (+ |ULTIMATE.start_foo_~i~0#1| 13) ~n~0)} is VALID [2022-02-20 23:44:04,280 INFO L290 TraceCheckUtils]: 54: Hoare triple {8038#(< (+ |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; {8028#(< (+ |ULTIMATE.start_foo_~i~0#1| 13) ~n~0)} is VALID [2022-02-20 23:44:04,280 INFO L290 TraceCheckUtils]: 53: Hoare triple {8038#(< (+ |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 {8038#(< (+ |ULTIMATE.start_foo_~i~0#1| 14) ~n~0)} is VALID [2022-02-20 23:44:04,281 INFO L290 TraceCheckUtils]: 52: Hoare triple {8038#(< (+ |ULTIMATE.start_foo_~i~0#1| 14) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {8038#(< (+ |ULTIMATE.start_foo_~i~0#1| 14) ~n~0)} is VALID [2022-02-20 23:44:04,281 INFO L290 TraceCheckUtils]: 51: Hoare triple {8048#(< (+ |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; {8038#(< (+ |ULTIMATE.start_foo_~i~0#1| 14) ~n~0)} is VALID [2022-02-20 23:44:04,281 INFO L290 TraceCheckUtils]: 50: Hoare triple {8048#(< (+ |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 {8048#(< (+ |ULTIMATE.start_foo_~i~0#1| 15) ~n~0)} is VALID [2022-02-20 23:44:04,282 INFO L290 TraceCheckUtils]: 49: Hoare triple {8048#(< (+ |ULTIMATE.start_foo_~i~0#1| 15) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {8048#(< (+ |ULTIMATE.start_foo_~i~0#1| 15) ~n~0)} is VALID [2022-02-20 23:44:04,282 INFO L290 TraceCheckUtils]: 48: Hoare triple {8058#(< (+ |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; {8048#(< (+ |ULTIMATE.start_foo_~i~0#1| 15) ~n~0)} is VALID [2022-02-20 23:44:04,282 INFO L290 TraceCheckUtils]: 47: Hoare triple {8058#(< (+ |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 {8058#(< (+ |ULTIMATE.start_foo_~i~0#1| 16) ~n~0)} is VALID [2022-02-20 23:44:04,283 INFO L290 TraceCheckUtils]: 46: Hoare triple {8058#(< (+ |ULTIMATE.start_foo_~i~0#1| 16) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {8058#(< (+ |ULTIMATE.start_foo_~i~0#1| 16) ~n~0)} is VALID [2022-02-20 23:44:04,283 INFO L290 TraceCheckUtils]: 45: Hoare triple {8068#(< (+ |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; {8058#(< (+ |ULTIMATE.start_foo_~i~0#1| 16) ~n~0)} is VALID [2022-02-20 23:44:04,283 INFO L290 TraceCheckUtils]: 44: Hoare triple {8068#(< (+ |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 {8068#(< (+ |ULTIMATE.start_foo_~i~0#1| 17) ~n~0)} is VALID [2022-02-20 23:44:04,284 INFO L290 TraceCheckUtils]: 43: Hoare triple {8068#(< (+ |ULTIMATE.start_foo_~i~0#1| 17) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {8068#(< (+ |ULTIMATE.start_foo_~i~0#1| 17) ~n~0)} is VALID [2022-02-20 23:44:04,284 INFO L290 TraceCheckUtils]: 42: Hoare triple {8078#(< (+ |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; {8068#(< (+ |ULTIMATE.start_foo_~i~0#1| 17) ~n~0)} is VALID [2022-02-20 23:44:04,284 INFO L290 TraceCheckUtils]: 41: Hoare triple {8078#(< (+ |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 {8078#(< (+ |ULTIMATE.start_foo_~i~0#1| 18) ~n~0)} is VALID [2022-02-20 23:44:04,284 INFO L290 TraceCheckUtils]: 40: Hoare triple {8078#(< (+ |ULTIMATE.start_foo_~i~0#1| 18) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {8078#(< (+ |ULTIMATE.start_foo_~i~0#1| 18) ~n~0)} is VALID [2022-02-20 23:44:04,285 INFO L290 TraceCheckUtils]: 39: Hoare triple {8088#(< (+ 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; {8078#(< (+ |ULTIMATE.start_foo_~i~0#1| 18) ~n~0)} is VALID [2022-02-20 23:44:04,285 INFO L290 TraceCheckUtils]: 38: Hoare triple {8088#(< (+ 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 {8088#(< (+ 19 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:04,285 INFO L290 TraceCheckUtils]: 37: Hoare triple {8088#(< (+ 19 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {8088#(< (+ 19 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:04,286 INFO L290 TraceCheckUtils]: 36: Hoare triple {8098#(< (+ |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; {8088#(< (+ 19 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:04,286 INFO L290 TraceCheckUtils]: 35: Hoare triple {8098#(< (+ |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 {8098#(< (+ |ULTIMATE.start_foo_~i~0#1| 20) ~n~0)} is VALID [2022-02-20 23:44:04,286 INFO L290 TraceCheckUtils]: 34: Hoare triple {8098#(< (+ |ULTIMATE.start_foo_~i~0#1| 20) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {8098#(< (+ |ULTIMATE.start_foo_~i~0#1| 20) ~n~0)} is VALID [2022-02-20 23:44:04,287 INFO L290 TraceCheckUtils]: 33: Hoare triple {8108#(< (+ |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; {8098#(< (+ |ULTIMATE.start_foo_~i~0#1| 20) ~n~0)} is VALID [2022-02-20 23:44:04,287 INFO L290 TraceCheckUtils]: 32: Hoare triple {8108#(< (+ |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 {8108#(< (+ |ULTIMATE.start_foo_~i~0#1| 21) ~n~0)} is VALID [2022-02-20 23:44:04,287 INFO L290 TraceCheckUtils]: 31: Hoare triple {8108#(< (+ |ULTIMATE.start_foo_~i~0#1| 21) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {8108#(< (+ |ULTIMATE.start_foo_~i~0#1| 21) ~n~0)} is VALID [2022-02-20 23:44:04,288 INFO L290 TraceCheckUtils]: 30: Hoare triple {8118#(< (+ |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; {8108#(< (+ |ULTIMATE.start_foo_~i~0#1| 21) ~n~0)} is VALID [2022-02-20 23:44:04,288 INFO L290 TraceCheckUtils]: 29: Hoare triple {8118#(< (+ |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 {8118#(< (+ |ULTIMATE.start_foo_~i~0#1| 22) ~n~0)} is VALID [2022-02-20 23:44:04,288 INFO L290 TraceCheckUtils]: 28: Hoare triple {8118#(< (+ |ULTIMATE.start_foo_~i~0#1| 22) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {8118#(< (+ |ULTIMATE.start_foo_~i~0#1| 22) ~n~0)} is VALID [2022-02-20 23:44:04,289 INFO L290 TraceCheckUtils]: 27: Hoare triple {8128#(< (+ 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; {8118#(< (+ |ULTIMATE.start_foo_~i~0#1| 22) ~n~0)} is VALID [2022-02-20 23:44:04,289 INFO L290 TraceCheckUtils]: 26: Hoare triple {8128#(< (+ 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 {8128#(< (+ 23 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:04,289 INFO L290 TraceCheckUtils]: 25: Hoare triple {8128#(< (+ 23 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {8128#(< (+ 23 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:04,290 INFO L290 TraceCheckUtils]: 24: Hoare triple {8138#(< (+ |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; {8128#(< (+ 23 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:04,290 INFO L290 TraceCheckUtils]: 23: Hoare triple {8138#(< (+ |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 {8138#(< (+ |ULTIMATE.start_foo_~i~0#1| 24) ~n~0)} is VALID [2022-02-20 23:44:04,290 INFO L290 TraceCheckUtils]: 22: Hoare triple {8138#(< (+ |ULTIMATE.start_foo_~i~0#1| 24) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {8138#(< (+ |ULTIMATE.start_foo_~i~0#1| 24) ~n~0)} is VALID [2022-02-20 23:44:04,291 INFO L290 TraceCheckUtils]: 21: Hoare triple {8148#(< (+ |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; {8138#(< (+ |ULTIMATE.start_foo_~i~0#1| 24) ~n~0)} is VALID [2022-02-20 23:44:04,291 INFO L290 TraceCheckUtils]: 20: Hoare triple {8148#(< (+ |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 {8148#(< (+ |ULTIMATE.start_foo_~i~0#1| 25) ~n~0)} is VALID [2022-02-20 23:44:04,291 INFO L290 TraceCheckUtils]: 19: Hoare triple {8148#(< (+ |ULTIMATE.start_foo_~i~0#1| 25) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {8148#(< (+ |ULTIMATE.start_foo_~i~0#1| 25) ~n~0)} is VALID [2022-02-20 23:44:04,292 INFO L290 TraceCheckUtils]: 18: Hoare triple {8158#(< (+ |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; {8148#(< (+ |ULTIMATE.start_foo_~i~0#1| 25) ~n~0)} is VALID [2022-02-20 23:44:04,292 INFO L290 TraceCheckUtils]: 17: Hoare triple {8158#(< (+ |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 {8158#(< (+ |ULTIMATE.start_foo_~i~0#1| 26) ~n~0)} is VALID [2022-02-20 23:44:04,292 INFO L290 TraceCheckUtils]: 16: Hoare triple {8158#(< (+ |ULTIMATE.start_foo_~i~0#1| 26) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {8158#(< (+ |ULTIMATE.start_foo_~i~0#1| 26) ~n~0)} is VALID [2022-02-20 23:44:04,292 INFO L290 TraceCheckUtils]: 15: Hoare triple {8168#(< (+ |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; {8158#(< (+ |ULTIMATE.start_foo_~i~0#1| 26) ~n~0)} is VALID [2022-02-20 23:44:04,293 INFO L290 TraceCheckUtils]: 14: Hoare triple {8168#(< (+ |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 {8168#(< (+ |ULTIMATE.start_foo_~i~0#1| 27) ~n~0)} is VALID [2022-02-20 23:44:04,293 INFO L290 TraceCheckUtils]: 13: Hoare triple {8168#(< (+ |ULTIMATE.start_foo_~i~0#1| 27) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {8168#(< (+ |ULTIMATE.start_foo_~i~0#1| 27) ~n~0)} is VALID [2022-02-20 23:44:04,293 INFO L290 TraceCheckUtils]: 12: Hoare triple {8178#(< (+ |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; {8168#(< (+ |ULTIMATE.start_foo_~i~0#1| 27) ~n~0)} is VALID [2022-02-20 23:44:04,294 INFO L290 TraceCheckUtils]: 11: Hoare triple {8178#(< (+ |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 {8178#(< (+ |ULTIMATE.start_foo_~i~0#1| 28) ~n~0)} is VALID [2022-02-20 23:44:04,294 INFO L290 TraceCheckUtils]: 10: Hoare triple {8178#(< (+ |ULTIMATE.start_foo_~i~0#1| 28) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {8178#(< (+ |ULTIMATE.start_foo_~i~0#1| 28) ~n~0)} is VALID [2022-02-20 23:44:04,294 INFO L290 TraceCheckUtils]: 9: Hoare triple {8188#(< (+ |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; {8178#(< (+ |ULTIMATE.start_foo_~i~0#1| 28) ~n~0)} is VALID [2022-02-20 23:44:04,295 INFO L290 TraceCheckUtils]: 8: Hoare triple {8188#(< (+ |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 {8188#(< (+ |ULTIMATE.start_foo_~i~0#1| 29) ~n~0)} is VALID [2022-02-20 23:44:04,295 INFO L290 TraceCheckUtils]: 7: Hoare triple {8188#(< (+ |ULTIMATE.start_foo_~i~0#1| 29) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {8188#(< (+ |ULTIMATE.start_foo_~i~0#1| 29) ~n~0)} is VALID [2022-02-20 23:44:04,295 INFO L290 TraceCheckUtils]: 6: Hoare triple {8198#(< (+ |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; {8188#(< (+ |ULTIMATE.start_foo_~i~0#1| 29) ~n~0)} is VALID [2022-02-20 23:44:04,296 INFO L290 TraceCheckUtils]: 5: Hoare triple {8198#(< (+ |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 {8198#(< (+ |ULTIMATE.start_foo_~i~0#1| 30) ~n~0)} is VALID [2022-02-20 23:44:04,296 INFO L290 TraceCheckUtils]: 4: Hoare triple {8198#(< (+ |ULTIMATE.start_foo_~i~0#1| 30) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {8198#(< (+ |ULTIMATE.start_foo_~i~0#1| 30) ~n~0)} is VALID [2022-02-20 23:44:04,296 INFO L290 TraceCheckUtils]: 3: Hoare triple {8208#(< 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; {8198#(< (+ |ULTIMATE.start_foo_~i~0#1| 30) ~n~0)} is VALID [2022-02-20 23:44:04,297 INFO L290 TraceCheckUtils]: 2: Hoare triple {8208#(< 30 ~n~0)} SUMMARY for call write~int(0, main_#t~post7#1.base, main_#t~post7#1.offset, 4); srcloc: L538 {8208#(< 30 ~n~0)} is VALID [2022-02-20 23:44:04,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {7245#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 := 128;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; {8208#(< 30 ~n~0)} is VALID [2022-02-20 23:44:04,297 INFO L290 TraceCheckUtils]: 0: Hoare triple {7245#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; {7245#true} is VALID [2022-02-20 23:44:04,298 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:04,298 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1545775773] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:44:04,298 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:44:04,299 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 34, 34] total 82 [2022-02-20 23:44:04,299 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305709888] [2022-02-20 23:44:04,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:44:04,300 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:04,300 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:04,300 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:04,471 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:04,472 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2022-02-20 23:44:04,472 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:44:04,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2022-02-20 23:44:04,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2370, Invalid=4272, Unknown=0, NotChecked=0, Total=6642 [2022-02-20 23:44:04,474 INFO L87 Difference]: Start difference. First operand 155 states and 156 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:07,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:07,657 INFO L93 Difference]: Finished difference Result 779 states and 780 transitions. [2022-02-20 23:44:07,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-02-20 23:44:07,657 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:07,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:07,657 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:07,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 828 transitions. [2022-02-20 23:44:07,662 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:07,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 828 transitions. [2022-02-20 23:44:07,668 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 65 states and 828 transitions. [2022-02-20 23:44:08,211 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 828 edges. 828 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:08,231 INFO L225 Difference]: With dead ends: 779 [2022-02-20 23:44:08,231 INFO L226 Difference]: Without dead ends: 779 [2022-02-20 23:44:08,233 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:08,234 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 2872 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 500 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2872 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 500 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:08,234 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2872 Valid, 466 Invalid, 965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [500 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 23:44:08,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2022-02-20 23:44:08,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 299. [2022-02-20 23:44:08,237 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:08,238 INFO L82 GeneralOperation]: Start isEquivalent. First operand 779 states. Second operand has 299 states, 297 states have (on average 1.0101010101010102) internal successors, (300), 298 states have internal predecessors, (300), 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:08,238 INFO L74 IsIncluded]: Start isIncluded. First operand 779 states. Second operand has 299 states, 297 states have (on average 1.0101010101010102) internal successors, (300), 298 states have internal predecessors, (300), 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:08,238 INFO L87 Difference]: Start difference. First operand 779 states. Second operand has 299 states, 297 states have (on average 1.0101010101010102) internal successors, (300), 298 states have internal predecessors, (300), 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:08,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:08,257 INFO L93 Difference]: Finished difference Result 779 states and 780 transitions. [2022-02-20 23:44:08,257 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 780 transitions. [2022-02-20 23:44:08,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:08,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:08,258 INFO L74 IsIncluded]: Start isIncluded. First operand has 299 states, 297 states have (on average 1.0101010101010102) internal successors, (300), 298 states have internal predecessors, (300), 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 779 states. [2022-02-20 23:44:08,258 INFO L87 Difference]: Start difference. First operand has 299 states, 297 states have (on average 1.0101010101010102) internal successors, (300), 298 states have internal predecessors, (300), 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 779 states. [2022-02-20 23:44:08,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:08,278 INFO L93 Difference]: Finished difference Result 779 states and 780 transitions. [2022-02-20 23:44:08,278 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 780 transitions. [2022-02-20 23:44:08,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:08,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:08,279 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:08,279 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:08,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 297 states have (on average 1.0101010101010102) internal successors, (300), 298 states have internal predecessors, (300), 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:08,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 300 transitions. [2022-02-20 23:44:08,282 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 300 transitions. Word has length 149 [2022-02-20 23:44:08,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:08,283 INFO L470 AbstractCegarLoop]: Abstraction has 299 states and 300 transitions. [2022-02-20 23:44:08,283 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:08,283 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 300 transitions. [2022-02-20 23:44:08,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2022-02-20 23:44:08,284 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:08,285 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:08,304 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:08,499 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:08,499 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2022-02-20 23:44:08,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:08,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1743233901, now seen corresponding path program 2 times [2022-02-20 23:44:08,500 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:44:08,500 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395850883] [2022-02-20 23:44:08,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:08,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:44:08,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:09,079 INFO L290 TraceCheckUtils]: 0: Hoare triple {10949#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; {10949#true} is VALID [2022-02-20 23:44:09,079 INFO L290 TraceCheckUtils]: 1: Hoare triple {10949#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 := 128;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; {10949#true} is VALID [2022-02-20 23:44:09,079 INFO L290 TraceCheckUtils]: 2: Hoare triple {10949#true} SUMMARY for call write~int(0, main_#t~post7#1.base, main_#t~post7#1.offset, 4); srcloc: L538 {10949#true} is VALID [2022-02-20 23:44:09,079 INFO L290 TraceCheckUtils]: 3: Hoare triple {10949#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; {10949#true} is VALID [2022-02-20 23:44:09,079 INFO L290 TraceCheckUtils]: 4: Hoare triple {10949#true} assume !!(foo_~i~0#1 < ~n~0); {10949#true} is VALID [2022-02-20 23:44:09,079 INFO L290 TraceCheckUtils]: 5: Hoare triple {10949#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {10949#true} is VALID [2022-02-20 23:44:09,079 INFO L290 TraceCheckUtils]: 6: Hoare triple {10949#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {10949#true} is VALID [2022-02-20 23:44:09,079 INFO L290 TraceCheckUtils]: 7: Hoare triple {10949#true} assume !!(foo_~i~0#1 < ~n~0); {10949#true} is VALID [2022-02-20 23:44:09,079 INFO L290 TraceCheckUtils]: 8: Hoare triple {10949#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {10949#true} is VALID [2022-02-20 23:44:09,079 INFO L290 TraceCheckUtils]: 9: Hoare triple {10949#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {10949#true} is VALID [2022-02-20 23:44:09,079 INFO L290 TraceCheckUtils]: 10: Hoare triple {10949#true} assume !!(foo_~i~0#1 < ~n~0); {10949#true} is VALID [2022-02-20 23:44:09,079 INFO L290 TraceCheckUtils]: 11: Hoare triple {10949#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {10949#true} is VALID [2022-02-20 23:44:09,079 INFO L290 TraceCheckUtils]: 12: Hoare triple {10949#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {10949#true} is VALID [2022-02-20 23:44:09,079 INFO L290 TraceCheckUtils]: 13: Hoare triple {10949#true} assume !!(foo_~i~0#1 < ~n~0); {10949#true} is VALID [2022-02-20 23:44:09,079 INFO L290 TraceCheckUtils]: 14: Hoare triple {10949#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {10949#true} is VALID [2022-02-20 23:44:09,079 INFO L290 TraceCheckUtils]: 15: Hoare triple {10949#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {10949#true} is VALID [2022-02-20 23:44:09,079 INFO L290 TraceCheckUtils]: 16: Hoare triple {10949#true} assume !!(foo_~i~0#1 < ~n~0); {10949#true} is VALID [2022-02-20 23:44:09,079 INFO L290 TraceCheckUtils]: 17: Hoare triple {10949#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {10949#true} is VALID [2022-02-20 23:44:09,080 INFO L290 TraceCheckUtils]: 18: Hoare triple {10949#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {10949#true} is VALID [2022-02-20 23:44:09,080 INFO L290 TraceCheckUtils]: 19: Hoare triple {10949#true} assume !!(foo_~i~0#1 < ~n~0); {10949#true} is VALID [2022-02-20 23:44:09,080 INFO L290 TraceCheckUtils]: 20: Hoare triple {10949#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {10949#true} is VALID [2022-02-20 23:44:09,080 INFO L290 TraceCheckUtils]: 21: Hoare triple {10949#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {10949#true} is VALID [2022-02-20 23:44:09,080 INFO L290 TraceCheckUtils]: 22: Hoare triple {10949#true} assume !!(foo_~i~0#1 < ~n~0); {10949#true} is VALID [2022-02-20 23:44:09,080 INFO L290 TraceCheckUtils]: 23: Hoare triple {10949#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {10949#true} is VALID [2022-02-20 23:44:09,080 INFO L290 TraceCheckUtils]: 24: Hoare triple {10949#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {10949#true} is VALID [2022-02-20 23:44:09,080 INFO L290 TraceCheckUtils]: 25: Hoare triple {10949#true} assume !!(foo_~i~0#1 < ~n~0); {10949#true} is VALID [2022-02-20 23:44:09,080 INFO L290 TraceCheckUtils]: 26: Hoare triple {10949#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {10949#true} is VALID [2022-02-20 23:44:09,080 INFO L290 TraceCheckUtils]: 27: Hoare triple {10949#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {10949#true} is VALID [2022-02-20 23:44:09,080 INFO L290 TraceCheckUtils]: 28: Hoare triple {10949#true} assume !!(foo_~i~0#1 < ~n~0); {10949#true} is VALID [2022-02-20 23:44:09,080 INFO L290 TraceCheckUtils]: 29: Hoare triple {10949#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {10949#true} is VALID [2022-02-20 23:44:09,080 INFO L290 TraceCheckUtils]: 30: Hoare triple {10949#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {10949#true} is VALID [2022-02-20 23:44:09,080 INFO L290 TraceCheckUtils]: 31: Hoare triple {10949#true} assume !!(foo_~i~0#1 < ~n~0); {10949#true} is VALID [2022-02-20 23:44:09,080 INFO L290 TraceCheckUtils]: 32: Hoare triple {10949#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {10949#true} is VALID [2022-02-20 23:44:09,080 INFO L290 TraceCheckUtils]: 33: Hoare triple {10949#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {10949#true} is VALID [2022-02-20 23:44:09,080 INFO L290 TraceCheckUtils]: 34: Hoare triple {10949#true} assume !!(foo_~i~0#1 < ~n~0); {10949#true} is VALID [2022-02-20 23:44:09,080 INFO L290 TraceCheckUtils]: 35: Hoare triple {10949#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {10949#true} is VALID [2022-02-20 23:44:09,080 INFO L290 TraceCheckUtils]: 36: Hoare triple {10949#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {10949#true} is VALID [2022-02-20 23:44:09,080 INFO L290 TraceCheckUtils]: 37: Hoare triple {10949#true} assume !!(foo_~i~0#1 < ~n~0); {10949#true} is VALID [2022-02-20 23:44:09,080 INFO L290 TraceCheckUtils]: 38: Hoare triple {10949#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {10949#true} is VALID [2022-02-20 23:44:09,080 INFO L290 TraceCheckUtils]: 39: Hoare triple {10949#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {10949#true} is VALID [2022-02-20 23:44:09,081 INFO L290 TraceCheckUtils]: 40: Hoare triple {10949#true} assume !!(foo_~i~0#1 < ~n~0); {10949#true} is VALID [2022-02-20 23:44:09,081 INFO L290 TraceCheckUtils]: 41: Hoare triple {10949#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {10949#true} is VALID [2022-02-20 23:44:09,081 INFO L290 TraceCheckUtils]: 42: Hoare triple {10949#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {10949#true} is VALID [2022-02-20 23:44:09,081 INFO L290 TraceCheckUtils]: 43: Hoare triple {10949#true} assume !!(foo_~i~0#1 < ~n~0); {10949#true} is VALID [2022-02-20 23:44:09,081 INFO L290 TraceCheckUtils]: 44: Hoare triple {10949#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {10949#true} is VALID [2022-02-20 23:44:09,081 INFO L290 TraceCheckUtils]: 45: Hoare triple {10949#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {10949#true} is VALID [2022-02-20 23:44:09,081 INFO L290 TraceCheckUtils]: 46: Hoare triple {10949#true} assume !!(foo_~i~0#1 < ~n~0); {10949#true} is VALID [2022-02-20 23:44:09,081 INFO L290 TraceCheckUtils]: 47: Hoare triple {10949#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {10949#true} is VALID [2022-02-20 23:44:09,081 INFO L290 TraceCheckUtils]: 48: Hoare triple {10949#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {10949#true} is VALID [2022-02-20 23:44:09,081 INFO L290 TraceCheckUtils]: 49: Hoare triple {10949#true} assume !!(foo_~i~0#1 < ~n~0); {10949#true} is VALID [2022-02-20 23:44:09,081 INFO L290 TraceCheckUtils]: 50: Hoare triple {10949#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {10949#true} is VALID [2022-02-20 23:44:09,081 INFO L290 TraceCheckUtils]: 51: Hoare triple {10949#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {10949#true} is VALID [2022-02-20 23:44:09,081 INFO L290 TraceCheckUtils]: 52: Hoare triple {10949#true} assume !!(foo_~i~0#1 < ~n~0); {10949#true} is VALID [2022-02-20 23:44:09,081 INFO L290 TraceCheckUtils]: 53: Hoare triple {10949#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {10949#true} is VALID [2022-02-20 23:44:09,081 INFO L290 TraceCheckUtils]: 54: Hoare triple {10949#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {10949#true} is VALID [2022-02-20 23:44:09,081 INFO L290 TraceCheckUtils]: 55: Hoare triple {10949#true} assume !!(foo_~i~0#1 < ~n~0); {10949#true} is VALID [2022-02-20 23:44:09,081 INFO L290 TraceCheckUtils]: 56: Hoare triple {10949#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {10949#true} is VALID [2022-02-20 23:44:09,081 INFO L290 TraceCheckUtils]: 57: Hoare triple {10949#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {10949#true} is VALID [2022-02-20 23:44:09,081 INFO L290 TraceCheckUtils]: 58: Hoare triple {10949#true} assume !!(foo_~i~0#1 < ~n~0); {10949#true} is VALID [2022-02-20 23:44:09,081 INFO L290 TraceCheckUtils]: 59: Hoare triple {10949#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {10949#true} is VALID [2022-02-20 23:44:09,081 INFO L290 TraceCheckUtils]: 60: Hoare triple {10949#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {10949#true} is VALID [2022-02-20 23:44:09,081 INFO L290 TraceCheckUtils]: 61: Hoare triple {10949#true} assume !!(foo_~i~0#1 < ~n~0); {10949#true} is VALID [2022-02-20 23:44:09,082 INFO L290 TraceCheckUtils]: 62: Hoare triple {10949#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {10949#true} is VALID [2022-02-20 23:44:09,082 INFO L290 TraceCheckUtils]: 63: Hoare triple {10949#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {10949#true} is VALID [2022-02-20 23:44:09,082 INFO L290 TraceCheckUtils]: 64: Hoare triple {10949#true} assume !!(foo_~i~0#1 < ~n~0); {10949#true} is VALID [2022-02-20 23:44:09,082 INFO L290 TraceCheckUtils]: 65: Hoare triple {10949#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {10949#true} is VALID [2022-02-20 23:44:09,082 INFO L290 TraceCheckUtils]: 66: Hoare triple {10949#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {10949#true} is VALID [2022-02-20 23:44:09,082 INFO L290 TraceCheckUtils]: 67: Hoare triple {10949#true} assume !!(foo_~i~0#1 < ~n~0); {10949#true} is VALID [2022-02-20 23:44:09,082 INFO L290 TraceCheckUtils]: 68: Hoare triple {10949#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {10949#true} is VALID [2022-02-20 23:44:09,082 INFO L290 TraceCheckUtils]: 69: Hoare triple {10949#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {10949#true} is VALID [2022-02-20 23:44:09,082 INFO L290 TraceCheckUtils]: 70: Hoare triple {10949#true} assume !!(foo_~i~0#1 < ~n~0); {10949#true} is VALID [2022-02-20 23:44:09,082 INFO L290 TraceCheckUtils]: 71: Hoare triple {10949#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {10949#true} is VALID [2022-02-20 23:44:09,082 INFO L290 TraceCheckUtils]: 72: Hoare triple {10949#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {10949#true} is VALID [2022-02-20 23:44:09,082 INFO L290 TraceCheckUtils]: 73: Hoare triple {10949#true} assume !!(foo_~i~0#1 < ~n~0); {10949#true} is VALID [2022-02-20 23:44:09,082 INFO L290 TraceCheckUtils]: 74: Hoare triple {10949#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {10949#true} is VALID [2022-02-20 23:44:09,082 INFO L290 TraceCheckUtils]: 75: Hoare triple {10949#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {10949#true} is VALID [2022-02-20 23:44:09,082 INFO L290 TraceCheckUtils]: 76: Hoare triple {10949#true} assume !!(foo_~i~0#1 < ~n~0); {10949#true} is VALID [2022-02-20 23:44:09,082 INFO L290 TraceCheckUtils]: 77: Hoare triple {10949#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {10949#true} is VALID [2022-02-20 23:44:09,082 INFO L290 TraceCheckUtils]: 78: Hoare triple {10949#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {10949#true} is VALID [2022-02-20 23:44:09,082 INFO L290 TraceCheckUtils]: 79: Hoare triple {10949#true} assume !!(foo_~i~0#1 < ~n~0); {10949#true} is VALID [2022-02-20 23:44:09,082 INFO L290 TraceCheckUtils]: 80: Hoare triple {10949#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {10949#true} is VALID [2022-02-20 23:44:09,082 INFO L290 TraceCheckUtils]: 81: Hoare triple {10949#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {10949#true} is VALID [2022-02-20 23:44:09,082 INFO L290 TraceCheckUtils]: 82: Hoare triple {10949#true} assume !!(foo_~i~0#1 < ~n~0); {10949#true} is VALID [2022-02-20 23:44:09,082 INFO L290 TraceCheckUtils]: 83: Hoare triple {10949#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {10949#true} is VALID [2022-02-20 23:44:09,082 INFO L290 TraceCheckUtils]: 84: Hoare triple {10949#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {10949#true} is VALID [2022-02-20 23:44:09,083 INFO L290 TraceCheckUtils]: 85: Hoare triple {10949#true} assume !!(foo_~i~0#1 < ~n~0); {10949#true} is VALID [2022-02-20 23:44:09,083 INFO L290 TraceCheckUtils]: 86: Hoare triple {10949#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {10949#true} is VALID [2022-02-20 23:44:09,083 INFO L290 TraceCheckUtils]: 87: Hoare triple {10949#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {10949#true} is VALID [2022-02-20 23:44:09,083 INFO L290 TraceCheckUtils]: 88: Hoare triple {10949#true} assume !!(foo_~i~0#1 < ~n~0); {10949#true} is VALID [2022-02-20 23:44:09,083 INFO L290 TraceCheckUtils]: 89: Hoare triple {10949#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {10949#true} is VALID [2022-02-20 23:44:09,083 INFO L290 TraceCheckUtils]: 90: Hoare triple {10949#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {10949#true} is VALID [2022-02-20 23:44:09,083 INFO L290 TraceCheckUtils]: 91: Hoare triple {10949#true} assume !!(foo_~i~0#1 < ~n~0); {10949#true} is VALID [2022-02-20 23:44:09,083 INFO L290 TraceCheckUtils]: 92: Hoare triple {10949#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {10949#true} is VALID [2022-02-20 23:44:09,083 INFO L290 TraceCheckUtils]: 93: Hoare triple {10949#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {10949#true} is VALID [2022-02-20 23:44:09,083 INFO L290 TraceCheckUtils]: 94: Hoare triple {10949#true} assume !!(foo_~i~0#1 < ~n~0); {10949#true} is VALID [2022-02-20 23:44:09,083 INFO L290 TraceCheckUtils]: 95: Hoare triple {10949#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {10949#true} is VALID [2022-02-20 23:44:09,083 INFO L290 TraceCheckUtils]: 96: Hoare triple {10949#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {10949#true} is VALID [2022-02-20 23:44:09,083 INFO L290 TraceCheckUtils]: 97: Hoare triple {10949#true} assume !!(foo_~i~0#1 < ~n~0); {10949#true} is VALID [2022-02-20 23:44:09,083 INFO L290 TraceCheckUtils]: 98: Hoare triple {10949#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {10949#true} is VALID [2022-02-20 23:44:09,083 INFO L290 TraceCheckUtils]: 99: Hoare triple {10949#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {10949#true} is VALID [2022-02-20 23:44:09,083 INFO L290 TraceCheckUtils]: 100: Hoare triple {10949#true} assume !!(foo_~i~0#1 < ~n~0); {10949#true} is VALID [2022-02-20 23:44:09,083 INFO L290 TraceCheckUtils]: 101: Hoare triple {10949#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {10949#true} is VALID [2022-02-20 23:44:09,083 INFO L290 TraceCheckUtils]: 102: Hoare triple {10949#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {10949#true} is VALID [2022-02-20 23:44:09,083 INFO L290 TraceCheckUtils]: 103: Hoare triple {10949#true} assume !!(foo_~i~0#1 < ~n~0); {10949#true} is VALID [2022-02-20 23:44:09,083 INFO L290 TraceCheckUtils]: 104: Hoare triple {10949#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {10949#true} is VALID [2022-02-20 23:44:09,083 INFO L290 TraceCheckUtils]: 105: Hoare triple {10949#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {10949#true} is VALID [2022-02-20 23:44:09,083 INFO L290 TraceCheckUtils]: 106: Hoare triple {10949#true} assume !!(foo_~i~0#1 < ~n~0); {10949#true} is VALID [2022-02-20 23:44:09,084 INFO L290 TraceCheckUtils]: 107: Hoare triple {10949#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {10949#true} is VALID [2022-02-20 23:44:09,084 INFO L290 TraceCheckUtils]: 108: Hoare triple {10949#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {10949#true} is VALID [2022-02-20 23:44:09,084 INFO L290 TraceCheckUtils]: 109: Hoare triple {10949#true} assume !!(foo_~i~0#1 < ~n~0); {10949#true} is VALID [2022-02-20 23:44:09,084 INFO L290 TraceCheckUtils]: 110: Hoare triple {10949#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {10949#true} is VALID [2022-02-20 23:44:09,084 INFO L290 TraceCheckUtils]: 111: Hoare triple {10949#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {10949#true} is VALID [2022-02-20 23:44:09,084 INFO L290 TraceCheckUtils]: 112: Hoare triple {10949#true} assume !!(foo_~i~0#1 < ~n~0); {10949#true} is VALID [2022-02-20 23:44:09,084 INFO L290 TraceCheckUtils]: 113: Hoare triple {10949#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {10949#true} is VALID [2022-02-20 23:44:09,084 INFO L290 TraceCheckUtils]: 114: Hoare triple {10949#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {10949#true} is VALID [2022-02-20 23:44:09,084 INFO L290 TraceCheckUtils]: 115: Hoare triple {10949#true} assume !!(foo_~i~0#1 < ~n~0); {10949#true} is VALID [2022-02-20 23:44:09,084 INFO L290 TraceCheckUtils]: 116: Hoare triple {10949#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {10949#true} is VALID [2022-02-20 23:44:09,084 INFO L290 TraceCheckUtils]: 117: Hoare triple {10949#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {10949#true} is VALID [2022-02-20 23:44:09,084 INFO L290 TraceCheckUtils]: 118: Hoare triple {10949#true} assume !!(foo_~i~0#1 < ~n~0); {10949#true} is VALID [2022-02-20 23:44:09,084 INFO L290 TraceCheckUtils]: 119: Hoare triple {10949#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {10949#true} is VALID [2022-02-20 23:44:09,084 INFO L290 TraceCheckUtils]: 120: Hoare triple {10949#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {10949#true} is VALID [2022-02-20 23:44:09,084 INFO L290 TraceCheckUtils]: 121: Hoare triple {10949#true} assume !!(foo_~i~0#1 < ~n~0); {10949#true} is VALID [2022-02-20 23:44:09,084 INFO L290 TraceCheckUtils]: 122: Hoare triple {10949#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {10949#true} is VALID [2022-02-20 23:44:09,084 INFO L290 TraceCheckUtils]: 123: Hoare triple {10949#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {10949#true} is VALID [2022-02-20 23:44:09,084 INFO L290 TraceCheckUtils]: 124: Hoare triple {10949#true} assume !!(foo_~i~0#1 < ~n~0); {10949#true} is VALID [2022-02-20 23:44:09,084 INFO L290 TraceCheckUtils]: 125: Hoare triple {10949#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {10949#true} is VALID [2022-02-20 23:44:09,084 INFO L290 TraceCheckUtils]: 126: Hoare triple {10949#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {10949#true} is VALID [2022-02-20 23:44:09,084 INFO L290 TraceCheckUtils]: 127: Hoare triple {10949#true} assume !!(foo_~i~0#1 < ~n~0); {10949#true} is VALID [2022-02-20 23:44:09,084 INFO L290 TraceCheckUtils]: 128: Hoare triple {10949#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {10949#true} is VALID [2022-02-20 23:44:09,085 INFO L290 TraceCheckUtils]: 129: Hoare triple {10949#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {10949#true} is VALID [2022-02-20 23:44:09,085 INFO L290 TraceCheckUtils]: 130: Hoare triple {10949#true} assume !!(foo_~i~0#1 < ~n~0); {10949#true} is VALID [2022-02-20 23:44:09,085 INFO L290 TraceCheckUtils]: 131: Hoare triple {10949#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {10949#true} is VALID [2022-02-20 23:44:09,085 INFO L290 TraceCheckUtils]: 132: Hoare triple {10949#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {10949#true} is VALID [2022-02-20 23:44:09,085 INFO L290 TraceCheckUtils]: 133: Hoare triple {10949#true} assume !!(foo_~i~0#1 < ~n~0); {10949#true} is VALID [2022-02-20 23:44:09,085 INFO L290 TraceCheckUtils]: 134: Hoare triple {10949#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {10949#true} is VALID [2022-02-20 23:44:09,085 INFO L290 TraceCheckUtils]: 135: Hoare triple {10949#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {10949#true} is VALID [2022-02-20 23:44:09,085 INFO L290 TraceCheckUtils]: 136: Hoare triple {10949#true} assume !!(foo_~i~0#1 < ~n~0); {10949#true} is VALID [2022-02-20 23:44:09,085 INFO L290 TraceCheckUtils]: 137: Hoare triple {10949#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {10949#true} is VALID [2022-02-20 23:44:09,085 INFO L290 TraceCheckUtils]: 138: Hoare triple {10949#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {10949#true} is VALID [2022-02-20 23:44:09,085 INFO L290 TraceCheckUtils]: 139: Hoare triple {10949#true} assume !!(foo_~i~0#1 < ~n~0); {10949#true} is VALID [2022-02-20 23:44:09,085 INFO L290 TraceCheckUtils]: 140: Hoare triple {10949#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {10949#true} is VALID [2022-02-20 23:44:09,085 INFO L290 TraceCheckUtils]: 141: Hoare triple {10949#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {10949#true} is VALID [2022-02-20 23:44:09,085 INFO L290 TraceCheckUtils]: 142: Hoare triple {10949#true} assume !!(foo_~i~0#1 < ~n~0); {10949#true} is VALID [2022-02-20 23:44:09,085 INFO L290 TraceCheckUtils]: 143: Hoare triple {10949#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {10949#true} is VALID [2022-02-20 23:44:09,085 INFO L290 TraceCheckUtils]: 144: Hoare triple {10949#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {10949#true} is VALID [2022-02-20 23:44:09,085 INFO L290 TraceCheckUtils]: 145: Hoare triple {10949#true} assume !!(foo_~i~0#1 < ~n~0); {10949#true} is VALID [2022-02-20 23:44:09,085 INFO L290 TraceCheckUtils]: 146: Hoare triple {10949#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {10949#true} is VALID [2022-02-20 23:44:09,085 INFO L290 TraceCheckUtils]: 147: Hoare triple {10949#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {10949#true} is VALID [2022-02-20 23:44:09,085 INFO L290 TraceCheckUtils]: 148: Hoare triple {10949#true} assume !!(foo_~i~0#1 < ~n~0); {10949#true} is VALID [2022-02-20 23:44:09,085 INFO L290 TraceCheckUtils]: 149: Hoare triple {10949#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {10949#true} is VALID [2022-02-20 23:44:09,086 INFO L290 TraceCheckUtils]: 150: Hoare triple {10949#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {10949#true} is VALID [2022-02-20 23:44:09,086 INFO L290 TraceCheckUtils]: 151: Hoare triple {10949#true} assume !!(foo_~i~0#1 < ~n~0); {10949#true} is VALID [2022-02-20 23:44:09,086 INFO L290 TraceCheckUtils]: 152: Hoare triple {10949#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {10949#true} is VALID [2022-02-20 23:44:09,086 INFO L290 TraceCheckUtils]: 153: Hoare triple {10949#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {10949#true} is VALID [2022-02-20 23:44:09,086 INFO L290 TraceCheckUtils]: 154: Hoare triple {10949#true} assume !!(foo_~i~0#1 < ~n~0); {10949#true} is VALID [2022-02-20 23:44:09,086 INFO L290 TraceCheckUtils]: 155: Hoare triple {10949#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {10949#true} is VALID [2022-02-20 23:44:09,086 INFO L290 TraceCheckUtils]: 156: Hoare triple {10949#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {10949#true} is VALID [2022-02-20 23:44:09,086 INFO L290 TraceCheckUtils]: 157: Hoare triple {10949#true} assume !!(foo_~i~0#1 < ~n~0); {10949#true} is VALID [2022-02-20 23:44:09,086 INFO L290 TraceCheckUtils]: 158: Hoare triple {10949#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {10949#true} is VALID [2022-02-20 23:44:09,086 INFO L290 TraceCheckUtils]: 159: Hoare triple {10949#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {10949#true} is VALID [2022-02-20 23:44:09,086 INFO L290 TraceCheckUtils]: 160: Hoare triple {10949#true} assume !!(foo_~i~0#1 < ~n~0); {10949#true} is VALID [2022-02-20 23:44:09,086 INFO L290 TraceCheckUtils]: 161: Hoare triple {10949#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {10949#true} is VALID [2022-02-20 23:44:09,086 INFO L290 TraceCheckUtils]: 162: Hoare triple {10949#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {10949#true} is VALID [2022-02-20 23:44:09,086 INFO L290 TraceCheckUtils]: 163: Hoare triple {10949#true} assume !!(foo_~i~0#1 < ~n~0); {10949#true} is VALID [2022-02-20 23:44:09,086 INFO L290 TraceCheckUtils]: 164: Hoare triple {10949#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {10949#true} is VALID [2022-02-20 23:44:09,086 INFO L290 TraceCheckUtils]: 165: Hoare triple {10949#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {10949#true} is VALID [2022-02-20 23:44:09,086 INFO L290 TraceCheckUtils]: 166: Hoare triple {10949#true} assume !!(foo_~i~0#1 < ~n~0); {10949#true} is VALID [2022-02-20 23:44:09,086 INFO L290 TraceCheckUtils]: 167: Hoare triple {10949#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {10949#true} is VALID [2022-02-20 23:44:09,086 INFO L290 TraceCheckUtils]: 168: Hoare triple {10949#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {10949#true} is VALID [2022-02-20 23:44:09,086 INFO L290 TraceCheckUtils]: 169: Hoare triple {10949#true} assume !!(foo_~i~0#1 < ~n~0); {10949#true} is VALID [2022-02-20 23:44:09,086 INFO L290 TraceCheckUtils]: 170: Hoare triple {10949#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {10949#true} is VALID [2022-02-20 23:44:09,086 INFO L290 TraceCheckUtils]: 171: Hoare triple {10949#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {10949#true} is VALID [2022-02-20 23:44:09,087 INFO L290 TraceCheckUtils]: 172: Hoare triple {10949#true} assume !!(foo_~i~0#1 < ~n~0); {10949#true} is VALID [2022-02-20 23:44:09,087 INFO L290 TraceCheckUtils]: 173: Hoare triple {10949#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {10949#true} is VALID [2022-02-20 23:44:09,087 INFO L290 TraceCheckUtils]: 174: Hoare triple {10949#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {10949#true} is VALID [2022-02-20 23:44:09,087 INFO L290 TraceCheckUtils]: 175: Hoare triple {10949#true} assume !!(foo_~i~0#1 < ~n~0); {10949#true} is VALID [2022-02-20 23:44:09,087 INFO L290 TraceCheckUtils]: 176: Hoare triple {10949#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {10949#true} is VALID [2022-02-20 23:44:09,087 INFO L290 TraceCheckUtils]: 177: Hoare triple {10949#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {10949#true} is VALID [2022-02-20 23:44:09,087 INFO L290 TraceCheckUtils]: 178: Hoare triple {10949#true} assume !!(foo_~i~0#1 < ~n~0); {10949#true} is VALID [2022-02-20 23:44:09,087 INFO L290 TraceCheckUtils]: 179: Hoare triple {10949#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {10949#true} is VALID [2022-02-20 23:44:09,087 INFO L290 TraceCheckUtils]: 180: Hoare triple {10949#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {10949#true} is VALID [2022-02-20 23:44:09,087 INFO L290 TraceCheckUtils]: 181: Hoare triple {10949#true} assume !!(foo_~i~0#1 < ~n~0); {10949#true} is VALID [2022-02-20 23:44:09,087 INFO L290 TraceCheckUtils]: 182: Hoare triple {10949#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {10949#true} is VALID [2022-02-20 23:44:09,087 INFO L290 TraceCheckUtils]: 183: Hoare triple {10949#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {10949#true} is VALID [2022-02-20 23:44:09,087 INFO L290 TraceCheckUtils]: 184: Hoare triple {10949#true} assume !!(foo_~i~0#1 < ~n~0); {10949#true} is VALID [2022-02-20 23:44:09,087 INFO L290 TraceCheckUtils]: 185: Hoare triple {10949#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {10949#true} is VALID [2022-02-20 23:44:09,087 INFO L290 TraceCheckUtils]: 186: Hoare triple {10949#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {10949#true} is VALID [2022-02-20 23:44:09,087 INFO L290 TraceCheckUtils]: 187: Hoare triple {10949#true} assume !!(foo_~i~0#1 < ~n~0); {10949#true} is VALID [2022-02-20 23:44:09,087 INFO L290 TraceCheckUtils]: 188: Hoare triple {10949#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {10949#true} is VALID [2022-02-20 23:44:09,087 INFO L290 TraceCheckUtils]: 189: Hoare triple {10949#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {10949#true} is VALID [2022-02-20 23:44:09,087 INFO L290 TraceCheckUtils]: 190: Hoare triple {10949#true} assume !(foo_~i~0#1 < ~n~0); {10949#true} is VALID [2022-02-20 23:44:09,088 INFO L290 TraceCheckUtils]: 191: Hoare triple {10949#true} foo_~i~0#1 := 0; {10951#(= |ULTIMATE.start_foo_~i~0#1| 0)} is VALID [2022-02-20 23:44:09,088 INFO L290 TraceCheckUtils]: 192: Hoare triple {10951#(= |ULTIMATE.start_foo_~i~0#1| 0)} assume !!(foo_~i~0#1 < 127); {10951#(= |ULTIMATE.start_foo_~i~0#1| 0)} is VALID [2022-02-20 23:44:09,088 INFO L290 TraceCheckUtils]: 193: Hoare triple {10951#(= |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 {10951#(= |ULTIMATE.start_foo_~i~0#1| 0)} is VALID [2022-02-20 23:44:09,089 INFO L290 TraceCheckUtils]: 194: Hoare triple {10951#(= |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; {10952#(<= |ULTIMATE.start_foo_~i~0#1| 1)} is VALID [2022-02-20 23:44:09,089 INFO L290 TraceCheckUtils]: 195: Hoare triple {10952#(<= |ULTIMATE.start_foo_~i~0#1| 1)} assume !!(foo_~i~0#1 < 127); {10952#(<= |ULTIMATE.start_foo_~i~0#1| 1)} is VALID [2022-02-20 23:44:09,089 INFO L290 TraceCheckUtils]: 196: Hoare triple {10952#(<= |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 {10952#(<= |ULTIMATE.start_foo_~i~0#1| 1)} is VALID [2022-02-20 23:44:09,089 INFO L290 TraceCheckUtils]: 197: Hoare triple {10952#(<= |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; {10953#(<= |ULTIMATE.start_foo_~i~0#1| 2)} is VALID [2022-02-20 23:44:09,090 INFO L290 TraceCheckUtils]: 198: Hoare triple {10953#(<= |ULTIMATE.start_foo_~i~0#1| 2)} assume !!(foo_~i~0#1 < 127); {10953#(<= |ULTIMATE.start_foo_~i~0#1| 2)} is VALID [2022-02-20 23:44:09,090 INFO L290 TraceCheckUtils]: 199: Hoare triple {10953#(<= |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 {10953#(<= |ULTIMATE.start_foo_~i~0#1| 2)} is VALID [2022-02-20 23:44:09,090 INFO L290 TraceCheckUtils]: 200: Hoare triple {10953#(<= |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; {10954#(<= |ULTIMATE.start_foo_~i~0#1| 3)} is VALID [2022-02-20 23:44:09,091 INFO L290 TraceCheckUtils]: 201: Hoare triple {10954#(<= |ULTIMATE.start_foo_~i~0#1| 3)} assume !!(foo_~i~0#1 < 127); {10954#(<= |ULTIMATE.start_foo_~i~0#1| 3)} is VALID [2022-02-20 23:44:09,091 INFO L290 TraceCheckUtils]: 202: Hoare triple {10954#(<= |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 {10954#(<= |ULTIMATE.start_foo_~i~0#1| 3)} is VALID [2022-02-20 23:44:09,091 INFO L290 TraceCheckUtils]: 203: Hoare triple {10954#(<= |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; {10955#(<= |ULTIMATE.start_foo_~i~0#1| 4)} is VALID [2022-02-20 23:44:09,091 INFO L290 TraceCheckUtils]: 204: Hoare triple {10955#(<= |ULTIMATE.start_foo_~i~0#1| 4)} assume !!(foo_~i~0#1 < 127); {10955#(<= |ULTIMATE.start_foo_~i~0#1| 4)} is VALID [2022-02-20 23:44:09,092 INFO L290 TraceCheckUtils]: 205: Hoare triple {10955#(<= |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 {10955#(<= |ULTIMATE.start_foo_~i~0#1| 4)} is VALID [2022-02-20 23:44:09,092 INFO L290 TraceCheckUtils]: 206: Hoare triple {10955#(<= |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; {10956#(<= |ULTIMATE.start_foo_~i~0#1| 5)} is VALID [2022-02-20 23:44:09,092 INFO L290 TraceCheckUtils]: 207: Hoare triple {10956#(<= |ULTIMATE.start_foo_~i~0#1| 5)} assume !!(foo_~i~0#1 < 127); {10956#(<= |ULTIMATE.start_foo_~i~0#1| 5)} is VALID [2022-02-20 23:44:09,093 INFO L290 TraceCheckUtils]: 208: Hoare triple {10956#(<= |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 {10956#(<= |ULTIMATE.start_foo_~i~0#1| 5)} is VALID [2022-02-20 23:44:09,093 INFO L290 TraceCheckUtils]: 209: Hoare triple {10956#(<= |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; {10957#(<= |ULTIMATE.start_foo_~i~0#1| 6)} is VALID [2022-02-20 23:44:09,093 INFO L290 TraceCheckUtils]: 210: Hoare triple {10957#(<= |ULTIMATE.start_foo_~i~0#1| 6)} assume !!(foo_~i~0#1 < 127); {10957#(<= |ULTIMATE.start_foo_~i~0#1| 6)} is VALID [2022-02-20 23:44:09,093 INFO L290 TraceCheckUtils]: 211: Hoare triple {10957#(<= |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 {10957#(<= |ULTIMATE.start_foo_~i~0#1| 6)} is VALID [2022-02-20 23:44:09,094 INFO L290 TraceCheckUtils]: 212: Hoare triple {10957#(<= |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; {10958#(<= |ULTIMATE.start_foo_~i~0#1| 7)} is VALID [2022-02-20 23:44:09,094 INFO L290 TraceCheckUtils]: 213: Hoare triple {10958#(<= |ULTIMATE.start_foo_~i~0#1| 7)} assume !!(foo_~i~0#1 < 127); {10958#(<= |ULTIMATE.start_foo_~i~0#1| 7)} is VALID [2022-02-20 23:44:09,094 INFO L290 TraceCheckUtils]: 214: Hoare triple {10958#(<= |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 {10958#(<= |ULTIMATE.start_foo_~i~0#1| 7)} is VALID [2022-02-20 23:44:09,095 INFO L290 TraceCheckUtils]: 215: Hoare triple {10958#(<= |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; {10959#(<= |ULTIMATE.start_foo_~i~0#1| 8)} is VALID [2022-02-20 23:44:09,095 INFO L290 TraceCheckUtils]: 216: Hoare triple {10959#(<= |ULTIMATE.start_foo_~i~0#1| 8)} assume !!(foo_~i~0#1 < 127); {10959#(<= |ULTIMATE.start_foo_~i~0#1| 8)} is VALID [2022-02-20 23:44:09,095 INFO L290 TraceCheckUtils]: 217: Hoare triple {10959#(<= |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 {10959#(<= |ULTIMATE.start_foo_~i~0#1| 8)} is VALID [2022-02-20 23:44:09,096 INFO L290 TraceCheckUtils]: 218: Hoare triple {10959#(<= |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; {10960#(<= |ULTIMATE.start_foo_~i~0#1| 9)} is VALID [2022-02-20 23:44:09,096 INFO L290 TraceCheckUtils]: 219: Hoare triple {10960#(<= |ULTIMATE.start_foo_~i~0#1| 9)} assume !!(foo_~i~0#1 < 127); {10960#(<= |ULTIMATE.start_foo_~i~0#1| 9)} is VALID [2022-02-20 23:44:09,096 INFO L290 TraceCheckUtils]: 220: Hoare triple {10960#(<= |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 {10960#(<= |ULTIMATE.start_foo_~i~0#1| 9)} is VALID [2022-02-20 23:44:09,096 INFO L290 TraceCheckUtils]: 221: Hoare triple {10960#(<= |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; {10961#(<= |ULTIMATE.start_foo_~i~0#1| 10)} is VALID [2022-02-20 23:44:09,097 INFO L290 TraceCheckUtils]: 222: Hoare triple {10961#(<= |ULTIMATE.start_foo_~i~0#1| 10)} assume !!(foo_~i~0#1 < 127); {10961#(<= |ULTIMATE.start_foo_~i~0#1| 10)} is VALID [2022-02-20 23:44:09,097 INFO L290 TraceCheckUtils]: 223: Hoare triple {10961#(<= |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 {10961#(<= |ULTIMATE.start_foo_~i~0#1| 10)} is VALID [2022-02-20 23:44:09,097 INFO L290 TraceCheckUtils]: 224: Hoare triple {10961#(<= |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; {10962#(<= |ULTIMATE.start_foo_~i~0#1| 11)} is VALID [2022-02-20 23:44:09,097 INFO L290 TraceCheckUtils]: 225: Hoare triple {10962#(<= |ULTIMATE.start_foo_~i~0#1| 11)} assume !!(foo_~i~0#1 < 127); {10962#(<= |ULTIMATE.start_foo_~i~0#1| 11)} is VALID [2022-02-20 23:44:09,098 INFO L290 TraceCheckUtils]: 226: Hoare triple {10962#(<= |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 {10962#(<= |ULTIMATE.start_foo_~i~0#1| 11)} is VALID [2022-02-20 23:44:09,098 INFO L290 TraceCheckUtils]: 227: Hoare triple {10962#(<= |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; {10963#(<= |ULTIMATE.start_foo_~i~0#1| 12)} is VALID [2022-02-20 23:44:09,098 INFO L290 TraceCheckUtils]: 228: Hoare triple {10963#(<= |ULTIMATE.start_foo_~i~0#1| 12)} assume !!(foo_~i~0#1 < 127); {10963#(<= |ULTIMATE.start_foo_~i~0#1| 12)} is VALID [2022-02-20 23:44:09,099 INFO L290 TraceCheckUtils]: 229: Hoare triple {10963#(<= |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 {10963#(<= |ULTIMATE.start_foo_~i~0#1| 12)} is VALID [2022-02-20 23:44:09,099 INFO L290 TraceCheckUtils]: 230: Hoare triple {10963#(<= |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; {10964#(<= |ULTIMATE.start_foo_~i~0#1| 13)} is VALID [2022-02-20 23:44:09,099 INFO L290 TraceCheckUtils]: 231: Hoare triple {10964#(<= |ULTIMATE.start_foo_~i~0#1| 13)} assume !!(foo_~i~0#1 < 127); {10964#(<= |ULTIMATE.start_foo_~i~0#1| 13)} is VALID [2022-02-20 23:44:09,099 INFO L290 TraceCheckUtils]: 232: Hoare triple {10964#(<= |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 {10964#(<= |ULTIMATE.start_foo_~i~0#1| 13)} is VALID [2022-02-20 23:44:09,100 INFO L290 TraceCheckUtils]: 233: Hoare triple {10964#(<= |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; {10965#(<= |ULTIMATE.start_foo_~i~0#1| 14)} is VALID [2022-02-20 23:44:09,100 INFO L290 TraceCheckUtils]: 234: Hoare triple {10965#(<= |ULTIMATE.start_foo_~i~0#1| 14)} assume !!(foo_~i~0#1 < 127); {10965#(<= |ULTIMATE.start_foo_~i~0#1| 14)} is VALID [2022-02-20 23:44:09,100 INFO L290 TraceCheckUtils]: 235: Hoare triple {10965#(<= |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 {10965#(<= |ULTIMATE.start_foo_~i~0#1| 14)} is VALID [2022-02-20 23:44:09,101 INFO L290 TraceCheckUtils]: 236: Hoare triple {10965#(<= |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; {10966#(<= |ULTIMATE.start_foo_~i~0#1| 15)} is VALID [2022-02-20 23:44:09,101 INFO L290 TraceCheckUtils]: 237: Hoare triple {10966#(<= |ULTIMATE.start_foo_~i~0#1| 15)} assume !!(foo_~i~0#1 < 127); {10966#(<= |ULTIMATE.start_foo_~i~0#1| 15)} is VALID [2022-02-20 23:44:09,101 INFO L290 TraceCheckUtils]: 238: Hoare triple {10966#(<= |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 {10966#(<= |ULTIMATE.start_foo_~i~0#1| 15)} is VALID [2022-02-20 23:44:09,101 INFO L290 TraceCheckUtils]: 239: Hoare triple {10966#(<= |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; {10967#(<= |ULTIMATE.start_foo_~i~0#1| 16)} is VALID [2022-02-20 23:44:09,102 INFO L290 TraceCheckUtils]: 240: Hoare triple {10967#(<= |ULTIMATE.start_foo_~i~0#1| 16)} assume !!(foo_~i~0#1 < 127); {10967#(<= |ULTIMATE.start_foo_~i~0#1| 16)} is VALID [2022-02-20 23:44:09,102 INFO L290 TraceCheckUtils]: 241: Hoare triple {10967#(<= |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 {10967#(<= |ULTIMATE.start_foo_~i~0#1| 16)} is VALID [2022-02-20 23:44:09,102 INFO L290 TraceCheckUtils]: 242: Hoare triple {10967#(<= |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; {10968#(<= |ULTIMATE.start_foo_~i~0#1| 17)} is VALID [2022-02-20 23:44:09,103 INFO L290 TraceCheckUtils]: 243: Hoare triple {10968#(<= |ULTIMATE.start_foo_~i~0#1| 17)} assume !!(foo_~i~0#1 < 127); {10968#(<= |ULTIMATE.start_foo_~i~0#1| 17)} is VALID [2022-02-20 23:44:09,103 INFO L290 TraceCheckUtils]: 244: Hoare triple {10968#(<= |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 {10968#(<= |ULTIMATE.start_foo_~i~0#1| 17)} is VALID [2022-02-20 23:44:09,103 INFO L290 TraceCheckUtils]: 245: Hoare triple {10968#(<= |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; {10969#(<= |ULTIMATE.start_foo_~i~0#1| 18)} is VALID [2022-02-20 23:44:09,104 INFO L290 TraceCheckUtils]: 246: Hoare triple {10969#(<= |ULTIMATE.start_foo_~i~0#1| 18)} assume !!(foo_~i~0#1 < 127); {10969#(<= |ULTIMATE.start_foo_~i~0#1| 18)} is VALID [2022-02-20 23:44:09,104 INFO L290 TraceCheckUtils]: 247: Hoare triple {10969#(<= |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 {10969#(<= |ULTIMATE.start_foo_~i~0#1| 18)} is VALID [2022-02-20 23:44:09,104 INFO L290 TraceCheckUtils]: 248: Hoare triple {10969#(<= |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; {10970#(<= |ULTIMATE.start_foo_~i~0#1| 19)} is VALID [2022-02-20 23:44:09,104 INFO L290 TraceCheckUtils]: 249: Hoare triple {10970#(<= |ULTIMATE.start_foo_~i~0#1| 19)} assume !!(foo_~i~0#1 < 127); {10970#(<= |ULTIMATE.start_foo_~i~0#1| 19)} is VALID [2022-02-20 23:44:09,105 INFO L290 TraceCheckUtils]: 250: Hoare triple {10970#(<= |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 {10970#(<= |ULTIMATE.start_foo_~i~0#1| 19)} is VALID [2022-02-20 23:44:09,105 INFO L290 TraceCheckUtils]: 251: Hoare triple {10970#(<= |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; {10971#(<= |ULTIMATE.start_foo_~i~0#1| 20)} is VALID [2022-02-20 23:44:09,105 INFO L290 TraceCheckUtils]: 252: Hoare triple {10971#(<= |ULTIMATE.start_foo_~i~0#1| 20)} assume !!(foo_~i~0#1 < 127); {10971#(<= |ULTIMATE.start_foo_~i~0#1| 20)} is VALID [2022-02-20 23:44:09,106 INFO L290 TraceCheckUtils]: 253: Hoare triple {10971#(<= |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 {10971#(<= |ULTIMATE.start_foo_~i~0#1| 20)} is VALID [2022-02-20 23:44:09,106 INFO L290 TraceCheckUtils]: 254: Hoare triple {10971#(<= |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; {10972#(<= |ULTIMATE.start_foo_~i~0#1| 21)} is VALID [2022-02-20 23:44:09,106 INFO L290 TraceCheckUtils]: 255: Hoare triple {10972#(<= |ULTIMATE.start_foo_~i~0#1| 21)} assume !!(foo_~i~0#1 < 127); {10972#(<= |ULTIMATE.start_foo_~i~0#1| 21)} is VALID [2022-02-20 23:44:09,106 INFO L290 TraceCheckUtils]: 256: Hoare triple {10972#(<= |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 {10972#(<= |ULTIMATE.start_foo_~i~0#1| 21)} is VALID [2022-02-20 23:44:09,107 INFO L290 TraceCheckUtils]: 257: Hoare triple {10972#(<= |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; {10973#(<= |ULTIMATE.start_foo_~i~0#1| 22)} is VALID [2022-02-20 23:44:09,107 INFO L290 TraceCheckUtils]: 258: Hoare triple {10973#(<= |ULTIMATE.start_foo_~i~0#1| 22)} assume !!(foo_~i~0#1 < 127); {10973#(<= |ULTIMATE.start_foo_~i~0#1| 22)} is VALID [2022-02-20 23:44:09,107 INFO L290 TraceCheckUtils]: 259: Hoare triple {10973#(<= |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 {10973#(<= |ULTIMATE.start_foo_~i~0#1| 22)} is VALID [2022-02-20 23:44:09,108 INFO L290 TraceCheckUtils]: 260: Hoare triple {10973#(<= |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; {10974#(<= |ULTIMATE.start_foo_~i~0#1| 23)} is VALID [2022-02-20 23:44:09,108 INFO L290 TraceCheckUtils]: 261: Hoare triple {10974#(<= |ULTIMATE.start_foo_~i~0#1| 23)} assume !!(foo_~i~0#1 < 127); {10974#(<= |ULTIMATE.start_foo_~i~0#1| 23)} is VALID [2022-02-20 23:44:09,108 INFO L290 TraceCheckUtils]: 262: Hoare triple {10974#(<= |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 {10974#(<= |ULTIMATE.start_foo_~i~0#1| 23)} is VALID [2022-02-20 23:44:09,108 INFO L290 TraceCheckUtils]: 263: Hoare triple {10974#(<= |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; {10975#(<= |ULTIMATE.start_foo_~i~0#1| 24)} is VALID [2022-02-20 23:44:09,109 INFO L290 TraceCheckUtils]: 264: Hoare triple {10975#(<= |ULTIMATE.start_foo_~i~0#1| 24)} assume !!(foo_~i~0#1 < 127); {10975#(<= |ULTIMATE.start_foo_~i~0#1| 24)} is VALID [2022-02-20 23:44:09,109 INFO L290 TraceCheckUtils]: 265: Hoare triple {10975#(<= |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 {10975#(<= |ULTIMATE.start_foo_~i~0#1| 24)} is VALID [2022-02-20 23:44:09,109 INFO L290 TraceCheckUtils]: 266: Hoare triple {10975#(<= |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; {10976#(<= |ULTIMATE.start_foo_~i~0#1| 25)} is VALID [2022-02-20 23:44:09,110 INFO L290 TraceCheckUtils]: 267: Hoare triple {10976#(<= |ULTIMATE.start_foo_~i~0#1| 25)} assume !!(foo_~i~0#1 < 127); {10976#(<= |ULTIMATE.start_foo_~i~0#1| 25)} is VALID [2022-02-20 23:44:09,110 INFO L290 TraceCheckUtils]: 268: Hoare triple {10976#(<= |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 {10976#(<= |ULTIMATE.start_foo_~i~0#1| 25)} is VALID [2022-02-20 23:44:09,110 INFO L290 TraceCheckUtils]: 269: Hoare triple {10976#(<= |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; {10977#(<= |ULTIMATE.start_foo_~i~0#1| 26)} is VALID [2022-02-20 23:44:09,110 INFO L290 TraceCheckUtils]: 270: Hoare triple {10977#(<= |ULTIMATE.start_foo_~i~0#1| 26)} assume !!(foo_~i~0#1 < 127); {10977#(<= |ULTIMATE.start_foo_~i~0#1| 26)} is VALID [2022-02-20 23:44:09,111 INFO L290 TraceCheckUtils]: 271: Hoare triple {10977#(<= |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 {10977#(<= |ULTIMATE.start_foo_~i~0#1| 26)} is VALID [2022-02-20 23:44:09,111 INFO L290 TraceCheckUtils]: 272: Hoare triple {10977#(<= |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; {10978#(<= |ULTIMATE.start_foo_~i~0#1| 27)} is VALID [2022-02-20 23:44:09,111 INFO L290 TraceCheckUtils]: 273: Hoare triple {10978#(<= |ULTIMATE.start_foo_~i~0#1| 27)} assume !!(foo_~i~0#1 < 127); {10978#(<= |ULTIMATE.start_foo_~i~0#1| 27)} is VALID [2022-02-20 23:44:09,112 INFO L290 TraceCheckUtils]: 274: Hoare triple {10978#(<= |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 {10978#(<= |ULTIMATE.start_foo_~i~0#1| 27)} is VALID [2022-02-20 23:44:09,112 INFO L290 TraceCheckUtils]: 275: Hoare triple {10978#(<= |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; {10979#(<= |ULTIMATE.start_foo_~i~0#1| 28)} is VALID [2022-02-20 23:44:09,112 INFO L290 TraceCheckUtils]: 276: Hoare triple {10979#(<= |ULTIMATE.start_foo_~i~0#1| 28)} assume !!(foo_~i~0#1 < 127); {10979#(<= |ULTIMATE.start_foo_~i~0#1| 28)} is VALID [2022-02-20 23:44:09,112 INFO L290 TraceCheckUtils]: 277: Hoare triple {10979#(<= |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 {10979#(<= |ULTIMATE.start_foo_~i~0#1| 28)} is VALID [2022-02-20 23:44:09,113 INFO L290 TraceCheckUtils]: 278: Hoare triple {10979#(<= |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; {10980#(<= |ULTIMATE.start_foo_~i~0#1| 29)} is VALID [2022-02-20 23:44:09,113 INFO L290 TraceCheckUtils]: 279: Hoare triple {10980#(<= |ULTIMATE.start_foo_~i~0#1| 29)} assume !!(foo_~i~0#1 < 127); {10980#(<= |ULTIMATE.start_foo_~i~0#1| 29)} is VALID [2022-02-20 23:44:09,113 INFO L290 TraceCheckUtils]: 280: Hoare triple {10980#(<= |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 {10980#(<= |ULTIMATE.start_foo_~i~0#1| 29)} is VALID [2022-02-20 23:44:09,114 INFO L290 TraceCheckUtils]: 281: Hoare triple {10980#(<= |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; {10981#(<= |ULTIMATE.start_foo_~i~0#1| 30)} is VALID [2022-02-20 23:44:09,114 INFO L290 TraceCheckUtils]: 282: Hoare triple {10981#(<= |ULTIMATE.start_foo_~i~0#1| 30)} assume !!(foo_~i~0#1 < 127); {10981#(<= |ULTIMATE.start_foo_~i~0#1| 30)} is VALID [2022-02-20 23:44:09,114 INFO L290 TraceCheckUtils]: 283: Hoare triple {10981#(<= |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 {10981#(<= |ULTIMATE.start_foo_~i~0#1| 30)} is VALID [2022-02-20 23:44:09,115 INFO L290 TraceCheckUtils]: 284: Hoare triple {10981#(<= |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; {10982#(<= |ULTIMATE.start_foo_~i~0#1| 31)} is VALID [2022-02-20 23:44:09,115 INFO L290 TraceCheckUtils]: 285: Hoare triple {10982#(<= |ULTIMATE.start_foo_~i~0#1| 31)} assume !(foo_~i~0#1 < 127); {10950#false} is VALID [2022-02-20 23:44:09,115 INFO L290 TraceCheckUtils]: 286: Hoare triple {10950#false} assume { :end_inline_foo } true; {10950#false} is VALID [2022-02-20 23:44:09,115 INFO L290 TraceCheckUtils]: 287: Hoare triple {10950#false} SUMMARY for call main_#t~mem8#1 := read~int(~b~0.base, -4 + ~b~0.offset, 4); srcloc: L540 {10950#false} is VALID [2022-02-20 23:44:09,115 INFO L290 TraceCheckUtils]: 288: Hoare triple {10950#false} assume !(0 != main_#t~mem8#1);havoc main_#t~mem8#1; {10950#false} is VALID [2022-02-20 23:44:09,115 INFO L290 TraceCheckUtils]: 289: Hoare triple {10950#false} assume 0 == ~a~0.offset; {10950#false} is VALID [2022-02-20 23:44:09,115 INFO L290 TraceCheckUtils]: 290: Hoare triple {10950#false} assume ~a~0.base < #StackHeapBarrier; {10950#false} is VALID [2022-02-20 23:44:09,115 INFO L290 TraceCheckUtils]: 291: Hoare triple {10950#false} assume 0 == ~a~0.base || 1 == #valid[~a~0.base];call ULTIMATE.dealloc(~a~0.base, ~a~0.offset); {10950#false} is VALID [2022-02-20 23:44:09,115 INFO L290 TraceCheckUtils]: 292: Hoare triple {10950#false} assume !(0 == ~b~0.offset); {10950#false} is VALID [2022-02-20 23:44:09,117 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:09,117 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:44:09,117 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395850883] [2022-02-20 23:44:09,117 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395850883] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:44:09,117 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217298357] [2022-02-20 23:44:09,117 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 23:44:09,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:44:09,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:44:09,118 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:09,119 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:09,367 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 23:44:09,367 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 23:44:09,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 1116 conjuncts, 65 conjunts are in the unsatisfiable core [2022-02-20 23:44:09,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:09,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:44:12,613 INFO L290 TraceCheckUtils]: 0: Hoare triple {10949#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; {10949#true} is VALID [2022-02-20 23:44:12,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {10949#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 := 128;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; {10989#(<= 128 ~n~0)} is VALID [2022-02-20 23:44:12,617 INFO L290 TraceCheckUtils]: 2: Hoare triple {10989#(<= 128 ~n~0)} SUMMARY for call write~int(0, main_#t~post7#1.base, main_#t~post7#1.offset, 4); srcloc: L538 {10989#(<= 128 ~n~0)} is VALID [2022-02-20 23:44:12,619 INFO L290 TraceCheckUtils]: 3: Hoare triple {10989#(<= 128 ~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; {10996#(and (<= |ULTIMATE.start_foo_~i~0#1| 0) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,620 INFO L290 TraceCheckUtils]: 4: Hoare triple {10996#(and (<= |ULTIMATE.start_foo_~i~0#1| 0) (<= 128 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {10996#(and (<= |ULTIMATE.start_foo_~i~0#1| 0) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,620 INFO L290 TraceCheckUtils]: 5: Hoare triple {10996#(and (<= |ULTIMATE.start_foo_~i~0#1| 0) (<= 128 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {10996#(and (<= |ULTIMATE.start_foo_~i~0#1| 0) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,620 INFO L290 TraceCheckUtils]: 6: Hoare triple {10996#(and (<= |ULTIMATE.start_foo_~i~0#1| 0) (<= 128 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11006#(and (<= |ULTIMATE.start_foo_~i~0#1| 1) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,621 INFO L290 TraceCheckUtils]: 7: Hoare triple {11006#(and (<= |ULTIMATE.start_foo_~i~0#1| 1) (<= 128 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {11006#(and (<= |ULTIMATE.start_foo_~i~0#1| 1) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,621 INFO L290 TraceCheckUtils]: 8: Hoare triple {11006#(and (<= |ULTIMATE.start_foo_~i~0#1| 1) (<= 128 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11006#(and (<= |ULTIMATE.start_foo_~i~0#1| 1) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,622 INFO L290 TraceCheckUtils]: 9: Hoare triple {11006#(and (<= |ULTIMATE.start_foo_~i~0#1| 1) (<= 128 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11016#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 2))} is VALID [2022-02-20 23:44:12,622 INFO L290 TraceCheckUtils]: 10: Hoare triple {11016#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 2))} assume !!(foo_~i~0#1 < ~n~0); {11016#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 2))} is VALID [2022-02-20 23:44:12,622 INFO L290 TraceCheckUtils]: 11: Hoare triple {11016#(and (<= 128 ~n~0) (<= |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 {11016#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 2))} is VALID [2022-02-20 23:44:12,623 INFO L290 TraceCheckUtils]: 12: Hoare triple {11016#(and (<= 128 ~n~0) (<= |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; {11026#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 3))} is VALID [2022-02-20 23:44:12,623 INFO L290 TraceCheckUtils]: 13: Hoare triple {11026#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 3))} assume !!(foo_~i~0#1 < ~n~0); {11026#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 3))} is VALID [2022-02-20 23:44:12,623 INFO L290 TraceCheckUtils]: 14: Hoare triple {11026#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 3))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11026#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 3))} is VALID [2022-02-20 23:44:12,624 INFO L290 TraceCheckUtils]: 15: Hoare triple {11026#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 3))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11036#(and (<= |ULTIMATE.start_foo_~i~0#1| 4) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,624 INFO L290 TraceCheckUtils]: 16: Hoare triple {11036#(and (<= |ULTIMATE.start_foo_~i~0#1| 4) (<= 128 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {11036#(and (<= |ULTIMATE.start_foo_~i~0#1| 4) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,625 INFO L290 TraceCheckUtils]: 17: Hoare triple {11036#(and (<= |ULTIMATE.start_foo_~i~0#1| 4) (<= 128 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11036#(and (<= |ULTIMATE.start_foo_~i~0#1| 4) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,625 INFO L290 TraceCheckUtils]: 18: Hoare triple {11036#(and (<= |ULTIMATE.start_foo_~i~0#1| 4) (<= 128 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11046#(and (<= |ULTIMATE.start_foo_~i~0#1| 5) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,625 INFO L290 TraceCheckUtils]: 19: Hoare triple {11046#(and (<= |ULTIMATE.start_foo_~i~0#1| 5) (<= 128 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {11046#(and (<= |ULTIMATE.start_foo_~i~0#1| 5) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,626 INFO L290 TraceCheckUtils]: 20: Hoare triple {11046#(and (<= |ULTIMATE.start_foo_~i~0#1| 5) (<= 128 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11046#(and (<= |ULTIMATE.start_foo_~i~0#1| 5) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,626 INFO L290 TraceCheckUtils]: 21: Hoare triple {11046#(and (<= |ULTIMATE.start_foo_~i~0#1| 5) (<= 128 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11056#(and (<= |ULTIMATE.start_foo_~i~0#1| 6) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,626 INFO L290 TraceCheckUtils]: 22: Hoare triple {11056#(and (<= |ULTIMATE.start_foo_~i~0#1| 6) (<= 128 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {11056#(and (<= |ULTIMATE.start_foo_~i~0#1| 6) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,627 INFO L290 TraceCheckUtils]: 23: Hoare triple {11056#(and (<= |ULTIMATE.start_foo_~i~0#1| 6) (<= 128 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11056#(and (<= |ULTIMATE.start_foo_~i~0#1| 6) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,627 INFO L290 TraceCheckUtils]: 24: Hoare triple {11056#(and (<= |ULTIMATE.start_foo_~i~0#1| 6) (<= 128 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11066#(and (<= |ULTIMATE.start_foo_~i~0#1| 7) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,628 INFO L290 TraceCheckUtils]: 25: Hoare triple {11066#(and (<= |ULTIMATE.start_foo_~i~0#1| 7) (<= 128 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {11066#(and (<= |ULTIMATE.start_foo_~i~0#1| 7) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,628 INFO L290 TraceCheckUtils]: 26: Hoare triple {11066#(and (<= |ULTIMATE.start_foo_~i~0#1| 7) (<= 128 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11066#(and (<= |ULTIMATE.start_foo_~i~0#1| 7) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,628 INFO L290 TraceCheckUtils]: 27: Hoare triple {11066#(and (<= |ULTIMATE.start_foo_~i~0#1| 7) (<= 128 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11076#(and (<= |ULTIMATE.start_foo_~i~0#1| 8) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,629 INFO L290 TraceCheckUtils]: 28: Hoare triple {11076#(and (<= |ULTIMATE.start_foo_~i~0#1| 8) (<= 128 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {11076#(and (<= |ULTIMATE.start_foo_~i~0#1| 8) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,630 INFO L290 TraceCheckUtils]: 29: Hoare triple {11076#(and (<= |ULTIMATE.start_foo_~i~0#1| 8) (<= 128 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11076#(and (<= |ULTIMATE.start_foo_~i~0#1| 8) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,630 INFO L290 TraceCheckUtils]: 30: Hoare triple {11076#(and (<= |ULTIMATE.start_foo_~i~0#1| 8) (<= 128 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11086#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 9))} is VALID [2022-02-20 23:44:12,631 INFO L290 TraceCheckUtils]: 31: Hoare triple {11086#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 9))} assume !!(foo_~i~0#1 < ~n~0); {11086#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 9))} is VALID [2022-02-20 23:44:12,631 INFO L290 TraceCheckUtils]: 32: Hoare triple {11086#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 9))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11086#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 9))} is VALID [2022-02-20 23:44:12,631 INFO L290 TraceCheckUtils]: 33: Hoare triple {11086#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 9))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11096#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 10))} is VALID [2022-02-20 23:44:12,632 INFO L290 TraceCheckUtils]: 34: Hoare triple {11096#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 10))} assume !!(foo_~i~0#1 < ~n~0); {11096#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 10))} is VALID [2022-02-20 23:44:12,632 INFO L290 TraceCheckUtils]: 35: Hoare triple {11096#(and (<= 128 ~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 {11096#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 10))} is VALID [2022-02-20 23:44:12,632 INFO L290 TraceCheckUtils]: 36: Hoare triple {11096#(and (<= 128 ~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; {11106#(and (<= |ULTIMATE.start_foo_~i~0#1| 11) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,633 INFO L290 TraceCheckUtils]: 37: Hoare triple {11106#(and (<= |ULTIMATE.start_foo_~i~0#1| 11) (<= 128 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {11106#(and (<= |ULTIMATE.start_foo_~i~0#1| 11) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,633 INFO L290 TraceCheckUtils]: 38: Hoare triple {11106#(and (<= |ULTIMATE.start_foo_~i~0#1| 11) (<= 128 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11106#(and (<= |ULTIMATE.start_foo_~i~0#1| 11) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,634 INFO L290 TraceCheckUtils]: 39: Hoare triple {11106#(and (<= |ULTIMATE.start_foo_~i~0#1| 11) (<= 128 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11116#(and (<= |ULTIMATE.start_foo_~i~0#1| 12) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,634 INFO L290 TraceCheckUtils]: 40: Hoare triple {11116#(and (<= |ULTIMATE.start_foo_~i~0#1| 12) (<= 128 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {11116#(and (<= |ULTIMATE.start_foo_~i~0#1| 12) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,634 INFO L290 TraceCheckUtils]: 41: Hoare triple {11116#(and (<= |ULTIMATE.start_foo_~i~0#1| 12) (<= 128 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11116#(and (<= |ULTIMATE.start_foo_~i~0#1| 12) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,635 INFO L290 TraceCheckUtils]: 42: Hoare triple {11116#(and (<= |ULTIMATE.start_foo_~i~0#1| 12) (<= 128 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11126#(and (<= |ULTIMATE.start_foo_~i~0#1| 13) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,635 INFO L290 TraceCheckUtils]: 43: Hoare triple {11126#(and (<= |ULTIMATE.start_foo_~i~0#1| 13) (<= 128 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {11126#(and (<= |ULTIMATE.start_foo_~i~0#1| 13) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,635 INFO L290 TraceCheckUtils]: 44: Hoare triple {11126#(and (<= |ULTIMATE.start_foo_~i~0#1| 13) (<= 128 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11126#(and (<= |ULTIMATE.start_foo_~i~0#1| 13) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,636 INFO L290 TraceCheckUtils]: 45: Hoare triple {11126#(and (<= |ULTIMATE.start_foo_~i~0#1| 13) (<= 128 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11136#(and (<= |ULTIMATE.start_foo_~i~0#1| 14) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,636 INFO L290 TraceCheckUtils]: 46: Hoare triple {11136#(and (<= |ULTIMATE.start_foo_~i~0#1| 14) (<= 128 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {11136#(and (<= |ULTIMATE.start_foo_~i~0#1| 14) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,637 INFO L290 TraceCheckUtils]: 47: Hoare triple {11136#(and (<= |ULTIMATE.start_foo_~i~0#1| 14) (<= 128 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11136#(and (<= |ULTIMATE.start_foo_~i~0#1| 14) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,637 INFO L290 TraceCheckUtils]: 48: Hoare triple {11136#(and (<= |ULTIMATE.start_foo_~i~0#1| 14) (<= 128 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11146#(and (<= |ULTIMATE.start_foo_~i~0#1| 15) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,637 INFO L290 TraceCheckUtils]: 49: Hoare triple {11146#(and (<= |ULTIMATE.start_foo_~i~0#1| 15) (<= 128 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {11146#(and (<= |ULTIMATE.start_foo_~i~0#1| 15) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,638 INFO L290 TraceCheckUtils]: 50: Hoare triple {11146#(and (<= |ULTIMATE.start_foo_~i~0#1| 15) (<= 128 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11146#(and (<= |ULTIMATE.start_foo_~i~0#1| 15) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,638 INFO L290 TraceCheckUtils]: 51: Hoare triple {11146#(and (<= |ULTIMATE.start_foo_~i~0#1| 15) (<= 128 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11156#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 16))} is VALID [2022-02-20 23:44:12,638 INFO L290 TraceCheckUtils]: 52: Hoare triple {11156#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 16))} assume !!(foo_~i~0#1 < ~n~0); {11156#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 16))} is VALID [2022-02-20 23:44:12,639 INFO L290 TraceCheckUtils]: 53: Hoare triple {11156#(and (<= 128 ~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 {11156#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 16))} is VALID [2022-02-20 23:44:12,639 INFO L290 TraceCheckUtils]: 54: Hoare triple {11156#(and (<= 128 ~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; {11166#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 17))} is VALID [2022-02-20 23:44:12,639 INFO L290 TraceCheckUtils]: 55: Hoare triple {11166#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 17))} assume !!(foo_~i~0#1 < ~n~0); {11166#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 17))} is VALID [2022-02-20 23:44:12,640 INFO L290 TraceCheckUtils]: 56: Hoare triple {11166#(and (<= 128 ~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 {11166#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 17))} is VALID [2022-02-20 23:44:12,640 INFO L290 TraceCheckUtils]: 57: Hoare triple {11166#(and (<= 128 ~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; {11176#(and (<= |ULTIMATE.start_foo_~i~0#1| 18) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,641 INFO L290 TraceCheckUtils]: 58: Hoare triple {11176#(and (<= |ULTIMATE.start_foo_~i~0#1| 18) (<= 128 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {11176#(and (<= |ULTIMATE.start_foo_~i~0#1| 18) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,641 INFO L290 TraceCheckUtils]: 59: Hoare triple {11176#(and (<= |ULTIMATE.start_foo_~i~0#1| 18) (<= 128 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11176#(and (<= |ULTIMATE.start_foo_~i~0#1| 18) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,641 INFO L290 TraceCheckUtils]: 60: Hoare triple {11176#(and (<= |ULTIMATE.start_foo_~i~0#1| 18) (<= 128 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11186#(and (<= |ULTIMATE.start_foo_~i~0#1| 19) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,642 INFO L290 TraceCheckUtils]: 61: Hoare triple {11186#(and (<= |ULTIMATE.start_foo_~i~0#1| 19) (<= 128 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {11186#(and (<= |ULTIMATE.start_foo_~i~0#1| 19) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,642 INFO L290 TraceCheckUtils]: 62: Hoare triple {11186#(and (<= |ULTIMATE.start_foo_~i~0#1| 19) (<= 128 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11186#(and (<= |ULTIMATE.start_foo_~i~0#1| 19) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,642 INFO L290 TraceCheckUtils]: 63: Hoare triple {11186#(and (<= |ULTIMATE.start_foo_~i~0#1| 19) (<= 128 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11196#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 20))} is VALID [2022-02-20 23:44:12,643 INFO L290 TraceCheckUtils]: 64: Hoare triple {11196#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 20))} assume !!(foo_~i~0#1 < ~n~0); {11196#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 20))} is VALID [2022-02-20 23:44:12,643 INFO L290 TraceCheckUtils]: 65: Hoare triple {11196#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 20))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11196#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 20))} is VALID [2022-02-20 23:44:12,643 INFO L290 TraceCheckUtils]: 66: Hoare triple {11196#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 20))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11206#(and (<= |ULTIMATE.start_foo_~i~0#1| 21) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,644 INFO L290 TraceCheckUtils]: 67: Hoare triple {11206#(and (<= |ULTIMATE.start_foo_~i~0#1| 21) (<= 128 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {11206#(and (<= |ULTIMATE.start_foo_~i~0#1| 21) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,644 INFO L290 TraceCheckUtils]: 68: Hoare triple {11206#(and (<= |ULTIMATE.start_foo_~i~0#1| 21) (<= 128 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11206#(and (<= |ULTIMATE.start_foo_~i~0#1| 21) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,645 INFO L290 TraceCheckUtils]: 69: Hoare triple {11206#(and (<= |ULTIMATE.start_foo_~i~0#1| 21) (<= 128 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11216#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 22))} is VALID [2022-02-20 23:44:12,645 INFO L290 TraceCheckUtils]: 70: Hoare triple {11216#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 22))} assume !!(foo_~i~0#1 < ~n~0); {11216#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 22))} is VALID [2022-02-20 23:44:12,645 INFO L290 TraceCheckUtils]: 71: Hoare triple {11216#(and (<= 128 ~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 {11216#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 22))} is VALID [2022-02-20 23:44:12,646 INFO L290 TraceCheckUtils]: 72: Hoare triple {11216#(and (<= 128 ~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; {11226#(and (<= |ULTIMATE.start_foo_~i~0#1| 23) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,646 INFO L290 TraceCheckUtils]: 73: Hoare triple {11226#(and (<= |ULTIMATE.start_foo_~i~0#1| 23) (<= 128 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {11226#(and (<= |ULTIMATE.start_foo_~i~0#1| 23) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,647 INFO L290 TraceCheckUtils]: 74: Hoare triple {11226#(and (<= |ULTIMATE.start_foo_~i~0#1| 23) (<= 128 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11226#(and (<= |ULTIMATE.start_foo_~i~0#1| 23) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,647 INFO L290 TraceCheckUtils]: 75: Hoare triple {11226#(and (<= |ULTIMATE.start_foo_~i~0#1| 23) (<= 128 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11236#(and (<= |ULTIMATE.start_foo_~i~0#1| 24) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,647 INFO L290 TraceCheckUtils]: 76: Hoare triple {11236#(and (<= |ULTIMATE.start_foo_~i~0#1| 24) (<= 128 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {11236#(and (<= |ULTIMATE.start_foo_~i~0#1| 24) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,648 INFO L290 TraceCheckUtils]: 77: Hoare triple {11236#(and (<= |ULTIMATE.start_foo_~i~0#1| 24) (<= 128 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11236#(and (<= |ULTIMATE.start_foo_~i~0#1| 24) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,648 INFO L290 TraceCheckUtils]: 78: Hoare triple {11236#(and (<= |ULTIMATE.start_foo_~i~0#1| 24) (<= 128 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11246#(and (<= |ULTIMATE.start_foo_~i~0#1| 25) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,649 INFO L290 TraceCheckUtils]: 79: Hoare triple {11246#(and (<= |ULTIMATE.start_foo_~i~0#1| 25) (<= 128 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {11246#(and (<= |ULTIMATE.start_foo_~i~0#1| 25) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,649 INFO L290 TraceCheckUtils]: 80: Hoare triple {11246#(and (<= |ULTIMATE.start_foo_~i~0#1| 25) (<= 128 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11246#(and (<= |ULTIMATE.start_foo_~i~0#1| 25) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,649 INFO L290 TraceCheckUtils]: 81: Hoare triple {11246#(and (<= |ULTIMATE.start_foo_~i~0#1| 25) (<= 128 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11256#(and (<= |ULTIMATE.start_foo_~i~0#1| 26) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,650 INFO L290 TraceCheckUtils]: 82: Hoare triple {11256#(and (<= |ULTIMATE.start_foo_~i~0#1| 26) (<= 128 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {11256#(and (<= |ULTIMATE.start_foo_~i~0#1| 26) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,650 INFO L290 TraceCheckUtils]: 83: Hoare triple {11256#(and (<= |ULTIMATE.start_foo_~i~0#1| 26) (<= 128 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11256#(and (<= |ULTIMATE.start_foo_~i~0#1| 26) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,650 INFO L290 TraceCheckUtils]: 84: Hoare triple {11256#(and (<= |ULTIMATE.start_foo_~i~0#1| 26) (<= 128 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11266#(and (<= |ULTIMATE.start_foo_~i~0#1| 27) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,651 INFO L290 TraceCheckUtils]: 85: Hoare triple {11266#(and (<= |ULTIMATE.start_foo_~i~0#1| 27) (<= 128 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {11266#(and (<= |ULTIMATE.start_foo_~i~0#1| 27) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,651 INFO L290 TraceCheckUtils]: 86: Hoare triple {11266#(and (<= |ULTIMATE.start_foo_~i~0#1| 27) (<= 128 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11266#(and (<= |ULTIMATE.start_foo_~i~0#1| 27) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,651 INFO L290 TraceCheckUtils]: 87: Hoare triple {11266#(and (<= |ULTIMATE.start_foo_~i~0#1| 27) (<= 128 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11276#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 28))} is VALID [2022-02-20 23:44:12,652 INFO L290 TraceCheckUtils]: 88: Hoare triple {11276#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 28))} assume !!(foo_~i~0#1 < ~n~0); {11276#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 28))} is VALID [2022-02-20 23:44:12,652 INFO L290 TraceCheckUtils]: 89: Hoare triple {11276#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 28))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11276#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 28))} is VALID [2022-02-20 23:44:12,653 INFO L290 TraceCheckUtils]: 90: Hoare triple {11276#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 28))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11286#(and (<= |ULTIMATE.start_foo_~i~0#1| 29) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,653 INFO L290 TraceCheckUtils]: 91: Hoare triple {11286#(and (<= |ULTIMATE.start_foo_~i~0#1| 29) (<= 128 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {11286#(and (<= |ULTIMATE.start_foo_~i~0#1| 29) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,653 INFO L290 TraceCheckUtils]: 92: Hoare triple {11286#(and (<= |ULTIMATE.start_foo_~i~0#1| 29) (<= 128 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11286#(and (<= |ULTIMATE.start_foo_~i~0#1| 29) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,654 INFO L290 TraceCheckUtils]: 93: Hoare triple {11286#(and (<= |ULTIMATE.start_foo_~i~0#1| 29) (<= 128 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11296#(and (<= |ULTIMATE.start_foo_~i~0#1| 30) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,654 INFO L290 TraceCheckUtils]: 94: Hoare triple {11296#(and (<= |ULTIMATE.start_foo_~i~0#1| 30) (<= 128 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {11296#(and (<= |ULTIMATE.start_foo_~i~0#1| 30) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,654 INFO L290 TraceCheckUtils]: 95: Hoare triple {11296#(and (<= |ULTIMATE.start_foo_~i~0#1| 30) (<= 128 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11296#(and (<= |ULTIMATE.start_foo_~i~0#1| 30) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,655 INFO L290 TraceCheckUtils]: 96: Hoare triple {11296#(and (<= |ULTIMATE.start_foo_~i~0#1| 30) (<= 128 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11306#(and (<= |ULTIMATE.start_foo_~i~0#1| 31) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,655 INFO L290 TraceCheckUtils]: 97: Hoare triple {11306#(and (<= |ULTIMATE.start_foo_~i~0#1| 31) (<= 128 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {11306#(and (<= |ULTIMATE.start_foo_~i~0#1| 31) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,656 INFO L290 TraceCheckUtils]: 98: Hoare triple {11306#(and (<= |ULTIMATE.start_foo_~i~0#1| 31) (<= 128 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11306#(and (<= |ULTIMATE.start_foo_~i~0#1| 31) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,656 INFO L290 TraceCheckUtils]: 99: Hoare triple {11306#(and (<= |ULTIMATE.start_foo_~i~0#1| 31) (<= 128 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11316#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 32))} is VALID [2022-02-20 23:44:12,656 INFO L290 TraceCheckUtils]: 100: Hoare triple {11316#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 32))} assume !!(foo_~i~0#1 < ~n~0); {11316#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 32))} is VALID [2022-02-20 23:44:12,657 INFO L290 TraceCheckUtils]: 101: Hoare triple {11316#(and (<= 128 ~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 {11316#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 32))} is VALID [2022-02-20 23:44:12,657 INFO L290 TraceCheckUtils]: 102: Hoare triple {11316#(and (<= 128 ~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; {11326#(and (<= |ULTIMATE.start_foo_~i~0#1| 33) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,657 INFO L290 TraceCheckUtils]: 103: Hoare triple {11326#(and (<= |ULTIMATE.start_foo_~i~0#1| 33) (<= 128 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {11326#(and (<= |ULTIMATE.start_foo_~i~0#1| 33) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,658 INFO L290 TraceCheckUtils]: 104: Hoare triple {11326#(and (<= |ULTIMATE.start_foo_~i~0#1| 33) (<= 128 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11326#(and (<= |ULTIMATE.start_foo_~i~0#1| 33) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,658 INFO L290 TraceCheckUtils]: 105: Hoare triple {11326#(and (<= |ULTIMATE.start_foo_~i~0#1| 33) (<= 128 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11336#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 34))} is VALID [2022-02-20 23:44:12,658 INFO L290 TraceCheckUtils]: 106: Hoare triple {11336#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 34))} assume !!(foo_~i~0#1 < ~n~0); {11336#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 34))} is VALID [2022-02-20 23:44:12,659 INFO L290 TraceCheckUtils]: 107: Hoare triple {11336#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 34))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11336#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 34))} is VALID [2022-02-20 23:44:12,659 INFO L290 TraceCheckUtils]: 108: Hoare triple {11336#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 34))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11346#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 35))} is VALID [2022-02-20 23:44:12,660 INFO L290 TraceCheckUtils]: 109: Hoare triple {11346#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 35))} assume !!(foo_~i~0#1 < ~n~0); {11346#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 35))} is VALID [2022-02-20 23:44:12,660 INFO L290 TraceCheckUtils]: 110: Hoare triple {11346#(and (<= 128 ~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 {11346#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 35))} is VALID [2022-02-20 23:44:12,660 INFO L290 TraceCheckUtils]: 111: Hoare triple {11346#(and (<= 128 ~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; {11356#(and (<= |ULTIMATE.start_foo_~i~0#1| 36) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,661 INFO L290 TraceCheckUtils]: 112: Hoare triple {11356#(and (<= |ULTIMATE.start_foo_~i~0#1| 36) (<= 128 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {11356#(and (<= |ULTIMATE.start_foo_~i~0#1| 36) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,661 INFO L290 TraceCheckUtils]: 113: Hoare triple {11356#(and (<= |ULTIMATE.start_foo_~i~0#1| 36) (<= 128 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11356#(and (<= |ULTIMATE.start_foo_~i~0#1| 36) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,661 INFO L290 TraceCheckUtils]: 114: Hoare triple {11356#(and (<= |ULTIMATE.start_foo_~i~0#1| 36) (<= 128 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11366#(and (<= |ULTIMATE.start_foo_~i~0#1| 37) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,662 INFO L290 TraceCheckUtils]: 115: Hoare triple {11366#(and (<= |ULTIMATE.start_foo_~i~0#1| 37) (<= 128 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {11366#(and (<= |ULTIMATE.start_foo_~i~0#1| 37) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,662 INFO L290 TraceCheckUtils]: 116: Hoare triple {11366#(and (<= |ULTIMATE.start_foo_~i~0#1| 37) (<= 128 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11366#(and (<= |ULTIMATE.start_foo_~i~0#1| 37) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,662 INFO L290 TraceCheckUtils]: 117: Hoare triple {11366#(and (<= |ULTIMATE.start_foo_~i~0#1| 37) (<= 128 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11376#(and (<= |ULTIMATE.start_foo_~i~0#1| 38) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,663 INFO L290 TraceCheckUtils]: 118: Hoare triple {11376#(and (<= |ULTIMATE.start_foo_~i~0#1| 38) (<= 128 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {11376#(and (<= |ULTIMATE.start_foo_~i~0#1| 38) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,663 INFO L290 TraceCheckUtils]: 119: Hoare triple {11376#(and (<= |ULTIMATE.start_foo_~i~0#1| 38) (<= 128 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11376#(and (<= |ULTIMATE.start_foo_~i~0#1| 38) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,664 INFO L290 TraceCheckUtils]: 120: Hoare triple {11376#(and (<= |ULTIMATE.start_foo_~i~0#1| 38) (<= 128 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11386#(and (<= |ULTIMATE.start_foo_~i~0#1| 39) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,664 INFO L290 TraceCheckUtils]: 121: Hoare triple {11386#(and (<= |ULTIMATE.start_foo_~i~0#1| 39) (<= 128 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {11386#(and (<= |ULTIMATE.start_foo_~i~0#1| 39) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,664 INFO L290 TraceCheckUtils]: 122: Hoare triple {11386#(and (<= |ULTIMATE.start_foo_~i~0#1| 39) (<= 128 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11386#(and (<= |ULTIMATE.start_foo_~i~0#1| 39) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,665 INFO L290 TraceCheckUtils]: 123: Hoare triple {11386#(and (<= |ULTIMATE.start_foo_~i~0#1| 39) (<= 128 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11396#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 40))} is VALID [2022-02-20 23:44:12,665 INFO L290 TraceCheckUtils]: 124: Hoare triple {11396#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 40))} assume !!(foo_~i~0#1 < ~n~0); {11396#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 40))} is VALID [2022-02-20 23:44:12,665 INFO L290 TraceCheckUtils]: 125: Hoare triple {11396#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 40))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11396#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 40))} is VALID [2022-02-20 23:44:12,666 INFO L290 TraceCheckUtils]: 126: Hoare triple {11396#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 40))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11406#(and (<= |ULTIMATE.start_foo_~i~0#1| 41) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,666 INFO L290 TraceCheckUtils]: 127: Hoare triple {11406#(and (<= |ULTIMATE.start_foo_~i~0#1| 41) (<= 128 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {11406#(and (<= |ULTIMATE.start_foo_~i~0#1| 41) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,667 INFO L290 TraceCheckUtils]: 128: Hoare triple {11406#(and (<= |ULTIMATE.start_foo_~i~0#1| 41) (<= 128 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11406#(and (<= |ULTIMATE.start_foo_~i~0#1| 41) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,667 INFO L290 TraceCheckUtils]: 129: Hoare triple {11406#(and (<= |ULTIMATE.start_foo_~i~0#1| 41) (<= 128 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11416#(and (<= |ULTIMATE.start_foo_~i~0#1| 42) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,667 INFO L290 TraceCheckUtils]: 130: Hoare triple {11416#(and (<= |ULTIMATE.start_foo_~i~0#1| 42) (<= 128 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {11416#(and (<= |ULTIMATE.start_foo_~i~0#1| 42) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,668 INFO L290 TraceCheckUtils]: 131: Hoare triple {11416#(and (<= |ULTIMATE.start_foo_~i~0#1| 42) (<= 128 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11416#(and (<= |ULTIMATE.start_foo_~i~0#1| 42) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,668 INFO L290 TraceCheckUtils]: 132: Hoare triple {11416#(and (<= |ULTIMATE.start_foo_~i~0#1| 42) (<= 128 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11426#(and (<= |ULTIMATE.start_foo_~i~0#1| 43) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,668 INFO L290 TraceCheckUtils]: 133: Hoare triple {11426#(and (<= |ULTIMATE.start_foo_~i~0#1| 43) (<= 128 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {11426#(and (<= |ULTIMATE.start_foo_~i~0#1| 43) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,669 INFO L290 TraceCheckUtils]: 134: Hoare triple {11426#(and (<= |ULTIMATE.start_foo_~i~0#1| 43) (<= 128 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11426#(and (<= |ULTIMATE.start_foo_~i~0#1| 43) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,669 INFO L290 TraceCheckUtils]: 135: Hoare triple {11426#(and (<= |ULTIMATE.start_foo_~i~0#1| 43) (<= 128 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11436#(and (<= |ULTIMATE.start_foo_~i~0#1| 44) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,669 INFO L290 TraceCheckUtils]: 136: Hoare triple {11436#(and (<= |ULTIMATE.start_foo_~i~0#1| 44) (<= 128 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {11436#(and (<= |ULTIMATE.start_foo_~i~0#1| 44) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,670 INFO L290 TraceCheckUtils]: 137: Hoare triple {11436#(and (<= |ULTIMATE.start_foo_~i~0#1| 44) (<= 128 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11436#(and (<= |ULTIMATE.start_foo_~i~0#1| 44) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,670 INFO L290 TraceCheckUtils]: 138: Hoare triple {11436#(and (<= |ULTIMATE.start_foo_~i~0#1| 44) (<= 128 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11446#(and (<= |ULTIMATE.start_foo_~i~0#1| 45) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,671 INFO L290 TraceCheckUtils]: 139: Hoare triple {11446#(and (<= |ULTIMATE.start_foo_~i~0#1| 45) (<= 128 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {11446#(and (<= |ULTIMATE.start_foo_~i~0#1| 45) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,671 INFO L290 TraceCheckUtils]: 140: Hoare triple {11446#(and (<= |ULTIMATE.start_foo_~i~0#1| 45) (<= 128 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11446#(and (<= |ULTIMATE.start_foo_~i~0#1| 45) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,671 INFO L290 TraceCheckUtils]: 141: Hoare triple {11446#(and (<= |ULTIMATE.start_foo_~i~0#1| 45) (<= 128 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11456#(and (<= |ULTIMATE.start_foo_~i~0#1| 46) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,672 INFO L290 TraceCheckUtils]: 142: Hoare triple {11456#(and (<= |ULTIMATE.start_foo_~i~0#1| 46) (<= 128 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {11456#(and (<= |ULTIMATE.start_foo_~i~0#1| 46) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,672 INFO L290 TraceCheckUtils]: 143: Hoare triple {11456#(and (<= |ULTIMATE.start_foo_~i~0#1| 46) (<= 128 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11456#(and (<= |ULTIMATE.start_foo_~i~0#1| 46) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,672 INFO L290 TraceCheckUtils]: 144: Hoare triple {11456#(and (<= |ULTIMATE.start_foo_~i~0#1| 46) (<= 128 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11466#(and (<= |ULTIMATE.start_foo_~i~0#1| 47) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,673 INFO L290 TraceCheckUtils]: 145: Hoare triple {11466#(and (<= |ULTIMATE.start_foo_~i~0#1| 47) (<= 128 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {11466#(and (<= |ULTIMATE.start_foo_~i~0#1| 47) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,673 INFO L290 TraceCheckUtils]: 146: Hoare triple {11466#(and (<= |ULTIMATE.start_foo_~i~0#1| 47) (<= 128 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11466#(and (<= |ULTIMATE.start_foo_~i~0#1| 47) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,673 INFO L290 TraceCheckUtils]: 147: Hoare triple {11466#(and (<= |ULTIMATE.start_foo_~i~0#1| 47) (<= 128 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11476#(and (<= |ULTIMATE.start_foo_~i~0#1| 48) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,674 INFO L290 TraceCheckUtils]: 148: Hoare triple {11476#(and (<= |ULTIMATE.start_foo_~i~0#1| 48) (<= 128 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {11476#(and (<= |ULTIMATE.start_foo_~i~0#1| 48) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,674 INFO L290 TraceCheckUtils]: 149: Hoare triple {11476#(and (<= |ULTIMATE.start_foo_~i~0#1| 48) (<= 128 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11476#(and (<= |ULTIMATE.start_foo_~i~0#1| 48) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,675 INFO L290 TraceCheckUtils]: 150: Hoare triple {11476#(and (<= |ULTIMATE.start_foo_~i~0#1| 48) (<= 128 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11486#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 49))} is VALID [2022-02-20 23:44:12,675 INFO L290 TraceCheckUtils]: 151: Hoare triple {11486#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 49))} assume !!(foo_~i~0#1 < ~n~0); {11486#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 49))} is VALID [2022-02-20 23:44:12,675 INFO L290 TraceCheckUtils]: 152: Hoare triple {11486#(and (<= 128 ~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 {11486#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 49))} is VALID [2022-02-20 23:44:12,676 INFO L290 TraceCheckUtils]: 153: Hoare triple {11486#(and (<= 128 ~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; {11496#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 50))} is VALID [2022-02-20 23:44:12,676 INFO L290 TraceCheckUtils]: 154: Hoare triple {11496#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 50))} assume !!(foo_~i~0#1 < ~n~0); {11496#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 50))} is VALID [2022-02-20 23:44:12,676 INFO L290 TraceCheckUtils]: 155: Hoare triple {11496#(and (<= 128 ~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 {11496#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 50))} is VALID [2022-02-20 23:44:12,677 INFO L290 TraceCheckUtils]: 156: Hoare triple {11496#(and (<= 128 ~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; {11506#(and (<= |ULTIMATE.start_foo_~i~0#1| 51) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,677 INFO L290 TraceCheckUtils]: 157: Hoare triple {11506#(and (<= |ULTIMATE.start_foo_~i~0#1| 51) (<= 128 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {11506#(and (<= |ULTIMATE.start_foo_~i~0#1| 51) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,678 INFO L290 TraceCheckUtils]: 158: Hoare triple {11506#(and (<= |ULTIMATE.start_foo_~i~0#1| 51) (<= 128 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11506#(and (<= |ULTIMATE.start_foo_~i~0#1| 51) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,678 INFO L290 TraceCheckUtils]: 159: Hoare triple {11506#(and (<= |ULTIMATE.start_foo_~i~0#1| 51) (<= 128 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11516#(and (<= |ULTIMATE.start_foo_~i~0#1| 52) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,678 INFO L290 TraceCheckUtils]: 160: Hoare triple {11516#(and (<= |ULTIMATE.start_foo_~i~0#1| 52) (<= 128 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {11516#(and (<= |ULTIMATE.start_foo_~i~0#1| 52) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,679 INFO L290 TraceCheckUtils]: 161: Hoare triple {11516#(and (<= |ULTIMATE.start_foo_~i~0#1| 52) (<= 128 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11516#(and (<= |ULTIMATE.start_foo_~i~0#1| 52) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,679 INFO L290 TraceCheckUtils]: 162: Hoare triple {11516#(and (<= |ULTIMATE.start_foo_~i~0#1| 52) (<= 128 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11526#(and (<= |ULTIMATE.start_foo_~i~0#1| 53) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,679 INFO L290 TraceCheckUtils]: 163: Hoare triple {11526#(and (<= |ULTIMATE.start_foo_~i~0#1| 53) (<= 128 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {11526#(and (<= |ULTIMATE.start_foo_~i~0#1| 53) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,680 INFO L290 TraceCheckUtils]: 164: Hoare triple {11526#(and (<= |ULTIMATE.start_foo_~i~0#1| 53) (<= 128 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11526#(and (<= |ULTIMATE.start_foo_~i~0#1| 53) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,680 INFO L290 TraceCheckUtils]: 165: Hoare triple {11526#(and (<= |ULTIMATE.start_foo_~i~0#1| 53) (<= 128 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11536#(and (<= |ULTIMATE.start_foo_~i~0#1| 54) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,680 INFO L290 TraceCheckUtils]: 166: Hoare triple {11536#(and (<= |ULTIMATE.start_foo_~i~0#1| 54) (<= 128 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {11536#(and (<= |ULTIMATE.start_foo_~i~0#1| 54) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,681 INFO L290 TraceCheckUtils]: 167: Hoare triple {11536#(and (<= |ULTIMATE.start_foo_~i~0#1| 54) (<= 128 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11536#(and (<= |ULTIMATE.start_foo_~i~0#1| 54) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,681 INFO L290 TraceCheckUtils]: 168: Hoare triple {11536#(and (<= |ULTIMATE.start_foo_~i~0#1| 54) (<= 128 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11546#(and (<= |ULTIMATE.start_foo_~i~0#1| 55) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,682 INFO L290 TraceCheckUtils]: 169: Hoare triple {11546#(and (<= |ULTIMATE.start_foo_~i~0#1| 55) (<= 128 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {11546#(and (<= |ULTIMATE.start_foo_~i~0#1| 55) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,682 INFO L290 TraceCheckUtils]: 170: Hoare triple {11546#(and (<= |ULTIMATE.start_foo_~i~0#1| 55) (<= 128 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11546#(and (<= |ULTIMATE.start_foo_~i~0#1| 55) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,682 INFO L290 TraceCheckUtils]: 171: Hoare triple {11546#(and (<= |ULTIMATE.start_foo_~i~0#1| 55) (<= 128 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11556#(and (<= |ULTIMATE.start_foo_~i~0#1| 56) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,683 INFO L290 TraceCheckUtils]: 172: Hoare triple {11556#(and (<= |ULTIMATE.start_foo_~i~0#1| 56) (<= 128 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {11556#(and (<= |ULTIMATE.start_foo_~i~0#1| 56) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,683 INFO L290 TraceCheckUtils]: 173: Hoare triple {11556#(and (<= |ULTIMATE.start_foo_~i~0#1| 56) (<= 128 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11556#(and (<= |ULTIMATE.start_foo_~i~0#1| 56) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,683 INFO L290 TraceCheckUtils]: 174: Hoare triple {11556#(and (<= |ULTIMATE.start_foo_~i~0#1| 56) (<= 128 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11566#(and (<= |ULTIMATE.start_foo_~i~0#1| 57) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,684 INFO L290 TraceCheckUtils]: 175: Hoare triple {11566#(and (<= |ULTIMATE.start_foo_~i~0#1| 57) (<= 128 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {11566#(and (<= |ULTIMATE.start_foo_~i~0#1| 57) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,684 INFO L290 TraceCheckUtils]: 176: Hoare triple {11566#(and (<= |ULTIMATE.start_foo_~i~0#1| 57) (<= 128 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11566#(and (<= |ULTIMATE.start_foo_~i~0#1| 57) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,684 INFO L290 TraceCheckUtils]: 177: Hoare triple {11566#(and (<= |ULTIMATE.start_foo_~i~0#1| 57) (<= 128 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11576#(and (<= |ULTIMATE.start_foo_~i~0#1| 58) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,685 INFO L290 TraceCheckUtils]: 178: Hoare triple {11576#(and (<= |ULTIMATE.start_foo_~i~0#1| 58) (<= 128 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {11576#(and (<= |ULTIMATE.start_foo_~i~0#1| 58) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,685 INFO L290 TraceCheckUtils]: 179: Hoare triple {11576#(and (<= |ULTIMATE.start_foo_~i~0#1| 58) (<= 128 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11576#(and (<= |ULTIMATE.start_foo_~i~0#1| 58) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,686 INFO L290 TraceCheckUtils]: 180: Hoare triple {11576#(and (<= |ULTIMATE.start_foo_~i~0#1| 58) (<= 128 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11586#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 59))} is VALID [2022-02-20 23:44:12,686 INFO L290 TraceCheckUtils]: 181: Hoare triple {11586#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 59))} assume !!(foo_~i~0#1 < ~n~0); {11586#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 59))} is VALID [2022-02-20 23:44:12,686 INFO L290 TraceCheckUtils]: 182: Hoare triple {11586#(and (<= 128 ~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 {11586#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 59))} is VALID [2022-02-20 23:44:12,687 INFO L290 TraceCheckUtils]: 183: Hoare triple {11586#(and (<= 128 ~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; {11596#(and (<= |ULTIMATE.start_foo_~i~0#1| 60) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,687 INFO L290 TraceCheckUtils]: 184: Hoare triple {11596#(and (<= |ULTIMATE.start_foo_~i~0#1| 60) (<= 128 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {11596#(and (<= |ULTIMATE.start_foo_~i~0#1| 60) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,687 INFO L290 TraceCheckUtils]: 185: Hoare triple {11596#(and (<= |ULTIMATE.start_foo_~i~0#1| 60) (<= 128 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11596#(and (<= |ULTIMATE.start_foo_~i~0#1| 60) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,688 INFO L290 TraceCheckUtils]: 186: Hoare triple {11596#(and (<= |ULTIMATE.start_foo_~i~0#1| 60) (<= 128 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11606#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 61))} is VALID [2022-02-20 23:44:12,688 INFO L290 TraceCheckUtils]: 187: Hoare triple {11606#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 61))} assume !!(foo_~i~0#1 < ~n~0); {11606#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 61))} is VALID [2022-02-20 23:44:12,688 INFO L290 TraceCheckUtils]: 188: Hoare triple {11606#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 61))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {11606#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 61))} is VALID [2022-02-20 23:44:12,689 INFO L290 TraceCheckUtils]: 189: Hoare triple {11606#(and (<= 128 ~n~0) (<= |ULTIMATE.start_foo_~i~0#1| 61))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {11616#(and (<= |ULTIMATE.start_foo_~i~0#1| 62) (<= 128 ~n~0))} is VALID [2022-02-20 23:44:12,689 INFO L290 TraceCheckUtils]: 190: Hoare triple {11616#(and (<= |ULTIMATE.start_foo_~i~0#1| 62) (<= 128 ~n~0))} assume !(foo_~i~0#1 < ~n~0); {10950#false} is VALID [2022-02-20 23:44:12,689 INFO L290 TraceCheckUtils]: 191: Hoare triple {10950#false} foo_~i~0#1 := 0; {10950#false} is VALID [2022-02-20 23:44:12,689 INFO L290 TraceCheckUtils]: 192: Hoare triple {10950#false} assume !!(foo_~i~0#1 < 127); {10950#false} is VALID [2022-02-20 23:44:12,689 INFO L290 TraceCheckUtils]: 193: Hoare triple {10950#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {10950#false} is VALID [2022-02-20 23:44:12,689 INFO L290 TraceCheckUtils]: 194: Hoare triple {10950#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {10950#false} is VALID [2022-02-20 23:44:12,689 INFO L290 TraceCheckUtils]: 195: Hoare triple {10950#false} assume !!(foo_~i~0#1 < 127); {10950#false} is VALID [2022-02-20 23:44:12,690 INFO L290 TraceCheckUtils]: 196: Hoare triple {10950#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {10950#false} is VALID [2022-02-20 23:44:12,690 INFO L290 TraceCheckUtils]: 197: Hoare triple {10950#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {10950#false} is VALID [2022-02-20 23:44:12,690 INFO L290 TraceCheckUtils]: 198: Hoare triple {10950#false} assume !!(foo_~i~0#1 < 127); {10950#false} is VALID [2022-02-20 23:44:12,690 INFO L290 TraceCheckUtils]: 199: Hoare triple {10950#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {10950#false} is VALID [2022-02-20 23:44:12,690 INFO L290 TraceCheckUtils]: 200: Hoare triple {10950#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {10950#false} is VALID [2022-02-20 23:44:12,690 INFO L290 TraceCheckUtils]: 201: Hoare triple {10950#false} assume !!(foo_~i~0#1 < 127); {10950#false} is VALID [2022-02-20 23:44:12,690 INFO L290 TraceCheckUtils]: 202: Hoare triple {10950#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {10950#false} is VALID [2022-02-20 23:44:12,690 INFO L290 TraceCheckUtils]: 203: Hoare triple {10950#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {10950#false} is VALID [2022-02-20 23:44:12,690 INFO L290 TraceCheckUtils]: 204: Hoare triple {10950#false} assume !!(foo_~i~0#1 < 127); {10950#false} is VALID [2022-02-20 23:44:12,690 INFO L290 TraceCheckUtils]: 205: Hoare triple {10950#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {10950#false} is VALID [2022-02-20 23:44:12,690 INFO L290 TraceCheckUtils]: 206: Hoare triple {10950#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {10950#false} is VALID [2022-02-20 23:44:12,690 INFO L290 TraceCheckUtils]: 207: Hoare triple {10950#false} assume !!(foo_~i~0#1 < 127); {10950#false} is VALID [2022-02-20 23:44:12,690 INFO L290 TraceCheckUtils]: 208: Hoare triple {10950#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {10950#false} is VALID [2022-02-20 23:44:12,690 INFO L290 TraceCheckUtils]: 209: Hoare triple {10950#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {10950#false} is VALID [2022-02-20 23:44:12,690 INFO L290 TraceCheckUtils]: 210: Hoare triple {10950#false} assume !!(foo_~i~0#1 < 127); {10950#false} is VALID [2022-02-20 23:44:12,690 INFO L290 TraceCheckUtils]: 211: Hoare triple {10950#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {10950#false} is VALID [2022-02-20 23:44:12,690 INFO L290 TraceCheckUtils]: 212: Hoare triple {10950#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {10950#false} is VALID [2022-02-20 23:44:12,690 INFO L290 TraceCheckUtils]: 213: Hoare triple {10950#false} assume !!(foo_~i~0#1 < 127); {10950#false} is VALID [2022-02-20 23:44:12,690 INFO L290 TraceCheckUtils]: 214: Hoare triple {10950#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {10950#false} is VALID [2022-02-20 23:44:12,690 INFO L290 TraceCheckUtils]: 215: Hoare triple {10950#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {10950#false} is VALID [2022-02-20 23:44:12,690 INFO L290 TraceCheckUtils]: 216: Hoare triple {10950#false} assume !!(foo_~i~0#1 < 127); {10950#false} is VALID [2022-02-20 23:44:12,690 INFO L290 TraceCheckUtils]: 217: Hoare triple {10950#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {10950#false} is VALID [2022-02-20 23:44:12,690 INFO L290 TraceCheckUtils]: 218: Hoare triple {10950#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {10950#false} is VALID [2022-02-20 23:44:12,691 INFO L290 TraceCheckUtils]: 219: Hoare triple {10950#false} assume !!(foo_~i~0#1 < 127); {10950#false} is VALID [2022-02-20 23:44:12,691 INFO L290 TraceCheckUtils]: 220: Hoare triple {10950#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {10950#false} is VALID [2022-02-20 23:44:12,691 INFO L290 TraceCheckUtils]: 221: Hoare triple {10950#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {10950#false} is VALID [2022-02-20 23:44:12,691 INFO L290 TraceCheckUtils]: 222: Hoare triple {10950#false} assume !!(foo_~i~0#1 < 127); {10950#false} is VALID [2022-02-20 23:44:12,691 INFO L290 TraceCheckUtils]: 223: Hoare triple {10950#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {10950#false} is VALID [2022-02-20 23:44:12,691 INFO L290 TraceCheckUtils]: 224: Hoare triple {10950#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {10950#false} is VALID [2022-02-20 23:44:12,691 INFO L290 TraceCheckUtils]: 225: Hoare triple {10950#false} assume !!(foo_~i~0#1 < 127); {10950#false} is VALID [2022-02-20 23:44:12,691 INFO L290 TraceCheckUtils]: 226: Hoare triple {10950#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {10950#false} is VALID [2022-02-20 23:44:12,691 INFO L290 TraceCheckUtils]: 227: Hoare triple {10950#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {10950#false} is VALID [2022-02-20 23:44:12,691 INFO L290 TraceCheckUtils]: 228: Hoare triple {10950#false} assume !!(foo_~i~0#1 < 127); {10950#false} is VALID [2022-02-20 23:44:12,691 INFO L290 TraceCheckUtils]: 229: Hoare triple {10950#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {10950#false} is VALID [2022-02-20 23:44:12,691 INFO L290 TraceCheckUtils]: 230: Hoare triple {10950#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {10950#false} is VALID [2022-02-20 23:44:12,691 INFO L290 TraceCheckUtils]: 231: Hoare triple {10950#false} assume !!(foo_~i~0#1 < 127); {10950#false} is VALID [2022-02-20 23:44:12,691 INFO L290 TraceCheckUtils]: 232: Hoare triple {10950#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {10950#false} is VALID [2022-02-20 23:44:12,691 INFO L290 TraceCheckUtils]: 233: Hoare triple {10950#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {10950#false} is VALID [2022-02-20 23:44:12,691 INFO L290 TraceCheckUtils]: 234: Hoare triple {10950#false} assume !!(foo_~i~0#1 < 127); {10950#false} is VALID [2022-02-20 23:44:12,691 INFO L290 TraceCheckUtils]: 235: Hoare triple {10950#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {10950#false} is VALID [2022-02-20 23:44:12,691 INFO L290 TraceCheckUtils]: 236: Hoare triple {10950#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {10950#false} is VALID [2022-02-20 23:44:12,691 INFO L290 TraceCheckUtils]: 237: Hoare triple {10950#false} assume !!(foo_~i~0#1 < 127); {10950#false} is VALID [2022-02-20 23:44:12,691 INFO L290 TraceCheckUtils]: 238: Hoare triple {10950#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {10950#false} is VALID [2022-02-20 23:44:12,691 INFO L290 TraceCheckUtils]: 239: Hoare triple {10950#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {10950#false} is VALID [2022-02-20 23:44:12,691 INFO L290 TraceCheckUtils]: 240: Hoare triple {10950#false} assume !!(foo_~i~0#1 < 127); {10950#false} is VALID [2022-02-20 23:44:12,691 INFO L290 TraceCheckUtils]: 241: Hoare triple {10950#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {10950#false} is VALID [2022-02-20 23:44:12,692 INFO L290 TraceCheckUtils]: 242: Hoare triple {10950#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {10950#false} is VALID [2022-02-20 23:44:12,692 INFO L290 TraceCheckUtils]: 243: Hoare triple {10950#false} assume !!(foo_~i~0#1 < 127); {10950#false} is VALID [2022-02-20 23:44:12,692 INFO L290 TraceCheckUtils]: 244: Hoare triple {10950#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {10950#false} is VALID [2022-02-20 23:44:12,692 INFO L290 TraceCheckUtils]: 245: Hoare triple {10950#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {10950#false} is VALID [2022-02-20 23:44:12,692 INFO L290 TraceCheckUtils]: 246: Hoare triple {10950#false} assume !!(foo_~i~0#1 < 127); {10950#false} is VALID [2022-02-20 23:44:12,692 INFO L290 TraceCheckUtils]: 247: Hoare triple {10950#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {10950#false} is VALID [2022-02-20 23:44:12,692 INFO L290 TraceCheckUtils]: 248: Hoare triple {10950#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {10950#false} is VALID [2022-02-20 23:44:12,692 INFO L290 TraceCheckUtils]: 249: Hoare triple {10950#false} assume !!(foo_~i~0#1 < 127); {10950#false} is VALID [2022-02-20 23:44:12,692 INFO L290 TraceCheckUtils]: 250: Hoare triple {10950#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {10950#false} is VALID [2022-02-20 23:44:12,692 INFO L290 TraceCheckUtils]: 251: Hoare triple {10950#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {10950#false} is VALID [2022-02-20 23:44:12,692 INFO L290 TraceCheckUtils]: 252: Hoare triple {10950#false} assume !!(foo_~i~0#1 < 127); {10950#false} is VALID [2022-02-20 23:44:12,692 INFO L290 TraceCheckUtils]: 253: Hoare triple {10950#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {10950#false} is VALID [2022-02-20 23:44:12,692 INFO L290 TraceCheckUtils]: 254: Hoare triple {10950#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {10950#false} is VALID [2022-02-20 23:44:12,699 INFO L290 TraceCheckUtils]: 255: Hoare triple {10950#false} assume !!(foo_~i~0#1 < 127); {10950#false} is VALID [2022-02-20 23:44:12,699 INFO L290 TraceCheckUtils]: 256: Hoare triple {10950#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {10950#false} is VALID [2022-02-20 23:44:12,699 INFO L290 TraceCheckUtils]: 257: Hoare triple {10950#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {10950#false} is VALID [2022-02-20 23:44:12,699 INFO L290 TraceCheckUtils]: 258: Hoare triple {10950#false} assume !!(foo_~i~0#1 < 127); {10950#false} is VALID [2022-02-20 23:44:12,699 INFO L290 TraceCheckUtils]: 259: Hoare triple {10950#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {10950#false} is VALID [2022-02-20 23:44:12,699 INFO L290 TraceCheckUtils]: 260: Hoare triple {10950#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {10950#false} is VALID [2022-02-20 23:44:12,699 INFO L290 TraceCheckUtils]: 261: Hoare triple {10950#false} assume !!(foo_~i~0#1 < 127); {10950#false} is VALID [2022-02-20 23:44:12,699 INFO L290 TraceCheckUtils]: 262: Hoare triple {10950#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {10950#false} is VALID [2022-02-20 23:44:12,700 INFO L290 TraceCheckUtils]: 263: Hoare triple {10950#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {10950#false} is VALID [2022-02-20 23:44:12,700 INFO L290 TraceCheckUtils]: 264: Hoare triple {10950#false} assume !!(foo_~i~0#1 < 127); {10950#false} is VALID [2022-02-20 23:44:12,700 INFO L290 TraceCheckUtils]: 265: Hoare triple {10950#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {10950#false} is VALID [2022-02-20 23:44:12,700 INFO L290 TraceCheckUtils]: 266: Hoare triple {10950#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {10950#false} is VALID [2022-02-20 23:44:12,700 INFO L290 TraceCheckUtils]: 267: Hoare triple {10950#false} assume !!(foo_~i~0#1 < 127); {10950#false} is VALID [2022-02-20 23:44:12,700 INFO L290 TraceCheckUtils]: 268: Hoare triple {10950#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {10950#false} is VALID [2022-02-20 23:44:12,700 INFO L290 TraceCheckUtils]: 269: Hoare triple {10950#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {10950#false} is VALID [2022-02-20 23:44:12,700 INFO L290 TraceCheckUtils]: 270: Hoare triple {10950#false} assume !!(foo_~i~0#1 < 127); {10950#false} is VALID [2022-02-20 23:44:12,700 INFO L290 TraceCheckUtils]: 271: Hoare triple {10950#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {10950#false} is VALID [2022-02-20 23:44:12,700 INFO L290 TraceCheckUtils]: 272: Hoare triple {10950#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {10950#false} is VALID [2022-02-20 23:44:12,701 INFO L290 TraceCheckUtils]: 273: Hoare triple {10950#false} assume !!(foo_~i~0#1 < 127); {10950#false} is VALID [2022-02-20 23:44:12,701 INFO L290 TraceCheckUtils]: 274: Hoare triple {10950#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {10950#false} is VALID [2022-02-20 23:44:12,701 INFO L290 TraceCheckUtils]: 275: Hoare triple {10950#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {10950#false} is VALID [2022-02-20 23:44:12,701 INFO L290 TraceCheckUtils]: 276: Hoare triple {10950#false} assume !!(foo_~i~0#1 < 127); {10950#false} is VALID [2022-02-20 23:44:12,701 INFO L290 TraceCheckUtils]: 277: Hoare triple {10950#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {10950#false} is VALID [2022-02-20 23:44:12,701 INFO L290 TraceCheckUtils]: 278: Hoare triple {10950#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {10950#false} is VALID [2022-02-20 23:44:12,701 INFO L290 TraceCheckUtils]: 279: Hoare triple {10950#false} assume !!(foo_~i~0#1 < 127); {10950#false} is VALID [2022-02-20 23:44:12,701 INFO L290 TraceCheckUtils]: 280: Hoare triple {10950#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {10950#false} is VALID [2022-02-20 23:44:12,701 INFO L290 TraceCheckUtils]: 281: Hoare triple {10950#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {10950#false} is VALID [2022-02-20 23:44:12,701 INFO L290 TraceCheckUtils]: 282: Hoare triple {10950#false} assume !!(foo_~i~0#1 < 127); {10950#false} is VALID [2022-02-20 23:44:12,702 INFO L290 TraceCheckUtils]: 283: Hoare triple {10950#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {10950#false} is VALID [2022-02-20 23:44:12,702 INFO L290 TraceCheckUtils]: 284: Hoare triple {10950#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {10950#false} is VALID [2022-02-20 23:44:12,702 INFO L290 TraceCheckUtils]: 285: Hoare triple {10950#false} assume !(foo_~i~0#1 < 127); {10950#false} is VALID [2022-02-20 23:44:12,702 INFO L290 TraceCheckUtils]: 286: Hoare triple {10950#false} assume { :end_inline_foo } true; {10950#false} is VALID [2022-02-20 23:44:12,702 INFO L290 TraceCheckUtils]: 287: Hoare triple {10950#false} SUMMARY for call main_#t~mem8#1 := read~int(~b~0.base, -4 + ~b~0.offset, 4); srcloc: L540 {10950#false} is VALID [2022-02-20 23:44:12,702 INFO L290 TraceCheckUtils]: 288: Hoare triple {10950#false} assume !(0 != main_#t~mem8#1);havoc main_#t~mem8#1; {10950#false} is VALID [2022-02-20 23:44:12,702 INFO L290 TraceCheckUtils]: 289: Hoare triple {10950#false} assume 0 == ~a~0.offset; {10950#false} is VALID [2022-02-20 23:44:12,702 INFO L290 TraceCheckUtils]: 290: Hoare triple {10950#false} assume ~a~0.base < #StackHeapBarrier; {10950#false} is VALID [2022-02-20 23:44:12,702 INFO L290 TraceCheckUtils]: 291: Hoare triple {10950#false} assume 0 == ~a~0.base || 1 == #valid[~a~0.base];call ULTIMATE.dealloc(~a~0.base, ~a~0.offset); {10950#false} is VALID [2022-02-20 23:44:12,702 INFO L290 TraceCheckUtils]: 292: Hoare triple {10950#false} assume !(0 == ~b~0.offset); {10950#false} is VALID [2022-02-20 23:44:12,705 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:12,705 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:44:17,043 INFO L290 TraceCheckUtils]: 292: Hoare triple {10950#false} assume !(0 == ~b~0.offset); {10950#false} is VALID [2022-02-20 23:44:17,043 INFO L290 TraceCheckUtils]: 291: Hoare triple {10950#false} assume 0 == ~a~0.base || 1 == #valid[~a~0.base];call ULTIMATE.dealloc(~a~0.base, ~a~0.offset); {10950#false} is VALID [2022-02-20 23:44:17,043 INFO L290 TraceCheckUtils]: 290: Hoare triple {10950#false} assume ~a~0.base < #StackHeapBarrier; {10950#false} is VALID [2022-02-20 23:44:17,043 INFO L290 TraceCheckUtils]: 289: Hoare triple {10950#false} assume 0 == ~a~0.offset; {10950#false} is VALID [2022-02-20 23:44:17,043 INFO L290 TraceCheckUtils]: 288: Hoare triple {10950#false} assume !(0 != main_#t~mem8#1);havoc main_#t~mem8#1; {10950#false} is VALID [2022-02-20 23:44:17,043 INFO L290 TraceCheckUtils]: 287: Hoare triple {10950#false} SUMMARY for call main_#t~mem8#1 := read~int(~b~0.base, -4 + ~b~0.offset, 4); srcloc: L540 {10950#false} is VALID [2022-02-20 23:44:17,043 INFO L290 TraceCheckUtils]: 286: Hoare triple {10950#false} assume { :end_inline_foo } true; {10950#false} is VALID [2022-02-20 23:44:17,043 INFO L290 TraceCheckUtils]: 285: Hoare triple {10950#false} assume !(foo_~i~0#1 < 127); {10950#false} is VALID [2022-02-20 23:44:17,043 INFO L290 TraceCheckUtils]: 284: Hoare triple {10950#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {10950#false} is VALID [2022-02-20 23:44:17,043 INFO L290 TraceCheckUtils]: 283: Hoare triple {10950#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {10950#false} is VALID [2022-02-20 23:44:17,043 INFO L290 TraceCheckUtils]: 282: Hoare triple {10950#false} assume !!(foo_~i~0#1 < 127); {10950#false} is VALID [2022-02-20 23:44:17,044 INFO L290 TraceCheckUtils]: 281: Hoare triple {10950#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {10950#false} is VALID [2022-02-20 23:44:17,044 INFO L290 TraceCheckUtils]: 280: Hoare triple {10950#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {10950#false} is VALID [2022-02-20 23:44:17,044 INFO L290 TraceCheckUtils]: 279: Hoare triple {10950#false} assume !!(foo_~i~0#1 < 127); {10950#false} is VALID [2022-02-20 23:44:17,044 INFO L290 TraceCheckUtils]: 278: Hoare triple {10950#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {10950#false} is VALID [2022-02-20 23:44:17,044 INFO L290 TraceCheckUtils]: 277: Hoare triple {10950#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {10950#false} is VALID [2022-02-20 23:44:17,044 INFO L290 TraceCheckUtils]: 276: Hoare triple {10950#false} assume !!(foo_~i~0#1 < 127); {10950#false} is VALID [2022-02-20 23:44:17,044 INFO L290 TraceCheckUtils]: 275: Hoare triple {10950#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {10950#false} is VALID [2022-02-20 23:44:17,044 INFO L290 TraceCheckUtils]: 274: Hoare triple {10950#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {10950#false} is VALID [2022-02-20 23:44:17,044 INFO L290 TraceCheckUtils]: 273: Hoare triple {10950#false} assume !!(foo_~i~0#1 < 127); {10950#false} is VALID [2022-02-20 23:44:17,044 INFO L290 TraceCheckUtils]: 272: Hoare triple {10950#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {10950#false} is VALID [2022-02-20 23:44:17,044 INFO L290 TraceCheckUtils]: 271: Hoare triple {10950#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {10950#false} is VALID [2022-02-20 23:44:17,044 INFO L290 TraceCheckUtils]: 270: Hoare triple {10950#false} assume !!(foo_~i~0#1 < 127); {10950#false} is VALID [2022-02-20 23:44:17,044 INFO L290 TraceCheckUtils]: 269: Hoare triple {10950#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {10950#false} is VALID [2022-02-20 23:44:17,044 INFO L290 TraceCheckUtils]: 268: Hoare triple {10950#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {10950#false} is VALID [2022-02-20 23:44:17,044 INFO L290 TraceCheckUtils]: 267: Hoare triple {10950#false} assume !!(foo_~i~0#1 < 127); {10950#false} is VALID [2022-02-20 23:44:17,044 INFO L290 TraceCheckUtils]: 266: Hoare triple {10950#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {10950#false} is VALID [2022-02-20 23:44:17,044 INFO L290 TraceCheckUtils]: 265: Hoare triple {10950#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {10950#false} is VALID [2022-02-20 23:44:17,044 INFO L290 TraceCheckUtils]: 264: Hoare triple {10950#false} assume !!(foo_~i~0#1 < 127); {10950#false} is VALID [2022-02-20 23:44:17,044 INFO L290 TraceCheckUtils]: 263: Hoare triple {10950#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {10950#false} is VALID [2022-02-20 23:44:17,044 INFO L290 TraceCheckUtils]: 262: Hoare triple {10950#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {10950#false} is VALID [2022-02-20 23:44:17,044 INFO L290 TraceCheckUtils]: 261: Hoare triple {10950#false} assume !!(foo_~i~0#1 < 127); {10950#false} is VALID [2022-02-20 23:44:17,044 INFO L290 TraceCheckUtils]: 260: Hoare triple {10950#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {10950#false} is VALID [2022-02-20 23:44:17,045 INFO L290 TraceCheckUtils]: 259: Hoare triple {10950#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {10950#false} is VALID [2022-02-20 23:44:17,045 INFO L290 TraceCheckUtils]: 258: Hoare triple {10950#false} assume !!(foo_~i~0#1 < 127); {10950#false} is VALID [2022-02-20 23:44:17,045 INFO L290 TraceCheckUtils]: 257: Hoare triple {10950#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {10950#false} is VALID [2022-02-20 23:44:17,045 INFO L290 TraceCheckUtils]: 256: Hoare triple {10950#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {10950#false} is VALID [2022-02-20 23:44:17,045 INFO L290 TraceCheckUtils]: 255: Hoare triple {10950#false} assume !!(foo_~i~0#1 < 127); {10950#false} is VALID [2022-02-20 23:44:17,045 INFO L290 TraceCheckUtils]: 254: Hoare triple {10950#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {10950#false} is VALID [2022-02-20 23:44:17,045 INFO L290 TraceCheckUtils]: 253: Hoare triple {10950#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {10950#false} is VALID [2022-02-20 23:44:17,045 INFO L290 TraceCheckUtils]: 252: Hoare triple {10950#false} assume !!(foo_~i~0#1 < 127); {10950#false} is VALID [2022-02-20 23:44:17,045 INFO L290 TraceCheckUtils]: 251: Hoare triple {10950#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {10950#false} is VALID [2022-02-20 23:44:17,045 INFO L290 TraceCheckUtils]: 250: Hoare triple {10950#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {10950#false} is VALID [2022-02-20 23:44:17,045 INFO L290 TraceCheckUtils]: 249: Hoare triple {10950#false} assume !!(foo_~i~0#1 < 127); {10950#false} is VALID [2022-02-20 23:44:17,045 INFO L290 TraceCheckUtils]: 248: Hoare triple {10950#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {10950#false} is VALID [2022-02-20 23:44:17,045 INFO L290 TraceCheckUtils]: 247: Hoare triple {10950#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {10950#false} is VALID [2022-02-20 23:44:17,045 INFO L290 TraceCheckUtils]: 246: Hoare triple {10950#false} assume !!(foo_~i~0#1 < 127); {10950#false} is VALID [2022-02-20 23:44:17,045 INFO L290 TraceCheckUtils]: 245: Hoare triple {10950#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {10950#false} is VALID [2022-02-20 23:44:17,045 INFO L290 TraceCheckUtils]: 244: Hoare triple {10950#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {10950#false} is VALID [2022-02-20 23:44:17,045 INFO L290 TraceCheckUtils]: 243: Hoare triple {10950#false} assume !!(foo_~i~0#1 < 127); {10950#false} is VALID [2022-02-20 23:44:17,045 INFO L290 TraceCheckUtils]: 242: Hoare triple {10950#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {10950#false} is VALID [2022-02-20 23:44:17,045 INFO L290 TraceCheckUtils]: 241: Hoare triple {10950#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {10950#false} is VALID [2022-02-20 23:44:17,046 INFO L290 TraceCheckUtils]: 240: Hoare triple {10950#false} assume !!(foo_~i~0#1 < 127); {10950#false} is VALID [2022-02-20 23:44:17,046 INFO L290 TraceCheckUtils]: 239: Hoare triple {10950#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {10950#false} is VALID [2022-02-20 23:44:17,046 INFO L290 TraceCheckUtils]: 238: Hoare triple {10950#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {10950#false} is VALID [2022-02-20 23:44:17,046 INFO L290 TraceCheckUtils]: 237: Hoare triple {10950#false} assume !!(foo_~i~0#1 < 127); {10950#false} is VALID [2022-02-20 23:44:17,046 INFO L290 TraceCheckUtils]: 236: Hoare triple {10950#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {10950#false} is VALID [2022-02-20 23:44:17,046 INFO L290 TraceCheckUtils]: 235: Hoare triple {10950#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {10950#false} is VALID [2022-02-20 23:44:17,046 INFO L290 TraceCheckUtils]: 234: Hoare triple {10950#false} assume !!(foo_~i~0#1 < 127); {10950#false} is VALID [2022-02-20 23:44:17,046 INFO L290 TraceCheckUtils]: 233: Hoare triple {10950#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {10950#false} is VALID [2022-02-20 23:44:17,046 INFO L290 TraceCheckUtils]: 232: Hoare triple {10950#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {10950#false} is VALID [2022-02-20 23:44:17,047 INFO L290 TraceCheckUtils]: 231: Hoare triple {10950#false} assume !!(foo_~i~0#1 < 127); {10950#false} is VALID [2022-02-20 23:44:17,047 INFO L290 TraceCheckUtils]: 230: Hoare triple {10950#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {10950#false} is VALID [2022-02-20 23:44:17,047 INFO L290 TraceCheckUtils]: 229: Hoare triple {10950#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {10950#false} is VALID [2022-02-20 23:44:17,047 INFO L290 TraceCheckUtils]: 228: Hoare triple {10950#false} assume !!(foo_~i~0#1 < 127); {10950#false} is VALID [2022-02-20 23:44:17,047 INFO L290 TraceCheckUtils]: 227: Hoare triple {10950#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {10950#false} is VALID [2022-02-20 23:44:17,047 INFO L290 TraceCheckUtils]: 226: Hoare triple {10950#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {10950#false} is VALID [2022-02-20 23:44:17,047 INFO L290 TraceCheckUtils]: 225: Hoare triple {10950#false} assume !!(foo_~i~0#1 < 127); {10950#false} is VALID [2022-02-20 23:44:17,047 INFO L290 TraceCheckUtils]: 224: Hoare triple {10950#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {10950#false} is VALID [2022-02-20 23:44:17,047 INFO L290 TraceCheckUtils]: 223: Hoare triple {10950#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {10950#false} is VALID [2022-02-20 23:44:17,047 INFO L290 TraceCheckUtils]: 222: Hoare triple {10950#false} assume !!(foo_~i~0#1 < 127); {10950#false} is VALID [2022-02-20 23:44:17,047 INFO L290 TraceCheckUtils]: 221: Hoare triple {10950#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {10950#false} is VALID [2022-02-20 23:44:17,047 INFO L290 TraceCheckUtils]: 220: Hoare triple {10950#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {10950#false} is VALID [2022-02-20 23:44:17,047 INFO L290 TraceCheckUtils]: 219: Hoare triple {10950#false} assume !!(foo_~i~0#1 < 127); {10950#false} is VALID [2022-02-20 23:44:17,047 INFO L290 TraceCheckUtils]: 218: Hoare triple {10950#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {10950#false} is VALID [2022-02-20 23:44:17,047 INFO L290 TraceCheckUtils]: 217: Hoare triple {10950#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {10950#false} is VALID [2022-02-20 23:44:17,048 INFO L290 TraceCheckUtils]: 216: Hoare triple {10950#false} assume !!(foo_~i~0#1 < 127); {10950#false} is VALID [2022-02-20 23:44:17,048 INFO L290 TraceCheckUtils]: 215: Hoare triple {10950#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {10950#false} is VALID [2022-02-20 23:44:17,048 INFO L290 TraceCheckUtils]: 214: Hoare triple {10950#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {10950#false} is VALID [2022-02-20 23:44:17,048 INFO L290 TraceCheckUtils]: 213: Hoare triple {10950#false} assume !!(foo_~i~0#1 < 127); {10950#false} is VALID [2022-02-20 23:44:17,048 INFO L290 TraceCheckUtils]: 212: Hoare triple {10950#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {10950#false} is VALID [2022-02-20 23:44:17,048 INFO L290 TraceCheckUtils]: 211: Hoare triple {10950#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {10950#false} is VALID [2022-02-20 23:44:17,048 INFO L290 TraceCheckUtils]: 210: Hoare triple {10950#false} assume !!(foo_~i~0#1 < 127); {10950#false} is VALID [2022-02-20 23:44:17,048 INFO L290 TraceCheckUtils]: 209: Hoare triple {10950#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {10950#false} is VALID [2022-02-20 23:44:17,048 INFO L290 TraceCheckUtils]: 208: Hoare triple {10950#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {10950#false} is VALID [2022-02-20 23:44:17,048 INFO L290 TraceCheckUtils]: 207: Hoare triple {10950#false} assume !!(foo_~i~0#1 < 127); {10950#false} is VALID [2022-02-20 23:44:17,048 INFO L290 TraceCheckUtils]: 206: Hoare triple {10950#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {10950#false} is VALID [2022-02-20 23:44:17,048 INFO L290 TraceCheckUtils]: 205: Hoare triple {10950#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {10950#false} is VALID [2022-02-20 23:44:17,048 INFO L290 TraceCheckUtils]: 204: Hoare triple {10950#false} assume !!(foo_~i~0#1 < 127); {10950#false} is VALID [2022-02-20 23:44:17,048 INFO L290 TraceCheckUtils]: 203: Hoare triple {10950#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {10950#false} is VALID [2022-02-20 23:44:17,048 INFO L290 TraceCheckUtils]: 202: Hoare triple {10950#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {10950#false} is VALID [2022-02-20 23:44:17,048 INFO L290 TraceCheckUtils]: 201: Hoare triple {10950#false} assume !!(foo_~i~0#1 < 127); {10950#false} is VALID [2022-02-20 23:44:17,048 INFO L290 TraceCheckUtils]: 200: Hoare triple {10950#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {10950#false} is VALID [2022-02-20 23:44:17,048 INFO L290 TraceCheckUtils]: 199: Hoare triple {10950#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {10950#false} is VALID [2022-02-20 23:44:17,048 INFO L290 TraceCheckUtils]: 198: Hoare triple {10950#false} assume !!(foo_~i~0#1 < 127); {10950#false} is VALID [2022-02-20 23:44:17,048 INFO L290 TraceCheckUtils]: 197: Hoare triple {10950#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {10950#false} is VALID [2022-02-20 23:44:17,048 INFO L290 TraceCheckUtils]: 196: Hoare triple {10950#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {10950#false} is VALID [2022-02-20 23:44:17,048 INFO L290 TraceCheckUtils]: 195: Hoare triple {10950#false} assume !!(foo_~i~0#1 < 127); {10950#false} is VALID [2022-02-20 23:44:17,049 INFO L290 TraceCheckUtils]: 194: Hoare triple {10950#false} foo_#t~post4#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post4#1;havoc foo_#t~post4#1; {10950#false} is VALID [2022-02-20 23:44:17,049 INFO L290 TraceCheckUtils]: 193: Hoare triple {10950#false} SUMMARY for call write~int(-1, ~b~0.base, ~b~0.offset + 4 * foo_~i~0#1, 4); srcloc: L531 {10950#false} is VALID [2022-02-20 23:44:17,049 INFO L290 TraceCheckUtils]: 192: Hoare triple {10950#false} assume !!(foo_~i~0#1 < 127); {10950#false} is VALID [2022-02-20 23:44:17,049 INFO L290 TraceCheckUtils]: 191: Hoare triple {10950#false} foo_~i~0#1 := 0; {10950#false} is VALID [2022-02-20 23:44:17,049 INFO L290 TraceCheckUtils]: 190: Hoare triple {12232#(< |ULTIMATE.start_foo_~i~0#1| ~n~0)} assume !(foo_~i~0#1 < ~n~0); {10950#false} is VALID [2022-02-20 23:44:17,049 INFO L290 TraceCheckUtils]: 189: Hoare triple {12236#(< (+ |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; {12232#(< |ULTIMATE.start_foo_~i~0#1| ~n~0)} is VALID [2022-02-20 23:44:17,050 INFO L290 TraceCheckUtils]: 188: Hoare triple {12236#(< (+ |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 {12236#(< (+ |ULTIMATE.start_foo_~i~0#1| 1) ~n~0)} is VALID [2022-02-20 23:44:17,050 INFO L290 TraceCheckUtils]: 187: Hoare triple {12236#(< (+ |ULTIMATE.start_foo_~i~0#1| 1) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {12236#(< (+ |ULTIMATE.start_foo_~i~0#1| 1) ~n~0)} is VALID [2022-02-20 23:44:17,050 INFO L290 TraceCheckUtils]: 186: Hoare triple {12246#(< (+ |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; {12236#(< (+ |ULTIMATE.start_foo_~i~0#1| 1) ~n~0)} is VALID [2022-02-20 23:44:17,051 INFO L290 TraceCheckUtils]: 185: Hoare triple {12246#(< (+ |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 {12246#(< (+ |ULTIMATE.start_foo_~i~0#1| 2) ~n~0)} is VALID [2022-02-20 23:44:17,051 INFO L290 TraceCheckUtils]: 184: Hoare triple {12246#(< (+ |ULTIMATE.start_foo_~i~0#1| 2) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {12246#(< (+ |ULTIMATE.start_foo_~i~0#1| 2) ~n~0)} is VALID [2022-02-20 23:44:17,051 INFO L290 TraceCheckUtils]: 183: Hoare triple {12256#(< (+ |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; {12246#(< (+ |ULTIMATE.start_foo_~i~0#1| 2) ~n~0)} is VALID [2022-02-20 23:44:17,052 INFO L290 TraceCheckUtils]: 182: Hoare triple {12256#(< (+ |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 {12256#(< (+ |ULTIMATE.start_foo_~i~0#1| 3) ~n~0)} is VALID [2022-02-20 23:44:17,052 INFO L290 TraceCheckUtils]: 181: Hoare triple {12256#(< (+ |ULTIMATE.start_foo_~i~0#1| 3) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {12256#(< (+ |ULTIMATE.start_foo_~i~0#1| 3) ~n~0)} is VALID [2022-02-20 23:44:17,052 INFO L290 TraceCheckUtils]: 180: Hoare triple {12266#(< (+ |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; {12256#(< (+ |ULTIMATE.start_foo_~i~0#1| 3) ~n~0)} is VALID [2022-02-20 23:44:17,053 INFO L290 TraceCheckUtils]: 179: Hoare triple {12266#(< (+ |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 {12266#(< (+ |ULTIMATE.start_foo_~i~0#1| 4) ~n~0)} is VALID [2022-02-20 23:44:17,053 INFO L290 TraceCheckUtils]: 178: Hoare triple {12266#(< (+ |ULTIMATE.start_foo_~i~0#1| 4) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {12266#(< (+ |ULTIMATE.start_foo_~i~0#1| 4) ~n~0)} is VALID [2022-02-20 23:44:17,053 INFO L290 TraceCheckUtils]: 177: Hoare triple {12276#(< (+ |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; {12266#(< (+ |ULTIMATE.start_foo_~i~0#1| 4) ~n~0)} is VALID [2022-02-20 23:44:17,053 INFO L290 TraceCheckUtils]: 176: Hoare triple {12276#(< (+ |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 {12276#(< (+ |ULTIMATE.start_foo_~i~0#1| 5) ~n~0)} is VALID [2022-02-20 23:44:17,054 INFO L290 TraceCheckUtils]: 175: Hoare triple {12276#(< (+ |ULTIMATE.start_foo_~i~0#1| 5) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {12276#(< (+ |ULTIMATE.start_foo_~i~0#1| 5) ~n~0)} is VALID [2022-02-20 23:44:17,054 INFO L290 TraceCheckUtils]: 174: Hoare triple {12286#(< (+ |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; {12276#(< (+ |ULTIMATE.start_foo_~i~0#1| 5) ~n~0)} is VALID [2022-02-20 23:44:17,054 INFO L290 TraceCheckUtils]: 173: Hoare triple {12286#(< (+ |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 {12286#(< (+ |ULTIMATE.start_foo_~i~0#1| 6) ~n~0)} is VALID [2022-02-20 23:44:17,055 INFO L290 TraceCheckUtils]: 172: Hoare triple {12286#(< (+ |ULTIMATE.start_foo_~i~0#1| 6) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {12286#(< (+ |ULTIMATE.start_foo_~i~0#1| 6) ~n~0)} is VALID [2022-02-20 23:44:17,055 INFO L290 TraceCheckUtils]: 171: Hoare triple {12296#(< (+ 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; {12286#(< (+ |ULTIMATE.start_foo_~i~0#1| 6) ~n~0)} is VALID [2022-02-20 23:44:17,055 INFO L290 TraceCheckUtils]: 170: Hoare triple {12296#(< (+ 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 {12296#(< (+ 7 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:17,056 INFO L290 TraceCheckUtils]: 169: Hoare triple {12296#(< (+ 7 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {12296#(< (+ 7 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:17,056 INFO L290 TraceCheckUtils]: 168: Hoare triple {12306#(< (+ |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; {12296#(< (+ 7 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:17,056 INFO L290 TraceCheckUtils]: 167: Hoare triple {12306#(< (+ |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 {12306#(< (+ |ULTIMATE.start_foo_~i~0#1| 8) ~n~0)} is VALID [2022-02-20 23:44:17,057 INFO L290 TraceCheckUtils]: 166: Hoare triple {12306#(< (+ |ULTIMATE.start_foo_~i~0#1| 8) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {12306#(< (+ |ULTIMATE.start_foo_~i~0#1| 8) ~n~0)} is VALID [2022-02-20 23:44:17,057 INFO L290 TraceCheckUtils]: 165: Hoare triple {12316#(< (+ |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; {12306#(< (+ |ULTIMATE.start_foo_~i~0#1| 8) ~n~0)} is VALID [2022-02-20 23:44:17,057 INFO L290 TraceCheckUtils]: 164: Hoare triple {12316#(< (+ |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 {12316#(< (+ |ULTIMATE.start_foo_~i~0#1| 9) ~n~0)} is VALID [2022-02-20 23:44:17,058 INFO L290 TraceCheckUtils]: 163: Hoare triple {12316#(< (+ |ULTIMATE.start_foo_~i~0#1| 9) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {12316#(< (+ |ULTIMATE.start_foo_~i~0#1| 9) ~n~0)} is VALID [2022-02-20 23:44:17,058 INFO L290 TraceCheckUtils]: 162: Hoare triple {12326#(< (+ |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; {12316#(< (+ |ULTIMATE.start_foo_~i~0#1| 9) ~n~0)} is VALID [2022-02-20 23:44:17,058 INFO L290 TraceCheckUtils]: 161: Hoare triple {12326#(< (+ |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 {12326#(< (+ |ULTIMATE.start_foo_~i~0#1| 10) ~n~0)} is VALID [2022-02-20 23:44:17,058 INFO L290 TraceCheckUtils]: 160: Hoare triple {12326#(< (+ |ULTIMATE.start_foo_~i~0#1| 10) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {12326#(< (+ |ULTIMATE.start_foo_~i~0#1| 10) ~n~0)} is VALID [2022-02-20 23:44:17,059 INFO L290 TraceCheckUtils]: 159: Hoare triple {12336#(< (+ |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; {12326#(< (+ |ULTIMATE.start_foo_~i~0#1| 10) ~n~0)} is VALID [2022-02-20 23:44:17,059 INFO L290 TraceCheckUtils]: 158: Hoare triple {12336#(< (+ |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 {12336#(< (+ |ULTIMATE.start_foo_~i~0#1| 11) ~n~0)} is VALID [2022-02-20 23:44:17,059 INFO L290 TraceCheckUtils]: 157: Hoare triple {12336#(< (+ |ULTIMATE.start_foo_~i~0#1| 11) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {12336#(< (+ |ULTIMATE.start_foo_~i~0#1| 11) ~n~0)} is VALID [2022-02-20 23:44:17,060 INFO L290 TraceCheckUtils]: 156: Hoare triple {12346#(< (+ |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; {12336#(< (+ |ULTIMATE.start_foo_~i~0#1| 11) ~n~0)} is VALID [2022-02-20 23:44:17,060 INFO L290 TraceCheckUtils]: 155: Hoare triple {12346#(< (+ |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 {12346#(< (+ |ULTIMATE.start_foo_~i~0#1| 12) ~n~0)} is VALID [2022-02-20 23:44:17,060 INFO L290 TraceCheckUtils]: 154: Hoare triple {12346#(< (+ |ULTIMATE.start_foo_~i~0#1| 12) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {12346#(< (+ |ULTIMATE.start_foo_~i~0#1| 12) ~n~0)} is VALID [2022-02-20 23:44:17,060 INFO L290 TraceCheckUtils]: 153: Hoare triple {12356#(< (+ |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; {12346#(< (+ |ULTIMATE.start_foo_~i~0#1| 12) ~n~0)} is VALID [2022-02-20 23:44:17,061 INFO L290 TraceCheckUtils]: 152: Hoare triple {12356#(< (+ |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 {12356#(< (+ |ULTIMATE.start_foo_~i~0#1| 13) ~n~0)} is VALID [2022-02-20 23:44:17,061 INFO L290 TraceCheckUtils]: 151: Hoare triple {12356#(< (+ |ULTIMATE.start_foo_~i~0#1| 13) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {12356#(< (+ |ULTIMATE.start_foo_~i~0#1| 13) ~n~0)} is VALID [2022-02-20 23:44:17,061 INFO L290 TraceCheckUtils]: 150: Hoare triple {12366#(< (+ |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; {12356#(< (+ |ULTIMATE.start_foo_~i~0#1| 13) ~n~0)} is VALID [2022-02-20 23:44:17,062 INFO L290 TraceCheckUtils]: 149: Hoare triple {12366#(< (+ |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 {12366#(< (+ |ULTIMATE.start_foo_~i~0#1| 14) ~n~0)} is VALID [2022-02-20 23:44:17,062 INFO L290 TraceCheckUtils]: 148: Hoare triple {12366#(< (+ |ULTIMATE.start_foo_~i~0#1| 14) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {12366#(< (+ |ULTIMATE.start_foo_~i~0#1| 14) ~n~0)} is VALID [2022-02-20 23:44:17,062 INFO L290 TraceCheckUtils]: 147: Hoare triple {12376#(< (+ |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; {12366#(< (+ |ULTIMATE.start_foo_~i~0#1| 14) ~n~0)} is VALID [2022-02-20 23:44:17,063 INFO L290 TraceCheckUtils]: 146: Hoare triple {12376#(< (+ |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 {12376#(< (+ |ULTIMATE.start_foo_~i~0#1| 15) ~n~0)} is VALID [2022-02-20 23:44:17,063 INFO L290 TraceCheckUtils]: 145: Hoare triple {12376#(< (+ |ULTIMATE.start_foo_~i~0#1| 15) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {12376#(< (+ |ULTIMATE.start_foo_~i~0#1| 15) ~n~0)} is VALID [2022-02-20 23:44:17,063 INFO L290 TraceCheckUtils]: 144: Hoare triple {12386#(< (+ |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; {12376#(< (+ |ULTIMATE.start_foo_~i~0#1| 15) ~n~0)} is VALID [2022-02-20 23:44:17,064 INFO L290 TraceCheckUtils]: 143: Hoare triple {12386#(< (+ |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 {12386#(< (+ |ULTIMATE.start_foo_~i~0#1| 16) ~n~0)} is VALID [2022-02-20 23:44:17,064 INFO L290 TraceCheckUtils]: 142: Hoare triple {12386#(< (+ |ULTIMATE.start_foo_~i~0#1| 16) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {12386#(< (+ |ULTIMATE.start_foo_~i~0#1| 16) ~n~0)} is VALID [2022-02-20 23:44:17,064 INFO L290 TraceCheckUtils]: 141: Hoare triple {12396#(< (+ |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; {12386#(< (+ |ULTIMATE.start_foo_~i~0#1| 16) ~n~0)} is VALID [2022-02-20 23:44:17,065 INFO L290 TraceCheckUtils]: 140: Hoare triple {12396#(< (+ |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 {12396#(< (+ |ULTIMATE.start_foo_~i~0#1| 17) ~n~0)} is VALID [2022-02-20 23:44:17,065 INFO L290 TraceCheckUtils]: 139: Hoare triple {12396#(< (+ |ULTIMATE.start_foo_~i~0#1| 17) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {12396#(< (+ |ULTIMATE.start_foo_~i~0#1| 17) ~n~0)} is VALID [2022-02-20 23:44:17,065 INFO L290 TraceCheckUtils]: 138: Hoare triple {12406#(< (+ |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; {12396#(< (+ |ULTIMATE.start_foo_~i~0#1| 17) ~n~0)} is VALID [2022-02-20 23:44:17,065 INFO L290 TraceCheckUtils]: 137: Hoare triple {12406#(< (+ |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 {12406#(< (+ |ULTIMATE.start_foo_~i~0#1| 18) ~n~0)} is VALID [2022-02-20 23:44:17,066 INFO L290 TraceCheckUtils]: 136: Hoare triple {12406#(< (+ |ULTIMATE.start_foo_~i~0#1| 18) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {12406#(< (+ |ULTIMATE.start_foo_~i~0#1| 18) ~n~0)} is VALID [2022-02-20 23:44:17,066 INFO L290 TraceCheckUtils]: 135: Hoare triple {12416#(< (+ 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; {12406#(< (+ |ULTIMATE.start_foo_~i~0#1| 18) ~n~0)} is VALID [2022-02-20 23:44:17,066 INFO L290 TraceCheckUtils]: 134: Hoare triple {12416#(< (+ 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 {12416#(< (+ 19 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:17,067 INFO L290 TraceCheckUtils]: 133: Hoare triple {12416#(< (+ 19 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {12416#(< (+ 19 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:17,067 INFO L290 TraceCheckUtils]: 132: Hoare triple {12426#(< (+ |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; {12416#(< (+ 19 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:17,073 INFO L290 TraceCheckUtils]: 131: Hoare triple {12426#(< (+ |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 {12426#(< (+ |ULTIMATE.start_foo_~i~0#1| 20) ~n~0)} is VALID [2022-02-20 23:44:17,073 INFO L290 TraceCheckUtils]: 130: Hoare triple {12426#(< (+ |ULTIMATE.start_foo_~i~0#1| 20) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {12426#(< (+ |ULTIMATE.start_foo_~i~0#1| 20) ~n~0)} is VALID [2022-02-20 23:44:17,074 INFO L290 TraceCheckUtils]: 129: Hoare triple {12436#(< (+ |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; {12426#(< (+ |ULTIMATE.start_foo_~i~0#1| 20) ~n~0)} is VALID [2022-02-20 23:44:17,074 INFO L290 TraceCheckUtils]: 128: Hoare triple {12436#(< (+ |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 {12436#(< (+ |ULTIMATE.start_foo_~i~0#1| 21) ~n~0)} is VALID [2022-02-20 23:44:17,074 INFO L290 TraceCheckUtils]: 127: Hoare triple {12436#(< (+ |ULTIMATE.start_foo_~i~0#1| 21) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {12436#(< (+ |ULTIMATE.start_foo_~i~0#1| 21) ~n~0)} is VALID [2022-02-20 23:44:17,075 INFO L290 TraceCheckUtils]: 126: Hoare triple {12446#(< (+ |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; {12436#(< (+ |ULTIMATE.start_foo_~i~0#1| 21) ~n~0)} is VALID [2022-02-20 23:44:17,075 INFO L290 TraceCheckUtils]: 125: Hoare triple {12446#(< (+ |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 {12446#(< (+ |ULTIMATE.start_foo_~i~0#1| 22) ~n~0)} is VALID [2022-02-20 23:44:17,079 INFO L290 TraceCheckUtils]: 124: Hoare triple {12446#(< (+ |ULTIMATE.start_foo_~i~0#1| 22) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {12446#(< (+ |ULTIMATE.start_foo_~i~0#1| 22) ~n~0)} is VALID [2022-02-20 23:44:17,080 INFO L290 TraceCheckUtils]: 123: Hoare triple {12456#(< (+ 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; {12446#(< (+ |ULTIMATE.start_foo_~i~0#1| 22) ~n~0)} is VALID [2022-02-20 23:44:17,080 INFO L290 TraceCheckUtils]: 122: Hoare triple {12456#(< (+ 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 {12456#(< (+ 23 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:17,080 INFO L290 TraceCheckUtils]: 121: Hoare triple {12456#(< (+ 23 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {12456#(< (+ 23 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:17,080 INFO L290 TraceCheckUtils]: 120: Hoare triple {12466#(< (+ |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; {12456#(< (+ 23 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:17,081 INFO L290 TraceCheckUtils]: 119: Hoare triple {12466#(< (+ |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 {12466#(< (+ |ULTIMATE.start_foo_~i~0#1| 24) ~n~0)} is VALID [2022-02-20 23:44:17,081 INFO L290 TraceCheckUtils]: 118: Hoare triple {12466#(< (+ |ULTIMATE.start_foo_~i~0#1| 24) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {12466#(< (+ |ULTIMATE.start_foo_~i~0#1| 24) ~n~0)} is VALID [2022-02-20 23:44:17,081 INFO L290 TraceCheckUtils]: 117: Hoare triple {12476#(< (+ |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; {12466#(< (+ |ULTIMATE.start_foo_~i~0#1| 24) ~n~0)} is VALID [2022-02-20 23:44:17,082 INFO L290 TraceCheckUtils]: 116: Hoare triple {12476#(< (+ |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 {12476#(< (+ |ULTIMATE.start_foo_~i~0#1| 25) ~n~0)} is VALID [2022-02-20 23:44:17,082 INFO L290 TraceCheckUtils]: 115: Hoare triple {12476#(< (+ |ULTIMATE.start_foo_~i~0#1| 25) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {12476#(< (+ |ULTIMATE.start_foo_~i~0#1| 25) ~n~0)} is VALID [2022-02-20 23:44:17,082 INFO L290 TraceCheckUtils]: 114: Hoare triple {12486#(< (+ |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; {12476#(< (+ |ULTIMATE.start_foo_~i~0#1| 25) ~n~0)} is VALID [2022-02-20 23:44:17,082 INFO L290 TraceCheckUtils]: 113: Hoare triple {12486#(< (+ |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 {12486#(< (+ |ULTIMATE.start_foo_~i~0#1| 26) ~n~0)} is VALID [2022-02-20 23:44:17,083 INFO L290 TraceCheckUtils]: 112: Hoare triple {12486#(< (+ |ULTIMATE.start_foo_~i~0#1| 26) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {12486#(< (+ |ULTIMATE.start_foo_~i~0#1| 26) ~n~0)} is VALID [2022-02-20 23:44:17,083 INFO L290 TraceCheckUtils]: 111: Hoare triple {12496#(< (+ |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; {12486#(< (+ |ULTIMATE.start_foo_~i~0#1| 26) ~n~0)} is VALID [2022-02-20 23:44:17,083 INFO L290 TraceCheckUtils]: 110: Hoare triple {12496#(< (+ |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 {12496#(< (+ |ULTIMATE.start_foo_~i~0#1| 27) ~n~0)} is VALID [2022-02-20 23:44:17,084 INFO L290 TraceCheckUtils]: 109: Hoare triple {12496#(< (+ |ULTIMATE.start_foo_~i~0#1| 27) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {12496#(< (+ |ULTIMATE.start_foo_~i~0#1| 27) ~n~0)} is VALID [2022-02-20 23:44:17,084 INFO L290 TraceCheckUtils]: 108: Hoare triple {12506#(< (+ |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; {12496#(< (+ |ULTIMATE.start_foo_~i~0#1| 27) ~n~0)} is VALID [2022-02-20 23:44:17,084 INFO L290 TraceCheckUtils]: 107: Hoare triple {12506#(< (+ |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 {12506#(< (+ |ULTIMATE.start_foo_~i~0#1| 28) ~n~0)} is VALID [2022-02-20 23:44:17,084 INFO L290 TraceCheckUtils]: 106: Hoare triple {12506#(< (+ |ULTIMATE.start_foo_~i~0#1| 28) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {12506#(< (+ |ULTIMATE.start_foo_~i~0#1| 28) ~n~0)} is VALID [2022-02-20 23:44:17,085 INFO L290 TraceCheckUtils]: 105: Hoare triple {12516#(< (+ |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; {12506#(< (+ |ULTIMATE.start_foo_~i~0#1| 28) ~n~0)} is VALID [2022-02-20 23:44:17,085 INFO L290 TraceCheckUtils]: 104: Hoare triple {12516#(< (+ |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 {12516#(< (+ |ULTIMATE.start_foo_~i~0#1| 29) ~n~0)} is VALID [2022-02-20 23:44:17,085 INFO L290 TraceCheckUtils]: 103: Hoare triple {12516#(< (+ |ULTIMATE.start_foo_~i~0#1| 29) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {12516#(< (+ |ULTIMATE.start_foo_~i~0#1| 29) ~n~0)} is VALID [2022-02-20 23:44:17,086 INFO L290 TraceCheckUtils]: 102: Hoare triple {12526#(< (+ |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; {12516#(< (+ |ULTIMATE.start_foo_~i~0#1| 29) ~n~0)} is VALID [2022-02-20 23:44:17,086 INFO L290 TraceCheckUtils]: 101: Hoare triple {12526#(< (+ |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 {12526#(< (+ |ULTIMATE.start_foo_~i~0#1| 30) ~n~0)} is VALID [2022-02-20 23:44:17,087 INFO L290 TraceCheckUtils]: 100: Hoare triple {12526#(< (+ |ULTIMATE.start_foo_~i~0#1| 30) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {12526#(< (+ |ULTIMATE.start_foo_~i~0#1| 30) ~n~0)} is VALID [2022-02-20 23:44:17,087 INFO L290 TraceCheckUtils]: 99: Hoare triple {12536#(< (+ |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; {12526#(< (+ |ULTIMATE.start_foo_~i~0#1| 30) ~n~0)} is VALID [2022-02-20 23:44:17,087 INFO L290 TraceCheckUtils]: 98: Hoare triple {12536#(< (+ |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 {12536#(< (+ |ULTIMATE.start_foo_~i~0#1| 31) ~n~0)} is VALID [2022-02-20 23:44:17,088 INFO L290 TraceCheckUtils]: 97: Hoare triple {12536#(< (+ |ULTIMATE.start_foo_~i~0#1| 31) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {12536#(< (+ |ULTIMATE.start_foo_~i~0#1| 31) ~n~0)} is VALID [2022-02-20 23:44:17,088 INFO L290 TraceCheckUtils]: 96: Hoare triple {12546#(< (+ |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; {12536#(< (+ |ULTIMATE.start_foo_~i~0#1| 31) ~n~0)} is VALID [2022-02-20 23:44:17,088 INFO L290 TraceCheckUtils]: 95: Hoare triple {12546#(< (+ |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 {12546#(< (+ |ULTIMATE.start_foo_~i~0#1| 32) ~n~0)} is VALID [2022-02-20 23:44:17,089 INFO L290 TraceCheckUtils]: 94: Hoare triple {12546#(< (+ |ULTIMATE.start_foo_~i~0#1| 32) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {12546#(< (+ |ULTIMATE.start_foo_~i~0#1| 32) ~n~0)} is VALID [2022-02-20 23:44:17,089 INFO L290 TraceCheckUtils]: 93: Hoare triple {12556#(< (+ |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; {12546#(< (+ |ULTIMATE.start_foo_~i~0#1| 32) ~n~0)} is VALID [2022-02-20 23:44:17,089 INFO L290 TraceCheckUtils]: 92: Hoare triple {12556#(< (+ |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 {12556#(< (+ |ULTIMATE.start_foo_~i~0#1| 33) ~n~0)} is VALID [2022-02-20 23:44:17,089 INFO L290 TraceCheckUtils]: 91: Hoare triple {12556#(< (+ |ULTIMATE.start_foo_~i~0#1| 33) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {12556#(< (+ |ULTIMATE.start_foo_~i~0#1| 33) ~n~0)} is VALID [2022-02-20 23:44:17,090 INFO L290 TraceCheckUtils]: 90: Hoare triple {12566#(< (+ |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; {12556#(< (+ |ULTIMATE.start_foo_~i~0#1| 33) ~n~0)} is VALID [2022-02-20 23:44:17,090 INFO L290 TraceCheckUtils]: 89: Hoare triple {12566#(< (+ |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 {12566#(< (+ |ULTIMATE.start_foo_~i~0#1| 34) ~n~0)} is VALID [2022-02-20 23:44:17,090 INFO L290 TraceCheckUtils]: 88: Hoare triple {12566#(< (+ |ULTIMATE.start_foo_~i~0#1| 34) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {12566#(< (+ |ULTIMATE.start_foo_~i~0#1| 34) ~n~0)} is VALID [2022-02-20 23:44:17,091 INFO L290 TraceCheckUtils]: 87: Hoare triple {12576#(< (+ |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; {12566#(< (+ |ULTIMATE.start_foo_~i~0#1| 34) ~n~0)} is VALID [2022-02-20 23:44:17,091 INFO L290 TraceCheckUtils]: 86: Hoare triple {12576#(< (+ |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 {12576#(< (+ |ULTIMATE.start_foo_~i~0#1| 35) ~n~0)} is VALID [2022-02-20 23:44:17,099 INFO L290 TraceCheckUtils]: 85: Hoare triple {12576#(< (+ |ULTIMATE.start_foo_~i~0#1| 35) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {12576#(< (+ |ULTIMATE.start_foo_~i~0#1| 35) ~n~0)} is VALID [2022-02-20 23:44:17,100 INFO L290 TraceCheckUtils]: 84: Hoare triple {12586#(< (+ |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; {12576#(< (+ |ULTIMATE.start_foo_~i~0#1| 35) ~n~0)} is VALID [2022-02-20 23:44:17,100 INFO L290 TraceCheckUtils]: 83: Hoare triple {12586#(< (+ |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 {12586#(< (+ |ULTIMATE.start_foo_~i~0#1| 36) ~n~0)} is VALID [2022-02-20 23:44:17,100 INFO L290 TraceCheckUtils]: 82: Hoare triple {12586#(< (+ |ULTIMATE.start_foo_~i~0#1| 36) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {12586#(< (+ |ULTIMATE.start_foo_~i~0#1| 36) ~n~0)} is VALID [2022-02-20 23:44:17,101 INFO L290 TraceCheckUtils]: 81: Hoare triple {12596#(< (+ |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; {12586#(< (+ |ULTIMATE.start_foo_~i~0#1| 36) ~n~0)} is VALID [2022-02-20 23:44:17,101 INFO L290 TraceCheckUtils]: 80: Hoare triple {12596#(< (+ |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 {12596#(< (+ |ULTIMATE.start_foo_~i~0#1| 37) ~n~0)} is VALID [2022-02-20 23:44:17,101 INFO L290 TraceCheckUtils]: 79: Hoare triple {12596#(< (+ |ULTIMATE.start_foo_~i~0#1| 37) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {12596#(< (+ |ULTIMATE.start_foo_~i~0#1| 37) ~n~0)} is VALID [2022-02-20 23:44:17,102 INFO L290 TraceCheckUtils]: 78: Hoare triple {12606#(< (+ |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; {12596#(< (+ |ULTIMATE.start_foo_~i~0#1| 37) ~n~0)} is VALID [2022-02-20 23:44:17,102 INFO L290 TraceCheckUtils]: 77: Hoare triple {12606#(< (+ |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 {12606#(< (+ |ULTIMATE.start_foo_~i~0#1| 38) ~n~0)} is VALID [2022-02-20 23:44:17,102 INFO L290 TraceCheckUtils]: 76: Hoare triple {12606#(< (+ |ULTIMATE.start_foo_~i~0#1| 38) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {12606#(< (+ |ULTIMATE.start_foo_~i~0#1| 38) ~n~0)} is VALID [2022-02-20 23:44:17,103 INFO L290 TraceCheckUtils]: 75: Hoare triple {12616#(< (+ |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; {12606#(< (+ |ULTIMATE.start_foo_~i~0#1| 38) ~n~0)} is VALID [2022-02-20 23:44:17,103 INFO L290 TraceCheckUtils]: 74: Hoare triple {12616#(< (+ |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 {12616#(< (+ |ULTIMATE.start_foo_~i~0#1| 39) ~n~0)} is VALID [2022-02-20 23:44:17,103 INFO L290 TraceCheckUtils]: 73: Hoare triple {12616#(< (+ |ULTIMATE.start_foo_~i~0#1| 39) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {12616#(< (+ |ULTIMATE.start_foo_~i~0#1| 39) ~n~0)} is VALID [2022-02-20 23:44:17,103 INFO L290 TraceCheckUtils]: 72: Hoare triple {12626#(< (+ 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; {12616#(< (+ |ULTIMATE.start_foo_~i~0#1| 39) ~n~0)} is VALID [2022-02-20 23:44:17,104 INFO L290 TraceCheckUtils]: 71: Hoare triple {12626#(< (+ 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 {12626#(< (+ 40 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:17,104 INFO L290 TraceCheckUtils]: 70: Hoare triple {12626#(< (+ 40 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {12626#(< (+ 40 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:17,104 INFO L290 TraceCheckUtils]: 69: Hoare triple {12636#(< (+ 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; {12626#(< (+ 40 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:17,107 INFO L290 TraceCheckUtils]: 68: Hoare triple {12636#(< (+ 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 {12636#(< (+ 41 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:17,108 INFO L290 TraceCheckUtils]: 67: Hoare triple {12636#(< (+ 41 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {12636#(< (+ 41 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:17,108 INFO L290 TraceCheckUtils]: 66: Hoare triple {12646#(< (+ |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; {12636#(< (+ 41 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:17,108 INFO L290 TraceCheckUtils]: 65: Hoare triple {12646#(< (+ |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 {12646#(< (+ |ULTIMATE.start_foo_~i~0#1| 42) ~n~0)} is VALID [2022-02-20 23:44:17,109 INFO L290 TraceCheckUtils]: 64: Hoare triple {12646#(< (+ |ULTIMATE.start_foo_~i~0#1| 42) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {12646#(< (+ |ULTIMATE.start_foo_~i~0#1| 42) ~n~0)} is VALID [2022-02-20 23:44:17,109 INFO L290 TraceCheckUtils]: 63: Hoare triple {12656#(< (+ |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; {12646#(< (+ |ULTIMATE.start_foo_~i~0#1| 42) ~n~0)} is VALID [2022-02-20 23:44:17,109 INFO L290 TraceCheckUtils]: 62: Hoare triple {12656#(< (+ |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 {12656#(< (+ |ULTIMATE.start_foo_~i~0#1| 43) ~n~0)} is VALID [2022-02-20 23:44:17,110 INFO L290 TraceCheckUtils]: 61: Hoare triple {12656#(< (+ |ULTIMATE.start_foo_~i~0#1| 43) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {12656#(< (+ |ULTIMATE.start_foo_~i~0#1| 43) ~n~0)} is VALID [2022-02-20 23:44:17,110 INFO L290 TraceCheckUtils]: 60: Hoare triple {12666#(< (+ |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; {12656#(< (+ |ULTIMATE.start_foo_~i~0#1| 43) ~n~0)} is VALID [2022-02-20 23:44:17,110 INFO L290 TraceCheckUtils]: 59: Hoare triple {12666#(< (+ |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 {12666#(< (+ |ULTIMATE.start_foo_~i~0#1| 44) ~n~0)} is VALID [2022-02-20 23:44:17,111 INFO L290 TraceCheckUtils]: 58: Hoare triple {12666#(< (+ |ULTIMATE.start_foo_~i~0#1| 44) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {12666#(< (+ |ULTIMATE.start_foo_~i~0#1| 44) ~n~0)} is VALID [2022-02-20 23:44:17,111 INFO L290 TraceCheckUtils]: 57: Hoare triple {12676#(< (+ |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; {12666#(< (+ |ULTIMATE.start_foo_~i~0#1| 44) ~n~0)} is VALID [2022-02-20 23:44:17,111 INFO L290 TraceCheckUtils]: 56: Hoare triple {12676#(< (+ |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 {12676#(< (+ |ULTIMATE.start_foo_~i~0#1| 45) ~n~0)} is VALID [2022-02-20 23:44:17,111 INFO L290 TraceCheckUtils]: 55: Hoare triple {12676#(< (+ |ULTIMATE.start_foo_~i~0#1| 45) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {12676#(< (+ |ULTIMATE.start_foo_~i~0#1| 45) ~n~0)} is VALID [2022-02-20 23:44:17,112 INFO L290 TraceCheckUtils]: 54: Hoare triple {12686#(< (+ |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; {12676#(< (+ |ULTIMATE.start_foo_~i~0#1| 45) ~n~0)} is VALID [2022-02-20 23:44:17,112 INFO L290 TraceCheckUtils]: 53: Hoare triple {12686#(< (+ |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 {12686#(< (+ |ULTIMATE.start_foo_~i~0#1| 46) ~n~0)} is VALID [2022-02-20 23:44:17,112 INFO L290 TraceCheckUtils]: 52: Hoare triple {12686#(< (+ |ULTIMATE.start_foo_~i~0#1| 46) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {12686#(< (+ |ULTIMATE.start_foo_~i~0#1| 46) ~n~0)} is VALID [2022-02-20 23:44:17,113 INFO L290 TraceCheckUtils]: 51: Hoare triple {12696#(< (+ |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; {12686#(< (+ |ULTIMATE.start_foo_~i~0#1| 46) ~n~0)} is VALID [2022-02-20 23:44:17,113 INFO L290 TraceCheckUtils]: 50: Hoare triple {12696#(< (+ |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 {12696#(< (+ |ULTIMATE.start_foo_~i~0#1| 47) ~n~0)} is VALID [2022-02-20 23:44:17,114 INFO L290 TraceCheckUtils]: 49: Hoare triple {12696#(< (+ |ULTIMATE.start_foo_~i~0#1| 47) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {12696#(< (+ |ULTIMATE.start_foo_~i~0#1| 47) ~n~0)} is VALID [2022-02-20 23:44:17,114 INFO L290 TraceCheckUtils]: 48: Hoare triple {12706#(< (+ |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; {12696#(< (+ |ULTIMATE.start_foo_~i~0#1| 47) ~n~0)} is VALID [2022-02-20 23:44:17,114 INFO L290 TraceCheckUtils]: 47: Hoare triple {12706#(< (+ |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 {12706#(< (+ |ULTIMATE.start_foo_~i~0#1| 48) ~n~0)} is VALID [2022-02-20 23:44:17,114 INFO L290 TraceCheckUtils]: 46: Hoare triple {12706#(< (+ |ULTIMATE.start_foo_~i~0#1| 48) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {12706#(< (+ |ULTIMATE.start_foo_~i~0#1| 48) ~n~0)} is VALID [2022-02-20 23:44:17,115 INFO L290 TraceCheckUtils]: 45: Hoare triple {12716#(< (+ |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; {12706#(< (+ |ULTIMATE.start_foo_~i~0#1| 48) ~n~0)} is VALID [2022-02-20 23:44:17,115 INFO L290 TraceCheckUtils]: 44: Hoare triple {12716#(< (+ |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 {12716#(< (+ |ULTIMATE.start_foo_~i~0#1| 49) ~n~0)} is VALID [2022-02-20 23:44:17,115 INFO L290 TraceCheckUtils]: 43: Hoare triple {12716#(< (+ |ULTIMATE.start_foo_~i~0#1| 49) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {12716#(< (+ |ULTIMATE.start_foo_~i~0#1| 49) ~n~0)} is VALID [2022-02-20 23:44:17,116 INFO L290 TraceCheckUtils]: 42: Hoare triple {12726#(< (+ |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; {12716#(< (+ |ULTIMATE.start_foo_~i~0#1| 49) ~n~0)} is VALID [2022-02-20 23:44:17,116 INFO L290 TraceCheckUtils]: 41: Hoare triple {12726#(< (+ |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 {12726#(< (+ |ULTIMATE.start_foo_~i~0#1| 50) ~n~0)} is VALID [2022-02-20 23:44:17,116 INFO L290 TraceCheckUtils]: 40: Hoare triple {12726#(< (+ |ULTIMATE.start_foo_~i~0#1| 50) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {12726#(< (+ |ULTIMATE.start_foo_~i~0#1| 50) ~n~0)} is VALID [2022-02-20 23:44:17,117 INFO L290 TraceCheckUtils]: 39: Hoare triple {12736#(< (+ |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; {12726#(< (+ |ULTIMATE.start_foo_~i~0#1| 50) ~n~0)} is VALID [2022-02-20 23:44:17,117 INFO L290 TraceCheckUtils]: 38: Hoare triple {12736#(< (+ |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 {12736#(< (+ |ULTIMATE.start_foo_~i~0#1| 51) ~n~0)} is VALID [2022-02-20 23:44:17,117 INFO L290 TraceCheckUtils]: 37: Hoare triple {12736#(< (+ |ULTIMATE.start_foo_~i~0#1| 51) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {12736#(< (+ |ULTIMATE.start_foo_~i~0#1| 51) ~n~0)} is VALID [2022-02-20 23:44:17,118 INFO L290 TraceCheckUtils]: 36: Hoare triple {12746#(< (+ |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; {12736#(< (+ |ULTIMATE.start_foo_~i~0#1| 51) ~n~0)} is VALID [2022-02-20 23:44:17,118 INFO L290 TraceCheckUtils]: 35: Hoare triple {12746#(< (+ |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 {12746#(< (+ |ULTIMATE.start_foo_~i~0#1| 52) ~n~0)} is VALID [2022-02-20 23:44:17,118 INFO L290 TraceCheckUtils]: 34: Hoare triple {12746#(< (+ |ULTIMATE.start_foo_~i~0#1| 52) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {12746#(< (+ |ULTIMATE.start_foo_~i~0#1| 52) ~n~0)} is VALID [2022-02-20 23:44:17,119 INFO L290 TraceCheckUtils]: 33: Hoare triple {12756#(< (+ 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; {12746#(< (+ |ULTIMATE.start_foo_~i~0#1| 52) ~n~0)} is VALID [2022-02-20 23:44:17,119 INFO L290 TraceCheckUtils]: 32: Hoare triple {12756#(< (+ 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 {12756#(< (+ 53 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:17,119 INFO L290 TraceCheckUtils]: 31: Hoare triple {12756#(< (+ 53 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {12756#(< (+ 53 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:17,120 INFO L290 TraceCheckUtils]: 30: Hoare triple {12766#(< (+ |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; {12756#(< (+ 53 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:17,120 INFO L290 TraceCheckUtils]: 29: Hoare triple {12766#(< (+ |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 {12766#(< (+ |ULTIMATE.start_foo_~i~0#1| 54) ~n~0)} is VALID [2022-02-20 23:44:17,120 INFO L290 TraceCheckUtils]: 28: Hoare triple {12766#(< (+ |ULTIMATE.start_foo_~i~0#1| 54) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {12766#(< (+ |ULTIMATE.start_foo_~i~0#1| 54) ~n~0)} is VALID [2022-02-20 23:44:17,120 INFO L290 TraceCheckUtils]: 27: Hoare triple {12776#(< (+ |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; {12766#(< (+ |ULTIMATE.start_foo_~i~0#1| 54) ~n~0)} is VALID [2022-02-20 23:44:17,121 INFO L290 TraceCheckUtils]: 26: Hoare triple {12776#(< (+ |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 {12776#(< (+ |ULTIMATE.start_foo_~i~0#1| 55) ~n~0)} is VALID [2022-02-20 23:44:17,121 INFO L290 TraceCheckUtils]: 25: Hoare triple {12776#(< (+ |ULTIMATE.start_foo_~i~0#1| 55) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {12776#(< (+ |ULTIMATE.start_foo_~i~0#1| 55) ~n~0)} is VALID [2022-02-20 23:44:17,121 INFO L290 TraceCheckUtils]: 24: Hoare triple {12786#(< (+ 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; {12776#(< (+ |ULTIMATE.start_foo_~i~0#1| 55) ~n~0)} is VALID [2022-02-20 23:44:17,121 INFO L290 TraceCheckUtils]: 23: Hoare triple {12786#(< (+ 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 {12786#(< (+ 56 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:17,122 INFO L290 TraceCheckUtils]: 22: Hoare triple {12786#(< (+ 56 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {12786#(< (+ 56 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:17,122 INFO L290 TraceCheckUtils]: 21: Hoare triple {12796#(< (+ |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; {12786#(< (+ 56 |ULTIMATE.start_foo_~i~0#1|) ~n~0)} is VALID [2022-02-20 23:44:17,122 INFO L290 TraceCheckUtils]: 20: Hoare triple {12796#(< (+ |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 {12796#(< (+ |ULTIMATE.start_foo_~i~0#1| 57) ~n~0)} is VALID [2022-02-20 23:44:17,123 INFO L290 TraceCheckUtils]: 19: Hoare triple {12796#(< (+ |ULTIMATE.start_foo_~i~0#1| 57) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {12796#(< (+ |ULTIMATE.start_foo_~i~0#1| 57) ~n~0)} is VALID [2022-02-20 23:44:17,123 INFO L290 TraceCheckUtils]: 18: Hoare triple {12806#(< (+ |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; {12796#(< (+ |ULTIMATE.start_foo_~i~0#1| 57) ~n~0)} is VALID [2022-02-20 23:44:17,123 INFO L290 TraceCheckUtils]: 17: Hoare triple {12806#(< (+ |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 {12806#(< (+ |ULTIMATE.start_foo_~i~0#1| 58) ~n~0)} is VALID [2022-02-20 23:44:17,124 INFO L290 TraceCheckUtils]: 16: Hoare triple {12806#(< (+ |ULTIMATE.start_foo_~i~0#1| 58) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {12806#(< (+ |ULTIMATE.start_foo_~i~0#1| 58) ~n~0)} is VALID [2022-02-20 23:44:17,124 INFO L290 TraceCheckUtils]: 15: Hoare triple {12816#(< (+ |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; {12806#(< (+ |ULTIMATE.start_foo_~i~0#1| 58) ~n~0)} is VALID [2022-02-20 23:44:17,124 INFO L290 TraceCheckUtils]: 14: Hoare triple {12816#(< (+ |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 {12816#(< (+ |ULTIMATE.start_foo_~i~0#1| 59) ~n~0)} is VALID [2022-02-20 23:44:17,125 INFO L290 TraceCheckUtils]: 13: Hoare triple {12816#(< (+ |ULTIMATE.start_foo_~i~0#1| 59) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {12816#(< (+ |ULTIMATE.start_foo_~i~0#1| 59) ~n~0)} is VALID [2022-02-20 23:44:17,125 INFO L290 TraceCheckUtils]: 12: Hoare triple {12826#(< (+ |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; {12816#(< (+ |ULTIMATE.start_foo_~i~0#1| 59) ~n~0)} is VALID [2022-02-20 23:44:17,125 INFO L290 TraceCheckUtils]: 11: Hoare triple {12826#(< (+ |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 {12826#(< (+ |ULTIMATE.start_foo_~i~0#1| 60) ~n~0)} is VALID [2022-02-20 23:44:17,126 INFO L290 TraceCheckUtils]: 10: Hoare triple {12826#(< (+ |ULTIMATE.start_foo_~i~0#1| 60) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {12826#(< (+ |ULTIMATE.start_foo_~i~0#1| 60) ~n~0)} is VALID [2022-02-20 23:44:17,126 INFO L290 TraceCheckUtils]: 9: Hoare triple {12836#(< (+ |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; {12826#(< (+ |ULTIMATE.start_foo_~i~0#1| 60) ~n~0)} is VALID [2022-02-20 23:44:17,126 INFO L290 TraceCheckUtils]: 8: Hoare triple {12836#(< (+ |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 {12836#(< (+ |ULTIMATE.start_foo_~i~0#1| 61) ~n~0)} is VALID [2022-02-20 23:44:17,126 INFO L290 TraceCheckUtils]: 7: Hoare triple {12836#(< (+ |ULTIMATE.start_foo_~i~0#1| 61) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {12836#(< (+ |ULTIMATE.start_foo_~i~0#1| 61) ~n~0)} is VALID [2022-02-20 23:44:17,127 INFO L290 TraceCheckUtils]: 6: Hoare triple {12846#(< (+ |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; {12836#(< (+ |ULTIMATE.start_foo_~i~0#1| 61) ~n~0)} is VALID [2022-02-20 23:44:17,127 INFO L290 TraceCheckUtils]: 5: Hoare triple {12846#(< (+ |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 {12846#(< (+ |ULTIMATE.start_foo_~i~0#1| 62) ~n~0)} is VALID [2022-02-20 23:44:17,127 INFO L290 TraceCheckUtils]: 4: Hoare triple {12846#(< (+ |ULTIMATE.start_foo_~i~0#1| 62) ~n~0)} assume !!(foo_~i~0#1 < ~n~0); {12846#(< (+ |ULTIMATE.start_foo_~i~0#1| 62) ~n~0)} is VALID [2022-02-20 23:44:17,128 INFO L290 TraceCheckUtils]: 3: Hoare triple {12856#(< 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; {12846#(< (+ |ULTIMATE.start_foo_~i~0#1| 62) ~n~0)} is VALID [2022-02-20 23:44:17,128 INFO L290 TraceCheckUtils]: 2: Hoare triple {12856#(< 62 ~n~0)} SUMMARY for call write~int(0, main_#t~post7#1.base, main_#t~post7#1.offset, 4); srcloc: L538 {12856#(< 62 ~n~0)} is VALID [2022-02-20 23:44:17,128 INFO L290 TraceCheckUtils]: 1: Hoare triple {10949#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 := 128;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; {12856#(< 62 ~n~0)} is VALID [2022-02-20 23:44:17,128 INFO L290 TraceCheckUtils]: 0: Hoare triple {10949#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; {10949#true} is VALID [2022-02-20 23:44:17,133 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:17,134 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [217298357] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:44:17,134 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:44:17,134 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 66, 66] total 162 [2022-02-20 23:44:17,134 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23846056] [2022-02-20 23:44:17,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:44:17,135 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:17,136 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:17,136 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:17,445 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:17,446 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 162 states [2022-02-20 23:44:17,446 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:44:17,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2022-02-20 23:44:17,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9346, Invalid=16736, Unknown=0, NotChecked=0, Total=26082 [2022-02-20 23:44:17,451 INFO L87 Difference]: Start difference. First operand 299 states and 300 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:28,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:28,582 INFO L93 Difference]: Finished difference Result 1579 states and 1580 transitions. [2022-02-20 23:44:28,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2022-02-20 23:44:28,583 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:28,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:28,584 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:28,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 1676 transitions. [2022-02-20 23:44:28,596 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:28,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 1676 transitions. [2022-02-20 23:44:28,607 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 129 states and 1676 transitions. [2022-02-20 23:44:29,622 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1676 edges. 1676 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:29,698 INFO L225 Difference]: With dead ends: 1579 [2022-02-20 23:44:29,698 INFO L226 Difference]: Without dead ends: 1579 [2022-02-20 23:44:29,702 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:29,703 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 7471 mSDsluCounter, 924 mSDsCounter, 0 mSdLazyCounter, 951 mSolverCounterSat, 1152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7471 SdHoareTripleChecker+Valid, 941 SdHoareTripleChecker+Invalid, 2103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1152 IncrementalHoareTripleChecker+Valid, 951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:29,703 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7471 Valid, 941 Invalid, 2103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1152 Valid, 951 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-02-20 23:44:29,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1579 states. [2022-02-20 23:44:29,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1579 to 587. [2022-02-20 23:44:29,711 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:29,711 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1579 states. Second operand has 587 states, 585 states have (on average 1.005128205128205) internal successors, (588), 586 states have internal predecessors, (588), 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:29,712 INFO L74 IsIncluded]: Start isIncluded. First operand 1579 states. Second operand has 587 states, 585 states have (on average 1.005128205128205) internal successors, (588), 586 states have internal predecessors, (588), 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:29,712 INFO L87 Difference]: Start difference. First operand 1579 states. Second operand has 587 states, 585 states have (on average 1.005128205128205) internal successors, (588), 586 states have internal predecessors, (588), 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:29,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:29,797 INFO L93 Difference]: Finished difference Result 1579 states and 1580 transitions. [2022-02-20 23:44:29,797 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 1580 transitions. [2022-02-20 23:44:29,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:29,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:29,800 INFO L74 IsIncluded]: Start isIncluded. First operand has 587 states, 585 states have (on average 1.005128205128205) internal successors, (588), 586 states have internal predecessors, (588), 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 1579 states. [2022-02-20 23:44:29,801 INFO L87 Difference]: Start difference. First operand has 587 states, 585 states have (on average 1.005128205128205) internal successors, (588), 586 states have internal predecessors, (588), 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 1579 states. [2022-02-20 23:44:29,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:29,881 INFO L93 Difference]: Finished difference Result 1579 states and 1580 transitions. [2022-02-20 23:44:29,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 1580 transitions. [2022-02-20 23:44:29,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:29,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:29,883 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:29,883 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:29,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 585 states have (on average 1.005128205128205) internal successors, (588), 586 states have internal predecessors, (588), 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:29,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 588 transitions. [2022-02-20 23:44:29,894 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 588 transitions. Word has length 293 [2022-02-20 23:44:29,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:29,895 INFO L470 AbstractCegarLoop]: Abstraction has 587 states and 588 transitions. [2022-02-20 23:44:29,895 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:29,895 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 588 transitions. [2022-02-20 23:44:29,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 582 [2022-02-20 23:44:29,901 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:29,901 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:29,920 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:30,115 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:30,116 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2022-02-20 23:44:30,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:30,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1251511955, now seen corresponding path program 3 times [2022-02-20 23:44:30,116 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:44:30,116 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963323052] [2022-02-20 23:44:30,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:30,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:44:30,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:31,821 INFO L290 TraceCheckUtils]: 0: Hoare triple {18381#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; {18381#true} is VALID [2022-02-20 23:44:31,822 INFO L290 TraceCheckUtils]: 1: Hoare triple {18381#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 := 128;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; {18381#true} is VALID [2022-02-20 23:44:31,822 INFO L290 TraceCheckUtils]: 2: Hoare triple {18381#true} SUMMARY for call write~int(0, main_#t~post7#1.base, main_#t~post7#1.offset, 4); srcloc: L538 {18381#true} is VALID [2022-02-20 23:44:31,822 INFO L290 TraceCheckUtils]: 3: Hoare triple {18381#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; {18381#true} is VALID [2022-02-20 23:44:31,822 INFO L290 TraceCheckUtils]: 4: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,822 INFO L290 TraceCheckUtils]: 5: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,822 INFO L290 TraceCheckUtils]: 6: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,822 INFO L290 TraceCheckUtils]: 7: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,822 INFO L290 TraceCheckUtils]: 8: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,822 INFO L290 TraceCheckUtils]: 9: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,822 INFO L290 TraceCheckUtils]: 10: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,822 INFO L290 TraceCheckUtils]: 11: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,822 INFO L290 TraceCheckUtils]: 12: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,822 INFO L290 TraceCheckUtils]: 13: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,822 INFO L290 TraceCheckUtils]: 14: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,822 INFO L290 TraceCheckUtils]: 15: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,822 INFO L290 TraceCheckUtils]: 16: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,823 INFO L290 TraceCheckUtils]: 17: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,823 INFO L290 TraceCheckUtils]: 18: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,823 INFO L290 TraceCheckUtils]: 19: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,823 INFO L290 TraceCheckUtils]: 20: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,823 INFO L290 TraceCheckUtils]: 21: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,823 INFO L290 TraceCheckUtils]: 22: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,823 INFO L290 TraceCheckUtils]: 23: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,823 INFO L290 TraceCheckUtils]: 24: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,824 INFO L290 TraceCheckUtils]: 25: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,824 INFO L290 TraceCheckUtils]: 26: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,824 INFO L290 TraceCheckUtils]: 27: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,824 INFO L290 TraceCheckUtils]: 28: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,824 INFO L290 TraceCheckUtils]: 29: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,824 INFO L290 TraceCheckUtils]: 30: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,824 INFO L290 TraceCheckUtils]: 31: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,824 INFO L290 TraceCheckUtils]: 32: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,824 INFO L290 TraceCheckUtils]: 33: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,825 INFO L290 TraceCheckUtils]: 34: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,825 INFO L290 TraceCheckUtils]: 35: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,825 INFO L290 TraceCheckUtils]: 36: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,825 INFO L290 TraceCheckUtils]: 37: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,825 INFO L290 TraceCheckUtils]: 38: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,825 INFO L290 TraceCheckUtils]: 39: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,825 INFO L290 TraceCheckUtils]: 40: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,825 INFO L290 TraceCheckUtils]: 41: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,825 INFO L290 TraceCheckUtils]: 42: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,826 INFO L290 TraceCheckUtils]: 43: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,826 INFO L290 TraceCheckUtils]: 44: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,826 INFO L290 TraceCheckUtils]: 45: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,826 INFO L290 TraceCheckUtils]: 46: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,826 INFO L290 TraceCheckUtils]: 47: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,826 INFO L290 TraceCheckUtils]: 48: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,826 INFO L290 TraceCheckUtils]: 49: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,826 INFO L290 TraceCheckUtils]: 50: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,827 INFO L290 TraceCheckUtils]: 51: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,827 INFO L290 TraceCheckUtils]: 52: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,827 INFO L290 TraceCheckUtils]: 53: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,827 INFO L290 TraceCheckUtils]: 54: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,827 INFO L290 TraceCheckUtils]: 55: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,827 INFO L290 TraceCheckUtils]: 56: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,827 INFO L290 TraceCheckUtils]: 57: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,827 INFO L290 TraceCheckUtils]: 58: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,827 INFO L290 TraceCheckUtils]: 59: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,828 INFO L290 TraceCheckUtils]: 60: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,828 INFO L290 TraceCheckUtils]: 61: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,828 INFO L290 TraceCheckUtils]: 62: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,828 INFO L290 TraceCheckUtils]: 63: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,828 INFO L290 TraceCheckUtils]: 64: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,828 INFO L290 TraceCheckUtils]: 65: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,828 INFO L290 TraceCheckUtils]: 66: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,828 INFO L290 TraceCheckUtils]: 67: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,829 INFO L290 TraceCheckUtils]: 68: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,829 INFO L290 TraceCheckUtils]: 69: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,829 INFO L290 TraceCheckUtils]: 70: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,829 INFO L290 TraceCheckUtils]: 71: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,829 INFO L290 TraceCheckUtils]: 72: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,829 INFO L290 TraceCheckUtils]: 73: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,829 INFO L290 TraceCheckUtils]: 74: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,829 INFO L290 TraceCheckUtils]: 75: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,829 INFO L290 TraceCheckUtils]: 76: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,830 INFO L290 TraceCheckUtils]: 77: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,830 INFO L290 TraceCheckUtils]: 78: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,830 INFO L290 TraceCheckUtils]: 79: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,830 INFO L290 TraceCheckUtils]: 80: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,830 INFO L290 TraceCheckUtils]: 81: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,830 INFO L290 TraceCheckUtils]: 82: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,830 INFO L290 TraceCheckUtils]: 83: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,830 INFO L290 TraceCheckUtils]: 84: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,831 INFO L290 TraceCheckUtils]: 85: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,831 INFO L290 TraceCheckUtils]: 86: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,831 INFO L290 TraceCheckUtils]: 87: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,831 INFO L290 TraceCheckUtils]: 88: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,831 INFO L290 TraceCheckUtils]: 89: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,831 INFO L290 TraceCheckUtils]: 90: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,831 INFO L290 TraceCheckUtils]: 91: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,831 INFO L290 TraceCheckUtils]: 92: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,831 INFO L290 TraceCheckUtils]: 93: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,832 INFO L290 TraceCheckUtils]: 94: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,832 INFO L290 TraceCheckUtils]: 95: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,832 INFO L290 TraceCheckUtils]: 96: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,832 INFO L290 TraceCheckUtils]: 97: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,832 INFO L290 TraceCheckUtils]: 98: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,832 INFO L290 TraceCheckUtils]: 99: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,832 INFO L290 TraceCheckUtils]: 100: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,832 INFO L290 TraceCheckUtils]: 101: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,833 INFO L290 TraceCheckUtils]: 102: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,833 INFO L290 TraceCheckUtils]: 103: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,833 INFO L290 TraceCheckUtils]: 104: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,833 INFO L290 TraceCheckUtils]: 105: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,833 INFO L290 TraceCheckUtils]: 106: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,833 INFO L290 TraceCheckUtils]: 107: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,833 INFO L290 TraceCheckUtils]: 108: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,833 INFO L290 TraceCheckUtils]: 109: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,833 INFO L290 TraceCheckUtils]: 110: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,834 INFO L290 TraceCheckUtils]: 111: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,834 INFO L290 TraceCheckUtils]: 112: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,834 INFO L290 TraceCheckUtils]: 113: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,834 INFO L290 TraceCheckUtils]: 114: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,834 INFO L290 TraceCheckUtils]: 115: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,834 INFO L290 TraceCheckUtils]: 116: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,834 INFO L290 TraceCheckUtils]: 117: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,834 INFO L290 TraceCheckUtils]: 118: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,834 INFO L290 TraceCheckUtils]: 119: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,834 INFO L290 TraceCheckUtils]: 120: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,835 INFO L290 TraceCheckUtils]: 121: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,835 INFO L290 TraceCheckUtils]: 122: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,835 INFO L290 TraceCheckUtils]: 123: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,835 INFO L290 TraceCheckUtils]: 124: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,835 INFO L290 TraceCheckUtils]: 125: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,835 INFO L290 TraceCheckUtils]: 126: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,835 INFO L290 TraceCheckUtils]: 127: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,835 INFO L290 TraceCheckUtils]: 128: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,835 INFO L290 TraceCheckUtils]: 129: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,835 INFO L290 TraceCheckUtils]: 130: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,835 INFO L290 TraceCheckUtils]: 131: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,835 INFO L290 TraceCheckUtils]: 132: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,835 INFO L290 TraceCheckUtils]: 133: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,835 INFO L290 TraceCheckUtils]: 134: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,835 INFO L290 TraceCheckUtils]: 135: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,835 INFO L290 TraceCheckUtils]: 136: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,835 INFO L290 TraceCheckUtils]: 137: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,836 INFO L290 TraceCheckUtils]: 138: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,836 INFO L290 TraceCheckUtils]: 139: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,836 INFO L290 TraceCheckUtils]: 140: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,836 INFO L290 TraceCheckUtils]: 141: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,836 INFO L290 TraceCheckUtils]: 142: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,836 INFO L290 TraceCheckUtils]: 143: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,836 INFO L290 TraceCheckUtils]: 144: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,836 INFO L290 TraceCheckUtils]: 145: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,836 INFO L290 TraceCheckUtils]: 146: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,836 INFO L290 TraceCheckUtils]: 147: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,836 INFO L290 TraceCheckUtils]: 148: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,836 INFO L290 TraceCheckUtils]: 149: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,836 INFO L290 TraceCheckUtils]: 150: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,836 INFO L290 TraceCheckUtils]: 151: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,836 INFO L290 TraceCheckUtils]: 152: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,836 INFO L290 TraceCheckUtils]: 153: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,836 INFO L290 TraceCheckUtils]: 154: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,837 INFO L290 TraceCheckUtils]: 155: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,837 INFO L290 TraceCheckUtils]: 156: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,837 INFO L290 TraceCheckUtils]: 157: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,837 INFO L290 TraceCheckUtils]: 158: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,837 INFO L290 TraceCheckUtils]: 159: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,837 INFO L290 TraceCheckUtils]: 160: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,837 INFO L290 TraceCheckUtils]: 161: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,837 INFO L290 TraceCheckUtils]: 162: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,837 INFO L290 TraceCheckUtils]: 163: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,837 INFO L290 TraceCheckUtils]: 164: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,837 INFO L290 TraceCheckUtils]: 165: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,837 INFO L290 TraceCheckUtils]: 166: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,837 INFO L290 TraceCheckUtils]: 167: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,837 INFO L290 TraceCheckUtils]: 168: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,837 INFO L290 TraceCheckUtils]: 169: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,837 INFO L290 TraceCheckUtils]: 170: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,837 INFO L290 TraceCheckUtils]: 171: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,838 INFO L290 TraceCheckUtils]: 172: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,838 INFO L290 TraceCheckUtils]: 173: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,838 INFO L290 TraceCheckUtils]: 174: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,838 INFO L290 TraceCheckUtils]: 175: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,838 INFO L290 TraceCheckUtils]: 176: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,838 INFO L290 TraceCheckUtils]: 177: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,838 INFO L290 TraceCheckUtils]: 178: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,838 INFO L290 TraceCheckUtils]: 179: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,838 INFO L290 TraceCheckUtils]: 180: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,838 INFO L290 TraceCheckUtils]: 181: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,838 INFO L290 TraceCheckUtils]: 182: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,838 INFO L290 TraceCheckUtils]: 183: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,838 INFO L290 TraceCheckUtils]: 184: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,838 INFO L290 TraceCheckUtils]: 185: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,838 INFO L290 TraceCheckUtils]: 186: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,838 INFO L290 TraceCheckUtils]: 187: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,839 INFO L290 TraceCheckUtils]: 188: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,839 INFO L290 TraceCheckUtils]: 189: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,839 INFO L290 TraceCheckUtils]: 190: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,839 INFO L290 TraceCheckUtils]: 191: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,839 INFO L290 TraceCheckUtils]: 192: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,839 INFO L290 TraceCheckUtils]: 193: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,839 INFO L290 TraceCheckUtils]: 194: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,839 INFO L290 TraceCheckUtils]: 195: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,839 INFO L290 TraceCheckUtils]: 196: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,839 INFO L290 TraceCheckUtils]: 197: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,839 INFO L290 TraceCheckUtils]: 198: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,839 INFO L290 TraceCheckUtils]: 199: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,839 INFO L290 TraceCheckUtils]: 200: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,839 INFO L290 TraceCheckUtils]: 201: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,839 INFO L290 TraceCheckUtils]: 202: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,839 INFO L290 TraceCheckUtils]: 203: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,840 INFO L290 TraceCheckUtils]: 204: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,840 INFO L290 TraceCheckUtils]: 205: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,840 INFO L290 TraceCheckUtils]: 206: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,840 INFO L290 TraceCheckUtils]: 207: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,840 INFO L290 TraceCheckUtils]: 208: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,840 INFO L290 TraceCheckUtils]: 209: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,840 INFO L290 TraceCheckUtils]: 210: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,840 INFO L290 TraceCheckUtils]: 211: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,840 INFO L290 TraceCheckUtils]: 212: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,840 INFO L290 TraceCheckUtils]: 213: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,840 INFO L290 TraceCheckUtils]: 214: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,840 INFO L290 TraceCheckUtils]: 215: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,840 INFO L290 TraceCheckUtils]: 216: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,840 INFO L290 TraceCheckUtils]: 217: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,841 INFO L290 TraceCheckUtils]: 218: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,841 INFO L290 TraceCheckUtils]: 219: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,841 INFO L290 TraceCheckUtils]: 220: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,841 INFO L290 TraceCheckUtils]: 221: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,841 INFO L290 TraceCheckUtils]: 222: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,841 INFO L290 TraceCheckUtils]: 223: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,841 INFO L290 TraceCheckUtils]: 224: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,841 INFO L290 TraceCheckUtils]: 225: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,841 INFO L290 TraceCheckUtils]: 226: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,842 INFO L290 TraceCheckUtils]: 227: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,842 INFO L290 TraceCheckUtils]: 228: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,842 INFO L290 TraceCheckUtils]: 229: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,842 INFO L290 TraceCheckUtils]: 230: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,842 INFO L290 TraceCheckUtils]: 231: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,842 INFO L290 TraceCheckUtils]: 232: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,842 INFO L290 TraceCheckUtils]: 233: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,842 INFO L290 TraceCheckUtils]: 234: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,843 INFO L290 TraceCheckUtils]: 235: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,843 INFO L290 TraceCheckUtils]: 236: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,843 INFO L290 TraceCheckUtils]: 237: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,843 INFO L290 TraceCheckUtils]: 238: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,843 INFO L290 TraceCheckUtils]: 239: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,843 INFO L290 TraceCheckUtils]: 240: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,843 INFO L290 TraceCheckUtils]: 241: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,843 INFO L290 TraceCheckUtils]: 242: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,844 INFO L290 TraceCheckUtils]: 243: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,844 INFO L290 TraceCheckUtils]: 244: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,844 INFO L290 TraceCheckUtils]: 245: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,844 INFO L290 TraceCheckUtils]: 246: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,844 INFO L290 TraceCheckUtils]: 247: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,844 INFO L290 TraceCheckUtils]: 248: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,844 INFO L290 TraceCheckUtils]: 249: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,844 INFO L290 TraceCheckUtils]: 250: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,845 INFO L290 TraceCheckUtils]: 251: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,845 INFO L290 TraceCheckUtils]: 252: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,845 INFO L290 TraceCheckUtils]: 253: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,845 INFO L290 TraceCheckUtils]: 254: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,845 INFO L290 TraceCheckUtils]: 255: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,845 INFO L290 TraceCheckUtils]: 256: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,845 INFO L290 TraceCheckUtils]: 257: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,845 INFO L290 TraceCheckUtils]: 258: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,846 INFO L290 TraceCheckUtils]: 259: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,846 INFO L290 TraceCheckUtils]: 260: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,846 INFO L290 TraceCheckUtils]: 261: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,846 INFO L290 TraceCheckUtils]: 262: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,846 INFO L290 TraceCheckUtils]: 263: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,846 INFO L290 TraceCheckUtils]: 264: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,846 INFO L290 TraceCheckUtils]: 265: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,846 INFO L290 TraceCheckUtils]: 266: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,846 INFO L290 TraceCheckUtils]: 267: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,847 INFO L290 TraceCheckUtils]: 268: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,847 INFO L290 TraceCheckUtils]: 269: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,847 INFO L290 TraceCheckUtils]: 270: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,847 INFO L290 TraceCheckUtils]: 271: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,847 INFO L290 TraceCheckUtils]: 272: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,847 INFO L290 TraceCheckUtils]: 273: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,847 INFO L290 TraceCheckUtils]: 274: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,847 INFO L290 TraceCheckUtils]: 275: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,848 INFO L290 TraceCheckUtils]: 276: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,848 INFO L290 TraceCheckUtils]: 277: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,848 INFO L290 TraceCheckUtils]: 278: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,848 INFO L290 TraceCheckUtils]: 279: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,848 INFO L290 TraceCheckUtils]: 280: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,848 INFO L290 TraceCheckUtils]: 281: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,848 INFO L290 TraceCheckUtils]: 282: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,848 INFO L290 TraceCheckUtils]: 283: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,849 INFO L290 TraceCheckUtils]: 284: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,849 INFO L290 TraceCheckUtils]: 285: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,849 INFO L290 TraceCheckUtils]: 286: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,849 INFO L290 TraceCheckUtils]: 287: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,849 INFO L290 TraceCheckUtils]: 288: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,849 INFO L290 TraceCheckUtils]: 289: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,849 INFO L290 TraceCheckUtils]: 290: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,849 INFO L290 TraceCheckUtils]: 291: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,849 INFO L290 TraceCheckUtils]: 292: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,849 INFO L290 TraceCheckUtils]: 293: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,849 INFO L290 TraceCheckUtils]: 294: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,850 INFO L290 TraceCheckUtils]: 295: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,850 INFO L290 TraceCheckUtils]: 296: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,850 INFO L290 TraceCheckUtils]: 297: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,850 INFO L290 TraceCheckUtils]: 298: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,850 INFO L290 TraceCheckUtils]: 299: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,850 INFO L290 TraceCheckUtils]: 300: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,850 INFO L290 TraceCheckUtils]: 301: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,850 INFO L290 TraceCheckUtils]: 302: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,850 INFO L290 TraceCheckUtils]: 303: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,850 INFO L290 TraceCheckUtils]: 304: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,850 INFO L290 TraceCheckUtils]: 305: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,850 INFO L290 TraceCheckUtils]: 306: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,850 INFO L290 TraceCheckUtils]: 307: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,850 INFO L290 TraceCheckUtils]: 308: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,850 INFO L290 TraceCheckUtils]: 309: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,850 INFO L290 TraceCheckUtils]: 310: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,851 INFO L290 TraceCheckUtils]: 311: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,851 INFO L290 TraceCheckUtils]: 312: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,851 INFO L290 TraceCheckUtils]: 313: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,851 INFO L290 TraceCheckUtils]: 314: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,851 INFO L290 TraceCheckUtils]: 315: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,851 INFO L290 TraceCheckUtils]: 316: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,851 INFO L290 TraceCheckUtils]: 317: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,851 INFO L290 TraceCheckUtils]: 318: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,851 INFO L290 TraceCheckUtils]: 319: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,851 INFO L290 TraceCheckUtils]: 320: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,851 INFO L290 TraceCheckUtils]: 321: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,851 INFO L290 TraceCheckUtils]: 322: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,851 INFO L290 TraceCheckUtils]: 323: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,851 INFO L290 TraceCheckUtils]: 324: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,851 INFO L290 TraceCheckUtils]: 325: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,851 INFO L290 TraceCheckUtils]: 326: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,852 INFO L290 TraceCheckUtils]: 327: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,852 INFO L290 TraceCheckUtils]: 328: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,852 INFO L290 TraceCheckUtils]: 329: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,852 INFO L290 TraceCheckUtils]: 330: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,852 INFO L290 TraceCheckUtils]: 331: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,852 INFO L290 TraceCheckUtils]: 332: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,852 INFO L290 TraceCheckUtils]: 333: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,852 INFO L290 TraceCheckUtils]: 334: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,852 INFO L290 TraceCheckUtils]: 335: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,852 INFO L290 TraceCheckUtils]: 336: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,852 INFO L290 TraceCheckUtils]: 337: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,852 INFO L290 TraceCheckUtils]: 338: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,852 INFO L290 TraceCheckUtils]: 339: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,852 INFO L290 TraceCheckUtils]: 340: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,852 INFO L290 TraceCheckUtils]: 341: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,852 INFO L290 TraceCheckUtils]: 342: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,852 INFO L290 TraceCheckUtils]: 343: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,853 INFO L290 TraceCheckUtils]: 344: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,853 INFO L290 TraceCheckUtils]: 345: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,853 INFO L290 TraceCheckUtils]: 346: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,853 INFO L290 TraceCheckUtils]: 347: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,853 INFO L290 TraceCheckUtils]: 348: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,853 INFO L290 TraceCheckUtils]: 349: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,853 INFO L290 TraceCheckUtils]: 350: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,853 INFO L290 TraceCheckUtils]: 351: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,853 INFO L290 TraceCheckUtils]: 352: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,853 INFO L290 TraceCheckUtils]: 353: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,853 INFO L290 TraceCheckUtils]: 354: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,853 INFO L290 TraceCheckUtils]: 355: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,853 INFO L290 TraceCheckUtils]: 356: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,853 INFO L290 TraceCheckUtils]: 357: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,853 INFO L290 TraceCheckUtils]: 358: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,853 INFO L290 TraceCheckUtils]: 359: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,854 INFO L290 TraceCheckUtils]: 360: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,854 INFO L290 TraceCheckUtils]: 361: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,854 INFO L290 TraceCheckUtils]: 362: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,854 INFO L290 TraceCheckUtils]: 363: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,854 INFO L290 TraceCheckUtils]: 364: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,854 INFO L290 TraceCheckUtils]: 365: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,854 INFO L290 TraceCheckUtils]: 366: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,854 INFO L290 TraceCheckUtils]: 367: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,854 INFO L290 TraceCheckUtils]: 368: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,854 INFO L290 TraceCheckUtils]: 369: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,854 INFO L290 TraceCheckUtils]: 370: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,854 INFO L290 TraceCheckUtils]: 371: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,854 INFO L290 TraceCheckUtils]: 372: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,854 INFO L290 TraceCheckUtils]: 373: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,854 INFO L290 TraceCheckUtils]: 374: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,854 INFO L290 TraceCheckUtils]: 375: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,855 INFO L290 TraceCheckUtils]: 376: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,855 INFO L290 TraceCheckUtils]: 377: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,855 INFO L290 TraceCheckUtils]: 378: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,855 INFO L290 TraceCheckUtils]: 379: Hoare triple {18381#true} assume !!(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,855 INFO L290 TraceCheckUtils]: 380: Hoare triple {18381#true} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L529 {18381#true} is VALID [2022-02-20 23:44:31,855 INFO L290 TraceCheckUtils]: 381: Hoare triple {18381#true} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {18381#true} is VALID [2022-02-20 23:44:31,855 INFO L290 TraceCheckUtils]: 382: Hoare triple {18381#true} assume !(foo_~i~0#1 < ~n~0); {18381#true} is VALID [2022-02-20 23:44:31,855 INFO L290 TraceCheckUtils]: 383: Hoare triple {18381#true} foo_~i~0#1 := 0; {18383#(= |ULTIMATE.start_foo_~i~0#1| 0)} is VALID [2022-02-20 23:44:31,856 INFO L290 TraceCheckUtils]: 384: Hoare triple {18383#(= |ULTIMATE.start_foo_~i~0#1| 0)} assume !!(foo_~i~0#1 < 127); {18383#(= |ULTIMATE.start_foo_~i~0#1| 0)} is VALID [2022-02-20 23:44:31,856 INFO L290 TraceCheckUtils]: 385: Hoare triple {18383#(= |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 {18383#(= |ULTIMATE.start_foo_~i~0#1| 0)} is VALID [2022-02-20 23:44:31,856 INFO L290 TraceCheckUtils]: 386: Hoare triple {18383#(= |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; {18384#(<= |ULTIMATE.start_foo_~i~0#1| 1)} is VALID [2022-02-20 23:44:31,857 INFO L290 TraceCheckUtils]: 387: Hoare triple {18384#(<= |ULTIMATE.start_foo_~i~0#1| 1)} assume !!(foo_~i~0#1 < 127); {18384#(<= |ULTIMATE.start_foo_~i~0#1| 1)} is VALID [2022-02-20 23:44:31,857 INFO L290 TraceCheckUtils]: 388: Hoare triple {18384#(<= |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 {18384#(<= |ULTIMATE.start_foo_~i~0#1| 1)} is VALID [2022-02-20 23:44:31,857 INFO L290 TraceCheckUtils]: 389: Hoare triple {18384#(<= |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; {18385#(<= |ULTIMATE.start_foo_~i~0#1| 2)} is VALID [2022-02-20 23:44:31,858 INFO L290 TraceCheckUtils]: 390: Hoare triple {18385#(<= |ULTIMATE.start_foo_~i~0#1| 2)} assume !!(foo_~i~0#1 < 127); {18385#(<= |ULTIMATE.start_foo_~i~0#1| 2)} is VALID [2022-02-20 23:44:31,858 INFO L290 TraceCheckUtils]: 391: Hoare triple {18385#(<= |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 {18385#(<= |ULTIMATE.start_foo_~i~0#1| 2)} is VALID [2022-02-20 23:44:31,858 INFO L290 TraceCheckUtils]: 392: Hoare triple {18385#(<= |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; {18386#(<= |ULTIMATE.start_foo_~i~0#1| 3)} is VALID [2022-02-20 23:44:31,859 INFO L290 TraceCheckUtils]: 393: Hoare triple {18386#(<= |ULTIMATE.start_foo_~i~0#1| 3)} assume !!(foo_~i~0#1 < 127); {18386#(<= |ULTIMATE.start_foo_~i~0#1| 3)} is VALID [2022-02-20 23:44:31,859 INFO L290 TraceCheckUtils]: 394: Hoare triple {18386#(<= |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 {18386#(<= |ULTIMATE.start_foo_~i~0#1| 3)} is VALID [2022-02-20 23:44:31,859 INFO L290 TraceCheckUtils]: 395: Hoare triple {18386#(<= |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; {18387#(<= |ULTIMATE.start_foo_~i~0#1| 4)} is VALID [2022-02-20 23:44:31,860 INFO L290 TraceCheckUtils]: 396: Hoare triple {18387#(<= |ULTIMATE.start_foo_~i~0#1| 4)} assume !!(foo_~i~0#1 < 127); {18387#(<= |ULTIMATE.start_foo_~i~0#1| 4)} is VALID [2022-02-20 23:44:31,860 INFO L290 TraceCheckUtils]: 397: Hoare triple {18387#(<= |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 {18387#(<= |ULTIMATE.start_foo_~i~0#1| 4)} is VALID [2022-02-20 23:44:31,860 INFO L290 TraceCheckUtils]: 398: Hoare triple {18387#(<= |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; {18388#(<= |ULTIMATE.start_foo_~i~0#1| 5)} is VALID [2022-02-20 23:44:31,861 INFO L290 TraceCheckUtils]: 399: Hoare triple {18388#(<= |ULTIMATE.start_foo_~i~0#1| 5)} assume !!(foo_~i~0#1 < 127); {18388#(<= |ULTIMATE.start_foo_~i~0#1| 5)} is VALID [2022-02-20 23:44:31,861 INFO L290 TraceCheckUtils]: 400: Hoare triple {18388#(<= |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 {18388#(<= |ULTIMATE.start_foo_~i~0#1| 5)} is VALID [2022-02-20 23:44:31,861 INFO L290 TraceCheckUtils]: 401: Hoare triple {18388#(<= |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; {18389#(<= |ULTIMATE.start_foo_~i~0#1| 6)} is VALID [2022-02-20 23:44:31,861 INFO L290 TraceCheckUtils]: 402: Hoare triple {18389#(<= |ULTIMATE.start_foo_~i~0#1| 6)} assume !!(foo_~i~0#1 < 127); {18389#(<= |ULTIMATE.start_foo_~i~0#1| 6)} is VALID [2022-02-20 23:44:31,862 INFO L290 TraceCheckUtils]: 403: Hoare triple {18389#(<= |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 {18389#(<= |ULTIMATE.start_foo_~i~0#1| 6)} is VALID [2022-02-20 23:44:31,862 INFO L290 TraceCheckUtils]: 404: Hoare triple {18389#(<= |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; {18390#(<= |ULTIMATE.start_foo_~i~0#1| 7)} is VALID [2022-02-20 23:44:31,862 INFO L290 TraceCheckUtils]: 405: Hoare triple {18390#(<= |ULTIMATE.start_foo_~i~0#1| 7)} assume !!(foo_~i~0#1 < 127); {18390#(<= |ULTIMATE.start_foo_~i~0#1| 7)} is VALID [2022-02-20 23:44:31,863 INFO L290 TraceCheckUtils]: 406: Hoare triple {18390#(<= |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 {18390#(<= |ULTIMATE.start_foo_~i~0#1| 7)} is VALID [2022-02-20 23:44:31,863 INFO L290 TraceCheckUtils]: 407: Hoare triple {18390#(<= |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; {18391#(<= |ULTIMATE.start_foo_~i~0#1| 8)} is VALID [2022-02-20 23:44:31,863 INFO L290 TraceCheckUtils]: 408: Hoare triple {18391#(<= |ULTIMATE.start_foo_~i~0#1| 8)} assume !!(foo_~i~0#1 < 127); {18391#(<= |ULTIMATE.start_foo_~i~0#1| 8)} is VALID [2022-02-20 23:44:31,863 INFO L290 TraceCheckUtils]: 409: Hoare triple {18391#(<= |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 {18391#(<= |ULTIMATE.start_foo_~i~0#1| 8)} is VALID [2022-02-20 23:44:31,864 INFO L290 TraceCheckUtils]: 410: Hoare triple {18391#(<= |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; {18392#(<= |ULTIMATE.start_foo_~i~0#1| 9)} is VALID [2022-02-20 23:44:31,864 INFO L290 TraceCheckUtils]: 411: Hoare triple {18392#(<= |ULTIMATE.start_foo_~i~0#1| 9)} assume !!(foo_~i~0#1 < 127); {18392#(<= |ULTIMATE.start_foo_~i~0#1| 9)} is VALID [2022-02-20 23:44:31,864 INFO L290 TraceCheckUtils]: 412: Hoare triple {18392#(<= |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 {18392#(<= |ULTIMATE.start_foo_~i~0#1| 9)} is VALID [2022-02-20 23:44:31,865 INFO L290 TraceCheckUtils]: 413: Hoare triple {18392#(<= |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; {18393#(<= |ULTIMATE.start_foo_~i~0#1| 10)} is VALID [2022-02-20 23:44:31,865 INFO L290 TraceCheckUtils]: 414: Hoare triple {18393#(<= |ULTIMATE.start_foo_~i~0#1| 10)} assume !!(foo_~i~0#1 < 127); {18393#(<= |ULTIMATE.start_foo_~i~0#1| 10)} is VALID [2022-02-20 23:44:31,865 INFO L290 TraceCheckUtils]: 415: Hoare triple {18393#(<= |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 {18393#(<= |ULTIMATE.start_foo_~i~0#1| 10)} is VALID [2022-02-20 23:44:31,866 INFO L290 TraceCheckUtils]: 416: Hoare triple {18393#(<= |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; {18394#(<= |ULTIMATE.start_foo_~i~0#1| 11)} is VALID [2022-02-20 23:44:31,866 INFO L290 TraceCheckUtils]: 417: Hoare triple {18394#(<= |ULTIMATE.start_foo_~i~0#1| 11)} assume !!(foo_~i~0#1 < 127); {18394#(<= |ULTIMATE.start_foo_~i~0#1| 11)} is VALID [2022-02-20 23:44:31,866 INFO L290 TraceCheckUtils]: 418: Hoare triple {18394#(<= |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 {18394#(<= |ULTIMATE.start_foo_~i~0#1| 11)} is VALID [2022-02-20 23:44:31,867 INFO L290 TraceCheckUtils]: 419: Hoare triple {18394#(<= |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; {18395#(<= |ULTIMATE.start_foo_~i~0#1| 12)} is VALID [2022-02-20 23:44:31,867 INFO L290 TraceCheckUtils]: 420: Hoare triple {18395#(<= |ULTIMATE.start_foo_~i~0#1| 12)} assume !!(foo_~i~0#1 < 127); {18395#(<= |ULTIMATE.start_foo_~i~0#1| 12)} is VALID [2022-02-20 23:44:31,867 INFO L290 TraceCheckUtils]: 421: Hoare triple {18395#(<= |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 {18395#(<= |ULTIMATE.start_foo_~i~0#1| 12)} is VALID [2022-02-20 23:44:31,868 INFO L290 TraceCheckUtils]: 422: Hoare triple {18395#(<= |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; {18396#(<= |ULTIMATE.start_foo_~i~0#1| 13)} is VALID [2022-02-20 23:44:31,868 INFO L290 TraceCheckUtils]: 423: Hoare triple {18396#(<= |ULTIMATE.start_foo_~i~0#1| 13)} assume !!(foo_~i~0#1 < 127); {18396#(<= |ULTIMATE.start_foo_~i~0#1| 13)} is VALID [2022-02-20 23:44:31,868 INFO L290 TraceCheckUtils]: 424: Hoare triple {18396#(<= |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 {18396#(<= |ULTIMATE.start_foo_~i~0#1| 13)} is VALID [2022-02-20 23:44:31,869 INFO L290 TraceCheckUtils]: 425: Hoare triple {18396#(<= |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; {18397#(<= |ULTIMATE.start_foo_~i~0#1| 14)} is VALID [2022-02-20 23:44:31,869 INFO L290 TraceCheckUtils]: 426: Hoare triple {18397#(<= |ULTIMATE.start_foo_~i~0#1| 14)} assume !!(foo_~i~0#1 < 127); {18397#(<= |ULTIMATE.start_foo_~i~0#1| 14)} is VALID [2022-02-20 23:44:31,869 INFO L290 TraceCheckUtils]: 427: Hoare triple {18397#(<= |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 {18397#(<= |ULTIMATE.start_foo_~i~0#1| 14)} is VALID [2022-02-20 23:44:31,870 INFO L290 TraceCheckUtils]: 428: Hoare triple {18397#(<= |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; {18398#(<= |ULTIMATE.start_foo_~i~0#1| 15)} is VALID [2022-02-20 23:44:31,870 INFO L290 TraceCheckUtils]: 429: Hoare triple {18398#(<= |ULTIMATE.start_foo_~i~0#1| 15)} assume !!(foo_~i~0#1 < 127); {18398#(<= |ULTIMATE.start_foo_~i~0#1| 15)} is VALID [2022-02-20 23:44:31,870 INFO L290 TraceCheckUtils]: 430: Hoare triple {18398#(<= |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 {18398#(<= |ULTIMATE.start_foo_~i~0#1| 15)} is VALID [2022-02-20 23:44:31,870 INFO L290 TraceCheckUtils]: 431: Hoare triple {18398#(<= |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; {18399#(<= |ULTIMATE.start_foo_~i~0#1| 16)} is VALID [2022-02-20 23:44:31,871 INFO L290 TraceCheckUtils]: 432: Hoare triple {18399#(<= |ULTIMATE.start_foo_~i~0#1| 16)} assume !!(foo_~i~0#1 < 127); {18399#(<= |ULTIMATE.start_foo_~i~0#1| 16)} is VALID [2022-02-20 23:44:31,871 INFO L290 TraceCheckUtils]: 433: Hoare triple {18399#(<= |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 {18399#(<= |ULTIMATE.start_foo_~i~0#1| 16)} is VALID [2022-02-20 23:44:31,871 INFO L290 TraceCheckUtils]: 434: Hoare triple {18399#(<= |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; {18400#(<= |ULTIMATE.start_foo_~i~0#1| 17)} is VALID [2022-02-20 23:44:31,872 INFO L290 TraceCheckUtils]: 435: Hoare triple {18400#(<= |ULTIMATE.start_foo_~i~0#1| 17)} assume !!(foo_~i~0#1 < 127); {18400#(<= |ULTIMATE.start_foo_~i~0#1| 17)} is VALID [2022-02-20 23:44:31,872 INFO L290 TraceCheckUtils]: 436: Hoare triple {18400#(<= |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 {18400#(<= |ULTIMATE.start_foo_~i~0#1| 17)} is VALID [2022-02-20 23:44:31,872 INFO L290 TraceCheckUtils]: 437: Hoare triple {18400#(<= |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; {18401#(<= |ULTIMATE.start_foo_~i~0#1| 18)} is VALID [2022-02-20 23:44:31,873 INFO L290 TraceCheckUtils]: 438: Hoare triple {18401#(<= |ULTIMATE.start_foo_~i~0#1| 18)} assume !!(foo_~i~0#1 < 127); {18401#(<= |ULTIMATE.start_foo_~i~0#1| 18)} is VALID [2022-02-20 23:44:31,873 INFO L290 TraceCheckUtils]: 439: Hoare triple {18401#(<= |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 {18401#(<= |ULTIMATE.start_foo_~i~0#1| 18)} is VALID [2022-02-20 23:44:31,873 INFO L290 TraceCheckUtils]: 440: Hoare triple {18401#(<= |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; {18402#(<= |ULTIMATE.start_foo_~i~0#1| 19)} is VALID [2022-02-20 23:44:31,874 INFO L290 TraceCheckUtils]: 441: Hoare triple {18402#(<= |ULTIMATE.start_foo_~i~0#1| 19)} assume !!(foo_~i~0#1 < 127); {18402#(<= |ULTIMATE.start_foo_~i~0#1| 19)} is VALID [2022-02-20 23:44:31,874 INFO L290 TraceCheckUtils]: 442: Hoare triple {18402#(<= |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 {18402#(<= |ULTIMATE.start_foo_~i~0#1| 19)} is VALID [2022-02-20 23:44:31,874 INFO L290 TraceCheckUtils]: 443: Hoare triple {18402#(<= |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; {18403#(<= |ULTIMATE.start_foo_~i~0#1| 20)} is VALID [2022-02-20 23:44:31,875 INFO L290 TraceCheckUtils]: 444: Hoare triple {18403#(<= |ULTIMATE.start_foo_~i~0#1| 20)} assume !!(foo_~i~0#1 < 127); {18403#(<= |ULTIMATE.start_foo_~i~0#1| 20)} is VALID [2022-02-20 23:44:31,875 INFO L290 TraceCheckUtils]: 445: Hoare triple {18403#(<= |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 {18403#(<= |ULTIMATE.start_foo_~i~0#1| 20)} is VALID [2022-02-20 23:44:31,875 INFO L290 TraceCheckUtils]: 446: Hoare triple {18403#(<= |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; {18404#(<= |ULTIMATE.start_foo_~i~0#1| 21)} is VALID [2022-02-20 23:44:31,876 INFO L290 TraceCheckUtils]: 447: Hoare triple {18404#(<= |ULTIMATE.start_foo_~i~0#1| 21)} assume !!(foo_~i~0#1 < 127); {18404#(<= |ULTIMATE.start_foo_~i~0#1| 21)} is VALID [2022-02-20 23:44:31,876 INFO L290 TraceCheckUtils]: 448: Hoare triple {18404#(<= |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 {18404#(<= |ULTIMATE.start_foo_~i~0#1| 21)} is VALID [2022-02-20 23:44:31,876 INFO L290 TraceCheckUtils]: 449: Hoare triple {18404#(<= |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; {18405#(<= |ULTIMATE.start_foo_~i~0#1| 22)} is VALID [2022-02-20 23:44:31,877 INFO L290 TraceCheckUtils]: 450: Hoare triple {18405#(<= |ULTIMATE.start_foo_~i~0#1| 22)} assume !!(foo_~i~0#1 < 127); {18405#(<= |ULTIMATE.start_foo_~i~0#1| 22)} is VALID [2022-02-20 23:44:31,877 INFO L290 TraceCheckUtils]: 451: Hoare triple {18405#(<= |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 {18405#(<= |ULTIMATE.start_foo_~i~0#1| 22)} is VALID [2022-02-20 23:44:31,877 INFO L290 TraceCheckUtils]: 452: Hoare triple {18405#(<= |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; {18406#(<= |ULTIMATE.start_foo_~i~0#1| 23)} is VALID [2022-02-20 23:44:31,878 INFO L290 TraceCheckUtils]: 453: Hoare triple {18406#(<= |ULTIMATE.start_foo_~i~0#1| 23)} assume !!(foo_~i~0#1 < 127); {18406#(<= |ULTIMATE.start_foo_~i~0#1| 23)} is VALID [2022-02-20 23:44:31,878 INFO L290 TraceCheckUtils]: 454: Hoare triple {18406#(<= |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 {18406#(<= |ULTIMATE.start_foo_~i~0#1| 23)} is VALID [2022-02-20 23:44:31,878 INFO L290 TraceCheckUtils]: 455: Hoare triple {18406#(<= |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; {18407#(<= |ULTIMATE.start_foo_~i~0#1| 24)} is VALID [2022-02-20 23:44:31,879 INFO L290 TraceCheckUtils]: 456: Hoare triple {18407#(<= |ULTIMATE.start_foo_~i~0#1| 24)} assume !!(foo_~i~0#1 < 127); {18407#(<= |ULTIMATE.start_foo_~i~0#1| 24)} is VALID [2022-02-20 23:44:31,879 INFO L290 TraceCheckUtils]: 457: Hoare triple {18407#(<= |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 {18407#(<= |ULTIMATE.start_foo_~i~0#1| 24)} is VALID [2022-02-20 23:44:31,879 INFO L290 TraceCheckUtils]: 458: Hoare triple {18407#(<= |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; {18408#(<= |ULTIMATE.start_foo_~i~0#1| 25)} is VALID [2022-02-20 23:44:31,880 INFO L290 TraceCheckUtils]: 459: Hoare triple {18408#(<= |ULTIMATE.start_foo_~i~0#1| 25)} assume !!(foo_~i~0#1 < 127); {18408#(<= |ULTIMATE.start_foo_~i~0#1| 25)} is VALID [2022-02-20 23:44:31,880 INFO L290 TraceCheckUtils]: 460: Hoare triple {18408#(<= |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 {18408#(<= |ULTIMATE.start_foo_~i~0#1| 25)} is VALID [2022-02-20 23:44:31,880 INFO L290 TraceCheckUtils]: 461: Hoare triple {18408#(<= |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; {18409#(<= |ULTIMATE.start_foo_~i~0#1| 26)} is VALID [2022-02-20 23:44:31,881 INFO L290 TraceCheckUtils]: 462: Hoare triple {18409#(<= |ULTIMATE.start_foo_~i~0#1| 26)} assume !!(foo_~i~0#1 < 127); {18409#(<= |ULTIMATE.start_foo_~i~0#1| 26)} is VALID [2022-02-20 23:44:31,881 INFO L290 TraceCheckUtils]: 463: Hoare triple {18409#(<= |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 {18409#(<= |ULTIMATE.start_foo_~i~0#1| 26)} is VALID [2022-02-20 23:44:31,881 INFO L290 TraceCheckUtils]: 464: Hoare triple {18409#(<= |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; {18410#(<= |ULTIMATE.start_foo_~i~0#1| 27)} is VALID [2022-02-20 23:44:31,882 INFO L290 TraceCheckUtils]: 465: Hoare triple {18410#(<= |ULTIMATE.start_foo_~i~0#1| 27)} assume !!(foo_~i~0#1 < 127); {18410#(<= |ULTIMATE.start_foo_~i~0#1| 27)} is VALID [2022-02-20 23:44:31,882 INFO L290 TraceCheckUtils]: 466: Hoare triple {18410#(<= |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 {18410#(<= |ULTIMATE.start_foo_~i~0#1| 27)} is VALID [2022-02-20 23:44:31,882 INFO L290 TraceCheckUtils]: 467: Hoare triple {18410#(<= |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; {18411#(<= |ULTIMATE.start_foo_~i~0#1| 28)} is VALID [2022-02-20 23:44:31,883 INFO L290 TraceCheckUtils]: 468: Hoare triple {18411#(<= |ULTIMATE.start_foo_~i~0#1| 28)} assume !!(foo_~i~0#1 < 127); {18411#(<= |ULTIMATE.start_foo_~i~0#1| 28)} is VALID [2022-02-20 23:44:31,883 INFO L290 TraceCheckUtils]: 469: Hoare triple {18411#(<= |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 {18411#(<= |ULTIMATE.start_foo_~i~0#1| 28)} is VALID [2022-02-20 23:44:31,883 INFO L290 TraceCheckUtils]: 470: Hoare triple {18411#(<= |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; {18412#(<= |ULTIMATE.start_foo_~i~0#1| 29)} is VALID [2022-02-20 23:44:31,884 INFO L290 TraceCheckUtils]: 471: Hoare triple {18412#(<= |ULTIMATE.start_foo_~i~0#1| 29)} assume !!(foo_~i~0#1 < 127); {18412#(<= |ULTIMATE.start_foo_~i~0#1| 29)} is VALID [2022-02-20 23:44:31,884 INFO L290 TraceCheckUtils]: 472: Hoare triple {18412#(<= |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 {18412#(<= |ULTIMATE.start_foo_~i~0#1| 29)} is VALID [2022-02-20 23:44:31,884 INFO L290 TraceCheckUtils]: 473: Hoare triple {18412#(<= |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; {18413#(<= |ULTIMATE.start_foo_~i~0#1| 30)} is VALID [2022-02-20 23:44:31,884 INFO L290 TraceCheckUtils]: 474: Hoare triple {18413#(<= |ULTIMATE.start_foo_~i~0#1| 30)} assume !!(foo_~i~0#1 < 127); {18413#(<= |ULTIMATE.start_foo_~i~0#1| 30)} is VALID [2022-02-20 23:44:31,885 INFO L290 TraceCheckUtils]: 475: Hoare triple {18413#(<= |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 {18413#(<= |ULTIMATE.start_foo_~i~0#1| 30)} is VALID [2022-02-20 23:44:31,885 INFO L290 TraceCheckUtils]: 476: Hoare triple {18413#(<= |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; {18414#(<= |ULTIMATE.start_foo_~i~0#1| 31)} is VALID [2022-02-20 23:44:31,885 INFO L290 TraceCheckUtils]: 477: Hoare triple {18414#(<= |ULTIMATE.start_foo_~i~0#1| 31)} assume !!(foo_~i~0#1 < 127); {18414#(<= |ULTIMATE.start_foo_~i~0#1| 31)} is VALID [2022-02-20 23:44:31,886 INFO L290 TraceCheckUtils]: 478: Hoare triple {18414#(<= |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 {18414#(<= |ULTIMATE.start_foo_~i~0#1| 31)} is VALID [2022-02-20 23:44:31,886 INFO L290 TraceCheckUtils]: 479: Hoare triple {18414#(<= |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; {18415#(<= |ULTIMATE.start_foo_~i~0#1| 32)} is VALID [2022-02-20 23:44:31,886 INFO L290 TraceCheckUtils]: 480: Hoare triple {18415#(<= |ULTIMATE.start_foo_~i~0#1| 32)} assume !!(foo_~i~0#1 < 127); {18415#(<= |ULTIMATE.start_foo_~i~0#1| 32)} is VALID [2022-02-20 23:44:31,887 INFO L290 TraceCheckUtils]: 481: Hoare triple {18415#(<= |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 {18415#(<= |ULTIMATE.start_foo_~i~0#1| 32)} is VALID [2022-02-20 23:44:31,887 INFO L290 TraceCheckUtils]: 482: Hoare triple {18415#(<= |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; {18416#(<= |ULTIMATE.start_foo_~i~0#1| 33)} is VALID [2022-02-20 23:44:31,887 INFO L290 TraceCheckUtils]: 483: Hoare triple {18416#(<= |ULTIMATE.start_foo_~i~0#1| 33)} assume !!(foo_~i~0#1 < 127); {18416#(<= |ULTIMATE.start_foo_~i~0#1| 33)} is VALID [2022-02-20 23:44:31,888 INFO L290 TraceCheckUtils]: 484: Hoare triple {18416#(<= |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 {18416#(<= |ULTIMATE.start_foo_~i~0#1| 33)} is VALID [2022-02-20 23:44:31,888 INFO L290 TraceCheckUtils]: 485: Hoare triple {18416#(<= |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; {18417#(<= |ULTIMATE.start_foo_~i~0#1| 34)} is VALID [2022-02-20 23:44:31,888 INFO L290 TraceCheckUtils]: 486: Hoare triple {18417#(<= |ULTIMATE.start_foo_~i~0#1| 34)} assume !!(foo_~i~0#1 < 127); {18417#(<= |ULTIMATE.start_foo_~i~0#1| 34)} is VALID [2022-02-20 23:44:31,889 INFO L290 TraceCheckUtils]: 487: Hoare triple {18417#(<= |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 {18417#(<= |ULTIMATE.start_foo_~i~0#1| 34)} is VALID [2022-02-20 23:44:31,889 INFO L290 TraceCheckUtils]: 488: Hoare triple {18417#(<= |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; {18418#(<= |ULTIMATE.start_foo_~i~0#1| 35)} is VALID [2022-02-20 23:44:31,889 INFO L290 TraceCheckUtils]: 489: Hoare triple {18418#(<= |ULTIMATE.start_foo_~i~0#1| 35)} assume !!(foo_~i~0#1 < 127); {18418#(<= |ULTIMATE.start_foo_~i~0#1| 35)} is VALID [2022-02-20 23:44:31,890 INFO L290 TraceCheckUtils]: 490: Hoare triple {18418#(<= |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 {18418#(<= |ULTIMATE.start_foo_~i~0#1| 35)} is VALID [2022-02-20 23:44:31,890 INFO L290 TraceCheckUtils]: 491: Hoare triple {18418#(<= |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; {18419#(<= |ULTIMATE.start_foo_~i~0#1| 36)} is VALID [2022-02-20 23:44:31,890 INFO L290 TraceCheckUtils]: 492: Hoare triple {18419#(<= |ULTIMATE.start_foo_~i~0#1| 36)} assume !!(foo_~i~0#1 < 127); {18419#(<= |ULTIMATE.start_foo_~i~0#1| 36)} is VALID [2022-02-20 23:44:31,891 INFO L290 TraceCheckUtils]: 493: Hoare triple {18419#(<= |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 {18419#(<= |ULTIMATE.start_foo_~i~0#1| 36)} is VALID [2022-02-20 23:44:31,891 INFO L290 TraceCheckUtils]: 494: Hoare triple {18419#(<= |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; {18420#(<= |ULTIMATE.start_foo_~i~0#1| 37)} is VALID [2022-02-20 23:44:31,891 INFO L290 TraceCheckUtils]: 495: Hoare triple {18420#(<= |ULTIMATE.start_foo_~i~0#1| 37)} assume !!(foo_~i~0#1 < 127); {18420#(<= |ULTIMATE.start_foo_~i~0#1| 37)} is VALID [2022-02-20 23:44:31,892 INFO L290 TraceCheckUtils]: 496: Hoare triple {18420#(<= |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 {18420#(<= |ULTIMATE.start_foo_~i~0#1| 37)} is VALID [2022-02-20 23:44:31,892 INFO L290 TraceCheckUtils]: 497: Hoare triple {18420#(<= |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; {18421#(<= |ULTIMATE.start_foo_~i~0#1| 38)} is VALID [2022-02-20 23:44:31,892 INFO L290 TraceCheckUtils]: 498: Hoare triple {18421#(<= |ULTIMATE.start_foo_~i~0#1| 38)} assume !!(foo_~i~0#1 < 127); {18421#(<= |ULTIMATE.start_foo_~i~0#1| 38)} is VALID [2022-02-20 23:44:31,893 INFO L290 TraceCheckUtils]: 499: Hoare triple {18421#(<= |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 {18421#(<= |ULTIMATE.start_foo_~i~0#1| 38)} is VALID [2022-02-20 23:44:31,893 INFO L290 TraceCheckUtils]: 500: Hoare triple {18421#(<= |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; {18422#(<= |ULTIMATE.start_foo_~i~0#1| 39)} is VALID [2022-02-20 23:44:31,893 INFO L290 TraceCheckUtils]: 501: Hoare triple {18422#(<= |ULTIMATE.start_foo_~i~0#1| 39)} assume !!(foo_~i~0#1 < 127); {18422#(<= |ULTIMATE.start_foo_~i~0#1| 39)} is VALID [2022-02-20 23:44:31,894 INFO L290 TraceCheckUtils]: 502: Hoare triple {18422#(<= |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 {18422#(<= |ULTIMATE.start_foo_~i~0#1| 39)} is VALID [2022-02-20 23:44:31,894 INFO L290 TraceCheckUtils]: 503: Hoare triple {18422#(<= |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; {18423#(<= |ULTIMATE.start_foo_~i~0#1| 40)} is VALID [2022-02-20 23:44:31,894 INFO L290 TraceCheckUtils]: 504: Hoare triple {18423#(<= |ULTIMATE.start_foo_~i~0#1| 40)} assume !!(foo_~i~0#1 < 127); {18423#(<= |ULTIMATE.start_foo_~i~0#1| 40)} is VALID [2022-02-20 23:44:31,895 INFO L290 TraceCheckUtils]: 505: Hoare triple {18423#(<= |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 {18423#(<= |ULTIMATE.start_foo_~i~0#1| 40)} is VALID [2022-02-20 23:44:31,895 INFO L290 TraceCheckUtils]: 506: Hoare triple {18423#(<= |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; {18424#(<= |ULTIMATE.start_foo_~i~0#1| 41)} is VALID [2022-02-20 23:44:31,895 INFO L290 TraceCheckUtils]: 507: Hoare triple {18424#(<= |ULTIMATE.start_foo_~i~0#1| 41)} assume !!(foo_~i~0#1 < 127); {18424#(<= |ULTIMATE.start_foo_~i~0#1| 41)} is VALID [2022-02-20 23:44:31,896 INFO L290 TraceCheckUtils]: 508: Hoare triple {18424#(<= |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 {18424#(<= |ULTIMATE.start_foo_~i~0#1| 41)} is VALID [2022-02-20 23:44:31,896 INFO L290 TraceCheckUtils]: 509: Hoare triple {18424#(<= |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; {18425#(<= |ULTIMATE.start_foo_~i~0#1| 42)} is VALID [2022-02-20 23:44:31,896 INFO L290 TraceCheckUtils]: 510: Hoare triple {18425#(<= |ULTIMATE.start_foo_~i~0#1| 42)} assume !!(foo_~i~0#1 < 127); {18425#(<= |ULTIMATE.start_foo_~i~0#1| 42)} is VALID [2022-02-20 23:44:31,897 INFO L290 TraceCheckUtils]: 511: Hoare triple {18425#(<= |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 {18425#(<= |ULTIMATE.start_foo_~i~0#1| 42)} is VALID [2022-02-20 23:44:31,897 INFO L290 TraceCheckUtils]: 512: Hoare triple {18425#(<= |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; {18426#(<= |ULTIMATE.start_foo_~i~0#1| 43)} is VALID [2022-02-20 23:44:31,897 INFO L290 TraceCheckUtils]: 513: Hoare triple {18426#(<= |ULTIMATE.start_foo_~i~0#1| 43)} assume !!(foo_~i~0#1 < 127); {18426#(<= |ULTIMATE.start_foo_~i~0#1| 43)} is VALID [2022-02-20 23:44:31,898 INFO L290 TraceCheckUtils]: 514: Hoare triple {18426#(<= |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 {18426#(<= |ULTIMATE.start_foo_~i~0#1| 43)} is VALID [2022-02-20 23:44:31,898 INFO L290 TraceCheckUtils]: 515: Hoare triple {18426#(<= |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; {18427#(<= |ULTIMATE.start_foo_~i~0#1| 44)} is VALID [2022-02-20 23:44:31,898 INFO L290 TraceCheckUtils]: 516: Hoare triple {18427#(<= |ULTIMATE.start_foo_~i~0#1| 44)} assume !!(foo_~i~0#1 < 127); {18427#(<= |ULTIMATE.start_foo_~i~0#1| 44)} is VALID [2022-02-20 23:44:31,899 INFO L290 TraceCheckUtils]: 517: Hoare triple {18427#(<= |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 {18427#(<= |ULTIMATE.start_foo_~i~0#1| 44)} is VALID [2022-02-20 23:44:31,899 INFO L290 TraceCheckUtils]: 518: Hoare triple {18427#(<= |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; {18428#(<= |ULTIMATE.start_foo_~i~0#1| 45)} is VALID [2022-02-20 23:44:31,899 INFO L290 TraceCheckUtils]: 519: Hoare triple {18428#(<= |ULTIMATE.start_foo_~i~0#1| 45)} assume !!(foo_~i~0#1 < 127); {18428#(<= |ULTIMATE.start_foo_~i~0#1| 45)} is VALID [2022-02-20 23:44:31,900 INFO L290 TraceCheckUtils]: 520: Hoare triple {18428#(<= |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 {18428#(<= |ULTIMATE.start_foo_~i~0#1| 45)} is VALID [2022-02-20 23:44:31,900 INFO L290 TraceCheckUtils]: 521: Hoare triple {18428#(<= |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; {18429#(<= |ULTIMATE.start_foo_~i~0#1| 46)} is VALID [2022-02-20 23:44:31,900 INFO L290 TraceCheckUtils]: 522: Hoare triple {18429#(<= |ULTIMATE.start_foo_~i~0#1| 46)} assume !!(foo_~i~0#1 < 127); {18429#(<= |ULTIMATE.start_foo_~i~0#1| 46)} is VALID [2022-02-20 23:44:31,901 INFO L290 TraceCheckUtils]: 523: Hoare triple {18429#(<= |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 {18429#(<= |ULTIMATE.start_foo_~i~0#1| 46)} is VALID [2022-02-20 23:44:31,901 INFO L290 TraceCheckUtils]: 524: Hoare triple {18429#(<= |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; {18430#(<= |ULTIMATE.start_foo_~i~0#1| 47)} is VALID [2022-02-20 23:44:31,901 INFO L290 TraceCheckUtils]: 525: Hoare triple {18430#(<= |ULTIMATE.start_foo_~i~0#1| 47)} assume !!(foo_~i~0#1 < 127); {18430#(<= |ULTIMATE.start_foo_~i~0#1| 47)} is VALID [2022-02-20 23:44:31,902 INFO L290 TraceCheckUtils]: 526: Hoare triple {18430#(<= |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 {18430#(<= |ULTIMATE.start_foo_~i~0#1| 47)} is VALID [2022-02-20 23:44:31,902 INFO L290 TraceCheckUtils]: 527: Hoare triple {18430#(<= |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; {18431#(<= |ULTIMATE.start_foo_~i~0#1| 48)} is VALID [2022-02-20 23:44:31,902 INFO L290 TraceCheckUtils]: 528: Hoare triple {18431#(<= |ULTIMATE.start_foo_~i~0#1| 48)} assume !!(foo_~i~0#1 < 127); {18431#(<= |ULTIMATE.start_foo_~i~0#1| 48)} is VALID [2022-02-20 23:44:31,903 INFO L290 TraceCheckUtils]: 529: Hoare triple {18431#(<= |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 {18431#(<= |ULTIMATE.start_foo_~i~0#1| 48)} is VALID [2022-02-20 23:44:31,903 INFO L290 TraceCheckUtils]: 530: Hoare triple {18431#(<= |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; {18432#(<= |ULTIMATE.start_foo_~i~0#1| 49)} is VALID [2022-02-20 23:44:31,903 INFO L290 TraceCheckUtils]: 531: Hoare triple {18432#(<= |ULTIMATE.start_foo_~i~0#1| 49)} assume !!(foo_~i~0#1 < 127); {18432#(<= |ULTIMATE.start_foo_~i~0#1| 49)} is VALID [2022-02-20 23:44:31,904 INFO L290 TraceCheckUtils]: 532: Hoare triple {18432#(<= |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 {18432#(<= |ULTIMATE.start_foo_~i~0#1| 49)} is VALID [2022-02-20 23:44:31,904 INFO L290 TraceCheckUtils]: 533: Hoare triple {18432#(<= |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; {18433#(<= |ULTIMATE.start_foo_~i~0#1| 50)} is VALID [2022-02-20 23:44:31,904 INFO L290 TraceCheckUtils]: 534: Hoare triple {18433#(<= |ULTIMATE.start_foo_~i~0#1| 50)} assume !!(foo_~i~0#1 < 127); {18433#(<= |ULTIMATE.start_foo_~i~0#1| 50)} is VALID [2022-02-20 23:44:31,905 INFO L290 TraceCheckUtils]: 535: Hoare triple {18433#(<= |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 {18433#(<= |ULTIMATE.start_foo_~i~0#1| 50)} is VALID [2022-02-20 23:44:31,905 INFO L290 TraceCheckUtils]: 536: Hoare triple {18433#(<= |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; {18434#(<= |ULTIMATE.start_foo_~i~0#1| 51)} is VALID [2022-02-20 23:44:31,905 INFO L290 TraceCheckUtils]: 537: Hoare triple {18434#(<= |ULTIMATE.start_foo_~i~0#1| 51)} assume !!(foo_~i~0#1 < 127); {18434#(<= |ULTIMATE.start_foo_~i~0#1| 51)} is VALID [2022-02-20 23:44:31,905 INFO L290 TraceCheckUtils]: 538: Hoare triple {18434#(<= |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 {18434#(<= |ULTIMATE.start_foo_~i~0#1| 51)} is VALID [2022-02-20 23:44:31,906 INFO L290 TraceCheckUtils]: 539: Hoare triple {18434#(<= |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; {18435#(<= |ULTIMATE.start_foo_~i~0#1| 52)} is VALID [2022-02-20 23:44:31,906 INFO L290 TraceCheckUtils]: 540: Hoare triple {18435#(<= |ULTIMATE.start_foo_~i~0#1| 52)} assume !!(foo_~i~0#1 < 127); {18435#(<= |ULTIMATE.start_foo_~i~0#1| 52)} is VALID [2022-02-20 23:44:31,906 INFO L290 TraceCheckUtils]: 541: Hoare triple {18435#(<= |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 {18435#(<= |ULTIMATE.start_foo_~i~0#1| 52)} is VALID [2022-02-20 23:44:31,907 INFO L290 TraceCheckUtils]: 542: Hoare triple {18435#(<= |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; {18436#(<= |ULTIMATE.start_foo_~i~0#1| 53)} is VALID [2022-02-20 23:44:31,907 INFO L290 TraceCheckUtils]: 543: Hoare triple {18436#(<= |ULTIMATE.start_foo_~i~0#1| 53)} assume !!(foo_~i~0#1 < 127); {18436#(<= |ULTIMATE.start_foo_~i~0#1| 53)} is VALID [2022-02-20 23:44:31,907 INFO L290 TraceCheckUtils]: 544: Hoare triple {18436#(<= |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 {18436#(<= |ULTIMATE.start_foo_~i~0#1| 53)} is VALID [2022-02-20 23:44:31,908 INFO L290 TraceCheckUtils]: 545: Hoare triple {18436#(<= |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; {18437#(<= |ULTIMATE.start_foo_~i~0#1| 54)} is VALID [2022-02-20 23:44:31,908 INFO L290 TraceCheckUtils]: 546: Hoare triple {18437#(<= |ULTIMATE.start_foo_~i~0#1| 54)} assume !!(foo_~i~0#1 < 127); {18437#(<= |ULTIMATE.start_foo_~i~0#1| 54)} is VALID [2022-02-20 23:44:31,908 INFO L290 TraceCheckUtils]: 547: Hoare triple {18437#(<= |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 {18437#(<= |ULTIMATE.start_foo_~i~0#1| 54)} is VALID [2022-02-20 23:44:31,909 INFO L290 TraceCheckUtils]: 548: Hoare triple {18437#(<= |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; {18438#(<= |ULTIMATE.start_foo_~i~0#1| 55)} is VALID [2022-02-20 23:44:31,909 INFO L290 TraceCheckUtils]: 549: Hoare triple {18438#(<= |ULTIMATE.start_foo_~i~0#1| 55)} assume !!(foo_~i~0#1 < 127); {18438#(<= |ULTIMATE.start_foo_~i~0#1| 55)} is VALID [2022-02-20 23:44:31,909 INFO L290 TraceCheckUtils]: 550: Hoare triple {18438#(<= |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 {18438#(<= |ULTIMATE.start_foo_~i~0#1| 55)} is VALID [2022-02-20 23:44:31,910 INFO L290 TraceCheckUtils]: 551: Hoare triple {18438#(<= |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; {18439#(<= |ULTIMATE.start_foo_~i~0#1| 56)} is VALID [2022-02-20 23:44:31,910 INFO L290 TraceCheckUtils]: 552: Hoare triple {18439#(<= |ULTIMATE.start_foo_~i~0#1| 56)} assume !!(foo_~i~0#1 < 127); {18439#(<= |ULTIMATE.start_foo_~i~0#1| 56)} is VALID [2022-02-20 23:44:31,910 INFO L290 TraceCheckUtils]: 553: Hoare triple {18439#(<= |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 {18439#(<= |ULTIMATE.start_foo_~i~0#1| 56)} is VALID [2022-02-20 23:44:31,911 INFO L290 TraceCheckUtils]: 554: Hoare triple {18439#(<= |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; {18440#(<= |ULTIMATE.start_foo_~i~0#1| 57)} is VALID [2022-02-20 23:44:31,911 INFO L290 TraceCheckUtils]: 555: Hoare triple {18440#(<= |ULTIMATE.start_foo_~i~0#1| 57)} assume !!(foo_~i~0#1 < 127); {18440#(<= |ULTIMATE.start_foo_~i~0#1| 57)} is VALID [2022-02-20 23:44:31,911 INFO L290 TraceCheckUtils]: 556: Hoare triple {18440#(<= |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 {18440#(<= |ULTIMATE.start_foo_~i~0#1| 57)} is VALID [2022-02-20 23:44:31,912 INFO L290 TraceCheckUtils]: 557: Hoare triple {18440#(<= |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; {18441#(<= |ULTIMATE.start_foo_~i~0#1| 58)} is VALID [2022-02-20 23:44:31,912 INFO L290 TraceCheckUtils]: 558: Hoare triple {18441#(<= |ULTIMATE.start_foo_~i~0#1| 58)} assume !!(foo_~i~0#1 < 127); {18441#(<= |ULTIMATE.start_foo_~i~0#1| 58)} is VALID [2022-02-20 23:44:31,912 INFO L290 TraceCheckUtils]: 559: Hoare triple {18441#(<= |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 {18441#(<= |ULTIMATE.start_foo_~i~0#1| 58)} is VALID [2022-02-20 23:44:31,913 INFO L290 TraceCheckUtils]: 560: Hoare triple {18441#(<= |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; {18442#(<= |ULTIMATE.start_foo_~i~0#1| 59)} is VALID [2022-02-20 23:44:31,913 INFO L290 TraceCheckUtils]: 561: Hoare triple {18442#(<= |ULTIMATE.start_foo_~i~0#1| 59)} assume !!(foo_~i~0#1 < 127); {18442#(<= |ULTIMATE.start_foo_~i~0#1| 59)} is VALID [2022-02-20 23:44:31,915 INFO L290 TraceCheckUtils]: 562: Hoare triple {18442#(<= |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 {18442#(<= |ULTIMATE.start_foo_~i~0#1| 59)} is VALID [2022-02-20 23:44:31,915 INFO L290 TraceCheckUtils]: 563: Hoare triple {18442#(<= |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; {18443#(<= |ULTIMATE.start_foo_~i~0#1| 60)} is VALID [2022-02-20 23:44:31,916 INFO L290 TraceCheckUtils]: 564: Hoare triple {18443#(<= |ULTIMATE.start_foo_~i~0#1| 60)} assume !!(foo_~i~0#1 < 127); {18443#(<= |ULTIMATE.start_foo_~i~0#1| 60)} is VALID [2022-02-20 23:44:31,916 INFO L290 TraceCheckUtils]: 565: Hoare triple {18443#(<= |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 {18443#(<= |ULTIMATE.start_foo_~i~0#1| 60)} is VALID [2022-02-20 23:44:31,916 INFO L290 TraceCheckUtils]: 566: Hoare triple {18443#(<= |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; {18444#(<= |ULTIMATE.start_foo_~i~0#1| 61)} is VALID [2022-02-20 23:44:31,917 INFO L290 TraceCheckUtils]: 567: Hoare triple {18444#(<= |ULTIMATE.start_foo_~i~0#1| 61)} assume !!(foo_~i~0#1 < 127); {18444#(<= |ULTIMATE.start_foo_~i~0#1| 61)} is VALID [2022-02-20 23:44:31,917 INFO L290 TraceCheckUtils]: 568: Hoare triple {18444#(<= |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 {18444#(<= |ULTIMATE.start_foo_~i~0#1| 61)} is VALID [2022-02-20 23:44:31,917 INFO L290 TraceCheckUtils]: 569: Hoare triple {18444#(<= |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; {18445#(<= |ULTIMATE.start_foo_~i~0#1| 62)} is VALID [2022-02-20 23:44:31,918 INFO L290 TraceCheckUtils]: 570: Hoare triple {18445#(<= |ULTIMATE.start_foo_~i~0#1| 62)} assume !!(foo_~i~0#1 < 127); {18445#(<= |ULTIMATE.start_foo_~i~0#1| 62)} is VALID [2022-02-20 23:44:31,918 INFO L290 TraceCheckUtils]: 571: Hoare triple {18445#(<= |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 {18445#(<= |ULTIMATE.start_foo_~i~0#1| 62)} is VALID [2022-02-20 23:44:31,918 INFO L290 TraceCheckUtils]: 572: Hoare triple {18445#(<= |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; {18446#(<= |ULTIMATE.start_foo_~i~0#1| 63)} is VALID [2022-02-20 23:44:31,919 INFO L290 TraceCheckUtils]: 573: Hoare triple {18446#(<= |ULTIMATE.start_foo_~i~0#1| 63)} assume !(foo_~i~0#1 < 127); {18382#false} is VALID [2022-02-20 23:44:31,919 INFO L290 TraceCheckUtils]: 574: Hoare triple {18382#false} assume { :end_inline_foo } true; {18382#false} is VALID [2022-02-20 23:44:31,919 INFO L290 TraceCheckUtils]: 575: Hoare triple {18382#false} SUMMARY for call main_#t~mem8#1 := read~int(~b~0.base, -4 + ~b~0.offset, 4); srcloc: L540 {18382#false} is VALID [2022-02-20 23:44:31,919 INFO L290 TraceCheckUtils]: 576: Hoare triple {18382#false} assume !(0 != main_#t~mem8#1);havoc main_#t~mem8#1; {18382#false} is VALID [2022-02-20 23:44:31,919 INFO L290 TraceCheckUtils]: 577: Hoare triple {18382#false} assume 0 == ~a~0.offset; {18382#false} is VALID [2022-02-20 23:44:31,919 INFO L290 TraceCheckUtils]: 578: Hoare triple {18382#false} assume ~a~0.base < #StackHeapBarrier; {18382#false} is VALID [2022-02-20 23:44:31,920 INFO L290 TraceCheckUtils]: 579: Hoare triple {18382#false} assume 0 == ~a~0.base || 1 == #valid[~a~0.base];call ULTIMATE.dealloc(~a~0.base, ~a~0.offset); {18382#false} is VALID [2022-02-20 23:44:31,920 INFO L290 TraceCheckUtils]: 580: Hoare triple {18382#false} assume !(0 == ~b~0.offset); {18382#false} is VALID [2022-02-20 23:44:31,927 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:31,928 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:44:31,928 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963323052] [2022-02-20 23:44:31,928 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963323052] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:44:31,928 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [895574864] [2022-02-20 23:44:31,928 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 23:44:31,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:44:31,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:44:31,929 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:31,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process