./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-examples/standard_copy6_ground-2.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-examples/standard_copy6_ground-2.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 f9e86f2555d2c0682f4edf4cb7d0ea92e4bc79b6db041eb754ceacfe5541e219 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 14:02:54,658 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 14:02:54,662 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 14:02:54,707 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 14:02:54,707 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 14:02:54,711 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 14:02:54,712 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 14:02:54,714 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 14:02:54,716 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 14:02:54,718 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 14:02:54,719 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 14:02:54,721 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 14:02:54,721 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 14:02:54,726 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 14:02:54,728 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 14:02:54,729 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 14:02:54,732 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 14:02:54,733 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 14:02:54,734 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 14:02:54,737 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 14:02:54,741 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 14:02:54,742 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 14:02:54,743 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 14:02:54,743 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 14:02:54,745 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 14:02:54,745 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 14:02:54,745 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 14:02:54,746 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 14:02:54,746 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 14:02:54,747 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 14:02:54,747 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 14:02:54,748 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 14:02:54,749 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 14:02:54,749 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 14:02:54,750 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 14:02:54,750 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 14:02:54,751 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 14:02:54,751 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 14:02:54,751 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 14:02:54,752 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 14:02:54,752 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 14:02:54,754 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:02:54,786 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 14:02:54,787 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 14:02:54,787 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 14:02:54,788 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 14:02:54,789 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 14:02:54,789 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 14:02:54,789 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 14:02:54,789 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 14:02:54,790 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 14:02:54,790 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 14:02:54,791 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 14:02:54,791 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 14:02:54,791 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 14:02:54,791 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 14:02:54,791 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 14:02:54,791 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 14:02:54,792 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 14:02:54,792 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 14:02:54,792 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 14:02:54,792 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 14:02:54,792 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 14:02:54,792 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 14:02:54,793 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 14:02:54,793 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 14:02:54,793 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:02:54,793 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 14:02:54,793 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 14:02:54,793 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 14:02:54,793 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 14:02:54,794 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 14:02:54,794 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 14:02:54,794 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 14:02:54,794 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 14:02:54,794 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 -> f9e86f2555d2c0682f4edf4cb7d0ea92e4bc79b6db041eb754ceacfe5541e219 [2022-02-20 14:02:55,061 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 14:02:55,084 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 14:02:55,086 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 14:02:55,087 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 14:02:55,087 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 14:02:55,088 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-examples/standard_copy6_ground-2.i [2022-02-20 14:02:55,134 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29383e975/b212ddf089834fb89f8d84145693d17c/FLAGa3340896b [2022-02-20 14:02:56,595 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 14:02:56,596 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/standard_copy6_ground-2.i [2022-02-20 14:02:56,670 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29383e975/b212ddf089834fb89f8d84145693d17c/FLAGa3340896b [2022-02-20 14:02:57,007 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29383e975/b212ddf089834fb89f8d84145693d17c [2022-02-20 14:02:57,009 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 14:02:57,012 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 14:02:57,014 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 14:02:57,014 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 14:02:57,145 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 14:02:57,146 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:02:57" (1/1) ... [2022-02-20 14:02:57,147 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6daa40df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:02:57, skipping insertion in model container [2022-02-20 14:02:57,147 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:02:57" (1/1) ... [2022-02-20 14:02:58,137 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 14:02:58,374 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 14:02:58,867 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-examples/standard_copy6_ground-2.i[816,829] [2022-02-20 14:02:58,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:02:58,918 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 14:02:58,931 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-examples/standard_copy6_ground-2.i[816,829] [2022-02-20 14:02:58,945 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:02:58,976 INFO L208 MainTranslator]: Completed translation [2022-02-20 14:02:58,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:02:58 WrapperNode [2022-02-20 14:02:58,977 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 14:02:58,979 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 14:02:58,979 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 14:02:58,979 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 14:02:59,001 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:02:58" (1/1) ... [2022-02-20 14:02:59,017 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:02:58" (1/1) ... [2022-02-20 14:02:59,038 INFO L137 Inliner]: procedures = 16, calls = 43, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 144 [2022-02-20 14:02:59,038 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 14:02:59,039 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 14:02:59,039 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 14:02:59,039 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 14:02:59,045 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:02:58" (1/1) ... [2022-02-20 14:02:59,045 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:02:58" (1/1) ... [2022-02-20 14:02:59,047 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:02:58" (1/1) ... [2022-02-20 14:02:59,047 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:02:58" (1/1) ... [2022-02-20 14:02:59,053 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:02:58" (1/1) ... [2022-02-20 14:02:59,057 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:02:58" (1/1) ... [2022-02-20 14:02:59,058 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:02:58" (1/1) ... [2022-02-20 14:02:59,059 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 14:02:59,060 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 14:02:59,060 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 14:02:59,060 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 14:02:59,061 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:02:58" (1/1) ... [2022-02-20 14:02:59,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:02:59,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:02:59,086 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:02:59,120 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:02:59,130 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 14:02:59,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 14:02:59,131 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 14:02:59,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 14:02:59,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 14:02:59,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 14:02:59,131 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 14:02:59,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 14:02:59,181 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 14:02:59,182 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 14:02:59,578 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 14:02:59,583 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 14:02:59,583 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2022-02-20 14:02:59,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:02:59 BoogieIcfgContainer [2022-02-20 14:02:59,584 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 14:02:59,586 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 14:02:59,586 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 14:02:59,595 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 14:02:59,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 02:02:57" (1/3) ... [2022-02-20 14:02:59,596 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15162ae1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:02:59, skipping insertion in model container [2022-02-20 14:02:59,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:02:58" (2/3) ... [2022-02-20 14:02:59,599 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15162ae1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:02:59, skipping insertion in model container [2022-02-20 14:02:59,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:02:59" (3/3) ... [2022-02-20 14:02:59,601 INFO L111 eAbstractionObserver]: Analyzing ICFG standard_copy6_ground-2.i [2022-02-20 14:02:59,605 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 14:02:59,605 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 14:02:59,642 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 14:02:59,647 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:02:59,647 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 14:02:59,665 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 31 states have (on average 1.5806451612903225) internal successors, (49), 32 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:02:59,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 14:02:59,668 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:02:59,669 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:02:59,669 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:02:59,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:02:59,673 INFO L85 PathProgramCache]: Analyzing trace with hash -962610817, now seen corresponding path program 1 times [2022-02-20 14:02:59,679 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:02:59,680 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976573440] [2022-02-20 14:02:59,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:02:59,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:02:59,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:02:59,914 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#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(26, 2); {36#true} is VALID [2022-02-20 14:02:59,915 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_#t~mem4#1, main_#t~post3#1, main_#t~mem6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~post11#1, main_#t~mem14#1, main_#t~post13#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~post15#1, main_~#a1~0#1.base, main_~#a1~0#1.offset, main_~#a2~0#1.base, main_~#a2~0#1.offset, main_~#a3~0#1.base, main_~#a3~0#1.offset, main_~#a4~0#1.base, main_~#a4~0#1.offset, main_~#a5~0#1.base, main_~#a5~0#1.offset, main_~#a6~0#1.base, main_~#a6~0#1.offset, main_~#a7~0#1.base, main_~#a7~0#1.offset, main_~a~0#1, main_~i~0#1, main_~x~0#1;call main_~#a1~0#1.base, main_~#a1~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a2~0#1.base, main_~#a2~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a3~0#1.base, main_~#a3~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a4~0#1.base, main_~#a4~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a5~0#1.base, main_~#a5~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a6~0#1.base, main_~#a6~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a7~0#1.base, main_~#a7~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {38#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:02:59,915 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#(= |ULTIMATE.start_main_~a~0#1| 0)} assume !(main_~a~0#1 < 100000); {37#false} is VALID [2022-02-20 14:02:59,916 INFO L290 TraceCheckUtils]: 3: Hoare triple {37#false} havoc main_~i~0#1;main_~i~0#1 := 0; {37#false} is VALID [2022-02-20 14:02:59,916 INFO L290 TraceCheckUtils]: 4: Hoare triple {37#false} assume !(main_~i~0#1 < 100000); {37#false} is VALID [2022-02-20 14:02:59,916 INFO L290 TraceCheckUtils]: 5: Hoare triple {37#false} main_~i~0#1 := 0; {37#false} is VALID [2022-02-20 14:02:59,916 INFO L290 TraceCheckUtils]: 6: Hoare triple {37#false} assume !(main_~i~0#1 < 100000); {37#false} is VALID [2022-02-20 14:02:59,916 INFO L290 TraceCheckUtils]: 7: Hoare triple {37#false} main_~i~0#1 := 0; {37#false} is VALID [2022-02-20 14:02:59,917 INFO L290 TraceCheckUtils]: 8: Hoare triple {37#false} assume !(main_~i~0#1 < 100000); {37#false} is VALID [2022-02-20 14:02:59,917 INFO L290 TraceCheckUtils]: 9: Hoare triple {37#false} main_~i~0#1 := 0; {37#false} is VALID [2022-02-20 14:02:59,917 INFO L290 TraceCheckUtils]: 10: Hoare triple {37#false} assume !(main_~i~0#1 < 100000); {37#false} is VALID [2022-02-20 14:02:59,918 INFO L290 TraceCheckUtils]: 11: Hoare triple {37#false} main_~i~0#1 := 0; {37#false} is VALID [2022-02-20 14:02:59,918 INFO L290 TraceCheckUtils]: 12: Hoare triple {37#false} assume !true; {37#false} is VALID [2022-02-20 14:02:59,918 INFO L290 TraceCheckUtils]: 13: Hoare triple {37#false} main_~i~0#1 := 0; {37#false} is VALID [2022-02-20 14:02:59,918 INFO L290 TraceCheckUtils]: 14: Hoare triple {37#false} assume !true; {37#false} is VALID [2022-02-20 14:02:59,919 INFO L290 TraceCheckUtils]: 15: Hoare triple {37#false} havoc main_~x~0#1;main_~x~0#1 := 0; {37#false} is VALID [2022-02-20 14:02:59,919 INFO L290 TraceCheckUtils]: 16: Hoare triple {37#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem17#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem16#1 == main_#t~mem17#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {37#false} is VALID [2022-02-20 14:02:59,920 INFO L290 TraceCheckUtils]: 17: Hoare triple {37#false} assume 0 == __VERIFIER_assert_~cond#1; {37#false} is VALID [2022-02-20 14:02:59,921 INFO L290 TraceCheckUtils]: 18: Hoare triple {37#false} assume !false; {37#false} is VALID [2022-02-20 14:02:59,922 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:02:59,922 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:02:59,922 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976573440] [2022-02-20 14:02:59,923 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976573440] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:02:59,923 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:02:59,923 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:02:59,925 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277688496] [2022-02-20 14:02:59,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:02:59,930 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2022-02-20 14:02:59,931 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:02:59,933 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have 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:02:59,961 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:02:59,962 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:02:59,962 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:02:59,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:02:59,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:02:59,985 INFO L87 Difference]: Start difference. First operand has 33 states, 31 states have (on average 1.5806451612903225) internal successors, (49), 32 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have 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:03:00,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:03:00,067 INFO L93 Difference]: Finished difference Result 64 states and 96 transitions. [2022-02-20 14:03:00,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:03:00,068 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2022-02-20 14:03:00,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:03:00,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have 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:03:00,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2022-02-20 14:03:00,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have 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:03:00,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2022-02-20 14:03:00,083 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 96 transitions. [2022-02-20 14:03:00,160 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:03:00,170 INFO L225 Difference]: With dead ends: 64 [2022-02-20 14:03:00,171 INFO L226 Difference]: Without dead ends: 31 [2022-02-20 14:03:00,174 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:03:00,177 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 1 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:03:00,178 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 74 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:03:00,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-02-20 14:03:00,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2022-02-20 14:03:00,201 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:03:00,202 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 30 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have 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:03:00,204 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 30 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have 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:03:00,204 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 30 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have 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:03:00,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:03:00,206 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2022-02-20 14:03:00,207 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2022-02-20 14:03:00,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:03:00,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:03:00,208 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 0 states have call successors, (0), 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 31 states. [2022-02-20 14:03:00,209 INFO L87 Difference]: Start difference. First operand has 30 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 0 states have call successors, (0), 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 31 states. [2022-02-20 14:03:00,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:03:00,211 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2022-02-20 14:03:00,211 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2022-02-20 14:03:00,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:03:00,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:03:00,212 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:03:00,212 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:03:00,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have 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:03:00,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2022-02-20 14:03:00,216 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 19 [2022-02-20 14:03:00,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:03:00,218 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2022-02-20 14:03:00,219 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have 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:03:00,220 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2022-02-20 14:03:00,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 14:03:00,221 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:03:00,221 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:03:00,222 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 14:03:00,222 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:03:00,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:03:00,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1385693007, now seen corresponding path program 1 times [2022-02-20 14:03:00,228 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:03:00,229 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299425399] [2022-02-20 14:03:00,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:03:00,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:03:00,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:03:00,312 INFO L290 TraceCheckUtils]: 0: Hoare triple {224#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(26, 2); {224#true} is VALID [2022-02-20 14:03:00,313 INFO L290 TraceCheckUtils]: 1: Hoare triple {224#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_#t~mem4#1, main_#t~post3#1, main_#t~mem6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~post11#1, main_#t~mem14#1, main_#t~post13#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~post15#1, main_~#a1~0#1.base, main_~#a1~0#1.offset, main_~#a2~0#1.base, main_~#a2~0#1.offset, main_~#a3~0#1.base, main_~#a3~0#1.offset, main_~#a4~0#1.base, main_~#a4~0#1.offset, main_~#a5~0#1.base, main_~#a5~0#1.offset, main_~#a6~0#1.base, main_~#a6~0#1.offset, main_~#a7~0#1.base, main_~#a7~0#1.offset, main_~a~0#1, main_~i~0#1, main_~x~0#1;call main_~#a1~0#1.base, main_~#a1~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a2~0#1.base, main_~#a2~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a3~0#1.base, main_~#a3~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a4~0#1.base, main_~#a4~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a5~0#1.base, main_~#a5~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a6~0#1.base, main_~#a6~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a7~0#1.base, main_~#a7~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {226#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:03:00,314 INFO L290 TraceCheckUtils]: 2: Hoare triple {226#(= |ULTIMATE.start_main_~a~0#1| 0)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {226#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:03:00,314 INFO L290 TraceCheckUtils]: 3: Hoare triple {226#(= |ULTIMATE.start_main_~a~0#1| 0)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {227#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:03:00,315 INFO L290 TraceCheckUtils]: 4: Hoare triple {227#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume !(main_~a~0#1 < 100000); {225#false} is VALID [2022-02-20 14:03:00,315 INFO L290 TraceCheckUtils]: 5: Hoare triple {225#false} havoc main_~i~0#1;main_~i~0#1 := 0; {225#false} is VALID [2022-02-20 14:03:00,315 INFO L290 TraceCheckUtils]: 6: Hoare triple {225#false} assume !(main_~i~0#1 < 100000); {225#false} is VALID [2022-02-20 14:03:00,315 INFO L290 TraceCheckUtils]: 7: Hoare triple {225#false} main_~i~0#1 := 0; {225#false} is VALID [2022-02-20 14:03:00,316 INFO L290 TraceCheckUtils]: 8: Hoare triple {225#false} assume !(main_~i~0#1 < 100000); {225#false} is VALID [2022-02-20 14:03:00,316 INFO L290 TraceCheckUtils]: 9: Hoare triple {225#false} main_~i~0#1 := 0; {225#false} is VALID [2022-02-20 14:03:00,316 INFO L290 TraceCheckUtils]: 10: Hoare triple {225#false} assume !(main_~i~0#1 < 100000); {225#false} is VALID [2022-02-20 14:03:00,316 INFO L290 TraceCheckUtils]: 11: Hoare triple {225#false} main_~i~0#1 := 0; {225#false} is VALID [2022-02-20 14:03:00,316 INFO L290 TraceCheckUtils]: 12: Hoare triple {225#false} assume !(main_~i~0#1 < 100000); {225#false} is VALID [2022-02-20 14:03:00,316 INFO L290 TraceCheckUtils]: 13: Hoare triple {225#false} main_~i~0#1 := 0; {225#false} is VALID [2022-02-20 14:03:00,317 INFO L290 TraceCheckUtils]: 14: Hoare triple {225#false} assume !(main_~i~0#1 < 100000); {225#false} is VALID [2022-02-20 14:03:00,327 INFO L290 TraceCheckUtils]: 15: Hoare triple {225#false} main_~i~0#1 := 0; {225#false} is VALID [2022-02-20 14:03:00,327 INFO L290 TraceCheckUtils]: 16: Hoare triple {225#false} assume !(main_~i~0#1 < 100000); {225#false} is VALID [2022-02-20 14:03:00,328 INFO L290 TraceCheckUtils]: 17: Hoare triple {225#false} havoc main_~x~0#1;main_~x~0#1 := 0; {225#false} is VALID [2022-02-20 14:03:00,333 INFO L290 TraceCheckUtils]: 18: Hoare triple {225#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem17#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem16#1 == main_#t~mem17#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {225#false} is VALID [2022-02-20 14:03:00,334 INFO L290 TraceCheckUtils]: 19: Hoare triple {225#false} assume 0 == __VERIFIER_assert_~cond#1; {225#false} is VALID [2022-02-20 14:03:00,334 INFO L290 TraceCheckUtils]: 20: Hoare triple {225#false} assume !false; {225#false} is VALID [2022-02-20 14:03:00,334 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:03:00,335 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:03:00,335 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299425399] [2022-02-20 14:03:00,335 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299425399] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:03:00,335 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630078960] [2022-02-20 14:03:00,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:03:00,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:03:00,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:03:00,340 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:03:00,355 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:03:00,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:03:00,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 14:03:00,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:03:00,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:03:00,489 INFO L290 TraceCheckUtils]: 0: Hoare triple {224#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(26, 2); {224#true} is VALID [2022-02-20 14:03:00,489 INFO L290 TraceCheckUtils]: 1: Hoare triple {224#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_#t~mem4#1, main_#t~post3#1, main_#t~mem6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~post11#1, main_#t~mem14#1, main_#t~post13#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~post15#1, main_~#a1~0#1.base, main_~#a1~0#1.offset, main_~#a2~0#1.base, main_~#a2~0#1.offset, main_~#a3~0#1.base, main_~#a3~0#1.offset, main_~#a4~0#1.base, main_~#a4~0#1.offset, main_~#a5~0#1.base, main_~#a5~0#1.offset, main_~#a6~0#1.base, main_~#a6~0#1.offset, main_~#a7~0#1.base, main_~#a7~0#1.offset, main_~a~0#1, main_~i~0#1, main_~x~0#1;call main_~#a1~0#1.base, main_~#a1~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a2~0#1.base, main_~#a2~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a3~0#1.base, main_~#a3~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a4~0#1.base, main_~#a4~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a5~0#1.base, main_~#a5~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a6~0#1.base, main_~#a6~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a7~0#1.base, main_~#a7~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {224#true} is VALID [2022-02-20 14:03:00,489 INFO L290 TraceCheckUtils]: 2: Hoare triple {224#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {224#true} is VALID [2022-02-20 14:03:00,490 INFO L290 TraceCheckUtils]: 3: Hoare triple {224#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {224#true} is VALID [2022-02-20 14:03:00,490 INFO L290 TraceCheckUtils]: 4: Hoare triple {224#true} assume !(main_~a~0#1 < 100000); {224#true} is VALID [2022-02-20 14:03:00,490 INFO L290 TraceCheckUtils]: 5: Hoare triple {224#true} havoc main_~i~0#1;main_~i~0#1 := 0; {246#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:03:00,491 INFO L290 TraceCheckUtils]: 6: Hoare triple {246#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~i~0#1 < 100000); {225#false} is VALID [2022-02-20 14:03:00,491 INFO L290 TraceCheckUtils]: 7: Hoare triple {225#false} main_~i~0#1 := 0; {225#false} is VALID [2022-02-20 14:03:00,491 INFO L290 TraceCheckUtils]: 8: Hoare triple {225#false} assume !(main_~i~0#1 < 100000); {225#false} is VALID [2022-02-20 14:03:00,491 INFO L290 TraceCheckUtils]: 9: Hoare triple {225#false} main_~i~0#1 := 0; {225#false} is VALID [2022-02-20 14:03:00,492 INFO L290 TraceCheckUtils]: 10: Hoare triple {225#false} assume !(main_~i~0#1 < 100000); {225#false} is VALID [2022-02-20 14:03:00,492 INFO L290 TraceCheckUtils]: 11: Hoare triple {225#false} main_~i~0#1 := 0; {225#false} is VALID [2022-02-20 14:03:00,492 INFO L290 TraceCheckUtils]: 12: Hoare triple {225#false} assume !(main_~i~0#1 < 100000); {225#false} is VALID [2022-02-20 14:03:00,492 INFO L290 TraceCheckUtils]: 13: Hoare triple {225#false} main_~i~0#1 := 0; {225#false} is VALID [2022-02-20 14:03:00,492 INFO L290 TraceCheckUtils]: 14: Hoare triple {225#false} assume !(main_~i~0#1 < 100000); {225#false} is VALID [2022-02-20 14:03:00,492 INFO L290 TraceCheckUtils]: 15: Hoare triple {225#false} main_~i~0#1 := 0; {225#false} is VALID [2022-02-20 14:03:00,493 INFO L290 TraceCheckUtils]: 16: Hoare triple {225#false} assume !(main_~i~0#1 < 100000); {225#false} is VALID [2022-02-20 14:03:00,493 INFO L290 TraceCheckUtils]: 17: Hoare triple {225#false} havoc main_~x~0#1;main_~x~0#1 := 0; {225#false} is VALID [2022-02-20 14:03:00,493 INFO L290 TraceCheckUtils]: 18: Hoare triple {225#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem17#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem16#1 == main_#t~mem17#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {225#false} is VALID [2022-02-20 14:03:00,493 INFO L290 TraceCheckUtils]: 19: Hoare triple {225#false} assume 0 == __VERIFIER_assert_~cond#1; {225#false} is VALID [2022-02-20 14:03:00,493 INFO L290 TraceCheckUtils]: 20: Hoare triple {225#false} assume !false; {225#false} is VALID [2022-02-20 14:03:00,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 14:03:00,494 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:03:00,494 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630078960] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:03:00,494 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 14:03:00,494 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-02-20 14:03:00,495 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990039422] [2022-02-20 14:03:00,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:03:00,496 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2022-02-20 14:03:00,496 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:03:00,496 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have 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:03:00,521 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:03:00,522 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:03:00,522 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:03:00,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:03:00,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:03:00,523 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have 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:03:00,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:03:00,634 INFO L93 Difference]: Finished difference Result 64 states and 82 transitions. [2022-02-20 14:03:00,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:03:00,634 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2022-02-20 14:03:00,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:03:00,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have 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:03:00,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2022-02-20 14:03:00,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have 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:03:00,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2022-02-20 14:03:00,638 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 81 transitions. [2022-02-20 14:03:00,699 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:03:00,701 INFO L225 Difference]: With dead ends: 64 [2022-02-20 14:03:00,701 INFO L226 Difference]: Without dead ends: 42 [2022-02-20 14:03:00,701 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:03:00,703 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 6 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:03:00,704 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 35 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:03:00,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-02-20 14:03:00,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2022-02-20 14:03:00,733 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:03:00,733 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 36 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:03:00,733 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 36 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:03:00,733 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 36 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:03:00,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:03:00,735 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2022-02-20 14:03:00,735 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2022-02-20 14:03:00,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:03:00,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:03:00,736 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 0 states have call successors, (0), 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 42 states. [2022-02-20 14:03:00,736 INFO L87 Difference]: Start difference. First operand has 36 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 0 states have call successors, (0), 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 42 states. [2022-02-20 14:03:00,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:03:00,737 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2022-02-20 14:03:00,737 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2022-02-20 14:03:00,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:03:00,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:03:00,737 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:03:00,737 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:03:00,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:03:00,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2022-02-20 14:03:00,739 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 21 [2022-02-20 14:03:00,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:03:00,739 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2022-02-20 14:03:00,739 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have 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:03:00,739 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-02-20 14:03:00,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-20 14:03:00,739 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:03:00,740 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:03:00,765 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:03:00,948 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:03:00,948 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:03:00,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:03:00,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1933824923, now seen corresponding path program 1 times [2022-02-20 14:03:00,949 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:03:00,949 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221022399] [2022-02-20 14:03:00,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:03:00,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:03:00,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:03:01,060 INFO L290 TraceCheckUtils]: 0: Hoare triple {511#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(26, 2); {511#true} is VALID [2022-02-20 14:03:01,061 INFO L290 TraceCheckUtils]: 1: Hoare triple {511#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_#t~mem4#1, main_#t~post3#1, main_#t~mem6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~post11#1, main_#t~mem14#1, main_#t~post13#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~post15#1, main_~#a1~0#1.base, main_~#a1~0#1.offset, main_~#a2~0#1.base, main_~#a2~0#1.offset, main_~#a3~0#1.base, main_~#a3~0#1.offset, main_~#a4~0#1.base, main_~#a4~0#1.offset, main_~#a5~0#1.base, main_~#a5~0#1.offset, main_~#a6~0#1.base, main_~#a6~0#1.offset, main_~#a7~0#1.base, main_~#a7~0#1.offset, main_~a~0#1, main_~i~0#1, main_~x~0#1;call main_~#a1~0#1.base, main_~#a1~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a2~0#1.base, main_~#a2~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a3~0#1.base, main_~#a3~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a4~0#1.base, main_~#a4~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a5~0#1.base, main_~#a5~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a6~0#1.base, main_~#a6~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a7~0#1.base, main_~#a7~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {513#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:03:01,062 INFO L290 TraceCheckUtils]: 2: Hoare triple {513#(= |ULTIMATE.start_main_~a~0#1| 0)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {513#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:03:01,062 INFO L290 TraceCheckUtils]: 3: Hoare triple {513#(= |ULTIMATE.start_main_~a~0#1| 0)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {514#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:03:01,063 INFO L290 TraceCheckUtils]: 4: Hoare triple {514#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume !(main_~a~0#1 < 100000); {512#false} is VALID [2022-02-20 14:03:01,063 INFO L290 TraceCheckUtils]: 5: Hoare triple {512#false} havoc main_~i~0#1;main_~i~0#1 := 0; {512#false} is VALID [2022-02-20 14:03:01,063 INFO L290 TraceCheckUtils]: 6: Hoare triple {512#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {512#false} is VALID [2022-02-20 14:03:01,064 INFO L290 TraceCheckUtils]: 7: Hoare triple {512#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {512#false} is VALID [2022-02-20 14:03:01,064 INFO L290 TraceCheckUtils]: 8: Hoare triple {512#false} assume !(main_~i~0#1 < 100000); {512#false} is VALID [2022-02-20 14:03:01,064 INFO L290 TraceCheckUtils]: 9: Hoare triple {512#false} main_~i~0#1 := 0; {512#false} is VALID [2022-02-20 14:03:01,064 INFO L290 TraceCheckUtils]: 10: Hoare triple {512#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {512#false} is VALID [2022-02-20 14:03:01,065 INFO L290 TraceCheckUtils]: 11: Hoare triple {512#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {512#false} is VALID [2022-02-20 14:03:01,065 INFO L290 TraceCheckUtils]: 12: Hoare triple {512#false} assume !(main_~i~0#1 < 100000); {512#false} is VALID [2022-02-20 14:03:01,065 INFO L290 TraceCheckUtils]: 13: Hoare triple {512#false} main_~i~0#1 := 0; {512#false} is VALID [2022-02-20 14:03:01,065 INFO L290 TraceCheckUtils]: 14: Hoare triple {512#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {512#false} is VALID [2022-02-20 14:03:01,065 INFO L290 TraceCheckUtils]: 15: Hoare triple {512#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {512#false} is VALID [2022-02-20 14:03:01,066 INFO L290 TraceCheckUtils]: 16: Hoare triple {512#false} assume !(main_~i~0#1 < 100000); {512#false} is VALID [2022-02-20 14:03:01,066 INFO L290 TraceCheckUtils]: 17: Hoare triple {512#false} main_~i~0#1 := 0; {512#false} is VALID [2022-02-20 14:03:01,066 INFO L290 TraceCheckUtils]: 18: Hoare triple {512#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {512#false} is VALID [2022-02-20 14:03:01,066 INFO L290 TraceCheckUtils]: 19: Hoare triple {512#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {512#false} is VALID [2022-02-20 14:03:01,066 INFO L290 TraceCheckUtils]: 20: Hoare triple {512#false} assume !(main_~i~0#1 < 100000); {512#false} is VALID [2022-02-20 14:03:01,067 INFO L290 TraceCheckUtils]: 21: Hoare triple {512#false} main_~i~0#1 := 0; {512#false} is VALID [2022-02-20 14:03:01,067 INFO L290 TraceCheckUtils]: 22: Hoare triple {512#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {512#false} is VALID [2022-02-20 14:03:01,067 INFO L290 TraceCheckUtils]: 23: Hoare triple {512#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {512#false} is VALID [2022-02-20 14:03:01,067 INFO L290 TraceCheckUtils]: 24: Hoare triple {512#false} assume !(main_~i~0#1 < 100000); {512#false} is VALID [2022-02-20 14:03:01,068 INFO L290 TraceCheckUtils]: 25: Hoare triple {512#false} main_~i~0#1 := 0; {512#false} is VALID [2022-02-20 14:03:01,068 INFO L290 TraceCheckUtils]: 26: Hoare triple {512#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {512#false} is VALID [2022-02-20 14:03:01,068 INFO L290 TraceCheckUtils]: 27: Hoare triple {512#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {512#false} is VALID [2022-02-20 14:03:01,068 INFO L290 TraceCheckUtils]: 28: Hoare triple {512#false} assume !(main_~i~0#1 < 100000); {512#false} is VALID [2022-02-20 14:03:01,069 INFO L290 TraceCheckUtils]: 29: Hoare triple {512#false} havoc main_~x~0#1;main_~x~0#1 := 0; {512#false} is VALID [2022-02-20 14:03:01,069 INFO L290 TraceCheckUtils]: 30: Hoare triple {512#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem17#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem16#1 == main_#t~mem17#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {512#false} is VALID [2022-02-20 14:03:01,069 INFO L290 TraceCheckUtils]: 31: Hoare triple {512#false} assume 0 == __VERIFIER_assert_~cond#1; {512#false} is VALID [2022-02-20 14:03:01,078 INFO L290 TraceCheckUtils]: 32: Hoare triple {512#false} assume !false; {512#false} is VALID [2022-02-20 14:03:01,079 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 14:03:01,079 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:03:01,079 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221022399] [2022-02-20 14:03:01,080 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221022399] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:03:01,080 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [510697393] [2022-02-20 14:03:01,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:03:01,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:03:01,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:03:01,090 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:03:01,092 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:03:01,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:03:01,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 14:03:01,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:03:01,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:03:02,025 INFO L290 TraceCheckUtils]: 0: Hoare triple {511#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(26, 2); {511#true} is VALID [2022-02-20 14:03:02,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {511#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_#t~mem4#1, main_#t~post3#1, main_#t~mem6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~post11#1, main_#t~mem14#1, main_#t~post13#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~post15#1, main_~#a1~0#1.base, main_~#a1~0#1.offset, main_~#a2~0#1.base, main_~#a2~0#1.offset, main_~#a3~0#1.base, main_~#a3~0#1.offset, main_~#a4~0#1.base, main_~#a4~0#1.offset, main_~#a5~0#1.base, main_~#a5~0#1.offset, main_~#a6~0#1.base, main_~#a6~0#1.offset, main_~#a7~0#1.base, main_~#a7~0#1.offset, main_~a~0#1, main_~i~0#1, main_~x~0#1;call main_~#a1~0#1.base, main_~#a1~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a2~0#1.base, main_~#a2~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a3~0#1.base, main_~#a3~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a4~0#1.base, main_~#a4~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a5~0#1.base, main_~#a5~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a6~0#1.base, main_~#a6~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a7~0#1.base, main_~#a7~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {521#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:03:02,027 INFO L290 TraceCheckUtils]: 2: Hoare triple {521#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {521#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:03:02,028 INFO L290 TraceCheckUtils]: 3: Hoare triple {521#(<= |ULTIMATE.start_main_~a~0#1| 0)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {514#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:03:02,028 INFO L290 TraceCheckUtils]: 4: Hoare triple {514#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume !(main_~a~0#1 < 100000); {512#false} is VALID [2022-02-20 14:03:02,028 INFO L290 TraceCheckUtils]: 5: Hoare triple {512#false} havoc main_~i~0#1;main_~i~0#1 := 0; {512#false} is VALID [2022-02-20 14:03:02,028 INFO L290 TraceCheckUtils]: 6: Hoare triple {512#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {512#false} is VALID [2022-02-20 14:03:02,028 INFO L290 TraceCheckUtils]: 7: Hoare triple {512#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {512#false} is VALID [2022-02-20 14:03:02,029 INFO L290 TraceCheckUtils]: 8: Hoare triple {512#false} assume !(main_~i~0#1 < 100000); {512#false} is VALID [2022-02-20 14:03:02,029 INFO L290 TraceCheckUtils]: 9: Hoare triple {512#false} main_~i~0#1 := 0; {512#false} is VALID [2022-02-20 14:03:02,029 INFO L290 TraceCheckUtils]: 10: Hoare triple {512#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {512#false} is VALID [2022-02-20 14:03:02,029 INFO L290 TraceCheckUtils]: 11: Hoare triple {512#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {512#false} is VALID [2022-02-20 14:03:02,029 INFO L290 TraceCheckUtils]: 12: Hoare triple {512#false} assume !(main_~i~0#1 < 100000); {512#false} is VALID [2022-02-20 14:03:02,029 INFO L290 TraceCheckUtils]: 13: Hoare triple {512#false} main_~i~0#1 := 0; {512#false} is VALID [2022-02-20 14:03:02,029 INFO L290 TraceCheckUtils]: 14: Hoare triple {512#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {512#false} is VALID [2022-02-20 14:03:02,087 INFO L290 TraceCheckUtils]: 15: Hoare triple {512#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {512#false} is VALID [2022-02-20 14:03:02,088 INFO L290 TraceCheckUtils]: 16: Hoare triple {512#false} assume !(main_~i~0#1 < 100000); {512#false} is VALID [2022-02-20 14:03:02,088 INFO L290 TraceCheckUtils]: 17: Hoare triple {512#false} main_~i~0#1 := 0; {512#false} is VALID [2022-02-20 14:03:02,088 INFO L290 TraceCheckUtils]: 18: Hoare triple {512#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {512#false} is VALID [2022-02-20 14:03:02,088 INFO L290 TraceCheckUtils]: 19: Hoare triple {512#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {512#false} is VALID [2022-02-20 14:03:02,088 INFO L290 TraceCheckUtils]: 20: Hoare triple {512#false} assume !(main_~i~0#1 < 100000); {512#false} is VALID [2022-02-20 14:03:02,088 INFO L290 TraceCheckUtils]: 21: Hoare triple {512#false} main_~i~0#1 := 0; {512#false} is VALID [2022-02-20 14:03:02,088 INFO L290 TraceCheckUtils]: 22: Hoare triple {512#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {512#false} is VALID [2022-02-20 14:03:02,088 INFO L290 TraceCheckUtils]: 23: Hoare triple {512#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {512#false} is VALID [2022-02-20 14:03:02,089 INFO L290 TraceCheckUtils]: 24: Hoare triple {512#false} assume !(main_~i~0#1 < 100000); {512#false} is VALID [2022-02-20 14:03:02,089 INFO L290 TraceCheckUtils]: 25: Hoare triple {512#false} main_~i~0#1 := 0; {512#false} is VALID [2022-02-20 14:03:02,089 INFO L290 TraceCheckUtils]: 26: Hoare triple {512#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {512#false} is VALID [2022-02-20 14:03:02,089 INFO L290 TraceCheckUtils]: 27: Hoare triple {512#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {512#false} is VALID [2022-02-20 14:03:02,089 INFO L290 TraceCheckUtils]: 28: Hoare triple {512#false} assume !(main_~i~0#1 < 100000); {512#false} is VALID [2022-02-20 14:03:02,089 INFO L290 TraceCheckUtils]: 29: Hoare triple {512#false} havoc main_~x~0#1;main_~x~0#1 := 0; {512#false} is VALID [2022-02-20 14:03:02,089 INFO L290 TraceCheckUtils]: 30: Hoare triple {512#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem17#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem16#1 == main_#t~mem17#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {512#false} is VALID [2022-02-20 14:03:02,089 INFO L290 TraceCheckUtils]: 31: Hoare triple {512#false} assume 0 == __VERIFIER_assert_~cond#1; {512#false} is VALID [2022-02-20 14:03:02,089 INFO L290 TraceCheckUtils]: 32: Hoare triple {512#false} assume !false; {512#false} is VALID [2022-02-20 14:03:02,147 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 14:03:02,147 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:03:02,688 INFO L290 TraceCheckUtils]: 32: Hoare triple {512#false} assume !false; {512#false} is VALID [2022-02-20 14:03:02,689 INFO L290 TraceCheckUtils]: 31: Hoare triple {512#false} assume 0 == __VERIFIER_assert_~cond#1; {512#false} is VALID [2022-02-20 14:03:02,689 INFO L290 TraceCheckUtils]: 30: Hoare triple {512#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem17#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem16#1 == main_#t~mem17#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {512#false} is VALID [2022-02-20 14:03:02,689 INFO L290 TraceCheckUtils]: 29: Hoare triple {512#false} havoc main_~x~0#1;main_~x~0#1 := 0; {512#false} is VALID [2022-02-20 14:03:02,689 INFO L290 TraceCheckUtils]: 28: Hoare triple {512#false} assume !(main_~i~0#1 < 100000); {512#false} is VALID [2022-02-20 14:03:02,689 INFO L290 TraceCheckUtils]: 27: Hoare triple {512#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {512#false} is VALID [2022-02-20 14:03:02,689 INFO L290 TraceCheckUtils]: 26: Hoare triple {512#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {512#false} is VALID [2022-02-20 14:03:02,689 INFO L290 TraceCheckUtils]: 25: Hoare triple {512#false} main_~i~0#1 := 0; {512#false} is VALID [2022-02-20 14:03:02,689 INFO L290 TraceCheckUtils]: 24: Hoare triple {512#false} assume !(main_~i~0#1 < 100000); {512#false} is VALID [2022-02-20 14:03:02,690 INFO L290 TraceCheckUtils]: 23: Hoare triple {512#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {512#false} is VALID [2022-02-20 14:03:02,690 INFO L290 TraceCheckUtils]: 22: Hoare triple {512#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {512#false} is VALID [2022-02-20 14:03:02,690 INFO L290 TraceCheckUtils]: 21: Hoare triple {512#false} main_~i~0#1 := 0; {512#false} is VALID [2022-02-20 14:03:02,690 INFO L290 TraceCheckUtils]: 20: Hoare triple {512#false} assume !(main_~i~0#1 < 100000); {512#false} is VALID [2022-02-20 14:03:02,690 INFO L290 TraceCheckUtils]: 19: Hoare triple {512#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {512#false} is VALID [2022-02-20 14:03:02,690 INFO L290 TraceCheckUtils]: 18: Hoare triple {512#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {512#false} is VALID [2022-02-20 14:03:02,690 INFO L290 TraceCheckUtils]: 17: Hoare triple {512#false} main_~i~0#1 := 0; {512#false} is VALID [2022-02-20 14:03:02,690 INFO L290 TraceCheckUtils]: 16: Hoare triple {512#false} assume !(main_~i~0#1 < 100000); {512#false} is VALID [2022-02-20 14:03:02,690 INFO L290 TraceCheckUtils]: 15: Hoare triple {512#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {512#false} is VALID [2022-02-20 14:03:03,307 INFO L290 TraceCheckUtils]: 14: Hoare triple {512#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {512#false} is VALID [2022-02-20 14:03:03,307 INFO L290 TraceCheckUtils]: 13: Hoare triple {512#false} main_~i~0#1 := 0; {512#false} is VALID [2022-02-20 14:03:03,308 INFO L290 TraceCheckUtils]: 12: Hoare triple {512#false} assume !(main_~i~0#1 < 100000); {512#false} is VALID [2022-02-20 14:03:03,308 INFO L290 TraceCheckUtils]: 11: Hoare triple {512#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {512#false} is VALID [2022-02-20 14:03:03,308 INFO L290 TraceCheckUtils]: 10: Hoare triple {512#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {512#false} is VALID [2022-02-20 14:03:03,308 INFO L290 TraceCheckUtils]: 9: Hoare triple {512#false} main_~i~0#1 := 0; {512#false} is VALID [2022-02-20 14:03:03,308 INFO L290 TraceCheckUtils]: 8: Hoare triple {512#false} assume !(main_~i~0#1 < 100000); {512#false} is VALID [2022-02-20 14:03:03,308 INFO L290 TraceCheckUtils]: 7: Hoare triple {512#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {512#false} is VALID [2022-02-20 14:03:03,308 INFO L290 TraceCheckUtils]: 6: Hoare triple {512#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {512#false} is VALID [2022-02-20 14:03:03,308 INFO L290 TraceCheckUtils]: 5: Hoare triple {512#false} havoc main_~i~0#1;main_~i~0#1 := 0; {512#false} is VALID [2022-02-20 14:03:03,309 INFO L290 TraceCheckUtils]: 4: Hoare triple {699#(< |ULTIMATE.start_main_~a~0#1| 100000)} assume !(main_~a~0#1 < 100000); {512#false} is VALID [2022-02-20 14:03:03,311 INFO L290 TraceCheckUtils]: 3: Hoare triple {703#(< |ULTIMATE.start_main_~a~0#1| 99999)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {699#(< |ULTIMATE.start_main_~a~0#1| 100000)} is VALID [2022-02-20 14:03:03,315 INFO L290 TraceCheckUtils]: 2: Hoare triple {703#(< |ULTIMATE.start_main_~a~0#1| 99999)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {703#(< |ULTIMATE.start_main_~a~0#1| 99999)} is VALID [2022-02-20 14:03:03,316 INFO L290 TraceCheckUtils]: 1: Hoare triple {511#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_#t~mem4#1, main_#t~post3#1, main_#t~mem6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~post11#1, main_#t~mem14#1, main_#t~post13#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~post15#1, main_~#a1~0#1.base, main_~#a1~0#1.offset, main_~#a2~0#1.base, main_~#a2~0#1.offset, main_~#a3~0#1.base, main_~#a3~0#1.offset, main_~#a4~0#1.base, main_~#a4~0#1.offset, main_~#a5~0#1.base, main_~#a5~0#1.offset, main_~#a6~0#1.base, main_~#a6~0#1.offset, main_~#a7~0#1.base, main_~#a7~0#1.offset, main_~a~0#1, main_~i~0#1, main_~x~0#1;call main_~#a1~0#1.base, main_~#a1~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a2~0#1.base, main_~#a2~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a3~0#1.base, main_~#a3~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a4~0#1.base, main_~#a4~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a5~0#1.base, main_~#a5~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a6~0#1.base, main_~#a6~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a7~0#1.base, main_~#a7~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {703#(< |ULTIMATE.start_main_~a~0#1| 99999)} is VALID [2022-02-20 14:03:04,104 INFO L290 TraceCheckUtils]: 0: Hoare triple {511#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(26, 2); {511#true} is VALID [2022-02-20 14:03:04,105 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 14:03:04,105 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [510697393] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:03:04,105 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:03:04,105 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-02-20 14:03:04,106 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698943646] [2022-02-20 14:03:04,106 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:03:04,106 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 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 33 [2022-02-20 14:03:04,107 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:03:04,107 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have 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:03:04,153 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:03:04,153 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 14:03:04,153 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:03:04,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 14:03:04,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-02-20 14:03:04,160 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have 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:03:04,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:03:04,286 INFO L93 Difference]: Finished difference Result 73 states and 89 transitions. [2022-02-20 14:03:04,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 14:03:04,287 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 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 33 [2022-02-20 14:03:04,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:03:04,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have 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:03:04,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2022-02-20 14:03:04,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have 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:03:04,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2022-02-20 14:03:04,290 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 77 transitions. [2022-02-20 14:03:04,356 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:03:04,357 INFO L225 Difference]: With dead ends: 73 [2022-02-20 14:03:04,357 INFO L226 Difference]: Without dead ends: 42 [2022-02-20 14:03:04,358 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 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:03:04,359 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 6 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:03:04,359 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 98 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:03:04,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-02-20 14:03:04,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-02-20 14:03:04,368 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:03:04,368 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 42 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 41 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:03:04,368 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 42 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 41 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:03:04,369 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 42 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 41 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:03:04,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:03:04,370 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2022-02-20 14:03:04,370 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2022-02-20 14:03:04,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:03:04,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:03:04,370 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 41 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 42 states. [2022-02-20 14:03:04,370 INFO L87 Difference]: Start difference. First operand has 42 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 41 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 42 states. [2022-02-20 14:03:04,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:03:04,372 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2022-02-20 14:03:04,372 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2022-02-20 14:03:04,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:03:04,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:03:04,372 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:03:04,372 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:03:04,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 41 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:03:04,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2022-02-20 14:03:04,373 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 33 [2022-02-20 14:03:04,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:03:04,374 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2022-02-20 14:03:04,374 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have 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:03:04,374 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2022-02-20 14:03:04,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-02-20 14:03:04,375 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:03:04,375 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:03:04,395 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-02-20 14:03:04,588 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,SelfDestructingSolverStorable2 [2022-02-20 14:03:04,589 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:03:04,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:03:04,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1087832161, now seen corresponding path program 2 times [2022-02-20 14:03:04,590 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:03:04,590 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029242868] [2022-02-20 14:03:04,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:03:04,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:03:04,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:03:04,655 INFO L290 TraceCheckUtils]: 0: Hoare triple {960#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(26, 2); {960#true} is VALID [2022-02-20 14:03:04,655 INFO L290 TraceCheckUtils]: 1: Hoare triple {960#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_#t~mem4#1, main_#t~post3#1, main_#t~mem6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~post11#1, main_#t~mem14#1, main_#t~post13#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~post15#1, main_~#a1~0#1.base, main_~#a1~0#1.offset, main_~#a2~0#1.base, main_~#a2~0#1.offset, main_~#a3~0#1.base, main_~#a3~0#1.offset, main_~#a4~0#1.base, main_~#a4~0#1.offset, main_~#a5~0#1.base, main_~#a5~0#1.offset, main_~#a6~0#1.base, main_~#a6~0#1.offset, main_~#a7~0#1.base, main_~#a7~0#1.offset, main_~a~0#1, main_~i~0#1, main_~x~0#1;call main_~#a1~0#1.base, main_~#a1~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a2~0#1.base, main_~#a2~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a3~0#1.base, main_~#a3~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a4~0#1.base, main_~#a4~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a5~0#1.base, main_~#a5~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a6~0#1.base, main_~#a6~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a7~0#1.base, main_~#a7~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {960#true} is VALID [2022-02-20 14:03:04,655 INFO L290 TraceCheckUtils]: 2: Hoare triple {960#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {960#true} is VALID [2022-02-20 14:03:04,656 INFO L290 TraceCheckUtils]: 3: Hoare triple {960#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {960#true} is VALID [2022-02-20 14:03:04,656 INFO L290 TraceCheckUtils]: 4: Hoare triple {960#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {960#true} is VALID [2022-02-20 14:03:04,656 INFO L290 TraceCheckUtils]: 5: Hoare triple {960#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {960#true} is VALID [2022-02-20 14:03:04,656 INFO L290 TraceCheckUtils]: 6: Hoare triple {960#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {960#true} is VALID [2022-02-20 14:03:04,656 INFO L290 TraceCheckUtils]: 7: Hoare triple {960#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {960#true} is VALID [2022-02-20 14:03:04,656 INFO L290 TraceCheckUtils]: 8: Hoare triple {960#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {960#true} is VALID [2022-02-20 14:03:04,656 INFO L290 TraceCheckUtils]: 9: Hoare triple {960#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {960#true} is VALID [2022-02-20 14:03:04,657 INFO L290 TraceCheckUtils]: 10: Hoare triple {960#true} assume !(main_~a~0#1 < 100000); {960#true} is VALID [2022-02-20 14:03:04,657 INFO L290 TraceCheckUtils]: 11: Hoare triple {960#true} havoc main_~i~0#1;main_~i~0#1 := 0; {962#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:03:04,657 INFO L290 TraceCheckUtils]: 12: Hoare triple {962#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {962#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:03:04,658 INFO L290 TraceCheckUtils]: 13: Hoare triple {962#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {963#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:03:04,658 INFO L290 TraceCheckUtils]: 14: Hoare triple {963#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < 100000); {961#false} is VALID [2022-02-20 14:03:04,658 INFO L290 TraceCheckUtils]: 15: Hoare triple {961#false} main_~i~0#1 := 0; {961#false} is VALID [2022-02-20 14:03:04,659 INFO L290 TraceCheckUtils]: 16: Hoare triple {961#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {961#false} is VALID [2022-02-20 14:03:04,659 INFO L290 TraceCheckUtils]: 17: Hoare triple {961#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {961#false} is VALID [2022-02-20 14:03:04,659 INFO L290 TraceCheckUtils]: 18: Hoare triple {961#false} assume !(main_~i~0#1 < 100000); {961#false} is VALID [2022-02-20 14:03:04,659 INFO L290 TraceCheckUtils]: 19: Hoare triple {961#false} main_~i~0#1 := 0; {961#false} is VALID [2022-02-20 14:03:04,659 INFO L290 TraceCheckUtils]: 20: Hoare triple {961#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {961#false} is VALID [2022-02-20 14:03:04,659 INFO L290 TraceCheckUtils]: 21: Hoare triple {961#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {961#false} is VALID [2022-02-20 14:03:04,659 INFO L290 TraceCheckUtils]: 22: Hoare triple {961#false} assume !(main_~i~0#1 < 100000); {961#false} is VALID [2022-02-20 14:03:04,660 INFO L290 TraceCheckUtils]: 23: Hoare triple {961#false} main_~i~0#1 := 0; {961#false} is VALID [2022-02-20 14:03:04,660 INFO L290 TraceCheckUtils]: 24: Hoare triple {961#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {961#false} is VALID [2022-02-20 14:03:04,660 INFO L290 TraceCheckUtils]: 25: Hoare triple {961#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {961#false} is VALID [2022-02-20 14:03:04,660 INFO L290 TraceCheckUtils]: 26: Hoare triple {961#false} assume !(main_~i~0#1 < 100000); {961#false} is VALID [2022-02-20 14:03:04,660 INFO L290 TraceCheckUtils]: 27: Hoare triple {961#false} main_~i~0#1 := 0; {961#false} is VALID [2022-02-20 14:03:04,660 INFO L290 TraceCheckUtils]: 28: Hoare triple {961#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {961#false} is VALID [2022-02-20 14:03:04,660 INFO L290 TraceCheckUtils]: 29: Hoare triple {961#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {961#false} is VALID [2022-02-20 14:03:04,661 INFO L290 TraceCheckUtils]: 30: Hoare triple {961#false} assume !(main_~i~0#1 < 100000); {961#false} is VALID [2022-02-20 14:03:04,661 INFO L290 TraceCheckUtils]: 31: Hoare triple {961#false} main_~i~0#1 := 0; {961#false} is VALID [2022-02-20 14:03:04,661 INFO L290 TraceCheckUtils]: 32: Hoare triple {961#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {961#false} is VALID [2022-02-20 14:03:04,661 INFO L290 TraceCheckUtils]: 33: Hoare triple {961#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {961#false} is VALID [2022-02-20 14:03:04,661 INFO L290 TraceCheckUtils]: 34: Hoare triple {961#false} assume !(main_~i~0#1 < 100000); {961#false} is VALID [2022-02-20 14:03:04,661 INFO L290 TraceCheckUtils]: 35: Hoare triple {961#false} havoc main_~x~0#1;main_~x~0#1 := 0; {961#false} is VALID [2022-02-20 14:03:04,661 INFO L290 TraceCheckUtils]: 36: Hoare triple {961#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem17#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem16#1 == main_#t~mem17#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {961#false} is VALID [2022-02-20 14:03:04,662 INFO L290 TraceCheckUtils]: 37: Hoare triple {961#false} assume 0 == __VERIFIER_assert_~cond#1; {961#false} is VALID [2022-02-20 14:03:04,662 INFO L290 TraceCheckUtils]: 38: Hoare triple {961#false} assume !false; {961#false} is VALID [2022-02-20 14:03:04,670 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-02-20 14:03:04,670 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:03:04,670 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029242868] [2022-02-20 14:03:04,670 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029242868] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:03:04,670 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129961155] [2022-02-20 14:03:04,671 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 14:03:04,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:03:04,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:03:04,676 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:03:04,676 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:03:04,803 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 14:03:04,803 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:03:04,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 14:03:04,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:03:04,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:03:04,908 INFO L290 TraceCheckUtils]: 0: Hoare triple {960#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(26, 2); {960#true} is VALID [2022-02-20 14:03:04,908 INFO L290 TraceCheckUtils]: 1: Hoare triple {960#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_#t~mem4#1, main_#t~post3#1, main_#t~mem6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~post11#1, main_#t~mem14#1, main_#t~post13#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~post15#1, main_~#a1~0#1.base, main_~#a1~0#1.offset, main_~#a2~0#1.base, main_~#a2~0#1.offset, main_~#a3~0#1.base, main_~#a3~0#1.offset, main_~#a4~0#1.base, main_~#a4~0#1.offset, main_~#a5~0#1.base, main_~#a5~0#1.offset, main_~#a6~0#1.base, main_~#a6~0#1.offset, main_~#a7~0#1.base, main_~#a7~0#1.offset, main_~a~0#1, main_~i~0#1, main_~x~0#1;call main_~#a1~0#1.base, main_~#a1~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a2~0#1.base, main_~#a2~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a3~0#1.base, main_~#a3~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a4~0#1.base, main_~#a4~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a5~0#1.base, main_~#a5~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a6~0#1.base, main_~#a6~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a7~0#1.base, main_~#a7~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {960#true} is VALID [2022-02-20 14:03:04,908 INFO L290 TraceCheckUtils]: 2: Hoare triple {960#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {960#true} is VALID [2022-02-20 14:03:04,909 INFO L290 TraceCheckUtils]: 3: Hoare triple {960#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {960#true} is VALID [2022-02-20 14:03:04,909 INFO L290 TraceCheckUtils]: 4: Hoare triple {960#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {960#true} is VALID [2022-02-20 14:03:04,909 INFO L290 TraceCheckUtils]: 5: Hoare triple {960#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {960#true} is VALID [2022-02-20 14:03:04,909 INFO L290 TraceCheckUtils]: 6: Hoare triple {960#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {960#true} is VALID [2022-02-20 14:03:04,909 INFO L290 TraceCheckUtils]: 7: Hoare triple {960#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {960#true} is VALID [2022-02-20 14:03:04,909 INFO L290 TraceCheckUtils]: 8: Hoare triple {960#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {960#true} is VALID [2022-02-20 14:03:04,909 INFO L290 TraceCheckUtils]: 9: Hoare triple {960#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {960#true} is VALID [2022-02-20 14:03:04,910 INFO L290 TraceCheckUtils]: 10: Hoare triple {960#true} assume !(main_~a~0#1 < 100000); {960#true} is VALID [2022-02-20 14:03:04,910 INFO L290 TraceCheckUtils]: 11: Hoare triple {960#true} havoc main_~i~0#1;main_~i~0#1 := 0; {960#true} is VALID [2022-02-20 14:03:04,910 INFO L290 TraceCheckUtils]: 12: Hoare triple {960#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {960#true} is VALID [2022-02-20 14:03:04,910 INFO L290 TraceCheckUtils]: 13: Hoare triple {960#true} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {960#true} is VALID [2022-02-20 14:03:04,910 INFO L290 TraceCheckUtils]: 14: Hoare triple {960#true} assume !(main_~i~0#1 < 100000); {960#true} is VALID [2022-02-20 14:03:04,910 INFO L290 TraceCheckUtils]: 15: Hoare triple {960#true} main_~i~0#1 := 0; {960#true} is VALID [2022-02-20 14:03:04,910 INFO L290 TraceCheckUtils]: 16: Hoare triple {960#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {960#true} is VALID [2022-02-20 14:03:04,911 INFO L290 TraceCheckUtils]: 17: Hoare triple {960#true} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {960#true} is VALID [2022-02-20 14:03:04,911 INFO L290 TraceCheckUtils]: 18: Hoare triple {960#true} assume !(main_~i~0#1 < 100000); {960#true} is VALID [2022-02-20 14:03:04,911 INFO L290 TraceCheckUtils]: 19: Hoare triple {960#true} main_~i~0#1 := 0; {960#true} is VALID [2022-02-20 14:03:04,911 INFO L290 TraceCheckUtils]: 20: Hoare triple {960#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {960#true} is VALID [2022-02-20 14:03:04,911 INFO L290 TraceCheckUtils]: 21: Hoare triple {960#true} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {960#true} is VALID [2022-02-20 14:03:04,911 INFO L290 TraceCheckUtils]: 22: Hoare triple {960#true} assume !(main_~i~0#1 < 100000); {960#true} is VALID [2022-02-20 14:03:04,912 INFO L290 TraceCheckUtils]: 23: Hoare triple {960#true} main_~i~0#1 := 0; {960#true} is VALID [2022-02-20 14:03:04,912 INFO L290 TraceCheckUtils]: 24: Hoare triple {960#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {960#true} is VALID [2022-02-20 14:03:04,912 INFO L290 TraceCheckUtils]: 25: Hoare triple {960#true} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {960#true} is VALID [2022-02-20 14:03:04,912 INFO L290 TraceCheckUtils]: 26: Hoare triple {960#true} assume !(main_~i~0#1 < 100000); {960#true} is VALID [2022-02-20 14:03:04,912 INFO L290 TraceCheckUtils]: 27: Hoare triple {960#true} main_~i~0#1 := 0; {960#true} is VALID [2022-02-20 14:03:04,912 INFO L290 TraceCheckUtils]: 28: Hoare triple {960#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {960#true} is VALID [2022-02-20 14:03:04,912 INFO L290 TraceCheckUtils]: 29: Hoare triple {960#true} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {960#true} is VALID [2022-02-20 14:03:04,912 INFO L290 TraceCheckUtils]: 30: Hoare triple {960#true} assume !(main_~i~0#1 < 100000); {960#true} is VALID [2022-02-20 14:03:04,914 INFO L290 TraceCheckUtils]: 31: Hoare triple {960#true} main_~i~0#1 := 0; {1060#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:03:04,914 INFO L290 TraceCheckUtils]: 32: Hoare triple {1060#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {1060#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:03:04,914 INFO L290 TraceCheckUtils]: 33: Hoare triple {1060#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {963#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:03:04,915 INFO L290 TraceCheckUtils]: 34: Hoare triple {963#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < 100000); {961#false} is VALID [2022-02-20 14:03:04,915 INFO L290 TraceCheckUtils]: 35: Hoare triple {961#false} havoc main_~x~0#1;main_~x~0#1 := 0; {961#false} is VALID [2022-02-20 14:03:04,915 INFO L290 TraceCheckUtils]: 36: Hoare triple {961#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem17#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem16#1 == main_#t~mem17#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {961#false} is VALID [2022-02-20 14:03:04,915 INFO L290 TraceCheckUtils]: 37: Hoare triple {961#false} assume 0 == __VERIFIER_assert_~cond#1; {961#false} is VALID [2022-02-20 14:03:04,915 INFO L290 TraceCheckUtils]: 38: Hoare triple {961#false} assume !false; {961#false} is VALID [2022-02-20 14:03:04,916 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-02-20 14:03:04,916 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:03:04,995 INFO L290 TraceCheckUtils]: 38: Hoare triple {961#false} assume !false; {961#false} is VALID [2022-02-20 14:03:04,996 INFO L290 TraceCheckUtils]: 37: Hoare triple {961#false} assume 0 == __VERIFIER_assert_~cond#1; {961#false} is VALID [2022-02-20 14:03:04,996 INFO L290 TraceCheckUtils]: 36: Hoare triple {961#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem17#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem16#1 == main_#t~mem17#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {961#false} is VALID [2022-02-20 14:03:04,996 INFO L290 TraceCheckUtils]: 35: Hoare triple {961#false} havoc main_~x~0#1;main_~x~0#1 := 0; {961#false} is VALID [2022-02-20 14:03:04,997 INFO L290 TraceCheckUtils]: 34: Hoare triple {1094#(< |ULTIMATE.start_main_~i~0#1| 100000)} assume !(main_~i~0#1 < 100000); {961#false} is VALID [2022-02-20 14:03:05,000 INFO L290 TraceCheckUtils]: 33: Hoare triple {1098#(< |ULTIMATE.start_main_~i~0#1| 99999)} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {1094#(< |ULTIMATE.start_main_~i~0#1| 100000)} is VALID [2022-02-20 14:03:05,000 INFO L290 TraceCheckUtils]: 32: Hoare triple {1098#(< |ULTIMATE.start_main_~i~0#1| 99999)} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {1098#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:03:05,001 INFO L290 TraceCheckUtils]: 31: Hoare triple {960#true} main_~i~0#1 := 0; {1098#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:03:05,001 INFO L290 TraceCheckUtils]: 30: Hoare triple {960#true} assume !(main_~i~0#1 < 100000); {960#true} is VALID [2022-02-20 14:03:05,001 INFO L290 TraceCheckUtils]: 29: Hoare triple {960#true} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {960#true} is VALID [2022-02-20 14:03:05,001 INFO L290 TraceCheckUtils]: 28: Hoare triple {960#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {960#true} is VALID [2022-02-20 14:03:05,001 INFO L290 TraceCheckUtils]: 27: Hoare triple {960#true} main_~i~0#1 := 0; {960#true} is VALID [2022-02-20 14:03:05,001 INFO L290 TraceCheckUtils]: 26: Hoare triple {960#true} assume !(main_~i~0#1 < 100000); {960#true} is VALID [2022-02-20 14:03:05,001 INFO L290 TraceCheckUtils]: 25: Hoare triple {960#true} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {960#true} is VALID [2022-02-20 14:03:05,001 INFO L290 TraceCheckUtils]: 24: Hoare triple {960#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {960#true} is VALID [2022-02-20 14:03:05,002 INFO L290 TraceCheckUtils]: 23: Hoare triple {960#true} main_~i~0#1 := 0; {960#true} is VALID [2022-02-20 14:03:05,002 INFO L290 TraceCheckUtils]: 22: Hoare triple {960#true} assume !(main_~i~0#1 < 100000); {960#true} is VALID [2022-02-20 14:03:05,002 INFO L290 TraceCheckUtils]: 21: Hoare triple {960#true} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {960#true} is VALID [2022-02-20 14:03:05,002 INFO L290 TraceCheckUtils]: 20: Hoare triple {960#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {960#true} is VALID [2022-02-20 14:03:05,002 INFO L290 TraceCheckUtils]: 19: Hoare triple {960#true} main_~i~0#1 := 0; {960#true} is VALID [2022-02-20 14:03:05,002 INFO L290 TraceCheckUtils]: 18: Hoare triple {960#true} assume !(main_~i~0#1 < 100000); {960#true} is VALID [2022-02-20 14:03:05,002 INFO L290 TraceCheckUtils]: 17: Hoare triple {960#true} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {960#true} is VALID [2022-02-20 14:03:05,002 INFO L290 TraceCheckUtils]: 16: Hoare triple {960#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {960#true} is VALID [2022-02-20 14:03:05,003 INFO L290 TraceCheckUtils]: 15: Hoare triple {960#true} main_~i~0#1 := 0; {960#true} is VALID [2022-02-20 14:03:05,003 INFO L290 TraceCheckUtils]: 14: Hoare triple {960#true} assume !(main_~i~0#1 < 100000); {960#true} is VALID [2022-02-20 14:03:05,003 INFO L290 TraceCheckUtils]: 13: Hoare triple {960#true} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {960#true} is VALID [2022-02-20 14:03:05,003 INFO L290 TraceCheckUtils]: 12: Hoare triple {960#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {960#true} is VALID [2022-02-20 14:03:05,003 INFO L290 TraceCheckUtils]: 11: Hoare triple {960#true} havoc main_~i~0#1;main_~i~0#1 := 0; {960#true} is VALID [2022-02-20 14:03:05,003 INFO L290 TraceCheckUtils]: 10: Hoare triple {960#true} assume !(main_~a~0#1 < 100000); {960#true} is VALID [2022-02-20 14:03:05,003 INFO L290 TraceCheckUtils]: 9: Hoare triple {960#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {960#true} is VALID [2022-02-20 14:03:05,003 INFO L290 TraceCheckUtils]: 8: Hoare triple {960#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {960#true} is VALID [2022-02-20 14:03:05,004 INFO L290 TraceCheckUtils]: 7: Hoare triple {960#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {960#true} is VALID [2022-02-20 14:03:05,004 INFO L290 TraceCheckUtils]: 6: Hoare triple {960#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {960#true} is VALID [2022-02-20 14:03:05,004 INFO L290 TraceCheckUtils]: 5: Hoare triple {960#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {960#true} is VALID [2022-02-20 14:03:05,004 INFO L290 TraceCheckUtils]: 4: Hoare triple {960#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {960#true} is VALID [2022-02-20 14:03:05,004 INFO L290 TraceCheckUtils]: 3: Hoare triple {960#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {960#true} is VALID [2022-02-20 14:03:05,004 INFO L290 TraceCheckUtils]: 2: Hoare triple {960#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {960#true} is VALID [2022-02-20 14:03:05,004 INFO L290 TraceCheckUtils]: 1: Hoare triple {960#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_#t~mem4#1, main_#t~post3#1, main_#t~mem6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~post11#1, main_#t~mem14#1, main_#t~post13#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~post15#1, main_~#a1~0#1.base, main_~#a1~0#1.offset, main_~#a2~0#1.base, main_~#a2~0#1.offset, main_~#a3~0#1.base, main_~#a3~0#1.offset, main_~#a4~0#1.base, main_~#a4~0#1.offset, main_~#a5~0#1.base, main_~#a5~0#1.offset, main_~#a6~0#1.base, main_~#a6~0#1.offset, main_~#a7~0#1.base, main_~#a7~0#1.offset, main_~a~0#1, main_~i~0#1, main_~x~0#1;call main_~#a1~0#1.base, main_~#a1~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a2~0#1.base, main_~#a2~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a3~0#1.base, main_~#a3~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a4~0#1.base, main_~#a4~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a5~0#1.base, main_~#a5~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a6~0#1.base, main_~#a6~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a7~0#1.base, main_~#a7~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {960#true} is VALID [2022-02-20 14:03:05,004 INFO L290 TraceCheckUtils]: 0: Hoare triple {960#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(26, 2); {960#true} is VALID [2022-02-20 14:03:05,005 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-02-20 14:03:05,005 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2129961155] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:03:05,005 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:03:05,005 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-02-20 14:03:05,005 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959937306] [2022-02-20 14:03:05,005 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:03:05,006 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-02-20 14:03:05,006 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:03:05,006 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:03:05,040 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:03:05,040 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 14:03:05,040 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:03:05,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 14:03:05,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-02-20 14:03:05,041 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:03:05,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:03:05,297 INFO L93 Difference]: Finished difference Result 105 states and 135 transitions. [2022-02-20 14:03:05,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 14:03:05,298 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-02-20 14:03:05,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:03:05,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:03:05,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 123 transitions. [2022-02-20 14:03:05,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:03:05,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 123 transitions. [2022-02-20 14:03:05,301 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 123 transitions. [2022-02-20 14:03:05,411 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:03:05,413 INFO L225 Difference]: With dead ends: 105 [2022-02-20 14:03:05,413 INFO L226 Difference]: Without dead ends: 78 [2022-02-20 14:03:05,413 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 75 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:03:05,415 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 42 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:03:05,415 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 46 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:03:05,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-02-20 14:03:05,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-02-20 14:03:05,432 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:03:05,433 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand has 78 states, 77 states have (on average 1.103896103896104) internal successors, (85), 77 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have 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:03:05,433 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand has 78 states, 77 states have (on average 1.103896103896104) internal successors, (85), 77 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have 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:03:05,433 INFO L87 Difference]: Start difference. First operand 78 states. Second operand has 78 states, 77 states have (on average 1.103896103896104) internal successors, (85), 77 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have 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:03:05,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:03:05,435 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2022-02-20 14:03:05,435 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2022-02-20 14:03:05,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:03:05,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:03:05,435 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 77 states have (on average 1.103896103896104) internal successors, (85), 77 states have internal predecessors, (85), 0 states have call successors, (0), 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 78 states. [2022-02-20 14:03:05,436 INFO L87 Difference]: Start difference. First operand has 78 states, 77 states have (on average 1.103896103896104) internal successors, (85), 77 states have internal predecessors, (85), 0 states have call successors, (0), 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 78 states. [2022-02-20 14:03:05,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:03:05,437 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2022-02-20 14:03:05,437 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2022-02-20 14:03:05,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:03:05,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:03:05,438 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:03:05,438 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:03:05,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.103896103896104) internal successors, (85), 77 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have 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:03:05,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2022-02-20 14:03:05,440 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 39 [2022-02-20 14:03:05,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:03:05,440 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2022-02-20 14:03:05,441 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:03:05,441 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2022-02-20 14:03:05,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-02-20 14:03:05,442 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:03:05,442 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:03:05,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-20 14:03:05,660 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:03:05,660 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:03:05,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:03:05,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1517340229, now seen corresponding path program 3 times [2022-02-20 14:03:05,661 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:03:05,661 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125658532] [2022-02-20 14:03:05,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:03:05,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:03:05,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:03:05,807 INFO L290 TraceCheckUtils]: 0: Hoare triple {1619#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(26, 2); {1619#true} is VALID [2022-02-20 14:03:05,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {1619#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_#t~mem4#1, main_#t~post3#1, main_#t~mem6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~post11#1, main_#t~mem14#1, main_#t~post13#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~post15#1, main_~#a1~0#1.base, main_~#a1~0#1.offset, main_~#a2~0#1.base, main_~#a2~0#1.offset, main_~#a3~0#1.base, main_~#a3~0#1.offset, main_~#a4~0#1.base, main_~#a4~0#1.offset, main_~#a5~0#1.base, main_~#a5~0#1.offset, main_~#a6~0#1.base, main_~#a6~0#1.offset, main_~#a7~0#1.base, main_~#a7~0#1.offset, main_~a~0#1, main_~i~0#1, main_~x~0#1;call main_~#a1~0#1.base, main_~#a1~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a2~0#1.base, main_~#a2~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a3~0#1.base, main_~#a3~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a4~0#1.base, main_~#a4~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a5~0#1.base, main_~#a5~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a6~0#1.base, main_~#a6~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a7~0#1.base, main_~#a7~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {1621#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:03:05,807 INFO L290 TraceCheckUtils]: 2: Hoare triple {1621#(= |ULTIMATE.start_main_~a~0#1| 0)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {1621#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:03:05,808 INFO L290 TraceCheckUtils]: 3: Hoare triple {1621#(= |ULTIMATE.start_main_~a~0#1| 0)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1622#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:03:05,808 INFO L290 TraceCheckUtils]: 4: Hoare triple {1622#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {1622#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:03:05,809 INFO L290 TraceCheckUtils]: 5: Hoare triple {1622#(<= |ULTIMATE.start_main_~a~0#1| 1)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1623#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-20 14:03:05,809 INFO L290 TraceCheckUtils]: 6: Hoare triple {1623#(<= |ULTIMATE.start_main_~a~0#1| 2)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {1623#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-20 14:03:05,809 INFO L290 TraceCheckUtils]: 7: Hoare triple {1623#(<= |ULTIMATE.start_main_~a~0#1| 2)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1624#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-20 14:03:05,810 INFO L290 TraceCheckUtils]: 8: Hoare triple {1624#(<= |ULTIMATE.start_main_~a~0#1| 3)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {1624#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-20 14:03:05,810 INFO L290 TraceCheckUtils]: 9: Hoare triple {1624#(<= |ULTIMATE.start_main_~a~0#1| 3)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1625#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-20 14:03:05,810 INFO L290 TraceCheckUtils]: 10: Hoare triple {1625#(<= |ULTIMATE.start_main_~a~0#1| 4)} assume !(main_~a~0#1 < 100000); {1620#false} is VALID [2022-02-20 14:03:05,811 INFO L290 TraceCheckUtils]: 11: Hoare triple {1620#false} havoc main_~i~0#1;main_~i~0#1 := 0; {1620#false} is VALID [2022-02-20 14:03:05,811 INFO L290 TraceCheckUtils]: 12: Hoare triple {1620#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {1620#false} is VALID [2022-02-20 14:03:05,811 INFO L290 TraceCheckUtils]: 13: Hoare triple {1620#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1620#false} is VALID [2022-02-20 14:03:05,811 INFO L290 TraceCheckUtils]: 14: Hoare triple {1620#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {1620#false} is VALID [2022-02-20 14:03:05,811 INFO L290 TraceCheckUtils]: 15: Hoare triple {1620#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1620#false} is VALID [2022-02-20 14:03:05,811 INFO L290 TraceCheckUtils]: 16: Hoare triple {1620#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {1620#false} is VALID [2022-02-20 14:03:05,811 INFO L290 TraceCheckUtils]: 17: Hoare triple {1620#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1620#false} is VALID [2022-02-20 14:03:05,811 INFO L290 TraceCheckUtils]: 18: Hoare triple {1620#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {1620#false} is VALID [2022-02-20 14:03:05,812 INFO L290 TraceCheckUtils]: 19: Hoare triple {1620#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1620#false} is VALID [2022-02-20 14:03:05,812 INFO L290 TraceCheckUtils]: 20: Hoare triple {1620#false} assume !(main_~i~0#1 < 100000); {1620#false} is VALID [2022-02-20 14:03:05,812 INFO L290 TraceCheckUtils]: 21: Hoare triple {1620#false} main_~i~0#1 := 0; {1620#false} is VALID [2022-02-20 14:03:05,812 INFO L290 TraceCheckUtils]: 22: Hoare triple {1620#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {1620#false} is VALID [2022-02-20 14:03:05,812 INFO L290 TraceCheckUtils]: 23: Hoare triple {1620#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1620#false} is VALID [2022-02-20 14:03:05,812 INFO L290 TraceCheckUtils]: 24: Hoare triple {1620#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {1620#false} is VALID [2022-02-20 14:03:05,812 INFO L290 TraceCheckUtils]: 25: Hoare triple {1620#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1620#false} is VALID [2022-02-20 14:03:05,812 INFO L290 TraceCheckUtils]: 26: Hoare triple {1620#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {1620#false} is VALID [2022-02-20 14:03:05,813 INFO L290 TraceCheckUtils]: 27: Hoare triple {1620#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1620#false} is VALID [2022-02-20 14:03:05,813 INFO L290 TraceCheckUtils]: 28: Hoare triple {1620#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {1620#false} is VALID [2022-02-20 14:03:05,813 INFO L290 TraceCheckUtils]: 29: Hoare triple {1620#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1620#false} is VALID [2022-02-20 14:03:05,813 INFO L290 TraceCheckUtils]: 30: Hoare triple {1620#false} assume !(main_~i~0#1 < 100000); {1620#false} is VALID [2022-02-20 14:03:05,814 INFO L290 TraceCheckUtils]: 31: Hoare triple {1620#false} main_~i~0#1 := 0; {1620#false} is VALID [2022-02-20 14:03:05,814 INFO L290 TraceCheckUtils]: 32: Hoare triple {1620#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {1620#false} is VALID [2022-02-20 14:03:05,814 INFO L290 TraceCheckUtils]: 33: Hoare triple {1620#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1620#false} is VALID [2022-02-20 14:03:05,814 INFO L290 TraceCheckUtils]: 34: Hoare triple {1620#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {1620#false} is VALID [2022-02-20 14:03:05,814 INFO L290 TraceCheckUtils]: 35: Hoare triple {1620#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1620#false} is VALID [2022-02-20 14:03:05,814 INFO L290 TraceCheckUtils]: 36: Hoare triple {1620#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {1620#false} is VALID [2022-02-20 14:03:05,815 INFO L290 TraceCheckUtils]: 37: Hoare triple {1620#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1620#false} is VALID [2022-02-20 14:03:05,815 INFO L290 TraceCheckUtils]: 38: Hoare triple {1620#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {1620#false} is VALID [2022-02-20 14:03:05,815 INFO L290 TraceCheckUtils]: 39: Hoare triple {1620#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1620#false} is VALID [2022-02-20 14:03:05,815 INFO L290 TraceCheckUtils]: 40: Hoare triple {1620#false} assume !(main_~i~0#1 < 100000); {1620#false} is VALID [2022-02-20 14:03:05,815 INFO L290 TraceCheckUtils]: 41: Hoare triple {1620#false} main_~i~0#1 := 0; {1620#false} is VALID [2022-02-20 14:03:05,815 INFO L290 TraceCheckUtils]: 42: Hoare triple {1620#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {1620#false} is VALID [2022-02-20 14:03:05,815 INFO L290 TraceCheckUtils]: 43: Hoare triple {1620#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {1620#false} is VALID [2022-02-20 14:03:05,815 INFO L290 TraceCheckUtils]: 44: Hoare triple {1620#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {1620#false} is VALID [2022-02-20 14:03:05,816 INFO L290 TraceCheckUtils]: 45: Hoare triple {1620#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {1620#false} is VALID [2022-02-20 14:03:05,816 INFO L290 TraceCheckUtils]: 46: Hoare triple {1620#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {1620#false} is VALID [2022-02-20 14:03:05,816 INFO L290 TraceCheckUtils]: 47: Hoare triple {1620#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {1620#false} is VALID [2022-02-20 14:03:05,816 INFO L290 TraceCheckUtils]: 48: Hoare triple {1620#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {1620#false} is VALID [2022-02-20 14:03:05,816 INFO L290 TraceCheckUtils]: 49: Hoare triple {1620#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {1620#false} is VALID [2022-02-20 14:03:05,816 INFO L290 TraceCheckUtils]: 50: Hoare triple {1620#false} assume !(main_~i~0#1 < 100000); {1620#false} is VALID [2022-02-20 14:03:05,816 INFO L290 TraceCheckUtils]: 51: Hoare triple {1620#false} main_~i~0#1 := 0; {1620#false} is VALID [2022-02-20 14:03:05,816 INFO L290 TraceCheckUtils]: 52: Hoare triple {1620#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {1620#false} is VALID [2022-02-20 14:03:05,817 INFO L290 TraceCheckUtils]: 53: Hoare triple {1620#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {1620#false} is VALID [2022-02-20 14:03:05,817 INFO L290 TraceCheckUtils]: 54: Hoare triple {1620#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {1620#false} is VALID [2022-02-20 14:03:05,817 INFO L290 TraceCheckUtils]: 55: Hoare triple {1620#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {1620#false} is VALID [2022-02-20 14:03:05,817 INFO L290 TraceCheckUtils]: 56: Hoare triple {1620#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {1620#false} is VALID [2022-02-20 14:03:05,817 INFO L290 TraceCheckUtils]: 57: Hoare triple {1620#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {1620#false} is VALID [2022-02-20 14:03:05,817 INFO L290 TraceCheckUtils]: 58: Hoare triple {1620#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {1620#false} is VALID [2022-02-20 14:03:05,817 INFO L290 TraceCheckUtils]: 59: Hoare triple {1620#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {1620#false} is VALID [2022-02-20 14:03:05,817 INFO L290 TraceCheckUtils]: 60: Hoare triple {1620#false} assume !(main_~i~0#1 < 100000); {1620#false} is VALID [2022-02-20 14:03:05,818 INFO L290 TraceCheckUtils]: 61: Hoare triple {1620#false} main_~i~0#1 := 0; {1620#false} is VALID [2022-02-20 14:03:05,818 INFO L290 TraceCheckUtils]: 62: Hoare triple {1620#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {1620#false} is VALID [2022-02-20 14:03:05,818 INFO L290 TraceCheckUtils]: 63: Hoare triple {1620#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {1620#false} is VALID [2022-02-20 14:03:05,818 INFO L290 TraceCheckUtils]: 64: Hoare triple {1620#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {1620#false} is VALID [2022-02-20 14:03:05,818 INFO L290 TraceCheckUtils]: 65: Hoare triple {1620#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {1620#false} is VALID [2022-02-20 14:03:05,818 INFO L290 TraceCheckUtils]: 66: Hoare triple {1620#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {1620#false} is VALID [2022-02-20 14:03:05,818 INFO L290 TraceCheckUtils]: 67: Hoare triple {1620#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {1620#false} is VALID [2022-02-20 14:03:05,818 INFO L290 TraceCheckUtils]: 68: Hoare triple {1620#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {1620#false} is VALID [2022-02-20 14:03:05,818 INFO L290 TraceCheckUtils]: 69: Hoare triple {1620#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {1620#false} is VALID [2022-02-20 14:03:05,819 INFO L290 TraceCheckUtils]: 70: Hoare triple {1620#false} assume !(main_~i~0#1 < 100000); {1620#false} is VALID [2022-02-20 14:03:05,819 INFO L290 TraceCheckUtils]: 71: Hoare triple {1620#false} havoc main_~x~0#1;main_~x~0#1 := 0; {1620#false} is VALID [2022-02-20 14:03:05,819 INFO L290 TraceCheckUtils]: 72: Hoare triple {1620#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem17#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem16#1 == main_#t~mem17#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1620#false} is VALID [2022-02-20 14:03:05,819 INFO L290 TraceCheckUtils]: 73: Hoare triple {1620#false} assume 0 == __VERIFIER_assert_~cond#1; {1620#false} is VALID [2022-02-20 14:03:05,819 INFO L290 TraceCheckUtils]: 74: Hoare triple {1620#false} assume !false; {1620#false} is VALID [2022-02-20 14:03:05,819 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-02-20 14:03:05,820 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:03:05,820 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125658532] [2022-02-20 14:03:05,820 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125658532] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:03:05,820 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912180525] [2022-02-20 14:03:05,820 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 14:03:05,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:03:05,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:03:05,821 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:03:05,823 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:03:06,311 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-02-20 14:03:06,312 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:03:06,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 14:03:06,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:03:06,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:03:06,551 INFO L290 TraceCheckUtils]: 0: Hoare triple {1619#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(26, 2); {1619#true} is VALID [2022-02-20 14:03:06,551 INFO L290 TraceCheckUtils]: 1: Hoare triple {1619#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_#t~mem4#1, main_#t~post3#1, main_#t~mem6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~post11#1, main_#t~mem14#1, main_#t~post13#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~post15#1, main_~#a1~0#1.base, main_~#a1~0#1.offset, main_~#a2~0#1.base, main_~#a2~0#1.offset, main_~#a3~0#1.base, main_~#a3~0#1.offset, main_~#a4~0#1.base, main_~#a4~0#1.offset, main_~#a5~0#1.base, main_~#a5~0#1.offset, main_~#a6~0#1.base, main_~#a6~0#1.offset, main_~#a7~0#1.base, main_~#a7~0#1.offset, main_~a~0#1, main_~i~0#1, main_~x~0#1;call main_~#a1~0#1.base, main_~#a1~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a2~0#1.base, main_~#a2~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a3~0#1.base, main_~#a3~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a4~0#1.base, main_~#a4~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a5~0#1.base, main_~#a5~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a6~0#1.base, main_~#a6~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a7~0#1.base, main_~#a7~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {1619#true} is VALID [2022-02-20 14:03:06,551 INFO L290 TraceCheckUtils]: 2: Hoare triple {1619#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {1619#true} is VALID [2022-02-20 14:03:06,551 INFO L290 TraceCheckUtils]: 3: Hoare triple {1619#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1619#true} is VALID [2022-02-20 14:03:06,551 INFO L290 TraceCheckUtils]: 4: Hoare triple {1619#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {1619#true} is VALID [2022-02-20 14:03:06,552 INFO L290 TraceCheckUtils]: 5: Hoare triple {1619#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1619#true} is VALID [2022-02-20 14:03:06,552 INFO L290 TraceCheckUtils]: 6: Hoare triple {1619#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {1619#true} is VALID [2022-02-20 14:03:06,552 INFO L290 TraceCheckUtils]: 7: Hoare triple {1619#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1619#true} is VALID [2022-02-20 14:03:06,552 INFO L290 TraceCheckUtils]: 8: Hoare triple {1619#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {1619#true} is VALID [2022-02-20 14:03:06,552 INFO L290 TraceCheckUtils]: 9: Hoare triple {1619#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1619#true} is VALID [2022-02-20 14:03:06,552 INFO L290 TraceCheckUtils]: 10: Hoare triple {1619#true} assume !(main_~a~0#1 < 100000); {1619#true} is VALID [2022-02-20 14:03:06,552 INFO L290 TraceCheckUtils]: 11: Hoare triple {1619#true} havoc main_~i~0#1;main_~i~0#1 := 0; {1619#true} is VALID [2022-02-20 14:03:06,552 INFO L290 TraceCheckUtils]: 12: Hoare triple {1619#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {1619#true} is VALID [2022-02-20 14:03:06,553 INFO L290 TraceCheckUtils]: 13: Hoare triple {1619#true} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1619#true} is VALID [2022-02-20 14:03:06,553 INFO L290 TraceCheckUtils]: 14: Hoare triple {1619#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {1619#true} is VALID [2022-02-20 14:03:06,553 INFO L290 TraceCheckUtils]: 15: Hoare triple {1619#true} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1619#true} is VALID [2022-02-20 14:03:06,553 INFO L290 TraceCheckUtils]: 16: Hoare triple {1619#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {1619#true} is VALID [2022-02-20 14:03:06,553 INFO L290 TraceCheckUtils]: 17: Hoare triple {1619#true} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1619#true} is VALID [2022-02-20 14:03:06,553 INFO L290 TraceCheckUtils]: 18: Hoare triple {1619#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {1619#true} is VALID [2022-02-20 14:03:06,553 INFO L290 TraceCheckUtils]: 19: Hoare triple {1619#true} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1619#true} is VALID [2022-02-20 14:03:06,553 INFO L290 TraceCheckUtils]: 20: Hoare triple {1619#true} assume !(main_~i~0#1 < 100000); {1619#true} is VALID [2022-02-20 14:03:06,554 INFO L290 TraceCheckUtils]: 21: Hoare triple {1619#true} main_~i~0#1 := 0; {1619#true} is VALID [2022-02-20 14:03:06,554 INFO L290 TraceCheckUtils]: 22: Hoare triple {1619#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {1619#true} is VALID [2022-02-20 14:03:06,554 INFO L290 TraceCheckUtils]: 23: Hoare triple {1619#true} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1619#true} is VALID [2022-02-20 14:03:06,554 INFO L290 TraceCheckUtils]: 24: Hoare triple {1619#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {1619#true} is VALID [2022-02-20 14:03:06,554 INFO L290 TraceCheckUtils]: 25: Hoare triple {1619#true} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1619#true} is VALID [2022-02-20 14:03:06,554 INFO L290 TraceCheckUtils]: 26: Hoare triple {1619#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {1619#true} is VALID [2022-02-20 14:03:06,554 INFO L290 TraceCheckUtils]: 27: Hoare triple {1619#true} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1619#true} is VALID [2022-02-20 14:03:06,554 INFO L290 TraceCheckUtils]: 28: Hoare triple {1619#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {1619#true} is VALID [2022-02-20 14:03:06,555 INFO L290 TraceCheckUtils]: 29: Hoare triple {1619#true} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1619#true} is VALID [2022-02-20 14:03:06,555 INFO L290 TraceCheckUtils]: 30: Hoare triple {1619#true} assume !(main_~i~0#1 < 100000); {1619#true} is VALID [2022-02-20 14:03:06,555 INFO L290 TraceCheckUtils]: 31: Hoare triple {1619#true} main_~i~0#1 := 0; {1619#true} is VALID [2022-02-20 14:03:06,555 INFO L290 TraceCheckUtils]: 32: Hoare triple {1619#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {1619#true} is VALID [2022-02-20 14:03:06,555 INFO L290 TraceCheckUtils]: 33: Hoare triple {1619#true} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1619#true} is VALID [2022-02-20 14:03:06,555 INFO L290 TraceCheckUtils]: 34: Hoare triple {1619#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {1619#true} is VALID [2022-02-20 14:03:06,555 INFO L290 TraceCheckUtils]: 35: Hoare triple {1619#true} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1619#true} is VALID [2022-02-20 14:03:06,555 INFO L290 TraceCheckUtils]: 36: Hoare triple {1619#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {1619#true} is VALID [2022-02-20 14:03:06,556 INFO L290 TraceCheckUtils]: 37: Hoare triple {1619#true} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1619#true} is VALID [2022-02-20 14:03:06,556 INFO L290 TraceCheckUtils]: 38: Hoare triple {1619#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {1619#true} is VALID [2022-02-20 14:03:06,556 INFO L290 TraceCheckUtils]: 39: Hoare triple {1619#true} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1619#true} is VALID [2022-02-20 14:03:06,556 INFO L290 TraceCheckUtils]: 40: Hoare triple {1619#true} assume !(main_~i~0#1 < 100000); {1619#true} is VALID [2022-02-20 14:03:06,556 INFO L290 TraceCheckUtils]: 41: Hoare triple {1619#true} main_~i~0#1 := 0; {1619#true} is VALID [2022-02-20 14:03:06,556 INFO L290 TraceCheckUtils]: 42: Hoare triple {1619#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {1619#true} is VALID [2022-02-20 14:03:06,556 INFO L290 TraceCheckUtils]: 43: Hoare triple {1619#true} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {1619#true} is VALID [2022-02-20 14:03:06,556 INFO L290 TraceCheckUtils]: 44: Hoare triple {1619#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {1619#true} is VALID [2022-02-20 14:03:06,556 INFO L290 TraceCheckUtils]: 45: Hoare triple {1619#true} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {1619#true} is VALID [2022-02-20 14:03:06,557 INFO L290 TraceCheckUtils]: 46: Hoare triple {1619#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {1619#true} is VALID [2022-02-20 14:03:06,557 INFO L290 TraceCheckUtils]: 47: Hoare triple {1619#true} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {1619#true} is VALID [2022-02-20 14:03:06,557 INFO L290 TraceCheckUtils]: 48: Hoare triple {1619#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {1619#true} is VALID [2022-02-20 14:03:06,557 INFO L290 TraceCheckUtils]: 49: Hoare triple {1619#true} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {1619#true} is VALID [2022-02-20 14:03:06,557 INFO L290 TraceCheckUtils]: 50: Hoare triple {1619#true} assume !(main_~i~0#1 < 100000); {1619#true} is VALID [2022-02-20 14:03:06,557 INFO L290 TraceCheckUtils]: 51: Hoare triple {1619#true} main_~i~0#1 := 0; {1619#true} is VALID [2022-02-20 14:03:06,557 INFO L290 TraceCheckUtils]: 52: Hoare triple {1619#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {1619#true} is VALID [2022-02-20 14:03:06,557 INFO L290 TraceCheckUtils]: 53: Hoare triple {1619#true} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {1619#true} is VALID [2022-02-20 14:03:06,558 INFO L290 TraceCheckUtils]: 54: Hoare triple {1619#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {1619#true} is VALID [2022-02-20 14:03:06,558 INFO L290 TraceCheckUtils]: 55: Hoare triple {1619#true} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {1619#true} is VALID [2022-02-20 14:03:06,558 INFO L290 TraceCheckUtils]: 56: Hoare triple {1619#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {1619#true} is VALID [2022-02-20 14:03:06,558 INFO L290 TraceCheckUtils]: 57: Hoare triple {1619#true} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {1619#true} is VALID [2022-02-20 14:03:06,558 INFO L290 TraceCheckUtils]: 58: Hoare triple {1619#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {1619#true} is VALID [2022-02-20 14:03:06,558 INFO L290 TraceCheckUtils]: 59: Hoare triple {1619#true} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {1619#true} is VALID [2022-02-20 14:03:06,558 INFO L290 TraceCheckUtils]: 60: Hoare triple {1619#true} assume !(main_~i~0#1 < 100000); {1619#true} is VALID [2022-02-20 14:03:06,559 INFO L290 TraceCheckUtils]: 61: Hoare triple {1619#true} main_~i~0#1 := 0; {1812#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:03:06,559 INFO L290 TraceCheckUtils]: 62: Hoare triple {1812#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {1812#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:03:06,560 INFO L290 TraceCheckUtils]: 63: Hoare triple {1812#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {1819#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:03:06,560 INFO L290 TraceCheckUtils]: 64: Hoare triple {1819#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {1819#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:03:06,560 INFO L290 TraceCheckUtils]: 65: Hoare triple {1819#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {1826#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:03:06,561 INFO L290 TraceCheckUtils]: 66: Hoare triple {1826#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {1826#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:03:06,561 INFO L290 TraceCheckUtils]: 67: Hoare triple {1826#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {1833#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:03:06,561 INFO L290 TraceCheckUtils]: 68: Hoare triple {1833#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {1833#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:03:06,562 INFO L290 TraceCheckUtils]: 69: Hoare triple {1833#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {1840#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:03:06,562 INFO L290 TraceCheckUtils]: 70: Hoare triple {1840#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !(main_~i~0#1 < 100000); {1620#false} is VALID [2022-02-20 14:03:06,562 INFO L290 TraceCheckUtils]: 71: Hoare triple {1620#false} havoc main_~x~0#1;main_~x~0#1 := 0; {1620#false} is VALID [2022-02-20 14:03:06,562 INFO L290 TraceCheckUtils]: 72: Hoare triple {1620#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem17#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem16#1 == main_#t~mem17#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1620#false} is VALID [2022-02-20 14:03:06,562 INFO L290 TraceCheckUtils]: 73: Hoare triple {1620#false} assume 0 == __VERIFIER_assert_~cond#1; {1620#false} is VALID [2022-02-20 14:03:06,563 INFO L290 TraceCheckUtils]: 74: Hoare triple {1620#false} assume !false; {1620#false} is VALID [2022-02-20 14:03:06,563 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-02-20 14:03:06,563 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:03:06,739 INFO L290 TraceCheckUtils]: 74: Hoare triple {1620#false} assume !false; {1620#false} is VALID [2022-02-20 14:03:06,740 INFO L290 TraceCheckUtils]: 73: Hoare triple {1620#false} assume 0 == __VERIFIER_assert_~cond#1; {1620#false} is VALID [2022-02-20 14:03:06,740 INFO L290 TraceCheckUtils]: 72: Hoare triple {1620#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem17#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem16#1 == main_#t~mem17#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1620#false} is VALID [2022-02-20 14:03:06,740 INFO L290 TraceCheckUtils]: 71: Hoare triple {1620#false} havoc main_~x~0#1;main_~x~0#1 := 0; {1620#false} is VALID [2022-02-20 14:03:06,740 INFO L290 TraceCheckUtils]: 70: Hoare triple {1868#(< |ULTIMATE.start_main_~i~0#1| 100000)} assume !(main_~i~0#1 < 100000); {1620#false} is VALID [2022-02-20 14:03:06,741 INFO L290 TraceCheckUtils]: 69: Hoare triple {1872#(< |ULTIMATE.start_main_~i~0#1| 99999)} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {1868#(< |ULTIMATE.start_main_~i~0#1| 100000)} is VALID [2022-02-20 14:03:06,741 INFO L290 TraceCheckUtils]: 68: Hoare triple {1872#(< |ULTIMATE.start_main_~i~0#1| 99999)} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {1872#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:03:06,742 INFO L290 TraceCheckUtils]: 67: Hoare triple {1879#(< |ULTIMATE.start_main_~i~0#1| 99998)} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {1872#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:03:06,742 INFO L290 TraceCheckUtils]: 66: Hoare triple {1879#(< |ULTIMATE.start_main_~i~0#1| 99998)} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {1879#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:03:06,742 INFO L290 TraceCheckUtils]: 65: Hoare triple {1886#(< |ULTIMATE.start_main_~i~0#1| 99997)} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {1879#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:03:06,743 INFO L290 TraceCheckUtils]: 64: Hoare triple {1886#(< |ULTIMATE.start_main_~i~0#1| 99997)} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {1886#(< |ULTIMATE.start_main_~i~0#1| 99997)} is VALID [2022-02-20 14:03:06,743 INFO L290 TraceCheckUtils]: 63: Hoare triple {1893#(< |ULTIMATE.start_main_~i~0#1| 99996)} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {1886#(< |ULTIMATE.start_main_~i~0#1| 99997)} is VALID [2022-02-20 14:03:06,743 INFO L290 TraceCheckUtils]: 62: Hoare triple {1893#(< |ULTIMATE.start_main_~i~0#1| 99996)} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {1893#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-20 14:03:06,744 INFO L290 TraceCheckUtils]: 61: Hoare triple {1619#true} main_~i~0#1 := 0; {1893#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-20 14:03:06,744 INFO L290 TraceCheckUtils]: 60: Hoare triple {1619#true} assume !(main_~i~0#1 < 100000); {1619#true} is VALID [2022-02-20 14:03:06,744 INFO L290 TraceCheckUtils]: 59: Hoare triple {1619#true} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {1619#true} is VALID [2022-02-20 14:03:06,744 INFO L290 TraceCheckUtils]: 58: Hoare triple {1619#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {1619#true} is VALID [2022-02-20 14:03:06,744 INFO L290 TraceCheckUtils]: 57: Hoare triple {1619#true} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {1619#true} is VALID [2022-02-20 14:03:06,744 INFO L290 TraceCheckUtils]: 56: Hoare triple {1619#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {1619#true} is VALID [2022-02-20 14:03:06,744 INFO L290 TraceCheckUtils]: 55: Hoare triple {1619#true} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {1619#true} is VALID [2022-02-20 14:03:06,745 INFO L290 TraceCheckUtils]: 54: Hoare triple {1619#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {1619#true} is VALID [2022-02-20 14:03:06,745 INFO L290 TraceCheckUtils]: 53: Hoare triple {1619#true} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {1619#true} is VALID [2022-02-20 14:03:06,745 INFO L290 TraceCheckUtils]: 52: Hoare triple {1619#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {1619#true} is VALID [2022-02-20 14:03:06,745 INFO L290 TraceCheckUtils]: 51: Hoare triple {1619#true} main_~i~0#1 := 0; {1619#true} is VALID [2022-02-20 14:03:06,745 INFO L290 TraceCheckUtils]: 50: Hoare triple {1619#true} assume !(main_~i~0#1 < 100000); {1619#true} is VALID [2022-02-20 14:03:06,745 INFO L290 TraceCheckUtils]: 49: Hoare triple {1619#true} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {1619#true} is VALID [2022-02-20 14:03:06,745 INFO L290 TraceCheckUtils]: 48: Hoare triple {1619#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {1619#true} is VALID [2022-02-20 14:03:06,745 INFO L290 TraceCheckUtils]: 47: Hoare triple {1619#true} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {1619#true} is VALID [2022-02-20 14:03:06,745 INFO L290 TraceCheckUtils]: 46: Hoare triple {1619#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {1619#true} is VALID [2022-02-20 14:03:06,746 INFO L290 TraceCheckUtils]: 45: Hoare triple {1619#true} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {1619#true} is VALID [2022-02-20 14:03:06,746 INFO L290 TraceCheckUtils]: 44: Hoare triple {1619#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {1619#true} is VALID [2022-02-20 14:03:06,746 INFO L290 TraceCheckUtils]: 43: Hoare triple {1619#true} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {1619#true} is VALID [2022-02-20 14:03:06,746 INFO L290 TraceCheckUtils]: 42: Hoare triple {1619#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {1619#true} is VALID [2022-02-20 14:03:06,746 INFO L290 TraceCheckUtils]: 41: Hoare triple {1619#true} main_~i~0#1 := 0; {1619#true} is VALID [2022-02-20 14:03:06,746 INFO L290 TraceCheckUtils]: 40: Hoare triple {1619#true} assume !(main_~i~0#1 < 100000); {1619#true} is VALID [2022-02-20 14:03:06,746 INFO L290 TraceCheckUtils]: 39: Hoare triple {1619#true} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1619#true} is VALID [2022-02-20 14:03:06,746 INFO L290 TraceCheckUtils]: 38: Hoare triple {1619#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {1619#true} is VALID [2022-02-20 14:03:06,747 INFO L290 TraceCheckUtils]: 37: Hoare triple {1619#true} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1619#true} is VALID [2022-02-20 14:03:06,747 INFO L290 TraceCheckUtils]: 36: Hoare triple {1619#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {1619#true} is VALID [2022-02-20 14:03:06,747 INFO L290 TraceCheckUtils]: 35: Hoare triple {1619#true} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1619#true} is VALID [2022-02-20 14:03:06,747 INFO L290 TraceCheckUtils]: 34: Hoare triple {1619#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {1619#true} is VALID [2022-02-20 14:03:06,747 INFO L290 TraceCheckUtils]: 33: Hoare triple {1619#true} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1619#true} is VALID [2022-02-20 14:03:06,747 INFO L290 TraceCheckUtils]: 32: Hoare triple {1619#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {1619#true} is VALID [2022-02-20 14:03:06,747 INFO L290 TraceCheckUtils]: 31: Hoare triple {1619#true} main_~i~0#1 := 0; {1619#true} is VALID [2022-02-20 14:03:06,747 INFO L290 TraceCheckUtils]: 30: Hoare triple {1619#true} assume !(main_~i~0#1 < 100000); {1619#true} is VALID [2022-02-20 14:03:06,747 INFO L290 TraceCheckUtils]: 29: Hoare triple {1619#true} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1619#true} is VALID [2022-02-20 14:03:06,748 INFO L290 TraceCheckUtils]: 28: Hoare triple {1619#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {1619#true} is VALID [2022-02-20 14:03:06,748 INFO L290 TraceCheckUtils]: 27: Hoare triple {1619#true} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1619#true} is VALID [2022-02-20 14:03:06,748 INFO L290 TraceCheckUtils]: 26: Hoare triple {1619#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {1619#true} is VALID [2022-02-20 14:03:06,748 INFO L290 TraceCheckUtils]: 25: Hoare triple {1619#true} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1619#true} is VALID [2022-02-20 14:03:06,748 INFO L290 TraceCheckUtils]: 24: Hoare triple {1619#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {1619#true} is VALID [2022-02-20 14:03:06,748 INFO L290 TraceCheckUtils]: 23: Hoare triple {1619#true} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1619#true} is VALID [2022-02-20 14:03:06,748 INFO L290 TraceCheckUtils]: 22: Hoare triple {1619#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {1619#true} is VALID [2022-02-20 14:03:06,748 INFO L290 TraceCheckUtils]: 21: Hoare triple {1619#true} main_~i~0#1 := 0; {1619#true} is VALID [2022-02-20 14:03:06,749 INFO L290 TraceCheckUtils]: 20: Hoare triple {1619#true} assume !(main_~i~0#1 < 100000); {1619#true} is VALID [2022-02-20 14:03:06,749 INFO L290 TraceCheckUtils]: 19: Hoare triple {1619#true} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1619#true} is VALID [2022-02-20 14:03:06,749 INFO L290 TraceCheckUtils]: 18: Hoare triple {1619#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {1619#true} is VALID [2022-02-20 14:03:06,749 INFO L290 TraceCheckUtils]: 17: Hoare triple {1619#true} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1619#true} is VALID [2022-02-20 14:03:06,749 INFO L290 TraceCheckUtils]: 16: Hoare triple {1619#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {1619#true} is VALID [2022-02-20 14:03:06,749 INFO L290 TraceCheckUtils]: 15: Hoare triple {1619#true} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1619#true} is VALID [2022-02-20 14:03:06,749 INFO L290 TraceCheckUtils]: 14: Hoare triple {1619#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {1619#true} is VALID [2022-02-20 14:03:06,749 INFO L290 TraceCheckUtils]: 13: Hoare triple {1619#true} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1619#true} is VALID [2022-02-20 14:03:06,749 INFO L290 TraceCheckUtils]: 12: Hoare triple {1619#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {1619#true} is VALID [2022-02-20 14:03:06,750 INFO L290 TraceCheckUtils]: 11: Hoare triple {1619#true} havoc main_~i~0#1;main_~i~0#1 := 0; {1619#true} is VALID [2022-02-20 14:03:06,750 INFO L290 TraceCheckUtils]: 10: Hoare triple {1619#true} assume !(main_~a~0#1 < 100000); {1619#true} is VALID [2022-02-20 14:03:06,750 INFO L290 TraceCheckUtils]: 9: Hoare triple {1619#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1619#true} is VALID [2022-02-20 14:03:06,750 INFO L290 TraceCheckUtils]: 8: Hoare triple {1619#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {1619#true} is VALID [2022-02-20 14:03:06,750 INFO L290 TraceCheckUtils]: 7: Hoare triple {1619#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1619#true} is VALID [2022-02-20 14:03:06,750 INFO L290 TraceCheckUtils]: 6: Hoare triple {1619#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {1619#true} is VALID [2022-02-20 14:03:06,750 INFO L290 TraceCheckUtils]: 5: Hoare triple {1619#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1619#true} is VALID [2022-02-20 14:03:06,751 INFO L290 TraceCheckUtils]: 4: Hoare triple {1619#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {1619#true} is VALID [2022-02-20 14:03:06,751 INFO L290 TraceCheckUtils]: 3: Hoare triple {1619#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1619#true} is VALID [2022-02-20 14:03:06,751 INFO L290 TraceCheckUtils]: 2: Hoare triple {1619#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {1619#true} is VALID [2022-02-20 14:03:06,751 INFO L290 TraceCheckUtils]: 1: Hoare triple {1619#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_#t~mem4#1, main_#t~post3#1, main_#t~mem6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~post11#1, main_#t~mem14#1, main_#t~post13#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~post15#1, main_~#a1~0#1.base, main_~#a1~0#1.offset, main_~#a2~0#1.base, main_~#a2~0#1.offset, main_~#a3~0#1.base, main_~#a3~0#1.offset, main_~#a4~0#1.base, main_~#a4~0#1.offset, main_~#a5~0#1.base, main_~#a5~0#1.offset, main_~#a6~0#1.base, main_~#a6~0#1.offset, main_~#a7~0#1.base, main_~#a7~0#1.offset, main_~a~0#1, main_~i~0#1, main_~x~0#1;call main_~#a1~0#1.base, main_~#a1~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a2~0#1.base, main_~#a2~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a3~0#1.base, main_~#a3~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a4~0#1.base, main_~#a4~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a5~0#1.base, main_~#a5~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a6~0#1.base, main_~#a6~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a7~0#1.base, main_~#a7~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {1619#true} is VALID [2022-02-20 14:03:06,751 INFO L290 TraceCheckUtils]: 0: Hoare triple {1619#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(26, 2); {1619#true} is VALID [2022-02-20 14:03:06,751 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-02-20 14:03:06,752 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1912180525] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:03:06,752 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:03:06,752 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-02-20 14:03:06,752 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052086332] [2022-02-20 14:03:06,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:03:06,753 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.882352941176471) internal successors, (83), 17 states have internal predecessors, (83), 0 states have call successors, (0), 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 75 [2022-02-20 14:03:06,753 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:03:06,753 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 4.882352941176471) internal successors, (83), 17 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have 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:03:06,812 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:03:06,812 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-02-20 14:03:06,812 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:03:06,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-02-20 14:03:06,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2022-02-20 14:03:06,813 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand has 17 states, 17 states have (on average 4.882352941176471) internal successors, (83), 17 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have 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:03:07,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:03:07,364 INFO L93 Difference]: Finished difference Result 220 states and 270 transitions. [2022-02-20 14:03:07,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-20 14:03:07,364 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.882352941176471) internal successors, (83), 17 states have internal predecessors, (83), 0 states have call successors, (0), 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 75 [2022-02-20 14:03:07,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:03:07,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 4.882352941176471) internal successors, (83), 17 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have 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:03:07,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 228 transitions. [2022-02-20 14:03:07,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 4.882352941176471) internal successors, (83), 17 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have 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:03:07,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 228 transitions. [2022-02-20 14:03:07,371 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 228 transitions. [2022-02-20 14:03:07,525 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 228 edges. 228 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:03:07,528 INFO L225 Difference]: With dead ends: 220 [2022-02-20 14:03:07,528 INFO L226 Difference]: Without dead ends: 153 [2022-02-20 14:03:07,529 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2022-02-20 14:03:07,529 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 120 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 14:03:07,530 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 78 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 14:03:07,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-02-20 14:03:07,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 152. [2022-02-20 14:03:07,592 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:03:07,593 INFO L82 GeneralOperation]: Start isEquivalent. First operand 153 states. Second operand has 152 states, 151 states have (on average 1.0529801324503312) internal successors, (159), 151 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have 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:03:07,593 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand has 152 states, 151 states have (on average 1.0529801324503312) internal successors, (159), 151 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have 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:03:07,594 INFO L87 Difference]: Start difference. First operand 153 states. Second operand has 152 states, 151 states have (on average 1.0529801324503312) internal successors, (159), 151 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have 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:03:07,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:03:07,599 INFO L93 Difference]: Finished difference Result 153 states and 160 transitions. [2022-02-20 14:03:07,599 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 160 transitions. [2022-02-20 14:03:07,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:03:07,603 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:03:07,603 INFO L74 IsIncluded]: Start isIncluded. First operand has 152 states, 151 states have (on average 1.0529801324503312) internal successors, (159), 151 states have internal predecessors, (159), 0 states have call successors, (0), 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 153 states. [2022-02-20 14:03:07,604 INFO L87 Difference]: Start difference. First operand has 152 states, 151 states have (on average 1.0529801324503312) internal successors, (159), 151 states have internal predecessors, (159), 0 states have call successors, (0), 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 153 states. [2022-02-20 14:03:07,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:03:07,608 INFO L93 Difference]: Finished difference Result 153 states and 160 transitions. [2022-02-20 14:03:07,608 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 160 transitions. [2022-02-20 14:03:07,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:03:07,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:03:07,609 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:03:07,609 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:03:07,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 151 states have (on average 1.0529801324503312) internal successors, (159), 151 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have 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:03:07,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 159 transitions. [2022-02-20 14:03:07,614 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 159 transitions. Word has length 75 [2022-02-20 14:03:07,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:03:07,614 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 159 transitions. [2022-02-20 14:03:07,614 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.882352941176471) internal successors, (83), 17 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have 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:03:07,614 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 159 transitions. [2022-02-20 14:03:07,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-02-20 14:03:07,617 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:03:07,617 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:03:07,656 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:03:07,829 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:03:07,830 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:03:07,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:03:07,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1455381425, now seen corresponding path program 4 times [2022-02-20 14:03:07,830 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:03:07,830 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838074546] [2022-02-20 14:03:07,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:03:07,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:03:07,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:03:08,036 INFO L290 TraceCheckUtils]: 0: Hoare triple {2937#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(26, 2); {2937#true} is VALID [2022-02-20 14:03:08,037 INFO L290 TraceCheckUtils]: 1: Hoare triple {2937#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_#t~mem4#1, main_#t~post3#1, main_#t~mem6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~post11#1, main_#t~mem14#1, main_#t~post13#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~post15#1, main_~#a1~0#1.base, main_~#a1~0#1.offset, main_~#a2~0#1.base, main_~#a2~0#1.offset, main_~#a3~0#1.base, main_~#a3~0#1.offset, main_~#a4~0#1.base, main_~#a4~0#1.offset, main_~#a5~0#1.base, main_~#a5~0#1.offset, main_~#a6~0#1.base, main_~#a6~0#1.offset, main_~#a7~0#1.base, main_~#a7~0#1.offset, main_~a~0#1, main_~i~0#1, main_~x~0#1;call main_~#a1~0#1.base, main_~#a1~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a2~0#1.base, main_~#a2~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a3~0#1.base, main_~#a3~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a4~0#1.base, main_~#a4~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a5~0#1.base, main_~#a5~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a6~0#1.base, main_~#a6~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a7~0#1.base, main_~#a7~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {2939#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:03:08,038 INFO L290 TraceCheckUtils]: 2: Hoare triple {2939#(= |ULTIMATE.start_main_~a~0#1| 0)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {2939#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:03:08,038 INFO L290 TraceCheckUtils]: 3: Hoare triple {2939#(= |ULTIMATE.start_main_~a~0#1| 0)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2940#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:03:08,038 INFO L290 TraceCheckUtils]: 4: Hoare triple {2940#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {2940#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:03:08,039 INFO L290 TraceCheckUtils]: 5: Hoare triple {2940#(<= |ULTIMATE.start_main_~a~0#1| 1)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2941#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-20 14:03:08,039 INFO L290 TraceCheckUtils]: 6: Hoare triple {2941#(<= |ULTIMATE.start_main_~a~0#1| 2)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {2941#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-20 14:03:08,039 INFO L290 TraceCheckUtils]: 7: Hoare triple {2941#(<= |ULTIMATE.start_main_~a~0#1| 2)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2942#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-20 14:03:08,040 INFO L290 TraceCheckUtils]: 8: Hoare triple {2942#(<= |ULTIMATE.start_main_~a~0#1| 3)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {2942#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-20 14:03:08,041 INFO L290 TraceCheckUtils]: 9: Hoare triple {2942#(<= |ULTIMATE.start_main_~a~0#1| 3)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2943#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-20 14:03:08,042 INFO L290 TraceCheckUtils]: 10: Hoare triple {2943#(<= |ULTIMATE.start_main_~a~0#1| 4)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {2943#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-20 14:03:08,042 INFO L290 TraceCheckUtils]: 11: Hoare triple {2943#(<= |ULTIMATE.start_main_~a~0#1| 4)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2944#(<= |ULTIMATE.start_main_~a~0#1| 5)} is VALID [2022-02-20 14:03:08,043 INFO L290 TraceCheckUtils]: 12: Hoare triple {2944#(<= |ULTIMATE.start_main_~a~0#1| 5)} assume !(main_~a~0#1 < 100000); {2938#false} is VALID [2022-02-20 14:03:08,043 INFO L290 TraceCheckUtils]: 13: Hoare triple {2938#false} havoc main_~i~0#1;main_~i~0#1 := 0; {2938#false} is VALID [2022-02-20 14:03:08,043 INFO L290 TraceCheckUtils]: 14: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {2938#false} is VALID [2022-02-20 14:03:08,043 INFO L290 TraceCheckUtils]: 15: Hoare triple {2938#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2938#false} is VALID [2022-02-20 14:03:08,043 INFO L290 TraceCheckUtils]: 16: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {2938#false} is VALID [2022-02-20 14:03:08,043 INFO L290 TraceCheckUtils]: 17: Hoare triple {2938#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2938#false} is VALID [2022-02-20 14:03:08,043 INFO L290 TraceCheckUtils]: 18: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {2938#false} is VALID [2022-02-20 14:03:08,043 INFO L290 TraceCheckUtils]: 19: Hoare triple {2938#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2938#false} is VALID [2022-02-20 14:03:08,043 INFO L290 TraceCheckUtils]: 20: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {2938#false} is VALID [2022-02-20 14:03:08,043 INFO L290 TraceCheckUtils]: 21: Hoare triple {2938#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2938#false} is VALID [2022-02-20 14:03:08,043 INFO L290 TraceCheckUtils]: 22: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {2938#false} is VALID [2022-02-20 14:03:08,043 INFO L290 TraceCheckUtils]: 23: Hoare triple {2938#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2938#false} is VALID [2022-02-20 14:03:08,043 INFO L290 TraceCheckUtils]: 24: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {2938#false} is VALID [2022-02-20 14:03:08,043 INFO L290 TraceCheckUtils]: 25: Hoare triple {2938#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2938#false} is VALID [2022-02-20 14:03:08,043 INFO L290 TraceCheckUtils]: 26: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {2938#false} is VALID [2022-02-20 14:03:08,044 INFO L290 TraceCheckUtils]: 27: Hoare triple {2938#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2938#false} is VALID [2022-02-20 14:03:08,044 INFO L290 TraceCheckUtils]: 28: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {2938#false} is VALID [2022-02-20 14:03:08,044 INFO L290 TraceCheckUtils]: 29: Hoare triple {2938#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2938#false} is VALID [2022-02-20 14:03:08,044 INFO L290 TraceCheckUtils]: 30: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {2938#false} is VALID [2022-02-20 14:03:08,044 INFO L290 TraceCheckUtils]: 31: Hoare triple {2938#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2938#false} is VALID [2022-02-20 14:03:08,044 INFO L290 TraceCheckUtils]: 32: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {2938#false} is VALID [2022-02-20 14:03:08,044 INFO L290 TraceCheckUtils]: 33: Hoare triple {2938#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2938#false} is VALID [2022-02-20 14:03:08,044 INFO L290 TraceCheckUtils]: 34: Hoare triple {2938#false} assume !(main_~i~0#1 < 100000); {2938#false} is VALID [2022-02-20 14:03:08,044 INFO L290 TraceCheckUtils]: 35: Hoare triple {2938#false} main_~i~0#1 := 0; {2938#false} is VALID [2022-02-20 14:03:08,044 INFO L290 TraceCheckUtils]: 36: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {2938#false} is VALID [2022-02-20 14:03:08,044 INFO L290 TraceCheckUtils]: 37: Hoare triple {2938#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2938#false} is VALID [2022-02-20 14:03:08,044 INFO L290 TraceCheckUtils]: 38: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {2938#false} is VALID [2022-02-20 14:03:08,044 INFO L290 TraceCheckUtils]: 39: Hoare triple {2938#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2938#false} is VALID [2022-02-20 14:03:08,044 INFO L290 TraceCheckUtils]: 40: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {2938#false} is VALID [2022-02-20 14:03:08,044 INFO L290 TraceCheckUtils]: 41: Hoare triple {2938#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2938#false} is VALID [2022-02-20 14:03:08,044 INFO L290 TraceCheckUtils]: 42: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {2938#false} is VALID [2022-02-20 14:03:08,044 INFO L290 TraceCheckUtils]: 43: Hoare triple {2938#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2938#false} is VALID [2022-02-20 14:03:08,044 INFO L290 TraceCheckUtils]: 44: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {2938#false} is VALID [2022-02-20 14:03:08,044 INFO L290 TraceCheckUtils]: 45: Hoare triple {2938#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2938#false} is VALID [2022-02-20 14:03:08,045 INFO L290 TraceCheckUtils]: 46: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {2938#false} is VALID [2022-02-20 14:03:08,045 INFO L290 TraceCheckUtils]: 47: Hoare triple {2938#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2938#false} is VALID [2022-02-20 14:03:08,045 INFO L290 TraceCheckUtils]: 48: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {2938#false} is VALID [2022-02-20 14:03:08,045 INFO L290 TraceCheckUtils]: 49: Hoare triple {2938#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2938#false} is VALID [2022-02-20 14:03:08,045 INFO L290 TraceCheckUtils]: 50: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {2938#false} is VALID [2022-02-20 14:03:08,045 INFO L290 TraceCheckUtils]: 51: Hoare triple {2938#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2938#false} is VALID [2022-02-20 14:03:08,045 INFO L290 TraceCheckUtils]: 52: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {2938#false} is VALID [2022-02-20 14:03:08,045 INFO L290 TraceCheckUtils]: 53: Hoare triple {2938#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2938#false} is VALID [2022-02-20 14:03:08,045 INFO L290 TraceCheckUtils]: 54: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {2938#false} is VALID [2022-02-20 14:03:08,045 INFO L290 TraceCheckUtils]: 55: Hoare triple {2938#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2938#false} is VALID [2022-02-20 14:03:08,045 INFO L290 TraceCheckUtils]: 56: Hoare triple {2938#false} assume !(main_~i~0#1 < 100000); {2938#false} is VALID [2022-02-20 14:03:08,045 INFO L290 TraceCheckUtils]: 57: Hoare triple {2938#false} main_~i~0#1 := 0; {2938#false} is VALID [2022-02-20 14:03:08,045 INFO L290 TraceCheckUtils]: 58: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {2938#false} is VALID [2022-02-20 14:03:08,045 INFO L290 TraceCheckUtils]: 59: Hoare triple {2938#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2938#false} is VALID [2022-02-20 14:03:08,045 INFO L290 TraceCheckUtils]: 60: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {2938#false} is VALID [2022-02-20 14:03:08,045 INFO L290 TraceCheckUtils]: 61: Hoare triple {2938#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2938#false} is VALID [2022-02-20 14:03:08,045 INFO L290 TraceCheckUtils]: 62: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {2938#false} is VALID [2022-02-20 14:03:08,045 INFO L290 TraceCheckUtils]: 63: Hoare triple {2938#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2938#false} is VALID [2022-02-20 14:03:08,046 INFO L290 TraceCheckUtils]: 64: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {2938#false} is VALID [2022-02-20 14:03:08,046 INFO L290 TraceCheckUtils]: 65: Hoare triple {2938#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2938#false} is VALID [2022-02-20 14:03:08,046 INFO L290 TraceCheckUtils]: 66: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {2938#false} is VALID [2022-02-20 14:03:08,046 INFO L290 TraceCheckUtils]: 67: Hoare triple {2938#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2938#false} is VALID [2022-02-20 14:03:08,046 INFO L290 TraceCheckUtils]: 68: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {2938#false} is VALID [2022-02-20 14:03:08,046 INFO L290 TraceCheckUtils]: 69: Hoare triple {2938#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2938#false} is VALID [2022-02-20 14:03:08,046 INFO L290 TraceCheckUtils]: 70: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {2938#false} is VALID [2022-02-20 14:03:08,046 INFO L290 TraceCheckUtils]: 71: Hoare triple {2938#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2938#false} is VALID [2022-02-20 14:03:08,046 INFO L290 TraceCheckUtils]: 72: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {2938#false} is VALID [2022-02-20 14:03:08,046 INFO L290 TraceCheckUtils]: 73: Hoare triple {2938#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2938#false} is VALID [2022-02-20 14:03:08,046 INFO L290 TraceCheckUtils]: 74: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {2938#false} is VALID [2022-02-20 14:03:08,046 INFO L290 TraceCheckUtils]: 75: Hoare triple {2938#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2938#false} is VALID [2022-02-20 14:03:08,046 INFO L290 TraceCheckUtils]: 76: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {2938#false} is VALID [2022-02-20 14:03:08,046 INFO L290 TraceCheckUtils]: 77: Hoare triple {2938#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2938#false} is VALID [2022-02-20 14:03:08,046 INFO L290 TraceCheckUtils]: 78: Hoare triple {2938#false} assume !(main_~i~0#1 < 100000); {2938#false} is VALID [2022-02-20 14:03:08,046 INFO L290 TraceCheckUtils]: 79: Hoare triple {2938#false} main_~i~0#1 := 0; {2938#false} is VALID [2022-02-20 14:03:08,047 INFO L290 TraceCheckUtils]: 80: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {2938#false} is VALID [2022-02-20 14:03:08,047 INFO L290 TraceCheckUtils]: 81: Hoare triple {2938#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {2938#false} is VALID [2022-02-20 14:03:08,047 INFO L290 TraceCheckUtils]: 82: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {2938#false} is VALID [2022-02-20 14:03:08,047 INFO L290 TraceCheckUtils]: 83: Hoare triple {2938#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {2938#false} is VALID [2022-02-20 14:03:08,047 INFO L290 TraceCheckUtils]: 84: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {2938#false} is VALID [2022-02-20 14:03:08,047 INFO L290 TraceCheckUtils]: 85: Hoare triple {2938#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {2938#false} is VALID [2022-02-20 14:03:08,047 INFO L290 TraceCheckUtils]: 86: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {2938#false} is VALID [2022-02-20 14:03:08,047 INFO L290 TraceCheckUtils]: 87: Hoare triple {2938#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {2938#false} is VALID [2022-02-20 14:03:08,047 INFO L290 TraceCheckUtils]: 88: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {2938#false} is VALID [2022-02-20 14:03:08,047 INFO L290 TraceCheckUtils]: 89: Hoare triple {2938#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {2938#false} is VALID [2022-02-20 14:03:08,047 INFO L290 TraceCheckUtils]: 90: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {2938#false} is VALID [2022-02-20 14:03:08,047 INFO L290 TraceCheckUtils]: 91: Hoare triple {2938#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {2938#false} is VALID [2022-02-20 14:03:08,047 INFO L290 TraceCheckUtils]: 92: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {2938#false} is VALID [2022-02-20 14:03:08,493 INFO L290 TraceCheckUtils]: 93: Hoare triple {2938#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {2938#false} is VALID [2022-02-20 14:03:08,493 INFO L290 TraceCheckUtils]: 94: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {2938#false} is VALID [2022-02-20 14:03:08,493 INFO L290 TraceCheckUtils]: 95: Hoare triple {2938#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {2938#false} is VALID [2022-02-20 14:03:08,493 INFO L290 TraceCheckUtils]: 96: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {2938#false} is VALID [2022-02-20 14:03:08,493 INFO L290 TraceCheckUtils]: 97: Hoare triple {2938#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {2938#false} is VALID [2022-02-20 14:03:08,493 INFO L290 TraceCheckUtils]: 98: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {2938#false} is VALID [2022-02-20 14:03:08,493 INFO L290 TraceCheckUtils]: 99: Hoare triple {2938#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {2938#false} is VALID [2022-02-20 14:03:08,493 INFO L290 TraceCheckUtils]: 100: Hoare triple {2938#false} assume !(main_~i~0#1 < 100000); {2938#false} is VALID [2022-02-20 14:03:08,494 INFO L290 TraceCheckUtils]: 101: Hoare triple {2938#false} main_~i~0#1 := 0; {2938#false} is VALID [2022-02-20 14:03:08,494 INFO L290 TraceCheckUtils]: 102: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {2938#false} is VALID [2022-02-20 14:03:08,494 INFO L290 TraceCheckUtils]: 103: Hoare triple {2938#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {2938#false} is VALID [2022-02-20 14:03:08,494 INFO L290 TraceCheckUtils]: 104: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {2938#false} is VALID [2022-02-20 14:03:08,494 INFO L290 TraceCheckUtils]: 105: Hoare triple {2938#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {2938#false} is VALID [2022-02-20 14:03:08,494 INFO L290 TraceCheckUtils]: 106: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {2938#false} is VALID [2022-02-20 14:03:08,494 INFO L290 TraceCheckUtils]: 107: Hoare triple {2938#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {2938#false} is VALID [2022-02-20 14:03:08,494 INFO L290 TraceCheckUtils]: 108: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {2938#false} is VALID [2022-02-20 14:03:08,494 INFO L290 TraceCheckUtils]: 109: Hoare triple {2938#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {2938#false} is VALID [2022-02-20 14:03:08,494 INFO L290 TraceCheckUtils]: 110: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {2938#false} is VALID [2022-02-20 14:03:08,494 INFO L290 TraceCheckUtils]: 111: Hoare triple {2938#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {2938#false} is VALID [2022-02-20 14:03:08,494 INFO L290 TraceCheckUtils]: 112: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {2938#false} is VALID [2022-02-20 14:03:08,494 INFO L290 TraceCheckUtils]: 113: Hoare triple {2938#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {2938#false} is VALID [2022-02-20 14:03:08,494 INFO L290 TraceCheckUtils]: 114: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {2938#false} is VALID [2022-02-20 14:03:08,494 INFO L290 TraceCheckUtils]: 115: Hoare triple {2938#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {2938#false} is VALID [2022-02-20 14:03:08,494 INFO L290 TraceCheckUtils]: 116: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {2938#false} is VALID [2022-02-20 14:03:08,494 INFO L290 TraceCheckUtils]: 117: Hoare triple {2938#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {2938#false} is VALID [2022-02-20 14:03:08,497 INFO L290 TraceCheckUtils]: 118: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {2938#false} is VALID [2022-02-20 14:03:08,497 INFO L290 TraceCheckUtils]: 119: Hoare triple {2938#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {2938#false} is VALID [2022-02-20 14:03:08,497 INFO L290 TraceCheckUtils]: 120: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {2938#false} is VALID [2022-02-20 14:03:08,497 INFO L290 TraceCheckUtils]: 121: Hoare triple {2938#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {2938#false} is VALID [2022-02-20 14:03:08,497 INFO L290 TraceCheckUtils]: 122: Hoare triple {2938#false} assume !(main_~i~0#1 < 100000); {2938#false} is VALID [2022-02-20 14:03:08,497 INFO L290 TraceCheckUtils]: 123: Hoare triple {2938#false} main_~i~0#1 := 0; {2938#false} is VALID [2022-02-20 14:03:08,497 INFO L290 TraceCheckUtils]: 124: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {2938#false} is VALID [2022-02-20 14:03:08,497 INFO L290 TraceCheckUtils]: 125: Hoare triple {2938#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {2938#false} is VALID [2022-02-20 14:03:08,497 INFO L290 TraceCheckUtils]: 126: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {2938#false} is VALID [2022-02-20 14:03:08,497 INFO L290 TraceCheckUtils]: 127: Hoare triple {2938#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {2938#false} is VALID [2022-02-20 14:03:08,497 INFO L290 TraceCheckUtils]: 128: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {2938#false} is VALID [2022-02-20 14:03:08,497 INFO L290 TraceCheckUtils]: 129: Hoare triple {2938#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {2938#false} is VALID [2022-02-20 14:03:08,497 INFO L290 TraceCheckUtils]: 130: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {2938#false} is VALID [2022-02-20 14:03:08,497 INFO L290 TraceCheckUtils]: 131: Hoare triple {2938#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {2938#false} is VALID [2022-02-20 14:03:08,497 INFO L290 TraceCheckUtils]: 132: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {2938#false} is VALID [2022-02-20 14:03:08,498 INFO L290 TraceCheckUtils]: 133: Hoare triple {2938#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {2938#false} is VALID [2022-02-20 14:03:08,498 INFO L290 TraceCheckUtils]: 134: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {2938#false} is VALID [2022-02-20 14:03:08,498 INFO L290 TraceCheckUtils]: 135: Hoare triple {2938#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {2938#false} is VALID [2022-02-20 14:03:08,498 INFO L290 TraceCheckUtils]: 136: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {2938#false} is VALID [2022-02-20 14:03:08,498 INFO L290 TraceCheckUtils]: 137: Hoare triple {2938#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {2938#false} is VALID [2022-02-20 14:03:08,498 INFO L290 TraceCheckUtils]: 138: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {2938#false} is VALID [2022-02-20 14:03:08,498 INFO L290 TraceCheckUtils]: 139: Hoare triple {2938#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {2938#false} is VALID [2022-02-20 14:03:08,498 INFO L290 TraceCheckUtils]: 140: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {2938#false} is VALID [2022-02-20 14:03:08,498 INFO L290 TraceCheckUtils]: 141: Hoare triple {2938#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {2938#false} is VALID [2022-02-20 14:03:08,498 INFO L290 TraceCheckUtils]: 142: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {2938#false} is VALID [2022-02-20 14:03:08,498 INFO L290 TraceCheckUtils]: 143: Hoare triple {2938#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {2938#false} is VALID [2022-02-20 14:03:08,498 INFO L290 TraceCheckUtils]: 144: Hoare triple {2938#false} assume !(main_~i~0#1 < 100000); {2938#false} is VALID [2022-02-20 14:03:08,498 INFO L290 TraceCheckUtils]: 145: Hoare triple {2938#false} havoc main_~x~0#1;main_~x~0#1 := 0; {2938#false} is VALID [2022-02-20 14:03:08,498 INFO L290 TraceCheckUtils]: 146: Hoare triple {2938#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem17#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem16#1 == main_#t~mem17#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2938#false} is VALID [2022-02-20 14:03:08,498 INFO L290 TraceCheckUtils]: 147: Hoare triple {2938#false} assume 0 == __VERIFIER_assert_~cond#1; {2938#false} is VALID [2022-02-20 14:03:08,498 INFO L290 TraceCheckUtils]: 148: Hoare triple {2938#false} assume !false; {2938#false} is VALID [2022-02-20 14:03:08,499 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2022-02-20 14:03:08,499 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:03:08,499 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838074546] [2022-02-20 14:03:08,499 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838074546] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:03:08,499 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [243335640] [2022-02-20 14:03:08,499 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-20 14:03:08,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:03:08,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:03:08,501 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:03:08,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-20 14:03:08,746 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-20 14:03:08,746 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:03:08,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 14:03:08,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:03:08,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:03:09,210 INFO L290 TraceCheckUtils]: 0: Hoare triple {2937#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(26, 2); {2937#true} is VALID [2022-02-20 14:03:09,213 INFO L290 TraceCheckUtils]: 1: Hoare triple {2937#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_#t~mem4#1, main_#t~post3#1, main_#t~mem6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~post11#1, main_#t~mem14#1, main_#t~post13#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~post15#1, main_~#a1~0#1.base, main_~#a1~0#1.offset, main_~#a2~0#1.base, main_~#a2~0#1.offset, main_~#a3~0#1.base, main_~#a3~0#1.offset, main_~#a4~0#1.base, main_~#a4~0#1.offset, main_~#a5~0#1.base, main_~#a5~0#1.offset, main_~#a6~0#1.base, main_~#a6~0#1.offset, main_~#a7~0#1.base, main_~#a7~0#1.offset, main_~a~0#1, main_~i~0#1, main_~x~0#1;call main_~#a1~0#1.base, main_~#a1~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a2~0#1.base, main_~#a2~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a3~0#1.base, main_~#a3~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a4~0#1.base, main_~#a4~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a5~0#1.base, main_~#a5~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a6~0#1.base, main_~#a6~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a7~0#1.base, main_~#a7~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {2951#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:03:09,214 INFO L290 TraceCheckUtils]: 2: Hoare triple {2951#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {2951#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:03:09,215 INFO L290 TraceCheckUtils]: 3: Hoare triple {2951#(<= |ULTIMATE.start_main_~a~0#1| 0)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2940#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:03:09,215 INFO L290 TraceCheckUtils]: 4: Hoare triple {2940#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {2940#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:03:09,216 INFO L290 TraceCheckUtils]: 5: Hoare triple {2940#(<= |ULTIMATE.start_main_~a~0#1| 1)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2941#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-20 14:03:09,216 INFO L290 TraceCheckUtils]: 6: Hoare triple {2941#(<= |ULTIMATE.start_main_~a~0#1| 2)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {2941#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-20 14:03:09,217 INFO L290 TraceCheckUtils]: 7: Hoare triple {2941#(<= |ULTIMATE.start_main_~a~0#1| 2)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2942#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-20 14:03:09,217 INFO L290 TraceCheckUtils]: 8: Hoare triple {2942#(<= |ULTIMATE.start_main_~a~0#1| 3)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {2942#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-20 14:03:09,218 INFO L290 TraceCheckUtils]: 9: Hoare triple {2942#(<= |ULTIMATE.start_main_~a~0#1| 3)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2943#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-20 14:03:09,218 INFO L290 TraceCheckUtils]: 10: Hoare triple {2943#(<= |ULTIMATE.start_main_~a~0#1| 4)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {2943#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-20 14:03:09,218 INFO L290 TraceCheckUtils]: 11: Hoare triple {2943#(<= |ULTIMATE.start_main_~a~0#1| 4)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2944#(<= |ULTIMATE.start_main_~a~0#1| 5)} is VALID [2022-02-20 14:03:09,219 INFO L290 TraceCheckUtils]: 12: Hoare triple {2944#(<= |ULTIMATE.start_main_~a~0#1| 5)} assume !(main_~a~0#1 < 100000); {2938#false} is VALID [2022-02-20 14:03:09,219 INFO L290 TraceCheckUtils]: 13: Hoare triple {2938#false} havoc main_~i~0#1;main_~i~0#1 := 0; {2938#false} is VALID [2022-02-20 14:03:09,219 INFO L290 TraceCheckUtils]: 14: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {2938#false} is VALID [2022-02-20 14:03:09,219 INFO L290 TraceCheckUtils]: 15: Hoare triple {2938#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2938#false} is VALID [2022-02-20 14:03:09,219 INFO L290 TraceCheckUtils]: 16: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {2938#false} is VALID [2022-02-20 14:03:09,219 INFO L290 TraceCheckUtils]: 17: Hoare triple {2938#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2938#false} is VALID [2022-02-20 14:03:09,219 INFO L290 TraceCheckUtils]: 18: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {2938#false} is VALID [2022-02-20 14:03:09,219 INFO L290 TraceCheckUtils]: 19: Hoare triple {2938#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2938#false} is VALID [2022-02-20 14:03:09,219 INFO L290 TraceCheckUtils]: 20: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {2938#false} is VALID [2022-02-20 14:03:09,220 INFO L290 TraceCheckUtils]: 21: Hoare triple {2938#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2938#false} is VALID [2022-02-20 14:03:09,220 INFO L290 TraceCheckUtils]: 22: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {2938#false} is VALID [2022-02-20 14:03:09,220 INFO L290 TraceCheckUtils]: 23: Hoare triple {2938#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2938#false} is VALID [2022-02-20 14:03:09,220 INFO L290 TraceCheckUtils]: 24: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {2938#false} is VALID [2022-02-20 14:03:09,220 INFO L290 TraceCheckUtils]: 25: Hoare triple {2938#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2938#false} is VALID [2022-02-20 14:03:09,220 INFO L290 TraceCheckUtils]: 26: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {2938#false} is VALID [2022-02-20 14:03:09,220 INFO L290 TraceCheckUtils]: 27: Hoare triple {2938#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2938#false} is VALID [2022-02-20 14:03:09,220 INFO L290 TraceCheckUtils]: 28: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {2938#false} is VALID [2022-02-20 14:03:09,220 INFO L290 TraceCheckUtils]: 29: Hoare triple {2938#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2938#false} is VALID [2022-02-20 14:03:09,220 INFO L290 TraceCheckUtils]: 30: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {2938#false} is VALID [2022-02-20 14:03:09,220 INFO L290 TraceCheckUtils]: 31: Hoare triple {2938#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2938#false} is VALID [2022-02-20 14:03:09,220 INFO L290 TraceCheckUtils]: 32: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {2938#false} is VALID [2022-02-20 14:03:09,220 INFO L290 TraceCheckUtils]: 33: Hoare triple {2938#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2938#false} is VALID [2022-02-20 14:03:09,220 INFO L290 TraceCheckUtils]: 34: Hoare triple {2938#false} assume !(main_~i~0#1 < 100000); {2938#false} is VALID [2022-02-20 14:03:09,221 INFO L290 TraceCheckUtils]: 35: Hoare triple {2938#false} main_~i~0#1 := 0; {2938#false} is VALID [2022-02-20 14:03:09,221 INFO L290 TraceCheckUtils]: 36: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {2938#false} is VALID [2022-02-20 14:03:09,221 INFO L290 TraceCheckUtils]: 37: Hoare triple {2938#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2938#false} is VALID [2022-02-20 14:03:09,221 INFO L290 TraceCheckUtils]: 38: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {2938#false} is VALID [2022-02-20 14:03:09,221 INFO L290 TraceCheckUtils]: 39: Hoare triple {2938#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2938#false} is VALID [2022-02-20 14:03:09,221 INFO L290 TraceCheckUtils]: 40: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {2938#false} is VALID [2022-02-20 14:03:09,221 INFO L290 TraceCheckUtils]: 41: Hoare triple {2938#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2938#false} is VALID [2022-02-20 14:03:09,221 INFO L290 TraceCheckUtils]: 42: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {2938#false} is VALID [2022-02-20 14:03:09,221 INFO L290 TraceCheckUtils]: 43: Hoare triple {2938#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2938#false} is VALID [2022-02-20 14:03:09,221 INFO L290 TraceCheckUtils]: 44: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {2938#false} is VALID [2022-02-20 14:03:09,221 INFO L290 TraceCheckUtils]: 45: Hoare triple {2938#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2938#false} is VALID [2022-02-20 14:03:09,221 INFO L290 TraceCheckUtils]: 46: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {2938#false} is VALID [2022-02-20 14:03:09,221 INFO L290 TraceCheckUtils]: 47: Hoare triple {2938#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2938#false} is VALID [2022-02-20 14:03:09,221 INFO L290 TraceCheckUtils]: 48: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {2938#false} is VALID [2022-02-20 14:03:09,222 INFO L290 TraceCheckUtils]: 49: Hoare triple {2938#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2938#false} is VALID [2022-02-20 14:03:09,222 INFO L290 TraceCheckUtils]: 50: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {2938#false} is VALID [2022-02-20 14:03:09,222 INFO L290 TraceCheckUtils]: 51: Hoare triple {2938#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2938#false} is VALID [2022-02-20 14:03:09,222 INFO L290 TraceCheckUtils]: 52: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {2938#false} is VALID [2022-02-20 14:03:09,251 INFO L290 TraceCheckUtils]: 53: Hoare triple {2938#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2938#false} is VALID [2022-02-20 14:03:09,252 INFO L290 TraceCheckUtils]: 54: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {2938#false} is VALID [2022-02-20 14:03:09,252 INFO L290 TraceCheckUtils]: 55: Hoare triple {2938#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2938#false} is VALID [2022-02-20 14:03:09,252 INFO L290 TraceCheckUtils]: 56: Hoare triple {2938#false} assume !(main_~i~0#1 < 100000); {2938#false} is VALID [2022-02-20 14:03:09,252 INFO L290 TraceCheckUtils]: 57: Hoare triple {2938#false} main_~i~0#1 := 0; {2938#false} is VALID [2022-02-20 14:03:09,252 INFO L290 TraceCheckUtils]: 58: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {2938#false} is VALID [2022-02-20 14:03:09,252 INFO L290 TraceCheckUtils]: 59: Hoare triple {2938#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2938#false} is VALID [2022-02-20 14:03:09,252 INFO L290 TraceCheckUtils]: 60: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {2938#false} is VALID [2022-02-20 14:03:09,253 INFO L290 TraceCheckUtils]: 61: Hoare triple {2938#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2938#false} is VALID [2022-02-20 14:03:09,253 INFO L290 TraceCheckUtils]: 62: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {2938#false} is VALID [2022-02-20 14:03:09,253 INFO L290 TraceCheckUtils]: 63: Hoare triple {2938#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2938#false} is VALID [2022-02-20 14:03:09,253 INFO L290 TraceCheckUtils]: 64: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {2938#false} is VALID [2022-02-20 14:03:09,253 INFO L290 TraceCheckUtils]: 65: Hoare triple {2938#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2938#false} is VALID [2022-02-20 14:03:09,253 INFO L290 TraceCheckUtils]: 66: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {2938#false} is VALID [2022-02-20 14:03:09,253 INFO L290 TraceCheckUtils]: 67: Hoare triple {2938#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2938#false} is VALID [2022-02-20 14:03:09,253 INFO L290 TraceCheckUtils]: 68: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {2938#false} is VALID [2022-02-20 14:03:09,254 INFO L290 TraceCheckUtils]: 69: Hoare triple {2938#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2938#false} is VALID [2022-02-20 14:03:09,254 INFO L290 TraceCheckUtils]: 70: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {2938#false} is VALID [2022-02-20 14:03:09,254 INFO L290 TraceCheckUtils]: 71: Hoare triple {2938#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2938#false} is VALID [2022-02-20 14:03:09,254 INFO L290 TraceCheckUtils]: 72: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {2938#false} is VALID [2022-02-20 14:03:09,254 INFO L290 TraceCheckUtils]: 73: Hoare triple {2938#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2938#false} is VALID [2022-02-20 14:03:09,254 INFO L290 TraceCheckUtils]: 74: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {2938#false} is VALID [2022-02-20 14:03:09,254 INFO L290 TraceCheckUtils]: 75: Hoare triple {2938#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2938#false} is VALID [2022-02-20 14:03:09,255 INFO L290 TraceCheckUtils]: 76: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {2938#false} is VALID [2022-02-20 14:03:09,255 INFO L290 TraceCheckUtils]: 77: Hoare triple {2938#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2938#false} is VALID [2022-02-20 14:03:09,255 INFO L290 TraceCheckUtils]: 78: Hoare triple {2938#false} assume !(main_~i~0#1 < 100000); {2938#false} is VALID [2022-02-20 14:03:09,255 INFO L290 TraceCheckUtils]: 79: Hoare triple {2938#false} main_~i~0#1 := 0; {2938#false} is VALID [2022-02-20 14:03:09,255 INFO L290 TraceCheckUtils]: 80: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {2938#false} is VALID [2022-02-20 14:03:09,255 INFO L290 TraceCheckUtils]: 81: Hoare triple {2938#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {2938#false} is VALID [2022-02-20 14:03:09,255 INFO L290 TraceCheckUtils]: 82: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {2938#false} is VALID [2022-02-20 14:03:09,255 INFO L290 TraceCheckUtils]: 83: Hoare triple {2938#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {2938#false} is VALID [2022-02-20 14:03:09,256 INFO L290 TraceCheckUtils]: 84: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {2938#false} is VALID [2022-02-20 14:03:09,256 INFO L290 TraceCheckUtils]: 85: Hoare triple {2938#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {2938#false} is VALID [2022-02-20 14:03:09,256 INFO L290 TraceCheckUtils]: 86: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {2938#false} is VALID [2022-02-20 14:03:09,256 INFO L290 TraceCheckUtils]: 87: Hoare triple {2938#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {2938#false} is VALID [2022-02-20 14:03:09,256 INFO L290 TraceCheckUtils]: 88: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {2938#false} is VALID [2022-02-20 14:03:09,256 INFO L290 TraceCheckUtils]: 89: Hoare triple {2938#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {2938#false} is VALID [2022-02-20 14:03:09,256 INFO L290 TraceCheckUtils]: 90: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {2938#false} is VALID [2022-02-20 14:03:09,257 INFO L290 TraceCheckUtils]: 91: Hoare triple {2938#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {2938#false} is VALID [2022-02-20 14:03:09,257 INFO L290 TraceCheckUtils]: 92: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {2938#false} is VALID [2022-02-20 14:03:09,257 INFO L290 TraceCheckUtils]: 93: Hoare triple {2938#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {2938#false} is VALID [2022-02-20 14:03:09,257 INFO L290 TraceCheckUtils]: 94: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {2938#false} is VALID [2022-02-20 14:03:09,257 INFO L290 TraceCheckUtils]: 95: Hoare triple {2938#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {2938#false} is VALID [2022-02-20 14:03:09,257 INFO L290 TraceCheckUtils]: 96: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {2938#false} is VALID [2022-02-20 14:03:09,257 INFO L290 TraceCheckUtils]: 97: Hoare triple {2938#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {2938#false} is VALID [2022-02-20 14:03:09,258 INFO L290 TraceCheckUtils]: 98: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {2938#false} is VALID [2022-02-20 14:03:09,258 INFO L290 TraceCheckUtils]: 99: Hoare triple {2938#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {2938#false} is VALID [2022-02-20 14:03:09,258 INFO L290 TraceCheckUtils]: 100: Hoare triple {2938#false} assume !(main_~i~0#1 < 100000); {2938#false} is VALID [2022-02-20 14:03:09,258 INFO L290 TraceCheckUtils]: 101: Hoare triple {2938#false} main_~i~0#1 := 0; {2938#false} is VALID [2022-02-20 14:03:09,258 INFO L290 TraceCheckUtils]: 102: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {2938#false} is VALID [2022-02-20 14:03:09,263 INFO L290 TraceCheckUtils]: 103: Hoare triple {2938#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {2938#false} is VALID [2022-02-20 14:03:09,263 INFO L290 TraceCheckUtils]: 104: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {2938#false} is VALID [2022-02-20 14:03:09,264 INFO L290 TraceCheckUtils]: 105: Hoare triple {2938#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {2938#false} is VALID [2022-02-20 14:03:09,264 INFO L290 TraceCheckUtils]: 106: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {2938#false} is VALID [2022-02-20 14:03:09,264 INFO L290 TraceCheckUtils]: 107: Hoare triple {2938#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {2938#false} is VALID [2022-02-20 14:03:09,264 INFO L290 TraceCheckUtils]: 108: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {2938#false} is VALID [2022-02-20 14:03:09,264 INFO L290 TraceCheckUtils]: 109: Hoare triple {2938#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {2938#false} is VALID [2022-02-20 14:03:09,264 INFO L290 TraceCheckUtils]: 110: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {2938#false} is VALID [2022-02-20 14:03:09,264 INFO L290 TraceCheckUtils]: 111: Hoare triple {2938#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {2938#false} is VALID [2022-02-20 14:03:09,264 INFO L290 TraceCheckUtils]: 112: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {2938#false} is VALID [2022-02-20 14:03:09,265 INFO L290 TraceCheckUtils]: 113: Hoare triple {2938#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {2938#false} is VALID [2022-02-20 14:03:09,265 INFO L290 TraceCheckUtils]: 114: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {2938#false} is VALID [2022-02-20 14:03:09,265 INFO L290 TraceCheckUtils]: 115: Hoare triple {2938#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {2938#false} is VALID [2022-02-20 14:03:09,265 INFO L290 TraceCheckUtils]: 116: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {2938#false} is VALID [2022-02-20 14:03:09,265 INFO L290 TraceCheckUtils]: 117: Hoare triple {2938#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {2938#false} is VALID [2022-02-20 14:03:09,265 INFO L290 TraceCheckUtils]: 118: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {2938#false} is VALID [2022-02-20 14:03:09,265 INFO L290 TraceCheckUtils]: 119: Hoare triple {2938#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {2938#false} is VALID [2022-02-20 14:03:09,265 INFO L290 TraceCheckUtils]: 120: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {2938#false} is VALID [2022-02-20 14:03:09,266 INFO L290 TraceCheckUtils]: 121: Hoare triple {2938#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {2938#false} is VALID [2022-02-20 14:03:09,266 INFO L290 TraceCheckUtils]: 122: Hoare triple {2938#false} assume !(main_~i~0#1 < 100000); {2938#false} is VALID [2022-02-20 14:03:09,266 INFO L290 TraceCheckUtils]: 123: Hoare triple {2938#false} main_~i~0#1 := 0; {2938#false} is VALID [2022-02-20 14:03:09,266 INFO L290 TraceCheckUtils]: 124: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {2938#false} is VALID [2022-02-20 14:03:09,266 INFO L290 TraceCheckUtils]: 125: Hoare triple {2938#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {2938#false} is VALID [2022-02-20 14:03:09,266 INFO L290 TraceCheckUtils]: 126: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {2938#false} is VALID [2022-02-20 14:03:09,266 INFO L290 TraceCheckUtils]: 127: Hoare triple {2938#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {2938#false} is VALID [2022-02-20 14:03:09,267 INFO L290 TraceCheckUtils]: 128: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {2938#false} is VALID [2022-02-20 14:03:09,267 INFO L290 TraceCheckUtils]: 129: Hoare triple {2938#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {2938#false} is VALID [2022-02-20 14:03:09,267 INFO L290 TraceCheckUtils]: 130: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {2938#false} is VALID [2022-02-20 14:03:09,267 INFO L290 TraceCheckUtils]: 131: Hoare triple {2938#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {2938#false} is VALID [2022-02-20 14:03:09,267 INFO L290 TraceCheckUtils]: 132: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {2938#false} is VALID [2022-02-20 14:03:09,267 INFO L290 TraceCheckUtils]: 133: Hoare triple {2938#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {2938#false} is VALID [2022-02-20 14:03:09,267 INFO L290 TraceCheckUtils]: 134: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {2938#false} is VALID [2022-02-20 14:03:09,268 INFO L290 TraceCheckUtils]: 135: Hoare triple {2938#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {2938#false} is VALID [2022-02-20 14:03:09,268 INFO L290 TraceCheckUtils]: 136: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {2938#false} is VALID [2022-02-20 14:03:09,268 INFO L290 TraceCheckUtils]: 137: Hoare triple {2938#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {2938#false} is VALID [2022-02-20 14:03:09,268 INFO L290 TraceCheckUtils]: 138: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {2938#false} is VALID [2022-02-20 14:03:09,268 INFO L290 TraceCheckUtils]: 139: Hoare triple {2938#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {2938#false} is VALID [2022-02-20 14:03:09,268 INFO L290 TraceCheckUtils]: 140: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {2938#false} is VALID [2022-02-20 14:03:09,268 INFO L290 TraceCheckUtils]: 141: Hoare triple {2938#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {2938#false} is VALID [2022-02-20 14:03:09,268 INFO L290 TraceCheckUtils]: 142: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {2938#false} is VALID [2022-02-20 14:03:09,269 INFO L290 TraceCheckUtils]: 143: Hoare triple {2938#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {2938#false} is VALID [2022-02-20 14:03:09,269 INFO L290 TraceCheckUtils]: 144: Hoare triple {2938#false} assume !(main_~i~0#1 < 100000); {2938#false} is VALID [2022-02-20 14:03:09,269 INFO L290 TraceCheckUtils]: 145: Hoare triple {2938#false} havoc main_~x~0#1;main_~x~0#1 := 0; {2938#false} is VALID [2022-02-20 14:03:09,269 INFO L290 TraceCheckUtils]: 146: Hoare triple {2938#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem17#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem16#1 == main_#t~mem17#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2938#false} is VALID [2022-02-20 14:03:09,269 INFO L290 TraceCheckUtils]: 147: Hoare triple {2938#false} assume 0 == __VERIFIER_assert_~cond#1; {2938#false} is VALID [2022-02-20 14:03:09,269 INFO L290 TraceCheckUtils]: 148: Hoare triple {2938#false} assume !false; {2938#false} is VALID [2022-02-20 14:03:09,270 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2022-02-20 14:03:09,270 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:03:09,717 INFO L290 TraceCheckUtils]: 148: Hoare triple {2938#false} assume !false; {2938#false} is VALID [2022-02-20 14:03:09,718 INFO L290 TraceCheckUtils]: 147: Hoare triple {2938#false} assume 0 == __VERIFIER_assert_~cond#1; {2938#false} is VALID [2022-02-20 14:03:09,718 INFO L290 TraceCheckUtils]: 146: Hoare triple {2938#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem17#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem16#1 == main_#t~mem17#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2938#false} is VALID [2022-02-20 14:03:09,718 INFO L290 TraceCheckUtils]: 145: Hoare triple {2938#false} havoc main_~x~0#1;main_~x~0#1 := 0; {2938#false} is VALID [2022-02-20 14:03:09,718 INFO L290 TraceCheckUtils]: 144: Hoare triple {2938#false} assume !(main_~i~0#1 < 100000); {2938#false} is VALID [2022-02-20 14:03:09,718 INFO L290 TraceCheckUtils]: 143: Hoare triple {2938#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {2938#false} is VALID [2022-02-20 14:03:09,718 INFO L290 TraceCheckUtils]: 142: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {2938#false} is VALID [2022-02-20 14:03:09,718 INFO L290 TraceCheckUtils]: 141: Hoare triple {2938#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {2938#false} is VALID [2022-02-20 14:03:09,718 INFO L290 TraceCheckUtils]: 140: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {2938#false} is VALID [2022-02-20 14:03:09,719 INFO L290 TraceCheckUtils]: 139: Hoare triple {2938#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {2938#false} is VALID [2022-02-20 14:03:09,719 INFO L290 TraceCheckUtils]: 138: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {2938#false} is VALID [2022-02-20 14:03:09,719 INFO L290 TraceCheckUtils]: 137: Hoare triple {2938#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {2938#false} is VALID [2022-02-20 14:03:09,719 INFO L290 TraceCheckUtils]: 136: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {2938#false} is VALID [2022-02-20 14:03:09,719 INFO L290 TraceCheckUtils]: 135: Hoare triple {2938#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {2938#false} is VALID [2022-02-20 14:03:09,719 INFO L290 TraceCheckUtils]: 134: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {2938#false} is VALID [2022-02-20 14:03:09,719 INFO L290 TraceCheckUtils]: 133: Hoare triple {2938#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {2938#false} is VALID [2022-02-20 14:03:09,719 INFO L290 TraceCheckUtils]: 132: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {2938#false} is VALID [2022-02-20 14:03:09,719 INFO L290 TraceCheckUtils]: 131: Hoare triple {2938#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {2938#false} is VALID [2022-02-20 14:03:09,720 INFO L290 TraceCheckUtils]: 130: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {2938#false} is VALID [2022-02-20 14:03:09,720 INFO L290 TraceCheckUtils]: 129: Hoare triple {2938#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {2938#false} is VALID [2022-02-20 14:03:09,720 INFO L290 TraceCheckUtils]: 128: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {2938#false} is VALID [2022-02-20 14:03:09,720 INFO L290 TraceCheckUtils]: 127: Hoare triple {2938#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {2938#false} is VALID [2022-02-20 14:03:09,720 INFO L290 TraceCheckUtils]: 126: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {2938#false} is VALID [2022-02-20 14:03:09,720 INFO L290 TraceCheckUtils]: 125: Hoare triple {2938#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {2938#false} is VALID [2022-02-20 14:03:09,720 INFO L290 TraceCheckUtils]: 124: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {2938#false} is VALID [2022-02-20 14:03:09,720 INFO L290 TraceCheckUtils]: 123: Hoare triple {2938#false} main_~i~0#1 := 0; {2938#false} is VALID [2022-02-20 14:03:09,720 INFO L290 TraceCheckUtils]: 122: Hoare triple {2938#false} assume !(main_~i~0#1 < 100000); {2938#false} is VALID [2022-02-20 14:03:09,721 INFO L290 TraceCheckUtils]: 121: Hoare triple {2938#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {2938#false} is VALID [2022-02-20 14:03:09,721 INFO L290 TraceCheckUtils]: 120: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {2938#false} is VALID [2022-02-20 14:03:09,721 INFO L290 TraceCheckUtils]: 119: Hoare triple {2938#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {2938#false} is VALID [2022-02-20 14:03:09,721 INFO L290 TraceCheckUtils]: 118: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {2938#false} is VALID [2022-02-20 14:03:09,721 INFO L290 TraceCheckUtils]: 117: Hoare triple {2938#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {2938#false} is VALID [2022-02-20 14:03:09,721 INFO L290 TraceCheckUtils]: 116: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {2938#false} is VALID [2022-02-20 14:03:09,721 INFO L290 TraceCheckUtils]: 115: Hoare triple {2938#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {2938#false} is VALID [2022-02-20 14:03:09,721 INFO L290 TraceCheckUtils]: 114: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {2938#false} is VALID [2022-02-20 14:03:09,721 INFO L290 TraceCheckUtils]: 113: Hoare triple {2938#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {2938#false} is VALID [2022-02-20 14:03:09,722 INFO L290 TraceCheckUtils]: 112: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {2938#false} is VALID [2022-02-20 14:03:09,722 INFO L290 TraceCheckUtils]: 111: Hoare triple {2938#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {2938#false} is VALID [2022-02-20 14:03:09,722 INFO L290 TraceCheckUtils]: 110: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {2938#false} is VALID [2022-02-20 14:03:09,722 INFO L290 TraceCheckUtils]: 109: Hoare triple {2938#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {2938#false} is VALID [2022-02-20 14:03:09,722 INFO L290 TraceCheckUtils]: 108: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {2938#false} is VALID [2022-02-20 14:03:09,722 INFO L290 TraceCheckUtils]: 107: Hoare triple {2938#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {2938#false} is VALID [2022-02-20 14:03:09,722 INFO L290 TraceCheckUtils]: 106: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {2938#false} is VALID [2022-02-20 14:03:09,722 INFO L290 TraceCheckUtils]: 105: Hoare triple {2938#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {2938#false} is VALID [2022-02-20 14:03:09,722 INFO L290 TraceCheckUtils]: 104: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {2938#false} is VALID [2022-02-20 14:03:09,723 INFO L290 TraceCheckUtils]: 103: Hoare triple {2938#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {2938#false} is VALID [2022-02-20 14:03:09,723 INFO L290 TraceCheckUtils]: 102: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {2938#false} is VALID [2022-02-20 14:03:09,723 INFO L290 TraceCheckUtils]: 101: Hoare triple {2938#false} main_~i~0#1 := 0; {2938#false} is VALID [2022-02-20 14:03:09,723 INFO L290 TraceCheckUtils]: 100: Hoare triple {2938#false} assume !(main_~i~0#1 < 100000); {2938#false} is VALID [2022-02-20 14:03:09,723 INFO L290 TraceCheckUtils]: 99: Hoare triple {2938#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {2938#false} is VALID [2022-02-20 14:03:09,723 INFO L290 TraceCheckUtils]: 98: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {2938#false} is VALID [2022-02-20 14:03:09,723 INFO L290 TraceCheckUtils]: 97: Hoare triple {2938#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {2938#false} is VALID [2022-02-20 14:03:09,723 INFO L290 TraceCheckUtils]: 96: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {2938#false} is VALID [2022-02-20 14:03:09,723 INFO L290 TraceCheckUtils]: 95: Hoare triple {2938#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {2938#false} is VALID [2022-02-20 14:03:09,724 INFO L290 TraceCheckUtils]: 94: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {2938#false} is VALID [2022-02-20 14:03:09,724 INFO L290 TraceCheckUtils]: 93: Hoare triple {2938#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {2938#false} is VALID [2022-02-20 14:03:09,724 INFO L290 TraceCheckUtils]: 92: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {2938#false} is VALID [2022-02-20 14:03:09,724 INFO L290 TraceCheckUtils]: 91: Hoare triple {2938#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {2938#false} is VALID [2022-02-20 14:03:09,724 INFO L290 TraceCheckUtils]: 90: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {2938#false} is VALID [2022-02-20 14:03:09,724 INFO L290 TraceCheckUtils]: 89: Hoare triple {2938#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {2938#false} is VALID [2022-02-20 14:03:09,724 INFO L290 TraceCheckUtils]: 88: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {2938#false} is VALID [2022-02-20 14:03:09,724 INFO L290 TraceCheckUtils]: 87: Hoare triple {2938#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {2938#false} is VALID [2022-02-20 14:03:09,724 INFO L290 TraceCheckUtils]: 86: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {2938#false} is VALID [2022-02-20 14:03:09,725 INFO L290 TraceCheckUtils]: 85: Hoare triple {2938#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {2938#false} is VALID [2022-02-20 14:03:09,725 INFO L290 TraceCheckUtils]: 84: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {2938#false} is VALID [2022-02-20 14:03:09,725 INFO L290 TraceCheckUtils]: 83: Hoare triple {2938#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {2938#false} is VALID [2022-02-20 14:03:09,725 INFO L290 TraceCheckUtils]: 82: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {2938#false} is VALID [2022-02-20 14:03:09,725 INFO L290 TraceCheckUtils]: 81: Hoare triple {2938#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {2938#false} is VALID [2022-02-20 14:03:09,725 INFO L290 TraceCheckUtils]: 80: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {2938#false} is VALID [2022-02-20 14:03:09,725 INFO L290 TraceCheckUtils]: 79: Hoare triple {2938#false} main_~i~0#1 := 0; {2938#false} is VALID [2022-02-20 14:03:09,725 INFO L290 TraceCheckUtils]: 78: Hoare triple {2938#false} assume !(main_~i~0#1 < 100000); {2938#false} is VALID [2022-02-20 14:03:09,725 INFO L290 TraceCheckUtils]: 77: Hoare triple {2938#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2938#false} is VALID [2022-02-20 14:03:09,726 INFO L290 TraceCheckUtils]: 76: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {2938#false} is VALID [2022-02-20 14:03:09,726 INFO L290 TraceCheckUtils]: 75: Hoare triple {2938#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2938#false} is VALID [2022-02-20 14:03:09,726 INFO L290 TraceCheckUtils]: 74: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {2938#false} is VALID [2022-02-20 14:03:09,726 INFO L290 TraceCheckUtils]: 73: Hoare triple {2938#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2938#false} is VALID [2022-02-20 14:03:09,726 INFO L290 TraceCheckUtils]: 72: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {2938#false} is VALID [2022-02-20 14:03:09,726 INFO L290 TraceCheckUtils]: 71: Hoare triple {2938#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2938#false} is VALID [2022-02-20 14:03:09,726 INFO L290 TraceCheckUtils]: 70: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {2938#false} is VALID [2022-02-20 14:03:09,726 INFO L290 TraceCheckUtils]: 69: Hoare triple {2938#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2938#false} is VALID [2022-02-20 14:03:09,726 INFO L290 TraceCheckUtils]: 68: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {2938#false} is VALID [2022-02-20 14:03:09,726 INFO L290 TraceCheckUtils]: 67: Hoare triple {2938#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2938#false} is VALID [2022-02-20 14:03:09,727 INFO L290 TraceCheckUtils]: 66: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {2938#false} is VALID [2022-02-20 14:03:09,727 INFO L290 TraceCheckUtils]: 65: Hoare triple {2938#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2938#false} is VALID [2022-02-20 14:03:09,727 INFO L290 TraceCheckUtils]: 64: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {2938#false} is VALID [2022-02-20 14:03:09,727 INFO L290 TraceCheckUtils]: 63: Hoare triple {2938#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2938#false} is VALID [2022-02-20 14:03:09,727 INFO L290 TraceCheckUtils]: 62: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {2938#false} is VALID [2022-02-20 14:03:09,727 INFO L290 TraceCheckUtils]: 61: Hoare triple {2938#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2938#false} is VALID [2022-02-20 14:03:09,727 INFO L290 TraceCheckUtils]: 60: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {2938#false} is VALID [2022-02-20 14:03:09,727 INFO L290 TraceCheckUtils]: 59: Hoare triple {2938#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2938#false} is VALID [2022-02-20 14:03:09,727 INFO L290 TraceCheckUtils]: 58: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {2938#false} is VALID [2022-02-20 14:03:09,728 INFO L290 TraceCheckUtils]: 57: Hoare triple {2938#false} main_~i~0#1 := 0; {2938#false} is VALID [2022-02-20 14:03:09,728 INFO L290 TraceCheckUtils]: 56: Hoare triple {2938#false} assume !(main_~i~0#1 < 100000); {2938#false} is VALID [2022-02-20 14:03:09,728 INFO L290 TraceCheckUtils]: 55: Hoare triple {2938#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2938#false} is VALID [2022-02-20 14:03:09,728 INFO L290 TraceCheckUtils]: 54: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {2938#false} is VALID [2022-02-20 14:03:09,728 INFO L290 TraceCheckUtils]: 53: Hoare triple {2938#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2938#false} is VALID [2022-02-20 14:03:09,728 INFO L290 TraceCheckUtils]: 52: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {2938#false} is VALID [2022-02-20 14:03:09,728 INFO L290 TraceCheckUtils]: 51: Hoare triple {2938#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2938#false} is VALID [2022-02-20 14:03:09,728 INFO L290 TraceCheckUtils]: 50: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {2938#false} is VALID [2022-02-20 14:03:09,728 INFO L290 TraceCheckUtils]: 49: Hoare triple {2938#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2938#false} is VALID [2022-02-20 14:03:09,729 INFO L290 TraceCheckUtils]: 48: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {2938#false} is VALID [2022-02-20 14:03:09,729 INFO L290 TraceCheckUtils]: 47: Hoare triple {2938#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2938#false} is VALID [2022-02-20 14:03:09,729 INFO L290 TraceCheckUtils]: 46: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {2938#false} is VALID [2022-02-20 14:03:09,729 INFO L290 TraceCheckUtils]: 45: Hoare triple {2938#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2938#false} is VALID [2022-02-20 14:03:09,729 INFO L290 TraceCheckUtils]: 44: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {2938#false} is VALID [2022-02-20 14:03:09,729 INFO L290 TraceCheckUtils]: 43: Hoare triple {2938#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2938#false} is VALID [2022-02-20 14:03:09,729 INFO L290 TraceCheckUtils]: 42: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {2938#false} is VALID [2022-02-20 14:03:09,730 INFO L290 TraceCheckUtils]: 41: Hoare triple {2938#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2938#false} is VALID [2022-02-20 14:03:09,730 INFO L290 TraceCheckUtils]: 40: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {2938#false} is VALID [2022-02-20 14:03:09,730 INFO L290 TraceCheckUtils]: 39: Hoare triple {2938#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2938#false} is VALID [2022-02-20 14:03:09,730 INFO L290 TraceCheckUtils]: 38: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {2938#false} is VALID [2022-02-20 14:03:09,730 INFO L290 TraceCheckUtils]: 37: Hoare triple {2938#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2938#false} is VALID [2022-02-20 14:03:09,730 INFO L290 TraceCheckUtils]: 36: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {2938#false} is VALID [2022-02-20 14:03:09,730 INFO L290 TraceCheckUtils]: 35: Hoare triple {2938#false} main_~i~0#1 := 0; {2938#false} is VALID [2022-02-20 14:03:09,730 INFO L290 TraceCheckUtils]: 34: Hoare triple {2938#false} assume !(main_~i~0#1 < 100000); {2938#false} is VALID [2022-02-20 14:03:09,730 INFO L290 TraceCheckUtils]: 33: Hoare triple {2938#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2938#false} is VALID [2022-02-20 14:03:09,731 INFO L290 TraceCheckUtils]: 32: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {2938#false} is VALID [2022-02-20 14:03:09,731 INFO L290 TraceCheckUtils]: 31: Hoare triple {2938#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2938#false} is VALID [2022-02-20 14:03:09,731 INFO L290 TraceCheckUtils]: 30: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {2938#false} is VALID [2022-02-20 14:03:09,731 INFO L290 TraceCheckUtils]: 29: Hoare triple {2938#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2938#false} is VALID [2022-02-20 14:03:09,731 INFO L290 TraceCheckUtils]: 28: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {2938#false} is VALID [2022-02-20 14:03:09,731 INFO L290 TraceCheckUtils]: 27: Hoare triple {2938#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2938#false} is VALID [2022-02-20 14:03:09,731 INFO L290 TraceCheckUtils]: 26: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {2938#false} is VALID [2022-02-20 14:03:09,731 INFO L290 TraceCheckUtils]: 25: Hoare triple {2938#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2938#false} is VALID [2022-02-20 14:03:09,731 INFO L290 TraceCheckUtils]: 24: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {2938#false} is VALID [2022-02-20 14:03:09,732 INFO L290 TraceCheckUtils]: 23: Hoare triple {2938#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2938#false} is VALID [2022-02-20 14:03:09,732 INFO L290 TraceCheckUtils]: 22: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {2938#false} is VALID [2022-02-20 14:03:09,732 INFO L290 TraceCheckUtils]: 21: Hoare triple {2938#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2938#false} is VALID [2022-02-20 14:03:09,732 INFO L290 TraceCheckUtils]: 20: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {2938#false} is VALID [2022-02-20 14:03:09,732 INFO L290 TraceCheckUtils]: 19: Hoare triple {2938#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2938#false} is VALID [2022-02-20 14:03:09,732 INFO L290 TraceCheckUtils]: 18: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {2938#false} is VALID [2022-02-20 14:03:09,732 INFO L290 TraceCheckUtils]: 17: Hoare triple {2938#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2938#false} is VALID [2022-02-20 14:03:09,732 INFO L290 TraceCheckUtils]: 16: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {2938#false} is VALID [2022-02-20 14:03:09,732 INFO L290 TraceCheckUtils]: 15: Hoare triple {2938#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2938#false} is VALID [2022-02-20 14:03:09,732 INFO L290 TraceCheckUtils]: 14: Hoare triple {2938#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {2938#false} is VALID [2022-02-20 14:03:09,733 INFO L290 TraceCheckUtils]: 13: Hoare triple {2938#false} havoc main_~i~0#1;main_~i~0#1 := 0; {2938#false} is VALID [2022-02-20 14:03:09,733 INFO L290 TraceCheckUtils]: 12: Hoare triple {3801#(< |ULTIMATE.start_main_~a~0#1| 100000)} assume !(main_~a~0#1 < 100000); {2938#false} is VALID [2022-02-20 14:03:09,734 INFO L290 TraceCheckUtils]: 11: Hoare triple {3805#(< |ULTIMATE.start_main_~a~0#1| 99999)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3801#(< |ULTIMATE.start_main_~a~0#1| 100000)} is VALID [2022-02-20 14:03:09,734 INFO L290 TraceCheckUtils]: 10: Hoare triple {3805#(< |ULTIMATE.start_main_~a~0#1| 99999)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {3805#(< |ULTIMATE.start_main_~a~0#1| 99999)} is VALID [2022-02-20 14:03:09,734 INFO L290 TraceCheckUtils]: 9: Hoare triple {3812#(< |ULTIMATE.start_main_~a~0#1| 99998)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3805#(< |ULTIMATE.start_main_~a~0#1| 99999)} is VALID [2022-02-20 14:03:09,734 INFO L290 TraceCheckUtils]: 8: Hoare triple {3812#(< |ULTIMATE.start_main_~a~0#1| 99998)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {3812#(< |ULTIMATE.start_main_~a~0#1| 99998)} is VALID [2022-02-20 14:03:09,735 INFO L290 TraceCheckUtils]: 7: Hoare triple {3819#(< |ULTIMATE.start_main_~a~0#1| 99997)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3812#(< |ULTIMATE.start_main_~a~0#1| 99998)} is VALID [2022-02-20 14:03:09,735 INFO L290 TraceCheckUtils]: 6: Hoare triple {3819#(< |ULTIMATE.start_main_~a~0#1| 99997)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {3819#(< |ULTIMATE.start_main_~a~0#1| 99997)} is VALID [2022-02-20 14:03:09,736 INFO L290 TraceCheckUtils]: 5: Hoare triple {3826#(< |ULTIMATE.start_main_~a~0#1| 99996)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3819#(< |ULTIMATE.start_main_~a~0#1| 99997)} is VALID [2022-02-20 14:03:09,736 INFO L290 TraceCheckUtils]: 4: Hoare triple {3826#(< |ULTIMATE.start_main_~a~0#1| 99996)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {3826#(< |ULTIMATE.start_main_~a~0#1| 99996)} is VALID [2022-02-20 14:03:09,736 INFO L290 TraceCheckUtils]: 3: Hoare triple {3833#(< |ULTIMATE.start_main_~a~0#1| 99995)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3826#(< |ULTIMATE.start_main_~a~0#1| 99996)} is VALID [2022-02-20 14:03:09,737 INFO L290 TraceCheckUtils]: 2: Hoare triple {3833#(< |ULTIMATE.start_main_~a~0#1| 99995)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {3833#(< |ULTIMATE.start_main_~a~0#1| 99995)} is VALID [2022-02-20 14:03:09,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {2937#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_#t~mem4#1, main_#t~post3#1, main_#t~mem6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~post11#1, main_#t~mem14#1, main_#t~post13#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~post15#1, main_~#a1~0#1.base, main_~#a1~0#1.offset, main_~#a2~0#1.base, main_~#a2~0#1.offset, main_~#a3~0#1.base, main_~#a3~0#1.offset, main_~#a4~0#1.base, main_~#a4~0#1.offset, main_~#a5~0#1.base, main_~#a5~0#1.offset, main_~#a6~0#1.base, main_~#a6~0#1.offset, main_~#a7~0#1.base, main_~#a7~0#1.offset, main_~a~0#1, main_~i~0#1, main_~x~0#1;call main_~#a1~0#1.base, main_~#a1~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a2~0#1.base, main_~#a2~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a3~0#1.base, main_~#a3~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a4~0#1.base, main_~#a4~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a5~0#1.base, main_~#a5~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a6~0#1.base, main_~#a6~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a7~0#1.base, main_~#a7~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {3833#(< |ULTIMATE.start_main_~a~0#1| 99995)} is VALID [2022-02-20 14:03:09,738 INFO L290 TraceCheckUtils]: 0: Hoare triple {2937#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(26, 2); {2937#true} is VALID [2022-02-20 14:03:09,738 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2022-02-20 14:03:09,738 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [243335640] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:03:09,738 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:03:09,738 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2022-02-20 14:03:09,739 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650921806] [2022-02-20 14:03:09,739 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:03:09,739 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 15 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 149 [2022-02-20 14:03:09,740 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:03:09,740 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 15 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have 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:03:09,773 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:03:09,773 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-20 14:03:09,773 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:03:09,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-20 14:03:09,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2022-02-20 14:03:09,774 INFO L87 Difference]: Start difference. First operand 152 states and 159 transitions. Second operand has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 15 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have 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:03:09,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:03:09,970 INFO L93 Difference]: Finished difference Result 305 states and 325 transitions. [2022-02-20 14:03:09,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 14:03:09,970 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 15 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 149 [2022-02-20 14:03:09,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:03:09,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 15 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have 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:03:09,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 97 transitions. [2022-02-20 14:03:09,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 15 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have 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:03:09,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 97 transitions. [2022-02-20 14:03:09,973 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 97 transitions. [2022-02-20 14:03:10,034 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:03:10,037 INFO L225 Difference]: With dead ends: 305 [2022-02-20 14:03:10,037 INFO L226 Difference]: Without dead ends: 166 [2022-02-20 14:03:10,039 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2022-02-20 14:03:10,041 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 12 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:03:10,041 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 194 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:03:10,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-02-20 14:03:10,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2022-02-20 14:03:10,098 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:03:10,099 INFO L82 GeneralOperation]: Start isEquivalent. First operand 166 states. Second operand has 166 states, 165 states have (on average 1.0484848484848486) internal successors, (173), 165 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have 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:03:10,099 INFO L74 IsIncluded]: Start isIncluded. First operand 166 states. Second operand has 166 states, 165 states have (on average 1.0484848484848486) internal successors, (173), 165 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have 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:03:10,099 INFO L87 Difference]: Start difference. First operand 166 states. Second operand has 166 states, 165 states have (on average 1.0484848484848486) internal successors, (173), 165 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have 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:03:10,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:03:10,102 INFO L93 Difference]: Finished difference Result 166 states and 173 transitions. [2022-02-20 14:03:10,102 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 173 transitions. [2022-02-20 14:03:10,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:03:10,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:03:10,102 INFO L74 IsIncluded]: Start isIncluded. First operand has 166 states, 165 states have (on average 1.0484848484848486) internal successors, (173), 165 states have internal predecessors, (173), 0 states have call successors, (0), 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 166 states. [2022-02-20 14:03:10,114 INFO L87 Difference]: Start difference. First operand has 166 states, 165 states have (on average 1.0484848484848486) internal successors, (173), 165 states have internal predecessors, (173), 0 states have call successors, (0), 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 166 states. [2022-02-20 14:03:10,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:03:10,117 INFO L93 Difference]: Finished difference Result 166 states and 173 transitions. [2022-02-20 14:03:10,117 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 173 transitions. [2022-02-20 14:03:10,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:03:10,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:03:10,117 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:03:10,117 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:03:10,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 165 states have (on average 1.0484848484848486) internal successors, (173), 165 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have 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:03:10,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 173 transitions. [2022-02-20 14:03:10,121 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 173 transitions. Word has length 149 [2022-02-20 14:03:10,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:03:10,121 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 173 transitions. [2022-02-20 14:03:10,121 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 15 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have 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:03:10,121 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 173 transitions. [2022-02-20 14:03:10,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-02-20 14:03:10,122 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:03:10,122 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:03:10,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-20 14:03:10,339 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:03:10,340 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:03:10,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:03:10,340 INFO L85 PathProgramCache]: Analyzing trace with hash -2023772189, now seen corresponding path program 5 times [2022-02-20 14:03:10,340 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:03:10,340 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031279234] [2022-02-20 14:03:10,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:03:10,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:03:10,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:03:10,524 INFO L290 TraceCheckUtils]: 0: Hoare triple {4872#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(26, 2); {4872#true} is VALID [2022-02-20 14:03:10,524 INFO L290 TraceCheckUtils]: 1: Hoare triple {4872#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_#t~mem4#1, main_#t~post3#1, main_#t~mem6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~post11#1, main_#t~mem14#1, main_#t~post13#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~post15#1, main_~#a1~0#1.base, main_~#a1~0#1.offset, main_~#a2~0#1.base, main_~#a2~0#1.offset, main_~#a3~0#1.base, main_~#a3~0#1.offset, main_~#a4~0#1.base, main_~#a4~0#1.offset, main_~#a5~0#1.base, main_~#a5~0#1.offset, main_~#a6~0#1.base, main_~#a6~0#1.offset, main_~#a7~0#1.base, main_~#a7~0#1.offset, main_~a~0#1, main_~i~0#1, main_~x~0#1;call main_~#a1~0#1.base, main_~#a1~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a2~0#1.base, main_~#a2~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a3~0#1.base, main_~#a3~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a4~0#1.base, main_~#a4~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a5~0#1.base, main_~#a5~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a6~0#1.base, main_~#a6~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a7~0#1.base, main_~#a7~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {4874#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:03:10,525 INFO L290 TraceCheckUtils]: 2: Hoare triple {4874#(= |ULTIMATE.start_main_~a~0#1| 0)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {4874#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:03:10,525 INFO L290 TraceCheckUtils]: 3: Hoare triple {4874#(= |ULTIMATE.start_main_~a~0#1| 0)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {4875#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:03:10,525 INFO L290 TraceCheckUtils]: 4: Hoare triple {4875#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {4875#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:03:10,526 INFO L290 TraceCheckUtils]: 5: Hoare triple {4875#(<= |ULTIMATE.start_main_~a~0#1| 1)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {4876#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-20 14:03:10,527 INFO L290 TraceCheckUtils]: 6: Hoare triple {4876#(<= |ULTIMATE.start_main_~a~0#1| 2)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {4876#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-20 14:03:10,527 INFO L290 TraceCheckUtils]: 7: Hoare triple {4876#(<= |ULTIMATE.start_main_~a~0#1| 2)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {4877#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-20 14:03:10,527 INFO L290 TraceCheckUtils]: 8: Hoare triple {4877#(<= |ULTIMATE.start_main_~a~0#1| 3)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {4877#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-20 14:03:10,528 INFO L290 TraceCheckUtils]: 9: Hoare triple {4877#(<= |ULTIMATE.start_main_~a~0#1| 3)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {4878#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-20 14:03:10,528 INFO L290 TraceCheckUtils]: 10: Hoare triple {4878#(<= |ULTIMATE.start_main_~a~0#1| 4)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {4878#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-20 14:03:10,528 INFO L290 TraceCheckUtils]: 11: Hoare triple {4878#(<= |ULTIMATE.start_main_~a~0#1| 4)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {4879#(<= |ULTIMATE.start_main_~a~0#1| 5)} is VALID [2022-02-20 14:03:10,529 INFO L290 TraceCheckUtils]: 12: Hoare triple {4879#(<= |ULTIMATE.start_main_~a~0#1| 5)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {4879#(<= |ULTIMATE.start_main_~a~0#1| 5)} is VALID [2022-02-20 14:03:10,529 INFO L290 TraceCheckUtils]: 13: Hoare triple {4879#(<= |ULTIMATE.start_main_~a~0#1| 5)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {4880#(<= |ULTIMATE.start_main_~a~0#1| 6)} is VALID [2022-02-20 14:03:10,529 INFO L290 TraceCheckUtils]: 14: Hoare triple {4880#(<= |ULTIMATE.start_main_~a~0#1| 6)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {4880#(<= |ULTIMATE.start_main_~a~0#1| 6)} is VALID [2022-02-20 14:03:10,530 INFO L290 TraceCheckUtils]: 15: Hoare triple {4880#(<= |ULTIMATE.start_main_~a~0#1| 6)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {4881#(<= |ULTIMATE.start_main_~a~0#1| 7)} is VALID [2022-02-20 14:03:10,530 INFO L290 TraceCheckUtils]: 16: Hoare triple {4881#(<= |ULTIMATE.start_main_~a~0#1| 7)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {4881#(<= |ULTIMATE.start_main_~a~0#1| 7)} is VALID [2022-02-20 14:03:10,530 INFO L290 TraceCheckUtils]: 17: Hoare triple {4881#(<= |ULTIMATE.start_main_~a~0#1| 7)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {4882#(<= |ULTIMATE.start_main_~a~0#1| 8)} is VALID [2022-02-20 14:03:10,531 INFO L290 TraceCheckUtils]: 18: Hoare triple {4882#(<= |ULTIMATE.start_main_~a~0#1| 8)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {4882#(<= |ULTIMATE.start_main_~a~0#1| 8)} is VALID [2022-02-20 14:03:10,531 INFO L290 TraceCheckUtils]: 19: Hoare triple {4882#(<= |ULTIMATE.start_main_~a~0#1| 8)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {4883#(<= |ULTIMATE.start_main_~a~0#1| 9)} is VALID [2022-02-20 14:03:10,531 INFO L290 TraceCheckUtils]: 20: Hoare triple {4883#(<= |ULTIMATE.start_main_~a~0#1| 9)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {4883#(<= |ULTIMATE.start_main_~a~0#1| 9)} is VALID [2022-02-20 14:03:10,532 INFO L290 TraceCheckUtils]: 21: Hoare triple {4883#(<= |ULTIMATE.start_main_~a~0#1| 9)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {4884#(<= |ULTIMATE.start_main_~a~0#1| 10)} is VALID [2022-02-20 14:03:10,532 INFO L290 TraceCheckUtils]: 22: Hoare triple {4884#(<= |ULTIMATE.start_main_~a~0#1| 10)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {4884#(<= |ULTIMATE.start_main_~a~0#1| 10)} is VALID [2022-02-20 14:03:10,532 INFO L290 TraceCheckUtils]: 23: Hoare triple {4884#(<= |ULTIMATE.start_main_~a~0#1| 10)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {4885#(<= |ULTIMATE.start_main_~a~0#1| 11)} is VALID [2022-02-20 14:03:10,533 INFO L290 TraceCheckUtils]: 24: Hoare triple {4885#(<= |ULTIMATE.start_main_~a~0#1| 11)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {4885#(<= |ULTIMATE.start_main_~a~0#1| 11)} is VALID [2022-02-20 14:03:10,533 INFO L290 TraceCheckUtils]: 25: Hoare triple {4885#(<= |ULTIMATE.start_main_~a~0#1| 11)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {4886#(<= |ULTIMATE.start_main_~a~0#1| 12)} is VALID [2022-02-20 14:03:10,533 INFO L290 TraceCheckUtils]: 26: Hoare triple {4886#(<= |ULTIMATE.start_main_~a~0#1| 12)} assume !(main_~a~0#1 < 100000); {4873#false} is VALID [2022-02-20 14:03:10,534 INFO L290 TraceCheckUtils]: 27: Hoare triple {4873#false} havoc main_~i~0#1;main_~i~0#1 := 0; {4873#false} is VALID [2022-02-20 14:03:10,534 INFO L290 TraceCheckUtils]: 28: Hoare triple {4873#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {4873#false} is VALID [2022-02-20 14:03:10,534 INFO L290 TraceCheckUtils]: 29: Hoare triple {4873#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4873#false} is VALID [2022-02-20 14:03:10,534 INFO L290 TraceCheckUtils]: 30: Hoare triple {4873#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {4873#false} is VALID [2022-02-20 14:03:10,534 INFO L290 TraceCheckUtils]: 31: Hoare triple {4873#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4873#false} is VALID [2022-02-20 14:03:10,534 INFO L290 TraceCheckUtils]: 32: Hoare triple {4873#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {4873#false} is VALID [2022-02-20 14:03:10,534 INFO L290 TraceCheckUtils]: 33: Hoare triple {4873#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4873#false} is VALID [2022-02-20 14:03:10,534 INFO L290 TraceCheckUtils]: 34: Hoare triple {4873#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {4873#false} is VALID [2022-02-20 14:03:10,534 INFO L290 TraceCheckUtils]: 35: Hoare triple {4873#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4873#false} is VALID [2022-02-20 14:03:10,535 INFO L290 TraceCheckUtils]: 36: Hoare triple {4873#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {4873#false} is VALID [2022-02-20 14:03:10,535 INFO L290 TraceCheckUtils]: 37: Hoare triple {4873#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4873#false} is VALID [2022-02-20 14:03:10,535 INFO L290 TraceCheckUtils]: 38: Hoare triple {4873#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {4873#false} is VALID [2022-02-20 14:03:10,535 INFO L290 TraceCheckUtils]: 39: Hoare triple {4873#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4873#false} is VALID [2022-02-20 14:03:10,535 INFO L290 TraceCheckUtils]: 40: Hoare triple {4873#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {4873#false} is VALID [2022-02-20 14:03:10,535 INFO L290 TraceCheckUtils]: 41: Hoare triple {4873#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4873#false} is VALID [2022-02-20 14:03:10,535 INFO L290 TraceCheckUtils]: 42: Hoare triple {4873#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {4873#false} is VALID [2022-02-20 14:03:10,535 INFO L290 TraceCheckUtils]: 43: Hoare triple {4873#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4873#false} is VALID [2022-02-20 14:03:10,535 INFO L290 TraceCheckUtils]: 44: Hoare triple {4873#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {4873#false} is VALID [2022-02-20 14:03:10,536 INFO L290 TraceCheckUtils]: 45: Hoare triple {4873#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4873#false} is VALID [2022-02-20 14:03:10,536 INFO L290 TraceCheckUtils]: 46: Hoare triple {4873#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {4873#false} is VALID [2022-02-20 14:03:10,536 INFO L290 TraceCheckUtils]: 47: Hoare triple {4873#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4873#false} is VALID [2022-02-20 14:03:10,536 INFO L290 TraceCheckUtils]: 48: Hoare triple {4873#false} assume !(main_~i~0#1 < 100000); {4873#false} is VALID [2022-02-20 14:03:10,536 INFO L290 TraceCheckUtils]: 49: Hoare triple {4873#false} main_~i~0#1 := 0; {4873#false} is VALID [2022-02-20 14:03:10,536 INFO L290 TraceCheckUtils]: 50: Hoare triple {4873#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {4873#false} is VALID [2022-02-20 14:03:10,536 INFO L290 TraceCheckUtils]: 51: Hoare triple {4873#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {4873#false} is VALID [2022-02-20 14:03:10,537 INFO L290 TraceCheckUtils]: 52: Hoare triple {4873#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {4873#false} is VALID [2022-02-20 14:03:10,537 INFO L290 TraceCheckUtils]: 53: Hoare triple {4873#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {4873#false} is VALID [2022-02-20 14:03:10,537 INFO L290 TraceCheckUtils]: 54: Hoare triple {4873#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {4873#false} is VALID [2022-02-20 14:03:10,537 INFO L290 TraceCheckUtils]: 55: Hoare triple {4873#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {4873#false} is VALID [2022-02-20 14:03:10,537 INFO L290 TraceCheckUtils]: 56: Hoare triple {4873#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {4873#false} is VALID [2022-02-20 14:03:10,537 INFO L290 TraceCheckUtils]: 57: Hoare triple {4873#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {4873#false} is VALID [2022-02-20 14:03:10,537 INFO L290 TraceCheckUtils]: 58: Hoare triple {4873#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {4873#false} is VALID [2022-02-20 14:03:10,537 INFO L290 TraceCheckUtils]: 59: Hoare triple {4873#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {4873#false} is VALID [2022-02-20 14:03:10,538 INFO L290 TraceCheckUtils]: 60: Hoare triple {4873#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {4873#false} is VALID [2022-02-20 14:03:10,538 INFO L290 TraceCheckUtils]: 61: Hoare triple {4873#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {4873#false} is VALID [2022-02-20 14:03:10,538 INFO L290 TraceCheckUtils]: 62: Hoare triple {4873#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {4873#false} is VALID [2022-02-20 14:03:10,538 INFO L290 TraceCheckUtils]: 63: Hoare triple {4873#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {4873#false} is VALID [2022-02-20 14:03:10,538 INFO L290 TraceCheckUtils]: 64: Hoare triple {4873#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {4873#false} is VALID [2022-02-20 14:03:10,538 INFO L290 TraceCheckUtils]: 65: Hoare triple {4873#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {4873#false} is VALID [2022-02-20 14:03:10,538 INFO L290 TraceCheckUtils]: 66: Hoare triple {4873#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {4873#false} is VALID [2022-02-20 14:03:10,538 INFO L290 TraceCheckUtils]: 67: Hoare triple {4873#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {4873#false} is VALID [2022-02-20 14:03:10,539 INFO L290 TraceCheckUtils]: 68: Hoare triple {4873#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {4873#false} is VALID [2022-02-20 14:03:10,539 INFO L290 TraceCheckUtils]: 69: Hoare triple {4873#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {4873#false} is VALID [2022-02-20 14:03:10,539 INFO L290 TraceCheckUtils]: 70: Hoare triple {4873#false} assume !(main_~i~0#1 < 100000); {4873#false} is VALID [2022-02-20 14:03:10,539 INFO L290 TraceCheckUtils]: 71: Hoare triple {4873#false} main_~i~0#1 := 0; {4873#false} is VALID [2022-02-20 14:03:10,539 INFO L290 TraceCheckUtils]: 72: Hoare triple {4873#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {4873#false} is VALID [2022-02-20 14:03:10,539 INFO L290 TraceCheckUtils]: 73: Hoare triple {4873#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {4873#false} is VALID [2022-02-20 14:03:10,539 INFO L290 TraceCheckUtils]: 74: Hoare triple {4873#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {4873#false} is VALID [2022-02-20 14:03:10,540 INFO L290 TraceCheckUtils]: 75: Hoare triple {4873#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {4873#false} is VALID [2022-02-20 14:03:10,540 INFO L290 TraceCheckUtils]: 76: Hoare triple {4873#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {4873#false} is VALID [2022-02-20 14:03:10,540 INFO L290 TraceCheckUtils]: 77: Hoare triple {4873#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {4873#false} is VALID [2022-02-20 14:03:10,540 INFO L290 TraceCheckUtils]: 78: Hoare triple {4873#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {4873#false} is VALID [2022-02-20 14:03:10,540 INFO L290 TraceCheckUtils]: 79: Hoare triple {4873#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {4873#false} is VALID [2022-02-20 14:03:10,540 INFO L290 TraceCheckUtils]: 80: Hoare triple {4873#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {4873#false} is VALID [2022-02-20 14:03:10,540 INFO L290 TraceCheckUtils]: 81: Hoare triple {4873#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {4873#false} is VALID [2022-02-20 14:03:10,540 INFO L290 TraceCheckUtils]: 82: Hoare triple {4873#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {4873#false} is VALID [2022-02-20 14:03:10,540 INFO L290 TraceCheckUtils]: 83: Hoare triple {4873#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {4873#false} is VALID [2022-02-20 14:03:10,540 INFO L290 TraceCheckUtils]: 84: Hoare triple {4873#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {4873#false} is VALID [2022-02-20 14:03:10,541 INFO L290 TraceCheckUtils]: 85: Hoare triple {4873#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {4873#false} is VALID [2022-02-20 14:03:10,541 INFO L290 TraceCheckUtils]: 86: Hoare triple {4873#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {4873#false} is VALID [2022-02-20 14:03:10,541 INFO L290 TraceCheckUtils]: 87: Hoare triple {4873#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {4873#false} is VALID [2022-02-20 14:03:10,541 INFO L290 TraceCheckUtils]: 88: Hoare triple {4873#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {4873#false} is VALID [2022-02-20 14:03:10,541 INFO L290 TraceCheckUtils]: 89: Hoare triple {4873#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {4873#false} is VALID [2022-02-20 14:03:10,541 INFO L290 TraceCheckUtils]: 90: Hoare triple {4873#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {4873#false} is VALID [2022-02-20 14:03:10,541 INFO L290 TraceCheckUtils]: 91: Hoare triple {4873#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {4873#false} is VALID [2022-02-20 14:03:10,541 INFO L290 TraceCheckUtils]: 92: Hoare triple {4873#false} assume !(main_~i~0#1 < 100000); {4873#false} is VALID [2022-02-20 14:03:10,541 INFO L290 TraceCheckUtils]: 93: Hoare triple {4873#false} main_~i~0#1 := 0; {4873#false} is VALID [2022-02-20 14:03:10,542 INFO L290 TraceCheckUtils]: 94: Hoare triple {4873#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {4873#false} is VALID [2022-02-20 14:03:10,542 INFO L290 TraceCheckUtils]: 95: Hoare triple {4873#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {4873#false} is VALID [2022-02-20 14:03:10,542 INFO L290 TraceCheckUtils]: 96: Hoare triple {4873#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {4873#false} is VALID [2022-02-20 14:03:10,542 INFO L290 TraceCheckUtils]: 97: Hoare triple {4873#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {4873#false} is VALID [2022-02-20 14:03:10,542 INFO L290 TraceCheckUtils]: 98: Hoare triple {4873#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {4873#false} is VALID [2022-02-20 14:03:10,542 INFO L290 TraceCheckUtils]: 99: Hoare triple {4873#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {4873#false} is VALID [2022-02-20 14:03:10,542 INFO L290 TraceCheckUtils]: 100: Hoare triple {4873#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {4873#false} is VALID [2022-02-20 14:03:10,542 INFO L290 TraceCheckUtils]: 101: Hoare triple {4873#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {4873#false} is VALID [2022-02-20 14:03:10,542 INFO L290 TraceCheckUtils]: 102: Hoare triple {4873#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {4873#false} is VALID [2022-02-20 14:03:10,543 INFO L290 TraceCheckUtils]: 103: Hoare triple {4873#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {4873#false} is VALID [2022-02-20 14:03:10,543 INFO L290 TraceCheckUtils]: 104: Hoare triple {4873#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {4873#false} is VALID [2022-02-20 14:03:10,543 INFO L290 TraceCheckUtils]: 105: Hoare triple {4873#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {4873#false} is VALID [2022-02-20 14:03:10,543 INFO L290 TraceCheckUtils]: 106: Hoare triple {4873#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {4873#false} is VALID [2022-02-20 14:03:10,543 INFO L290 TraceCheckUtils]: 107: Hoare triple {4873#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {4873#false} is VALID [2022-02-20 14:03:10,543 INFO L290 TraceCheckUtils]: 108: Hoare triple {4873#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {4873#false} is VALID [2022-02-20 14:03:10,543 INFO L290 TraceCheckUtils]: 109: Hoare triple {4873#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {4873#false} is VALID [2022-02-20 14:03:10,543 INFO L290 TraceCheckUtils]: 110: Hoare triple {4873#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {4873#false} is VALID [2022-02-20 14:03:10,543 INFO L290 TraceCheckUtils]: 111: Hoare triple {4873#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {4873#false} is VALID [2022-02-20 14:03:10,544 INFO L290 TraceCheckUtils]: 112: Hoare triple {4873#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {4873#false} is VALID [2022-02-20 14:03:10,544 INFO L290 TraceCheckUtils]: 113: Hoare triple {4873#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {4873#false} is VALID [2022-02-20 14:03:10,544 INFO L290 TraceCheckUtils]: 114: Hoare triple {4873#false} assume !(main_~i~0#1 < 100000); {4873#false} is VALID [2022-02-20 14:03:10,544 INFO L290 TraceCheckUtils]: 115: Hoare triple {4873#false} main_~i~0#1 := 0; {4873#false} is VALID [2022-02-20 14:03:10,544 INFO L290 TraceCheckUtils]: 116: Hoare triple {4873#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {4873#false} is VALID [2022-02-20 14:03:10,544 INFO L290 TraceCheckUtils]: 117: Hoare triple {4873#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {4873#false} is VALID [2022-02-20 14:03:10,544 INFO L290 TraceCheckUtils]: 118: Hoare triple {4873#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {4873#false} is VALID [2022-02-20 14:03:10,544 INFO L290 TraceCheckUtils]: 119: Hoare triple {4873#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {4873#false} is VALID [2022-02-20 14:03:10,544 INFO L290 TraceCheckUtils]: 120: Hoare triple {4873#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {4873#false} is VALID [2022-02-20 14:03:10,545 INFO L290 TraceCheckUtils]: 121: Hoare triple {4873#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {4873#false} is VALID [2022-02-20 14:03:10,545 INFO L290 TraceCheckUtils]: 122: Hoare triple {4873#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {4873#false} is VALID [2022-02-20 14:03:10,545 INFO L290 TraceCheckUtils]: 123: Hoare triple {4873#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {4873#false} is VALID [2022-02-20 14:03:10,545 INFO L290 TraceCheckUtils]: 124: Hoare triple {4873#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {4873#false} is VALID [2022-02-20 14:03:10,545 INFO L290 TraceCheckUtils]: 125: Hoare triple {4873#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {4873#false} is VALID [2022-02-20 14:03:10,545 INFO L290 TraceCheckUtils]: 126: Hoare triple {4873#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {4873#false} is VALID [2022-02-20 14:03:10,545 INFO L290 TraceCheckUtils]: 127: Hoare triple {4873#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {4873#false} is VALID [2022-02-20 14:03:10,545 INFO L290 TraceCheckUtils]: 128: Hoare triple {4873#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {4873#false} is VALID [2022-02-20 14:03:10,545 INFO L290 TraceCheckUtils]: 129: Hoare triple {4873#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {4873#false} is VALID [2022-02-20 14:03:10,545 INFO L290 TraceCheckUtils]: 130: Hoare triple {4873#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {4873#false} is VALID [2022-02-20 14:03:10,546 INFO L290 TraceCheckUtils]: 131: Hoare triple {4873#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {4873#false} is VALID [2022-02-20 14:03:10,546 INFO L290 TraceCheckUtils]: 132: Hoare triple {4873#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {4873#false} is VALID [2022-02-20 14:03:10,546 INFO L290 TraceCheckUtils]: 133: Hoare triple {4873#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {4873#false} is VALID [2022-02-20 14:03:10,546 INFO L290 TraceCheckUtils]: 134: Hoare triple {4873#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {4873#false} is VALID [2022-02-20 14:03:10,546 INFO L290 TraceCheckUtils]: 135: Hoare triple {4873#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {4873#false} is VALID [2022-02-20 14:03:10,546 INFO L290 TraceCheckUtils]: 136: Hoare triple {4873#false} assume !(main_~i~0#1 < 100000); {4873#false} is VALID [2022-02-20 14:03:10,546 INFO L290 TraceCheckUtils]: 137: Hoare triple {4873#false} main_~i~0#1 := 0; {4873#false} is VALID [2022-02-20 14:03:10,546 INFO L290 TraceCheckUtils]: 138: Hoare triple {4873#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {4873#false} is VALID [2022-02-20 14:03:10,546 INFO L290 TraceCheckUtils]: 139: Hoare triple {4873#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {4873#false} is VALID [2022-02-20 14:03:10,547 INFO L290 TraceCheckUtils]: 140: Hoare triple {4873#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {4873#false} is VALID [2022-02-20 14:03:10,547 INFO L290 TraceCheckUtils]: 141: Hoare triple {4873#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {4873#false} is VALID [2022-02-20 14:03:10,547 INFO L290 TraceCheckUtils]: 142: Hoare triple {4873#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {4873#false} is VALID [2022-02-20 14:03:10,547 INFO L290 TraceCheckUtils]: 143: Hoare triple {4873#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {4873#false} is VALID [2022-02-20 14:03:10,547 INFO L290 TraceCheckUtils]: 144: Hoare triple {4873#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {4873#false} is VALID [2022-02-20 14:03:10,547 INFO L290 TraceCheckUtils]: 145: Hoare triple {4873#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {4873#false} is VALID [2022-02-20 14:03:10,547 INFO L290 TraceCheckUtils]: 146: Hoare triple {4873#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {4873#false} is VALID [2022-02-20 14:03:10,547 INFO L290 TraceCheckUtils]: 147: Hoare triple {4873#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {4873#false} is VALID [2022-02-20 14:03:10,547 INFO L290 TraceCheckUtils]: 148: Hoare triple {4873#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {4873#false} is VALID [2022-02-20 14:03:10,548 INFO L290 TraceCheckUtils]: 149: Hoare triple {4873#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {4873#false} is VALID [2022-02-20 14:03:10,548 INFO L290 TraceCheckUtils]: 150: Hoare triple {4873#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {4873#false} is VALID [2022-02-20 14:03:10,548 INFO L290 TraceCheckUtils]: 151: Hoare triple {4873#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {4873#false} is VALID [2022-02-20 14:03:10,548 INFO L290 TraceCheckUtils]: 152: Hoare triple {4873#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {4873#false} is VALID [2022-02-20 14:03:10,548 INFO L290 TraceCheckUtils]: 153: Hoare triple {4873#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {4873#false} is VALID [2022-02-20 14:03:10,548 INFO L290 TraceCheckUtils]: 154: Hoare triple {4873#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {4873#false} is VALID [2022-02-20 14:03:10,548 INFO L290 TraceCheckUtils]: 155: Hoare triple {4873#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {4873#false} is VALID [2022-02-20 14:03:10,548 INFO L290 TraceCheckUtils]: 156: Hoare triple {4873#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {4873#false} is VALID [2022-02-20 14:03:10,548 INFO L290 TraceCheckUtils]: 157: Hoare triple {4873#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {4873#false} is VALID [2022-02-20 14:03:10,549 INFO L290 TraceCheckUtils]: 158: Hoare triple {4873#false} assume !(main_~i~0#1 < 100000); {4873#false} is VALID [2022-02-20 14:03:10,549 INFO L290 TraceCheckUtils]: 159: Hoare triple {4873#false} havoc main_~x~0#1;main_~x~0#1 := 0; {4873#false} is VALID [2022-02-20 14:03:10,549 INFO L290 TraceCheckUtils]: 160: Hoare triple {4873#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem17#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem16#1 == main_#t~mem17#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {4873#false} is VALID [2022-02-20 14:03:10,549 INFO L290 TraceCheckUtils]: 161: Hoare triple {4873#false} assume 0 == __VERIFIER_assert_~cond#1; {4873#false} is VALID [2022-02-20 14:03:10,549 INFO L290 TraceCheckUtils]: 162: Hoare triple {4873#false} assume !false; {4873#false} is VALID [2022-02-20 14:03:10,550 INFO L134 CoverageAnalysis]: Checked inductivity of 744 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2022-02-20 14:03:10,550 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:03:10,550 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031279234] [2022-02-20 14:03:10,550 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031279234] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:03:10,550 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1232480727] [2022-02-20 14:03:10,550 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-20 14:03:10,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:03:10,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:03:10,552 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:03:10,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process