./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-examples/standard_copy7_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_copy7_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 cbf527dd3c93b1481b5a3e05c502e53db8f02c4e20ad58a12006bf35717e53d7 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 14:03:48,453 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 14:03:48,456 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 14:03:48,501 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 14:03:48,501 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 14:03:48,502 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 14:03:48,504 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 14:03:48,505 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 14:03:48,506 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 14:03:48,507 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 14:03:48,508 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 14:03:48,509 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 14:03:48,509 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 14:03:48,510 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 14:03:48,511 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 14:03:48,512 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 14:03:48,513 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 14:03:48,514 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 14:03:48,515 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 14:03:48,517 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 14:03:48,518 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 14:03:48,519 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 14:03:48,520 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 14:03:48,521 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 14:03:48,523 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 14:03:48,524 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 14:03:48,524 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 14:03:48,525 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 14:03:48,525 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 14:03:48,526 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 14:03:48,526 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 14:03:48,527 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 14:03:48,528 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 14:03:48,528 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 14:03:48,529 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 14:03:48,530 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 14:03:48,530 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 14:03:48,531 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 14:03:48,531 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 14:03:48,532 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 14:03:48,532 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 14:03:48,533 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:03:48,550 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 14:03:48,551 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 14:03:48,551 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 14:03:48,551 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 14:03:48,552 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 14:03:48,552 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 14:03:48,553 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 14:03:48,553 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 14:03:48,553 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 14:03:48,554 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 14:03:48,554 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 14:03:48,554 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 14:03:48,554 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 14:03:48,555 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 14:03:48,555 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 14:03:48,555 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 14:03:48,555 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 14:03:48,556 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 14:03:48,556 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 14:03:48,556 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 14:03:48,556 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 14:03:48,557 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 14:03:48,557 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 14:03:48,557 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 14:03:48,557 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:03:48,557 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 14:03:48,558 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 14:03:48,558 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 14:03:48,558 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 14:03:48,558 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 14:03:48,559 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 14:03:48,559 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 14:03:48,559 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 14:03:48,559 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 -> cbf527dd3c93b1481b5a3e05c502e53db8f02c4e20ad58a12006bf35717e53d7 [2022-02-20 14:03:48,793 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 14:03:48,822 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 14:03:48,824 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 14:03:48,825 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 14:03:48,827 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 14:03:48,828 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-examples/standard_copy7_ground-2.i [2022-02-20 14:03:48,890 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da7131d04/56cf26f2120449fabfbb7af7bc1e0b6c/FLAGb35ad7aa2 [2022-02-20 14:03:49,343 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 14:03:49,344 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/standard_copy7_ground-2.i [2022-02-20 14:03:49,361 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da7131d04/56cf26f2120449fabfbb7af7bc1e0b6c/FLAGb35ad7aa2 [2022-02-20 14:03:49,378 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da7131d04/56cf26f2120449fabfbb7af7bc1e0b6c [2022-02-20 14:03:49,381 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 14:03:49,382 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 14:03:49,383 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 14:03:49,383 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 14:03:49,386 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 14:03:49,387 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:03:49" (1/1) ... [2022-02-20 14:03:49,388 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@304f7d19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:03:49, skipping insertion in model container [2022-02-20 14:03:49,388 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:03:49" (1/1) ... [2022-02-20 14:03:49,394 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 14:03:49,407 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 14:03:49,519 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_copy7_ground-2.i[816,829] [2022-02-20 14:03:49,551 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:03:49,557 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 14:03:49,567 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_copy7_ground-2.i[816,829] [2022-02-20 14:03:49,579 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:03:49,590 INFO L208 MainTranslator]: Completed translation [2022-02-20 14:03:49,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:03:49 WrapperNode [2022-02-20 14:03:49,591 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 14:03:49,592 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 14:03:49,592 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 14:03:49,592 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 14:03:49,599 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:03:49" (1/1) ... [2022-02-20 14:03:49,605 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:03:49" (1/1) ... [2022-02-20 14:03:49,632 INFO L137 Inliner]: procedures = 16, calls = 48, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 160 [2022-02-20 14:03:49,632 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 14:03:49,633 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 14:03:49,633 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 14:03:49,633 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 14:03:49,640 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:03:49" (1/1) ... [2022-02-20 14:03:49,641 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:03:49" (1/1) ... [2022-02-20 14:03:49,643 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:03:49" (1/1) ... [2022-02-20 14:03:49,643 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:03:49" (1/1) ... [2022-02-20 14:03:49,652 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:03:49" (1/1) ... [2022-02-20 14:03:49,658 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:03:49" (1/1) ... [2022-02-20 14:03:49,665 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:03:49" (1/1) ... [2022-02-20 14:03:49,667 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 14:03:49,671 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 14:03:49,672 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 14:03:49,672 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 14:03:49,673 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:03:49" (1/1) ... [2022-02-20 14:03:49,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:03:49,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:03:49,716 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:03:49,728 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:03:49,752 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 14:03:49,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 14:03:49,752 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 14:03:49,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 14:03:49,753 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 14:03:49,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 14:03:49,753 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 14:03:49,753 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 14:03:49,845 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 14:03:49,847 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 14:03:50,268 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 14:03:50,274 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 14:03:50,274 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2022-02-20 14:03:50,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:03:50 BoogieIcfgContainer [2022-02-20 14:03:50,276 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 14:03:50,279 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 14:03:50,279 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 14:03:50,282 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 14:03:50,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 02:03:49" (1/3) ... [2022-02-20 14:03:50,283 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@553f77f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:03:50, skipping insertion in model container [2022-02-20 14:03:50,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:03:49" (2/3) ... [2022-02-20 14:03:50,284 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@553f77f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:03:50, skipping insertion in model container [2022-02-20 14:03:50,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:03:50" (3/3) ... [2022-02-20 14:03:50,285 INFO L111 eAbstractionObserver]: Analyzing ICFG standard_copy7_ground-2.i [2022-02-20 14:03:50,289 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 14:03:50,290 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 14:03:50,340 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 14:03:50,353 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:03:50,353 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 14:03:50,372 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 34 states have (on average 1.588235294117647) internal successors, (54), 35 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:03:50,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 14:03:50,400 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:03:50,400 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:50,401 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:03:50,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:03:50,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1647230389, now seen corresponding path program 1 times [2022-02-20 14:03:50,413 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:03:50,413 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223062967] [2022-02-20 14:03:50,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:03:50,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:03:50,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:03:50,679 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#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); {39#true} is VALID [2022-02-20 14:03:50,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#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~post15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#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_~#a8~0#1.base, main_~#a8~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);call main_~#a8~0#1.base, main_~#a8~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {41#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:03:50,681 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#(= |ULTIMATE.start_main_~a~0#1| 0)} assume !(main_~a~0#1 < 100000); {40#false} is VALID [2022-02-20 14:03:50,682 INFO L290 TraceCheckUtils]: 3: Hoare triple {40#false} havoc main_~i~0#1;main_~i~0#1 := 0; {40#false} is VALID [2022-02-20 14:03:50,682 INFO L290 TraceCheckUtils]: 4: Hoare triple {40#false} assume !(main_~i~0#1 < 100000); {40#false} is VALID [2022-02-20 14:03:50,682 INFO L290 TraceCheckUtils]: 5: Hoare triple {40#false} main_~i~0#1 := 0; {40#false} is VALID [2022-02-20 14:03:50,682 INFO L290 TraceCheckUtils]: 6: Hoare triple {40#false} assume !(main_~i~0#1 < 100000); {40#false} is VALID [2022-02-20 14:03:50,683 INFO L290 TraceCheckUtils]: 7: Hoare triple {40#false} main_~i~0#1 := 0; {40#false} is VALID [2022-02-20 14:03:50,683 INFO L290 TraceCheckUtils]: 8: Hoare triple {40#false} assume !(main_~i~0#1 < 100000); {40#false} is VALID [2022-02-20 14:03:50,683 INFO L290 TraceCheckUtils]: 9: Hoare triple {40#false} main_~i~0#1 := 0; {40#false} is VALID [2022-02-20 14:03:50,684 INFO L290 TraceCheckUtils]: 10: Hoare triple {40#false} assume !(main_~i~0#1 < 100000); {40#false} is VALID [2022-02-20 14:03:50,684 INFO L290 TraceCheckUtils]: 11: Hoare triple {40#false} main_~i~0#1 := 0; {40#false} is VALID [2022-02-20 14:03:50,684 INFO L290 TraceCheckUtils]: 12: Hoare triple {40#false} assume !true; {40#false} is VALID [2022-02-20 14:03:50,684 INFO L290 TraceCheckUtils]: 13: Hoare triple {40#false} main_~i~0#1 := 0; {40#false} is VALID [2022-02-20 14:03:50,685 INFO L290 TraceCheckUtils]: 14: Hoare triple {40#false} assume !true; {40#false} is VALID [2022-02-20 14:03:50,685 INFO L290 TraceCheckUtils]: 15: Hoare triple {40#false} main_~i~0#1 := 0; {40#false} is VALID [2022-02-20 14:03:50,686 INFO L290 TraceCheckUtils]: 16: Hoare triple {40#false} assume !true; {40#false} is VALID [2022-02-20 14:03:50,687 INFO L290 TraceCheckUtils]: 17: Hoare triple {40#false} havoc main_~x~0#1;main_~x~0#1 := 0; {40#false} is VALID [2022-02-20 14:03:50,687 INFO L290 TraceCheckUtils]: 18: Hoare triple {40#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem18#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem19#1 := read~int(main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem18#1 == main_#t~mem19#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {40#false} is VALID [2022-02-20 14:03:50,687 INFO L290 TraceCheckUtils]: 19: Hoare triple {40#false} assume 0 == __VERIFIER_assert_~cond#1; {40#false} is VALID [2022-02-20 14:03:50,688 INFO L290 TraceCheckUtils]: 20: Hoare triple {40#false} assume !false; {40#false} is VALID [2022-02-20 14:03:50,689 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:03:50,689 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:03:50,689 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223062967] [2022-02-20 14:03:50,690 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223062967] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:03:50,691 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:03:50,691 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:03:50,693 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005436526] [2022-02-20 14:03:50,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:03:50,698 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:50,699 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:03:50,702 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:50,743 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:50,744 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:03:50,744 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:03:50,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:03:50,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:03:50,768 INFO L87 Difference]: Start difference. First operand has 36 states, 34 states have (on average 1.588235294117647) internal successors, (54), 35 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 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:50,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:03:50,861 INFO L93 Difference]: Finished difference Result 70 states and 106 transitions. [2022-02-20 14:03:50,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:03:50,862 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:50,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:03:50,864 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:50,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2022-02-20 14:03:50,876 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:50,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2022-02-20 14:03:50,880 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 106 transitions. [2022-02-20 14:03:50,972 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:03:50,991 INFO L225 Difference]: With dead ends: 70 [2022-02-20 14:03:50,993 INFO L226 Difference]: Without dead ends: 34 [2022-02-20 14:03:50,995 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:51,000 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 1 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 82 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:51,001 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 82 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:51,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-02-20 14:03:51,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2022-02-20 14:03:51,029 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:03:51,031 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 33 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have 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:51,032 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 33 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have 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:51,032 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 33 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have 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:51,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:03:51,035 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2022-02-20 14:03:51,035 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2022-02-20 14:03:51,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:03:51,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:03:51,037 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 0 states have call successors, (0), 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 34 states. [2022-02-20 14:03:51,037 INFO L87 Difference]: Start difference. First operand has 33 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 0 states have call successors, (0), 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 34 states. [2022-02-20 14:03:51,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:03:51,040 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2022-02-20 14:03:51,040 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2022-02-20 14:03:51,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:03:51,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:03:51,041 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:03:51,042 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:03:51,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have 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:51,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2022-02-20 14:03:51,049 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 21 [2022-02-20 14:03:51,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:03:51,050 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2022-02-20 14:03:51,050 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:51,051 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2022-02-20 14:03:51,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 14:03:51,053 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:03:51,053 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] [2022-02-20 14:03:51,054 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 14:03:51,060 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:03:51,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:03:51,061 INFO L85 PathProgramCache]: Analyzing trace with hash -212862985, now seen corresponding path program 1 times [2022-02-20 14:03:51,061 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:03:51,061 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265458813] [2022-02-20 14:03:51,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:03:51,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:03:51,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:03:51,190 INFO L290 TraceCheckUtils]: 0: Hoare triple {245#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); {245#true} is VALID [2022-02-20 14:03:51,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {245#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~post15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#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_~#a8~0#1.base, main_~#a8~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);call main_~#a8~0#1.base, main_~#a8~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {247#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:03:51,192 INFO L290 TraceCheckUtils]: 2: Hoare triple {247#(= |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; {247#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:03:51,192 INFO L290 TraceCheckUtils]: 3: Hoare triple {247#(= |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; {248#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:03:51,193 INFO L290 TraceCheckUtils]: 4: Hoare triple {248#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume !(main_~a~0#1 < 100000); {246#false} is VALID [2022-02-20 14:03:51,193 INFO L290 TraceCheckUtils]: 5: Hoare triple {246#false} havoc main_~i~0#1;main_~i~0#1 := 0; {246#false} is VALID [2022-02-20 14:03:51,194 INFO L290 TraceCheckUtils]: 6: Hoare triple {246#false} assume !(main_~i~0#1 < 100000); {246#false} is VALID [2022-02-20 14:03:51,194 INFO L290 TraceCheckUtils]: 7: Hoare triple {246#false} main_~i~0#1 := 0; {246#false} is VALID [2022-02-20 14:03:51,194 INFO L290 TraceCheckUtils]: 8: Hoare triple {246#false} assume !(main_~i~0#1 < 100000); {246#false} is VALID [2022-02-20 14:03:51,195 INFO L290 TraceCheckUtils]: 9: Hoare triple {246#false} main_~i~0#1 := 0; {246#false} is VALID [2022-02-20 14:03:51,195 INFO L290 TraceCheckUtils]: 10: Hoare triple {246#false} assume !(main_~i~0#1 < 100000); {246#false} is VALID [2022-02-20 14:03:51,195 INFO L290 TraceCheckUtils]: 11: Hoare triple {246#false} main_~i~0#1 := 0; {246#false} is VALID [2022-02-20 14:03:51,195 INFO L290 TraceCheckUtils]: 12: Hoare triple {246#false} assume !(main_~i~0#1 < 100000); {246#false} is VALID [2022-02-20 14:03:51,196 INFO L290 TraceCheckUtils]: 13: Hoare triple {246#false} main_~i~0#1 := 0; {246#false} is VALID [2022-02-20 14:03:51,196 INFO L290 TraceCheckUtils]: 14: Hoare triple {246#false} assume !(main_~i~0#1 < 100000); {246#false} is VALID [2022-02-20 14:03:51,196 INFO L290 TraceCheckUtils]: 15: Hoare triple {246#false} main_~i~0#1 := 0; {246#false} is VALID [2022-02-20 14:03:51,196 INFO L290 TraceCheckUtils]: 16: Hoare triple {246#false} assume !(main_~i~0#1 < 100000); {246#false} is VALID [2022-02-20 14:03:51,196 INFO L290 TraceCheckUtils]: 17: Hoare triple {246#false} main_~i~0#1 := 0; {246#false} is VALID [2022-02-20 14:03:51,197 INFO L290 TraceCheckUtils]: 18: Hoare triple {246#false} assume !(main_~i~0#1 < 100000); {246#false} is VALID [2022-02-20 14:03:51,197 INFO L290 TraceCheckUtils]: 19: Hoare triple {246#false} havoc main_~x~0#1;main_~x~0#1 := 0; {246#false} is VALID [2022-02-20 14:03:51,197 INFO L290 TraceCheckUtils]: 20: Hoare triple {246#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem18#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem19#1 := read~int(main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem18#1 == main_#t~mem19#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {246#false} is VALID [2022-02-20 14:03:51,197 INFO L290 TraceCheckUtils]: 21: Hoare triple {246#false} assume 0 == __VERIFIER_assert_~cond#1; {246#false} is VALID [2022-02-20 14:03:51,198 INFO L290 TraceCheckUtils]: 22: Hoare triple {246#false} assume !false; {246#false} is VALID [2022-02-20 14:03:51,198 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:51,198 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:03:51,199 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265458813] [2022-02-20 14:03:51,199 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265458813] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:03:51,200 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [846006081] [2022-02-20 14:03:51,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:03:51,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:03:51,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:03:51,207 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:51,233 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:51,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:03:51,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 14:03:51,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:03:51,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:03:51,378 INFO L290 TraceCheckUtils]: 0: Hoare triple {245#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); {245#true} is VALID [2022-02-20 14:03:51,378 INFO L290 TraceCheckUtils]: 1: Hoare triple {245#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~post15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#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_~#a8~0#1.base, main_~#a8~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);call main_~#a8~0#1.base, main_~#a8~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {245#true} is VALID [2022-02-20 14:03:51,379 INFO L290 TraceCheckUtils]: 2: Hoare triple {245#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; {245#true} is VALID [2022-02-20 14:03:51,379 INFO L290 TraceCheckUtils]: 3: Hoare triple {245#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {245#true} is VALID [2022-02-20 14:03:51,379 INFO L290 TraceCheckUtils]: 4: Hoare triple {245#true} assume !(main_~a~0#1 < 100000); {245#true} is VALID [2022-02-20 14:03:51,383 INFO L290 TraceCheckUtils]: 5: Hoare triple {245#true} havoc main_~i~0#1;main_~i~0#1 := 0; {267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:03:51,383 INFO L290 TraceCheckUtils]: 6: Hoare triple {267#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~i~0#1 < 100000); {246#false} is VALID [2022-02-20 14:03:51,384 INFO L290 TraceCheckUtils]: 7: Hoare triple {246#false} main_~i~0#1 := 0; {246#false} is VALID [2022-02-20 14:03:51,385 INFO L290 TraceCheckUtils]: 8: Hoare triple {246#false} assume !(main_~i~0#1 < 100000); {246#false} is VALID [2022-02-20 14:03:51,385 INFO L290 TraceCheckUtils]: 9: Hoare triple {246#false} main_~i~0#1 := 0; {246#false} is VALID [2022-02-20 14:03:51,386 INFO L290 TraceCheckUtils]: 10: Hoare triple {246#false} assume !(main_~i~0#1 < 100000); {246#false} is VALID [2022-02-20 14:03:51,386 INFO L290 TraceCheckUtils]: 11: Hoare triple {246#false} main_~i~0#1 := 0; {246#false} is VALID [2022-02-20 14:03:51,386 INFO L290 TraceCheckUtils]: 12: Hoare triple {246#false} assume !(main_~i~0#1 < 100000); {246#false} is VALID [2022-02-20 14:03:51,386 INFO L290 TraceCheckUtils]: 13: Hoare triple {246#false} main_~i~0#1 := 0; {246#false} is VALID [2022-02-20 14:03:51,387 INFO L290 TraceCheckUtils]: 14: Hoare triple {246#false} assume !(main_~i~0#1 < 100000); {246#false} is VALID [2022-02-20 14:03:51,387 INFO L290 TraceCheckUtils]: 15: Hoare triple {246#false} main_~i~0#1 := 0; {246#false} is VALID [2022-02-20 14:03:51,387 INFO L290 TraceCheckUtils]: 16: Hoare triple {246#false} assume !(main_~i~0#1 < 100000); {246#false} is VALID [2022-02-20 14:03:51,388 INFO L290 TraceCheckUtils]: 17: Hoare triple {246#false} main_~i~0#1 := 0; {246#false} is VALID [2022-02-20 14:03:51,388 INFO L290 TraceCheckUtils]: 18: Hoare triple {246#false} assume !(main_~i~0#1 < 100000); {246#false} is VALID [2022-02-20 14:03:51,388 INFO L290 TraceCheckUtils]: 19: Hoare triple {246#false} havoc main_~x~0#1;main_~x~0#1 := 0; {246#false} is VALID [2022-02-20 14:03:51,388 INFO L290 TraceCheckUtils]: 20: Hoare triple {246#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem18#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem19#1 := read~int(main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem18#1 == main_#t~mem19#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {246#false} is VALID [2022-02-20 14:03:51,389 INFO L290 TraceCheckUtils]: 21: Hoare triple {246#false} assume 0 == __VERIFIER_assert_~cond#1; {246#false} is VALID [2022-02-20 14:03:51,389 INFO L290 TraceCheckUtils]: 22: Hoare triple {246#false} assume !false; {246#false} is VALID [2022-02-20 14:03:51,389 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:51,390 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:03:51,391 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [846006081] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:03:51,394 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 14:03:51,394 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-02-20 14:03:51,395 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820558509] [2022-02-20 14:03:51,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:03:51,396 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-02-20 14:03:51,397 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:03:51,397 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:03:51,483 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:03:51,483 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:03:51,483 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:03:51,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:03:51,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:03:51,484 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:03:51,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:03:51,599 INFO L93 Difference]: Finished difference Result 72 states and 93 transitions. [2022-02-20 14:03:51,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:03:51,600 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-02-20 14:03:51,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:03:51,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:03:51,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2022-02-20 14:03:51,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:03:51,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2022-02-20 14:03:51,603 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 92 transitions. [2022-02-20 14:03:51,676 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:03:51,678 INFO L225 Difference]: With dead ends: 72 [2022-02-20 14:03:51,678 INFO L226 Difference]: Without dead ends: 47 [2022-02-20 14:03:51,679 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 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:51,680 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 7 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:03:51,680 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 37 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:03:51,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-02-20 14:03:51,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 40. [2022-02-20 14:03:51,691 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:03:51,691 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 40 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:03:51,691 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 40 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:03:51,692 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 40 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:03:51,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:03:51,695 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2022-02-20 14:03:51,695 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2022-02-20 14:03:51,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:03:51,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:03:51,697 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 47 states. [2022-02-20 14:03:51,697 INFO L87 Difference]: Start difference. First operand has 40 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 47 states. [2022-02-20 14:03:51,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:03:51,703 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2022-02-20 14:03:51,703 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2022-02-20 14:03:51,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:03:51,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:03:51,708 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:03:51,709 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:03:51,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:03:51,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2022-02-20 14:03:51,713 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 23 [2022-02-20 14:03:51,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:03:51,713 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2022-02-20 14:03:51,713 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:03:51,713 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2022-02-20 14:03:51,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 14:03:51,714 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:03:51,714 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, 1, 1, 1, 1] [2022-02-20 14:03:51,740 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:51,936 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:51,937 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:03:51,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:03:51,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1047765161, now seen corresponding path program 1 times [2022-02-20 14:03:51,937 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:03:51,937 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860739396] [2022-02-20 14:03:51,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:03:51,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:03:51,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:03:52,045 INFO L290 TraceCheckUtils]: 0: Hoare triple {565#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); {565#true} is VALID [2022-02-20 14:03:52,045 INFO L290 TraceCheckUtils]: 1: Hoare triple {565#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~post15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#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_~#a8~0#1.base, main_~#a8~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);call main_~#a8~0#1.base, main_~#a8~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {567#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:03:52,046 INFO L290 TraceCheckUtils]: 2: Hoare triple {567#(= |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; {567#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:03:52,046 INFO L290 TraceCheckUtils]: 3: Hoare triple {567#(= |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; {568#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:03:52,047 INFO L290 TraceCheckUtils]: 4: Hoare triple {568#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume !(main_~a~0#1 < 100000); {566#false} is VALID [2022-02-20 14:03:52,047 INFO L290 TraceCheckUtils]: 5: Hoare triple {566#false} havoc main_~i~0#1;main_~i~0#1 := 0; {566#false} is VALID [2022-02-20 14:03:52,047 INFO L290 TraceCheckUtils]: 6: Hoare triple {566#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; {566#false} is VALID [2022-02-20 14:03:52,048 INFO L290 TraceCheckUtils]: 7: Hoare triple {566#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {566#false} is VALID [2022-02-20 14:03:52,048 INFO L290 TraceCheckUtils]: 8: Hoare triple {566#false} assume !(main_~i~0#1 < 100000); {566#false} is VALID [2022-02-20 14:03:52,049 INFO L290 TraceCheckUtils]: 9: Hoare triple {566#false} main_~i~0#1 := 0; {566#false} is VALID [2022-02-20 14:03:52,049 INFO L290 TraceCheckUtils]: 10: Hoare triple {566#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; {566#false} is VALID [2022-02-20 14:03:52,049 INFO L290 TraceCheckUtils]: 11: Hoare triple {566#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {566#false} is VALID [2022-02-20 14:03:52,049 INFO L290 TraceCheckUtils]: 12: Hoare triple {566#false} assume !(main_~i~0#1 < 100000); {566#false} is VALID [2022-02-20 14:03:52,049 INFO L290 TraceCheckUtils]: 13: Hoare triple {566#false} main_~i~0#1 := 0; {566#false} is VALID [2022-02-20 14:03:52,050 INFO L290 TraceCheckUtils]: 14: Hoare triple {566#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; {566#false} is VALID [2022-02-20 14:03:52,050 INFO L290 TraceCheckUtils]: 15: Hoare triple {566#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {566#false} is VALID [2022-02-20 14:03:52,050 INFO L290 TraceCheckUtils]: 16: Hoare triple {566#false} assume !(main_~i~0#1 < 100000); {566#false} is VALID [2022-02-20 14:03:52,050 INFO L290 TraceCheckUtils]: 17: Hoare triple {566#false} main_~i~0#1 := 0; {566#false} is VALID [2022-02-20 14:03:52,051 INFO L290 TraceCheckUtils]: 18: Hoare triple {566#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; {566#false} is VALID [2022-02-20 14:03:52,051 INFO L290 TraceCheckUtils]: 19: Hoare triple {566#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {566#false} is VALID [2022-02-20 14:03:52,051 INFO L290 TraceCheckUtils]: 20: Hoare triple {566#false} assume !(main_~i~0#1 < 100000); {566#false} is VALID [2022-02-20 14:03:52,051 INFO L290 TraceCheckUtils]: 21: Hoare triple {566#false} main_~i~0#1 := 0; {566#false} is VALID [2022-02-20 14:03:52,051 INFO L290 TraceCheckUtils]: 22: Hoare triple {566#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; {566#false} is VALID [2022-02-20 14:03:52,056 INFO L290 TraceCheckUtils]: 23: Hoare triple {566#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {566#false} is VALID [2022-02-20 14:03:52,057 INFO L290 TraceCheckUtils]: 24: Hoare triple {566#false} assume !(main_~i~0#1 < 100000); {566#false} is VALID [2022-02-20 14:03:52,057 INFO L290 TraceCheckUtils]: 25: Hoare triple {566#false} main_~i~0#1 := 0; {566#false} is VALID [2022-02-20 14:03:52,057 INFO L290 TraceCheckUtils]: 26: Hoare triple {566#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; {566#false} is VALID [2022-02-20 14:03:52,057 INFO L290 TraceCheckUtils]: 27: Hoare triple {566#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {566#false} is VALID [2022-02-20 14:03:52,058 INFO L290 TraceCheckUtils]: 28: Hoare triple {566#false} assume !(main_~i~0#1 < 100000); {566#false} is VALID [2022-02-20 14:03:52,058 INFO L290 TraceCheckUtils]: 29: Hoare triple {566#false} main_~i~0#1 := 0; {566#false} is VALID [2022-02-20 14:03:52,058 INFO L290 TraceCheckUtils]: 30: Hoare triple {566#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {566#false} is VALID [2022-02-20 14:03:52,058 INFO L290 TraceCheckUtils]: 31: Hoare triple {566#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {566#false} is VALID [2022-02-20 14:03:52,058 INFO L290 TraceCheckUtils]: 32: Hoare triple {566#false} assume !(main_~i~0#1 < 100000); {566#false} is VALID [2022-02-20 14:03:52,059 INFO L290 TraceCheckUtils]: 33: Hoare triple {566#false} havoc main_~x~0#1;main_~x~0#1 := 0; {566#false} is VALID [2022-02-20 14:03:52,059 INFO L290 TraceCheckUtils]: 34: Hoare triple {566#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem18#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem19#1 := read~int(main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem18#1 == main_#t~mem19#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {566#false} is VALID [2022-02-20 14:03:52,059 INFO L290 TraceCheckUtils]: 35: Hoare triple {566#false} assume 0 == __VERIFIER_assert_~cond#1; {566#false} is VALID [2022-02-20 14:03:52,059 INFO L290 TraceCheckUtils]: 36: Hoare triple {566#false} assume !false; {566#false} is VALID [2022-02-20 14:03:52,060 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-20 14:03:52,060 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:03:52,060 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860739396] [2022-02-20 14:03:52,060 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860739396] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:03:52,062 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2128235835] [2022-02-20 14:03:52,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:03:52,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:03:52,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:03:52,068 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:52,071 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:52,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:03:52,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 14:03:52,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:03:52,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:03:52,321 INFO L290 TraceCheckUtils]: 0: Hoare triple {565#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); {565#true} is VALID [2022-02-20 14:03:52,323 INFO L290 TraceCheckUtils]: 1: Hoare triple {565#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~post15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#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_~#a8~0#1.base, main_~#a8~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);call main_~#a8~0#1.base, main_~#a8~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {575#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:03:52,325 INFO L290 TraceCheckUtils]: 2: Hoare triple {575#(<= |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; {575#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:03:52,325 INFO L290 TraceCheckUtils]: 3: Hoare triple {575#(<= |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; {568#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:03:52,326 INFO L290 TraceCheckUtils]: 4: Hoare triple {568#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume !(main_~a~0#1 < 100000); {566#false} is VALID [2022-02-20 14:03:52,326 INFO L290 TraceCheckUtils]: 5: Hoare triple {566#false} havoc main_~i~0#1;main_~i~0#1 := 0; {566#false} is VALID [2022-02-20 14:03:52,326 INFO L290 TraceCheckUtils]: 6: Hoare triple {566#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; {566#false} is VALID [2022-02-20 14:03:52,327 INFO L290 TraceCheckUtils]: 7: Hoare triple {566#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {566#false} is VALID [2022-02-20 14:03:52,327 INFO L290 TraceCheckUtils]: 8: Hoare triple {566#false} assume !(main_~i~0#1 < 100000); {566#false} is VALID [2022-02-20 14:03:52,327 INFO L290 TraceCheckUtils]: 9: Hoare triple {566#false} main_~i~0#1 := 0; {566#false} is VALID [2022-02-20 14:03:52,327 INFO L290 TraceCheckUtils]: 10: Hoare triple {566#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; {566#false} is VALID [2022-02-20 14:03:52,328 INFO L290 TraceCheckUtils]: 11: Hoare triple {566#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {566#false} is VALID [2022-02-20 14:03:52,328 INFO L290 TraceCheckUtils]: 12: Hoare triple {566#false} assume !(main_~i~0#1 < 100000); {566#false} is VALID [2022-02-20 14:03:52,328 INFO L290 TraceCheckUtils]: 13: Hoare triple {566#false} main_~i~0#1 := 0; {566#false} is VALID [2022-02-20 14:03:52,328 INFO L290 TraceCheckUtils]: 14: Hoare triple {566#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; {566#false} is VALID [2022-02-20 14:03:52,328 INFO L290 TraceCheckUtils]: 15: Hoare triple {566#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {566#false} is VALID [2022-02-20 14:03:52,329 INFO L290 TraceCheckUtils]: 16: Hoare triple {566#false} assume !(main_~i~0#1 < 100000); {566#false} is VALID [2022-02-20 14:03:52,329 INFO L290 TraceCheckUtils]: 17: Hoare triple {566#false} main_~i~0#1 := 0; {566#false} is VALID [2022-02-20 14:03:52,329 INFO L290 TraceCheckUtils]: 18: Hoare triple {566#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; {566#false} is VALID [2022-02-20 14:03:52,329 INFO L290 TraceCheckUtils]: 19: Hoare triple {566#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {566#false} is VALID [2022-02-20 14:03:52,329 INFO L290 TraceCheckUtils]: 20: Hoare triple {566#false} assume !(main_~i~0#1 < 100000); {566#false} is VALID [2022-02-20 14:03:52,330 INFO L290 TraceCheckUtils]: 21: Hoare triple {566#false} main_~i~0#1 := 0; {566#false} is VALID [2022-02-20 14:03:52,330 INFO L290 TraceCheckUtils]: 22: Hoare triple {566#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; {566#false} is VALID [2022-02-20 14:03:52,330 INFO L290 TraceCheckUtils]: 23: Hoare triple {566#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {566#false} is VALID [2022-02-20 14:03:52,330 INFO L290 TraceCheckUtils]: 24: Hoare triple {566#false} assume !(main_~i~0#1 < 100000); {566#false} is VALID [2022-02-20 14:03:52,330 INFO L290 TraceCheckUtils]: 25: Hoare triple {566#false} main_~i~0#1 := 0; {566#false} is VALID [2022-02-20 14:03:52,331 INFO L290 TraceCheckUtils]: 26: Hoare triple {566#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; {566#false} is VALID [2022-02-20 14:03:52,331 INFO L290 TraceCheckUtils]: 27: Hoare triple {566#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {566#false} is VALID [2022-02-20 14:03:52,331 INFO L290 TraceCheckUtils]: 28: Hoare triple {566#false} assume !(main_~i~0#1 < 100000); {566#false} is VALID [2022-02-20 14:03:52,331 INFO L290 TraceCheckUtils]: 29: Hoare triple {566#false} main_~i~0#1 := 0; {566#false} is VALID [2022-02-20 14:03:52,331 INFO L290 TraceCheckUtils]: 30: Hoare triple {566#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {566#false} is VALID [2022-02-20 14:03:52,332 INFO L290 TraceCheckUtils]: 31: Hoare triple {566#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {566#false} is VALID [2022-02-20 14:03:52,332 INFO L290 TraceCheckUtils]: 32: Hoare triple {566#false} assume !(main_~i~0#1 < 100000); {566#false} is VALID [2022-02-20 14:03:52,332 INFO L290 TraceCheckUtils]: 33: Hoare triple {566#false} havoc main_~x~0#1;main_~x~0#1 := 0; {566#false} is VALID [2022-02-20 14:03:52,332 INFO L290 TraceCheckUtils]: 34: Hoare triple {566#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem18#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem19#1 := read~int(main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem18#1 == main_#t~mem19#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {566#false} is VALID [2022-02-20 14:03:52,332 INFO L290 TraceCheckUtils]: 35: Hoare triple {566#false} assume 0 == __VERIFIER_assert_~cond#1; {566#false} is VALID [2022-02-20 14:03:52,333 INFO L290 TraceCheckUtils]: 36: Hoare triple {566#false} assume !false; {566#false} is VALID [2022-02-20 14:03:52,333 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-20 14:03:52,333 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:03:52,464 INFO L290 TraceCheckUtils]: 36: Hoare triple {566#false} assume !false; {566#false} is VALID [2022-02-20 14:03:52,464 INFO L290 TraceCheckUtils]: 35: Hoare triple {566#false} assume 0 == __VERIFIER_assert_~cond#1; {566#false} is VALID [2022-02-20 14:03:52,465 INFO L290 TraceCheckUtils]: 34: Hoare triple {566#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem18#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem19#1 := read~int(main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem18#1 == main_#t~mem19#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {566#false} is VALID [2022-02-20 14:03:52,465 INFO L290 TraceCheckUtils]: 33: Hoare triple {566#false} havoc main_~x~0#1;main_~x~0#1 := 0; {566#false} is VALID [2022-02-20 14:03:52,465 INFO L290 TraceCheckUtils]: 32: Hoare triple {566#false} assume !(main_~i~0#1 < 100000); {566#false} is VALID [2022-02-20 14:03:52,465 INFO L290 TraceCheckUtils]: 31: Hoare triple {566#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {566#false} is VALID [2022-02-20 14:03:52,465 INFO L290 TraceCheckUtils]: 30: Hoare triple {566#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {566#false} is VALID [2022-02-20 14:03:52,466 INFO L290 TraceCheckUtils]: 29: Hoare triple {566#false} main_~i~0#1 := 0; {566#false} is VALID [2022-02-20 14:03:52,466 INFO L290 TraceCheckUtils]: 28: Hoare triple {566#false} assume !(main_~i~0#1 < 100000); {566#false} is VALID [2022-02-20 14:03:52,466 INFO L290 TraceCheckUtils]: 27: Hoare triple {566#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {566#false} is VALID [2022-02-20 14:03:52,466 INFO L290 TraceCheckUtils]: 26: Hoare triple {566#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; {566#false} is VALID [2022-02-20 14:03:52,466 INFO L290 TraceCheckUtils]: 25: Hoare triple {566#false} main_~i~0#1 := 0; {566#false} is VALID [2022-02-20 14:03:52,467 INFO L290 TraceCheckUtils]: 24: Hoare triple {566#false} assume !(main_~i~0#1 < 100000); {566#false} is VALID [2022-02-20 14:03:52,467 INFO L290 TraceCheckUtils]: 23: Hoare triple {566#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {566#false} is VALID [2022-02-20 14:03:52,467 INFO L290 TraceCheckUtils]: 22: Hoare triple {566#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; {566#false} is VALID [2022-02-20 14:03:52,467 INFO L290 TraceCheckUtils]: 21: Hoare triple {566#false} main_~i~0#1 := 0; {566#false} is VALID [2022-02-20 14:03:52,467 INFO L290 TraceCheckUtils]: 20: Hoare triple {566#false} assume !(main_~i~0#1 < 100000); {566#false} is VALID [2022-02-20 14:03:52,468 INFO L290 TraceCheckUtils]: 19: Hoare triple {566#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {566#false} is VALID [2022-02-20 14:03:52,468 INFO L290 TraceCheckUtils]: 18: Hoare triple {566#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; {566#false} is VALID [2022-02-20 14:03:52,468 INFO L290 TraceCheckUtils]: 17: Hoare triple {566#false} main_~i~0#1 := 0; {566#false} is VALID [2022-02-20 14:03:52,468 INFO L290 TraceCheckUtils]: 16: Hoare triple {566#false} assume !(main_~i~0#1 < 100000); {566#false} is VALID [2022-02-20 14:03:52,468 INFO L290 TraceCheckUtils]: 15: Hoare triple {566#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {566#false} is VALID [2022-02-20 14:03:52,469 INFO L290 TraceCheckUtils]: 14: Hoare triple {566#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; {566#false} is VALID [2022-02-20 14:03:52,469 INFO L290 TraceCheckUtils]: 13: Hoare triple {566#false} main_~i~0#1 := 0; {566#false} is VALID [2022-02-20 14:03:52,469 INFO L290 TraceCheckUtils]: 12: Hoare triple {566#false} assume !(main_~i~0#1 < 100000); {566#false} is VALID [2022-02-20 14:03:52,469 INFO L290 TraceCheckUtils]: 11: Hoare triple {566#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {566#false} is VALID [2022-02-20 14:03:52,469 INFO L290 TraceCheckUtils]: 10: Hoare triple {566#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; {566#false} is VALID [2022-02-20 14:03:52,470 INFO L290 TraceCheckUtils]: 9: Hoare triple {566#false} main_~i~0#1 := 0; {566#false} is VALID [2022-02-20 14:03:52,470 INFO L290 TraceCheckUtils]: 8: Hoare triple {566#false} assume !(main_~i~0#1 < 100000); {566#false} is VALID [2022-02-20 14:03:52,470 INFO L290 TraceCheckUtils]: 7: Hoare triple {566#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {566#false} is VALID [2022-02-20 14:03:52,470 INFO L290 TraceCheckUtils]: 6: Hoare triple {566#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; {566#false} is VALID [2022-02-20 14:03:52,470 INFO L290 TraceCheckUtils]: 5: Hoare triple {566#false} havoc main_~i~0#1;main_~i~0#1 := 0; {566#false} is VALID [2022-02-20 14:03:52,471 INFO L290 TraceCheckUtils]: 4: Hoare triple {777#(< |ULTIMATE.start_main_~a~0#1| 100000)} assume !(main_~a~0#1 < 100000); {566#false} is VALID [2022-02-20 14:03:52,472 INFO L290 TraceCheckUtils]: 3: Hoare triple {781#(< |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; {777#(< |ULTIMATE.start_main_~a~0#1| 100000)} is VALID [2022-02-20 14:03:52,472 INFO L290 TraceCheckUtils]: 2: Hoare triple {781#(< |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; {781#(< |ULTIMATE.start_main_~a~0#1| 99999)} is VALID [2022-02-20 14:03:52,473 INFO L290 TraceCheckUtils]: 1: Hoare triple {565#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~post15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#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_~#a8~0#1.base, main_~#a8~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);call main_~#a8~0#1.base, main_~#a8~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {781#(< |ULTIMATE.start_main_~a~0#1| 99999)} is VALID [2022-02-20 14:03:52,474 INFO L290 TraceCheckUtils]: 0: Hoare triple {565#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); {565#true} is VALID [2022-02-20 14:03:52,474 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-20 14:03:52,474 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2128235835] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:03:52,474 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:03:52,475 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-02-20 14:03:52,475 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009873653] [2022-02-20 14:03:52,475 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:03:52,476 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 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 37 [2022-02-20 14:03:52,476 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:03:52,476 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have 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:52,522 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:03:52,522 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 14:03:52,523 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:03:52,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 14:03:52,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-02-20 14:03:52,524 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have 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:52,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:03:52,621 INFO L93 Difference]: Finished difference Result 81 states and 99 transitions. [2022-02-20 14:03:52,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 14:03:52,621 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 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 37 [2022-02-20 14:03:52,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:03:52,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have 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:52,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 85 transitions. [2022-02-20 14:03:52,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have 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:52,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 85 transitions. [2022-02-20 14:03:52,625 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 85 transitions. [2022-02-20 14:03:52,708 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:03:52,709 INFO L225 Difference]: With dead ends: 81 [2022-02-20 14:03:52,709 INFO L226 Difference]: Without dead ends: 46 [2022-02-20 14:03:52,710 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 71 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:52,711 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 4 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:03:52,711 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 110 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:03:52,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-02-20 14:03:52,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-02-20 14:03:52,721 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:03:52,721 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 46 states, 45 states have (on average 1.2) internal successors, (54), 45 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:03:52,721 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 46 states, 45 states have (on average 1.2) internal successors, (54), 45 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:03:52,722 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 46 states, 45 states have (on average 1.2) internal successors, (54), 45 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:03:52,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:03:52,723 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2022-02-20 14:03:52,724 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2022-02-20 14:03:52,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:03:52,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:03:52,724 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 45 states have (on average 1.2) internal successors, (54), 45 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 46 states. [2022-02-20 14:03:52,725 INFO L87 Difference]: Start difference. First operand has 46 states, 45 states have (on average 1.2) internal successors, (54), 45 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 46 states. [2022-02-20 14:03:52,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:03:52,726 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2022-02-20 14:03:52,726 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2022-02-20 14:03:52,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:03:52,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:03:52,727 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:03:52,727 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:03:52,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.2) internal successors, (54), 45 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:03:52,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2022-02-20 14:03:52,729 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 37 [2022-02-20 14:03:52,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:03:52,729 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2022-02-20 14:03:52,729 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have 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:52,730 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2022-02-20 14:03:52,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-20 14:03:52,731 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:03:52,731 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, 1, 1, 1, 1] [2022-02-20 14:03:52,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-20 14:03:52,954 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:52,954 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:03:52,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:03:52,955 INFO L85 PathProgramCache]: Analyzing trace with hash -76527901, now seen corresponding path program 2 times [2022-02-20 14:03:52,955 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:03:52,955 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792051356] [2022-02-20 14:03:52,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:03:52,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:03:53,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:03:53,050 INFO L290 TraceCheckUtils]: 0: Hoare triple {1064#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); {1064#true} is VALID [2022-02-20 14:03:53,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {1064#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~post15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#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_~#a8~0#1.base, main_~#a8~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);call main_~#a8~0#1.base, main_~#a8~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {1064#true} is VALID [2022-02-20 14:03:53,050 INFO L290 TraceCheckUtils]: 2: Hoare triple {1064#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; {1064#true} is VALID [2022-02-20 14:03:53,051 INFO L290 TraceCheckUtils]: 3: Hoare triple {1064#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1064#true} is VALID [2022-02-20 14:03:53,051 INFO L290 TraceCheckUtils]: 4: Hoare triple {1064#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; {1064#true} is VALID [2022-02-20 14:03:53,051 INFO L290 TraceCheckUtils]: 5: Hoare triple {1064#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1064#true} is VALID [2022-02-20 14:03:53,051 INFO L290 TraceCheckUtils]: 6: Hoare triple {1064#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; {1064#true} is VALID [2022-02-20 14:03:53,052 INFO L290 TraceCheckUtils]: 7: Hoare triple {1064#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1064#true} is VALID [2022-02-20 14:03:53,052 INFO L290 TraceCheckUtils]: 8: Hoare triple {1064#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; {1064#true} is VALID [2022-02-20 14:03:53,052 INFO L290 TraceCheckUtils]: 9: Hoare triple {1064#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1064#true} is VALID [2022-02-20 14:03:53,052 INFO L290 TraceCheckUtils]: 10: Hoare triple {1064#true} assume !(main_~a~0#1 < 100000); {1064#true} is VALID [2022-02-20 14:03:53,053 INFO L290 TraceCheckUtils]: 11: Hoare triple {1064#true} havoc main_~i~0#1;main_~i~0#1 := 0; {1066#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:03:53,053 INFO L290 TraceCheckUtils]: 12: Hoare triple {1066#(= |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; {1066#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:03:53,054 INFO L290 TraceCheckUtils]: 13: Hoare triple {1066#(= |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; {1067#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:03:53,054 INFO L290 TraceCheckUtils]: 14: Hoare triple {1067#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < 100000); {1065#false} is VALID [2022-02-20 14:03:53,055 INFO L290 TraceCheckUtils]: 15: Hoare triple {1065#false} main_~i~0#1 := 0; {1065#false} is VALID [2022-02-20 14:03:53,055 INFO L290 TraceCheckUtils]: 16: Hoare triple {1065#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; {1065#false} is VALID [2022-02-20 14:03:53,055 INFO L290 TraceCheckUtils]: 17: Hoare triple {1065#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1065#false} is VALID [2022-02-20 14:03:53,055 INFO L290 TraceCheckUtils]: 18: Hoare triple {1065#false} assume !(main_~i~0#1 < 100000); {1065#false} is VALID [2022-02-20 14:03:53,056 INFO L290 TraceCheckUtils]: 19: Hoare triple {1065#false} main_~i~0#1 := 0; {1065#false} is VALID [2022-02-20 14:03:53,056 INFO L290 TraceCheckUtils]: 20: Hoare triple {1065#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; {1065#false} is VALID [2022-02-20 14:03:53,056 INFO L290 TraceCheckUtils]: 21: Hoare triple {1065#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1065#false} is VALID [2022-02-20 14:03:53,056 INFO L290 TraceCheckUtils]: 22: Hoare triple {1065#false} assume !(main_~i~0#1 < 100000); {1065#false} is VALID [2022-02-20 14:03:53,056 INFO L290 TraceCheckUtils]: 23: Hoare triple {1065#false} main_~i~0#1 := 0; {1065#false} is VALID [2022-02-20 14:03:53,057 INFO L290 TraceCheckUtils]: 24: Hoare triple {1065#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; {1065#false} is VALID [2022-02-20 14:03:53,057 INFO L290 TraceCheckUtils]: 25: Hoare triple {1065#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {1065#false} is VALID [2022-02-20 14:03:53,057 INFO L290 TraceCheckUtils]: 26: Hoare triple {1065#false} assume !(main_~i~0#1 < 100000); {1065#false} is VALID [2022-02-20 14:03:53,057 INFO L290 TraceCheckUtils]: 27: Hoare triple {1065#false} main_~i~0#1 := 0; {1065#false} is VALID [2022-02-20 14:03:53,058 INFO L290 TraceCheckUtils]: 28: Hoare triple {1065#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; {1065#false} is VALID [2022-02-20 14:03:53,058 INFO L290 TraceCheckUtils]: 29: Hoare triple {1065#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {1065#false} is VALID [2022-02-20 14:03:53,058 INFO L290 TraceCheckUtils]: 30: Hoare triple {1065#false} assume !(main_~i~0#1 < 100000); {1065#false} is VALID [2022-02-20 14:03:53,058 INFO L290 TraceCheckUtils]: 31: Hoare triple {1065#false} main_~i~0#1 := 0; {1065#false} is VALID [2022-02-20 14:03:53,058 INFO L290 TraceCheckUtils]: 32: Hoare triple {1065#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; {1065#false} is VALID [2022-02-20 14:03:53,059 INFO L290 TraceCheckUtils]: 33: Hoare triple {1065#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {1065#false} is VALID [2022-02-20 14:03:53,059 INFO L290 TraceCheckUtils]: 34: Hoare triple {1065#false} assume !(main_~i~0#1 < 100000); {1065#false} is VALID [2022-02-20 14:03:53,059 INFO L290 TraceCheckUtils]: 35: Hoare triple {1065#false} main_~i~0#1 := 0; {1065#false} is VALID [2022-02-20 14:03:53,059 INFO L290 TraceCheckUtils]: 36: Hoare triple {1065#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {1065#false} is VALID [2022-02-20 14:03:53,060 INFO L290 TraceCheckUtils]: 37: Hoare triple {1065#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {1065#false} is VALID [2022-02-20 14:03:53,060 INFO L290 TraceCheckUtils]: 38: Hoare triple {1065#false} assume !(main_~i~0#1 < 100000); {1065#false} is VALID [2022-02-20 14:03:53,060 INFO L290 TraceCheckUtils]: 39: Hoare triple {1065#false} havoc main_~x~0#1;main_~x~0#1 := 0; {1065#false} is VALID [2022-02-20 14:03:53,060 INFO L290 TraceCheckUtils]: 40: Hoare triple {1065#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem18#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem19#1 := read~int(main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem18#1 == main_#t~mem19#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1065#false} is VALID [2022-02-20 14:03:53,061 INFO L290 TraceCheckUtils]: 41: Hoare triple {1065#false} assume 0 == __VERIFIER_assert_~cond#1; {1065#false} is VALID [2022-02-20 14:03:53,061 INFO L290 TraceCheckUtils]: 42: Hoare triple {1065#false} assume !false; {1065#false} is VALID [2022-02-20 14:03:53,061 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-02-20 14:03:53,061 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:03:53,062 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792051356] [2022-02-20 14:03:53,062 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792051356] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:03:53,062 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521252364] [2022-02-20 14:03:53,062 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 14:03:53,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:03:53,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:03:53,064 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:53,065 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:53,173 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 14:03:53,174 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:03:53,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 14:03:53,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:03:53,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:03:53,276 INFO L290 TraceCheckUtils]: 0: Hoare triple {1064#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); {1064#true} is VALID [2022-02-20 14:03:53,276 INFO L290 TraceCheckUtils]: 1: Hoare triple {1064#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~post15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#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_~#a8~0#1.base, main_~#a8~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);call main_~#a8~0#1.base, main_~#a8~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {1064#true} is VALID [2022-02-20 14:03:53,276 INFO L290 TraceCheckUtils]: 2: Hoare triple {1064#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; {1064#true} is VALID [2022-02-20 14:03:53,277 INFO L290 TraceCheckUtils]: 3: Hoare triple {1064#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1064#true} is VALID [2022-02-20 14:03:53,277 INFO L290 TraceCheckUtils]: 4: Hoare triple {1064#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; {1064#true} is VALID [2022-02-20 14:03:53,277 INFO L290 TraceCheckUtils]: 5: Hoare triple {1064#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1064#true} is VALID [2022-02-20 14:03:53,277 INFO L290 TraceCheckUtils]: 6: Hoare triple {1064#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; {1064#true} is VALID [2022-02-20 14:03:53,277 INFO L290 TraceCheckUtils]: 7: Hoare triple {1064#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1064#true} is VALID [2022-02-20 14:03:53,278 INFO L290 TraceCheckUtils]: 8: Hoare triple {1064#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; {1064#true} is VALID [2022-02-20 14:03:53,278 INFO L290 TraceCheckUtils]: 9: Hoare triple {1064#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1064#true} is VALID [2022-02-20 14:03:53,278 INFO L290 TraceCheckUtils]: 10: Hoare triple {1064#true} assume !(main_~a~0#1 < 100000); {1064#true} is VALID [2022-02-20 14:03:53,278 INFO L290 TraceCheckUtils]: 11: Hoare triple {1064#true} havoc main_~i~0#1;main_~i~0#1 := 0; {1064#true} is VALID [2022-02-20 14:03:53,278 INFO L290 TraceCheckUtils]: 12: Hoare triple {1064#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; {1064#true} is VALID [2022-02-20 14:03:53,278 INFO L290 TraceCheckUtils]: 13: Hoare triple {1064#true} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1064#true} is VALID [2022-02-20 14:03:53,279 INFO L290 TraceCheckUtils]: 14: Hoare triple {1064#true} assume !(main_~i~0#1 < 100000); {1064#true} is VALID [2022-02-20 14:03:53,279 INFO L290 TraceCheckUtils]: 15: Hoare triple {1064#true} main_~i~0#1 := 0; {1064#true} is VALID [2022-02-20 14:03:53,279 INFO L290 TraceCheckUtils]: 16: Hoare triple {1064#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; {1064#true} is VALID [2022-02-20 14:03:53,279 INFO L290 TraceCheckUtils]: 17: Hoare triple {1064#true} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1064#true} is VALID [2022-02-20 14:03:53,279 INFO L290 TraceCheckUtils]: 18: Hoare triple {1064#true} assume !(main_~i~0#1 < 100000); {1064#true} is VALID [2022-02-20 14:03:53,280 INFO L290 TraceCheckUtils]: 19: Hoare triple {1064#true} main_~i~0#1 := 0; {1064#true} is VALID [2022-02-20 14:03:53,280 INFO L290 TraceCheckUtils]: 20: Hoare triple {1064#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; {1064#true} is VALID [2022-02-20 14:03:53,280 INFO L290 TraceCheckUtils]: 21: Hoare triple {1064#true} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1064#true} is VALID [2022-02-20 14:03:53,280 INFO L290 TraceCheckUtils]: 22: Hoare triple {1064#true} assume !(main_~i~0#1 < 100000); {1064#true} is VALID [2022-02-20 14:03:53,280 INFO L290 TraceCheckUtils]: 23: Hoare triple {1064#true} main_~i~0#1 := 0; {1064#true} is VALID [2022-02-20 14:03:53,281 INFO L290 TraceCheckUtils]: 24: Hoare triple {1064#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; {1064#true} is VALID [2022-02-20 14:03:53,281 INFO L290 TraceCheckUtils]: 25: Hoare triple {1064#true} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {1064#true} is VALID [2022-02-20 14:03:53,281 INFO L290 TraceCheckUtils]: 26: Hoare triple {1064#true} assume !(main_~i~0#1 < 100000); {1064#true} is VALID [2022-02-20 14:03:53,281 INFO L290 TraceCheckUtils]: 27: Hoare triple {1064#true} main_~i~0#1 := 0; {1064#true} is VALID [2022-02-20 14:03:53,281 INFO L290 TraceCheckUtils]: 28: Hoare triple {1064#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; {1064#true} is VALID [2022-02-20 14:03:53,281 INFO L290 TraceCheckUtils]: 29: Hoare triple {1064#true} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {1064#true} is VALID [2022-02-20 14:03:53,282 INFO L290 TraceCheckUtils]: 30: Hoare triple {1064#true} assume !(main_~i~0#1 < 100000); {1064#true} is VALID [2022-02-20 14:03:53,282 INFO L290 TraceCheckUtils]: 31: Hoare triple {1064#true} main_~i~0#1 := 0; {1164#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:03:53,282 INFO L290 TraceCheckUtils]: 32: Hoare triple {1164#(<= |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; {1164#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:03:53,283 INFO L290 TraceCheckUtils]: 33: Hoare triple {1164#(<= |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; {1067#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:03:53,283 INFO L290 TraceCheckUtils]: 34: Hoare triple {1067#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < 100000); {1065#false} is VALID [2022-02-20 14:03:53,284 INFO L290 TraceCheckUtils]: 35: Hoare triple {1065#false} main_~i~0#1 := 0; {1065#false} is VALID [2022-02-20 14:03:53,284 INFO L290 TraceCheckUtils]: 36: Hoare triple {1065#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {1065#false} is VALID [2022-02-20 14:03:53,284 INFO L290 TraceCheckUtils]: 37: Hoare triple {1065#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {1065#false} is VALID [2022-02-20 14:03:53,284 INFO L290 TraceCheckUtils]: 38: Hoare triple {1065#false} assume !(main_~i~0#1 < 100000); {1065#false} is VALID [2022-02-20 14:03:53,284 INFO L290 TraceCheckUtils]: 39: Hoare triple {1065#false} havoc main_~x~0#1;main_~x~0#1 := 0; {1065#false} is VALID [2022-02-20 14:03:53,285 INFO L290 TraceCheckUtils]: 40: Hoare triple {1065#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem18#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem19#1 := read~int(main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem18#1 == main_#t~mem19#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1065#false} is VALID [2022-02-20 14:03:53,285 INFO L290 TraceCheckUtils]: 41: Hoare triple {1065#false} assume 0 == __VERIFIER_assert_~cond#1; {1065#false} is VALID [2022-02-20 14:03:53,285 INFO L290 TraceCheckUtils]: 42: Hoare triple {1065#false} assume !false; {1065#false} is VALID [2022-02-20 14:03:53,285 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-02-20 14:03:53,285 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:03:53,367 INFO L290 TraceCheckUtils]: 42: Hoare triple {1065#false} assume !false; {1065#false} is VALID [2022-02-20 14:03:53,367 INFO L290 TraceCheckUtils]: 41: Hoare triple {1065#false} assume 0 == __VERIFIER_assert_~cond#1; {1065#false} is VALID [2022-02-20 14:03:53,368 INFO L290 TraceCheckUtils]: 40: Hoare triple {1065#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem18#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem19#1 := read~int(main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem18#1 == main_#t~mem19#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1065#false} is VALID [2022-02-20 14:03:53,368 INFO L290 TraceCheckUtils]: 39: Hoare triple {1065#false} havoc main_~x~0#1;main_~x~0#1 := 0; {1065#false} is VALID [2022-02-20 14:03:53,368 INFO L290 TraceCheckUtils]: 38: Hoare triple {1065#false} assume !(main_~i~0#1 < 100000); {1065#false} is VALID [2022-02-20 14:03:53,368 INFO L290 TraceCheckUtils]: 37: Hoare triple {1065#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {1065#false} is VALID [2022-02-20 14:03:53,368 INFO L290 TraceCheckUtils]: 36: Hoare triple {1065#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {1065#false} is VALID [2022-02-20 14:03:53,369 INFO L290 TraceCheckUtils]: 35: Hoare triple {1065#false} main_~i~0#1 := 0; {1065#false} is VALID [2022-02-20 14:03:53,369 INFO L290 TraceCheckUtils]: 34: Hoare triple {1222#(< |ULTIMATE.start_main_~i~0#1| 100000)} assume !(main_~i~0#1 < 100000); {1065#false} is VALID [2022-02-20 14:03:53,370 INFO L290 TraceCheckUtils]: 33: Hoare triple {1226#(< |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; {1222#(< |ULTIMATE.start_main_~i~0#1| 100000)} is VALID [2022-02-20 14:03:53,370 INFO L290 TraceCheckUtils]: 32: Hoare triple {1226#(< |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; {1226#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:03:53,370 INFO L290 TraceCheckUtils]: 31: Hoare triple {1064#true} main_~i~0#1 := 0; {1226#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:03:53,371 INFO L290 TraceCheckUtils]: 30: Hoare triple {1064#true} assume !(main_~i~0#1 < 100000); {1064#true} is VALID [2022-02-20 14:03:53,371 INFO L290 TraceCheckUtils]: 29: Hoare triple {1064#true} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {1064#true} is VALID [2022-02-20 14:03:53,371 INFO L290 TraceCheckUtils]: 28: Hoare triple {1064#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; {1064#true} is VALID [2022-02-20 14:03:53,371 INFO L290 TraceCheckUtils]: 27: Hoare triple {1064#true} main_~i~0#1 := 0; {1064#true} is VALID [2022-02-20 14:03:53,371 INFO L290 TraceCheckUtils]: 26: Hoare triple {1064#true} assume !(main_~i~0#1 < 100000); {1064#true} is VALID [2022-02-20 14:03:53,371 INFO L290 TraceCheckUtils]: 25: Hoare triple {1064#true} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {1064#true} is VALID [2022-02-20 14:03:53,372 INFO L290 TraceCheckUtils]: 24: Hoare triple {1064#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; {1064#true} is VALID [2022-02-20 14:03:53,372 INFO L290 TraceCheckUtils]: 23: Hoare triple {1064#true} main_~i~0#1 := 0; {1064#true} is VALID [2022-02-20 14:03:53,372 INFO L290 TraceCheckUtils]: 22: Hoare triple {1064#true} assume !(main_~i~0#1 < 100000); {1064#true} is VALID [2022-02-20 14:03:53,372 INFO L290 TraceCheckUtils]: 21: Hoare triple {1064#true} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1064#true} is VALID [2022-02-20 14:03:53,372 INFO L290 TraceCheckUtils]: 20: Hoare triple {1064#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; {1064#true} is VALID [2022-02-20 14:03:53,373 INFO L290 TraceCheckUtils]: 19: Hoare triple {1064#true} main_~i~0#1 := 0; {1064#true} is VALID [2022-02-20 14:03:53,373 INFO L290 TraceCheckUtils]: 18: Hoare triple {1064#true} assume !(main_~i~0#1 < 100000); {1064#true} is VALID [2022-02-20 14:03:53,373 INFO L290 TraceCheckUtils]: 17: Hoare triple {1064#true} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1064#true} is VALID [2022-02-20 14:03:53,373 INFO L290 TraceCheckUtils]: 16: Hoare triple {1064#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; {1064#true} is VALID [2022-02-20 14:03:53,373 INFO L290 TraceCheckUtils]: 15: Hoare triple {1064#true} main_~i~0#1 := 0; {1064#true} is VALID [2022-02-20 14:03:53,373 INFO L290 TraceCheckUtils]: 14: Hoare triple {1064#true} assume !(main_~i~0#1 < 100000); {1064#true} is VALID [2022-02-20 14:03:53,374 INFO L290 TraceCheckUtils]: 13: Hoare triple {1064#true} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1064#true} is VALID [2022-02-20 14:03:53,374 INFO L290 TraceCheckUtils]: 12: Hoare triple {1064#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; {1064#true} is VALID [2022-02-20 14:03:53,374 INFO L290 TraceCheckUtils]: 11: Hoare triple {1064#true} havoc main_~i~0#1;main_~i~0#1 := 0; {1064#true} is VALID [2022-02-20 14:03:53,374 INFO L290 TraceCheckUtils]: 10: Hoare triple {1064#true} assume !(main_~a~0#1 < 100000); {1064#true} is VALID [2022-02-20 14:03:53,374 INFO L290 TraceCheckUtils]: 9: Hoare triple {1064#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1064#true} is VALID [2022-02-20 14:03:53,374 INFO L290 TraceCheckUtils]: 8: Hoare triple {1064#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; {1064#true} is VALID [2022-02-20 14:03:53,375 INFO L290 TraceCheckUtils]: 7: Hoare triple {1064#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1064#true} is VALID [2022-02-20 14:03:53,375 INFO L290 TraceCheckUtils]: 6: Hoare triple {1064#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; {1064#true} is VALID [2022-02-20 14:03:53,375 INFO L290 TraceCheckUtils]: 5: Hoare triple {1064#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1064#true} is VALID [2022-02-20 14:03:53,375 INFO L290 TraceCheckUtils]: 4: Hoare triple {1064#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; {1064#true} is VALID [2022-02-20 14:03:53,375 INFO L290 TraceCheckUtils]: 3: Hoare triple {1064#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1064#true} is VALID [2022-02-20 14:03:53,376 INFO L290 TraceCheckUtils]: 2: Hoare triple {1064#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; {1064#true} is VALID [2022-02-20 14:03:53,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {1064#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~post15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#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_~#a8~0#1.base, main_~#a8~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);call main_~#a8~0#1.base, main_~#a8~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {1064#true} is VALID [2022-02-20 14:03:53,376 INFO L290 TraceCheckUtils]: 0: Hoare triple {1064#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); {1064#true} is VALID [2022-02-20 14:03:53,376 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-02-20 14:03:53,376 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [521252364] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:03:53,377 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:03:53,377 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-02-20 14:03:53,377 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858669486] [2022-02-20 14:03:53,377 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:03:53,378 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 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 43 [2022-02-20 14:03:53,380 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:03:53,380 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have 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:53,431 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:03:53,431 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 14:03:53,431 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:03:53,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 14:03:53,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-02-20 14:03:53,432 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have 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:53,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:03:53,811 INFO L93 Difference]: Finished difference Result 119 states and 154 transitions. [2022-02-20 14:03:53,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 14:03:53,811 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 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 43 [2022-02-20 14:03:53,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:03:53,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have 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:53,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 141 transitions. [2022-02-20 14:03:53,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have 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:53,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 141 transitions. [2022-02-20 14:03:53,814 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 141 transitions. [2022-02-20 14:03:53,905 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:03:53,906 INFO L225 Difference]: With dead ends: 119 [2022-02-20 14:03:53,906 INFO L226 Difference]: Without dead ends: 88 [2022-02-20 14:03:53,907 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 83 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:53,908 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 50 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:03:53,908 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 48 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:03:53,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-02-20 14:03:53,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-02-20 14:03:53,929 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:03:53,930 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand has 88 states, 87 states have (on average 1.103448275862069) internal successors, (96), 87 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have 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:53,930 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand has 88 states, 87 states have (on average 1.103448275862069) internal successors, (96), 87 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have 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:53,930 INFO L87 Difference]: Start difference. First operand 88 states. Second operand has 88 states, 87 states have (on average 1.103448275862069) internal successors, (96), 87 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have 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:53,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:03:53,932 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2022-02-20 14:03:53,932 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2022-02-20 14:03:53,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:03:53,933 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:03:53,933 INFO L74 IsIncluded]: Start isIncluded. First operand has 88 states, 87 states have (on average 1.103448275862069) internal successors, (96), 87 states have internal predecessors, (96), 0 states have call successors, (0), 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 88 states. [2022-02-20 14:03:53,934 INFO L87 Difference]: Start difference. First operand has 88 states, 87 states have (on average 1.103448275862069) internal successors, (96), 87 states have internal predecessors, (96), 0 states have call successors, (0), 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 88 states. [2022-02-20 14:03:53,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:03:53,936 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2022-02-20 14:03:53,936 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2022-02-20 14:03:53,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:03:53,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:03:53,937 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:03:53,937 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:03:53,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 87 states have (on average 1.103448275862069) internal successors, (96), 87 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have 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:53,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2022-02-20 14:03:53,939 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 43 [2022-02-20 14:03:53,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:03:53,940 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2022-02-20 14:03:53,940 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have 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:53,940 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2022-02-20 14:03:53,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-02-20 14:03:53,942 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:03:53,942 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1] [2022-02-20 14:03:53,961 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:54,151 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:54,152 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:03:54,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:03:54,152 INFO L85 PathProgramCache]: Analyzing trace with hash 932289401, now seen corresponding path program 3 times [2022-02-20 14:03:54,152 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:03:54,152 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632933763] [2022-02-20 14:03:54,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:03:54,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:03:54,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:03:54,312 INFO L290 TraceCheckUtils]: 0: Hoare triple {1803#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); {1803#true} is VALID [2022-02-20 14:03:54,313 INFO L290 TraceCheckUtils]: 1: Hoare triple {1803#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~post15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#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_~#a8~0#1.base, main_~#a8~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);call main_~#a8~0#1.base, main_~#a8~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {1805#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:03:54,313 INFO L290 TraceCheckUtils]: 2: Hoare triple {1805#(= |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; {1805#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:03:54,314 INFO L290 TraceCheckUtils]: 3: Hoare triple {1805#(= |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; {1806#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:03:54,314 INFO L290 TraceCheckUtils]: 4: Hoare triple {1806#(<= |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; {1806#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:03:54,315 INFO L290 TraceCheckUtils]: 5: Hoare triple {1806#(<= |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; {1807#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-20 14:03:54,315 INFO L290 TraceCheckUtils]: 6: Hoare triple {1807#(<= |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; {1807#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-20 14:03:54,316 INFO L290 TraceCheckUtils]: 7: Hoare triple {1807#(<= |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; {1808#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-20 14:03:54,316 INFO L290 TraceCheckUtils]: 8: Hoare triple {1808#(<= |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; {1808#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-20 14:03:54,317 INFO L290 TraceCheckUtils]: 9: Hoare triple {1808#(<= |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; {1809#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-20 14:03:54,317 INFO L290 TraceCheckUtils]: 10: Hoare triple {1809#(<= |ULTIMATE.start_main_~a~0#1| 4)} assume !(main_~a~0#1 < 100000); {1804#false} is VALID [2022-02-20 14:03:54,317 INFO L290 TraceCheckUtils]: 11: Hoare triple {1804#false} havoc main_~i~0#1;main_~i~0#1 := 0; {1804#false} is VALID [2022-02-20 14:03:54,318 INFO L290 TraceCheckUtils]: 12: Hoare triple {1804#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; {1804#false} is VALID [2022-02-20 14:03:54,318 INFO L290 TraceCheckUtils]: 13: Hoare triple {1804#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1804#false} is VALID [2022-02-20 14:03:54,318 INFO L290 TraceCheckUtils]: 14: Hoare triple {1804#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; {1804#false} is VALID [2022-02-20 14:03:54,318 INFO L290 TraceCheckUtils]: 15: Hoare triple {1804#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1804#false} is VALID [2022-02-20 14:03:54,318 INFO L290 TraceCheckUtils]: 16: Hoare triple {1804#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; {1804#false} is VALID [2022-02-20 14:03:54,319 INFO L290 TraceCheckUtils]: 17: Hoare triple {1804#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1804#false} is VALID [2022-02-20 14:03:54,319 INFO L290 TraceCheckUtils]: 18: Hoare triple {1804#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; {1804#false} is VALID [2022-02-20 14:03:54,319 INFO L290 TraceCheckUtils]: 19: Hoare triple {1804#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1804#false} is VALID [2022-02-20 14:03:54,319 INFO L290 TraceCheckUtils]: 20: Hoare triple {1804#false} assume !(main_~i~0#1 < 100000); {1804#false} is VALID [2022-02-20 14:03:54,319 INFO L290 TraceCheckUtils]: 21: Hoare triple {1804#false} main_~i~0#1 := 0; {1804#false} is VALID [2022-02-20 14:03:54,319 INFO L290 TraceCheckUtils]: 22: Hoare triple {1804#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; {1804#false} is VALID [2022-02-20 14:03:54,320 INFO L290 TraceCheckUtils]: 23: Hoare triple {1804#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1804#false} is VALID [2022-02-20 14:03:54,320 INFO L290 TraceCheckUtils]: 24: Hoare triple {1804#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; {1804#false} is VALID [2022-02-20 14:03:54,320 INFO L290 TraceCheckUtils]: 25: Hoare triple {1804#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1804#false} is VALID [2022-02-20 14:03:54,320 INFO L290 TraceCheckUtils]: 26: Hoare triple {1804#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; {1804#false} is VALID [2022-02-20 14:03:54,320 INFO L290 TraceCheckUtils]: 27: Hoare triple {1804#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1804#false} is VALID [2022-02-20 14:03:54,320 INFO L290 TraceCheckUtils]: 28: Hoare triple {1804#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; {1804#false} is VALID [2022-02-20 14:03:54,321 INFO L290 TraceCheckUtils]: 29: Hoare triple {1804#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1804#false} is VALID [2022-02-20 14:03:54,321 INFO L290 TraceCheckUtils]: 30: Hoare triple {1804#false} assume !(main_~i~0#1 < 100000); {1804#false} is VALID [2022-02-20 14:03:54,321 INFO L290 TraceCheckUtils]: 31: Hoare triple {1804#false} main_~i~0#1 := 0; {1804#false} is VALID [2022-02-20 14:03:54,321 INFO L290 TraceCheckUtils]: 32: Hoare triple {1804#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; {1804#false} is VALID [2022-02-20 14:03:54,321 INFO L290 TraceCheckUtils]: 33: Hoare triple {1804#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1804#false} is VALID [2022-02-20 14:03:54,322 INFO L290 TraceCheckUtils]: 34: Hoare triple {1804#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; {1804#false} is VALID [2022-02-20 14:03:54,322 INFO L290 TraceCheckUtils]: 35: Hoare triple {1804#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1804#false} is VALID [2022-02-20 14:03:54,322 INFO L290 TraceCheckUtils]: 36: Hoare triple {1804#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; {1804#false} is VALID [2022-02-20 14:03:54,322 INFO L290 TraceCheckUtils]: 37: Hoare triple {1804#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1804#false} is VALID [2022-02-20 14:03:54,322 INFO L290 TraceCheckUtils]: 38: Hoare triple {1804#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; {1804#false} is VALID [2022-02-20 14:03:54,322 INFO L290 TraceCheckUtils]: 39: Hoare triple {1804#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1804#false} is VALID [2022-02-20 14:03:54,323 INFO L290 TraceCheckUtils]: 40: Hoare triple {1804#false} assume !(main_~i~0#1 < 100000); {1804#false} is VALID [2022-02-20 14:03:54,323 INFO L290 TraceCheckUtils]: 41: Hoare triple {1804#false} main_~i~0#1 := 0; {1804#false} is VALID [2022-02-20 14:03:54,323 INFO L290 TraceCheckUtils]: 42: Hoare triple {1804#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; {1804#false} is VALID [2022-02-20 14:03:54,323 INFO L290 TraceCheckUtils]: 43: Hoare triple {1804#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {1804#false} is VALID [2022-02-20 14:03:54,323 INFO L290 TraceCheckUtils]: 44: Hoare triple {1804#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; {1804#false} is VALID [2022-02-20 14:03:54,323 INFO L290 TraceCheckUtils]: 45: Hoare triple {1804#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {1804#false} is VALID [2022-02-20 14:03:54,324 INFO L290 TraceCheckUtils]: 46: Hoare triple {1804#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; {1804#false} is VALID [2022-02-20 14:03:54,324 INFO L290 TraceCheckUtils]: 47: Hoare triple {1804#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {1804#false} is VALID [2022-02-20 14:03:54,324 INFO L290 TraceCheckUtils]: 48: Hoare triple {1804#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; {1804#false} is VALID [2022-02-20 14:03:54,324 INFO L290 TraceCheckUtils]: 49: Hoare triple {1804#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {1804#false} is VALID [2022-02-20 14:03:54,324 INFO L290 TraceCheckUtils]: 50: Hoare triple {1804#false} assume !(main_~i~0#1 < 100000); {1804#false} is VALID [2022-02-20 14:03:54,325 INFO L290 TraceCheckUtils]: 51: Hoare triple {1804#false} main_~i~0#1 := 0; {1804#false} is VALID [2022-02-20 14:03:54,325 INFO L290 TraceCheckUtils]: 52: Hoare triple {1804#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; {1804#false} is VALID [2022-02-20 14:03:54,325 INFO L290 TraceCheckUtils]: 53: Hoare triple {1804#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {1804#false} is VALID [2022-02-20 14:03:54,325 INFO L290 TraceCheckUtils]: 54: Hoare triple {1804#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; {1804#false} is VALID [2022-02-20 14:03:54,325 INFO L290 TraceCheckUtils]: 55: Hoare triple {1804#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {1804#false} is VALID [2022-02-20 14:03:54,325 INFO L290 TraceCheckUtils]: 56: Hoare triple {1804#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; {1804#false} is VALID [2022-02-20 14:03:54,326 INFO L290 TraceCheckUtils]: 57: Hoare triple {1804#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {1804#false} is VALID [2022-02-20 14:03:54,326 INFO L290 TraceCheckUtils]: 58: Hoare triple {1804#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; {1804#false} is VALID [2022-02-20 14:03:54,326 INFO L290 TraceCheckUtils]: 59: Hoare triple {1804#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {1804#false} is VALID [2022-02-20 14:03:54,326 INFO L290 TraceCheckUtils]: 60: Hoare triple {1804#false} assume !(main_~i~0#1 < 100000); {1804#false} is VALID [2022-02-20 14:03:54,326 INFO L290 TraceCheckUtils]: 61: Hoare triple {1804#false} main_~i~0#1 := 0; {1804#false} is VALID [2022-02-20 14:03:54,327 INFO L290 TraceCheckUtils]: 62: Hoare triple {1804#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; {1804#false} is VALID [2022-02-20 14:03:54,328 INFO L290 TraceCheckUtils]: 63: Hoare triple {1804#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {1804#false} is VALID [2022-02-20 14:03:54,331 INFO L290 TraceCheckUtils]: 64: Hoare triple {1804#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; {1804#false} is VALID [2022-02-20 14:03:54,333 INFO L290 TraceCheckUtils]: 65: Hoare triple {1804#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {1804#false} is VALID [2022-02-20 14:03:54,333 INFO L290 TraceCheckUtils]: 66: Hoare triple {1804#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; {1804#false} is VALID [2022-02-20 14:03:54,334 INFO L290 TraceCheckUtils]: 67: Hoare triple {1804#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {1804#false} is VALID [2022-02-20 14:03:54,334 INFO L290 TraceCheckUtils]: 68: Hoare triple {1804#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; {1804#false} is VALID [2022-02-20 14:03:54,334 INFO L290 TraceCheckUtils]: 69: Hoare triple {1804#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {1804#false} is VALID [2022-02-20 14:03:54,335 INFO L290 TraceCheckUtils]: 70: Hoare triple {1804#false} assume !(main_~i~0#1 < 100000); {1804#false} is VALID [2022-02-20 14:03:54,335 INFO L290 TraceCheckUtils]: 71: Hoare triple {1804#false} main_~i~0#1 := 0; {1804#false} is VALID [2022-02-20 14:03:54,336 INFO L290 TraceCheckUtils]: 72: Hoare triple {1804#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {1804#false} is VALID [2022-02-20 14:03:54,336 INFO L290 TraceCheckUtils]: 73: Hoare triple {1804#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {1804#false} is VALID [2022-02-20 14:03:54,337 INFO L290 TraceCheckUtils]: 74: Hoare triple {1804#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {1804#false} is VALID [2022-02-20 14:03:54,338 INFO L290 TraceCheckUtils]: 75: Hoare triple {1804#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {1804#false} is VALID [2022-02-20 14:03:54,340 INFO L290 TraceCheckUtils]: 76: Hoare triple {1804#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {1804#false} is VALID [2022-02-20 14:03:54,342 INFO L290 TraceCheckUtils]: 77: Hoare triple {1804#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {1804#false} is VALID [2022-02-20 14:03:54,342 INFO L290 TraceCheckUtils]: 78: Hoare triple {1804#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {1804#false} is VALID [2022-02-20 14:03:54,342 INFO L290 TraceCheckUtils]: 79: Hoare triple {1804#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {1804#false} is VALID [2022-02-20 14:03:54,342 INFO L290 TraceCheckUtils]: 80: Hoare triple {1804#false} assume !(main_~i~0#1 < 100000); {1804#false} is VALID [2022-02-20 14:03:54,343 INFO L290 TraceCheckUtils]: 81: Hoare triple {1804#false} havoc main_~x~0#1;main_~x~0#1 := 0; {1804#false} is VALID [2022-02-20 14:03:54,343 INFO L290 TraceCheckUtils]: 82: Hoare triple {1804#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem18#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem19#1 := read~int(main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem18#1 == main_#t~mem19#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1804#false} is VALID [2022-02-20 14:03:54,343 INFO L290 TraceCheckUtils]: 83: Hoare triple {1804#false} assume 0 == __VERIFIER_assert_~cond#1; {1804#false} is VALID [2022-02-20 14:03:54,343 INFO L290 TraceCheckUtils]: 84: Hoare triple {1804#false} assume !false; {1804#false} is VALID [2022-02-20 14:03:54,343 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-02-20 14:03:54,344 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:03:54,344 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632933763] [2022-02-20 14:03:54,345 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632933763] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:03:54,345 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967137348] [2022-02-20 14:03:54,345 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 14:03:54,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:03:54,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:03:54,346 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:54,348 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:55,127 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-02-20 14:03:55,127 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:03:55,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 14:03:55,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:03:55,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:03:55,421 INFO L290 TraceCheckUtils]: 0: Hoare triple {1803#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); {1803#true} is VALID [2022-02-20 14:03:55,421 INFO L290 TraceCheckUtils]: 1: Hoare triple {1803#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~post15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#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_~#a8~0#1.base, main_~#a8~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);call main_~#a8~0#1.base, main_~#a8~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {1803#true} is VALID [2022-02-20 14:03:55,422 INFO L290 TraceCheckUtils]: 2: Hoare triple {1803#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; {1803#true} is VALID [2022-02-20 14:03:55,422 INFO L290 TraceCheckUtils]: 3: Hoare triple {1803#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1803#true} is VALID [2022-02-20 14:03:55,422 INFO L290 TraceCheckUtils]: 4: Hoare triple {1803#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; {1803#true} is VALID [2022-02-20 14:03:55,422 INFO L290 TraceCheckUtils]: 5: Hoare triple {1803#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1803#true} is VALID [2022-02-20 14:03:55,422 INFO L290 TraceCheckUtils]: 6: Hoare triple {1803#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; {1803#true} is VALID [2022-02-20 14:03:55,422 INFO L290 TraceCheckUtils]: 7: Hoare triple {1803#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1803#true} is VALID [2022-02-20 14:03:55,423 INFO L290 TraceCheckUtils]: 8: Hoare triple {1803#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; {1803#true} is VALID [2022-02-20 14:03:55,423 INFO L290 TraceCheckUtils]: 9: Hoare triple {1803#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1803#true} is VALID [2022-02-20 14:03:55,423 INFO L290 TraceCheckUtils]: 10: Hoare triple {1803#true} assume !(main_~a~0#1 < 100000); {1803#true} is VALID [2022-02-20 14:03:55,423 INFO L290 TraceCheckUtils]: 11: Hoare triple {1803#true} havoc main_~i~0#1;main_~i~0#1 := 0; {1803#true} is VALID [2022-02-20 14:03:55,423 INFO L290 TraceCheckUtils]: 12: Hoare triple {1803#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; {1803#true} is VALID [2022-02-20 14:03:55,423 INFO L290 TraceCheckUtils]: 13: Hoare triple {1803#true} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1803#true} is VALID [2022-02-20 14:03:55,424 INFO L290 TraceCheckUtils]: 14: Hoare triple {1803#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; {1803#true} is VALID [2022-02-20 14:03:55,424 INFO L290 TraceCheckUtils]: 15: Hoare triple {1803#true} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1803#true} is VALID [2022-02-20 14:03:55,424 INFO L290 TraceCheckUtils]: 16: Hoare triple {1803#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; {1803#true} is VALID [2022-02-20 14:03:55,424 INFO L290 TraceCheckUtils]: 17: Hoare triple {1803#true} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1803#true} is VALID [2022-02-20 14:03:55,424 INFO L290 TraceCheckUtils]: 18: Hoare triple {1803#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; {1803#true} is VALID [2022-02-20 14:03:55,425 INFO L290 TraceCheckUtils]: 19: Hoare triple {1803#true} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1803#true} is VALID [2022-02-20 14:03:55,425 INFO L290 TraceCheckUtils]: 20: Hoare triple {1803#true} assume !(main_~i~0#1 < 100000); {1803#true} is VALID [2022-02-20 14:03:55,425 INFO L290 TraceCheckUtils]: 21: Hoare triple {1803#true} main_~i~0#1 := 0; {1803#true} is VALID [2022-02-20 14:03:55,425 INFO L290 TraceCheckUtils]: 22: Hoare triple {1803#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; {1803#true} is VALID [2022-02-20 14:03:55,425 INFO L290 TraceCheckUtils]: 23: Hoare triple {1803#true} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1803#true} is VALID [2022-02-20 14:03:55,425 INFO L290 TraceCheckUtils]: 24: Hoare triple {1803#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; {1803#true} is VALID [2022-02-20 14:03:55,426 INFO L290 TraceCheckUtils]: 25: Hoare triple {1803#true} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1803#true} is VALID [2022-02-20 14:03:55,426 INFO L290 TraceCheckUtils]: 26: Hoare triple {1803#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; {1803#true} is VALID [2022-02-20 14:03:55,426 INFO L290 TraceCheckUtils]: 27: Hoare triple {1803#true} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1803#true} is VALID [2022-02-20 14:03:55,426 INFO L290 TraceCheckUtils]: 28: Hoare triple {1803#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; {1803#true} is VALID [2022-02-20 14:03:55,426 INFO L290 TraceCheckUtils]: 29: Hoare triple {1803#true} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1803#true} is VALID [2022-02-20 14:03:55,426 INFO L290 TraceCheckUtils]: 30: Hoare triple {1803#true} assume !(main_~i~0#1 < 100000); {1803#true} is VALID [2022-02-20 14:03:55,427 INFO L290 TraceCheckUtils]: 31: Hoare triple {1803#true} main_~i~0#1 := 0; {1803#true} is VALID [2022-02-20 14:03:55,427 INFO L290 TraceCheckUtils]: 32: Hoare triple {1803#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; {1803#true} is VALID [2022-02-20 14:03:55,427 INFO L290 TraceCheckUtils]: 33: Hoare triple {1803#true} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1803#true} is VALID [2022-02-20 14:03:55,427 INFO L290 TraceCheckUtils]: 34: Hoare triple {1803#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; {1803#true} is VALID [2022-02-20 14:03:55,427 INFO L290 TraceCheckUtils]: 35: Hoare triple {1803#true} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1803#true} is VALID [2022-02-20 14:03:55,427 INFO L290 TraceCheckUtils]: 36: Hoare triple {1803#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; {1803#true} is VALID [2022-02-20 14:03:55,428 INFO L290 TraceCheckUtils]: 37: Hoare triple {1803#true} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1803#true} is VALID [2022-02-20 14:03:55,428 INFO L290 TraceCheckUtils]: 38: Hoare triple {1803#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; {1803#true} is VALID [2022-02-20 14:03:55,428 INFO L290 TraceCheckUtils]: 39: Hoare triple {1803#true} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1803#true} is VALID [2022-02-20 14:03:55,428 INFO L290 TraceCheckUtils]: 40: Hoare triple {1803#true} assume !(main_~i~0#1 < 100000); {1803#true} is VALID [2022-02-20 14:03:55,428 INFO L290 TraceCheckUtils]: 41: Hoare triple {1803#true} main_~i~0#1 := 0; {1803#true} is VALID [2022-02-20 14:03:55,429 INFO L290 TraceCheckUtils]: 42: Hoare triple {1803#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; {1803#true} is VALID [2022-02-20 14:03:55,429 INFO L290 TraceCheckUtils]: 43: Hoare triple {1803#true} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {1803#true} is VALID [2022-02-20 14:03:55,429 INFO L290 TraceCheckUtils]: 44: Hoare triple {1803#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; {1803#true} is VALID [2022-02-20 14:03:55,429 INFO L290 TraceCheckUtils]: 45: Hoare triple {1803#true} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {1803#true} is VALID [2022-02-20 14:03:55,429 INFO L290 TraceCheckUtils]: 46: Hoare triple {1803#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; {1803#true} is VALID [2022-02-20 14:03:55,429 INFO L290 TraceCheckUtils]: 47: Hoare triple {1803#true} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {1803#true} is VALID [2022-02-20 14:03:55,430 INFO L290 TraceCheckUtils]: 48: Hoare triple {1803#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; {1803#true} is VALID [2022-02-20 14:03:55,430 INFO L290 TraceCheckUtils]: 49: Hoare triple {1803#true} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {1803#true} is VALID [2022-02-20 14:03:55,430 INFO L290 TraceCheckUtils]: 50: Hoare triple {1803#true} assume !(main_~i~0#1 < 100000); {1803#true} is VALID [2022-02-20 14:03:55,430 INFO L290 TraceCheckUtils]: 51: Hoare triple {1803#true} main_~i~0#1 := 0; {1803#true} is VALID [2022-02-20 14:03:55,430 INFO L290 TraceCheckUtils]: 52: Hoare triple {1803#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; {1803#true} is VALID [2022-02-20 14:03:55,430 INFO L290 TraceCheckUtils]: 53: Hoare triple {1803#true} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {1803#true} is VALID [2022-02-20 14:03:55,431 INFO L290 TraceCheckUtils]: 54: Hoare triple {1803#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; {1803#true} is VALID [2022-02-20 14:03:55,431 INFO L290 TraceCheckUtils]: 55: Hoare triple {1803#true} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {1803#true} is VALID [2022-02-20 14:03:55,431 INFO L290 TraceCheckUtils]: 56: Hoare triple {1803#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; {1803#true} is VALID [2022-02-20 14:03:55,431 INFO L290 TraceCheckUtils]: 57: Hoare triple {1803#true} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {1803#true} is VALID [2022-02-20 14:03:55,431 INFO L290 TraceCheckUtils]: 58: Hoare triple {1803#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; {1803#true} is VALID [2022-02-20 14:03:55,431 INFO L290 TraceCheckUtils]: 59: Hoare triple {1803#true} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {1803#true} is VALID [2022-02-20 14:03:55,432 INFO L290 TraceCheckUtils]: 60: Hoare triple {1803#true} assume !(main_~i~0#1 < 100000); {1803#true} is VALID [2022-02-20 14:03:55,432 INFO L290 TraceCheckUtils]: 61: Hoare triple {1803#true} main_~i~0#1 := 0; {1996#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:03:55,432 INFO L290 TraceCheckUtils]: 62: Hoare triple {1996#(<= |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; {1996#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:03:55,433 INFO L290 TraceCheckUtils]: 63: Hoare triple {1996#(<= |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; {2003#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:03:55,433 INFO L290 TraceCheckUtils]: 64: Hoare triple {2003#(<= |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; {2003#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:03:55,434 INFO L290 TraceCheckUtils]: 65: Hoare triple {2003#(<= |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; {2010#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:03:55,434 INFO L290 TraceCheckUtils]: 66: Hoare triple {2010#(<= |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; {2010#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:03:55,435 INFO L290 TraceCheckUtils]: 67: Hoare triple {2010#(<= |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; {2017#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:03:55,435 INFO L290 TraceCheckUtils]: 68: Hoare triple {2017#(<= |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; {2017#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:03:55,436 INFO L290 TraceCheckUtils]: 69: Hoare triple {2017#(<= |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; {2024#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:03:55,436 INFO L290 TraceCheckUtils]: 70: Hoare triple {2024#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !(main_~i~0#1 < 100000); {1804#false} is VALID [2022-02-20 14:03:55,436 INFO L290 TraceCheckUtils]: 71: Hoare triple {1804#false} main_~i~0#1 := 0; {1804#false} is VALID [2022-02-20 14:03:55,436 INFO L290 TraceCheckUtils]: 72: Hoare triple {1804#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {1804#false} is VALID [2022-02-20 14:03:55,437 INFO L290 TraceCheckUtils]: 73: Hoare triple {1804#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {1804#false} is VALID [2022-02-20 14:03:55,437 INFO L290 TraceCheckUtils]: 74: Hoare triple {1804#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {1804#false} is VALID [2022-02-20 14:03:55,437 INFO L290 TraceCheckUtils]: 75: Hoare triple {1804#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {1804#false} is VALID [2022-02-20 14:03:55,437 INFO L290 TraceCheckUtils]: 76: Hoare triple {1804#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {1804#false} is VALID [2022-02-20 14:03:55,437 INFO L290 TraceCheckUtils]: 77: Hoare triple {1804#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {1804#false} is VALID [2022-02-20 14:03:55,437 INFO L290 TraceCheckUtils]: 78: Hoare triple {1804#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {1804#false} is VALID [2022-02-20 14:03:55,438 INFO L290 TraceCheckUtils]: 79: Hoare triple {1804#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {1804#false} is VALID [2022-02-20 14:03:55,438 INFO L290 TraceCheckUtils]: 80: Hoare triple {1804#false} assume !(main_~i~0#1 < 100000); {1804#false} is VALID [2022-02-20 14:03:55,438 INFO L290 TraceCheckUtils]: 81: Hoare triple {1804#false} havoc main_~x~0#1;main_~x~0#1 := 0; {1804#false} is VALID [2022-02-20 14:03:55,438 INFO L290 TraceCheckUtils]: 82: Hoare triple {1804#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem18#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem19#1 := read~int(main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem18#1 == main_#t~mem19#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1804#false} is VALID [2022-02-20 14:03:55,438 INFO L290 TraceCheckUtils]: 83: Hoare triple {1804#false} assume 0 == __VERIFIER_assert_~cond#1; {1804#false} is VALID [2022-02-20 14:03:55,438 INFO L290 TraceCheckUtils]: 84: Hoare triple {1804#false} assume !false; {1804#false} is VALID [2022-02-20 14:03:55,439 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-02-20 14:03:55,439 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:03:55,666 INFO L290 TraceCheckUtils]: 84: Hoare triple {1804#false} assume !false; {1804#false} is VALID [2022-02-20 14:03:55,666 INFO L290 TraceCheckUtils]: 83: Hoare triple {1804#false} assume 0 == __VERIFIER_assert_~cond#1; {1804#false} is VALID [2022-02-20 14:03:55,666 INFO L290 TraceCheckUtils]: 82: Hoare triple {1804#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem18#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem19#1 := read~int(main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem18#1 == main_#t~mem19#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1804#false} is VALID [2022-02-20 14:03:55,667 INFO L290 TraceCheckUtils]: 81: Hoare triple {1804#false} havoc main_~x~0#1;main_~x~0#1 := 0; {1804#false} is VALID [2022-02-20 14:03:55,667 INFO L290 TraceCheckUtils]: 80: Hoare triple {1804#false} assume !(main_~i~0#1 < 100000); {1804#false} is VALID [2022-02-20 14:03:55,667 INFO L290 TraceCheckUtils]: 79: Hoare triple {1804#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {1804#false} is VALID [2022-02-20 14:03:55,667 INFO L290 TraceCheckUtils]: 78: Hoare triple {1804#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {1804#false} is VALID [2022-02-20 14:03:55,667 INFO L290 TraceCheckUtils]: 77: Hoare triple {1804#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {1804#false} is VALID [2022-02-20 14:03:55,668 INFO L290 TraceCheckUtils]: 76: Hoare triple {1804#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {1804#false} is VALID [2022-02-20 14:03:55,668 INFO L290 TraceCheckUtils]: 75: Hoare triple {1804#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {1804#false} is VALID [2022-02-20 14:03:55,668 INFO L290 TraceCheckUtils]: 74: Hoare triple {1804#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {1804#false} is VALID [2022-02-20 14:03:55,668 INFO L290 TraceCheckUtils]: 73: Hoare triple {1804#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {1804#false} is VALID [2022-02-20 14:03:55,668 INFO L290 TraceCheckUtils]: 72: Hoare triple {1804#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {1804#false} is VALID [2022-02-20 14:03:55,669 INFO L290 TraceCheckUtils]: 71: Hoare triple {1804#false} main_~i~0#1 := 0; {1804#false} is VALID [2022-02-20 14:03:55,669 INFO L290 TraceCheckUtils]: 70: Hoare triple {2112#(< |ULTIMATE.start_main_~i~0#1| 100000)} assume !(main_~i~0#1 < 100000); {1804#false} is VALID [2022-02-20 14:03:55,670 INFO L290 TraceCheckUtils]: 69: Hoare triple {2116#(< |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; {2112#(< |ULTIMATE.start_main_~i~0#1| 100000)} is VALID [2022-02-20 14:03:55,670 INFO L290 TraceCheckUtils]: 68: Hoare triple {2116#(< |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; {2116#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:03:55,671 INFO L290 TraceCheckUtils]: 67: Hoare triple {2123#(< |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; {2116#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:03:55,671 INFO L290 TraceCheckUtils]: 66: Hoare triple {2123#(< |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; {2123#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:03:55,672 INFO L290 TraceCheckUtils]: 65: Hoare triple {2130#(< |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; {2123#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:03:55,673 INFO L290 TraceCheckUtils]: 64: Hoare triple {2130#(< |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; {2130#(< |ULTIMATE.start_main_~i~0#1| 99997)} is VALID [2022-02-20 14:03:55,673 INFO L290 TraceCheckUtils]: 63: Hoare triple {2137#(< |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; {2130#(< |ULTIMATE.start_main_~i~0#1| 99997)} is VALID [2022-02-20 14:03:55,680 INFO L290 TraceCheckUtils]: 62: Hoare triple {2137#(< |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; {2137#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-20 14:03:55,682 INFO L290 TraceCheckUtils]: 61: Hoare triple {1803#true} main_~i~0#1 := 0; {2137#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-20 14:03:55,683 INFO L290 TraceCheckUtils]: 60: Hoare triple {1803#true} assume !(main_~i~0#1 < 100000); {1803#true} is VALID [2022-02-20 14:03:55,683 INFO L290 TraceCheckUtils]: 59: Hoare triple {1803#true} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {1803#true} is VALID [2022-02-20 14:03:55,684 INFO L290 TraceCheckUtils]: 58: Hoare triple {1803#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; {1803#true} is VALID [2022-02-20 14:03:55,684 INFO L290 TraceCheckUtils]: 57: Hoare triple {1803#true} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {1803#true} is VALID [2022-02-20 14:03:55,684 INFO L290 TraceCheckUtils]: 56: Hoare triple {1803#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; {1803#true} is VALID [2022-02-20 14:03:55,684 INFO L290 TraceCheckUtils]: 55: Hoare triple {1803#true} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {1803#true} is VALID [2022-02-20 14:03:55,684 INFO L290 TraceCheckUtils]: 54: Hoare triple {1803#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; {1803#true} is VALID [2022-02-20 14:03:55,684 INFO L290 TraceCheckUtils]: 53: Hoare triple {1803#true} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {1803#true} is VALID [2022-02-20 14:03:55,685 INFO L290 TraceCheckUtils]: 52: Hoare triple {1803#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; {1803#true} is VALID [2022-02-20 14:03:55,685 INFO L290 TraceCheckUtils]: 51: Hoare triple {1803#true} main_~i~0#1 := 0; {1803#true} is VALID [2022-02-20 14:03:55,685 INFO L290 TraceCheckUtils]: 50: Hoare triple {1803#true} assume !(main_~i~0#1 < 100000); {1803#true} is VALID [2022-02-20 14:03:55,685 INFO L290 TraceCheckUtils]: 49: Hoare triple {1803#true} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {1803#true} is VALID [2022-02-20 14:03:55,685 INFO L290 TraceCheckUtils]: 48: Hoare triple {1803#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; {1803#true} is VALID [2022-02-20 14:03:55,685 INFO L290 TraceCheckUtils]: 47: Hoare triple {1803#true} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {1803#true} is VALID [2022-02-20 14:03:55,686 INFO L290 TraceCheckUtils]: 46: Hoare triple {1803#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; {1803#true} is VALID [2022-02-20 14:03:55,686 INFO L290 TraceCheckUtils]: 45: Hoare triple {1803#true} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {1803#true} is VALID [2022-02-20 14:03:55,686 INFO L290 TraceCheckUtils]: 44: Hoare triple {1803#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; {1803#true} is VALID [2022-02-20 14:03:55,686 INFO L290 TraceCheckUtils]: 43: Hoare triple {1803#true} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {1803#true} is VALID [2022-02-20 14:03:55,686 INFO L290 TraceCheckUtils]: 42: Hoare triple {1803#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; {1803#true} is VALID [2022-02-20 14:03:55,686 INFO L290 TraceCheckUtils]: 41: Hoare triple {1803#true} main_~i~0#1 := 0; {1803#true} is VALID [2022-02-20 14:03:55,686 INFO L290 TraceCheckUtils]: 40: Hoare triple {1803#true} assume !(main_~i~0#1 < 100000); {1803#true} is VALID [2022-02-20 14:03:55,687 INFO L290 TraceCheckUtils]: 39: Hoare triple {1803#true} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1803#true} is VALID [2022-02-20 14:03:55,687 INFO L290 TraceCheckUtils]: 38: Hoare triple {1803#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; {1803#true} is VALID [2022-02-20 14:03:55,687 INFO L290 TraceCheckUtils]: 37: Hoare triple {1803#true} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1803#true} is VALID [2022-02-20 14:03:55,687 INFO L290 TraceCheckUtils]: 36: Hoare triple {1803#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; {1803#true} is VALID [2022-02-20 14:03:55,687 INFO L290 TraceCheckUtils]: 35: Hoare triple {1803#true} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1803#true} is VALID [2022-02-20 14:03:55,688 INFO L290 TraceCheckUtils]: 34: Hoare triple {1803#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; {1803#true} is VALID [2022-02-20 14:03:55,688 INFO L290 TraceCheckUtils]: 33: Hoare triple {1803#true} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1803#true} is VALID [2022-02-20 14:03:55,688 INFO L290 TraceCheckUtils]: 32: Hoare triple {1803#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; {1803#true} is VALID [2022-02-20 14:03:55,688 INFO L290 TraceCheckUtils]: 31: Hoare triple {1803#true} main_~i~0#1 := 0; {1803#true} is VALID [2022-02-20 14:03:55,688 INFO L290 TraceCheckUtils]: 30: Hoare triple {1803#true} assume !(main_~i~0#1 < 100000); {1803#true} is VALID [2022-02-20 14:03:55,688 INFO L290 TraceCheckUtils]: 29: Hoare triple {1803#true} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1803#true} is VALID [2022-02-20 14:03:55,689 INFO L290 TraceCheckUtils]: 28: Hoare triple {1803#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; {1803#true} is VALID [2022-02-20 14:03:55,689 INFO L290 TraceCheckUtils]: 27: Hoare triple {1803#true} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1803#true} is VALID [2022-02-20 14:03:55,689 INFO L290 TraceCheckUtils]: 26: Hoare triple {1803#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; {1803#true} is VALID [2022-02-20 14:03:55,689 INFO L290 TraceCheckUtils]: 25: Hoare triple {1803#true} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1803#true} is VALID [2022-02-20 14:03:55,689 INFO L290 TraceCheckUtils]: 24: Hoare triple {1803#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; {1803#true} is VALID [2022-02-20 14:03:55,689 INFO L290 TraceCheckUtils]: 23: Hoare triple {1803#true} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1803#true} is VALID [2022-02-20 14:03:55,690 INFO L290 TraceCheckUtils]: 22: Hoare triple {1803#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; {1803#true} is VALID [2022-02-20 14:03:55,690 INFO L290 TraceCheckUtils]: 21: Hoare triple {1803#true} main_~i~0#1 := 0; {1803#true} is VALID [2022-02-20 14:03:55,690 INFO L290 TraceCheckUtils]: 20: Hoare triple {1803#true} assume !(main_~i~0#1 < 100000); {1803#true} is VALID [2022-02-20 14:03:55,690 INFO L290 TraceCheckUtils]: 19: Hoare triple {1803#true} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1803#true} is VALID [2022-02-20 14:03:55,690 INFO L290 TraceCheckUtils]: 18: Hoare triple {1803#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; {1803#true} is VALID [2022-02-20 14:03:55,690 INFO L290 TraceCheckUtils]: 17: Hoare triple {1803#true} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1803#true} is VALID [2022-02-20 14:03:55,690 INFO L290 TraceCheckUtils]: 16: Hoare triple {1803#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; {1803#true} is VALID [2022-02-20 14:03:55,691 INFO L290 TraceCheckUtils]: 15: Hoare triple {1803#true} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1803#true} is VALID [2022-02-20 14:03:55,691 INFO L290 TraceCheckUtils]: 14: Hoare triple {1803#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; {1803#true} is VALID [2022-02-20 14:03:55,691 INFO L290 TraceCheckUtils]: 13: Hoare triple {1803#true} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1803#true} is VALID [2022-02-20 14:03:55,691 INFO L290 TraceCheckUtils]: 12: Hoare triple {1803#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; {1803#true} is VALID [2022-02-20 14:03:55,691 INFO L290 TraceCheckUtils]: 11: Hoare triple {1803#true} havoc main_~i~0#1;main_~i~0#1 := 0; {1803#true} is VALID [2022-02-20 14:03:55,691 INFO L290 TraceCheckUtils]: 10: Hoare triple {1803#true} assume !(main_~a~0#1 < 100000); {1803#true} is VALID [2022-02-20 14:03:55,692 INFO L290 TraceCheckUtils]: 9: Hoare triple {1803#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1803#true} is VALID [2022-02-20 14:03:55,692 INFO L290 TraceCheckUtils]: 8: Hoare triple {1803#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; {1803#true} is VALID [2022-02-20 14:03:55,692 INFO L290 TraceCheckUtils]: 7: Hoare triple {1803#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1803#true} is VALID [2022-02-20 14:03:55,692 INFO L290 TraceCheckUtils]: 6: Hoare triple {1803#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; {1803#true} is VALID [2022-02-20 14:03:55,692 INFO L290 TraceCheckUtils]: 5: Hoare triple {1803#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1803#true} is VALID [2022-02-20 14:03:55,692 INFO L290 TraceCheckUtils]: 4: Hoare triple {1803#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; {1803#true} is VALID [2022-02-20 14:03:55,693 INFO L290 TraceCheckUtils]: 3: Hoare triple {1803#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1803#true} is VALID [2022-02-20 14:03:55,693 INFO L290 TraceCheckUtils]: 2: Hoare triple {1803#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; {1803#true} is VALID [2022-02-20 14:03:55,693 INFO L290 TraceCheckUtils]: 1: Hoare triple {1803#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~post15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#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_~#a8~0#1.base, main_~#a8~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);call main_~#a8~0#1.base, main_~#a8~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {1803#true} is VALID [2022-02-20 14:03:55,693 INFO L290 TraceCheckUtils]: 0: Hoare triple {1803#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); {1803#true} is VALID [2022-02-20 14:03:55,694 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-02-20 14:03:55,694 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967137348] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:03:55,694 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:03:55,694 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-02-20 14:03:55,694 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381752221] [2022-02-20 14:03:55,695 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:03:55,695 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.117647058823529) internal successors, (87), 17 states have internal predecessors, (87), 0 states have call successors, (0), 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 85 [2022-02-20 14:03:55,696 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:03:55,696 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 5.117647058823529) internal successors, (87), 17 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have 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:55,753 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:03:55,753 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-02-20 14:03:55,753 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:03:55,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-02-20 14:03:55,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2022-02-20 14:03:55,755 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand has 17 states, 17 states have (on average 5.117647058823529) internal successors, (87), 17 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have 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:56,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:03:56,439 INFO L93 Difference]: Finished difference Result 252 states and 310 transitions. [2022-02-20 14:03:56,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-20 14:03:56,440 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.117647058823529) internal successors, (87), 17 states have internal predecessors, (87), 0 states have call successors, (0), 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 85 [2022-02-20 14:03:56,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:03:56,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 5.117647058823529) internal successors, (87), 17 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have 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:56,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 261 transitions. [2022-02-20 14:03:56,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 5.117647058823529) internal successors, (87), 17 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have 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:56,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 261 transitions. [2022-02-20 14:03:56,447 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 261 transitions. [2022-02-20 14:03:56,631 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 261 edges. 261 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:03:56,637 INFO L225 Difference]: With dead ends: 252 [2022-02-20 14:03:56,637 INFO L226 Difference]: Without dead ends: 175 [2022-02-20 14:03:56,638 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 160 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:56,639 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 116 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 14:03:56,639 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 122 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 14:03:56,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-02-20 14:03:56,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 174. [2022-02-20 14:03:56,694 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:03:56,695 INFO L82 GeneralOperation]: Start isEquivalent. First operand 175 states. Second operand has 174 states, 173 states have (on average 1.0520231213872833) internal successors, (182), 173 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have 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:56,695 INFO L74 IsIncluded]: Start isIncluded. First operand 175 states. Second operand has 174 states, 173 states have (on average 1.0520231213872833) internal successors, (182), 173 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have 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:56,696 INFO L87 Difference]: Start difference. First operand 175 states. Second operand has 174 states, 173 states have (on average 1.0520231213872833) internal successors, (182), 173 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have 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:56,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:03:56,701 INFO L93 Difference]: Finished difference Result 175 states and 183 transitions. [2022-02-20 14:03:56,701 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 183 transitions. [2022-02-20 14:03:56,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:03:56,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:03:56,703 INFO L74 IsIncluded]: Start isIncluded. First operand has 174 states, 173 states have (on average 1.0520231213872833) internal successors, (182), 173 states have internal predecessors, (182), 0 states have call successors, (0), 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 175 states. [2022-02-20 14:03:56,703 INFO L87 Difference]: Start difference. First operand has 174 states, 173 states have (on average 1.0520231213872833) internal successors, (182), 173 states have internal predecessors, (182), 0 states have call successors, (0), 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 175 states. [2022-02-20 14:03:56,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:03:56,709 INFO L93 Difference]: Finished difference Result 175 states and 183 transitions. [2022-02-20 14:03:56,709 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 183 transitions. [2022-02-20 14:03:56,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:03:56,709 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:03:56,709 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:03:56,709 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:03:56,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 173 states have (on average 1.0520231213872833) internal successors, (182), 173 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have 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:56,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 182 transitions. [2022-02-20 14:03:56,715 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 182 transitions. Word has length 85 [2022-02-20 14:03:56,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:03:56,717 INFO L470 AbstractCegarLoop]: Abstraction has 174 states and 182 transitions. [2022-02-20 14:03:56,717 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.117647058823529) internal successors, (87), 17 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have 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:56,717 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 182 transitions. [2022-02-20 14:03:56,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-02-20 14:03:56,723 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:03:56,724 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 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, 1, 1] [2022-02-20 14:03:56,756 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:56,947 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:56,947 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:03:56,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:03:56,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1857988451, now seen corresponding path program 4 times [2022-02-20 14:03:56,948 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:03:56,948 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393358197] [2022-02-20 14:03:56,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:03:56,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:03:57,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:03:57,129 INFO L290 TraceCheckUtils]: 0: Hoare triple {3306#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); {3306#true} is VALID [2022-02-20 14:03:57,130 INFO L290 TraceCheckUtils]: 1: Hoare triple {3306#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~post15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#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_~#a8~0#1.base, main_~#a8~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);call main_~#a8~0#1.base, main_~#a8~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {3308#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:03:57,130 INFO L290 TraceCheckUtils]: 2: Hoare triple {3308#(= |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; {3308#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:03:57,131 INFO L290 TraceCheckUtils]: 3: Hoare triple {3308#(= |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; {3309#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:03:57,131 INFO L290 TraceCheckUtils]: 4: Hoare triple {3309#(<= |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; {3309#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:03:57,131 INFO L290 TraceCheckUtils]: 5: Hoare triple {3309#(<= |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; {3310#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-20 14:03:57,132 INFO L290 TraceCheckUtils]: 6: Hoare triple {3310#(<= |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; {3310#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-20 14:03:57,132 INFO L290 TraceCheckUtils]: 7: Hoare triple {3310#(<= |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; {3311#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-20 14:03:57,133 INFO L290 TraceCheckUtils]: 8: Hoare triple {3311#(<= |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; {3311#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-20 14:03:57,133 INFO L290 TraceCheckUtils]: 9: Hoare triple {3311#(<= |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; {3312#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-20 14:03:57,133 INFO L290 TraceCheckUtils]: 10: Hoare triple {3312#(<= |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; {3312#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-20 14:03:57,134 INFO L290 TraceCheckUtils]: 11: Hoare triple {3312#(<= |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; {3313#(<= |ULTIMATE.start_main_~a~0#1| 5)} is VALID [2022-02-20 14:03:57,134 INFO L290 TraceCheckUtils]: 12: Hoare triple {3313#(<= |ULTIMATE.start_main_~a~0#1| 5)} assume !(main_~a~0#1 < 100000); {3307#false} is VALID [2022-02-20 14:03:57,134 INFO L290 TraceCheckUtils]: 13: Hoare triple {3307#false} havoc main_~i~0#1;main_~i~0#1 := 0; {3307#false} is VALID [2022-02-20 14:03:57,135 INFO L290 TraceCheckUtils]: 14: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,135 INFO L290 TraceCheckUtils]: 15: Hoare triple {3307#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3307#false} is VALID [2022-02-20 14:03:57,135 INFO L290 TraceCheckUtils]: 16: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,135 INFO L290 TraceCheckUtils]: 17: Hoare triple {3307#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3307#false} is VALID [2022-02-20 14:03:57,135 INFO L290 TraceCheckUtils]: 18: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,135 INFO L290 TraceCheckUtils]: 19: Hoare triple {3307#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3307#false} is VALID [2022-02-20 14:03:57,136 INFO L290 TraceCheckUtils]: 20: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,136 INFO L290 TraceCheckUtils]: 21: Hoare triple {3307#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3307#false} is VALID [2022-02-20 14:03:57,136 INFO L290 TraceCheckUtils]: 22: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,136 INFO L290 TraceCheckUtils]: 23: Hoare triple {3307#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3307#false} is VALID [2022-02-20 14:03:57,136 INFO L290 TraceCheckUtils]: 24: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,136 INFO L290 TraceCheckUtils]: 25: Hoare triple {3307#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3307#false} is VALID [2022-02-20 14:03:57,136 INFO L290 TraceCheckUtils]: 26: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,137 INFO L290 TraceCheckUtils]: 27: Hoare triple {3307#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3307#false} is VALID [2022-02-20 14:03:57,137 INFO L290 TraceCheckUtils]: 28: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,137 INFO L290 TraceCheckUtils]: 29: Hoare triple {3307#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3307#false} is VALID [2022-02-20 14:03:57,137 INFO L290 TraceCheckUtils]: 30: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,137 INFO L290 TraceCheckUtils]: 31: Hoare triple {3307#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3307#false} is VALID [2022-02-20 14:03:57,137 INFO L290 TraceCheckUtils]: 32: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,137 INFO L290 TraceCheckUtils]: 33: Hoare triple {3307#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3307#false} is VALID [2022-02-20 14:03:57,137 INFO L290 TraceCheckUtils]: 34: Hoare triple {3307#false} assume !(main_~i~0#1 < 100000); {3307#false} is VALID [2022-02-20 14:03:57,138 INFO L290 TraceCheckUtils]: 35: Hoare triple {3307#false} main_~i~0#1 := 0; {3307#false} is VALID [2022-02-20 14:03:57,138 INFO L290 TraceCheckUtils]: 36: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,138 INFO L290 TraceCheckUtils]: 37: Hoare triple {3307#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3307#false} is VALID [2022-02-20 14:03:57,138 INFO L290 TraceCheckUtils]: 38: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,138 INFO L290 TraceCheckUtils]: 39: Hoare triple {3307#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3307#false} is VALID [2022-02-20 14:03:57,138 INFO L290 TraceCheckUtils]: 40: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,138 INFO L290 TraceCheckUtils]: 41: Hoare triple {3307#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3307#false} is VALID [2022-02-20 14:03:57,139 INFO L290 TraceCheckUtils]: 42: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,139 INFO L290 TraceCheckUtils]: 43: Hoare triple {3307#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3307#false} is VALID [2022-02-20 14:03:57,139 INFO L290 TraceCheckUtils]: 44: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,139 INFO L290 TraceCheckUtils]: 45: Hoare triple {3307#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3307#false} is VALID [2022-02-20 14:03:57,139 INFO L290 TraceCheckUtils]: 46: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,139 INFO L290 TraceCheckUtils]: 47: Hoare triple {3307#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3307#false} is VALID [2022-02-20 14:03:57,140 INFO L290 TraceCheckUtils]: 48: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,140 INFO L290 TraceCheckUtils]: 49: Hoare triple {3307#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3307#false} is VALID [2022-02-20 14:03:57,140 INFO L290 TraceCheckUtils]: 50: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,140 INFO L290 TraceCheckUtils]: 51: Hoare triple {3307#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3307#false} is VALID [2022-02-20 14:03:57,140 INFO L290 TraceCheckUtils]: 52: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,140 INFO L290 TraceCheckUtils]: 53: Hoare triple {3307#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3307#false} is VALID [2022-02-20 14:03:57,140 INFO L290 TraceCheckUtils]: 54: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,141 INFO L290 TraceCheckUtils]: 55: Hoare triple {3307#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3307#false} is VALID [2022-02-20 14:03:57,141 INFO L290 TraceCheckUtils]: 56: Hoare triple {3307#false} assume !(main_~i~0#1 < 100000); {3307#false} is VALID [2022-02-20 14:03:57,141 INFO L290 TraceCheckUtils]: 57: Hoare triple {3307#false} main_~i~0#1 := 0; {3307#false} is VALID [2022-02-20 14:03:57,141 INFO L290 TraceCheckUtils]: 58: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,141 INFO L290 TraceCheckUtils]: 59: Hoare triple {3307#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3307#false} is VALID [2022-02-20 14:03:57,141 INFO L290 TraceCheckUtils]: 60: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,142 INFO L290 TraceCheckUtils]: 61: Hoare triple {3307#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3307#false} is VALID [2022-02-20 14:03:57,142 INFO L290 TraceCheckUtils]: 62: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,142 INFO L290 TraceCheckUtils]: 63: Hoare triple {3307#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3307#false} is VALID [2022-02-20 14:03:57,142 INFO L290 TraceCheckUtils]: 64: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,142 INFO L290 TraceCheckUtils]: 65: Hoare triple {3307#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3307#false} is VALID [2022-02-20 14:03:57,142 INFO L290 TraceCheckUtils]: 66: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,142 INFO L290 TraceCheckUtils]: 67: Hoare triple {3307#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3307#false} is VALID [2022-02-20 14:03:57,142 INFO L290 TraceCheckUtils]: 68: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,143 INFO L290 TraceCheckUtils]: 69: Hoare triple {3307#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3307#false} is VALID [2022-02-20 14:03:57,143 INFO L290 TraceCheckUtils]: 70: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,143 INFO L290 TraceCheckUtils]: 71: Hoare triple {3307#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3307#false} is VALID [2022-02-20 14:03:57,143 INFO L290 TraceCheckUtils]: 72: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,143 INFO L290 TraceCheckUtils]: 73: Hoare triple {3307#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3307#false} is VALID [2022-02-20 14:03:57,143 INFO L290 TraceCheckUtils]: 74: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,143 INFO L290 TraceCheckUtils]: 75: Hoare triple {3307#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3307#false} is VALID [2022-02-20 14:03:57,143 INFO L290 TraceCheckUtils]: 76: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,143 INFO L290 TraceCheckUtils]: 77: Hoare triple {3307#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3307#false} is VALID [2022-02-20 14:03:57,143 INFO L290 TraceCheckUtils]: 78: Hoare triple {3307#false} assume !(main_~i~0#1 < 100000); {3307#false} is VALID [2022-02-20 14:03:57,143 INFO L290 TraceCheckUtils]: 79: Hoare triple {3307#false} main_~i~0#1 := 0; {3307#false} is VALID [2022-02-20 14:03:57,143 INFO L290 TraceCheckUtils]: 80: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,143 INFO L290 TraceCheckUtils]: 81: Hoare triple {3307#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3307#false} is VALID [2022-02-20 14:03:57,143 INFO L290 TraceCheckUtils]: 82: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,144 INFO L290 TraceCheckUtils]: 83: Hoare triple {3307#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3307#false} is VALID [2022-02-20 14:03:57,144 INFO L290 TraceCheckUtils]: 84: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,144 INFO L290 TraceCheckUtils]: 85: Hoare triple {3307#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3307#false} is VALID [2022-02-20 14:03:57,144 INFO L290 TraceCheckUtils]: 86: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,144 INFO L290 TraceCheckUtils]: 87: Hoare triple {3307#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3307#false} is VALID [2022-02-20 14:03:57,144 INFO L290 TraceCheckUtils]: 88: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,144 INFO L290 TraceCheckUtils]: 89: Hoare triple {3307#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3307#false} is VALID [2022-02-20 14:03:57,145 INFO L290 TraceCheckUtils]: 90: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,145 INFO L290 TraceCheckUtils]: 91: Hoare triple {3307#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3307#false} is VALID [2022-02-20 14:03:57,145 INFO L290 TraceCheckUtils]: 92: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,145 INFO L290 TraceCheckUtils]: 93: Hoare triple {3307#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3307#false} is VALID [2022-02-20 14:03:57,145 INFO L290 TraceCheckUtils]: 94: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,145 INFO L290 TraceCheckUtils]: 95: Hoare triple {3307#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3307#false} is VALID [2022-02-20 14:03:57,145 INFO L290 TraceCheckUtils]: 96: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,146 INFO L290 TraceCheckUtils]: 97: Hoare triple {3307#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3307#false} is VALID [2022-02-20 14:03:57,146 INFO L290 TraceCheckUtils]: 98: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,146 INFO L290 TraceCheckUtils]: 99: Hoare triple {3307#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3307#false} is VALID [2022-02-20 14:03:57,146 INFO L290 TraceCheckUtils]: 100: Hoare triple {3307#false} assume !(main_~i~0#1 < 100000); {3307#false} is VALID [2022-02-20 14:03:57,146 INFO L290 TraceCheckUtils]: 101: Hoare triple {3307#false} main_~i~0#1 := 0; {3307#false} is VALID [2022-02-20 14:03:57,146 INFO L290 TraceCheckUtils]: 102: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,147 INFO L290 TraceCheckUtils]: 103: Hoare triple {3307#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {3307#false} is VALID [2022-02-20 14:03:57,147 INFO L290 TraceCheckUtils]: 104: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,147 INFO L290 TraceCheckUtils]: 105: Hoare triple {3307#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {3307#false} is VALID [2022-02-20 14:03:57,147 INFO L290 TraceCheckUtils]: 106: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,147 INFO L290 TraceCheckUtils]: 107: Hoare triple {3307#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {3307#false} is VALID [2022-02-20 14:03:57,147 INFO L290 TraceCheckUtils]: 108: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,147 INFO L290 TraceCheckUtils]: 109: Hoare triple {3307#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {3307#false} is VALID [2022-02-20 14:03:57,148 INFO L290 TraceCheckUtils]: 110: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,148 INFO L290 TraceCheckUtils]: 111: Hoare triple {3307#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {3307#false} is VALID [2022-02-20 14:03:57,148 INFO L290 TraceCheckUtils]: 112: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,148 INFO L290 TraceCheckUtils]: 113: Hoare triple {3307#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {3307#false} is VALID [2022-02-20 14:03:57,148 INFO L290 TraceCheckUtils]: 114: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,148 INFO L290 TraceCheckUtils]: 115: Hoare triple {3307#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {3307#false} is VALID [2022-02-20 14:03:57,149 INFO L290 TraceCheckUtils]: 116: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,149 INFO L290 TraceCheckUtils]: 117: Hoare triple {3307#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {3307#false} is VALID [2022-02-20 14:03:57,149 INFO L290 TraceCheckUtils]: 118: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,149 INFO L290 TraceCheckUtils]: 119: Hoare triple {3307#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {3307#false} is VALID [2022-02-20 14:03:57,149 INFO L290 TraceCheckUtils]: 120: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,149 INFO L290 TraceCheckUtils]: 121: Hoare triple {3307#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {3307#false} is VALID [2022-02-20 14:03:57,149 INFO L290 TraceCheckUtils]: 122: Hoare triple {3307#false} assume !(main_~i~0#1 < 100000); {3307#false} is VALID [2022-02-20 14:03:57,150 INFO L290 TraceCheckUtils]: 123: Hoare triple {3307#false} main_~i~0#1 := 0; {3307#false} is VALID [2022-02-20 14:03:57,150 INFO L290 TraceCheckUtils]: 124: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,150 INFO L290 TraceCheckUtils]: 125: Hoare triple {3307#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {3307#false} is VALID [2022-02-20 14:03:57,150 INFO L290 TraceCheckUtils]: 126: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,150 INFO L290 TraceCheckUtils]: 127: Hoare triple {3307#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {3307#false} is VALID [2022-02-20 14:03:57,150 INFO L290 TraceCheckUtils]: 128: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,151 INFO L290 TraceCheckUtils]: 129: Hoare triple {3307#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {3307#false} is VALID [2022-02-20 14:03:57,151 INFO L290 TraceCheckUtils]: 130: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,151 INFO L290 TraceCheckUtils]: 131: Hoare triple {3307#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {3307#false} is VALID [2022-02-20 14:03:57,151 INFO L290 TraceCheckUtils]: 132: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,151 INFO L290 TraceCheckUtils]: 133: Hoare triple {3307#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {3307#false} is VALID [2022-02-20 14:03:57,151 INFO L290 TraceCheckUtils]: 134: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,151 INFO L290 TraceCheckUtils]: 135: Hoare triple {3307#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {3307#false} is VALID [2022-02-20 14:03:57,152 INFO L290 TraceCheckUtils]: 136: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,152 INFO L290 TraceCheckUtils]: 137: Hoare triple {3307#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {3307#false} is VALID [2022-02-20 14:03:57,152 INFO L290 TraceCheckUtils]: 138: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,152 INFO L290 TraceCheckUtils]: 139: Hoare triple {3307#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {3307#false} is VALID [2022-02-20 14:03:57,152 INFO L290 TraceCheckUtils]: 140: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,152 INFO L290 TraceCheckUtils]: 141: Hoare triple {3307#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {3307#false} is VALID [2022-02-20 14:03:57,153 INFO L290 TraceCheckUtils]: 142: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,153 INFO L290 TraceCheckUtils]: 143: Hoare triple {3307#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {3307#false} is VALID [2022-02-20 14:03:57,153 INFO L290 TraceCheckUtils]: 144: Hoare triple {3307#false} assume !(main_~i~0#1 < 100000); {3307#false} is VALID [2022-02-20 14:03:57,153 INFO L290 TraceCheckUtils]: 145: Hoare triple {3307#false} main_~i~0#1 := 0; {3307#false} is VALID [2022-02-20 14:03:57,153 INFO L290 TraceCheckUtils]: 146: Hoare triple {3307#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {3307#false} is VALID [2022-02-20 14:03:57,153 INFO L290 TraceCheckUtils]: 147: Hoare triple {3307#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {3307#false} is VALID [2022-02-20 14:03:57,153 INFO L290 TraceCheckUtils]: 148: Hoare triple {3307#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {3307#false} is VALID [2022-02-20 14:03:57,154 INFO L290 TraceCheckUtils]: 149: Hoare triple {3307#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {3307#false} is VALID [2022-02-20 14:03:57,154 INFO L290 TraceCheckUtils]: 150: Hoare triple {3307#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {3307#false} is VALID [2022-02-20 14:03:57,154 INFO L290 TraceCheckUtils]: 151: Hoare triple {3307#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {3307#false} is VALID [2022-02-20 14:03:57,154 INFO L290 TraceCheckUtils]: 152: Hoare triple {3307#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {3307#false} is VALID [2022-02-20 14:03:57,154 INFO L290 TraceCheckUtils]: 153: Hoare triple {3307#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {3307#false} is VALID [2022-02-20 14:03:57,154 INFO L290 TraceCheckUtils]: 154: Hoare triple {3307#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {3307#false} is VALID [2022-02-20 14:03:57,154 INFO L290 TraceCheckUtils]: 155: Hoare triple {3307#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {3307#false} is VALID [2022-02-20 14:03:57,155 INFO L290 TraceCheckUtils]: 156: Hoare triple {3307#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {3307#false} is VALID [2022-02-20 14:03:57,155 INFO L290 TraceCheckUtils]: 157: Hoare triple {3307#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {3307#false} is VALID [2022-02-20 14:03:57,155 INFO L290 TraceCheckUtils]: 158: Hoare triple {3307#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {3307#false} is VALID [2022-02-20 14:03:57,155 INFO L290 TraceCheckUtils]: 159: Hoare triple {3307#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {3307#false} is VALID [2022-02-20 14:03:57,155 INFO L290 TraceCheckUtils]: 160: Hoare triple {3307#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {3307#false} is VALID [2022-02-20 14:03:57,156 INFO L290 TraceCheckUtils]: 161: Hoare triple {3307#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {3307#false} is VALID [2022-02-20 14:03:57,156 INFO L290 TraceCheckUtils]: 162: Hoare triple {3307#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {3307#false} is VALID [2022-02-20 14:03:57,156 INFO L290 TraceCheckUtils]: 163: Hoare triple {3307#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {3307#false} is VALID [2022-02-20 14:03:57,156 INFO L290 TraceCheckUtils]: 164: Hoare triple {3307#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {3307#false} is VALID [2022-02-20 14:03:57,156 INFO L290 TraceCheckUtils]: 165: Hoare triple {3307#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {3307#false} is VALID [2022-02-20 14:03:57,156 INFO L290 TraceCheckUtils]: 166: Hoare triple {3307#false} assume !(main_~i~0#1 < 100000); {3307#false} is VALID [2022-02-20 14:03:57,156 INFO L290 TraceCheckUtils]: 167: Hoare triple {3307#false} havoc main_~x~0#1;main_~x~0#1 := 0; {3307#false} is VALID [2022-02-20 14:03:57,157 INFO L290 TraceCheckUtils]: 168: Hoare triple {3307#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem18#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem19#1 := read~int(main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem18#1 == main_#t~mem19#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3307#false} is VALID [2022-02-20 14:03:57,157 INFO L290 TraceCheckUtils]: 169: Hoare triple {3307#false} assume 0 == __VERIFIER_assert_~cond#1; {3307#false} is VALID [2022-02-20 14:03:57,157 INFO L290 TraceCheckUtils]: 170: Hoare triple {3307#false} assume !false; {3307#false} is VALID [2022-02-20 14:03:57,158 INFO L134 CoverageAnalysis]: Checked inductivity of 725 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 700 trivial. 0 not checked. [2022-02-20 14:03:57,158 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:03:57,158 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393358197] [2022-02-20 14:03:57,158 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393358197] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:03:57,158 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115585501] [2022-02-20 14:03:57,158 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-20 14:03:57,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:03:57,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:03:57,160 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:57,172 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:57,406 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-20 14:03:57,407 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:03:57,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 732 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 14:03:57,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:03:57,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:03:57,802 INFO L290 TraceCheckUtils]: 0: Hoare triple {3306#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); {3306#true} is VALID [2022-02-20 14:03:57,804 INFO L290 TraceCheckUtils]: 1: Hoare triple {3306#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~post15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#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_~#a8~0#1.base, main_~#a8~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);call main_~#a8~0#1.base, main_~#a8~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {3320#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:03:57,804 INFO L290 TraceCheckUtils]: 2: Hoare triple {3320#(<= |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; {3320#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:03:57,804 INFO L290 TraceCheckUtils]: 3: Hoare triple {3320#(<= |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; {3309#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:03:57,805 INFO L290 TraceCheckUtils]: 4: Hoare triple {3309#(<= |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; {3309#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:03:57,805 INFO L290 TraceCheckUtils]: 5: Hoare triple {3309#(<= |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; {3310#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-20 14:03:57,806 INFO L290 TraceCheckUtils]: 6: Hoare triple {3310#(<= |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; {3310#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-20 14:03:57,806 INFO L290 TraceCheckUtils]: 7: Hoare triple {3310#(<= |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; {3311#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-20 14:03:57,806 INFO L290 TraceCheckUtils]: 8: Hoare triple {3311#(<= |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; {3311#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-20 14:03:57,807 INFO L290 TraceCheckUtils]: 9: Hoare triple {3311#(<= |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; {3312#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-20 14:03:57,807 INFO L290 TraceCheckUtils]: 10: Hoare triple {3312#(<= |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; {3312#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-20 14:03:57,808 INFO L290 TraceCheckUtils]: 11: Hoare triple {3312#(<= |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; {3313#(<= |ULTIMATE.start_main_~a~0#1| 5)} is VALID [2022-02-20 14:03:57,809 INFO L290 TraceCheckUtils]: 12: Hoare triple {3313#(<= |ULTIMATE.start_main_~a~0#1| 5)} assume !(main_~a~0#1 < 100000); {3307#false} is VALID [2022-02-20 14:03:57,809 INFO L290 TraceCheckUtils]: 13: Hoare triple {3307#false} havoc main_~i~0#1;main_~i~0#1 := 0; {3307#false} is VALID [2022-02-20 14:03:57,809 INFO L290 TraceCheckUtils]: 14: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,809 INFO L290 TraceCheckUtils]: 15: Hoare triple {3307#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3307#false} is VALID [2022-02-20 14:03:57,809 INFO L290 TraceCheckUtils]: 16: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,809 INFO L290 TraceCheckUtils]: 17: Hoare triple {3307#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3307#false} is VALID [2022-02-20 14:03:57,809 INFO L290 TraceCheckUtils]: 18: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,810 INFO L290 TraceCheckUtils]: 19: Hoare triple {3307#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3307#false} is VALID [2022-02-20 14:03:57,810 INFO L290 TraceCheckUtils]: 20: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,810 INFO L290 TraceCheckUtils]: 21: Hoare triple {3307#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3307#false} is VALID [2022-02-20 14:03:57,810 INFO L290 TraceCheckUtils]: 22: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,810 INFO L290 TraceCheckUtils]: 23: Hoare triple {3307#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3307#false} is VALID [2022-02-20 14:03:57,810 INFO L290 TraceCheckUtils]: 24: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,810 INFO L290 TraceCheckUtils]: 25: Hoare triple {3307#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3307#false} is VALID [2022-02-20 14:03:57,810 INFO L290 TraceCheckUtils]: 26: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,810 INFO L290 TraceCheckUtils]: 27: Hoare triple {3307#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3307#false} is VALID [2022-02-20 14:03:57,811 INFO L290 TraceCheckUtils]: 28: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,811 INFO L290 TraceCheckUtils]: 29: Hoare triple {3307#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3307#false} is VALID [2022-02-20 14:03:57,811 INFO L290 TraceCheckUtils]: 30: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,811 INFO L290 TraceCheckUtils]: 31: Hoare triple {3307#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3307#false} is VALID [2022-02-20 14:03:57,811 INFO L290 TraceCheckUtils]: 32: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,811 INFO L290 TraceCheckUtils]: 33: Hoare triple {3307#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3307#false} is VALID [2022-02-20 14:03:57,811 INFO L290 TraceCheckUtils]: 34: Hoare triple {3307#false} assume !(main_~i~0#1 < 100000); {3307#false} is VALID [2022-02-20 14:03:57,811 INFO L290 TraceCheckUtils]: 35: Hoare triple {3307#false} main_~i~0#1 := 0; {3307#false} is VALID [2022-02-20 14:03:57,811 INFO L290 TraceCheckUtils]: 36: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,811 INFO L290 TraceCheckUtils]: 37: Hoare triple {3307#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3307#false} is VALID [2022-02-20 14:03:57,811 INFO L290 TraceCheckUtils]: 38: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,811 INFO L290 TraceCheckUtils]: 39: Hoare triple {3307#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3307#false} is VALID [2022-02-20 14:03:57,811 INFO L290 TraceCheckUtils]: 40: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,811 INFO L290 TraceCheckUtils]: 41: Hoare triple {3307#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3307#false} is VALID [2022-02-20 14:03:57,812 INFO L290 TraceCheckUtils]: 42: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,812 INFO L290 TraceCheckUtils]: 43: Hoare triple {3307#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3307#false} is VALID [2022-02-20 14:03:57,812 INFO L290 TraceCheckUtils]: 44: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,812 INFO L290 TraceCheckUtils]: 45: Hoare triple {3307#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3307#false} is VALID [2022-02-20 14:03:57,812 INFO L290 TraceCheckUtils]: 46: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,812 INFO L290 TraceCheckUtils]: 47: Hoare triple {3307#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3307#false} is VALID [2022-02-20 14:03:57,812 INFO L290 TraceCheckUtils]: 48: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,812 INFO L290 TraceCheckUtils]: 49: Hoare triple {3307#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3307#false} is VALID [2022-02-20 14:03:57,812 INFO L290 TraceCheckUtils]: 50: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,812 INFO L290 TraceCheckUtils]: 51: Hoare triple {3307#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3307#false} is VALID [2022-02-20 14:03:57,812 INFO L290 TraceCheckUtils]: 52: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,812 INFO L290 TraceCheckUtils]: 53: Hoare triple {3307#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3307#false} is VALID [2022-02-20 14:03:57,812 INFO L290 TraceCheckUtils]: 54: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,812 INFO L290 TraceCheckUtils]: 55: Hoare triple {3307#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3307#false} is VALID [2022-02-20 14:03:57,813 INFO L290 TraceCheckUtils]: 56: Hoare triple {3307#false} assume !(main_~i~0#1 < 100000); {3307#false} is VALID [2022-02-20 14:03:57,813 INFO L290 TraceCheckUtils]: 57: Hoare triple {3307#false} main_~i~0#1 := 0; {3307#false} is VALID [2022-02-20 14:03:57,813 INFO L290 TraceCheckUtils]: 58: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,813 INFO L290 TraceCheckUtils]: 59: Hoare triple {3307#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3307#false} is VALID [2022-02-20 14:03:57,813 INFO L290 TraceCheckUtils]: 60: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,813 INFO L290 TraceCheckUtils]: 61: Hoare triple {3307#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3307#false} is VALID [2022-02-20 14:03:57,813 INFO L290 TraceCheckUtils]: 62: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,813 INFO L290 TraceCheckUtils]: 63: Hoare triple {3307#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3307#false} is VALID [2022-02-20 14:03:57,813 INFO L290 TraceCheckUtils]: 64: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,813 INFO L290 TraceCheckUtils]: 65: Hoare triple {3307#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3307#false} is VALID [2022-02-20 14:03:57,813 INFO L290 TraceCheckUtils]: 66: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,813 INFO L290 TraceCheckUtils]: 67: Hoare triple {3307#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3307#false} is VALID [2022-02-20 14:03:57,813 INFO L290 TraceCheckUtils]: 68: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,814 INFO L290 TraceCheckUtils]: 69: Hoare triple {3307#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3307#false} is VALID [2022-02-20 14:03:57,814 INFO L290 TraceCheckUtils]: 70: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,814 INFO L290 TraceCheckUtils]: 71: Hoare triple {3307#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3307#false} is VALID [2022-02-20 14:03:57,814 INFO L290 TraceCheckUtils]: 72: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,814 INFO L290 TraceCheckUtils]: 73: Hoare triple {3307#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3307#false} is VALID [2022-02-20 14:03:57,814 INFO L290 TraceCheckUtils]: 74: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,814 INFO L290 TraceCheckUtils]: 75: Hoare triple {3307#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3307#false} is VALID [2022-02-20 14:03:57,814 INFO L290 TraceCheckUtils]: 76: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,814 INFO L290 TraceCheckUtils]: 77: Hoare triple {3307#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3307#false} is VALID [2022-02-20 14:03:57,814 INFO L290 TraceCheckUtils]: 78: Hoare triple {3307#false} assume !(main_~i~0#1 < 100000); {3307#false} is VALID [2022-02-20 14:03:57,814 INFO L290 TraceCheckUtils]: 79: Hoare triple {3307#false} main_~i~0#1 := 0; {3307#false} is VALID [2022-02-20 14:03:57,814 INFO L290 TraceCheckUtils]: 80: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,814 INFO L290 TraceCheckUtils]: 81: Hoare triple {3307#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3307#false} is VALID [2022-02-20 14:03:57,814 INFO L290 TraceCheckUtils]: 82: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,815 INFO L290 TraceCheckUtils]: 83: Hoare triple {3307#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3307#false} is VALID [2022-02-20 14:03:57,815 INFO L290 TraceCheckUtils]: 84: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,815 INFO L290 TraceCheckUtils]: 85: Hoare triple {3307#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3307#false} is VALID [2022-02-20 14:03:57,815 INFO L290 TraceCheckUtils]: 86: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,815 INFO L290 TraceCheckUtils]: 87: Hoare triple {3307#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3307#false} is VALID [2022-02-20 14:03:57,815 INFO L290 TraceCheckUtils]: 88: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,815 INFO L290 TraceCheckUtils]: 89: Hoare triple {3307#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3307#false} is VALID [2022-02-20 14:03:57,816 INFO L290 TraceCheckUtils]: 90: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,816 INFO L290 TraceCheckUtils]: 91: Hoare triple {3307#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3307#false} is VALID [2022-02-20 14:03:57,816 INFO L290 TraceCheckUtils]: 92: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,816 INFO L290 TraceCheckUtils]: 93: Hoare triple {3307#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3307#false} is VALID [2022-02-20 14:03:57,816 INFO L290 TraceCheckUtils]: 94: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,816 INFO L290 TraceCheckUtils]: 95: Hoare triple {3307#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3307#false} is VALID [2022-02-20 14:03:57,816 INFO L290 TraceCheckUtils]: 96: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,817 INFO L290 TraceCheckUtils]: 97: Hoare triple {3307#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3307#false} is VALID [2022-02-20 14:03:57,817 INFO L290 TraceCheckUtils]: 98: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,817 INFO L290 TraceCheckUtils]: 99: Hoare triple {3307#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3307#false} is VALID [2022-02-20 14:03:57,817 INFO L290 TraceCheckUtils]: 100: Hoare triple {3307#false} assume !(main_~i~0#1 < 100000); {3307#false} is VALID [2022-02-20 14:03:57,817 INFO L290 TraceCheckUtils]: 101: Hoare triple {3307#false} main_~i~0#1 := 0; {3307#false} is VALID [2022-02-20 14:03:57,817 INFO L290 TraceCheckUtils]: 102: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,818 INFO L290 TraceCheckUtils]: 103: Hoare triple {3307#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {3307#false} is VALID [2022-02-20 14:03:57,818 INFO L290 TraceCheckUtils]: 104: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,818 INFO L290 TraceCheckUtils]: 105: Hoare triple {3307#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {3307#false} is VALID [2022-02-20 14:03:57,818 INFO L290 TraceCheckUtils]: 106: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,818 INFO L290 TraceCheckUtils]: 107: Hoare triple {3307#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {3307#false} is VALID [2022-02-20 14:03:57,818 INFO L290 TraceCheckUtils]: 108: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,818 INFO L290 TraceCheckUtils]: 109: Hoare triple {3307#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {3307#false} is VALID [2022-02-20 14:03:57,819 INFO L290 TraceCheckUtils]: 110: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,819 INFO L290 TraceCheckUtils]: 111: Hoare triple {3307#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {3307#false} is VALID [2022-02-20 14:03:57,819 INFO L290 TraceCheckUtils]: 112: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,819 INFO L290 TraceCheckUtils]: 113: Hoare triple {3307#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {3307#false} is VALID [2022-02-20 14:03:57,819 INFO L290 TraceCheckUtils]: 114: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,819 INFO L290 TraceCheckUtils]: 115: Hoare triple {3307#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {3307#false} is VALID [2022-02-20 14:03:57,819 INFO L290 TraceCheckUtils]: 116: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,819 INFO L290 TraceCheckUtils]: 117: Hoare triple {3307#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {3307#false} is VALID [2022-02-20 14:03:57,819 INFO L290 TraceCheckUtils]: 118: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,819 INFO L290 TraceCheckUtils]: 119: Hoare triple {3307#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {3307#false} is VALID [2022-02-20 14:03:57,820 INFO L290 TraceCheckUtils]: 120: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,820 INFO L290 TraceCheckUtils]: 121: Hoare triple {3307#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {3307#false} is VALID [2022-02-20 14:03:57,820 INFO L290 TraceCheckUtils]: 122: Hoare triple {3307#false} assume !(main_~i~0#1 < 100000); {3307#false} is VALID [2022-02-20 14:03:57,820 INFO L290 TraceCheckUtils]: 123: Hoare triple {3307#false} main_~i~0#1 := 0; {3307#false} is VALID [2022-02-20 14:03:57,820 INFO L290 TraceCheckUtils]: 124: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,820 INFO L290 TraceCheckUtils]: 125: Hoare triple {3307#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {3307#false} is VALID [2022-02-20 14:03:57,820 INFO L290 TraceCheckUtils]: 126: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,820 INFO L290 TraceCheckUtils]: 127: Hoare triple {3307#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {3307#false} is VALID [2022-02-20 14:03:57,820 INFO L290 TraceCheckUtils]: 128: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,820 INFO L290 TraceCheckUtils]: 129: Hoare triple {3307#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {3307#false} is VALID [2022-02-20 14:03:57,820 INFO L290 TraceCheckUtils]: 130: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,820 INFO L290 TraceCheckUtils]: 131: Hoare triple {3307#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {3307#false} is VALID [2022-02-20 14:03:57,820 INFO L290 TraceCheckUtils]: 132: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,821 INFO L290 TraceCheckUtils]: 133: Hoare triple {3307#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {3307#false} is VALID [2022-02-20 14:03:57,821 INFO L290 TraceCheckUtils]: 134: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,821 INFO L290 TraceCheckUtils]: 135: Hoare triple {3307#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {3307#false} is VALID [2022-02-20 14:03:57,821 INFO L290 TraceCheckUtils]: 136: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,821 INFO L290 TraceCheckUtils]: 137: Hoare triple {3307#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {3307#false} is VALID [2022-02-20 14:03:57,821 INFO L290 TraceCheckUtils]: 138: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,821 INFO L290 TraceCheckUtils]: 139: Hoare triple {3307#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {3307#false} is VALID [2022-02-20 14:03:57,821 INFO L290 TraceCheckUtils]: 140: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,821 INFO L290 TraceCheckUtils]: 141: Hoare triple {3307#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {3307#false} is VALID [2022-02-20 14:03:57,821 INFO L290 TraceCheckUtils]: 142: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:57,821 INFO L290 TraceCheckUtils]: 143: Hoare triple {3307#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {3307#false} is VALID [2022-02-20 14:03:57,821 INFO L290 TraceCheckUtils]: 144: Hoare triple {3307#false} assume !(main_~i~0#1 < 100000); {3307#false} is VALID [2022-02-20 14:03:57,821 INFO L290 TraceCheckUtils]: 145: Hoare triple {3307#false} main_~i~0#1 := 0; {3307#false} is VALID [2022-02-20 14:03:57,821 INFO L290 TraceCheckUtils]: 146: Hoare triple {3307#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {3307#false} is VALID [2022-02-20 14:03:57,822 INFO L290 TraceCheckUtils]: 147: Hoare triple {3307#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {3307#false} is VALID [2022-02-20 14:03:57,822 INFO L290 TraceCheckUtils]: 148: Hoare triple {3307#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {3307#false} is VALID [2022-02-20 14:03:57,822 INFO L290 TraceCheckUtils]: 149: Hoare triple {3307#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {3307#false} is VALID [2022-02-20 14:03:57,822 INFO L290 TraceCheckUtils]: 150: Hoare triple {3307#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {3307#false} is VALID [2022-02-20 14:03:57,822 INFO L290 TraceCheckUtils]: 151: Hoare triple {3307#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {3307#false} is VALID [2022-02-20 14:03:57,822 INFO L290 TraceCheckUtils]: 152: Hoare triple {3307#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {3307#false} is VALID [2022-02-20 14:03:57,822 INFO L290 TraceCheckUtils]: 153: Hoare triple {3307#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {3307#false} is VALID [2022-02-20 14:03:57,823 INFO L290 TraceCheckUtils]: 154: Hoare triple {3307#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {3307#false} is VALID [2022-02-20 14:03:57,823 INFO L290 TraceCheckUtils]: 155: Hoare triple {3307#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {3307#false} is VALID [2022-02-20 14:03:57,823 INFO L290 TraceCheckUtils]: 156: Hoare triple {3307#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {3307#false} is VALID [2022-02-20 14:03:57,823 INFO L290 TraceCheckUtils]: 157: Hoare triple {3307#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {3307#false} is VALID [2022-02-20 14:03:57,823 INFO L290 TraceCheckUtils]: 158: Hoare triple {3307#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {3307#false} is VALID [2022-02-20 14:03:57,823 INFO L290 TraceCheckUtils]: 159: Hoare triple {3307#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {3307#false} is VALID [2022-02-20 14:03:57,823 INFO L290 TraceCheckUtils]: 160: Hoare triple {3307#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {3307#false} is VALID [2022-02-20 14:03:57,823 INFO L290 TraceCheckUtils]: 161: Hoare triple {3307#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {3307#false} is VALID [2022-02-20 14:03:57,824 INFO L290 TraceCheckUtils]: 162: Hoare triple {3307#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {3307#false} is VALID [2022-02-20 14:03:57,824 INFO L290 TraceCheckUtils]: 163: Hoare triple {3307#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {3307#false} is VALID [2022-02-20 14:03:57,824 INFO L290 TraceCheckUtils]: 164: Hoare triple {3307#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {3307#false} is VALID [2022-02-20 14:03:57,824 INFO L290 TraceCheckUtils]: 165: Hoare triple {3307#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {3307#false} is VALID [2022-02-20 14:03:57,824 INFO L290 TraceCheckUtils]: 166: Hoare triple {3307#false} assume !(main_~i~0#1 < 100000); {3307#false} is VALID [2022-02-20 14:03:57,825 INFO L290 TraceCheckUtils]: 167: Hoare triple {3307#false} havoc main_~x~0#1;main_~x~0#1 := 0; {3307#false} is VALID [2022-02-20 14:03:57,825 INFO L290 TraceCheckUtils]: 168: Hoare triple {3307#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem18#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem19#1 := read~int(main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem18#1 == main_#t~mem19#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3307#false} is VALID [2022-02-20 14:03:57,825 INFO L290 TraceCheckUtils]: 169: Hoare triple {3307#false} assume 0 == __VERIFIER_assert_~cond#1; {3307#false} is VALID [2022-02-20 14:03:57,825 INFO L290 TraceCheckUtils]: 170: Hoare triple {3307#false} assume !false; {3307#false} is VALID [2022-02-20 14:03:57,826 INFO L134 CoverageAnalysis]: Checked inductivity of 725 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 700 trivial. 0 not checked. [2022-02-20 14:03:57,826 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:03:58,308 INFO L290 TraceCheckUtils]: 170: Hoare triple {3307#false} assume !false; {3307#false} is VALID [2022-02-20 14:03:58,309 INFO L290 TraceCheckUtils]: 169: Hoare triple {3307#false} assume 0 == __VERIFIER_assert_~cond#1; {3307#false} is VALID [2022-02-20 14:03:58,309 INFO L290 TraceCheckUtils]: 168: Hoare triple {3307#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem18#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem19#1 := read~int(main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem18#1 == main_#t~mem19#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3307#false} is VALID [2022-02-20 14:03:58,309 INFO L290 TraceCheckUtils]: 167: Hoare triple {3307#false} havoc main_~x~0#1;main_~x~0#1 := 0; {3307#false} is VALID [2022-02-20 14:03:58,309 INFO L290 TraceCheckUtils]: 166: Hoare triple {3307#false} assume !(main_~i~0#1 < 100000); {3307#false} is VALID [2022-02-20 14:03:58,309 INFO L290 TraceCheckUtils]: 165: Hoare triple {3307#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {3307#false} is VALID [2022-02-20 14:03:58,309 INFO L290 TraceCheckUtils]: 164: Hoare triple {3307#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {3307#false} is VALID [2022-02-20 14:03:58,310 INFO L290 TraceCheckUtils]: 163: Hoare triple {3307#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {3307#false} is VALID [2022-02-20 14:03:58,310 INFO L290 TraceCheckUtils]: 162: Hoare triple {3307#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {3307#false} is VALID [2022-02-20 14:03:58,310 INFO L290 TraceCheckUtils]: 161: Hoare triple {3307#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {3307#false} is VALID [2022-02-20 14:03:58,310 INFO L290 TraceCheckUtils]: 160: Hoare triple {3307#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {3307#false} is VALID [2022-02-20 14:03:58,310 INFO L290 TraceCheckUtils]: 159: Hoare triple {3307#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {3307#false} is VALID [2022-02-20 14:03:58,311 INFO L290 TraceCheckUtils]: 158: Hoare triple {3307#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {3307#false} is VALID [2022-02-20 14:03:58,311 INFO L290 TraceCheckUtils]: 157: Hoare triple {3307#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {3307#false} is VALID [2022-02-20 14:03:58,311 INFO L290 TraceCheckUtils]: 156: Hoare triple {3307#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {3307#false} is VALID [2022-02-20 14:03:58,311 INFO L290 TraceCheckUtils]: 155: Hoare triple {3307#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {3307#false} is VALID [2022-02-20 14:03:58,311 INFO L290 TraceCheckUtils]: 154: Hoare triple {3307#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {3307#false} is VALID [2022-02-20 14:03:58,311 INFO L290 TraceCheckUtils]: 153: Hoare triple {3307#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {3307#false} is VALID [2022-02-20 14:03:58,312 INFO L290 TraceCheckUtils]: 152: Hoare triple {3307#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {3307#false} is VALID [2022-02-20 14:03:58,312 INFO L290 TraceCheckUtils]: 151: Hoare triple {3307#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {3307#false} is VALID [2022-02-20 14:03:58,312 INFO L290 TraceCheckUtils]: 150: Hoare triple {3307#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {3307#false} is VALID [2022-02-20 14:03:58,312 INFO L290 TraceCheckUtils]: 149: Hoare triple {3307#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {3307#false} is VALID [2022-02-20 14:03:58,312 INFO L290 TraceCheckUtils]: 148: Hoare triple {3307#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {3307#false} is VALID [2022-02-20 14:03:58,312 INFO L290 TraceCheckUtils]: 147: Hoare triple {3307#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {3307#false} is VALID [2022-02-20 14:03:58,313 INFO L290 TraceCheckUtils]: 146: Hoare triple {3307#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {3307#false} is VALID [2022-02-20 14:03:58,313 INFO L290 TraceCheckUtils]: 145: Hoare triple {3307#false} main_~i~0#1 := 0; {3307#false} is VALID [2022-02-20 14:03:58,313 INFO L290 TraceCheckUtils]: 144: Hoare triple {3307#false} assume !(main_~i~0#1 < 100000); {3307#false} is VALID [2022-02-20 14:03:58,313 INFO L290 TraceCheckUtils]: 143: Hoare triple {3307#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {3307#false} is VALID [2022-02-20 14:03:58,313 INFO L290 TraceCheckUtils]: 142: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:58,314 INFO L290 TraceCheckUtils]: 141: Hoare triple {3307#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {3307#false} is VALID [2022-02-20 14:03:58,314 INFO L290 TraceCheckUtils]: 140: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:58,314 INFO L290 TraceCheckUtils]: 139: Hoare triple {3307#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {3307#false} is VALID [2022-02-20 14:03:58,314 INFO L290 TraceCheckUtils]: 138: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:58,314 INFO L290 TraceCheckUtils]: 137: Hoare triple {3307#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {3307#false} is VALID [2022-02-20 14:03:58,314 INFO L290 TraceCheckUtils]: 136: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:58,315 INFO L290 TraceCheckUtils]: 135: Hoare triple {3307#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {3307#false} is VALID [2022-02-20 14:03:58,315 INFO L290 TraceCheckUtils]: 134: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:58,315 INFO L290 TraceCheckUtils]: 133: Hoare triple {3307#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {3307#false} is VALID [2022-02-20 14:03:58,315 INFO L290 TraceCheckUtils]: 132: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:58,315 INFO L290 TraceCheckUtils]: 131: Hoare triple {3307#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {3307#false} is VALID [2022-02-20 14:03:58,315 INFO L290 TraceCheckUtils]: 130: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:58,316 INFO L290 TraceCheckUtils]: 129: Hoare triple {3307#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {3307#false} is VALID [2022-02-20 14:03:58,316 INFO L290 TraceCheckUtils]: 128: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:58,316 INFO L290 TraceCheckUtils]: 127: Hoare triple {3307#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {3307#false} is VALID [2022-02-20 14:03:58,316 INFO L290 TraceCheckUtils]: 126: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:58,316 INFO L290 TraceCheckUtils]: 125: Hoare triple {3307#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {3307#false} is VALID [2022-02-20 14:03:58,317 INFO L290 TraceCheckUtils]: 124: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:58,317 INFO L290 TraceCheckUtils]: 123: Hoare triple {3307#false} main_~i~0#1 := 0; {3307#false} is VALID [2022-02-20 14:03:58,317 INFO L290 TraceCheckUtils]: 122: Hoare triple {3307#false} assume !(main_~i~0#1 < 100000); {3307#false} is VALID [2022-02-20 14:03:58,317 INFO L290 TraceCheckUtils]: 121: Hoare triple {3307#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {3307#false} is VALID [2022-02-20 14:03:58,317 INFO L290 TraceCheckUtils]: 120: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:58,317 INFO L290 TraceCheckUtils]: 119: Hoare triple {3307#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {3307#false} is VALID [2022-02-20 14:03:58,318 INFO L290 TraceCheckUtils]: 118: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:58,318 INFO L290 TraceCheckUtils]: 117: Hoare triple {3307#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {3307#false} is VALID [2022-02-20 14:03:58,318 INFO L290 TraceCheckUtils]: 116: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:58,318 INFO L290 TraceCheckUtils]: 115: Hoare triple {3307#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {3307#false} is VALID [2022-02-20 14:03:58,318 INFO L290 TraceCheckUtils]: 114: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:58,319 INFO L290 TraceCheckUtils]: 113: Hoare triple {3307#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {3307#false} is VALID [2022-02-20 14:03:58,319 INFO L290 TraceCheckUtils]: 112: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:58,319 INFO L290 TraceCheckUtils]: 111: Hoare triple {3307#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {3307#false} is VALID [2022-02-20 14:03:58,319 INFO L290 TraceCheckUtils]: 110: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:58,319 INFO L290 TraceCheckUtils]: 109: Hoare triple {3307#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {3307#false} is VALID [2022-02-20 14:03:58,319 INFO L290 TraceCheckUtils]: 108: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:58,320 INFO L290 TraceCheckUtils]: 107: Hoare triple {3307#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {3307#false} is VALID [2022-02-20 14:03:58,320 INFO L290 TraceCheckUtils]: 106: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:58,320 INFO L290 TraceCheckUtils]: 105: Hoare triple {3307#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {3307#false} is VALID [2022-02-20 14:03:58,320 INFO L290 TraceCheckUtils]: 104: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:58,320 INFO L290 TraceCheckUtils]: 103: Hoare triple {3307#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {3307#false} is VALID [2022-02-20 14:03:58,321 INFO L290 TraceCheckUtils]: 102: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:58,321 INFO L290 TraceCheckUtils]: 101: Hoare triple {3307#false} main_~i~0#1 := 0; {3307#false} is VALID [2022-02-20 14:03:58,321 INFO L290 TraceCheckUtils]: 100: Hoare triple {3307#false} assume !(main_~i~0#1 < 100000); {3307#false} is VALID [2022-02-20 14:03:58,321 INFO L290 TraceCheckUtils]: 99: Hoare triple {3307#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3307#false} is VALID [2022-02-20 14:03:58,321 INFO L290 TraceCheckUtils]: 98: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:58,321 INFO L290 TraceCheckUtils]: 97: Hoare triple {3307#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3307#false} is VALID [2022-02-20 14:03:58,322 INFO L290 TraceCheckUtils]: 96: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:58,322 INFO L290 TraceCheckUtils]: 95: Hoare triple {3307#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3307#false} is VALID [2022-02-20 14:03:58,322 INFO L290 TraceCheckUtils]: 94: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:58,322 INFO L290 TraceCheckUtils]: 93: Hoare triple {3307#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3307#false} is VALID [2022-02-20 14:03:58,322 INFO L290 TraceCheckUtils]: 92: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:58,322 INFO L290 TraceCheckUtils]: 91: Hoare triple {3307#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3307#false} is VALID [2022-02-20 14:03:58,323 INFO L290 TraceCheckUtils]: 90: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:58,323 INFO L290 TraceCheckUtils]: 89: Hoare triple {3307#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3307#false} is VALID [2022-02-20 14:03:58,323 INFO L290 TraceCheckUtils]: 88: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:58,323 INFO L290 TraceCheckUtils]: 87: Hoare triple {3307#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3307#false} is VALID [2022-02-20 14:03:58,323 INFO L290 TraceCheckUtils]: 86: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:58,324 INFO L290 TraceCheckUtils]: 85: Hoare triple {3307#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3307#false} is VALID [2022-02-20 14:03:58,324 INFO L290 TraceCheckUtils]: 84: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:58,324 INFO L290 TraceCheckUtils]: 83: Hoare triple {3307#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3307#false} is VALID [2022-02-20 14:03:58,324 INFO L290 TraceCheckUtils]: 82: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:58,324 INFO L290 TraceCheckUtils]: 81: Hoare triple {3307#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3307#false} is VALID [2022-02-20 14:03:58,324 INFO L290 TraceCheckUtils]: 80: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:58,325 INFO L290 TraceCheckUtils]: 79: Hoare triple {3307#false} main_~i~0#1 := 0; {3307#false} is VALID [2022-02-20 14:03:58,325 INFO L290 TraceCheckUtils]: 78: Hoare triple {3307#false} assume !(main_~i~0#1 < 100000); {3307#false} is VALID [2022-02-20 14:03:58,325 INFO L290 TraceCheckUtils]: 77: Hoare triple {3307#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3307#false} is VALID [2022-02-20 14:03:58,325 INFO L290 TraceCheckUtils]: 76: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:58,325 INFO L290 TraceCheckUtils]: 75: Hoare triple {3307#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3307#false} is VALID [2022-02-20 14:03:58,325 INFO L290 TraceCheckUtils]: 74: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:58,326 INFO L290 TraceCheckUtils]: 73: Hoare triple {3307#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3307#false} is VALID [2022-02-20 14:03:58,326 INFO L290 TraceCheckUtils]: 72: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:58,326 INFO L290 TraceCheckUtils]: 71: Hoare triple {3307#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3307#false} is VALID [2022-02-20 14:03:58,326 INFO L290 TraceCheckUtils]: 70: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:58,326 INFO L290 TraceCheckUtils]: 69: Hoare triple {3307#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3307#false} is VALID [2022-02-20 14:03:58,326 INFO L290 TraceCheckUtils]: 68: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:58,327 INFO L290 TraceCheckUtils]: 67: Hoare triple {3307#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3307#false} is VALID [2022-02-20 14:03:58,327 INFO L290 TraceCheckUtils]: 66: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:58,327 INFO L290 TraceCheckUtils]: 65: Hoare triple {3307#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3307#false} is VALID [2022-02-20 14:03:58,327 INFO L290 TraceCheckUtils]: 64: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:58,327 INFO L290 TraceCheckUtils]: 63: Hoare triple {3307#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3307#false} is VALID [2022-02-20 14:03:58,328 INFO L290 TraceCheckUtils]: 62: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:58,328 INFO L290 TraceCheckUtils]: 61: Hoare triple {3307#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3307#false} is VALID [2022-02-20 14:03:58,328 INFO L290 TraceCheckUtils]: 60: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:58,328 INFO L290 TraceCheckUtils]: 59: Hoare triple {3307#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3307#false} is VALID [2022-02-20 14:03:58,328 INFO L290 TraceCheckUtils]: 58: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:58,328 INFO L290 TraceCheckUtils]: 57: Hoare triple {3307#false} main_~i~0#1 := 0; {3307#false} is VALID [2022-02-20 14:03:58,329 INFO L290 TraceCheckUtils]: 56: Hoare triple {3307#false} assume !(main_~i~0#1 < 100000); {3307#false} is VALID [2022-02-20 14:03:58,329 INFO L290 TraceCheckUtils]: 55: Hoare triple {3307#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3307#false} is VALID [2022-02-20 14:03:58,329 INFO L290 TraceCheckUtils]: 54: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:58,329 INFO L290 TraceCheckUtils]: 53: Hoare triple {3307#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3307#false} is VALID [2022-02-20 14:03:58,329 INFO L290 TraceCheckUtils]: 52: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:58,330 INFO L290 TraceCheckUtils]: 51: Hoare triple {3307#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3307#false} is VALID [2022-02-20 14:03:58,330 INFO L290 TraceCheckUtils]: 50: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:58,330 INFO L290 TraceCheckUtils]: 49: Hoare triple {3307#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3307#false} is VALID [2022-02-20 14:03:58,330 INFO L290 TraceCheckUtils]: 48: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:58,330 INFO L290 TraceCheckUtils]: 47: Hoare triple {3307#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3307#false} is VALID [2022-02-20 14:03:58,330 INFO L290 TraceCheckUtils]: 46: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:58,331 INFO L290 TraceCheckUtils]: 45: Hoare triple {3307#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3307#false} is VALID [2022-02-20 14:03:58,331 INFO L290 TraceCheckUtils]: 44: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:58,331 INFO L290 TraceCheckUtils]: 43: Hoare triple {3307#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3307#false} is VALID [2022-02-20 14:03:58,331 INFO L290 TraceCheckUtils]: 42: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:58,331 INFO L290 TraceCheckUtils]: 41: Hoare triple {3307#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3307#false} is VALID [2022-02-20 14:03:58,331 INFO L290 TraceCheckUtils]: 40: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:58,332 INFO L290 TraceCheckUtils]: 39: Hoare triple {3307#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3307#false} is VALID [2022-02-20 14:03:58,332 INFO L290 TraceCheckUtils]: 38: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:58,332 INFO L290 TraceCheckUtils]: 37: Hoare triple {3307#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3307#false} is VALID [2022-02-20 14:03:58,332 INFO L290 TraceCheckUtils]: 36: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:58,332 INFO L290 TraceCheckUtils]: 35: Hoare triple {3307#false} main_~i~0#1 := 0; {3307#false} is VALID [2022-02-20 14:03:58,333 INFO L290 TraceCheckUtils]: 34: Hoare triple {3307#false} assume !(main_~i~0#1 < 100000); {3307#false} is VALID [2022-02-20 14:03:58,333 INFO L290 TraceCheckUtils]: 33: Hoare triple {3307#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3307#false} is VALID [2022-02-20 14:03:58,333 INFO L290 TraceCheckUtils]: 32: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:58,333 INFO L290 TraceCheckUtils]: 31: Hoare triple {3307#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3307#false} is VALID [2022-02-20 14:03:58,333 INFO L290 TraceCheckUtils]: 30: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:58,333 INFO L290 TraceCheckUtils]: 29: Hoare triple {3307#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3307#false} is VALID [2022-02-20 14:03:58,334 INFO L290 TraceCheckUtils]: 28: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:58,334 INFO L290 TraceCheckUtils]: 27: Hoare triple {3307#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3307#false} is VALID [2022-02-20 14:03:58,334 INFO L290 TraceCheckUtils]: 26: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:58,334 INFO L290 TraceCheckUtils]: 25: Hoare triple {3307#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3307#false} is VALID [2022-02-20 14:03:58,334 INFO L290 TraceCheckUtils]: 24: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:58,335 INFO L290 TraceCheckUtils]: 23: Hoare triple {3307#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3307#false} is VALID [2022-02-20 14:03:58,335 INFO L290 TraceCheckUtils]: 22: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:58,335 INFO L290 TraceCheckUtils]: 21: Hoare triple {3307#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3307#false} is VALID [2022-02-20 14:03:58,335 INFO L290 TraceCheckUtils]: 20: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:58,335 INFO L290 TraceCheckUtils]: 19: Hoare triple {3307#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3307#false} is VALID [2022-02-20 14:03:58,335 INFO L290 TraceCheckUtils]: 18: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:58,336 INFO L290 TraceCheckUtils]: 17: Hoare triple {3307#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3307#false} is VALID [2022-02-20 14:03:58,336 INFO L290 TraceCheckUtils]: 16: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:58,336 INFO L290 TraceCheckUtils]: 15: Hoare triple {3307#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3307#false} is VALID [2022-02-20 14:03:58,336 INFO L290 TraceCheckUtils]: 14: Hoare triple {3307#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; {3307#false} is VALID [2022-02-20 14:03:58,336 INFO L290 TraceCheckUtils]: 13: Hoare triple {3307#false} havoc main_~i~0#1;main_~i~0#1 := 0; {3307#false} is VALID [2022-02-20 14:03:58,337 INFO L290 TraceCheckUtils]: 12: Hoare triple {4302#(< |ULTIMATE.start_main_~a~0#1| 100000)} assume !(main_~a~0#1 < 100000); {3307#false} is VALID [2022-02-20 14:03:58,338 INFO L290 TraceCheckUtils]: 11: Hoare triple {4306#(< |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; {4302#(< |ULTIMATE.start_main_~a~0#1| 100000)} is VALID [2022-02-20 14:03:58,338 INFO L290 TraceCheckUtils]: 10: Hoare triple {4306#(< |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; {4306#(< |ULTIMATE.start_main_~a~0#1| 99999)} is VALID [2022-02-20 14:03:58,339 INFO L290 TraceCheckUtils]: 9: Hoare triple {4313#(< |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; {4306#(< |ULTIMATE.start_main_~a~0#1| 99999)} is VALID [2022-02-20 14:03:58,339 INFO L290 TraceCheckUtils]: 8: Hoare triple {4313#(< |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; {4313#(< |ULTIMATE.start_main_~a~0#1| 99998)} is VALID [2022-02-20 14:03:58,339 INFO L290 TraceCheckUtils]: 7: Hoare triple {4320#(< |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; {4313#(< |ULTIMATE.start_main_~a~0#1| 99998)} is VALID [2022-02-20 14:03:58,340 INFO L290 TraceCheckUtils]: 6: Hoare triple {4320#(< |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; {4320#(< |ULTIMATE.start_main_~a~0#1| 99997)} is VALID [2022-02-20 14:03:58,340 INFO L290 TraceCheckUtils]: 5: Hoare triple {4327#(< |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; {4320#(< |ULTIMATE.start_main_~a~0#1| 99997)} is VALID [2022-02-20 14:03:58,341 INFO L290 TraceCheckUtils]: 4: Hoare triple {4327#(< |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; {4327#(< |ULTIMATE.start_main_~a~0#1| 99996)} is VALID [2022-02-20 14:03:58,341 INFO L290 TraceCheckUtils]: 3: Hoare triple {4334#(< |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; {4327#(< |ULTIMATE.start_main_~a~0#1| 99996)} is VALID [2022-02-20 14:03:58,342 INFO L290 TraceCheckUtils]: 2: Hoare triple {4334#(< |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; {4334#(< |ULTIMATE.start_main_~a~0#1| 99995)} is VALID [2022-02-20 14:03:58,343 INFO L290 TraceCheckUtils]: 1: Hoare triple {3306#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~post15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#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_~#a8~0#1.base, main_~#a8~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);call main_~#a8~0#1.base, main_~#a8~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {4334#(< |ULTIMATE.start_main_~a~0#1| 99995)} is VALID [2022-02-20 14:03:58,343 INFO L290 TraceCheckUtils]: 0: Hoare triple {3306#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); {3306#true} is VALID [2022-02-20 14:03:58,344 INFO L134 CoverageAnalysis]: Checked inductivity of 725 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 700 trivial. 0 not checked. [2022-02-20 14:03:58,344 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1115585501] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:03:58,344 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:03:58,345 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2022-02-20 14:03:58,345 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186750190] [2022-02-20 14:03:58,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:03:58,346 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.0) internal successors, (60), 15 states have internal predecessors, (60), 0 states have call successors, (0), 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 171 [2022-02-20 14:03:58,346 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:03:58,347 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 4.0) internal successors, (60), 15 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have 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:58,386 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:03:58,387 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-20 14:03:58,387 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:03:58,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-20 14:03:58,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2022-02-20 14:03:58,388 INFO L87 Difference]: Start difference. First operand 174 states and 182 transitions. Second operand has 15 states, 15 states have (on average 4.0) internal successors, (60), 15 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have 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:58,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:03:58,585 INFO L93 Difference]: Finished difference Result 349 states and 371 transitions. [2022-02-20 14:03:58,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 14:03:58,586 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.0) internal successors, (60), 15 states have internal predecessors, (60), 0 states have call successors, (0), 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 171 [2022-02-20 14:03:58,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:03:58,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 4.0) internal successors, (60), 15 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have 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:58,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 105 transitions. [2022-02-20 14:03:58,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 4.0) internal successors, (60), 15 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have 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:58,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 105 transitions. [2022-02-20 14:03:58,589 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 105 transitions. [2022-02-20 14:03:58,656 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:03:58,660 INFO L225 Difference]: With dead ends: 349 [2022-02-20 14:03:58,660 INFO L226 Difference]: Without dead ends: 188 [2022-02-20 14:03:58,661 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 335 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:58,662 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 12 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:03:58,662 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 146 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:03:58,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-02-20 14:03:58,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2022-02-20 14:03:58,722 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:03:58,723 INFO L82 GeneralOperation]: Start isEquivalent. First operand 188 states. Second operand has 188 states, 187 states have (on average 1.0481283422459893) internal successors, (196), 187 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have 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:58,723 INFO L74 IsIncluded]: Start isIncluded. First operand 188 states. Second operand has 188 states, 187 states have (on average 1.0481283422459893) internal successors, (196), 187 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have 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:58,724 INFO L87 Difference]: Start difference. First operand 188 states. Second operand has 188 states, 187 states have (on average 1.0481283422459893) internal successors, (196), 187 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have 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:58,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:03:58,730 INFO L93 Difference]: Finished difference Result 188 states and 196 transitions. [2022-02-20 14:03:58,730 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 196 transitions. [2022-02-20 14:03:58,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:03:58,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:03:58,731 INFO L74 IsIncluded]: Start isIncluded. First operand has 188 states, 187 states have (on average 1.0481283422459893) internal successors, (196), 187 states have internal predecessors, (196), 0 states have call successors, (0), 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 188 states. [2022-02-20 14:03:58,731 INFO L87 Difference]: Start difference. First operand has 188 states, 187 states have (on average 1.0481283422459893) internal successors, (196), 187 states have internal predecessors, (196), 0 states have call successors, (0), 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 188 states. [2022-02-20 14:03:58,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:03:58,735 INFO L93 Difference]: Finished difference Result 188 states and 196 transitions. [2022-02-20 14:03:58,735 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 196 transitions. [2022-02-20 14:03:58,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:03:58,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:03:58,736 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:03:58,736 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:03:58,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 187 states have (on average 1.0481283422459893) internal successors, (196), 187 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have 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:58,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 196 transitions. [2022-02-20 14:03:58,741 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 196 transitions. Word has length 171 [2022-02-20 14:03:58,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:03:58,741 INFO L470 AbstractCegarLoop]: Abstraction has 188 states and 196 transitions. [2022-02-20 14:03:58,742 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.0) internal successors, (60), 15 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have 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:58,742 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 196 transitions. [2022-02-20 14:03:58,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2022-02-20 14:03:58,743 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:03:58,744 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 10, 10, 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, 1, 1] [2022-02-20 14:03:58,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-02-20 14:03:58,967 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:58,967 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:03:58,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:03:58,968 INFO L85 PathProgramCache]: Analyzing trace with hash 727181845, now seen corresponding path program 5 times [2022-02-20 14:03:58,968 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:03:58,968 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967123358] [2022-02-20 14:03:58,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:03:58,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:03:59,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:03:59,236 INFO L290 TraceCheckUtils]: 0: Hoare triple {5516#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); {5516#true} is VALID [2022-02-20 14:03:59,237 INFO L290 TraceCheckUtils]: 1: Hoare triple {5516#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~post15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#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_~#a8~0#1.base, main_~#a8~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);call main_~#a8~0#1.base, main_~#a8~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {5518#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:03:59,237 INFO L290 TraceCheckUtils]: 2: Hoare triple {5518#(= |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; {5518#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:03:59,238 INFO L290 TraceCheckUtils]: 3: Hoare triple {5518#(= |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; {5519#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:03:59,238 INFO L290 TraceCheckUtils]: 4: Hoare triple {5519#(<= |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; {5519#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:03:59,238 INFO L290 TraceCheckUtils]: 5: Hoare triple {5519#(<= |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; {5520#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-20 14:03:59,239 INFO L290 TraceCheckUtils]: 6: Hoare triple {5520#(<= |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; {5520#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-20 14:03:59,239 INFO L290 TraceCheckUtils]: 7: Hoare triple {5520#(<= |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; {5521#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-20 14:03:59,239 INFO L290 TraceCheckUtils]: 8: Hoare triple {5521#(<= |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; {5521#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-20 14:03:59,240 INFO L290 TraceCheckUtils]: 9: Hoare triple {5521#(<= |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; {5522#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-20 14:03:59,240 INFO L290 TraceCheckUtils]: 10: Hoare triple {5522#(<= |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; {5522#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-20 14:03:59,240 INFO L290 TraceCheckUtils]: 11: Hoare triple {5522#(<= |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; {5523#(<= |ULTIMATE.start_main_~a~0#1| 5)} is VALID [2022-02-20 14:03:59,241 INFO L290 TraceCheckUtils]: 12: Hoare triple {5523#(<= |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; {5523#(<= |ULTIMATE.start_main_~a~0#1| 5)} is VALID [2022-02-20 14:03:59,241 INFO L290 TraceCheckUtils]: 13: Hoare triple {5523#(<= |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; {5524#(<= |ULTIMATE.start_main_~a~0#1| 6)} is VALID [2022-02-20 14:03:59,241 INFO L290 TraceCheckUtils]: 14: Hoare triple {5524#(<= |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; {5524#(<= |ULTIMATE.start_main_~a~0#1| 6)} is VALID [2022-02-20 14:03:59,242 INFO L290 TraceCheckUtils]: 15: Hoare triple {5524#(<= |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; {5525#(<= |ULTIMATE.start_main_~a~0#1| 7)} is VALID [2022-02-20 14:03:59,242 INFO L290 TraceCheckUtils]: 16: Hoare triple {5525#(<= |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; {5525#(<= |ULTIMATE.start_main_~a~0#1| 7)} is VALID [2022-02-20 14:03:59,243 INFO L290 TraceCheckUtils]: 17: Hoare triple {5525#(<= |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; {5526#(<= |ULTIMATE.start_main_~a~0#1| 8)} is VALID [2022-02-20 14:03:59,244 INFO L290 TraceCheckUtils]: 18: Hoare triple {5526#(<= |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; {5526#(<= |ULTIMATE.start_main_~a~0#1| 8)} is VALID [2022-02-20 14:03:59,244 INFO L290 TraceCheckUtils]: 19: Hoare triple {5526#(<= |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; {5527#(<= |ULTIMATE.start_main_~a~0#1| 9)} is VALID [2022-02-20 14:03:59,244 INFO L290 TraceCheckUtils]: 20: Hoare triple {5527#(<= |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; {5527#(<= |ULTIMATE.start_main_~a~0#1| 9)} is VALID [2022-02-20 14:03:59,245 INFO L290 TraceCheckUtils]: 21: Hoare triple {5527#(<= |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; {5528#(<= |ULTIMATE.start_main_~a~0#1| 10)} is VALID [2022-02-20 14:03:59,245 INFO L290 TraceCheckUtils]: 22: Hoare triple {5528#(<= |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; {5528#(<= |ULTIMATE.start_main_~a~0#1| 10)} is VALID [2022-02-20 14:03:59,246 INFO L290 TraceCheckUtils]: 23: Hoare triple {5528#(<= |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; {5529#(<= |ULTIMATE.start_main_~a~0#1| 11)} is VALID [2022-02-20 14:03:59,246 INFO L290 TraceCheckUtils]: 24: Hoare triple {5529#(<= |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; {5529#(<= |ULTIMATE.start_main_~a~0#1| 11)} is VALID [2022-02-20 14:03:59,247 INFO L290 TraceCheckUtils]: 25: Hoare triple {5529#(<= |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; {5530#(<= |ULTIMATE.start_main_~a~0#1| 12)} is VALID [2022-02-20 14:03:59,247 INFO L290 TraceCheckUtils]: 26: Hoare triple {5530#(<= |ULTIMATE.start_main_~a~0#1| 12)} assume !(main_~a~0#1 < 100000); {5517#false} is VALID [2022-02-20 14:03:59,247 INFO L290 TraceCheckUtils]: 27: Hoare triple {5517#false} havoc main_~i~0#1;main_~i~0#1 := 0; {5517#false} is VALID [2022-02-20 14:03:59,247 INFO L290 TraceCheckUtils]: 28: Hoare triple {5517#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; {5517#false} is VALID [2022-02-20 14:03:59,248 INFO L290 TraceCheckUtils]: 29: Hoare triple {5517#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5517#false} is VALID [2022-02-20 14:03:59,248 INFO L290 TraceCheckUtils]: 30: Hoare triple {5517#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; {5517#false} is VALID [2022-02-20 14:03:59,248 INFO L290 TraceCheckUtils]: 31: Hoare triple {5517#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5517#false} is VALID [2022-02-20 14:03:59,248 INFO L290 TraceCheckUtils]: 32: Hoare triple {5517#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; {5517#false} is VALID [2022-02-20 14:03:59,248 INFO L290 TraceCheckUtils]: 33: Hoare triple {5517#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5517#false} is VALID [2022-02-20 14:03:59,248 INFO L290 TraceCheckUtils]: 34: Hoare triple {5517#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; {5517#false} is VALID [2022-02-20 14:03:59,248 INFO L290 TraceCheckUtils]: 35: Hoare triple {5517#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5517#false} is VALID [2022-02-20 14:03:59,248 INFO L290 TraceCheckUtils]: 36: Hoare triple {5517#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; {5517#false} is VALID [2022-02-20 14:03:59,248 INFO L290 TraceCheckUtils]: 37: Hoare triple {5517#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5517#false} is VALID [2022-02-20 14:03:59,248 INFO L290 TraceCheckUtils]: 38: Hoare triple {5517#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; {5517#false} is VALID [2022-02-20 14:03:59,248 INFO L290 TraceCheckUtils]: 39: Hoare triple {5517#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5517#false} is VALID [2022-02-20 14:03:59,249 INFO L290 TraceCheckUtils]: 40: Hoare triple {5517#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; {5517#false} is VALID [2022-02-20 14:03:59,249 INFO L290 TraceCheckUtils]: 41: Hoare triple {5517#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5517#false} is VALID [2022-02-20 14:03:59,249 INFO L290 TraceCheckUtils]: 42: Hoare triple {5517#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; {5517#false} is VALID [2022-02-20 14:03:59,249 INFO L290 TraceCheckUtils]: 43: Hoare triple {5517#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5517#false} is VALID [2022-02-20 14:03:59,249 INFO L290 TraceCheckUtils]: 44: Hoare triple {5517#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; {5517#false} is VALID [2022-02-20 14:03:59,249 INFO L290 TraceCheckUtils]: 45: Hoare triple {5517#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5517#false} is VALID [2022-02-20 14:03:59,249 INFO L290 TraceCheckUtils]: 46: Hoare triple {5517#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; {5517#false} is VALID [2022-02-20 14:03:59,249 INFO L290 TraceCheckUtils]: 47: Hoare triple {5517#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5517#false} is VALID [2022-02-20 14:03:59,249 INFO L290 TraceCheckUtils]: 48: Hoare triple {5517#false} assume !(main_~i~0#1 < 100000); {5517#false} is VALID [2022-02-20 14:03:59,249 INFO L290 TraceCheckUtils]: 49: Hoare triple {5517#false} main_~i~0#1 := 0; {5517#false} is VALID [2022-02-20 14:03:59,249 INFO L290 TraceCheckUtils]: 50: Hoare triple {5517#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; {5517#false} is VALID [2022-02-20 14:03:59,249 INFO L290 TraceCheckUtils]: 51: Hoare triple {5517#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {5517#false} is VALID [2022-02-20 14:03:59,249 INFO L290 TraceCheckUtils]: 52: Hoare triple {5517#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; {5517#false} is VALID [2022-02-20 14:03:59,249 INFO L290 TraceCheckUtils]: 53: Hoare triple {5517#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {5517#false} is VALID [2022-02-20 14:03:59,250 INFO L290 TraceCheckUtils]: 54: Hoare triple {5517#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; {5517#false} is VALID [2022-02-20 14:03:59,250 INFO L290 TraceCheckUtils]: 55: Hoare triple {5517#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {5517#false} is VALID [2022-02-20 14:03:59,250 INFO L290 TraceCheckUtils]: 56: Hoare triple {5517#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; {5517#false} is VALID [2022-02-20 14:03:59,250 INFO L290 TraceCheckUtils]: 57: Hoare triple {5517#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {5517#false} is VALID [2022-02-20 14:03:59,250 INFO L290 TraceCheckUtils]: 58: Hoare triple {5517#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; {5517#false} is VALID [2022-02-20 14:03:59,250 INFO L290 TraceCheckUtils]: 59: Hoare triple {5517#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {5517#false} is VALID [2022-02-20 14:03:59,250 INFO L290 TraceCheckUtils]: 60: Hoare triple {5517#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; {5517#false} is VALID [2022-02-20 14:03:59,250 INFO L290 TraceCheckUtils]: 61: Hoare triple {5517#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {5517#false} is VALID [2022-02-20 14:03:59,250 INFO L290 TraceCheckUtils]: 62: Hoare triple {5517#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; {5517#false} is VALID [2022-02-20 14:03:59,250 INFO L290 TraceCheckUtils]: 63: Hoare triple {5517#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {5517#false} is VALID [2022-02-20 14:03:59,250 INFO L290 TraceCheckUtils]: 64: Hoare triple {5517#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; {5517#false} is VALID [2022-02-20 14:03:59,251 INFO L290 TraceCheckUtils]: 65: Hoare triple {5517#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {5517#false} is VALID [2022-02-20 14:03:59,251 INFO L290 TraceCheckUtils]: 66: Hoare triple {5517#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; {5517#false} is VALID [2022-02-20 14:03:59,251 INFO L290 TraceCheckUtils]: 67: Hoare triple {5517#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {5517#false} is VALID [2022-02-20 14:03:59,251 INFO L290 TraceCheckUtils]: 68: Hoare triple {5517#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; {5517#false} is VALID [2022-02-20 14:03:59,251 INFO L290 TraceCheckUtils]: 69: Hoare triple {5517#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {5517#false} is VALID [2022-02-20 14:03:59,251 INFO L290 TraceCheckUtils]: 70: Hoare triple {5517#false} assume !(main_~i~0#1 < 100000); {5517#false} is VALID [2022-02-20 14:03:59,251 INFO L290 TraceCheckUtils]: 71: Hoare triple {5517#false} main_~i~0#1 := 0; {5517#false} is VALID [2022-02-20 14:03:59,251 INFO L290 TraceCheckUtils]: 72: Hoare triple {5517#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; {5517#false} is VALID [2022-02-20 14:03:59,251 INFO L290 TraceCheckUtils]: 73: Hoare triple {5517#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {5517#false} is VALID [2022-02-20 14:03:59,252 INFO L290 TraceCheckUtils]: 74: Hoare triple {5517#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; {5517#false} is VALID [2022-02-20 14:03:59,252 INFO L290 TraceCheckUtils]: 75: Hoare triple {5517#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {5517#false} is VALID [2022-02-20 14:03:59,252 INFO L290 TraceCheckUtils]: 76: Hoare triple {5517#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; {5517#false} is VALID [2022-02-20 14:03:59,252 INFO L290 TraceCheckUtils]: 77: Hoare triple {5517#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {5517#false} is VALID [2022-02-20 14:03:59,252 INFO L290 TraceCheckUtils]: 78: Hoare triple {5517#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; {5517#false} is VALID [2022-02-20 14:03:59,252 INFO L290 TraceCheckUtils]: 79: Hoare triple {5517#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {5517#false} is VALID [2022-02-20 14:03:59,252 INFO L290 TraceCheckUtils]: 80: Hoare triple {5517#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; {5517#false} is VALID [2022-02-20 14:03:59,252 INFO L290 TraceCheckUtils]: 81: Hoare triple {5517#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {5517#false} is VALID [2022-02-20 14:03:59,252 INFO L290 TraceCheckUtils]: 82: Hoare triple {5517#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; {5517#false} is VALID [2022-02-20 14:03:59,252 INFO L290 TraceCheckUtils]: 83: Hoare triple {5517#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {5517#false} is VALID [2022-02-20 14:03:59,252 INFO L290 TraceCheckUtils]: 84: Hoare triple {5517#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; {5517#false} is VALID [2022-02-20 14:03:59,253 INFO L290 TraceCheckUtils]: 85: Hoare triple {5517#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {5517#false} is VALID [2022-02-20 14:03:59,253 INFO L290 TraceCheckUtils]: 86: Hoare triple {5517#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; {5517#false} is VALID [2022-02-20 14:03:59,253 INFO L290 TraceCheckUtils]: 87: Hoare triple {5517#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {5517#false} is VALID [2022-02-20 14:03:59,253 INFO L290 TraceCheckUtils]: 88: Hoare triple {5517#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; {5517#false} is VALID [2022-02-20 14:03:59,253 INFO L290 TraceCheckUtils]: 89: Hoare triple {5517#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {5517#false} is VALID [2022-02-20 14:03:59,253 INFO L290 TraceCheckUtils]: 90: Hoare triple {5517#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; {5517#false} is VALID [2022-02-20 14:03:59,253 INFO L290 TraceCheckUtils]: 91: Hoare triple {5517#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {5517#false} is VALID [2022-02-20 14:03:59,253 INFO L290 TraceCheckUtils]: 92: Hoare triple {5517#false} assume !(main_~i~0#1 < 100000); {5517#false} is VALID [2022-02-20 14:03:59,253 INFO L290 TraceCheckUtils]: 93: Hoare triple {5517#false} main_~i~0#1 := 0; {5517#false} is VALID [2022-02-20 14:03:59,253 INFO L290 TraceCheckUtils]: 94: Hoare triple {5517#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; {5517#false} is VALID [2022-02-20 14:03:59,253 INFO L290 TraceCheckUtils]: 95: Hoare triple {5517#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {5517#false} is VALID [2022-02-20 14:03:59,253 INFO L290 TraceCheckUtils]: 96: Hoare triple {5517#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; {5517#false} is VALID [2022-02-20 14:03:59,253 INFO L290 TraceCheckUtils]: 97: Hoare triple {5517#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {5517#false} is VALID [2022-02-20 14:03:59,253 INFO L290 TraceCheckUtils]: 98: Hoare triple {5517#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; {5517#false} is VALID [2022-02-20 14:03:59,254 INFO L290 TraceCheckUtils]: 99: Hoare triple {5517#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {5517#false} is VALID [2022-02-20 14:03:59,254 INFO L290 TraceCheckUtils]: 100: Hoare triple {5517#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; {5517#false} is VALID [2022-02-20 14:03:59,254 INFO L290 TraceCheckUtils]: 101: Hoare triple {5517#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {5517#false} is VALID [2022-02-20 14:03:59,254 INFO L290 TraceCheckUtils]: 102: Hoare triple {5517#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; {5517#false} is VALID [2022-02-20 14:03:59,254 INFO L290 TraceCheckUtils]: 103: Hoare triple {5517#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {5517#false} is VALID [2022-02-20 14:03:59,254 INFO L290 TraceCheckUtils]: 104: Hoare triple {5517#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; {5517#false} is VALID [2022-02-20 14:03:59,254 INFO L290 TraceCheckUtils]: 105: Hoare triple {5517#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {5517#false} is VALID [2022-02-20 14:03:59,254 INFO L290 TraceCheckUtils]: 106: Hoare triple {5517#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; {5517#false} is VALID [2022-02-20 14:03:59,254 INFO L290 TraceCheckUtils]: 107: Hoare triple {5517#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {5517#false} is VALID [2022-02-20 14:03:59,254 INFO L290 TraceCheckUtils]: 108: Hoare triple {5517#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; {5517#false} is VALID [2022-02-20 14:03:59,254 INFO L290 TraceCheckUtils]: 109: Hoare triple {5517#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {5517#false} is VALID [2022-02-20 14:03:59,254 INFO L290 TraceCheckUtils]: 110: Hoare triple {5517#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; {5517#false} is VALID [2022-02-20 14:03:59,254 INFO L290 TraceCheckUtils]: 111: Hoare triple {5517#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {5517#false} is VALID [2022-02-20 14:03:59,254 INFO L290 TraceCheckUtils]: 112: Hoare triple {5517#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; {5517#false} is VALID [2022-02-20 14:03:59,255 INFO L290 TraceCheckUtils]: 113: Hoare triple {5517#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {5517#false} is VALID [2022-02-20 14:03:59,255 INFO L290 TraceCheckUtils]: 114: Hoare triple {5517#false} assume !(main_~i~0#1 < 100000); {5517#false} is VALID [2022-02-20 14:03:59,255 INFO L290 TraceCheckUtils]: 115: Hoare triple {5517#false} main_~i~0#1 := 0; {5517#false} is VALID [2022-02-20 14:03:59,255 INFO L290 TraceCheckUtils]: 116: Hoare triple {5517#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; {5517#false} is VALID [2022-02-20 14:03:59,255 INFO L290 TraceCheckUtils]: 117: Hoare triple {5517#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {5517#false} is VALID [2022-02-20 14:03:59,255 INFO L290 TraceCheckUtils]: 118: Hoare triple {5517#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; {5517#false} is VALID [2022-02-20 14:03:59,255 INFO L290 TraceCheckUtils]: 119: Hoare triple {5517#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {5517#false} is VALID [2022-02-20 14:03:59,255 INFO L290 TraceCheckUtils]: 120: Hoare triple {5517#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; {5517#false} is VALID [2022-02-20 14:03:59,255 INFO L290 TraceCheckUtils]: 121: Hoare triple {5517#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {5517#false} is VALID [2022-02-20 14:03:59,255 INFO L290 TraceCheckUtils]: 122: Hoare triple {5517#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; {5517#false} is VALID [2022-02-20 14:03:59,255 INFO L290 TraceCheckUtils]: 123: Hoare triple {5517#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {5517#false} is VALID [2022-02-20 14:03:59,256 INFO L290 TraceCheckUtils]: 124: Hoare triple {5517#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; {5517#false} is VALID [2022-02-20 14:03:59,256 INFO L290 TraceCheckUtils]: 125: Hoare triple {5517#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {5517#false} is VALID [2022-02-20 14:03:59,256 INFO L290 TraceCheckUtils]: 126: Hoare triple {5517#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; {5517#false} is VALID [2022-02-20 14:03:59,256 INFO L290 TraceCheckUtils]: 127: Hoare triple {5517#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {5517#false} is VALID [2022-02-20 14:03:59,256 INFO L290 TraceCheckUtils]: 128: Hoare triple {5517#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; {5517#false} is VALID [2022-02-20 14:03:59,256 INFO L290 TraceCheckUtils]: 129: Hoare triple {5517#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {5517#false} is VALID [2022-02-20 14:03:59,257 INFO L290 TraceCheckUtils]: 130: Hoare triple {5517#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; {5517#false} is VALID [2022-02-20 14:03:59,257 INFO L290 TraceCheckUtils]: 131: Hoare triple {5517#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {5517#false} is VALID [2022-02-20 14:03:59,257 INFO L290 TraceCheckUtils]: 132: Hoare triple {5517#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; {5517#false} is VALID [2022-02-20 14:03:59,257 INFO L290 TraceCheckUtils]: 133: Hoare triple {5517#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {5517#false} is VALID [2022-02-20 14:03:59,257 INFO L290 TraceCheckUtils]: 134: Hoare triple {5517#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; {5517#false} is VALID [2022-02-20 14:03:59,257 INFO L290 TraceCheckUtils]: 135: Hoare triple {5517#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {5517#false} is VALID [2022-02-20 14:03:59,257 INFO L290 TraceCheckUtils]: 136: Hoare triple {5517#false} assume !(main_~i~0#1 < 100000); {5517#false} is VALID [2022-02-20 14:03:59,258 INFO L290 TraceCheckUtils]: 137: Hoare triple {5517#false} main_~i~0#1 := 0; {5517#false} is VALID [2022-02-20 14:03:59,258 INFO L290 TraceCheckUtils]: 138: Hoare triple {5517#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; {5517#false} is VALID [2022-02-20 14:03:59,258 INFO L290 TraceCheckUtils]: 139: Hoare triple {5517#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {5517#false} is VALID [2022-02-20 14:03:59,258 INFO L290 TraceCheckUtils]: 140: Hoare triple {5517#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; {5517#false} is VALID [2022-02-20 14:03:59,258 INFO L290 TraceCheckUtils]: 141: Hoare triple {5517#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {5517#false} is VALID [2022-02-20 14:03:59,258 INFO L290 TraceCheckUtils]: 142: Hoare triple {5517#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; {5517#false} is VALID [2022-02-20 14:03:59,258 INFO L290 TraceCheckUtils]: 143: Hoare triple {5517#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {5517#false} is VALID [2022-02-20 14:03:59,259 INFO L290 TraceCheckUtils]: 144: Hoare triple {5517#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; {5517#false} is VALID [2022-02-20 14:03:59,259 INFO L290 TraceCheckUtils]: 145: Hoare triple {5517#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {5517#false} is VALID [2022-02-20 14:03:59,259 INFO L290 TraceCheckUtils]: 146: Hoare triple {5517#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; {5517#false} is VALID [2022-02-20 14:03:59,259 INFO L290 TraceCheckUtils]: 147: Hoare triple {5517#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {5517#false} is VALID [2022-02-20 14:03:59,259 INFO L290 TraceCheckUtils]: 148: Hoare triple {5517#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; {5517#false} is VALID [2022-02-20 14:03:59,259 INFO L290 TraceCheckUtils]: 149: Hoare triple {5517#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {5517#false} is VALID [2022-02-20 14:03:59,259 INFO L290 TraceCheckUtils]: 150: Hoare triple {5517#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; {5517#false} is VALID [2022-02-20 14:03:59,260 INFO L290 TraceCheckUtils]: 151: Hoare triple {5517#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {5517#false} is VALID [2022-02-20 14:03:59,260 INFO L290 TraceCheckUtils]: 152: Hoare triple {5517#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; {5517#false} is VALID [2022-02-20 14:03:59,260 INFO L290 TraceCheckUtils]: 153: Hoare triple {5517#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {5517#false} is VALID [2022-02-20 14:03:59,260 INFO L290 TraceCheckUtils]: 154: Hoare triple {5517#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; {5517#false} is VALID [2022-02-20 14:03:59,260 INFO L290 TraceCheckUtils]: 155: Hoare triple {5517#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {5517#false} is VALID [2022-02-20 14:03:59,260 INFO L290 TraceCheckUtils]: 156: Hoare triple {5517#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; {5517#false} is VALID [2022-02-20 14:03:59,260 INFO L290 TraceCheckUtils]: 157: Hoare triple {5517#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {5517#false} is VALID [2022-02-20 14:03:59,261 INFO L290 TraceCheckUtils]: 158: Hoare triple {5517#false} assume !(main_~i~0#1 < 100000); {5517#false} is VALID [2022-02-20 14:03:59,261 INFO L290 TraceCheckUtils]: 159: Hoare triple {5517#false} main_~i~0#1 := 0; {5517#false} is VALID [2022-02-20 14:03:59,261 INFO L290 TraceCheckUtils]: 160: Hoare triple {5517#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {5517#false} is VALID [2022-02-20 14:03:59,261 INFO L290 TraceCheckUtils]: 161: Hoare triple {5517#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {5517#false} is VALID [2022-02-20 14:03:59,261 INFO L290 TraceCheckUtils]: 162: Hoare triple {5517#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {5517#false} is VALID [2022-02-20 14:03:59,261 INFO L290 TraceCheckUtils]: 163: Hoare triple {5517#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {5517#false} is VALID [2022-02-20 14:03:59,262 INFO L290 TraceCheckUtils]: 164: Hoare triple {5517#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {5517#false} is VALID [2022-02-20 14:03:59,262 INFO L290 TraceCheckUtils]: 165: Hoare triple {5517#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {5517#false} is VALID [2022-02-20 14:03:59,262 INFO L290 TraceCheckUtils]: 166: Hoare triple {5517#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {5517#false} is VALID [2022-02-20 14:03:59,262 INFO L290 TraceCheckUtils]: 167: Hoare triple {5517#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {5517#false} is VALID [2022-02-20 14:03:59,262 INFO L290 TraceCheckUtils]: 168: Hoare triple {5517#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {5517#false} is VALID [2022-02-20 14:03:59,262 INFO L290 TraceCheckUtils]: 169: Hoare triple {5517#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {5517#false} is VALID [2022-02-20 14:03:59,262 INFO L290 TraceCheckUtils]: 170: Hoare triple {5517#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {5517#false} is VALID [2022-02-20 14:03:59,263 INFO L290 TraceCheckUtils]: 171: Hoare triple {5517#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {5517#false} is VALID [2022-02-20 14:03:59,263 INFO L290 TraceCheckUtils]: 172: Hoare triple {5517#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {5517#false} is VALID [2022-02-20 14:03:59,263 INFO L290 TraceCheckUtils]: 173: Hoare triple {5517#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {5517#false} is VALID [2022-02-20 14:03:59,263 INFO L290 TraceCheckUtils]: 174: Hoare triple {5517#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {5517#false} is VALID [2022-02-20 14:03:59,263 INFO L290 TraceCheckUtils]: 175: Hoare triple {5517#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {5517#false} is VALID [2022-02-20 14:03:59,263 INFO L290 TraceCheckUtils]: 176: Hoare triple {5517#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {5517#false} is VALID [2022-02-20 14:03:59,263 INFO L290 TraceCheckUtils]: 177: Hoare triple {5517#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {5517#false} is VALID [2022-02-20 14:03:59,264 INFO L290 TraceCheckUtils]: 178: Hoare triple {5517#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {5517#false} is VALID [2022-02-20 14:03:59,264 INFO L290 TraceCheckUtils]: 179: Hoare triple {5517#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {5517#false} is VALID [2022-02-20 14:03:59,264 INFO L290 TraceCheckUtils]: 180: Hoare triple {5517#false} assume !(main_~i~0#1 < 100000); {5517#false} is VALID [2022-02-20 14:03:59,264 INFO L290 TraceCheckUtils]: 181: Hoare triple {5517#false} havoc main_~x~0#1;main_~x~0#1 := 0; {5517#false} is VALID [2022-02-20 14:03:59,264 INFO L290 TraceCheckUtils]: 182: Hoare triple {5517#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem18#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem19#1 := read~int(main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem18#1 == main_#t~mem19#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {5517#false} is VALID [2022-02-20 14:03:59,264 INFO L290 TraceCheckUtils]: 183: Hoare triple {5517#false} assume 0 == __VERIFIER_assert_~cond#1; {5517#false} is VALID [2022-02-20 14:03:59,264 INFO L290 TraceCheckUtils]: 184: Hoare triple {5517#false} assume !false; {5517#false} is VALID [2022-02-20 14:03:59,265 INFO L134 CoverageAnalysis]: Checked inductivity of 844 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 700 trivial. 0 not checked. [2022-02-20 14:03:59,265 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:03:59,265 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967123358] [2022-02-20 14:03:59,265 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967123358] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:03:59,266 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242837679] [2022-02-20 14:03:59,266 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-20 14:03:59,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:03:59,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:03:59,267 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:59,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process