./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-industry-pattern/array_monotonic.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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/AutomizerReach.xml -i ../sv-benchmarks/c/array-industry-pattern/array_monotonic.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5e947ce3cb6be538c3110154d89a790a98803ec545aa8464d99fb543118ea442 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 14:09:08,514 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 14:09:08,516 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 14:09:08,548 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 14:09:08,550 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 14:09:08,553 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 14:09:08,554 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 14:09:08,558 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 14:09:08,559 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 14:09:08,560 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 14:09:08,560 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 14:09:08,562 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 14:09:08,562 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 14:09:08,567 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 14:09:08,568 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 14:09:08,568 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 14:09:08,569 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 14:09:08,569 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 14:09:08,570 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 14:09:08,571 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 14:09:08,572 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 14:09:08,574 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 14:09:08,577 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 14:09:08,578 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 14:09:08,580 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 14:09:08,582 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 14:09:08,582 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 14:09:08,583 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 14:09:08,583 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 14:09:08,584 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 14:09:08,584 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 14:09:08,585 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 14:09:08,586 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 14:09:08,586 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 14:09:08,587 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 14:09:08,587 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 14:09:08,588 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 14:09:08,588 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 14:09:08,588 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 14:09:08,589 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 14:09:08,589 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 14:09:08,590 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 14:09:08,616 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 14:09:08,616 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 14:09:08,617 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 14:09:08,617 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 14:09:08,617 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 14:09:08,617 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 14:09:08,618 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 14:09:08,618 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 14:09:08,618 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 14:09:08,618 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 14:09:08,619 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 14:09:08,619 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 14:09:08,619 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 14:09:08,619 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 14:09:08,619 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 14:09:08,620 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 14:09:08,620 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 14:09:08,620 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 14:09:08,620 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 14:09:08,620 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 14:09:08,620 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 14:09:08,620 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 14:09:08,621 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 14:09:08,621 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 14:09:08,621 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:09:08,621 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 14:09:08,621 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 14:09:08,622 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 14:09:08,622 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 14:09:08,622 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 14:09:08,623 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 14:09:08,623 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 14:09:08,623 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 14:09:08,623 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 ! call(reach_error())) ) 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 -> 5e947ce3cb6be538c3110154d89a790a98803ec545aa8464d99fb543118ea442 [2022-02-20 14:09:08,844 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 14:09:08,862 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 14:09:08,864 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 14:09:08,865 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 14:09:08,866 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 14:09:08,867 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-industry-pattern/array_monotonic.i [2022-02-20 14:09:08,929 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b458303ed/7b8a99a2a5d94154a76237528d18f3a2/FLAG0f7174f50 [2022-02-20 14:09:09,305 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 14:09:09,305 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-industry-pattern/array_monotonic.i [2022-02-20 14:09:09,312 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b458303ed/7b8a99a2a5d94154a76237528d18f3a2/FLAG0f7174f50 [2022-02-20 14:09:09,325 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b458303ed/7b8a99a2a5d94154a76237528d18f3a2 [2022-02-20 14:09:09,327 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 14:09:09,329 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 14:09:09,330 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 14:09:09,330 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 14:09:09,333 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 14:09:09,334 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:09:09" (1/1) ... [2022-02-20 14:09:09,335 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52ece91d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:09:09, skipping insertion in model container [2022-02-20 14:09:09,336 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:09:09" (1/1) ... [2022-02-20 14:09:09,340 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 14:09:09,364 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 14:09:09,510 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-industry-pattern/array_monotonic.i[808,821] [2022-02-20 14:09:09,533 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:09:09,542 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 14:09:09,553 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-industry-pattern/array_monotonic.i[808,821] [2022-02-20 14:09:09,563 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:09:09,573 INFO L208 MainTranslator]: Completed translation [2022-02-20 14:09:09,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:09:09 WrapperNode [2022-02-20 14:09:09,574 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 14:09:09,575 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 14:09:09,575 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 14:09:09,575 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 14:09:09,580 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:09:09" (1/1) ... [2022-02-20 14:09:09,586 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:09:09" (1/1) ... [2022-02-20 14:09:09,606 INFO L137 Inliner]: procedures = 16, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 48 [2022-02-20 14:09:09,607 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 14:09:09,607 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 14:09:09,608 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 14:09:09,608 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 14:09:09,613 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:09:09" (1/1) ... [2022-02-20 14:09:09,613 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:09:09" (1/1) ... [2022-02-20 14:09:09,622 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:09:09" (1/1) ... [2022-02-20 14:09:09,622 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:09:09" (1/1) ... [2022-02-20 14:09:09,631 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:09:09" (1/1) ... [2022-02-20 14:09:09,636 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:09:09" (1/1) ... [2022-02-20 14:09:09,640 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:09:09" (1/1) ... [2022-02-20 14:09:09,642 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 14:09:09,644 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 14:09:09,644 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 14:09:09,645 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 14:09:09,646 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:09:09" (1/1) ... [2022-02-20 14:09:09,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:09:09,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:09:09,670 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 14:09:09,675 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 14:09:09,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 14:09:09,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 14:09:09,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 14:09:09,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 14:09:09,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 14:09:09,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 14:09:09,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 14:09:09,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 14:09:09,750 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 14:09:09,752 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 14:09:09,915 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 14:09:09,920 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 14:09:09,920 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 14:09:09,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:09:09 BoogieIcfgContainer [2022-02-20 14:09:09,922 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 14:09:09,923 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 14:09:09,923 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 14:09:09,925 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 14:09:09,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 02:09:09" (1/3) ... [2022-02-20 14:09:09,926 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b8e439b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:09:09, skipping insertion in model container [2022-02-20 14:09:09,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:09:09" (2/3) ... [2022-02-20 14:09:09,927 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b8e439b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:09:09, skipping insertion in model container [2022-02-20 14:09:09,927 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:09:09" (3/3) ... [2022-02-20 14:09:09,928 INFO L111 eAbstractionObserver]: Analyzing ICFG array_monotonic.i [2022-02-20 14:09:09,955 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 14:09:09,956 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 14:09:10,003 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 14:09:10,011 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 14:09:10,012 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 14:09:10,035 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 16 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 14:09:10,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 14:09:10,039 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:09:10,040 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:09:10,040 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:09:10,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:09:10,045 INFO L85 PathProgramCache]: Analyzing trace with hash 531796522, now seen corresponding path program 1 times [2022-02-20 14:09:10,052 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:09:10,053 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978862873] [2022-02-20 14:09:10,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:09:10,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:09:10,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:09:10,203 INFO L290 TraceCheckUtils]: 0: Hoare triple {20#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(18, 2); {20#true} is VALID [2022-02-20 14:09:10,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {20#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {20#true} is VALID [2022-02-20 14:09:10,205 INFO L290 TraceCheckUtils]: 2: Hoare triple {20#true} assume !true; {21#false} is VALID [2022-02-20 14:09:10,206 INFO L290 TraceCheckUtils]: 3: Hoare triple {21#false} main_~i~0#1 := 0; {21#false} is VALID [2022-02-20 14:09:10,206 INFO L290 TraceCheckUtils]: 4: Hoare triple {21#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {21#false} is VALID [2022-02-20 14:09:10,206 INFO L290 TraceCheckUtils]: 5: Hoare triple {21#false} assume 10 == main_#t~mem3#1;havoc main_#t~mem3#1;call main_#t~mem4#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 20 == main_#t~mem4#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {21#false} is VALID [2022-02-20 14:09:10,206 INFO L290 TraceCheckUtils]: 6: Hoare triple {21#false} assume 0 == __VERIFIER_assert_~cond#1; {21#false} is VALID [2022-02-20 14:09:10,206 INFO L290 TraceCheckUtils]: 7: Hoare triple {21#false} assume !false; {21#false} is VALID [2022-02-20 14:09:10,207 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 14:09:10,207 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:09:10,208 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978862873] [2022-02-20 14:09:10,208 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978862873] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:09:10,209 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:09:10,209 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 14:09:10,210 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82473273] [2022-02-20 14:09:10,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:09:10,215 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-02-20 14:09:10,216 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:09:10,218 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:10,236 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:09:10,236 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 14:09:10,237 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:09:10,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 14:09:10,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 14:09:10,257 INFO L87 Difference]: Start difference. First operand has 17 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 16 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) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:10,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:09:10,322 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2022-02-20 14:09:10,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 14:09:10,323 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-02-20 14:09:10,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:09:10,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:10,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 38 transitions. [2022-02-20 14:09:10,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:10,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 38 transitions. [2022-02-20 14:09:10,335 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 38 transitions. [2022-02-20 14:09:10,383 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 14:09:10,391 INFO L225 Difference]: With dead ends: 29 [2022-02-20 14:09:10,392 INFO L226 Difference]: Without dead ends: 13 [2022-02-20 14:09:10,394 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 14:09:10,398 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:09:10,404 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:09:10,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-02-20 14:09:10,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-02-20 14:09:10,425 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:09:10,426 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:10,427 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:10,427 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:10,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:09:10,446 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2022-02-20 14:09:10,447 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 16 transitions. [2022-02-20 14:09:10,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:09:10,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:09:10,448 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 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 13 states. [2022-02-20 14:09:10,448 INFO L87 Difference]: Start difference. First operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 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 13 states. [2022-02-20 14:09:10,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:09:10,450 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2022-02-20 14:09:10,450 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 16 transitions. [2022-02-20 14:09:10,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:09:10,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:09:10,451 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:09:10,451 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:09:10,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:10,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2022-02-20 14:09:10,455 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 16 transitions. Word has length 8 [2022-02-20 14:09:10,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:09:10,455 INFO L470 AbstractCegarLoop]: Abstraction has 13 states and 16 transitions. [2022-02-20 14:09:10,456 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:10,456 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 16 transitions. [2022-02-20 14:09:10,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 14:09:10,457 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:09:10,457 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:09:10,457 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 14:09:10,458 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:09:10,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:09:10,460 INFO L85 PathProgramCache]: Analyzing trace with hash 216875861, now seen corresponding path program 1 times [2022-02-20 14:09:10,460 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:09:10,462 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437177663] [2022-02-20 14:09:10,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:09:10,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:09:10,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:09:10,533 INFO L290 TraceCheckUtils]: 0: Hoare triple {97#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(18, 2); {97#true} is VALID [2022-02-20 14:09:10,534 INFO L290 TraceCheckUtils]: 1: Hoare triple {97#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {99#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:10,535 INFO L290 TraceCheckUtils]: 2: Hoare triple {99#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~i~0#1 < 100000); {98#false} is VALID [2022-02-20 14:09:10,535 INFO L290 TraceCheckUtils]: 3: Hoare triple {98#false} main_~i~0#1 := 0; {98#false} is VALID [2022-02-20 14:09:10,535 INFO L290 TraceCheckUtils]: 4: Hoare triple {98#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {98#false} is VALID [2022-02-20 14:09:10,538 INFO L290 TraceCheckUtils]: 5: Hoare triple {98#false} assume 10 == main_#t~mem3#1;havoc main_#t~mem3#1;call main_#t~mem4#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 20 == main_#t~mem4#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {98#false} is VALID [2022-02-20 14:09:10,538 INFO L290 TraceCheckUtils]: 6: Hoare triple {98#false} assume 0 == __VERIFIER_assert_~cond#1; {98#false} is VALID [2022-02-20 14:09:10,538 INFO L290 TraceCheckUtils]: 7: Hoare triple {98#false} assume !false; {98#false} is VALID [2022-02-20 14:09:10,538 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 14:09:10,539 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:09:10,539 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437177663] [2022-02-20 14:09:10,539 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437177663] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:09:10,539 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:09:10,539 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:09:10,539 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652170159] [2022-02-20 14:09:10,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:09:10,541 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-02-20 14:09:10,541 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:09:10,542 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:10,555 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:09:10,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:09:10,556 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:09:10,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:09:10,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:09:10,557 INFO L87 Difference]: Start difference. First operand 13 states and 16 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:10,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:09:10,604 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2022-02-20 14:09:10,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:09:10,605 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-02-20 14:09:10,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:09:10,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:10,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2022-02-20 14:09:10,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:10,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2022-02-20 14:09:10,609 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 38 transitions. [2022-02-20 14:09:10,653 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 14:09:10,656 INFO L225 Difference]: With dead ends: 31 [2022-02-20 14:09:10,656 INFO L226 Difference]: Without dead ends: 23 [2022-02-20 14:09:10,659 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 14:09:10,662 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 10 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:09:10,662 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 17 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:09:10,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-02-20 14:09:10,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 14. [2022-02-20 14:09:10,667 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:09:10,668 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:10,668 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:10,669 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:10,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:09:10,670 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-02-20 14:09:10,670 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-02-20 14:09:10,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:09:10,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:09:10,671 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 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 23 states. [2022-02-20 14:09:10,671 INFO L87 Difference]: Start difference. First operand has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 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 23 states. [2022-02-20 14:09:10,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:09:10,672 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-02-20 14:09:10,673 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-02-20 14:09:10,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:09:10,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:09:10,673 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:09:10,673 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:09:10,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:10,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2022-02-20 14:09:10,675 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 17 transitions. Word has length 8 [2022-02-20 14:09:10,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:09:10,677 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 17 transitions. [2022-02-20 14:09:10,677 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:10,677 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 17 transitions. [2022-02-20 14:09:10,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 14:09:10,677 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:09:10,678 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:09:10,678 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 14:09:10,678 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:09:10,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:09:10,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1819905507, now seen corresponding path program 1 times [2022-02-20 14:09:10,679 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:09:10,679 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820489846] [2022-02-20 14:09:10,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:09:10,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:09:10,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:09:10,756 INFO L290 TraceCheckUtils]: 0: Hoare triple {201#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(18, 2); {201#true} is VALID [2022-02-20 14:09:10,758 INFO L290 TraceCheckUtils]: 1: Hoare triple {201#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {203#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:10,758 INFO L290 TraceCheckUtils]: 2: Hoare triple {203#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {203#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:10,759 INFO L290 TraceCheckUtils]: 3: Hoare triple {203#(= |ULTIMATE.start_main_~i~0#1| 0)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {203#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:10,759 INFO L290 TraceCheckUtils]: 4: Hoare triple {203#(= |ULTIMATE.start_main_~i~0#1| 0)} main_~i~0#1 := 2 + main_~i~0#1; {204#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:09:10,760 INFO L290 TraceCheckUtils]: 5: Hoare triple {204#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(main_~i~0#1 < 100000); {202#false} is VALID [2022-02-20 14:09:10,761 INFO L290 TraceCheckUtils]: 6: Hoare triple {202#false} main_~i~0#1 := 0; {202#false} is VALID [2022-02-20 14:09:10,761 INFO L290 TraceCheckUtils]: 7: Hoare triple {202#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {202#false} is VALID [2022-02-20 14:09:10,761 INFO L290 TraceCheckUtils]: 8: Hoare triple {202#false} assume 10 == main_#t~mem3#1;havoc main_#t~mem3#1;call main_#t~mem4#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 20 == main_#t~mem4#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {202#false} is VALID [2022-02-20 14:09:10,761 INFO L290 TraceCheckUtils]: 9: Hoare triple {202#false} assume 0 == __VERIFIER_assert_~cond#1; {202#false} is VALID [2022-02-20 14:09:10,762 INFO L290 TraceCheckUtils]: 10: Hoare triple {202#false} assume !false; {202#false} is VALID [2022-02-20 14:09:10,762 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 14:09:10,762 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:09:10,762 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820489846] [2022-02-20 14:09:10,762 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820489846] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:09:10,763 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712976680] [2022-02-20 14:09:10,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:09:10,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:09:10,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:09:10,765 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 14:09:10,795 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 14:09:10,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:09:10,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 14:09:10,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:09:10,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:09:10,942 INFO L290 TraceCheckUtils]: 0: Hoare triple {201#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(18, 2); {201#true} is VALID [2022-02-20 14:09:10,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {201#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {211#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:10,943 INFO L290 TraceCheckUtils]: 2: Hoare triple {211#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {211#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:10,944 INFO L290 TraceCheckUtils]: 3: Hoare triple {211#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {211#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:10,944 INFO L290 TraceCheckUtils]: 4: Hoare triple {211#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_~i~0#1 := 2 + main_~i~0#1; {204#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:09:10,952 INFO L290 TraceCheckUtils]: 5: Hoare triple {204#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(main_~i~0#1 < 100000); {202#false} is VALID [2022-02-20 14:09:10,952 INFO L290 TraceCheckUtils]: 6: Hoare triple {202#false} main_~i~0#1 := 0; {202#false} is VALID [2022-02-20 14:09:10,952 INFO L290 TraceCheckUtils]: 7: Hoare triple {202#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {202#false} is VALID [2022-02-20 14:09:10,952 INFO L290 TraceCheckUtils]: 8: Hoare triple {202#false} assume 10 == main_#t~mem3#1;havoc main_#t~mem3#1;call main_#t~mem4#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 20 == main_#t~mem4#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {202#false} is VALID [2022-02-20 14:09:10,953 INFO L290 TraceCheckUtils]: 9: Hoare triple {202#false} assume 0 == __VERIFIER_assert_~cond#1; {202#false} is VALID [2022-02-20 14:09:10,953 INFO L290 TraceCheckUtils]: 10: Hoare triple {202#false} assume !false; {202#false} is VALID [2022-02-20 14:09:10,953 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 14:09:10,953 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:09:11,025 INFO L290 TraceCheckUtils]: 10: Hoare triple {202#false} assume !false; {202#false} is VALID [2022-02-20 14:09:11,026 INFO L290 TraceCheckUtils]: 9: Hoare triple {202#false} assume 0 == __VERIFIER_assert_~cond#1; {202#false} is VALID [2022-02-20 14:09:11,026 INFO L290 TraceCheckUtils]: 8: Hoare triple {202#false} assume 10 == main_#t~mem3#1;havoc main_#t~mem3#1;call main_#t~mem4#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 20 == main_#t~mem4#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {202#false} is VALID [2022-02-20 14:09:11,026 INFO L290 TraceCheckUtils]: 7: Hoare triple {202#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {202#false} is VALID [2022-02-20 14:09:11,026 INFO L290 TraceCheckUtils]: 6: Hoare triple {202#false} main_~i~0#1 := 0; {202#false} is VALID [2022-02-20 14:09:11,029 INFO L290 TraceCheckUtils]: 5: Hoare triple {254#(< |ULTIMATE.start_main_~i~0#1| 100000)} assume !(main_~i~0#1 < 100000); {202#false} is VALID [2022-02-20 14:09:11,031 INFO L290 TraceCheckUtils]: 4: Hoare triple {258#(< |ULTIMATE.start_main_~i~0#1| 99998)} main_~i~0#1 := 2 + main_~i~0#1; {254#(< |ULTIMATE.start_main_~i~0#1| 100000)} is VALID [2022-02-20 14:09:11,031 INFO L290 TraceCheckUtils]: 3: Hoare triple {258#(< |ULTIMATE.start_main_~i~0#1| 99998)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {258#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:09:11,032 INFO L290 TraceCheckUtils]: 2: Hoare triple {258#(< |ULTIMATE.start_main_~i~0#1| 99998)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {258#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:09:11,032 INFO L290 TraceCheckUtils]: 1: Hoare triple {201#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {258#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:09:11,033 INFO L290 TraceCheckUtils]: 0: Hoare triple {201#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(18, 2); {201#true} is VALID [2022-02-20 14:09:11,033 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 14:09:11,033 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [712976680] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:09:11,033 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:09:11,033 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-02-20 14:09:11,034 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422267342] [2022-02-20 14:09:11,034 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:09:11,034 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 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 14:09:11,034 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:09:11,035 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:11,057 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:09:11,057 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 14:09:11,058 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:09:11,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 14:09:11,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-02-20 14:09:11,059 INFO L87 Difference]: Start difference. First operand 14 states and 17 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:11,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:09:11,161 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2022-02-20 14:09:11,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 14:09:11,161 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 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 14:09:11,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:09:11,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:11,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2022-02-20 14:09:11,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:11,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2022-02-20 14:09:11,164 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 66 transitions. [2022-02-20 14:09:11,210 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:09:11,211 INFO L225 Difference]: With dead ends: 53 [2022-02-20 14:09:11,211 INFO L226 Difference]: Without dead ends: 45 [2022-02-20 14:09:11,211 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-02-20 14:09:11,212 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 68 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:09:11,212 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 30 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:09:11,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-02-20 14:09:11,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 23. [2022-02-20 14:09:11,217 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:09:11,217 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 23 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:11,217 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 23 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:11,218 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 23 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:11,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:09:11,219 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2022-02-20 14:09:11,220 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2022-02-20 14:09:11,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:09:11,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:09:11,220 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 0 states have call successors, (0), 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 45 states. [2022-02-20 14:09:11,221 INFO L87 Difference]: Start difference. First operand has 23 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 0 states have call successors, (0), 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 45 states. [2022-02-20 14:09:11,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:09:11,222 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2022-02-20 14:09:11,223 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2022-02-20 14:09:11,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:09:11,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:09:11,223 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:09:11,223 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:09:11,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:11,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2022-02-20 14:09:11,224 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 11 [2022-02-20 14:09:11,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:09:11,225 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2022-02-20 14:09:11,225 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:11,225 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-02-20 14:09:11,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 14:09:11,226 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:09:11,226 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:09:11,250 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 14:09:11,443 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:09:11,444 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:09:11,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:09:11,444 INFO L85 PathProgramCache]: Analyzing trace with hash -215393963, now seen corresponding path program 2 times [2022-02-20 14:09:11,444 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:09:11,444 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620138109] [2022-02-20 14:09:11,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:09:11,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:09:11,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:09:11,552 INFO L290 TraceCheckUtils]: 0: Hoare triple {453#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(18, 2); {453#true} is VALID [2022-02-20 14:09:11,553 INFO L290 TraceCheckUtils]: 1: Hoare triple {453#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {455#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:11,554 INFO L290 TraceCheckUtils]: 2: Hoare triple {455#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {455#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:11,556 INFO L290 TraceCheckUtils]: 3: Hoare triple {455#(= |ULTIMATE.start_main_~i~0#1| 0)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {455#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:11,557 INFO L290 TraceCheckUtils]: 4: Hoare triple {455#(= |ULTIMATE.start_main_~i~0#1| 0)} main_~i~0#1 := 2 + main_~i~0#1; {456#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:09:11,557 INFO L290 TraceCheckUtils]: 5: Hoare triple {456#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {456#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:09:11,558 INFO L290 TraceCheckUtils]: 6: Hoare triple {456#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {456#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:09:11,559 INFO L290 TraceCheckUtils]: 7: Hoare triple {456#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_~i~0#1 := 2 + main_~i~0#1; {457#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:09:11,559 INFO L290 TraceCheckUtils]: 8: Hoare triple {457#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {457#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:09:11,559 INFO L290 TraceCheckUtils]: 9: Hoare triple {457#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {457#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:09:11,560 INFO L290 TraceCheckUtils]: 10: Hoare triple {457#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_~i~0#1 := 2 + main_~i~0#1; {458#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:09:11,560 INFO L290 TraceCheckUtils]: 11: Hoare triple {458#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {458#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:09:11,561 INFO L290 TraceCheckUtils]: 12: Hoare triple {458#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {458#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:09:11,561 INFO L290 TraceCheckUtils]: 13: Hoare triple {458#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_~i~0#1 := 2 + main_~i~0#1; {459#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:09:11,562 INFO L290 TraceCheckUtils]: 14: Hoare triple {459#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !(main_~i~0#1 < 100000); {454#false} is VALID [2022-02-20 14:09:11,563 INFO L290 TraceCheckUtils]: 15: Hoare triple {454#false} main_~i~0#1 := 0; {454#false} is VALID [2022-02-20 14:09:11,563 INFO L290 TraceCheckUtils]: 16: Hoare triple {454#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {454#false} is VALID [2022-02-20 14:09:11,563 INFO L290 TraceCheckUtils]: 17: Hoare triple {454#false} assume 10 == main_#t~mem3#1;havoc main_#t~mem3#1;call main_#t~mem4#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 20 == main_#t~mem4#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {454#false} is VALID [2022-02-20 14:09:11,564 INFO L290 TraceCheckUtils]: 18: Hoare triple {454#false} assume 0 == __VERIFIER_assert_~cond#1; {454#false} is VALID [2022-02-20 14:09:11,564 INFO L290 TraceCheckUtils]: 19: Hoare triple {454#false} assume !false; {454#false} is VALID [2022-02-20 14:09:11,564 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:09:11,564 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:09:11,564 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620138109] [2022-02-20 14:09:11,565 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620138109] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:09:11,565 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371199040] [2022-02-20 14:09:11,565 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 14:09:11,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:09:11,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:09:11,566 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 14:09:11,569 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 14:09:11,620 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 14:09:11,620 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:09:11,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 14:09:11,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:09:11,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:09:11,727 INFO L290 TraceCheckUtils]: 0: Hoare triple {453#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(18, 2); {453#true} is VALID [2022-02-20 14:09:11,728 INFO L290 TraceCheckUtils]: 1: Hoare triple {453#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {466#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:11,729 INFO L290 TraceCheckUtils]: 2: Hoare triple {466#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {466#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:11,729 INFO L290 TraceCheckUtils]: 3: Hoare triple {466#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {466#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:11,730 INFO L290 TraceCheckUtils]: 4: Hoare triple {466#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_~i~0#1 := 2 + main_~i~0#1; {456#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:09:11,730 INFO L290 TraceCheckUtils]: 5: Hoare triple {456#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {456#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:09:11,731 INFO L290 TraceCheckUtils]: 6: Hoare triple {456#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {456#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:09:11,731 INFO L290 TraceCheckUtils]: 7: Hoare triple {456#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_~i~0#1 := 2 + main_~i~0#1; {457#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:09:11,732 INFO L290 TraceCheckUtils]: 8: Hoare triple {457#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {457#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:09:11,732 INFO L290 TraceCheckUtils]: 9: Hoare triple {457#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {457#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:09:11,732 INFO L290 TraceCheckUtils]: 10: Hoare triple {457#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_~i~0#1 := 2 + main_~i~0#1; {458#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:09:11,733 INFO L290 TraceCheckUtils]: 11: Hoare triple {458#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {458#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:09:11,733 INFO L290 TraceCheckUtils]: 12: Hoare triple {458#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {458#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:09:11,734 INFO L290 TraceCheckUtils]: 13: Hoare triple {458#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_~i~0#1 := 2 + main_~i~0#1; {459#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:09:11,734 INFO L290 TraceCheckUtils]: 14: Hoare triple {459#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !(main_~i~0#1 < 100000); {454#false} is VALID [2022-02-20 14:09:11,734 INFO L290 TraceCheckUtils]: 15: Hoare triple {454#false} main_~i~0#1 := 0; {454#false} is VALID [2022-02-20 14:09:11,735 INFO L290 TraceCheckUtils]: 16: Hoare triple {454#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {454#false} is VALID [2022-02-20 14:09:11,735 INFO L290 TraceCheckUtils]: 17: Hoare triple {454#false} assume 10 == main_#t~mem3#1;havoc main_#t~mem3#1;call main_#t~mem4#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 20 == main_#t~mem4#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {454#false} is VALID [2022-02-20 14:09:11,735 INFO L290 TraceCheckUtils]: 18: Hoare triple {454#false} assume 0 == __VERIFIER_assert_~cond#1; {454#false} is VALID [2022-02-20 14:09:11,735 INFO L290 TraceCheckUtils]: 19: Hoare triple {454#false} assume !false; {454#false} is VALID [2022-02-20 14:09:11,735 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:09:11,735 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:09:11,862 INFO L290 TraceCheckUtils]: 19: Hoare triple {454#false} assume !false; {454#false} is VALID [2022-02-20 14:09:11,863 INFO L290 TraceCheckUtils]: 18: Hoare triple {454#false} assume 0 == __VERIFIER_assert_~cond#1; {454#false} is VALID [2022-02-20 14:09:11,863 INFO L290 TraceCheckUtils]: 17: Hoare triple {454#false} assume 10 == main_#t~mem3#1;havoc main_#t~mem3#1;call main_#t~mem4#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 20 == main_#t~mem4#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {454#false} is VALID [2022-02-20 14:09:11,863 INFO L290 TraceCheckUtils]: 16: Hoare triple {454#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {454#false} is VALID [2022-02-20 14:09:11,863 INFO L290 TraceCheckUtils]: 15: Hoare triple {454#false} main_~i~0#1 := 0; {454#false} is VALID [2022-02-20 14:09:11,864 INFO L290 TraceCheckUtils]: 14: Hoare triple {536#(< |ULTIMATE.start_main_~i~0#1| 100000)} assume !(main_~i~0#1 < 100000); {454#false} is VALID [2022-02-20 14:09:11,864 INFO L290 TraceCheckUtils]: 13: Hoare triple {540#(< |ULTIMATE.start_main_~i~0#1| 99998)} main_~i~0#1 := 2 + main_~i~0#1; {536#(< |ULTIMATE.start_main_~i~0#1| 100000)} is VALID [2022-02-20 14:09:11,865 INFO L290 TraceCheckUtils]: 12: Hoare triple {540#(< |ULTIMATE.start_main_~i~0#1| 99998)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {540#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:09:11,865 INFO L290 TraceCheckUtils]: 11: Hoare triple {540#(< |ULTIMATE.start_main_~i~0#1| 99998)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {540#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:09:11,866 INFO L290 TraceCheckUtils]: 10: Hoare triple {550#(< |ULTIMATE.start_main_~i~0#1| 99996)} main_~i~0#1 := 2 + main_~i~0#1; {540#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:09:11,866 INFO L290 TraceCheckUtils]: 9: Hoare triple {550#(< |ULTIMATE.start_main_~i~0#1| 99996)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {550#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-20 14:09:11,866 INFO L290 TraceCheckUtils]: 8: Hoare triple {550#(< |ULTIMATE.start_main_~i~0#1| 99996)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {550#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-20 14:09:11,867 INFO L290 TraceCheckUtils]: 7: Hoare triple {560#(< |ULTIMATE.start_main_~i~0#1| 99994)} main_~i~0#1 := 2 + main_~i~0#1; {550#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-20 14:09:11,867 INFO L290 TraceCheckUtils]: 6: Hoare triple {560#(< |ULTIMATE.start_main_~i~0#1| 99994)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {560#(< |ULTIMATE.start_main_~i~0#1| 99994)} is VALID [2022-02-20 14:09:11,867 INFO L290 TraceCheckUtils]: 5: Hoare triple {560#(< |ULTIMATE.start_main_~i~0#1| 99994)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {560#(< |ULTIMATE.start_main_~i~0#1| 99994)} is VALID [2022-02-20 14:09:11,868 INFO L290 TraceCheckUtils]: 4: Hoare triple {570#(< |ULTIMATE.start_main_~i~0#1| 99992)} main_~i~0#1 := 2 + main_~i~0#1; {560#(< |ULTIMATE.start_main_~i~0#1| 99994)} is VALID [2022-02-20 14:09:11,868 INFO L290 TraceCheckUtils]: 3: Hoare triple {570#(< |ULTIMATE.start_main_~i~0#1| 99992)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {570#(< |ULTIMATE.start_main_~i~0#1| 99992)} is VALID [2022-02-20 14:09:11,869 INFO L290 TraceCheckUtils]: 2: Hoare triple {570#(< |ULTIMATE.start_main_~i~0#1| 99992)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {570#(< |ULTIMATE.start_main_~i~0#1| 99992)} is VALID [2022-02-20 14:09:11,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {453#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {570#(< |ULTIMATE.start_main_~i~0#1| 99992)} is VALID [2022-02-20 14:09:11,869 INFO L290 TraceCheckUtils]: 0: Hoare triple {453#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(18, 2); {453#true} is VALID [2022-02-20 14:09:11,870 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:09:11,870 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1371199040] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:09:11,870 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:09:11,870 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-02-20 14:09:11,870 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287068207] [2022-02-20 14:09:11,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:09:11,871 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 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 20 [2022-02-20 14:09:11,871 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:09:11,872 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:11,901 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 14:09:11,901 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 14:09:11,901 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:09:11,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 14:09:11,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-02-20 14:09:11,902 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:12,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:09:12,136 INFO L93 Difference]: Finished difference Result 113 states and 141 transitions. [2022-02-20 14:09:12,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 14:09:12,137 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 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 20 [2022-02-20 14:09:12,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:09:12,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:12,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 141 transitions. [2022-02-20 14:09:12,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:12,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 141 transitions. [2022-02-20 14:09:12,141 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 141 transitions. [2022-02-20 14:09:12,242 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:09:12,244 INFO L225 Difference]: With dead ends: 113 [2022-02-20 14:09:12,245 INFO L226 Difference]: Without dead ends: 105 [2022-02-20 14:09:12,245 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-02-20 14:09:12,246 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 198 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:09:12,246 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [198 Valid, 72 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:09:12,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-02-20 14:09:12,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 41. [2022-02-20 14:09:12,256 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:09:12,257 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand has 41 states, 40 states have (on average 1.325) internal successors, (53), 40 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:12,257 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand has 41 states, 40 states have (on average 1.325) internal successors, (53), 40 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:12,257 INFO L87 Difference]: Start difference. First operand 105 states. Second operand has 41 states, 40 states have (on average 1.325) internal successors, (53), 40 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:12,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:09:12,260 INFO L93 Difference]: Finished difference Result 105 states and 126 transitions. [2022-02-20 14:09:12,260 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 126 transitions. [2022-02-20 14:09:12,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:09:12,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:09:12,261 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 40 states have (on average 1.325) internal successors, (53), 40 states have internal predecessors, (53), 0 states have call successors, (0), 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 105 states. [2022-02-20 14:09:12,261 INFO L87 Difference]: Start difference. First operand has 41 states, 40 states have (on average 1.325) internal successors, (53), 40 states have internal predecessors, (53), 0 states have call successors, (0), 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 105 states. [2022-02-20 14:09:12,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:09:12,267 INFO L93 Difference]: Finished difference Result 105 states and 126 transitions. [2022-02-20 14:09:12,268 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 126 transitions. [2022-02-20 14:09:12,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:09:12,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:09:12,268 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:09:12,269 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:09:12,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.325) internal successors, (53), 40 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:12,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 53 transitions. [2022-02-20 14:09:12,270 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 53 transitions. Word has length 20 [2022-02-20 14:09:12,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:09:12,270 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 53 transitions. [2022-02-20 14:09:12,271 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:12,271 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2022-02-20 14:09:12,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-20 14:09:12,271 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:09:12,272 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:09:12,293 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 14:09:12,487 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,SelfDestructingSolverStorable3 [2022-02-20 14:09:12,488 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:09:12,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:09:12,488 INFO L85 PathProgramCache]: Analyzing trace with hash -175662507, now seen corresponding path program 3 times [2022-02-20 14:09:12,488 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:09:12,488 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574284199] [2022-02-20 14:09:12,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:09:12,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:09:12,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:09:12,653 INFO L290 TraceCheckUtils]: 0: Hoare triple {981#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(18, 2); {981#true} is VALID [2022-02-20 14:09:12,654 INFO L290 TraceCheckUtils]: 1: Hoare triple {981#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {983#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:12,654 INFO L290 TraceCheckUtils]: 2: Hoare triple {983#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {983#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:12,655 INFO L290 TraceCheckUtils]: 3: Hoare triple {983#(= |ULTIMATE.start_main_~i~0#1| 0)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {983#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:12,656 INFO L290 TraceCheckUtils]: 4: Hoare triple {983#(= |ULTIMATE.start_main_~i~0#1| 0)} main_~i~0#1 := 2 + main_~i~0#1; {984#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:09:12,656 INFO L290 TraceCheckUtils]: 5: Hoare triple {984#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {984#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:09:12,658 INFO L290 TraceCheckUtils]: 6: Hoare triple {984#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {984#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:09:12,658 INFO L290 TraceCheckUtils]: 7: Hoare triple {984#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_~i~0#1 := 2 + main_~i~0#1; {985#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:09:12,667 INFO L290 TraceCheckUtils]: 8: Hoare triple {985#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {985#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:09:12,668 INFO L290 TraceCheckUtils]: 9: Hoare triple {985#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {985#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:09:12,669 INFO L290 TraceCheckUtils]: 10: Hoare triple {985#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_~i~0#1 := 2 + main_~i~0#1; {986#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:09:12,669 INFO L290 TraceCheckUtils]: 11: Hoare triple {986#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {986#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:09:12,669 INFO L290 TraceCheckUtils]: 12: Hoare triple {986#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {986#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:09:12,670 INFO L290 TraceCheckUtils]: 13: Hoare triple {986#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_~i~0#1 := 2 + main_~i~0#1; {987#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:09:12,670 INFO L290 TraceCheckUtils]: 14: Hoare triple {987#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {987#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:09:12,671 INFO L290 TraceCheckUtils]: 15: Hoare triple {987#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {987#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:09:12,671 INFO L290 TraceCheckUtils]: 16: Hoare triple {987#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_~i~0#1 := 2 + main_~i~0#1; {988#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:09:12,672 INFO L290 TraceCheckUtils]: 17: Hoare triple {988#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {988#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:09:12,672 INFO L290 TraceCheckUtils]: 18: Hoare triple {988#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {988#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:09:12,672 INFO L290 TraceCheckUtils]: 19: Hoare triple {988#(<= |ULTIMATE.start_main_~i~0#1| 10)} main_~i~0#1 := 2 + main_~i~0#1; {989#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 14:09:12,673 INFO L290 TraceCheckUtils]: 20: Hoare triple {989#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {989#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 14:09:12,673 INFO L290 TraceCheckUtils]: 21: Hoare triple {989#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {989#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 14:09:12,673 INFO L290 TraceCheckUtils]: 22: Hoare triple {989#(<= |ULTIMATE.start_main_~i~0#1| 12)} main_~i~0#1 := 2 + main_~i~0#1; {990#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 14:09:12,674 INFO L290 TraceCheckUtils]: 23: Hoare triple {990#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {990#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 14:09:12,674 INFO L290 TraceCheckUtils]: 24: Hoare triple {990#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {990#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 14:09:12,674 INFO L290 TraceCheckUtils]: 25: Hoare triple {990#(<= |ULTIMATE.start_main_~i~0#1| 14)} main_~i~0#1 := 2 + main_~i~0#1; {991#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 14:09:12,675 INFO L290 TraceCheckUtils]: 26: Hoare triple {991#(<= |ULTIMATE.start_main_~i~0#1| 16)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {991#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 14:09:12,675 INFO L290 TraceCheckUtils]: 27: Hoare triple {991#(<= |ULTIMATE.start_main_~i~0#1| 16)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {991#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 14:09:12,675 INFO L290 TraceCheckUtils]: 28: Hoare triple {991#(<= |ULTIMATE.start_main_~i~0#1| 16)} main_~i~0#1 := 2 + main_~i~0#1; {992#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 14:09:12,676 INFO L290 TraceCheckUtils]: 29: Hoare triple {992#(<= |ULTIMATE.start_main_~i~0#1| 18)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {992#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 14:09:12,676 INFO L290 TraceCheckUtils]: 30: Hoare triple {992#(<= |ULTIMATE.start_main_~i~0#1| 18)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {992#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 14:09:12,677 INFO L290 TraceCheckUtils]: 31: Hoare triple {992#(<= |ULTIMATE.start_main_~i~0#1| 18)} main_~i~0#1 := 2 + main_~i~0#1; {993#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 14:09:12,677 INFO L290 TraceCheckUtils]: 32: Hoare triple {993#(<= |ULTIMATE.start_main_~i~0#1| 20)} assume !(main_~i~0#1 < 100000); {982#false} is VALID [2022-02-20 14:09:12,677 INFO L290 TraceCheckUtils]: 33: Hoare triple {982#false} main_~i~0#1 := 0; {982#false} is VALID [2022-02-20 14:09:12,677 INFO L290 TraceCheckUtils]: 34: Hoare triple {982#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {982#false} is VALID [2022-02-20 14:09:12,677 INFO L290 TraceCheckUtils]: 35: Hoare triple {982#false} assume 10 == main_#t~mem3#1;havoc main_#t~mem3#1;call main_#t~mem4#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 20 == main_#t~mem4#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {982#false} is VALID [2022-02-20 14:09:12,677 INFO L290 TraceCheckUtils]: 36: Hoare triple {982#false} assume 0 == __VERIFIER_assert_~cond#1; {982#false} is VALID [2022-02-20 14:09:12,677 INFO L290 TraceCheckUtils]: 37: Hoare triple {982#false} assume !false; {982#false} is VALID [2022-02-20 14:09:12,678 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:09:12,678 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:09:12,679 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574284199] [2022-02-20 14:09:12,679 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574284199] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:09:12,679 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066062179] [2022-02-20 14:09:12,679 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 14:09:12,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:09:12,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:09:12,681 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 14:09:12,682 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 14:09:13,073 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-02-20 14:09:13,073 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:09:13,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 14:09:13,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:09:13,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:09:13,383 INFO L290 TraceCheckUtils]: 0: Hoare triple {981#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(18, 2); {981#true} is VALID [2022-02-20 14:09:13,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {981#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {1000#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:13,385 INFO L290 TraceCheckUtils]: 2: Hoare triple {1000#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1000#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:13,385 INFO L290 TraceCheckUtils]: 3: Hoare triple {1000#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {1000#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:13,385 INFO L290 TraceCheckUtils]: 4: Hoare triple {1000#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_~i~0#1 := 2 + main_~i~0#1; {984#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:09:13,386 INFO L290 TraceCheckUtils]: 5: Hoare triple {984#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {984#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:09:13,386 INFO L290 TraceCheckUtils]: 6: Hoare triple {984#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {984#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:09:13,386 INFO L290 TraceCheckUtils]: 7: Hoare triple {984#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_~i~0#1 := 2 + main_~i~0#1; {985#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:09:13,387 INFO L290 TraceCheckUtils]: 8: Hoare triple {985#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {985#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:09:13,387 INFO L290 TraceCheckUtils]: 9: Hoare triple {985#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {985#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:09:13,388 INFO L290 TraceCheckUtils]: 10: Hoare triple {985#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_~i~0#1 := 2 + main_~i~0#1; {986#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:09:13,388 INFO L290 TraceCheckUtils]: 11: Hoare triple {986#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {986#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:09:13,388 INFO L290 TraceCheckUtils]: 12: Hoare triple {986#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {986#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:09:13,389 INFO L290 TraceCheckUtils]: 13: Hoare triple {986#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_~i~0#1 := 2 + main_~i~0#1; {987#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:09:13,389 INFO L290 TraceCheckUtils]: 14: Hoare triple {987#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {987#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:09:13,389 INFO L290 TraceCheckUtils]: 15: Hoare triple {987#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {987#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:09:13,390 INFO L290 TraceCheckUtils]: 16: Hoare triple {987#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_~i~0#1 := 2 + main_~i~0#1; {988#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:09:13,390 INFO L290 TraceCheckUtils]: 17: Hoare triple {988#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {988#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:09:13,391 INFO L290 TraceCheckUtils]: 18: Hoare triple {988#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {988#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:09:13,391 INFO L290 TraceCheckUtils]: 19: Hoare triple {988#(<= |ULTIMATE.start_main_~i~0#1| 10)} main_~i~0#1 := 2 + main_~i~0#1; {989#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 14:09:13,392 INFO L290 TraceCheckUtils]: 20: Hoare triple {989#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {989#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 14:09:13,392 INFO L290 TraceCheckUtils]: 21: Hoare triple {989#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {989#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 14:09:13,392 INFO L290 TraceCheckUtils]: 22: Hoare triple {989#(<= |ULTIMATE.start_main_~i~0#1| 12)} main_~i~0#1 := 2 + main_~i~0#1; {990#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 14:09:13,393 INFO L290 TraceCheckUtils]: 23: Hoare triple {990#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {990#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 14:09:13,393 INFO L290 TraceCheckUtils]: 24: Hoare triple {990#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {990#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 14:09:13,394 INFO L290 TraceCheckUtils]: 25: Hoare triple {990#(<= |ULTIMATE.start_main_~i~0#1| 14)} main_~i~0#1 := 2 + main_~i~0#1; {991#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 14:09:13,394 INFO L290 TraceCheckUtils]: 26: Hoare triple {991#(<= |ULTIMATE.start_main_~i~0#1| 16)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {991#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 14:09:13,394 INFO L290 TraceCheckUtils]: 27: Hoare triple {991#(<= |ULTIMATE.start_main_~i~0#1| 16)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {991#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 14:09:13,395 INFO L290 TraceCheckUtils]: 28: Hoare triple {991#(<= |ULTIMATE.start_main_~i~0#1| 16)} main_~i~0#1 := 2 + main_~i~0#1; {992#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 14:09:13,395 INFO L290 TraceCheckUtils]: 29: Hoare triple {992#(<= |ULTIMATE.start_main_~i~0#1| 18)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {992#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 14:09:13,395 INFO L290 TraceCheckUtils]: 30: Hoare triple {992#(<= |ULTIMATE.start_main_~i~0#1| 18)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {992#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 14:09:13,396 INFO L290 TraceCheckUtils]: 31: Hoare triple {992#(<= |ULTIMATE.start_main_~i~0#1| 18)} main_~i~0#1 := 2 + main_~i~0#1; {993#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 14:09:13,396 INFO L290 TraceCheckUtils]: 32: Hoare triple {993#(<= |ULTIMATE.start_main_~i~0#1| 20)} assume !(main_~i~0#1 < 100000); {982#false} is VALID [2022-02-20 14:09:13,396 INFO L290 TraceCheckUtils]: 33: Hoare triple {982#false} main_~i~0#1 := 0; {982#false} is VALID [2022-02-20 14:09:13,396 INFO L290 TraceCheckUtils]: 34: Hoare triple {982#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {982#false} is VALID [2022-02-20 14:09:13,397 INFO L290 TraceCheckUtils]: 35: Hoare triple {982#false} assume 10 == main_#t~mem3#1;havoc main_#t~mem3#1;call main_#t~mem4#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 20 == main_#t~mem4#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {982#false} is VALID [2022-02-20 14:09:13,397 INFO L290 TraceCheckUtils]: 36: Hoare triple {982#false} assume 0 == __VERIFIER_assert_~cond#1; {982#false} is VALID [2022-02-20 14:09:13,397 INFO L290 TraceCheckUtils]: 37: Hoare triple {982#false} assume !false; {982#false} is VALID [2022-02-20 14:09:13,397 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:09:13,397 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:09:13,715 INFO L290 TraceCheckUtils]: 37: Hoare triple {982#false} assume !false; {982#false} is VALID [2022-02-20 14:09:13,715 INFO L290 TraceCheckUtils]: 36: Hoare triple {982#false} assume 0 == __VERIFIER_assert_~cond#1; {982#false} is VALID [2022-02-20 14:09:13,715 INFO L290 TraceCheckUtils]: 35: Hoare triple {982#false} assume 10 == main_#t~mem3#1;havoc main_#t~mem3#1;call main_#t~mem4#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 20 == main_#t~mem4#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {982#false} is VALID [2022-02-20 14:09:13,715 INFO L290 TraceCheckUtils]: 34: Hoare triple {982#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {982#false} is VALID [2022-02-20 14:09:13,715 INFO L290 TraceCheckUtils]: 33: Hoare triple {982#false} main_~i~0#1 := 0; {982#false} is VALID [2022-02-20 14:09:13,715 INFO L290 TraceCheckUtils]: 32: Hoare triple {1124#(< |ULTIMATE.start_main_~i~0#1| 100000)} assume !(main_~i~0#1 < 100000); {982#false} is VALID [2022-02-20 14:09:13,716 INFO L290 TraceCheckUtils]: 31: Hoare triple {1128#(< |ULTIMATE.start_main_~i~0#1| 99998)} main_~i~0#1 := 2 + main_~i~0#1; {1124#(< |ULTIMATE.start_main_~i~0#1| 100000)} is VALID [2022-02-20 14:09:13,716 INFO L290 TraceCheckUtils]: 30: Hoare triple {1128#(< |ULTIMATE.start_main_~i~0#1| 99998)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {1128#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:09:13,716 INFO L290 TraceCheckUtils]: 29: Hoare triple {1128#(< |ULTIMATE.start_main_~i~0#1| 99998)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1128#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:09:13,717 INFO L290 TraceCheckUtils]: 28: Hoare triple {1138#(< |ULTIMATE.start_main_~i~0#1| 99996)} main_~i~0#1 := 2 + main_~i~0#1; {1128#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:09:13,717 INFO L290 TraceCheckUtils]: 27: Hoare triple {1138#(< |ULTIMATE.start_main_~i~0#1| 99996)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {1138#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-20 14:09:13,717 INFO L290 TraceCheckUtils]: 26: Hoare triple {1138#(< |ULTIMATE.start_main_~i~0#1| 99996)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1138#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-20 14:09:13,718 INFO L290 TraceCheckUtils]: 25: Hoare triple {1148#(< |ULTIMATE.start_main_~i~0#1| 99994)} main_~i~0#1 := 2 + main_~i~0#1; {1138#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-20 14:09:13,719 INFO L290 TraceCheckUtils]: 24: Hoare triple {1148#(< |ULTIMATE.start_main_~i~0#1| 99994)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {1148#(< |ULTIMATE.start_main_~i~0#1| 99994)} is VALID [2022-02-20 14:09:13,719 INFO L290 TraceCheckUtils]: 23: Hoare triple {1148#(< |ULTIMATE.start_main_~i~0#1| 99994)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1148#(< |ULTIMATE.start_main_~i~0#1| 99994)} is VALID [2022-02-20 14:09:13,719 INFO L290 TraceCheckUtils]: 22: Hoare triple {1158#(< |ULTIMATE.start_main_~i~0#1| 99992)} main_~i~0#1 := 2 + main_~i~0#1; {1148#(< |ULTIMATE.start_main_~i~0#1| 99994)} is VALID [2022-02-20 14:09:13,720 INFO L290 TraceCheckUtils]: 21: Hoare triple {1158#(< |ULTIMATE.start_main_~i~0#1| 99992)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {1158#(< |ULTIMATE.start_main_~i~0#1| 99992)} is VALID [2022-02-20 14:09:13,720 INFO L290 TraceCheckUtils]: 20: Hoare triple {1158#(< |ULTIMATE.start_main_~i~0#1| 99992)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1158#(< |ULTIMATE.start_main_~i~0#1| 99992)} is VALID [2022-02-20 14:09:13,721 INFO L290 TraceCheckUtils]: 19: Hoare triple {1168#(< |ULTIMATE.start_main_~i~0#1| 99990)} main_~i~0#1 := 2 + main_~i~0#1; {1158#(< |ULTIMATE.start_main_~i~0#1| 99992)} is VALID [2022-02-20 14:09:13,723 INFO L290 TraceCheckUtils]: 18: Hoare triple {1168#(< |ULTIMATE.start_main_~i~0#1| 99990)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {1168#(< |ULTIMATE.start_main_~i~0#1| 99990)} is VALID [2022-02-20 14:09:13,724 INFO L290 TraceCheckUtils]: 17: Hoare triple {1168#(< |ULTIMATE.start_main_~i~0#1| 99990)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1168#(< |ULTIMATE.start_main_~i~0#1| 99990)} is VALID [2022-02-20 14:09:13,724 INFO L290 TraceCheckUtils]: 16: Hoare triple {1178#(< |ULTIMATE.start_main_~i~0#1| 99988)} main_~i~0#1 := 2 + main_~i~0#1; {1168#(< |ULTIMATE.start_main_~i~0#1| 99990)} is VALID [2022-02-20 14:09:13,724 INFO L290 TraceCheckUtils]: 15: Hoare triple {1178#(< |ULTIMATE.start_main_~i~0#1| 99988)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {1178#(< |ULTIMATE.start_main_~i~0#1| 99988)} is VALID [2022-02-20 14:09:13,725 INFO L290 TraceCheckUtils]: 14: Hoare triple {1178#(< |ULTIMATE.start_main_~i~0#1| 99988)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1178#(< |ULTIMATE.start_main_~i~0#1| 99988)} is VALID [2022-02-20 14:09:13,725 INFO L290 TraceCheckUtils]: 13: Hoare triple {1188#(< |ULTIMATE.start_main_~i~0#1| 99986)} main_~i~0#1 := 2 + main_~i~0#1; {1178#(< |ULTIMATE.start_main_~i~0#1| 99988)} is VALID [2022-02-20 14:09:13,725 INFO L290 TraceCheckUtils]: 12: Hoare triple {1188#(< |ULTIMATE.start_main_~i~0#1| 99986)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {1188#(< |ULTIMATE.start_main_~i~0#1| 99986)} is VALID [2022-02-20 14:09:13,726 INFO L290 TraceCheckUtils]: 11: Hoare triple {1188#(< |ULTIMATE.start_main_~i~0#1| 99986)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1188#(< |ULTIMATE.start_main_~i~0#1| 99986)} is VALID [2022-02-20 14:09:13,726 INFO L290 TraceCheckUtils]: 10: Hoare triple {1198#(< |ULTIMATE.start_main_~i~0#1| 99984)} main_~i~0#1 := 2 + main_~i~0#1; {1188#(< |ULTIMATE.start_main_~i~0#1| 99986)} is VALID [2022-02-20 14:09:13,726 INFO L290 TraceCheckUtils]: 9: Hoare triple {1198#(< |ULTIMATE.start_main_~i~0#1| 99984)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {1198#(< |ULTIMATE.start_main_~i~0#1| 99984)} is VALID [2022-02-20 14:09:13,727 INFO L290 TraceCheckUtils]: 8: Hoare triple {1198#(< |ULTIMATE.start_main_~i~0#1| 99984)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1198#(< |ULTIMATE.start_main_~i~0#1| 99984)} is VALID [2022-02-20 14:09:13,727 INFO L290 TraceCheckUtils]: 7: Hoare triple {1208#(< |ULTIMATE.start_main_~i~0#1| 99982)} main_~i~0#1 := 2 + main_~i~0#1; {1198#(< |ULTIMATE.start_main_~i~0#1| 99984)} is VALID [2022-02-20 14:09:13,727 INFO L290 TraceCheckUtils]: 6: Hoare triple {1208#(< |ULTIMATE.start_main_~i~0#1| 99982)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {1208#(< |ULTIMATE.start_main_~i~0#1| 99982)} is VALID [2022-02-20 14:09:13,727 INFO L290 TraceCheckUtils]: 5: Hoare triple {1208#(< |ULTIMATE.start_main_~i~0#1| 99982)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1208#(< |ULTIMATE.start_main_~i~0#1| 99982)} is VALID [2022-02-20 14:09:13,728 INFO L290 TraceCheckUtils]: 4: Hoare triple {1218#(< |ULTIMATE.start_main_~i~0#1| 99980)} main_~i~0#1 := 2 + main_~i~0#1; {1208#(< |ULTIMATE.start_main_~i~0#1| 99982)} is VALID [2022-02-20 14:09:13,728 INFO L290 TraceCheckUtils]: 3: Hoare triple {1218#(< |ULTIMATE.start_main_~i~0#1| 99980)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {1218#(< |ULTIMATE.start_main_~i~0#1| 99980)} is VALID [2022-02-20 14:09:13,728 INFO L290 TraceCheckUtils]: 2: Hoare triple {1218#(< |ULTIMATE.start_main_~i~0#1| 99980)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1218#(< |ULTIMATE.start_main_~i~0#1| 99980)} is VALID [2022-02-20 14:09:13,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {981#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {1218#(< |ULTIMATE.start_main_~i~0#1| 99980)} is VALID [2022-02-20 14:09:13,729 INFO L290 TraceCheckUtils]: 0: Hoare triple {981#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(18, 2); {981#true} is VALID [2022-02-20 14:09:13,729 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:09:13,730 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066062179] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:09:13,730 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:09:13,730 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2022-02-20 14:09:13,730 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417120073] [2022-02-20 14:09:13,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:09:13,730 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.96) internal successors, (74), 25 states have internal predecessors, (74), 0 states have call successors, (0), 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 38 [2022-02-20 14:09:13,731 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:09:13,731 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 2.96) internal successors, (74), 25 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:13,782 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:09:13,782 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-02-20 14:09:13,782 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:09:13,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-02-20 14:09:13,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2022-02-20 14:09:13,783 INFO L87 Difference]: Start difference. First operand 41 states and 53 transitions. Second operand has 25 states, 25 states have (on average 2.96) internal successors, (74), 25 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:14,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:09:14,288 INFO L93 Difference]: Finished difference Result 233 states and 291 transitions. [2022-02-20 14:09:14,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-02-20 14:09:14,288 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.96) internal successors, (74), 25 states have internal predecessors, (74), 0 states have call successors, (0), 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 38 [2022-02-20 14:09:14,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:09:14,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.96) internal successors, (74), 25 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:14,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 291 transitions. [2022-02-20 14:09:14,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.96) internal successors, (74), 25 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:14,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 291 transitions. [2022-02-20 14:09:14,294 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 291 transitions. [2022-02-20 14:09:14,497 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 291 edges. 291 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:09:14,502 INFO L225 Difference]: With dead ends: 233 [2022-02-20 14:09:14,502 INFO L226 Difference]: Without dead ends: 225 [2022-02-20 14:09:14,503 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2022-02-20 14:09:14,503 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 556 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:09:14,503 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [556 Valid, 145 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:09:14,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2022-02-20 14:09:14,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 77. [2022-02-20 14:09:14,524 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:09:14,524 INFO L82 GeneralOperation]: Start isEquivalent. First operand 225 states. Second operand has 77 states, 76 states have (on average 1.3289473684210527) internal successors, (101), 76 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:14,524 INFO L74 IsIncluded]: Start isIncluded. First operand 225 states. Second operand has 77 states, 76 states have (on average 1.3289473684210527) internal successors, (101), 76 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:14,525 INFO L87 Difference]: Start difference. First operand 225 states. Second operand has 77 states, 76 states have (on average 1.3289473684210527) internal successors, (101), 76 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:14,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:09:14,530 INFO L93 Difference]: Finished difference Result 225 states and 270 transitions. [2022-02-20 14:09:14,530 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 270 transitions. [2022-02-20 14:09:14,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:09:14,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:09:14,531 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 76 states have (on average 1.3289473684210527) internal successors, (101), 76 states have internal predecessors, (101), 0 states have call successors, (0), 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 225 states. [2022-02-20 14:09:14,532 INFO L87 Difference]: Start difference. First operand has 77 states, 76 states have (on average 1.3289473684210527) internal successors, (101), 76 states have internal predecessors, (101), 0 states have call successors, (0), 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 225 states. [2022-02-20 14:09:14,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:09:14,537 INFO L93 Difference]: Finished difference Result 225 states and 270 transitions. [2022-02-20 14:09:14,537 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 270 transitions. [2022-02-20 14:09:14,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:09:14,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:09:14,538 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:09:14,538 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:09:14,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.3289473684210527) internal successors, (101), 76 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:14,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 101 transitions. [2022-02-20 14:09:14,540 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 101 transitions. Word has length 38 [2022-02-20 14:09:14,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:09:14,540 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 101 transitions. [2022-02-20 14:09:14,540 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.96) internal successors, (74), 25 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:14,540 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 101 transitions. [2022-02-20 14:09:14,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-02-20 14:09:14,541 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:09:14,542 INFO L514 BasicCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:09:14,563 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-02-20 14:09:14,760 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:09:14,761 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:09:14,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:09:14,761 INFO L85 PathProgramCache]: Analyzing trace with hash -414622635, now seen corresponding path program 4 times [2022-02-20 14:09:14,761 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:09:14,761 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138377418] [2022-02-20 14:09:14,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:09:14,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:09:14,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:09:15,155 INFO L290 TraceCheckUtils]: 0: Hoare triple {2061#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(18, 2); {2061#true} is VALID [2022-02-20 14:09:15,156 INFO L290 TraceCheckUtils]: 1: Hoare triple {2061#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {2063#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:15,156 INFO L290 TraceCheckUtils]: 2: Hoare triple {2063#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2063#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:15,156 INFO L290 TraceCheckUtils]: 3: Hoare triple {2063#(= |ULTIMATE.start_main_~i~0#1| 0)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {2063#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:15,157 INFO L290 TraceCheckUtils]: 4: Hoare triple {2063#(= |ULTIMATE.start_main_~i~0#1| 0)} main_~i~0#1 := 2 + main_~i~0#1; {2064#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:09:15,165 INFO L290 TraceCheckUtils]: 5: Hoare triple {2064#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2064#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:09:15,165 INFO L290 TraceCheckUtils]: 6: Hoare triple {2064#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {2064#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:09:15,166 INFO L290 TraceCheckUtils]: 7: Hoare triple {2064#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_~i~0#1 := 2 + main_~i~0#1; {2065#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:09:15,166 INFO L290 TraceCheckUtils]: 8: Hoare triple {2065#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2065#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:09:15,166 INFO L290 TraceCheckUtils]: 9: Hoare triple {2065#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {2065#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:09:15,167 INFO L290 TraceCheckUtils]: 10: Hoare triple {2065#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_~i~0#1 := 2 + main_~i~0#1; {2066#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:09:15,167 INFO L290 TraceCheckUtils]: 11: Hoare triple {2066#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2066#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:09:15,167 INFO L290 TraceCheckUtils]: 12: Hoare triple {2066#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {2066#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:09:15,168 INFO L290 TraceCheckUtils]: 13: Hoare triple {2066#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_~i~0#1 := 2 + main_~i~0#1; {2067#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:09:15,168 INFO L290 TraceCheckUtils]: 14: Hoare triple {2067#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2067#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:09:15,169 INFO L290 TraceCheckUtils]: 15: Hoare triple {2067#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {2067#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:09:15,169 INFO L290 TraceCheckUtils]: 16: Hoare triple {2067#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_~i~0#1 := 2 + main_~i~0#1; {2068#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:09:15,175 INFO L290 TraceCheckUtils]: 17: Hoare triple {2068#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2068#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:09:15,175 INFO L290 TraceCheckUtils]: 18: Hoare triple {2068#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {2068#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:09:15,176 INFO L290 TraceCheckUtils]: 19: Hoare triple {2068#(<= |ULTIMATE.start_main_~i~0#1| 10)} main_~i~0#1 := 2 + main_~i~0#1; {2069#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 14:09:15,176 INFO L290 TraceCheckUtils]: 20: Hoare triple {2069#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2069#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 14:09:15,176 INFO L290 TraceCheckUtils]: 21: Hoare triple {2069#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {2069#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 14:09:15,177 INFO L290 TraceCheckUtils]: 22: Hoare triple {2069#(<= |ULTIMATE.start_main_~i~0#1| 12)} main_~i~0#1 := 2 + main_~i~0#1; {2070#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 14:09:15,177 INFO L290 TraceCheckUtils]: 23: Hoare triple {2070#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2070#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 14:09:15,177 INFO L290 TraceCheckUtils]: 24: Hoare triple {2070#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {2070#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 14:09:15,178 INFO L290 TraceCheckUtils]: 25: Hoare triple {2070#(<= |ULTIMATE.start_main_~i~0#1| 14)} main_~i~0#1 := 2 + main_~i~0#1; {2071#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 14:09:15,178 INFO L290 TraceCheckUtils]: 26: Hoare triple {2071#(<= |ULTIMATE.start_main_~i~0#1| 16)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2071#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 14:09:15,179 INFO L290 TraceCheckUtils]: 27: Hoare triple {2071#(<= |ULTIMATE.start_main_~i~0#1| 16)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {2071#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 14:09:15,179 INFO L290 TraceCheckUtils]: 28: Hoare triple {2071#(<= |ULTIMATE.start_main_~i~0#1| 16)} main_~i~0#1 := 2 + main_~i~0#1; {2072#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 14:09:15,179 INFO L290 TraceCheckUtils]: 29: Hoare triple {2072#(<= |ULTIMATE.start_main_~i~0#1| 18)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2072#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 14:09:15,180 INFO L290 TraceCheckUtils]: 30: Hoare triple {2072#(<= |ULTIMATE.start_main_~i~0#1| 18)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {2072#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 14:09:15,180 INFO L290 TraceCheckUtils]: 31: Hoare triple {2072#(<= |ULTIMATE.start_main_~i~0#1| 18)} main_~i~0#1 := 2 + main_~i~0#1; {2073#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 14:09:15,180 INFO L290 TraceCheckUtils]: 32: Hoare triple {2073#(<= |ULTIMATE.start_main_~i~0#1| 20)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2073#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 14:09:15,181 INFO L290 TraceCheckUtils]: 33: Hoare triple {2073#(<= |ULTIMATE.start_main_~i~0#1| 20)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {2073#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 14:09:15,181 INFO L290 TraceCheckUtils]: 34: Hoare triple {2073#(<= |ULTIMATE.start_main_~i~0#1| 20)} main_~i~0#1 := 2 + main_~i~0#1; {2074#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-20 14:09:15,182 INFO L290 TraceCheckUtils]: 35: Hoare triple {2074#(<= |ULTIMATE.start_main_~i~0#1| 22)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2074#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-20 14:09:15,182 INFO L290 TraceCheckUtils]: 36: Hoare triple {2074#(<= |ULTIMATE.start_main_~i~0#1| 22)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {2074#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-20 14:09:15,182 INFO L290 TraceCheckUtils]: 37: Hoare triple {2074#(<= |ULTIMATE.start_main_~i~0#1| 22)} main_~i~0#1 := 2 + main_~i~0#1; {2075#(<= |ULTIMATE.start_main_~i~0#1| 24)} is VALID [2022-02-20 14:09:15,183 INFO L290 TraceCheckUtils]: 38: Hoare triple {2075#(<= |ULTIMATE.start_main_~i~0#1| 24)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2075#(<= |ULTIMATE.start_main_~i~0#1| 24)} is VALID [2022-02-20 14:09:15,191 INFO L290 TraceCheckUtils]: 39: Hoare triple {2075#(<= |ULTIMATE.start_main_~i~0#1| 24)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {2075#(<= |ULTIMATE.start_main_~i~0#1| 24)} is VALID [2022-02-20 14:09:15,192 INFO L290 TraceCheckUtils]: 40: Hoare triple {2075#(<= |ULTIMATE.start_main_~i~0#1| 24)} main_~i~0#1 := 2 + main_~i~0#1; {2076#(<= |ULTIMATE.start_main_~i~0#1| 26)} is VALID [2022-02-20 14:09:15,192 INFO L290 TraceCheckUtils]: 41: Hoare triple {2076#(<= |ULTIMATE.start_main_~i~0#1| 26)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2076#(<= |ULTIMATE.start_main_~i~0#1| 26)} is VALID [2022-02-20 14:09:15,193 INFO L290 TraceCheckUtils]: 42: Hoare triple {2076#(<= |ULTIMATE.start_main_~i~0#1| 26)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {2076#(<= |ULTIMATE.start_main_~i~0#1| 26)} is VALID [2022-02-20 14:09:15,193 INFO L290 TraceCheckUtils]: 43: Hoare triple {2076#(<= |ULTIMATE.start_main_~i~0#1| 26)} main_~i~0#1 := 2 + main_~i~0#1; {2077#(<= |ULTIMATE.start_main_~i~0#1| 28)} is VALID [2022-02-20 14:09:15,193 INFO L290 TraceCheckUtils]: 44: Hoare triple {2077#(<= |ULTIMATE.start_main_~i~0#1| 28)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2077#(<= |ULTIMATE.start_main_~i~0#1| 28)} is VALID [2022-02-20 14:09:15,194 INFO L290 TraceCheckUtils]: 45: Hoare triple {2077#(<= |ULTIMATE.start_main_~i~0#1| 28)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {2077#(<= |ULTIMATE.start_main_~i~0#1| 28)} is VALID [2022-02-20 14:09:15,194 INFO L290 TraceCheckUtils]: 46: Hoare triple {2077#(<= |ULTIMATE.start_main_~i~0#1| 28)} main_~i~0#1 := 2 + main_~i~0#1; {2078#(<= |ULTIMATE.start_main_~i~0#1| 30)} is VALID [2022-02-20 14:09:15,195 INFO L290 TraceCheckUtils]: 47: Hoare triple {2078#(<= |ULTIMATE.start_main_~i~0#1| 30)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2078#(<= |ULTIMATE.start_main_~i~0#1| 30)} is VALID [2022-02-20 14:09:15,195 INFO L290 TraceCheckUtils]: 48: Hoare triple {2078#(<= |ULTIMATE.start_main_~i~0#1| 30)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {2078#(<= |ULTIMATE.start_main_~i~0#1| 30)} is VALID [2022-02-20 14:09:15,195 INFO L290 TraceCheckUtils]: 49: Hoare triple {2078#(<= |ULTIMATE.start_main_~i~0#1| 30)} main_~i~0#1 := 2 + main_~i~0#1; {2079#(<= |ULTIMATE.start_main_~i~0#1| 32)} is VALID [2022-02-20 14:09:15,196 INFO L290 TraceCheckUtils]: 50: Hoare triple {2079#(<= |ULTIMATE.start_main_~i~0#1| 32)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2079#(<= |ULTIMATE.start_main_~i~0#1| 32)} is VALID [2022-02-20 14:09:15,196 INFO L290 TraceCheckUtils]: 51: Hoare triple {2079#(<= |ULTIMATE.start_main_~i~0#1| 32)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {2079#(<= |ULTIMATE.start_main_~i~0#1| 32)} is VALID [2022-02-20 14:09:15,196 INFO L290 TraceCheckUtils]: 52: Hoare triple {2079#(<= |ULTIMATE.start_main_~i~0#1| 32)} main_~i~0#1 := 2 + main_~i~0#1; {2080#(<= |ULTIMATE.start_main_~i~0#1| 34)} is VALID [2022-02-20 14:09:15,197 INFO L290 TraceCheckUtils]: 53: Hoare triple {2080#(<= |ULTIMATE.start_main_~i~0#1| 34)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2080#(<= |ULTIMATE.start_main_~i~0#1| 34)} is VALID [2022-02-20 14:09:15,197 INFO L290 TraceCheckUtils]: 54: Hoare triple {2080#(<= |ULTIMATE.start_main_~i~0#1| 34)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {2080#(<= |ULTIMATE.start_main_~i~0#1| 34)} is VALID [2022-02-20 14:09:15,198 INFO L290 TraceCheckUtils]: 55: Hoare triple {2080#(<= |ULTIMATE.start_main_~i~0#1| 34)} main_~i~0#1 := 2 + main_~i~0#1; {2081#(<= |ULTIMATE.start_main_~i~0#1| 36)} is VALID [2022-02-20 14:09:15,199 INFO L290 TraceCheckUtils]: 56: Hoare triple {2081#(<= |ULTIMATE.start_main_~i~0#1| 36)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2081#(<= |ULTIMATE.start_main_~i~0#1| 36)} is VALID [2022-02-20 14:09:15,199 INFO L290 TraceCheckUtils]: 57: Hoare triple {2081#(<= |ULTIMATE.start_main_~i~0#1| 36)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {2081#(<= |ULTIMATE.start_main_~i~0#1| 36)} is VALID [2022-02-20 14:09:15,199 INFO L290 TraceCheckUtils]: 58: Hoare triple {2081#(<= |ULTIMATE.start_main_~i~0#1| 36)} main_~i~0#1 := 2 + main_~i~0#1; {2082#(<= |ULTIMATE.start_main_~i~0#1| 38)} is VALID [2022-02-20 14:09:15,200 INFO L290 TraceCheckUtils]: 59: Hoare triple {2082#(<= |ULTIMATE.start_main_~i~0#1| 38)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2082#(<= |ULTIMATE.start_main_~i~0#1| 38)} is VALID [2022-02-20 14:09:15,200 INFO L290 TraceCheckUtils]: 60: Hoare triple {2082#(<= |ULTIMATE.start_main_~i~0#1| 38)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {2082#(<= |ULTIMATE.start_main_~i~0#1| 38)} is VALID [2022-02-20 14:09:15,200 INFO L290 TraceCheckUtils]: 61: Hoare triple {2082#(<= |ULTIMATE.start_main_~i~0#1| 38)} main_~i~0#1 := 2 + main_~i~0#1; {2083#(<= |ULTIMATE.start_main_~i~0#1| 40)} is VALID [2022-02-20 14:09:15,200 INFO L290 TraceCheckUtils]: 62: Hoare triple {2083#(<= |ULTIMATE.start_main_~i~0#1| 40)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2083#(<= |ULTIMATE.start_main_~i~0#1| 40)} is VALID [2022-02-20 14:09:15,201 INFO L290 TraceCheckUtils]: 63: Hoare triple {2083#(<= |ULTIMATE.start_main_~i~0#1| 40)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {2083#(<= |ULTIMATE.start_main_~i~0#1| 40)} is VALID [2022-02-20 14:09:15,201 INFO L290 TraceCheckUtils]: 64: Hoare triple {2083#(<= |ULTIMATE.start_main_~i~0#1| 40)} main_~i~0#1 := 2 + main_~i~0#1; {2084#(<= |ULTIMATE.start_main_~i~0#1| 42)} is VALID [2022-02-20 14:09:15,201 INFO L290 TraceCheckUtils]: 65: Hoare triple {2084#(<= |ULTIMATE.start_main_~i~0#1| 42)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2084#(<= |ULTIMATE.start_main_~i~0#1| 42)} is VALID [2022-02-20 14:09:15,202 INFO L290 TraceCheckUtils]: 66: Hoare triple {2084#(<= |ULTIMATE.start_main_~i~0#1| 42)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {2084#(<= |ULTIMATE.start_main_~i~0#1| 42)} is VALID [2022-02-20 14:09:15,202 INFO L290 TraceCheckUtils]: 67: Hoare triple {2084#(<= |ULTIMATE.start_main_~i~0#1| 42)} main_~i~0#1 := 2 + main_~i~0#1; {2085#(<= |ULTIMATE.start_main_~i~0#1| 44)} is VALID [2022-02-20 14:09:15,202 INFO L290 TraceCheckUtils]: 68: Hoare triple {2085#(<= |ULTIMATE.start_main_~i~0#1| 44)} assume !(main_~i~0#1 < 100000); {2062#false} is VALID [2022-02-20 14:09:15,203 INFO L290 TraceCheckUtils]: 69: Hoare triple {2062#false} main_~i~0#1 := 0; {2062#false} is VALID [2022-02-20 14:09:15,203 INFO L290 TraceCheckUtils]: 70: Hoare triple {2062#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2062#false} is VALID [2022-02-20 14:09:15,203 INFO L290 TraceCheckUtils]: 71: Hoare triple {2062#false} assume 10 == main_#t~mem3#1;havoc main_#t~mem3#1;call main_#t~mem4#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 20 == main_#t~mem4#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2062#false} is VALID [2022-02-20 14:09:15,203 INFO L290 TraceCheckUtils]: 72: Hoare triple {2062#false} assume 0 == __VERIFIER_assert_~cond#1; {2062#false} is VALID [2022-02-20 14:09:15,203 INFO L290 TraceCheckUtils]: 73: Hoare triple {2062#false} assume !false; {2062#false} is VALID [2022-02-20 14:09:15,204 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:09:15,204 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:09:15,204 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138377418] [2022-02-20 14:09:15,204 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138377418] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:09:15,204 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1623545919] [2022-02-20 14:09:15,204 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-20 14:09:15,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:09:15,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:09:15,215 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 14:09:15,218 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 14:09:15,337 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-20 14:09:15,337 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:09:15,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 24 conjunts are in the unsatisfiable core [2022-02-20 14:09:15,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:09:15,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:09:15,722 INFO L290 TraceCheckUtils]: 0: Hoare triple {2061#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(18, 2); {2061#true} is VALID [2022-02-20 14:09:15,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {2061#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {2092#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:15,723 INFO L290 TraceCheckUtils]: 2: Hoare triple {2092#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2092#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:15,724 INFO L290 TraceCheckUtils]: 3: Hoare triple {2092#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {2092#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:15,724 INFO L290 TraceCheckUtils]: 4: Hoare triple {2092#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_~i~0#1 := 2 + main_~i~0#1; {2064#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:09:15,724 INFO L290 TraceCheckUtils]: 5: Hoare triple {2064#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2064#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:09:15,725 INFO L290 TraceCheckUtils]: 6: Hoare triple {2064#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {2064#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:09:15,726 INFO L290 TraceCheckUtils]: 7: Hoare triple {2064#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_~i~0#1 := 2 + main_~i~0#1; {2065#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:09:15,726 INFO L290 TraceCheckUtils]: 8: Hoare triple {2065#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2065#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:09:15,727 INFO L290 TraceCheckUtils]: 9: Hoare triple {2065#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {2065#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:09:15,727 INFO L290 TraceCheckUtils]: 10: Hoare triple {2065#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_~i~0#1 := 2 + main_~i~0#1; {2066#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:09:15,727 INFO L290 TraceCheckUtils]: 11: Hoare triple {2066#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2066#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:09:15,728 INFO L290 TraceCheckUtils]: 12: Hoare triple {2066#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {2066#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:09:15,728 INFO L290 TraceCheckUtils]: 13: Hoare triple {2066#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_~i~0#1 := 2 + main_~i~0#1; {2067#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:09:15,728 INFO L290 TraceCheckUtils]: 14: Hoare triple {2067#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2067#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:09:15,729 INFO L290 TraceCheckUtils]: 15: Hoare triple {2067#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {2067#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:09:15,729 INFO L290 TraceCheckUtils]: 16: Hoare triple {2067#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_~i~0#1 := 2 + main_~i~0#1; {2068#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:09:15,729 INFO L290 TraceCheckUtils]: 17: Hoare triple {2068#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2068#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:09:15,729 INFO L290 TraceCheckUtils]: 18: Hoare triple {2068#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {2068#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:09:15,730 INFO L290 TraceCheckUtils]: 19: Hoare triple {2068#(<= |ULTIMATE.start_main_~i~0#1| 10)} main_~i~0#1 := 2 + main_~i~0#1; {2069#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 14:09:15,730 INFO L290 TraceCheckUtils]: 20: Hoare triple {2069#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2069#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 14:09:15,730 INFO L290 TraceCheckUtils]: 21: Hoare triple {2069#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {2069#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 14:09:15,731 INFO L290 TraceCheckUtils]: 22: Hoare triple {2069#(<= |ULTIMATE.start_main_~i~0#1| 12)} main_~i~0#1 := 2 + main_~i~0#1; {2070#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 14:09:15,731 INFO L290 TraceCheckUtils]: 23: Hoare triple {2070#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2070#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 14:09:15,731 INFO L290 TraceCheckUtils]: 24: Hoare triple {2070#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {2070#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 14:09:15,732 INFO L290 TraceCheckUtils]: 25: Hoare triple {2070#(<= |ULTIMATE.start_main_~i~0#1| 14)} main_~i~0#1 := 2 + main_~i~0#1; {2071#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 14:09:15,732 INFO L290 TraceCheckUtils]: 26: Hoare triple {2071#(<= |ULTIMATE.start_main_~i~0#1| 16)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2071#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 14:09:15,732 INFO L290 TraceCheckUtils]: 27: Hoare triple {2071#(<= |ULTIMATE.start_main_~i~0#1| 16)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {2071#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 14:09:15,733 INFO L290 TraceCheckUtils]: 28: Hoare triple {2071#(<= |ULTIMATE.start_main_~i~0#1| 16)} main_~i~0#1 := 2 + main_~i~0#1; {2072#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 14:09:15,733 INFO L290 TraceCheckUtils]: 29: Hoare triple {2072#(<= |ULTIMATE.start_main_~i~0#1| 18)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2072#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 14:09:15,733 INFO L290 TraceCheckUtils]: 30: Hoare triple {2072#(<= |ULTIMATE.start_main_~i~0#1| 18)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {2072#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 14:09:15,734 INFO L290 TraceCheckUtils]: 31: Hoare triple {2072#(<= |ULTIMATE.start_main_~i~0#1| 18)} main_~i~0#1 := 2 + main_~i~0#1; {2073#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 14:09:15,734 INFO L290 TraceCheckUtils]: 32: Hoare triple {2073#(<= |ULTIMATE.start_main_~i~0#1| 20)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2073#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 14:09:15,734 INFO L290 TraceCheckUtils]: 33: Hoare triple {2073#(<= |ULTIMATE.start_main_~i~0#1| 20)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {2073#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 14:09:15,735 INFO L290 TraceCheckUtils]: 34: Hoare triple {2073#(<= |ULTIMATE.start_main_~i~0#1| 20)} main_~i~0#1 := 2 + main_~i~0#1; {2074#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-20 14:09:15,735 INFO L290 TraceCheckUtils]: 35: Hoare triple {2074#(<= |ULTIMATE.start_main_~i~0#1| 22)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2074#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-20 14:09:15,735 INFO L290 TraceCheckUtils]: 36: Hoare triple {2074#(<= |ULTIMATE.start_main_~i~0#1| 22)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {2074#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-20 14:09:15,735 INFO L290 TraceCheckUtils]: 37: Hoare triple {2074#(<= |ULTIMATE.start_main_~i~0#1| 22)} main_~i~0#1 := 2 + main_~i~0#1; {2075#(<= |ULTIMATE.start_main_~i~0#1| 24)} is VALID [2022-02-20 14:09:15,736 INFO L290 TraceCheckUtils]: 38: Hoare triple {2075#(<= |ULTIMATE.start_main_~i~0#1| 24)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2075#(<= |ULTIMATE.start_main_~i~0#1| 24)} is VALID [2022-02-20 14:09:15,736 INFO L290 TraceCheckUtils]: 39: Hoare triple {2075#(<= |ULTIMATE.start_main_~i~0#1| 24)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {2075#(<= |ULTIMATE.start_main_~i~0#1| 24)} is VALID [2022-02-20 14:09:15,736 INFO L290 TraceCheckUtils]: 40: Hoare triple {2075#(<= |ULTIMATE.start_main_~i~0#1| 24)} main_~i~0#1 := 2 + main_~i~0#1; {2076#(<= |ULTIMATE.start_main_~i~0#1| 26)} is VALID [2022-02-20 14:09:15,737 INFO L290 TraceCheckUtils]: 41: Hoare triple {2076#(<= |ULTIMATE.start_main_~i~0#1| 26)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2076#(<= |ULTIMATE.start_main_~i~0#1| 26)} is VALID [2022-02-20 14:09:15,737 INFO L290 TraceCheckUtils]: 42: Hoare triple {2076#(<= |ULTIMATE.start_main_~i~0#1| 26)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {2076#(<= |ULTIMATE.start_main_~i~0#1| 26)} is VALID [2022-02-20 14:09:15,737 INFO L290 TraceCheckUtils]: 43: Hoare triple {2076#(<= |ULTIMATE.start_main_~i~0#1| 26)} main_~i~0#1 := 2 + main_~i~0#1; {2077#(<= |ULTIMATE.start_main_~i~0#1| 28)} is VALID [2022-02-20 14:09:15,738 INFO L290 TraceCheckUtils]: 44: Hoare triple {2077#(<= |ULTIMATE.start_main_~i~0#1| 28)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2077#(<= |ULTIMATE.start_main_~i~0#1| 28)} is VALID [2022-02-20 14:09:15,738 INFO L290 TraceCheckUtils]: 45: Hoare triple {2077#(<= |ULTIMATE.start_main_~i~0#1| 28)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {2077#(<= |ULTIMATE.start_main_~i~0#1| 28)} is VALID [2022-02-20 14:09:15,738 INFO L290 TraceCheckUtils]: 46: Hoare triple {2077#(<= |ULTIMATE.start_main_~i~0#1| 28)} main_~i~0#1 := 2 + main_~i~0#1; {2078#(<= |ULTIMATE.start_main_~i~0#1| 30)} is VALID [2022-02-20 14:09:15,739 INFO L290 TraceCheckUtils]: 47: Hoare triple {2078#(<= |ULTIMATE.start_main_~i~0#1| 30)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2078#(<= |ULTIMATE.start_main_~i~0#1| 30)} is VALID [2022-02-20 14:09:15,739 INFO L290 TraceCheckUtils]: 48: Hoare triple {2078#(<= |ULTIMATE.start_main_~i~0#1| 30)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {2078#(<= |ULTIMATE.start_main_~i~0#1| 30)} is VALID [2022-02-20 14:09:15,739 INFO L290 TraceCheckUtils]: 49: Hoare triple {2078#(<= |ULTIMATE.start_main_~i~0#1| 30)} main_~i~0#1 := 2 + main_~i~0#1; {2079#(<= |ULTIMATE.start_main_~i~0#1| 32)} is VALID [2022-02-20 14:09:15,740 INFO L290 TraceCheckUtils]: 50: Hoare triple {2079#(<= |ULTIMATE.start_main_~i~0#1| 32)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2079#(<= |ULTIMATE.start_main_~i~0#1| 32)} is VALID [2022-02-20 14:09:15,740 INFO L290 TraceCheckUtils]: 51: Hoare triple {2079#(<= |ULTIMATE.start_main_~i~0#1| 32)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {2079#(<= |ULTIMATE.start_main_~i~0#1| 32)} is VALID [2022-02-20 14:09:15,740 INFO L290 TraceCheckUtils]: 52: Hoare triple {2079#(<= |ULTIMATE.start_main_~i~0#1| 32)} main_~i~0#1 := 2 + main_~i~0#1; {2080#(<= |ULTIMATE.start_main_~i~0#1| 34)} is VALID [2022-02-20 14:09:15,741 INFO L290 TraceCheckUtils]: 53: Hoare triple {2080#(<= |ULTIMATE.start_main_~i~0#1| 34)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2080#(<= |ULTIMATE.start_main_~i~0#1| 34)} is VALID [2022-02-20 14:09:15,741 INFO L290 TraceCheckUtils]: 54: Hoare triple {2080#(<= |ULTIMATE.start_main_~i~0#1| 34)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {2080#(<= |ULTIMATE.start_main_~i~0#1| 34)} is VALID [2022-02-20 14:09:15,741 INFO L290 TraceCheckUtils]: 55: Hoare triple {2080#(<= |ULTIMATE.start_main_~i~0#1| 34)} main_~i~0#1 := 2 + main_~i~0#1; {2081#(<= |ULTIMATE.start_main_~i~0#1| 36)} is VALID [2022-02-20 14:09:15,742 INFO L290 TraceCheckUtils]: 56: Hoare triple {2081#(<= |ULTIMATE.start_main_~i~0#1| 36)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2081#(<= |ULTIMATE.start_main_~i~0#1| 36)} is VALID [2022-02-20 14:09:15,742 INFO L290 TraceCheckUtils]: 57: Hoare triple {2081#(<= |ULTIMATE.start_main_~i~0#1| 36)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {2081#(<= |ULTIMATE.start_main_~i~0#1| 36)} is VALID [2022-02-20 14:09:15,742 INFO L290 TraceCheckUtils]: 58: Hoare triple {2081#(<= |ULTIMATE.start_main_~i~0#1| 36)} main_~i~0#1 := 2 + main_~i~0#1; {2082#(<= |ULTIMATE.start_main_~i~0#1| 38)} is VALID [2022-02-20 14:09:15,742 INFO L290 TraceCheckUtils]: 59: Hoare triple {2082#(<= |ULTIMATE.start_main_~i~0#1| 38)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2082#(<= |ULTIMATE.start_main_~i~0#1| 38)} is VALID [2022-02-20 14:09:15,743 INFO L290 TraceCheckUtils]: 60: Hoare triple {2082#(<= |ULTIMATE.start_main_~i~0#1| 38)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {2082#(<= |ULTIMATE.start_main_~i~0#1| 38)} is VALID [2022-02-20 14:09:15,743 INFO L290 TraceCheckUtils]: 61: Hoare triple {2082#(<= |ULTIMATE.start_main_~i~0#1| 38)} main_~i~0#1 := 2 + main_~i~0#1; {2083#(<= |ULTIMATE.start_main_~i~0#1| 40)} is VALID [2022-02-20 14:09:15,743 INFO L290 TraceCheckUtils]: 62: Hoare triple {2083#(<= |ULTIMATE.start_main_~i~0#1| 40)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2083#(<= |ULTIMATE.start_main_~i~0#1| 40)} is VALID [2022-02-20 14:09:15,744 INFO L290 TraceCheckUtils]: 63: Hoare triple {2083#(<= |ULTIMATE.start_main_~i~0#1| 40)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {2083#(<= |ULTIMATE.start_main_~i~0#1| 40)} is VALID [2022-02-20 14:09:15,744 INFO L290 TraceCheckUtils]: 64: Hoare triple {2083#(<= |ULTIMATE.start_main_~i~0#1| 40)} main_~i~0#1 := 2 + main_~i~0#1; {2084#(<= |ULTIMATE.start_main_~i~0#1| 42)} is VALID [2022-02-20 14:09:15,744 INFO L290 TraceCheckUtils]: 65: Hoare triple {2084#(<= |ULTIMATE.start_main_~i~0#1| 42)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2084#(<= |ULTIMATE.start_main_~i~0#1| 42)} is VALID [2022-02-20 14:09:15,745 INFO L290 TraceCheckUtils]: 66: Hoare triple {2084#(<= |ULTIMATE.start_main_~i~0#1| 42)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {2084#(<= |ULTIMATE.start_main_~i~0#1| 42)} is VALID [2022-02-20 14:09:15,745 INFO L290 TraceCheckUtils]: 67: Hoare triple {2084#(<= |ULTIMATE.start_main_~i~0#1| 42)} main_~i~0#1 := 2 + main_~i~0#1; {2085#(<= |ULTIMATE.start_main_~i~0#1| 44)} is VALID [2022-02-20 14:09:15,745 INFO L290 TraceCheckUtils]: 68: Hoare triple {2085#(<= |ULTIMATE.start_main_~i~0#1| 44)} assume !(main_~i~0#1 < 100000); {2062#false} is VALID [2022-02-20 14:09:15,746 INFO L290 TraceCheckUtils]: 69: Hoare triple {2062#false} main_~i~0#1 := 0; {2062#false} is VALID [2022-02-20 14:09:15,746 INFO L290 TraceCheckUtils]: 70: Hoare triple {2062#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2062#false} is VALID [2022-02-20 14:09:15,746 INFO L290 TraceCheckUtils]: 71: Hoare triple {2062#false} assume 10 == main_#t~mem3#1;havoc main_#t~mem3#1;call main_#t~mem4#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 20 == main_#t~mem4#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2062#false} is VALID [2022-02-20 14:09:15,746 INFO L290 TraceCheckUtils]: 72: Hoare triple {2062#false} assume 0 == __VERIFIER_assert_~cond#1; {2062#false} is VALID [2022-02-20 14:09:15,746 INFO L290 TraceCheckUtils]: 73: Hoare triple {2062#false} assume !false; {2062#false} is VALID [2022-02-20 14:09:15,747 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:09:15,747 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:09:16,697 INFO L290 TraceCheckUtils]: 73: Hoare triple {2062#false} assume !false; {2062#false} is VALID [2022-02-20 14:09:16,697 INFO L290 TraceCheckUtils]: 72: Hoare triple {2062#false} assume 0 == __VERIFIER_assert_~cond#1; {2062#false} is VALID [2022-02-20 14:09:16,697 INFO L290 TraceCheckUtils]: 71: Hoare triple {2062#false} assume 10 == main_#t~mem3#1;havoc main_#t~mem3#1;call main_#t~mem4#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 20 == main_#t~mem4#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2062#false} is VALID [2022-02-20 14:09:16,697 INFO L290 TraceCheckUtils]: 70: Hoare triple {2062#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2062#false} is VALID [2022-02-20 14:09:16,697 INFO L290 TraceCheckUtils]: 69: Hoare triple {2062#false} main_~i~0#1 := 0; {2062#false} is VALID [2022-02-20 14:09:16,702 INFO L290 TraceCheckUtils]: 68: Hoare triple {2324#(< |ULTIMATE.start_main_~i~0#1| 100000)} assume !(main_~i~0#1 < 100000); {2062#false} is VALID [2022-02-20 14:09:16,703 INFO L290 TraceCheckUtils]: 67: Hoare triple {2328#(< |ULTIMATE.start_main_~i~0#1| 99998)} main_~i~0#1 := 2 + main_~i~0#1; {2324#(< |ULTIMATE.start_main_~i~0#1| 100000)} is VALID [2022-02-20 14:09:16,703 INFO L290 TraceCheckUtils]: 66: Hoare triple {2328#(< |ULTIMATE.start_main_~i~0#1| 99998)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {2328#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:09:16,703 INFO L290 TraceCheckUtils]: 65: Hoare triple {2328#(< |ULTIMATE.start_main_~i~0#1| 99998)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2328#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:09:16,704 INFO L290 TraceCheckUtils]: 64: Hoare triple {2338#(< |ULTIMATE.start_main_~i~0#1| 99996)} main_~i~0#1 := 2 + main_~i~0#1; {2328#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:09:16,704 INFO L290 TraceCheckUtils]: 63: Hoare triple {2338#(< |ULTIMATE.start_main_~i~0#1| 99996)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {2338#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-20 14:09:16,705 INFO L290 TraceCheckUtils]: 62: Hoare triple {2338#(< |ULTIMATE.start_main_~i~0#1| 99996)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2338#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-20 14:09:16,705 INFO L290 TraceCheckUtils]: 61: Hoare triple {2348#(< |ULTIMATE.start_main_~i~0#1| 99994)} main_~i~0#1 := 2 + main_~i~0#1; {2338#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-20 14:09:16,706 INFO L290 TraceCheckUtils]: 60: Hoare triple {2348#(< |ULTIMATE.start_main_~i~0#1| 99994)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {2348#(< |ULTIMATE.start_main_~i~0#1| 99994)} is VALID [2022-02-20 14:09:16,706 INFO L290 TraceCheckUtils]: 59: Hoare triple {2348#(< |ULTIMATE.start_main_~i~0#1| 99994)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2348#(< |ULTIMATE.start_main_~i~0#1| 99994)} is VALID [2022-02-20 14:09:16,707 INFO L290 TraceCheckUtils]: 58: Hoare triple {2358#(< |ULTIMATE.start_main_~i~0#1| 99992)} main_~i~0#1 := 2 + main_~i~0#1; {2348#(< |ULTIMATE.start_main_~i~0#1| 99994)} is VALID [2022-02-20 14:09:16,707 INFO L290 TraceCheckUtils]: 57: Hoare triple {2358#(< |ULTIMATE.start_main_~i~0#1| 99992)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {2358#(< |ULTIMATE.start_main_~i~0#1| 99992)} is VALID [2022-02-20 14:09:16,707 INFO L290 TraceCheckUtils]: 56: Hoare triple {2358#(< |ULTIMATE.start_main_~i~0#1| 99992)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2358#(< |ULTIMATE.start_main_~i~0#1| 99992)} is VALID [2022-02-20 14:09:16,708 INFO L290 TraceCheckUtils]: 55: Hoare triple {2368#(< |ULTIMATE.start_main_~i~0#1| 99990)} main_~i~0#1 := 2 + main_~i~0#1; {2358#(< |ULTIMATE.start_main_~i~0#1| 99992)} is VALID [2022-02-20 14:09:16,708 INFO L290 TraceCheckUtils]: 54: Hoare triple {2368#(< |ULTIMATE.start_main_~i~0#1| 99990)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {2368#(< |ULTIMATE.start_main_~i~0#1| 99990)} is VALID [2022-02-20 14:09:16,708 INFO L290 TraceCheckUtils]: 53: Hoare triple {2368#(< |ULTIMATE.start_main_~i~0#1| 99990)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2368#(< |ULTIMATE.start_main_~i~0#1| 99990)} is VALID [2022-02-20 14:09:16,709 INFO L290 TraceCheckUtils]: 52: Hoare triple {2378#(< |ULTIMATE.start_main_~i~0#1| 99988)} main_~i~0#1 := 2 + main_~i~0#1; {2368#(< |ULTIMATE.start_main_~i~0#1| 99990)} is VALID [2022-02-20 14:09:16,709 INFO L290 TraceCheckUtils]: 51: Hoare triple {2378#(< |ULTIMATE.start_main_~i~0#1| 99988)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {2378#(< |ULTIMATE.start_main_~i~0#1| 99988)} is VALID [2022-02-20 14:09:16,709 INFO L290 TraceCheckUtils]: 50: Hoare triple {2378#(< |ULTIMATE.start_main_~i~0#1| 99988)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2378#(< |ULTIMATE.start_main_~i~0#1| 99988)} is VALID [2022-02-20 14:09:16,710 INFO L290 TraceCheckUtils]: 49: Hoare triple {2388#(< |ULTIMATE.start_main_~i~0#1| 99986)} main_~i~0#1 := 2 + main_~i~0#1; {2378#(< |ULTIMATE.start_main_~i~0#1| 99988)} is VALID [2022-02-20 14:09:16,710 INFO L290 TraceCheckUtils]: 48: Hoare triple {2388#(< |ULTIMATE.start_main_~i~0#1| 99986)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {2388#(< |ULTIMATE.start_main_~i~0#1| 99986)} is VALID [2022-02-20 14:09:16,710 INFO L290 TraceCheckUtils]: 47: Hoare triple {2388#(< |ULTIMATE.start_main_~i~0#1| 99986)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2388#(< |ULTIMATE.start_main_~i~0#1| 99986)} is VALID [2022-02-20 14:09:16,711 INFO L290 TraceCheckUtils]: 46: Hoare triple {2398#(< |ULTIMATE.start_main_~i~0#1| 99984)} main_~i~0#1 := 2 + main_~i~0#1; {2388#(< |ULTIMATE.start_main_~i~0#1| 99986)} is VALID [2022-02-20 14:09:16,711 INFO L290 TraceCheckUtils]: 45: Hoare triple {2398#(< |ULTIMATE.start_main_~i~0#1| 99984)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {2398#(< |ULTIMATE.start_main_~i~0#1| 99984)} is VALID [2022-02-20 14:09:16,711 INFO L290 TraceCheckUtils]: 44: Hoare triple {2398#(< |ULTIMATE.start_main_~i~0#1| 99984)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2398#(< |ULTIMATE.start_main_~i~0#1| 99984)} is VALID [2022-02-20 14:09:16,712 INFO L290 TraceCheckUtils]: 43: Hoare triple {2408#(< |ULTIMATE.start_main_~i~0#1| 99982)} main_~i~0#1 := 2 + main_~i~0#1; {2398#(< |ULTIMATE.start_main_~i~0#1| 99984)} is VALID [2022-02-20 14:09:16,712 INFO L290 TraceCheckUtils]: 42: Hoare triple {2408#(< |ULTIMATE.start_main_~i~0#1| 99982)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {2408#(< |ULTIMATE.start_main_~i~0#1| 99982)} is VALID [2022-02-20 14:09:16,712 INFO L290 TraceCheckUtils]: 41: Hoare triple {2408#(< |ULTIMATE.start_main_~i~0#1| 99982)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2408#(< |ULTIMATE.start_main_~i~0#1| 99982)} is VALID [2022-02-20 14:09:16,713 INFO L290 TraceCheckUtils]: 40: Hoare triple {2418#(< |ULTIMATE.start_main_~i~0#1| 99980)} main_~i~0#1 := 2 + main_~i~0#1; {2408#(< |ULTIMATE.start_main_~i~0#1| 99982)} is VALID [2022-02-20 14:09:16,713 INFO L290 TraceCheckUtils]: 39: Hoare triple {2418#(< |ULTIMATE.start_main_~i~0#1| 99980)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {2418#(< |ULTIMATE.start_main_~i~0#1| 99980)} is VALID [2022-02-20 14:09:16,713 INFO L290 TraceCheckUtils]: 38: Hoare triple {2418#(< |ULTIMATE.start_main_~i~0#1| 99980)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2418#(< |ULTIMATE.start_main_~i~0#1| 99980)} is VALID [2022-02-20 14:09:16,714 INFO L290 TraceCheckUtils]: 37: Hoare triple {2428#(< |ULTIMATE.start_main_~i~0#1| 99978)} main_~i~0#1 := 2 + main_~i~0#1; {2418#(< |ULTIMATE.start_main_~i~0#1| 99980)} is VALID [2022-02-20 14:09:16,714 INFO L290 TraceCheckUtils]: 36: Hoare triple {2428#(< |ULTIMATE.start_main_~i~0#1| 99978)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {2428#(< |ULTIMATE.start_main_~i~0#1| 99978)} is VALID [2022-02-20 14:09:16,714 INFO L290 TraceCheckUtils]: 35: Hoare triple {2428#(< |ULTIMATE.start_main_~i~0#1| 99978)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2428#(< |ULTIMATE.start_main_~i~0#1| 99978)} is VALID [2022-02-20 14:09:16,715 INFO L290 TraceCheckUtils]: 34: Hoare triple {2438#(< |ULTIMATE.start_main_~i~0#1| 99976)} main_~i~0#1 := 2 + main_~i~0#1; {2428#(< |ULTIMATE.start_main_~i~0#1| 99978)} is VALID [2022-02-20 14:09:16,715 INFO L290 TraceCheckUtils]: 33: Hoare triple {2438#(< |ULTIMATE.start_main_~i~0#1| 99976)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {2438#(< |ULTIMATE.start_main_~i~0#1| 99976)} is VALID [2022-02-20 14:09:16,715 INFO L290 TraceCheckUtils]: 32: Hoare triple {2438#(< |ULTIMATE.start_main_~i~0#1| 99976)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2438#(< |ULTIMATE.start_main_~i~0#1| 99976)} is VALID [2022-02-20 14:09:16,716 INFO L290 TraceCheckUtils]: 31: Hoare triple {2448#(< |ULTIMATE.start_main_~i~0#1| 99974)} main_~i~0#1 := 2 + main_~i~0#1; {2438#(< |ULTIMATE.start_main_~i~0#1| 99976)} is VALID [2022-02-20 14:09:16,716 INFO L290 TraceCheckUtils]: 30: Hoare triple {2448#(< |ULTIMATE.start_main_~i~0#1| 99974)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {2448#(< |ULTIMATE.start_main_~i~0#1| 99974)} is VALID [2022-02-20 14:09:16,716 INFO L290 TraceCheckUtils]: 29: Hoare triple {2448#(< |ULTIMATE.start_main_~i~0#1| 99974)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2448#(< |ULTIMATE.start_main_~i~0#1| 99974)} is VALID [2022-02-20 14:09:16,717 INFO L290 TraceCheckUtils]: 28: Hoare triple {2458#(< |ULTIMATE.start_main_~i~0#1| 99972)} main_~i~0#1 := 2 + main_~i~0#1; {2448#(< |ULTIMATE.start_main_~i~0#1| 99974)} is VALID [2022-02-20 14:09:16,717 INFO L290 TraceCheckUtils]: 27: Hoare triple {2458#(< |ULTIMATE.start_main_~i~0#1| 99972)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {2458#(< |ULTIMATE.start_main_~i~0#1| 99972)} is VALID [2022-02-20 14:09:16,717 INFO L290 TraceCheckUtils]: 26: Hoare triple {2458#(< |ULTIMATE.start_main_~i~0#1| 99972)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2458#(< |ULTIMATE.start_main_~i~0#1| 99972)} is VALID [2022-02-20 14:09:16,718 INFO L290 TraceCheckUtils]: 25: Hoare triple {2468#(< |ULTIMATE.start_main_~i~0#1| 99970)} main_~i~0#1 := 2 + main_~i~0#1; {2458#(< |ULTIMATE.start_main_~i~0#1| 99972)} is VALID [2022-02-20 14:09:16,718 INFO L290 TraceCheckUtils]: 24: Hoare triple {2468#(< |ULTIMATE.start_main_~i~0#1| 99970)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {2468#(< |ULTIMATE.start_main_~i~0#1| 99970)} is VALID [2022-02-20 14:09:16,718 INFO L290 TraceCheckUtils]: 23: Hoare triple {2468#(< |ULTIMATE.start_main_~i~0#1| 99970)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2468#(< |ULTIMATE.start_main_~i~0#1| 99970)} is VALID [2022-02-20 14:09:16,719 INFO L290 TraceCheckUtils]: 22: Hoare triple {2478#(< |ULTIMATE.start_main_~i~0#1| 99968)} main_~i~0#1 := 2 + main_~i~0#1; {2468#(< |ULTIMATE.start_main_~i~0#1| 99970)} is VALID [2022-02-20 14:09:16,719 INFO L290 TraceCheckUtils]: 21: Hoare triple {2478#(< |ULTIMATE.start_main_~i~0#1| 99968)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {2478#(< |ULTIMATE.start_main_~i~0#1| 99968)} is VALID [2022-02-20 14:09:16,719 INFO L290 TraceCheckUtils]: 20: Hoare triple {2478#(< |ULTIMATE.start_main_~i~0#1| 99968)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2478#(< |ULTIMATE.start_main_~i~0#1| 99968)} is VALID [2022-02-20 14:09:16,720 INFO L290 TraceCheckUtils]: 19: Hoare triple {2488#(< |ULTIMATE.start_main_~i~0#1| 99966)} main_~i~0#1 := 2 + main_~i~0#1; {2478#(< |ULTIMATE.start_main_~i~0#1| 99968)} is VALID [2022-02-20 14:09:16,720 INFO L290 TraceCheckUtils]: 18: Hoare triple {2488#(< |ULTIMATE.start_main_~i~0#1| 99966)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {2488#(< |ULTIMATE.start_main_~i~0#1| 99966)} is VALID [2022-02-20 14:09:16,720 INFO L290 TraceCheckUtils]: 17: Hoare triple {2488#(< |ULTIMATE.start_main_~i~0#1| 99966)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2488#(< |ULTIMATE.start_main_~i~0#1| 99966)} is VALID [2022-02-20 14:09:16,721 INFO L290 TraceCheckUtils]: 16: Hoare triple {2498#(< |ULTIMATE.start_main_~i~0#1| 99964)} main_~i~0#1 := 2 + main_~i~0#1; {2488#(< |ULTIMATE.start_main_~i~0#1| 99966)} is VALID [2022-02-20 14:09:16,721 INFO L290 TraceCheckUtils]: 15: Hoare triple {2498#(< |ULTIMATE.start_main_~i~0#1| 99964)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {2498#(< |ULTIMATE.start_main_~i~0#1| 99964)} is VALID [2022-02-20 14:09:16,721 INFO L290 TraceCheckUtils]: 14: Hoare triple {2498#(< |ULTIMATE.start_main_~i~0#1| 99964)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2498#(< |ULTIMATE.start_main_~i~0#1| 99964)} is VALID [2022-02-20 14:09:16,722 INFO L290 TraceCheckUtils]: 13: Hoare triple {2508#(< |ULTIMATE.start_main_~i~0#1| 99962)} main_~i~0#1 := 2 + main_~i~0#1; {2498#(< |ULTIMATE.start_main_~i~0#1| 99964)} is VALID [2022-02-20 14:09:16,722 INFO L290 TraceCheckUtils]: 12: Hoare triple {2508#(< |ULTIMATE.start_main_~i~0#1| 99962)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {2508#(< |ULTIMATE.start_main_~i~0#1| 99962)} is VALID [2022-02-20 14:09:16,723 INFO L290 TraceCheckUtils]: 11: Hoare triple {2508#(< |ULTIMATE.start_main_~i~0#1| 99962)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2508#(< |ULTIMATE.start_main_~i~0#1| 99962)} is VALID [2022-02-20 14:09:16,723 INFO L290 TraceCheckUtils]: 10: Hoare triple {2518#(< |ULTIMATE.start_main_~i~0#1| 99960)} main_~i~0#1 := 2 + main_~i~0#1; {2508#(< |ULTIMATE.start_main_~i~0#1| 99962)} is VALID [2022-02-20 14:09:16,723 INFO L290 TraceCheckUtils]: 9: Hoare triple {2518#(< |ULTIMATE.start_main_~i~0#1| 99960)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {2518#(< |ULTIMATE.start_main_~i~0#1| 99960)} is VALID [2022-02-20 14:09:16,724 INFO L290 TraceCheckUtils]: 8: Hoare triple {2518#(< |ULTIMATE.start_main_~i~0#1| 99960)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2518#(< |ULTIMATE.start_main_~i~0#1| 99960)} is VALID [2022-02-20 14:09:16,725 INFO L290 TraceCheckUtils]: 7: Hoare triple {2528#(< |ULTIMATE.start_main_~i~0#1| 99958)} main_~i~0#1 := 2 + main_~i~0#1; {2518#(< |ULTIMATE.start_main_~i~0#1| 99960)} is VALID [2022-02-20 14:09:16,725 INFO L290 TraceCheckUtils]: 6: Hoare triple {2528#(< |ULTIMATE.start_main_~i~0#1| 99958)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {2528#(< |ULTIMATE.start_main_~i~0#1| 99958)} is VALID [2022-02-20 14:09:16,726 INFO L290 TraceCheckUtils]: 5: Hoare triple {2528#(< |ULTIMATE.start_main_~i~0#1| 99958)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2528#(< |ULTIMATE.start_main_~i~0#1| 99958)} is VALID [2022-02-20 14:09:16,726 INFO L290 TraceCheckUtils]: 4: Hoare triple {2538#(< |ULTIMATE.start_main_~i~0#1| 99956)} main_~i~0#1 := 2 + main_~i~0#1; {2528#(< |ULTIMATE.start_main_~i~0#1| 99958)} is VALID [2022-02-20 14:09:16,726 INFO L290 TraceCheckUtils]: 3: Hoare triple {2538#(< |ULTIMATE.start_main_~i~0#1| 99956)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {2538#(< |ULTIMATE.start_main_~i~0#1| 99956)} is VALID [2022-02-20 14:09:16,727 INFO L290 TraceCheckUtils]: 2: Hoare triple {2538#(< |ULTIMATE.start_main_~i~0#1| 99956)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2538#(< |ULTIMATE.start_main_~i~0#1| 99956)} is VALID [2022-02-20 14:09:16,727 INFO L290 TraceCheckUtils]: 1: Hoare triple {2061#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {2538#(< |ULTIMATE.start_main_~i~0#1| 99956)} is VALID [2022-02-20 14:09:16,727 INFO L290 TraceCheckUtils]: 0: Hoare triple {2061#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(18, 2); {2061#true} is VALID [2022-02-20 14:09:16,728 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:09:16,728 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1623545919] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:09:16,728 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:09:16,728 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2022-02-20 14:09:16,729 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444987193] [2022-02-20 14:09:16,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:09:16,730 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.979591836734694) internal successors, (146), 49 states have internal predecessors, (146), 0 states have call successors, (0), 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 74 [2022-02-20 14:09:16,730 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:09:16,730 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 49 states, 49 states have (on average 2.979591836734694) internal successors, (146), 49 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:16,823 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:09:16,823 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-02-20 14:09:16,823 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:09:16,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-02-20 14:09:16,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2022-02-20 14:09:16,825 INFO L87 Difference]: Start difference. First operand 77 states and 101 transitions. Second operand has 49 states, 49 states have (on average 2.979591836734694) internal successors, (146), 49 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:18,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:09:18,269 INFO L93 Difference]: Finished difference Result 473 states and 591 transitions. [2022-02-20 14:09:18,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-02-20 14:09:18,270 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.979591836734694) internal successors, (146), 49 states have internal predecessors, (146), 0 states have call successors, (0), 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 74 [2022-02-20 14:09:18,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:09:18,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 2.979591836734694) internal successors, (146), 49 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:18,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 591 transitions. [2022-02-20 14:09:18,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 2.979591836734694) internal successors, (146), 49 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:18,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 591 transitions. [2022-02-20 14:09:18,279 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 591 transitions. [2022-02-20 14:09:18,632 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 591 edges. 591 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:09:18,642 INFO L225 Difference]: With dead ends: 473 [2022-02-20 14:09:18,642 INFO L226 Difference]: Without dead ends: 465 [2022-02-20 14:09:18,643 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2022-02-20 14:09:18,643 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 1930 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 257 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1930 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 257 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 14:09:18,644 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1930 Valid, 287 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 14:09:18,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2022-02-20 14:09:18,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 149. [2022-02-20 14:09:18,675 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:09:18,675 INFO L82 GeneralOperation]: Start isEquivalent. First operand 465 states. Second operand has 149 states, 148 states have (on average 1.3310810810810811) internal successors, (197), 148 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:18,676 INFO L74 IsIncluded]: Start isIncluded. First operand 465 states. Second operand has 149 states, 148 states have (on average 1.3310810810810811) internal successors, (197), 148 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:18,676 INFO L87 Difference]: Start difference. First operand 465 states. Second operand has 149 states, 148 states have (on average 1.3310810810810811) internal successors, (197), 148 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:18,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:09:18,687 INFO L93 Difference]: Finished difference Result 465 states and 558 transitions. [2022-02-20 14:09:18,687 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 558 transitions. [2022-02-20 14:09:18,687 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:09:18,687 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:09:18,688 INFO L74 IsIncluded]: Start isIncluded. First operand has 149 states, 148 states have (on average 1.3310810810810811) internal successors, (197), 148 states have internal predecessors, (197), 0 states have call successors, (0), 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 465 states. [2022-02-20 14:09:18,688 INFO L87 Difference]: Start difference. First operand has 149 states, 148 states have (on average 1.3310810810810811) internal successors, (197), 148 states have internal predecessors, (197), 0 states have call successors, (0), 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 465 states. [2022-02-20 14:09:18,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:09:18,699 INFO L93 Difference]: Finished difference Result 465 states and 558 transitions. [2022-02-20 14:09:18,699 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 558 transitions. [2022-02-20 14:09:18,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:09:18,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:09:18,700 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:09:18,700 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:09:18,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 148 states have (on average 1.3310810810810811) internal successors, (197), 148 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:18,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 197 transitions. [2022-02-20 14:09:18,703 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 197 transitions. Word has length 74 [2022-02-20 14:09:18,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:09:18,704 INFO L470 AbstractCegarLoop]: Abstraction has 149 states and 197 transitions. [2022-02-20 14:09:18,705 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 2.979591836734694) internal successors, (146), 49 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:18,705 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 197 transitions. [2022-02-20 14:09:18,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-02-20 14:09:18,708 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:09:18,708 INFO L514 BasicCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:09:18,728 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 14:09:18,923 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:09:18,923 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:09:18,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:09:18,924 INFO L85 PathProgramCache]: Analyzing trace with hash 413261909, now seen corresponding path program 5 times [2022-02-20 14:09:18,924 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:09:18,924 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577706871] [2022-02-20 14:09:18,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:09:18,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:09:19,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:09:19,938 INFO L290 TraceCheckUtils]: 0: Hoare triple {4245#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(18, 2); {4245#true} is VALID [2022-02-20 14:09:19,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {4245#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {4247#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:19,939 INFO L290 TraceCheckUtils]: 2: Hoare triple {4247#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4247#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:19,941 INFO L290 TraceCheckUtils]: 3: Hoare triple {4247#(= |ULTIMATE.start_main_~i~0#1| 0)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {4247#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:19,941 INFO L290 TraceCheckUtils]: 4: Hoare triple {4247#(= |ULTIMATE.start_main_~i~0#1| 0)} main_~i~0#1 := 2 + main_~i~0#1; {4248#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:09:19,941 INFO L290 TraceCheckUtils]: 5: Hoare triple {4248#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4248#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:09:19,942 INFO L290 TraceCheckUtils]: 6: Hoare triple {4248#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {4248#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:09:19,942 INFO L290 TraceCheckUtils]: 7: Hoare triple {4248#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_~i~0#1 := 2 + main_~i~0#1; {4249#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:09:19,942 INFO L290 TraceCheckUtils]: 8: Hoare triple {4249#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4249#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:09:19,943 INFO L290 TraceCheckUtils]: 9: Hoare triple {4249#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {4249#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:09:19,943 INFO L290 TraceCheckUtils]: 10: Hoare triple {4249#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_~i~0#1 := 2 + main_~i~0#1; {4250#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:09:19,943 INFO L290 TraceCheckUtils]: 11: Hoare triple {4250#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4250#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:09:19,944 INFO L290 TraceCheckUtils]: 12: Hoare triple {4250#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {4250#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:09:19,944 INFO L290 TraceCheckUtils]: 13: Hoare triple {4250#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_~i~0#1 := 2 + main_~i~0#1; {4251#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:09:19,947 INFO L290 TraceCheckUtils]: 14: Hoare triple {4251#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4251#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:09:19,948 INFO L290 TraceCheckUtils]: 15: Hoare triple {4251#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {4251#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:09:19,948 INFO L290 TraceCheckUtils]: 16: Hoare triple {4251#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_~i~0#1 := 2 + main_~i~0#1; {4252#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:09:19,949 INFO L290 TraceCheckUtils]: 17: Hoare triple {4252#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4252#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:09:19,949 INFO L290 TraceCheckUtils]: 18: Hoare triple {4252#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {4252#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:09:19,949 INFO L290 TraceCheckUtils]: 19: Hoare triple {4252#(<= |ULTIMATE.start_main_~i~0#1| 10)} main_~i~0#1 := 2 + main_~i~0#1; {4253#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 14:09:19,950 INFO L290 TraceCheckUtils]: 20: Hoare triple {4253#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4253#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 14:09:19,950 INFO L290 TraceCheckUtils]: 21: Hoare triple {4253#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {4253#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 14:09:19,951 INFO L290 TraceCheckUtils]: 22: Hoare triple {4253#(<= |ULTIMATE.start_main_~i~0#1| 12)} main_~i~0#1 := 2 + main_~i~0#1; {4254#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 14:09:19,951 INFO L290 TraceCheckUtils]: 23: Hoare triple {4254#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4254#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 14:09:19,951 INFO L290 TraceCheckUtils]: 24: Hoare triple {4254#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {4254#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 14:09:19,952 INFO L290 TraceCheckUtils]: 25: Hoare triple {4254#(<= |ULTIMATE.start_main_~i~0#1| 14)} main_~i~0#1 := 2 + main_~i~0#1; {4255#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 14:09:19,952 INFO L290 TraceCheckUtils]: 26: Hoare triple {4255#(<= |ULTIMATE.start_main_~i~0#1| 16)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4255#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 14:09:19,952 INFO L290 TraceCheckUtils]: 27: Hoare triple {4255#(<= |ULTIMATE.start_main_~i~0#1| 16)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {4255#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 14:09:19,953 INFO L290 TraceCheckUtils]: 28: Hoare triple {4255#(<= |ULTIMATE.start_main_~i~0#1| 16)} main_~i~0#1 := 2 + main_~i~0#1; {4256#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 14:09:19,953 INFO L290 TraceCheckUtils]: 29: Hoare triple {4256#(<= |ULTIMATE.start_main_~i~0#1| 18)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4256#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 14:09:19,953 INFO L290 TraceCheckUtils]: 30: Hoare triple {4256#(<= |ULTIMATE.start_main_~i~0#1| 18)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {4256#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 14:09:19,954 INFO L290 TraceCheckUtils]: 31: Hoare triple {4256#(<= |ULTIMATE.start_main_~i~0#1| 18)} main_~i~0#1 := 2 + main_~i~0#1; {4257#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 14:09:19,954 INFO L290 TraceCheckUtils]: 32: Hoare triple {4257#(<= |ULTIMATE.start_main_~i~0#1| 20)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4257#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 14:09:19,954 INFO L290 TraceCheckUtils]: 33: Hoare triple {4257#(<= |ULTIMATE.start_main_~i~0#1| 20)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {4257#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 14:09:19,954 INFO L290 TraceCheckUtils]: 34: Hoare triple {4257#(<= |ULTIMATE.start_main_~i~0#1| 20)} main_~i~0#1 := 2 + main_~i~0#1; {4258#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-20 14:09:19,955 INFO L290 TraceCheckUtils]: 35: Hoare triple {4258#(<= |ULTIMATE.start_main_~i~0#1| 22)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4258#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-20 14:09:19,955 INFO L290 TraceCheckUtils]: 36: Hoare triple {4258#(<= |ULTIMATE.start_main_~i~0#1| 22)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {4258#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-20 14:09:19,955 INFO L290 TraceCheckUtils]: 37: Hoare triple {4258#(<= |ULTIMATE.start_main_~i~0#1| 22)} main_~i~0#1 := 2 + main_~i~0#1; {4259#(<= |ULTIMATE.start_main_~i~0#1| 24)} is VALID [2022-02-20 14:09:19,956 INFO L290 TraceCheckUtils]: 38: Hoare triple {4259#(<= |ULTIMATE.start_main_~i~0#1| 24)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4259#(<= |ULTIMATE.start_main_~i~0#1| 24)} is VALID [2022-02-20 14:09:19,956 INFO L290 TraceCheckUtils]: 39: Hoare triple {4259#(<= |ULTIMATE.start_main_~i~0#1| 24)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {4259#(<= |ULTIMATE.start_main_~i~0#1| 24)} is VALID [2022-02-20 14:09:19,956 INFO L290 TraceCheckUtils]: 40: Hoare triple {4259#(<= |ULTIMATE.start_main_~i~0#1| 24)} main_~i~0#1 := 2 + main_~i~0#1; {4260#(<= |ULTIMATE.start_main_~i~0#1| 26)} is VALID [2022-02-20 14:09:19,957 INFO L290 TraceCheckUtils]: 41: Hoare triple {4260#(<= |ULTIMATE.start_main_~i~0#1| 26)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4260#(<= |ULTIMATE.start_main_~i~0#1| 26)} is VALID [2022-02-20 14:09:19,957 INFO L290 TraceCheckUtils]: 42: Hoare triple {4260#(<= |ULTIMATE.start_main_~i~0#1| 26)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {4260#(<= |ULTIMATE.start_main_~i~0#1| 26)} is VALID [2022-02-20 14:09:19,957 INFO L290 TraceCheckUtils]: 43: Hoare triple {4260#(<= |ULTIMATE.start_main_~i~0#1| 26)} main_~i~0#1 := 2 + main_~i~0#1; {4261#(<= |ULTIMATE.start_main_~i~0#1| 28)} is VALID [2022-02-20 14:09:19,957 INFO L290 TraceCheckUtils]: 44: Hoare triple {4261#(<= |ULTIMATE.start_main_~i~0#1| 28)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4261#(<= |ULTIMATE.start_main_~i~0#1| 28)} is VALID [2022-02-20 14:09:19,958 INFO L290 TraceCheckUtils]: 45: Hoare triple {4261#(<= |ULTIMATE.start_main_~i~0#1| 28)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {4261#(<= |ULTIMATE.start_main_~i~0#1| 28)} is VALID [2022-02-20 14:09:19,958 INFO L290 TraceCheckUtils]: 46: Hoare triple {4261#(<= |ULTIMATE.start_main_~i~0#1| 28)} main_~i~0#1 := 2 + main_~i~0#1; {4262#(<= |ULTIMATE.start_main_~i~0#1| 30)} is VALID [2022-02-20 14:09:19,958 INFO L290 TraceCheckUtils]: 47: Hoare triple {4262#(<= |ULTIMATE.start_main_~i~0#1| 30)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4262#(<= |ULTIMATE.start_main_~i~0#1| 30)} is VALID [2022-02-20 14:09:19,959 INFO L290 TraceCheckUtils]: 48: Hoare triple {4262#(<= |ULTIMATE.start_main_~i~0#1| 30)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {4262#(<= |ULTIMATE.start_main_~i~0#1| 30)} is VALID [2022-02-20 14:09:19,959 INFO L290 TraceCheckUtils]: 49: Hoare triple {4262#(<= |ULTIMATE.start_main_~i~0#1| 30)} main_~i~0#1 := 2 + main_~i~0#1; {4263#(<= |ULTIMATE.start_main_~i~0#1| 32)} is VALID [2022-02-20 14:09:19,959 INFO L290 TraceCheckUtils]: 50: Hoare triple {4263#(<= |ULTIMATE.start_main_~i~0#1| 32)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4263#(<= |ULTIMATE.start_main_~i~0#1| 32)} is VALID [2022-02-20 14:09:19,959 INFO L290 TraceCheckUtils]: 51: Hoare triple {4263#(<= |ULTIMATE.start_main_~i~0#1| 32)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {4263#(<= |ULTIMATE.start_main_~i~0#1| 32)} is VALID [2022-02-20 14:09:19,960 INFO L290 TraceCheckUtils]: 52: Hoare triple {4263#(<= |ULTIMATE.start_main_~i~0#1| 32)} main_~i~0#1 := 2 + main_~i~0#1; {4264#(<= |ULTIMATE.start_main_~i~0#1| 34)} is VALID [2022-02-20 14:09:19,960 INFO L290 TraceCheckUtils]: 53: Hoare triple {4264#(<= |ULTIMATE.start_main_~i~0#1| 34)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4264#(<= |ULTIMATE.start_main_~i~0#1| 34)} is VALID [2022-02-20 14:09:19,960 INFO L290 TraceCheckUtils]: 54: Hoare triple {4264#(<= |ULTIMATE.start_main_~i~0#1| 34)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {4264#(<= |ULTIMATE.start_main_~i~0#1| 34)} is VALID [2022-02-20 14:09:19,961 INFO L290 TraceCheckUtils]: 55: Hoare triple {4264#(<= |ULTIMATE.start_main_~i~0#1| 34)} main_~i~0#1 := 2 + main_~i~0#1; {4265#(<= |ULTIMATE.start_main_~i~0#1| 36)} is VALID [2022-02-20 14:09:19,963 INFO L290 TraceCheckUtils]: 56: Hoare triple {4265#(<= |ULTIMATE.start_main_~i~0#1| 36)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4265#(<= |ULTIMATE.start_main_~i~0#1| 36)} is VALID [2022-02-20 14:09:19,964 INFO L290 TraceCheckUtils]: 57: Hoare triple {4265#(<= |ULTIMATE.start_main_~i~0#1| 36)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {4265#(<= |ULTIMATE.start_main_~i~0#1| 36)} is VALID [2022-02-20 14:09:19,964 INFO L290 TraceCheckUtils]: 58: Hoare triple {4265#(<= |ULTIMATE.start_main_~i~0#1| 36)} main_~i~0#1 := 2 + main_~i~0#1; {4266#(<= |ULTIMATE.start_main_~i~0#1| 38)} is VALID [2022-02-20 14:09:19,964 INFO L290 TraceCheckUtils]: 59: Hoare triple {4266#(<= |ULTIMATE.start_main_~i~0#1| 38)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4266#(<= |ULTIMATE.start_main_~i~0#1| 38)} is VALID [2022-02-20 14:09:19,965 INFO L290 TraceCheckUtils]: 60: Hoare triple {4266#(<= |ULTIMATE.start_main_~i~0#1| 38)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {4266#(<= |ULTIMATE.start_main_~i~0#1| 38)} is VALID [2022-02-20 14:09:19,965 INFO L290 TraceCheckUtils]: 61: Hoare triple {4266#(<= |ULTIMATE.start_main_~i~0#1| 38)} main_~i~0#1 := 2 + main_~i~0#1; {4267#(<= |ULTIMATE.start_main_~i~0#1| 40)} is VALID [2022-02-20 14:09:19,965 INFO L290 TraceCheckUtils]: 62: Hoare triple {4267#(<= |ULTIMATE.start_main_~i~0#1| 40)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4267#(<= |ULTIMATE.start_main_~i~0#1| 40)} is VALID [2022-02-20 14:09:19,965 INFO L290 TraceCheckUtils]: 63: Hoare triple {4267#(<= |ULTIMATE.start_main_~i~0#1| 40)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {4267#(<= |ULTIMATE.start_main_~i~0#1| 40)} is VALID [2022-02-20 14:09:19,966 INFO L290 TraceCheckUtils]: 64: Hoare triple {4267#(<= |ULTIMATE.start_main_~i~0#1| 40)} main_~i~0#1 := 2 + main_~i~0#1; {4268#(<= |ULTIMATE.start_main_~i~0#1| 42)} is VALID [2022-02-20 14:09:19,966 INFO L290 TraceCheckUtils]: 65: Hoare triple {4268#(<= |ULTIMATE.start_main_~i~0#1| 42)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4268#(<= |ULTIMATE.start_main_~i~0#1| 42)} is VALID [2022-02-20 14:09:19,966 INFO L290 TraceCheckUtils]: 66: Hoare triple {4268#(<= |ULTIMATE.start_main_~i~0#1| 42)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {4268#(<= |ULTIMATE.start_main_~i~0#1| 42)} is VALID [2022-02-20 14:09:19,970 INFO L290 TraceCheckUtils]: 67: Hoare triple {4268#(<= |ULTIMATE.start_main_~i~0#1| 42)} main_~i~0#1 := 2 + main_~i~0#1; {4269#(<= |ULTIMATE.start_main_~i~0#1| 44)} is VALID [2022-02-20 14:09:19,970 INFO L290 TraceCheckUtils]: 68: Hoare triple {4269#(<= |ULTIMATE.start_main_~i~0#1| 44)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4269#(<= |ULTIMATE.start_main_~i~0#1| 44)} is VALID [2022-02-20 14:09:19,971 INFO L290 TraceCheckUtils]: 69: Hoare triple {4269#(<= |ULTIMATE.start_main_~i~0#1| 44)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {4269#(<= |ULTIMATE.start_main_~i~0#1| 44)} is VALID [2022-02-20 14:09:19,971 INFO L290 TraceCheckUtils]: 70: Hoare triple {4269#(<= |ULTIMATE.start_main_~i~0#1| 44)} main_~i~0#1 := 2 + main_~i~0#1; {4270#(<= |ULTIMATE.start_main_~i~0#1| 46)} is VALID [2022-02-20 14:09:19,971 INFO L290 TraceCheckUtils]: 71: Hoare triple {4270#(<= |ULTIMATE.start_main_~i~0#1| 46)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4270#(<= |ULTIMATE.start_main_~i~0#1| 46)} is VALID [2022-02-20 14:09:19,971 INFO L290 TraceCheckUtils]: 72: Hoare triple {4270#(<= |ULTIMATE.start_main_~i~0#1| 46)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {4270#(<= |ULTIMATE.start_main_~i~0#1| 46)} is VALID [2022-02-20 14:09:19,972 INFO L290 TraceCheckUtils]: 73: Hoare triple {4270#(<= |ULTIMATE.start_main_~i~0#1| 46)} main_~i~0#1 := 2 + main_~i~0#1; {4271#(<= |ULTIMATE.start_main_~i~0#1| 48)} is VALID [2022-02-20 14:09:19,972 INFO L290 TraceCheckUtils]: 74: Hoare triple {4271#(<= |ULTIMATE.start_main_~i~0#1| 48)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4271#(<= |ULTIMATE.start_main_~i~0#1| 48)} is VALID [2022-02-20 14:09:19,972 INFO L290 TraceCheckUtils]: 75: Hoare triple {4271#(<= |ULTIMATE.start_main_~i~0#1| 48)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {4271#(<= |ULTIMATE.start_main_~i~0#1| 48)} is VALID [2022-02-20 14:09:19,973 INFO L290 TraceCheckUtils]: 76: Hoare triple {4271#(<= |ULTIMATE.start_main_~i~0#1| 48)} main_~i~0#1 := 2 + main_~i~0#1; {4272#(<= |ULTIMATE.start_main_~i~0#1| 50)} is VALID [2022-02-20 14:09:19,973 INFO L290 TraceCheckUtils]: 77: Hoare triple {4272#(<= |ULTIMATE.start_main_~i~0#1| 50)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4272#(<= |ULTIMATE.start_main_~i~0#1| 50)} is VALID [2022-02-20 14:09:19,973 INFO L290 TraceCheckUtils]: 78: Hoare triple {4272#(<= |ULTIMATE.start_main_~i~0#1| 50)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {4272#(<= |ULTIMATE.start_main_~i~0#1| 50)} is VALID [2022-02-20 14:09:19,973 INFO L290 TraceCheckUtils]: 79: Hoare triple {4272#(<= |ULTIMATE.start_main_~i~0#1| 50)} main_~i~0#1 := 2 + main_~i~0#1; {4273#(<= |ULTIMATE.start_main_~i~0#1| 52)} is VALID [2022-02-20 14:09:19,974 INFO L290 TraceCheckUtils]: 80: Hoare triple {4273#(<= |ULTIMATE.start_main_~i~0#1| 52)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4273#(<= |ULTIMATE.start_main_~i~0#1| 52)} is VALID [2022-02-20 14:09:19,974 INFO L290 TraceCheckUtils]: 81: Hoare triple {4273#(<= |ULTIMATE.start_main_~i~0#1| 52)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {4273#(<= |ULTIMATE.start_main_~i~0#1| 52)} is VALID [2022-02-20 14:09:19,974 INFO L290 TraceCheckUtils]: 82: Hoare triple {4273#(<= |ULTIMATE.start_main_~i~0#1| 52)} main_~i~0#1 := 2 + main_~i~0#1; {4274#(<= |ULTIMATE.start_main_~i~0#1| 54)} is VALID [2022-02-20 14:09:19,975 INFO L290 TraceCheckUtils]: 83: Hoare triple {4274#(<= |ULTIMATE.start_main_~i~0#1| 54)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4274#(<= |ULTIMATE.start_main_~i~0#1| 54)} is VALID [2022-02-20 14:09:19,975 INFO L290 TraceCheckUtils]: 84: Hoare triple {4274#(<= |ULTIMATE.start_main_~i~0#1| 54)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {4274#(<= |ULTIMATE.start_main_~i~0#1| 54)} is VALID [2022-02-20 14:09:19,975 INFO L290 TraceCheckUtils]: 85: Hoare triple {4274#(<= |ULTIMATE.start_main_~i~0#1| 54)} main_~i~0#1 := 2 + main_~i~0#1; {4275#(<= |ULTIMATE.start_main_~i~0#1| 56)} is VALID [2022-02-20 14:09:19,975 INFO L290 TraceCheckUtils]: 86: Hoare triple {4275#(<= |ULTIMATE.start_main_~i~0#1| 56)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4275#(<= |ULTIMATE.start_main_~i~0#1| 56)} is VALID [2022-02-20 14:09:19,976 INFO L290 TraceCheckUtils]: 87: Hoare triple {4275#(<= |ULTIMATE.start_main_~i~0#1| 56)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {4275#(<= |ULTIMATE.start_main_~i~0#1| 56)} is VALID [2022-02-20 14:09:19,976 INFO L290 TraceCheckUtils]: 88: Hoare triple {4275#(<= |ULTIMATE.start_main_~i~0#1| 56)} main_~i~0#1 := 2 + main_~i~0#1; {4276#(<= |ULTIMATE.start_main_~i~0#1| 58)} is VALID [2022-02-20 14:09:19,976 INFO L290 TraceCheckUtils]: 89: Hoare triple {4276#(<= |ULTIMATE.start_main_~i~0#1| 58)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4276#(<= |ULTIMATE.start_main_~i~0#1| 58)} is VALID [2022-02-20 14:09:19,977 INFO L290 TraceCheckUtils]: 90: Hoare triple {4276#(<= |ULTIMATE.start_main_~i~0#1| 58)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {4276#(<= |ULTIMATE.start_main_~i~0#1| 58)} is VALID [2022-02-20 14:09:19,977 INFO L290 TraceCheckUtils]: 91: Hoare triple {4276#(<= |ULTIMATE.start_main_~i~0#1| 58)} main_~i~0#1 := 2 + main_~i~0#1; {4277#(<= |ULTIMATE.start_main_~i~0#1| 60)} is VALID [2022-02-20 14:09:19,977 INFO L290 TraceCheckUtils]: 92: Hoare triple {4277#(<= |ULTIMATE.start_main_~i~0#1| 60)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4277#(<= |ULTIMATE.start_main_~i~0#1| 60)} is VALID [2022-02-20 14:09:19,977 INFO L290 TraceCheckUtils]: 93: Hoare triple {4277#(<= |ULTIMATE.start_main_~i~0#1| 60)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {4277#(<= |ULTIMATE.start_main_~i~0#1| 60)} is VALID [2022-02-20 14:09:19,978 INFO L290 TraceCheckUtils]: 94: Hoare triple {4277#(<= |ULTIMATE.start_main_~i~0#1| 60)} main_~i~0#1 := 2 + main_~i~0#1; {4278#(<= |ULTIMATE.start_main_~i~0#1| 62)} is VALID [2022-02-20 14:09:19,978 INFO L290 TraceCheckUtils]: 95: Hoare triple {4278#(<= |ULTIMATE.start_main_~i~0#1| 62)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4278#(<= |ULTIMATE.start_main_~i~0#1| 62)} is VALID [2022-02-20 14:09:19,978 INFO L290 TraceCheckUtils]: 96: Hoare triple {4278#(<= |ULTIMATE.start_main_~i~0#1| 62)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {4278#(<= |ULTIMATE.start_main_~i~0#1| 62)} is VALID [2022-02-20 14:09:19,979 INFO L290 TraceCheckUtils]: 97: Hoare triple {4278#(<= |ULTIMATE.start_main_~i~0#1| 62)} main_~i~0#1 := 2 + main_~i~0#1; {4279#(<= |ULTIMATE.start_main_~i~0#1| 64)} is VALID [2022-02-20 14:09:19,979 INFO L290 TraceCheckUtils]: 98: Hoare triple {4279#(<= |ULTIMATE.start_main_~i~0#1| 64)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4279#(<= |ULTIMATE.start_main_~i~0#1| 64)} is VALID [2022-02-20 14:09:19,979 INFO L290 TraceCheckUtils]: 99: Hoare triple {4279#(<= |ULTIMATE.start_main_~i~0#1| 64)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {4279#(<= |ULTIMATE.start_main_~i~0#1| 64)} is VALID [2022-02-20 14:09:19,979 INFO L290 TraceCheckUtils]: 100: Hoare triple {4279#(<= |ULTIMATE.start_main_~i~0#1| 64)} main_~i~0#1 := 2 + main_~i~0#1; {4280#(<= |ULTIMATE.start_main_~i~0#1| 66)} is VALID [2022-02-20 14:09:19,980 INFO L290 TraceCheckUtils]: 101: Hoare triple {4280#(<= |ULTIMATE.start_main_~i~0#1| 66)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4280#(<= |ULTIMATE.start_main_~i~0#1| 66)} is VALID [2022-02-20 14:09:19,980 INFO L290 TraceCheckUtils]: 102: Hoare triple {4280#(<= |ULTIMATE.start_main_~i~0#1| 66)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {4280#(<= |ULTIMATE.start_main_~i~0#1| 66)} is VALID [2022-02-20 14:09:19,980 INFO L290 TraceCheckUtils]: 103: Hoare triple {4280#(<= |ULTIMATE.start_main_~i~0#1| 66)} main_~i~0#1 := 2 + main_~i~0#1; {4281#(<= |ULTIMATE.start_main_~i~0#1| 68)} is VALID [2022-02-20 14:09:19,981 INFO L290 TraceCheckUtils]: 104: Hoare triple {4281#(<= |ULTIMATE.start_main_~i~0#1| 68)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4281#(<= |ULTIMATE.start_main_~i~0#1| 68)} is VALID [2022-02-20 14:09:19,981 INFO L290 TraceCheckUtils]: 105: Hoare triple {4281#(<= |ULTIMATE.start_main_~i~0#1| 68)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {4281#(<= |ULTIMATE.start_main_~i~0#1| 68)} is VALID [2022-02-20 14:09:19,981 INFO L290 TraceCheckUtils]: 106: Hoare triple {4281#(<= |ULTIMATE.start_main_~i~0#1| 68)} main_~i~0#1 := 2 + main_~i~0#1; {4282#(<= |ULTIMATE.start_main_~i~0#1| 70)} is VALID [2022-02-20 14:09:19,981 INFO L290 TraceCheckUtils]: 107: Hoare triple {4282#(<= |ULTIMATE.start_main_~i~0#1| 70)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4282#(<= |ULTIMATE.start_main_~i~0#1| 70)} is VALID [2022-02-20 14:09:19,982 INFO L290 TraceCheckUtils]: 108: Hoare triple {4282#(<= |ULTIMATE.start_main_~i~0#1| 70)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {4282#(<= |ULTIMATE.start_main_~i~0#1| 70)} is VALID [2022-02-20 14:09:19,982 INFO L290 TraceCheckUtils]: 109: Hoare triple {4282#(<= |ULTIMATE.start_main_~i~0#1| 70)} main_~i~0#1 := 2 + main_~i~0#1; {4283#(<= |ULTIMATE.start_main_~i~0#1| 72)} is VALID [2022-02-20 14:09:19,982 INFO L290 TraceCheckUtils]: 110: Hoare triple {4283#(<= |ULTIMATE.start_main_~i~0#1| 72)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4283#(<= |ULTIMATE.start_main_~i~0#1| 72)} is VALID [2022-02-20 14:09:19,983 INFO L290 TraceCheckUtils]: 111: Hoare triple {4283#(<= |ULTIMATE.start_main_~i~0#1| 72)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {4283#(<= |ULTIMATE.start_main_~i~0#1| 72)} is VALID [2022-02-20 14:09:19,983 INFO L290 TraceCheckUtils]: 112: Hoare triple {4283#(<= |ULTIMATE.start_main_~i~0#1| 72)} main_~i~0#1 := 2 + main_~i~0#1; {4284#(<= |ULTIMATE.start_main_~i~0#1| 74)} is VALID [2022-02-20 14:09:19,983 INFO L290 TraceCheckUtils]: 113: Hoare triple {4284#(<= |ULTIMATE.start_main_~i~0#1| 74)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4284#(<= |ULTIMATE.start_main_~i~0#1| 74)} is VALID [2022-02-20 14:09:19,983 INFO L290 TraceCheckUtils]: 114: Hoare triple {4284#(<= |ULTIMATE.start_main_~i~0#1| 74)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {4284#(<= |ULTIMATE.start_main_~i~0#1| 74)} is VALID [2022-02-20 14:09:19,984 INFO L290 TraceCheckUtils]: 115: Hoare triple {4284#(<= |ULTIMATE.start_main_~i~0#1| 74)} main_~i~0#1 := 2 + main_~i~0#1; {4285#(<= |ULTIMATE.start_main_~i~0#1| 76)} is VALID [2022-02-20 14:09:19,984 INFO L290 TraceCheckUtils]: 116: Hoare triple {4285#(<= |ULTIMATE.start_main_~i~0#1| 76)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4285#(<= |ULTIMATE.start_main_~i~0#1| 76)} is VALID [2022-02-20 14:09:19,984 INFO L290 TraceCheckUtils]: 117: Hoare triple {4285#(<= |ULTIMATE.start_main_~i~0#1| 76)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {4285#(<= |ULTIMATE.start_main_~i~0#1| 76)} is VALID [2022-02-20 14:09:19,985 INFO L290 TraceCheckUtils]: 118: Hoare triple {4285#(<= |ULTIMATE.start_main_~i~0#1| 76)} main_~i~0#1 := 2 + main_~i~0#1; {4286#(<= |ULTIMATE.start_main_~i~0#1| 78)} is VALID [2022-02-20 14:09:19,985 INFO L290 TraceCheckUtils]: 119: Hoare triple {4286#(<= |ULTIMATE.start_main_~i~0#1| 78)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4286#(<= |ULTIMATE.start_main_~i~0#1| 78)} is VALID [2022-02-20 14:09:19,985 INFO L290 TraceCheckUtils]: 120: Hoare triple {4286#(<= |ULTIMATE.start_main_~i~0#1| 78)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {4286#(<= |ULTIMATE.start_main_~i~0#1| 78)} is VALID [2022-02-20 14:09:19,985 INFO L290 TraceCheckUtils]: 121: Hoare triple {4286#(<= |ULTIMATE.start_main_~i~0#1| 78)} main_~i~0#1 := 2 + main_~i~0#1; {4287#(<= |ULTIMATE.start_main_~i~0#1| 80)} is VALID [2022-02-20 14:09:19,986 INFO L290 TraceCheckUtils]: 122: Hoare triple {4287#(<= |ULTIMATE.start_main_~i~0#1| 80)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4287#(<= |ULTIMATE.start_main_~i~0#1| 80)} is VALID [2022-02-20 14:09:19,986 INFO L290 TraceCheckUtils]: 123: Hoare triple {4287#(<= |ULTIMATE.start_main_~i~0#1| 80)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {4287#(<= |ULTIMATE.start_main_~i~0#1| 80)} is VALID [2022-02-20 14:09:19,986 INFO L290 TraceCheckUtils]: 124: Hoare triple {4287#(<= |ULTIMATE.start_main_~i~0#1| 80)} main_~i~0#1 := 2 + main_~i~0#1; {4288#(<= |ULTIMATE.start_main_~i~0#1| 82)} is VALID [2022-02-20 14:09:19,987 INFO L290 TraceCheckUtils]: 125: Hoare triple {4288#(<= |ULTIMATE.start_main_~i~0#1| 82)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4288#(<= |ULTIMATE.start_main_~i~0#1| 82)} is VALID [2022-02-20 14:09:19,987 INFO L290 TraceCheckUtils]: 126: Hoare triple {4288#(<= |ULTIMATE.start_main_~i~0#1| 82)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {4288#(<= |ULTIMATE.start_main_~i~0#1| 82)} is VALID [2022-02-20 14:09:19,987 INFO L290 TraceCheckUtils]: 127: Hoare triple {4288#(<= |ULTIMATE.start_main_~i~0#1| 82)} main_~i~0#1 := 2 + main_~i~0#1; {4289#(<= |ULTIMATE.start_main_~i~0#1| 84)} is VALID [2022-02-20 14:09:19,987 INFO L290 TraceCheckUtils]: 128: Hoare triple {4289#(<= |ULTIMATE.start_main_~i~0#1| 84)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4289#(<= |ULTIMATE.start_main_~i~0#1| 84)} is VALID [2022-02-20 14:09:19,988 INFO L290 TraceCheckUtils]: 129: Hoare triple {4289#(<= |ULTIMATE.start_main_~i~0#1| 84)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {4289#(<= |ULTIMATE.start_main_~i~0#1| 84)} is VALID [2022-02-20 14:09:19,988 INFO L290 TraceCheckUtils]: 130: Hoare triple {4289#(<= |ULTIMATE.start_main_~i~0#1| 84)} main_~i~0#1 := 2 + main_~i~0#1; {4290#(<= |ULTIMATE.start_main_~i~0#1| 86)} is VALID [2022-02-20 14:09:19,988 INFO L290 TraceCheckUtils]: 131: Hoare triple {4290#(<= |ULTIMATE.start_main_~i~0#1| 86)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4290#(<= |ULTIMATE.start_main_~i~0#1| 86)} is VALID [2022-02-20 14:09:19,989 INFO L290 TraceCheckUtils]: 132: Hoare triple {4290#(<= |ULTIMATE.start_main_~i~0#1| 86)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {4290#(<= |ULTIMATE.start_main_~i~0#1| 86)} is VALID [2022-02-20 14:09:19,989 INFO L290 TraceCheckUtils]: 133: Hoare triple {4290#(<= |ULTIMATE.start_main_~i~0#1| 86)} main_~i~0#1 := 2 + main_~i~0#1; {4291#(<= |ULTIMATE.start_main_~i~0#1| 88)} is VALID [2022-02-20 14:09:19,989 INFO L290 TraceCheckUtils]: 134: Hoare triple {4291#(<= |ULTIMATE.start_main_~i~0#1| 88)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4291#(<= |ULTIMATE.start_main_~i~0#1| 88)} is VALID [2022-02-20 14:09:19,989 INFO L290 TraceCheckUtils]: 135: Hoare triple {4291#(<= |ULTIMATE.start_main_~i~0#1| 88)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {4291#(<= |ULTIMATE.start_main_~i~0#1| 88)} is VALID [2022-02-20 14:09:19,990 INFO L290 TraceCheckUtils]: 136: Hoare triple {4291#(<= |ULTIMATE.start_main_~i~0#1| 88)} main_~i~0#1 := 2 + main_~i~0#1; {4292#(<= |ULTIMATE.start_main_~i~0#1| 90)} is VALID [2022-02-20 14:09:19,990 INFO L290 TraceCheckUtils]: 137: Hoare triple {4292#(<= |ULTIMATE.start_main_~i~0#1| 90)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4292#(<= |ULTIMATE.start_main_~i~0#1| 90)} is VALID [2022-02-20 14:09:19,990 INFO L290 TraceCheckUtils]: 138: Hoare triple {4292#(<= |ULTIMATE.start_main_~i~0#1| 90)} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {4292#(<= |ULTIMATE.start_main_~i~0#1| 90)} is VALID [2022-02-20 14:09:19,991 INFO L290 TraceCheckUtils]: 139: Hoare triple {4292#(<= |ULTIMATE.start_main_~i~0#1| 90)} main_~i~0#1 := 2 + main_~i~0#1; {4293#(<= |ULTIMATE.start_main_~i~0#1| 92)} is VALID [2022-02-20 14:09:19,991 INFO L290 TraceCheckUtils]: 140: Hoare triple {4293#(<= |ULTIMATE.start_main_~i~0#1| 92)} assume !(main_~i~0#1 < 100000); {4246#false} is VALID [2022-02-20 14:09:19,991 INFO L290 TraceCheckUtils]: 141: Hoare triple {4246#false} main_~i~0#1 := 0; {4246#false} is VALID [2022-02-20 14:09:19,991 INFO L290 TraceCheckUtils]: 142: Hoare triple {4246#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4246#false} is VALID [2022-02-20 14:09:19,991 INFO L290 TraceCheckUtils]: 143: Hoare triple {4246#false} assume 10 == main_#t~mem3#1;havoc main_#t~mem3#1;call main_#t~mem4#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 20 == main_#t~mem4#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {4246#false} is VALID [2022-02-20 14:09:19,991 INFO L290 TraceCheckUtils]: 144: Hoare triple {4246#false} assume 0 == __VERIFIER_assert_~cond#1; {4246#false} is VALID [2022-02-20 14:09:19,991 INFO L290 TraceCheckUtils]: 145: Hoare triple {4246#false} assume !false; {4246#false} is VALID [2022-02-20 14:09:19,993 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:09:19,993 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:09:19,993 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577706871] [2022-02-20 14:09:19,993 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577706871] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:09:19,993 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1586052485] [2022-02-20 14:09:19,993 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-20 14:09:19,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:09:19,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:09:19,994 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 14:09:19,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process