./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-examples/standard_init4_ground-1.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_init4_ground-1.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 84dd450b83ffc0eda27ceeda48a4324978aec0ffc3f50cf64d7cfe4a88062bda --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 14:05:20,361 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 14:05:20,372 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 14:05:20,409 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 14:05:20,410 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 14:05:20,413 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 14:05:20,414 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 14:05:20,416 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 14:05:20,418 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 14:05:20,422 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 14:05:20,422 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 14:05:20,423 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 14:05:20,424 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 14:05:20,425 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 14:05:20,426 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 14:05:20,429 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 14:05:20,430 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 14:05:20,430 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 14:05:20,432 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 14:05:20,436 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 14:05:20,437 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 14:05:20,438 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 14:05:20,439 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 14:05:20,439 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 14:05:20,444 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 14:05:20,445 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 14:05:20,445 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 14:05:20,446 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 14:05:20,447 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 14:05:20,447 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 14:05:20,447 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 14:05:20,448 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 14:05:20,449 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 14:05:20,450 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 14:05:20,451 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 14:05:20,451 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 14:05:20,452 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 14:05:20,453 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 14:05:20,453 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 14:05:20,453 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 14:05:20,454 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 14:05:20,455 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:05:20,485 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 14:05:20,485 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 14:05:20,486 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 14:05:20,486 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 14:05:20,487 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 14:05:20,487 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 14:05:20,488 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 14:05:20,488 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 14:05:20,488 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 14:05:20,488 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 14:05:20,489 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 14:05:20,489 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 14:05:20,489 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 14:05:20,489 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 14:05:20,489 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 14:05:20,490 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 14:05:20,490 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 14:05:20,490 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 14:05:20,490 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 14:05:20,490 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 14:05:20,490 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 14:05:20,491 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 14:05:20,491 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 14:05:20,491 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 14:05:20,491 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:05:20,491 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 14:05:20,491 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 14:05:20,492 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 14:05:20,492 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 14:05:20,492 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 14:05:20,492 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 14:05:20,492 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 14:05:20,492 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 14:05:20,493 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 -> 84dd450b83ffc0eda27ceeda48a4324978aec0ffc3f50cf64d7cfe4a88062bda [2022-02-20 14:05:20,750 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 14:05:20,765 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 14:05:20,770 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 14:05:20,771 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 14:05:20,771 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 14:05:20,772 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-examples/standard_init4_ground-1.i [2022-02-20 14:05:20,832 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bf6d4676/171d7b71dc9b4d0081863da066096b72/FLAGae1af6b56 [2022-02-20 14:05:21,185 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 14:05:21,185 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/standard_init4_ground-1.i [2022-02-20 14:05:21,201 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bf6d4676/171d7b71dc9b4d0081863da066096b72/FLAGae1af6b56 [2022-02-20 14:05:21,614 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bf6d4676/171d7b71dc9b4d0081863da066096b72 [2022-02-20 14:05:21,615 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 14:05:21,616 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 14:05:21,618 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 14:05:21,619 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 14:05:21,621 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 14:05:21,622 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:05:21" (1/1) ... [2022-02-20 14:05:21,622 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8471ef1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:05:21, skipping insertion in model container [2022-02-20 14:05:21,622 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:05:21" (1/1) ... [2022-02-20 14:05:21,627 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 14:05:21,638 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 14:05:21,760 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_init4_ground-1.i[816,829] [2022-02-20 14:05:21,779 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:05:21,784 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 14:05:21,791 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_init4_ground-1.i[816,829] [2022-02-20 14:05:21,796 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:05:21,805 INFO L208 MainTranslator]: Completed translation [2022-02-20 14:05:21,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:05:21 WrapperNode [2022-02-20 14:05:21,805 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 14:05:21,806 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 14:05:21,806 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 14:05:21,806 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 14:05:21,811 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:05:21" (1/1) ... [2022-02-20 14:05:21,815 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:05:21" (1/1) ... [2022-02-20 14:05:21,839 INFO L137 Inliner]: procedures = 15, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 61 [2022-02-20 14:05:21,840 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 14:05:21,841 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 14:05:21,841 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 14:05:21,841 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 14:05:21,846 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:05:21" (1/1) ... [2022-02-20 14:05:21,846 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:05:21" (1/1) ... [2022-02-20 14:05:21,856 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:05:21" (1/1) ... [2022-02-20 14:05:21,856 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:05:21" (1/1) ... [2022-02-20 14:05:21,862 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:05:21" (1/1) ... [2022-02-20 14:05:21,866 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:05:21" (1/1) ... [2022-02-20 14:05:21,867 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:05:21" (1/1) ... [2022-02-20 14:05:21,871 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 14:05:21,873 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 14:05:21,873 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 14:05:21,874 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 14:05:21,875 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:05:21" (1/1) ... [2022-02-20 14:05:21,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:05:21,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:05:21,898 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:05:21,904 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:05:21,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 14:05:21,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 14:05:21,933 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 14:05:21,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 14:05:21,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 14:05:21,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 14:05:21,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 14:05:21,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 14:05:21,976 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 14:05:21,977 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 14:05:22,146 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 14:05:22,150 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 14:05:22,151 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-02-20 14:05:22,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:05:22 BoogieIcfgContainer [2022-02-20 14:05:22,152 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 14:05:22,153 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 14:05:22,153 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 14:05:22,156 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 14:05:22,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 02:05:21" (1/3) ... [2022-02-20 14:05:22,172 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40a1960d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:05:22, skipping insertion in model container [2022-02-20 14:05:22,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:05:21" (2/3) ... [2022-02-20 14:05:22,173 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40a1960d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:05:22, skipping insertion in model container [2022-02-20 14:05:22,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:05:22" (3/3) ... [2022-02-20 14:05:22,174 INFO L111 eAbstractionObserver]: Analyzing ICFG standard_init4_ground-1.i [2022-02-20 14:05:22,177 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 14:05:22,178 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 14:05:22,230 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 14:05:22,235 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:05:22,238 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 14:05:22,253 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 19 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have 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:05:22,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 14:05:22,257 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:05:22,258 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:05:22,258 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:05:22,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:05:22,265 INFO L85 PathProgramCache]: Analyzing trace with hash 474620133, now seen corresponding path program 1 times [2022-02-20 14:05:22,271 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:05:22,272 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273162469] [2022-02-20 14:05:22,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:05:22,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:05:22,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:05:22,397 INFO L290 TraceCheckUtils]: 0: Hoare triple {23#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); {23#true} is VALID [2022-02-20 14:05:22,399 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem2#1, main_#t~post1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {25#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:05:22,404 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~i~0#1 < 100000); {24#false} is VALID [2022-02-20 14:05:22,404 INFO L290 TraceCheckUtils]: 3: Hoare triple {24#false} main_~i~0#1 := 0; {24#false} is VALID [2022-02-20 14:05:22,404 INFO L290 TraceCheckUtils]: 4: Hoare triple {24#false} assume !(main_~i~0#1 < 100000); {24#false} is VALID [2022-02-20 14:05:22,404 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#false} main_~i~0#1 := 0; {24#false} is VALID [2022-02-20 14:05:22,405 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#false} assume !(main_~i~0#1 < 100000); {24#false} is VALID [2022-02-20 14:05:22,405 INFO L290 TraceCheckUtils]: 7: Hoare triple {24#false} main_~i~0#1 := 0; {24#false} is VALID [2022-02-20 14:05:22,405 INFO L290 TraceCheckUtils]: 8: Hoare triple {24#false} assume !(main_~i~0#1 < 100000); {24#false} is VALID [2022-02-20 14:05:22,405 INFO L290 TraceCheckUtils]: 9: Hoare triple {24#false} havoc main_~x~0#1;main_~x~0#1 := 0; {24#false} is VALID [2022-02-20 14:05:22,406 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 46 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {24#false} is VALID [2022-02-20 14:05:22,406 INFO L290 TraceCheckUtils]: 11: Hoare triple {24#false} assume 0 == __VERIFIER_assert_~cond#1; {24#false} is VALID [2022-02-20 14:05:22,406 INFO L290 TraceCheckUtils]: 12: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-02-20 14:05:22,407 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:05:22,408 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:05:22,408 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273162469] [2022-02-20 14:05:22,409 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273162469] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:05:22,409 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:05:22,409 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:05:22,412 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006839307] [2022-02-20 14:05:22,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:05:22,418 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2022-02-20 14:05:22,418 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:05:22,421 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have 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:05:22,442 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:05:22,443 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:05:22,443 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:05:22,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:05:22,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:05:22,461 INFO L87 Difference]: Start difference. First operand has 20 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 19 states have internal predecessors, (30), 0 states have call successors, (0), 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 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have 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:05:22,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:05:22,539 INFO L93 Difference]: Finished difference Result 41 states and 67 transitions. [2022-02-20 14:05:22,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:05:22,540 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2022-02-20 14:05:22,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:05:22,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have 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:05:22,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2022-02-20 14:05:22,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have 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:05:22,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2022-02-20 14:05:22,546 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 67 transitions. [2022-02-20 14:05:22,616 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:05:22,621 INFO L225 Difference]: With dead ends: 41 [2022-02-20 14:05:22,622 INFO L226 Difference]: Without dead ends: 20 [2022-02-20 14:05:22,623 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:05:22,626 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:05:22,626 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:05:22,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-02-20 14:05:22,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-02-20 14:05:22,657 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:05:22,657 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have 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:05:22,658 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have 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:05:22,658 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have 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:05:22,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:05:22,660 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2022-02-20 14:05:22,660 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-02-20 14:05:22,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:05:22,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:05:22,660 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 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 20 states. [2022-02-20 14:05:22,661 INFO L87 Difference]: Start difference. First operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 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 20 states. [2022-02-20 14:05:22,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:05:22,662 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2022-02-20 14:05:22,662 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-02-20 14:05:22,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:05:22,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:05:22,663 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:05:22,663 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:05:22,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have 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:05:22,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2022-02-20 14:05:22,665 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 13 [2022-02-20 14:05:22,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:05:22,665 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2022-02-20 14:05:22,666 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have 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:05:22,666 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-02-20 14:05:22,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 14:05:22,666 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:05:22,666 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:05:22,667 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 14:05:22,667 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:05:22,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:05:22,668 INFO L85 PathProgramCache]: Analyzing trace with hash -40844573, now seen corresponding path program 1 times [2022-02-20 14:05:22,668 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:05:22,668 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716858027] [2022-02-20 14:05:22,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:05:22,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:05:22,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:05:22,717 INFO L290 TraceCheckUtils]: 0: Hoare triple {153#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); {153#true} is VALID [2022-02-20 14:05:22,718 INFO L290 TraceCheckUtils]: 1: Hoare triple {153#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem2#1, main_#t~post1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {155#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:05:22,718 INFO L290 TraceCheckUtils]: 2: Hoare triple {155#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {156#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:05:22,719 INFO L290 TraceCheckUtils]: 3: Hoare triple {156#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < 100000); {154#false} is VALID [2022-02-20 14:05:22,719 INFO L290 TraceCheckUtils]: 4: Hoare triple {154#false} main_~i~0#1 := 0; {154#false} is VALID [2022-02-20 14:05:22,719 INFO L290 TraceCheckUtils]: 5: Hoare triple {154#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {154#false} is VALID [2022-02-20 14:05:22,719 INFO L290 TraceCheckUtils]: 6: Hoare triple {154#false} assume !(main_~i~0#1 < 100000); {154#false} is VALID [2022-02-20 14:05:22,719 INFO L290 TraceCheckUtils]: 7: Hoare triple {154#false} main_~i~0#1 := 0; {154#false} is VALID [2022-02-20 14:05:22,720 INFO L290 TraceCheckUtils]: 8: Hoare triple {154#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {154#false} is VALID [2022-02-20 14:05:22,720 INFO L290 TraceCheckUtils]: 9: Hoare triple {154#false} assume !(main_~i~0#1 < 100000); {154#false} is VALID [2022-02-20 14:05:22,720 INFO L290 TraceCheckUtils]: 10: Hoare triple {154#false} main_~i~0#1 := 0; {154#false} is VALID [2022-02-20 14:05:22,720 INFO L290 TraceCheckUtils]: 11: Hoare triple {154#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {154#false} is VALID [2022-02-20 14:05:22,720 INFO L290 TraceCheckUtils]: 12: Hoare triple {154#false} assume !(main_~i~0#1 < 100000); {154#false} is VALID [2022-02-20 14:05:22,721 INFO L290 TraceCheckUtils]: 13: Hoare triple {154#false} havoc main_~x~0#1;main_~x~0#1 := 0; {154#false} is VALID [2022-02-20 14:05:22,721 INFO L290 TraceCheckUtils]: 14: Hoare triple {154#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 46 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {154#false} is VALID [2022-02-20 14:05:22,721 INFO L290 TraceCheckUtils]: 15: Hoare triple {154#false} assume 0 == __VERIFIER_assert_~cond#1; {154#false} is VALID [2022-02-20 14:05:22,721 INFO L290 TraceCheckUtils]: 16: Hoare triple {154#false} assume !false; {154#false} is VALID [2022-02-20 14:05:22,722 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 14:05:22,722 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:05:22,722 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716858027] [2022-02-20 14:05:22,722 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716858027] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:05:22,722 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2049631795] [2022-02-20 14:05:22,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:05:22,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:05:22,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:05:22,724 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:05:22,725 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:05:22,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:05:22,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 14:05:22,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:05:22,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:05:22,889 INFO L290 TraceCheckUtils]: 0: Hoare triple {153#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); {153#true} is VALID [2022-02-20 14:05:22,890 INFO L290 TraceCheckUtils]: 1: Hoare triple {153#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem2#1, main_#t~post1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {163#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:05:22,891 INFO L290 TraceCheckUtils]: 2: Hoare triple {163#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {156#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:05:22,891 INFO L290 TraceCheckUtils]: 3: Hoare triple {156#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < 100000); {154#false} is VALID [2022-02-20 14:05:22,891 INFO L290 TraceCheckUtils]: 4: Hoare triple {154#false} main_~i~0#1 := 0; {154#false} is VALID [2022-02-20 14:05:22,892 INFO L290 TraceCheckUtils]: 5: Hoare triple {154#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {154#false} is VALID [2022-02-20 14:05:22,892 INFO L290 TraceCheckUtils]: 6: Hoare triple {154#false} assume !(main_~i~0#1 < 100000); {154#false} is VALID [2022-02-20 14:05:22,893 INFO L290 TraceCheckUtils]: 7: Hoare triple {154#false} main_~i~0#1 := 0; {154#false} is VALID [2022-02-20 14:05:22,893 INFO L290 TraceCheckUtils]: 8: Hoare triple {154#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {154#false} is VALID [2022-02-20 14:05:22,893 INFO L290 TraceCheckUtils]: 9: Hoare triple {154#false} assume !(main_~i~0#1 < 100000); {154#false} is VALID [2022-02-20 14:05:22,893 INFO L290 TraceCheckUtils]: 10: Hoare triple {154#false} main_~i~0#1 := 0; {154#false} is VALID [2022-02-20 14:05:22,893 INFO L290 TraceCheckUtils]: 11: Hoare triple {154#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {154#false} is VALID [2022-02-20 14:05:22,894 INFO L290 TraceCheckUtils]: 12: Hoare triple {154#false} assume !(main_~i~0#1 < 100000); {154#false} is VALID [2022-02-20 14:05:22,894 INFO L290 TraceCheckUtils]: 13: Hoare triple {154#false} havoc main_~x~0#1;main_~x~0#1 := 0; {154#false} is VALID [2022-02-20 14:05:22,894 INFO L290 TraceCheckUtils]: 14: Hoare triple {154#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 46 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {154#false} is VALID [2022-02-20 14:05:22,894 INFO L290 TraceCheckUtils]: 15: Hoare triple {154#false} assume 0 == __VERIFIER_assert_~cond#1; {154#false} is VALID [2022-02-20 14:05:22,894 INFO L290 TraceCheckUtils]: 16: Hoare triple {154#false} assume !false; {154#false} is VALID [2022-02-20 14:05:22,895 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 14:05:22,895 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:05:22,980 INFO L290 TraceCheckUtils]: 16: Hoare triple {154#false} assume !false; {154#false} is VALID [2022-02-20 14:05:22,980 INFO L290 TraceCheckUtils]: 15: Hoare triple {154#false} assume 0 == __VERIFIER_assert_~cond#1; {154#false} is VALID [2022-02-20 14:05:22,980 INFO L290 TraceCheckUtils]: 14: Hoare triple {154#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 46 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {154#false} is VALID [2022-02-20 14:05:22,983 INFO L290 TraceCheckUtils]: 13: Hoare triple {154#false} havoc main_~x~0#1;main_~x~0#1 := 0; {154#false} is VALID [2022-02-20 14:05:22,983 INFO L290 TraceCheckUtils]: 12: Hoare triple {154#false} assume !(main_~i~0#1 < 100000); {154#false} is VALID [2022-02-20 14:05:22,986 INFO L290 TraceCheckUtils]: 11: Hoare triple {154#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {154#false} is VALID [2022-02-20 14:05:22,987 INFO L290 TraceCheckUtils]: 10: Hoare triple {154#false} main_~i~0#1 := 0; {154#false} is VALID [2022-02-20 14:05:22,987 INFO L290 TraceCheckUtils]: 9: Hoare triple {154#false} assume !(main_~i~0#1 < 100000); {154#false} is VALID [2022-02-20 14:05:22,987 INFO L290 TraceCheckUtils]: 8: Hoare triple {154#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {154#false} is VALID [2022-02-20 14:05:22,987 INFO L290 TraceCheckUtils]: 7: Hoare triple {154#false} main_~i~0#1 := 0; {154#false} is VALID [2022-02-20 14:05:22,988 INFO L290 TraceCheckUtils]: 6: Hoare triple {154#false} assume !(main_~i~0#1 < 100000); {154#false} is VALID [2022-02-20 14:05:22,988 INFO L290 TraceCheckUtils]: 5: Hoare triple {154#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {154#false} is VALID [2022-02-20 14:05:22,988 INFO L290 TraceCheckUtils]: 4: Hoare triple {154#false} main_~i~0#1 := 0; {154#false} is VALID [2022-02-20 14:05:22,989 INFO L290 TraceCheckUtils]: 3: Hoare triple {248#(< |ULTIMATE.start_main_~i~0#1| 100000)} assume !(main_~i~0#1 < 100000); {154#false} is VALID [2022-02-20 14:05:22,989 INFO L290 TraceCheckUtils]: 2: Hoare triple {252#(< |ULTIMATE.start_main_~i~0#1| 99999)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {248#(< |ULTIMATE.start_main_~i~0#1| 100000)} is VALID [2022-02-20 14:05:22,990 INFO L290 TraceCheckUtils]: 1: Hoare triple {153#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem2#1, main_#t~post1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {252#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:05:22,990 INFO L290 TraceCheckUtils]: 0: Hoare triple {153#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); {153#true} is VALID [2022-02-20 14:05:22,990 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 14:05:22,991 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2049631795] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:05:22,994 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:05:22,994 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-02-20 14:05:22,995 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434274714] [2022-02-20 14:05:22,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:05:22,997 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-20 14:05:22,997 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:05:22,997 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:23,010 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:05:23,012 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 14:05:23,012 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:05:23,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 14:05:23,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-02-20 14:05:23,014 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:23,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:05:23,131 INFO L93 Difference]: Finished difference Result 48 states and 67 transitions. [2022-02-20 14:05:23,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 14:05:23,131 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-20 14:05:23,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:05:23,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:23,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 64 transitions. [2022-02-20 14:05:23,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:23,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 64 transitions. [2022-02-20 14:05:23,139 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 64 transitions. [2022-02-20 14:05:23,178 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:05:23,181 INFO L225 Difference]: With dead ends: 48 [2022-02-20 14:05:23,181 INFO L226 Difference]: Without dead ends: 32 [2022-02-20 14:05:23,182 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 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:05:23,183 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:05:23,184 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:05:23,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-02-20 14:05:23,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-02-20 14:05:23,203 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:05:23,204 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have 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:05:23,206 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have 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:05:23,206 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have 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:05:23,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:05:23,209 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-02-20 14:05:23,209 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-02-20 14:05:23,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:05:23,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:05:23,210 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 0 states have call successors, (0), 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 32 states. [2022-02-20 14:05:23,211 INFO L87 Difference]: Start difference. First operand has 32 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 0 states have call successors, (0), 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 32 states. [2022-02-20 14:05:23,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:05:23,213 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-02-20 14:05:23,213 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-02-20 14:05:23,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:05:23,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:05:23,214 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:05:23,215 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:05:23,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have 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:05:23,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-02-20 14:05:23,238 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 17 [2022-02-20 14:05:23,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:05:23,238 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-02-20 14:05:23,239 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:23,239 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-02-20 14:05:23,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 14:05:23,239 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:05:23,240 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:05:23,260 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:05:23,457 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:05:23,457 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:05:23,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:05:23,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1096399461, now seen corresponding path program 2 times [2022-02-20 14:05:23,458 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:05:23,458 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400234682] [2022-02-20 14:05:23,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:05:23,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:05:23,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:05:23,588 INFO L290 TraceCheckUtils]: 0: Hoare triple {451#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); {451#true} is VALID [2022-02-20 14:05:23,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {451#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem2#1, main_#t~post1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {453#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:05:23,589 INFO L290 TraceCheckUtils]: 2: Hoare triple {453#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {454#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:05:23,590 INFO L290 TraceCheckUtils]: 3: Hoare triple {454#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {455#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:05:23,591 INFO L290 TraceCheckUtils]: 4: Hoare triple {455#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {456#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:05:23,591 INFO L290 TraceCheckUtils]: 5: Hoare triple {456#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {457#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:05:23,592 INFO L290 TraceCheckUtils]: 6: Hoare triple {457#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !(main_~i~0#1 < 100000); {452#false} is VALID [2022-02-20 14:05:23,592 INFO L290 TraceCheckUtils]: 7: Hoare triple {452#false} main_~i~0#1 := 0; {452#false} is VALID [2022-02-20 14:05:23,592 INFO L290 TraceCheckUtils]: 8: Hoare triple {452#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {452#false} is VALID [2022-02-20 14:05:23,592 INFO L290 TraceCheckUtils]: 9: Hoare triple {452#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {452#false} is VALID [2022-02-20 14:05:23,592 INFO L290 TraceCheckUtils]: 10: Hoare triple {452#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {452#false} is VALID [2022-02-20 14:05:23,593 INFO L290 TraceCheckUtils]: 11: Hoare triple {452#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {452#false} is VALID [2022-02-20 14:05:23,593 INFO L290 TraceCheckUtils]: 12: Hoare triple {452#false} assume !(main_~i~0#1 < 100000); {452#false} is VALID [2022-02-20 14:05:23,593 INFO L290 TraceCheckUtils]: 13: Hoare triple {452#false} main_~i~0#1 := 0; {452#false} is VALID [2022-02-20 14:05:23,593 INFO L290 TraceCheckUtils]: 14: Hoare triple {452#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {452#false} is VALID [2022-02-20 14:05:23,593 INFO L290 TraceCheckUtils]: 15: Hoare triple {452#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {452#false} is VALID [2022-02-20 14:05:23,594 INFO L290 TraceCheckUtils]: 16: Hoare triple {452#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {452#false} is VALID [2022-02-20 14:05:23,594 INFO L290 TraceCheckUtils]: 17: Hoare triple {452#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {452#false} is VALID [2022-02-20 14:05:23,594 INFO L290 TraceCheckUtils]: 18: Hoare triple {452#false} assume !(main_~i~0#1 < 100000); {452#false} is VALID [2022-02-20 14:05:23,594 INFO L290 TraceCheckUtils]: 19: Hoare triple {452#false} main_~i~0#1 := 0; {452#false} is VALID [2022-02-20 14:05:23,594 INFO L290 TraceCheckUtils]: 20: Hoare triple {452#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {452#false} is VALID [2022-02-20 14:05:23,594 INFO L290 TraceCheckUtils]: 21: Hoare triple {452#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {452#false} is VALID [2022-02-20 14:05:23,595 INFO L290 TraceCheckUtils]: 22: Hoare triple {452#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {452#false} is VALID [2022-02-20 14:05:23,595 INFO L290 TraceCheckUtils]: 23: Hoare triple {452#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {452#false} is VALID [2022-02-20 14:05:23,595 INFO L290 TraceCheckUtils]: 24: Hoare triple {452#false} assume !(main_~i~0#1 < 100000); {452#false} is VALID [2022-02-20 14:05:23,595 INFO L290 TraceCheckUtils]: 25: Hoare triple {452#false} havoc main_~x~0#1;main_~x~0#1 := 0; {452#false} is VALID [2022-02-20 14:05:23,596 INFO L290 TraceCheckUtils]: 26: Hoare triple {452#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 46 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {452#false} is VALID [2022-02-20 14:05:23,596 INFO L290 TraceCheckUtils]: 27: Hoare triple {452#false} assume 0 == __VERIFIER_assert_~cond#1; {452#false} is VALID [2022-02-20 14:05:23,596 INFO L290 TraceCheckUtils]: 28: Hoare triple {452#false} assume !false; {452#false} is VALID [2022-02-20 14:05:23,596 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-02-20 14:05:23,596 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:05:23,597 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400234682] [2022-02-20 14:05:23,597 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400234682] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:05:23,598 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [83336635] [2022-02-20 14:05:23,599 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 14:05:23,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:05:23,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:05:23,600 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:05:23,614 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:05:23,666 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 14:05:23,666 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:05:23,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 14:05:23,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:05:23,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:05:23,804 INFO L290 TraceCheckUtils]: 0: Hoare triple {451#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); {451#true} is VALID [2022-02-20 14:05:23,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {451#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem2#1, main_#t~post1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {464#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:05:23,805 INFO L290 TraceCheckUtils]: 2: Hoare triple {464#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {454#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:05:23,806 INFO L290 TraceCheckUtils]: 3: Hoare triple {454#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {455#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:05:23,807 INFO L290 TraceCheckUtils]: 4: Hoare triple {455#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {456#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:05:23,807 INFO L290 TraceCheckUtils]: 5: Hoare triple {456#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {457#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:05:23,808 INFO L290 TraceCheckUtils]: 6: Hoare triple {457#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !(main_~i~0#1 < 100000); {452#false} is VALID [2022-02-20 14:05:23,808 INFO L290 TraceCheckUtils]: 7: Hoare triple {452#false} main_~i~0#1 := 0; {452#false} is VALID [2022-02-20 14:05:23,808 INFO L290 TraceCheckUtils]: 8: Hoare triple {452#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {452#false} is VALID [2022-02-20 14:05:23,808 INFO L290 TraceCheckUtils]: 9: Hoare triple {452#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {452#false} is VALID [2022-02-20 14:05:23,808 INFO L290 TraceCheckUtils]: 10: Hoare triple {452#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {452#false} is VALID [2022-02-20 14:05:23,809 INFO L290 TraceCheckUtils]: 11: Hoare triple {452#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {452#false} is VALID [2022-02-20 14:05:23,811 INFO L290 TraceCheckUtils]: 12: Hoare triple {452#false} assume !(main_~i~0#1 < 100000); {452#false} is VALID [2022-02-20 14:05:23,811 INFO L290 TraceCheckUtils]: 13: Hoare triple {452#false} main_~i~0#1 := 0; {452#false} is VALID [2022-02-20 14:05:23,811 INFO L290 TraceCheckUtils]: 14: Hoare triple {452#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {452#false} is VALID [2022-02-20 14:05:23,811 INFO L290 TraceCheckUtils]: 15: Hoare triple {452#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {452#false} is VALID [2022-02-20 14:05:23,812 INFO L290 TraceCheckUtils]: 16: Hoare triple {452#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {452#false} is VALID [2022-02-20 14:05:23,812 INFO L290 TraceCheckUtils]: 17: Hoare triple {452#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {452#false} is VALID [2022-02-20 14:05:23,813 INFO L290 TraceCheckUtils]: 18: Hoare triple {452#false} assume !(main_~i~0#1 < 100000); {452#false} is VALID [2022-02-20 14:05:23,813 INFO L290 TraceCheckUtils]: 19: Hoare triple {452#false} main_~i~0#1 := 0; {452#false} is VALID [2022-02-20 14:05:23,814 INFO L290 TraceCheckUtils]: 20: Hoare triple {452#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {452#false} is VALID [2022-02-20 14:05:23,815 INFO L290 TraceCheckUtils]: 21: Hoare triple {452#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {452#false} is VALID [2022-02-20 14:05:23,815 INFO L290 TraceCheckUtils]: 22: Hoare triple {452#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {452#false} is VALID [2022-02-20 14:05:23,825 INFO L290 TraceCheckUtils]: 23: Hoare triple {452#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {452#false} is VALID [2022-02-20 14:05:23,826 INFO L290 TraceCheckUtils]: 24: Hoare triple {452#false} assume !(main_~i~0#1 < 100000); {452#false} is VALID [2022-02-20 14:05:23,826 INFO L290 TraceCheckUtils]: 25: Hoare triple {452#false} havoc main_~x~0#1;main_~x~0#1 := 0; {452#false} is VALID [2022-02-20 14:05:23,826 INFO L290 TraceCheckUtils]: 26: Hoare triple {452#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 46 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {452#false} is VALID [2022-02-20 14:05:23,826 INFO L290 TraceCheckUtils]: 27: Hoare triple {452#false} assume 0 == __VERIFIER_assert_~cond#1; {452#false} is VALID [2022-02-20 14:05:23,831 INFO L290 TraceCheckUtils]: 28: Hoare triple {452#false} assume !false; {452#false} is VALID [2022-02-20 14:05:23,832 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-02-20 14:05:23,832 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:05:23,964 INFO L290 TraceCheckUtils]: 28: Hoare triple {452#false} assume !false; {452#false} is VALID [2022-02-20 14:05:23,965 INFO L290 TraceCheckUtils]: 27: Hoare triple {452#false} assume 0 == __VERIFIER_assert_~cond#1; {452#false} is VALID [2022-02-20 14:05:23,965 INFO L290 TraceCheckUtils]: 26: Hoare triple {452#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 46 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {452#false} is VALID [2022-02-20 14:05:23,965 INFO L290 TraceCheckUtils]: 25: Hoare triple {452#false} havoc main_~x~0#1;main_~x~0#1 := 0; {452#false} is VALID [2022-02-20 14:05:23,965 INFO L290 TraceCheckUtils]: 24: Hoare triple {452#false} assume !(main_~i~0#1 < 100000); {452#false} is VALID [2022-02-20 14:05:23,965 INFO L290 TraceCheckUtils]: 23: Hoare triple {452#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {452#false} is VALID [2022-02-20 14:05:23,965 INFO L290 TraceCheckUtils]: 22: Hoare triple {452#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {452#false} is VALID [2022-02-20 14:05:23,966 INFO L290 TraceCheckUtils]: 21: Hoare triple {452#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {452#false} is VALID [2022-02-20 14:05:23,966 INFO L290 TraceCheckUtils]: 20: Hoare triple {452#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {452#false} is VALID [2022-02-20 14:05:23,966 INFO L290 TraceCheckUtils]: 19: Hoare triple {452#false} main_~i~0#1 := 0; {452#false} is VALID [2022-02-20 14:05:23,966 INFO L290 TraceCheckUtils]: 18: Hoare triple {452#false} assume !(main_~i~0#1 < 100000); {452#false} is VALID [2022-02-20 14:05:23,966 INFO L290 TraceCheckUtils]: 17: Hoare triple {452#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {452#false} is VALID [2022-02-20 14:05:23,966 INFO L290 TraceCheckUtils]: 16: Hoare triple {452#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {452#false} is VALID [2022-02-20 14:05:23,967 INFO L290 TraceCheckUtils]: 15: Hoare triple {452#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {452#false} is VALID [2022-02-20 14:05:23,967 INFO L290 TraceCheckUtils]: 14: Hoare triple {452#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {452#false} is VALID [2022-02-20 14:05:23,967 INFO L290 TraceCheckUtils]: 13: Hoare triple {452#false} main_~i~0#1 := 0; {452#false} is VALID [2022-02-20 14:05:23,967 INFO L290 TraceCheckUtils]: 12: Hoare triple {452#false} assume !(main_~i~0#1 < 100000); {452#false} is VALID [2022-02-20 14:05:23,967 INFO L290 TraceCheckUtils]: 11: Hoare triple {452#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {452#false} is VALID [2022-02-20 14:05:23,967 INFO L290 TraceCheckUtils]: 10: Hoare triple {452#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {452#false} is VALID [2022-02-20 14:05:23,968 INFO L290 TraceCheckUtils]: 9: Hoare triple {452#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {452#false} is VALID [2022-02-20 14:05:23,968 INFO L290 TraceCheckUtils]: 8: Hoare triple {452#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {452#false} is VALID [2022-02-20 14:05:23,968 INFO L290 TraceCheckUtils]: 7: Hoare triple {452#false} main_~i~0#1 := 0; {452#false} is VALID [2022-02-20 14:05:23,968 INFO L290 TraceCheckUtils]: 6: Hoare triple {612#(< |ULTIMATE.start_main_~i~0#1| 100000)} assume !(main_~i~0#1 < 100000); {452#false} is VALID [2022-02-20 14:05:23,969 INFO L290 TraceCheckUtils]: 5: Hoare triple {616#(< |ULTIMATE.start_main_~i~0#1| 99999)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {612#(< |ULTIMATE.start_main_~i~0#1| 100000)} is VALID [2022-02-20 14:05:23,970 INFO L290 TraceCheckUtils]: 4: Hoare triple {620#(< |ULTIMATE.start_main_~i~0#1| 99998)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {616#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:05:23,970 INFO L290 TraceCheckUtils]: 3: Hoare triple {624#(< |ULTIMATE.start_main_~i~0#1| 99997)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {620#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:05:23,971 INFO L290 TraceCheckUtils]: 2: Hoare triple {628#(< |ULTIMATE.start_main_~i~0#1| 99996)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {624#(< |ULTIMATE.start_main_~i~0#1| 99997)} is VALID [2022-02-20 14:05:23,971 INFO L290 TraceCheckUtils]: 1: Hoare triple {451#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem2#1, main_#t~post1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {628#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-20 14:05:23,971 INFO L290 TraceCheckUtils]: 0: Hoare triple {451#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); {451#true} is VALID [2022-02-20 14:05:23,972 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-02-20 14:05:23,972 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [83336635] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:05:23,972 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:05:23,972 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-02-20 14:05:23,972 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910396595] [2022-02-20 14:05:23,973 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:05:23,973 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-02-20 14:05:23,973 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:05:23,974 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have 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:05:23,995 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:05:23,995 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 14:05:23,995 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:05:23,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 14:05:23,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-02-20 14:05:23,996 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have 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:05:24,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:05:24,273 INFO L93 Difference]: Finished difference Result 81 states and 112 transitions. [2022-02-20 14:05:24,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 14:05:24,273 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-02-20 14:05:24,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:05:24,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have 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:05:24,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 100 transitions. [2022-02-20 14:05:24,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have 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:05:24,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 100 transitions. [2022-02-20 14:05:24,277 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 100 transitions. [2022-02-20 14:05:24,345 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:05:24,346 INFO L225 Difference]: With dead ends: 81 [2022-02-20 14:05:24,346 INFO L226 Difference]: Without dead ends: 56 [2022-02-20 14:05:24,346 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-02-20 14:05:24,347 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:05:24,347 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:05:24,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-02-20 14:05:24,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-02-20 14:05:24,373 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:05:24,374 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 56 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 55 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:05:24,374 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 56 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 55 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:05:24,374 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 56 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 55 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:05:24,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:05:24,376 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2022-02-20 14:05:24,376 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2022-02-20 14:05:24,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:05:24,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:05:24,378 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 55 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) Second operand 56 states. [2022-02-20 14:05:24,379 INFO L87 Difference]: Start difference. First operand has 56 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 55 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) Second operand 56 states. [2022-02-20 14:05:24,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:05:24,383 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2022-02-20 14:05:24,383 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2022-02-20 14:05:24,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:05:24,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:05:24,388 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:05:24,389 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:05:24,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 55 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:05:24,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2022-02-20 14:05:24,390 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 29 [2022-02-20 14:05:24,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:05:24,391 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2022-02-20 14:05:24,391 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have 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:05:24,391 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2022-02-20 14:05:24,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-20 14:05:24,393 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:05:24,393 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:05:24,411 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-02-20 14:05:24,599 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:05:24,602 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:05:24,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:05:24,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1399826597, now seen corresponding path program 3 times [2022-02-20 14:05:24,602 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:05:24,602 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437055874] [2022-02-20 14:05:24,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:05:24,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:05:24,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:05:24,831 INFO L290 TraceCheckUtils]: 0: Hoare triple {989#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); {989#true} is VALID [2022-02-20 14:05:24,832 INFO L290 TraceCheckUtils]: 1: Hoare triple {989#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem2#1, main_#t~post1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {991#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:05:24,832 INFO L290 TraceCheckUtils]: 2: Hoare triple {991#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {992#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:05:24,833 INFO L290 TraceCheckUtils]: 3: Hoare triple {992#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {993#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:05:24,833 INFO L290 TraceCheckUtils]: 4: Hoare triple {993#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {994#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:05:24,834 INFO L290 TraceCheckUtils]: 5: Hoare triple {994#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {995#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:05:24,834 INFO L290 TraceCheckUtils]: 6: Hoare triple {995#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {996#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:05:24,844 INFO L290 TraceCheckUtils]: 7: Hoare triple {996#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {997#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:05:24,845 INFO L290 TraceCheckUtils]: 8: Hoare triple {997#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {998#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:05:24,846 INFO L290 TraceCheckUtils]: 9: Hoare triple {998#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {999#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:05:24,846 INFO L290 TraceCheckUtils]: 10: Hoare triple {999#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1000#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:05:24,847 INFO L290 TraceCheckUtils]: 11: Hoare triple {1000#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1001#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:05:24,847 INFO L290 TraceCheckUtils]: 12: Hoare triple {1001#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !(main_~i~0#1 < 100000); {990#false} is VALID [2022-02-20 14:05:24,847 INFO L290 TraceCheckUtils]: 13: Hoare triple {990#false} main_~i~0#1 := 0; {990#false} is VALID [2022-02-20 14:05:24,848 INFO L290 TraceCheckUtils]: 14: Hoare triple {990#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {990#false} is VALID [2022-02-20 14:05:24,848 INFO L290 TraceCheckUtils]: 15: Hoare triple {990#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {990#false} is VALID [2022-02-20 14:05:24,848 INFO L290 TraceCheckUtils]: 16: Hoare triple {990#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {990#false} is VALID [2022-02-20 14:05:24,848 INFO L290 TraceCheckUtils]: 17: Hoare triple {990#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {990#false} is VALID [2022-02-20 14:05:24,848 INFO L290 TraceCheckUtils]: 18: Hoare triple {990#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {990#false} is VALID [2022-02-20 14:05:24,848 INFO L290 TraceCheckUtils]: 19: Hoare triple {990#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {990#false} is VALID [2022-02-20 14:05:24,849 INFO L290 TraceCheckUtils]: 20: Hoare triple {990#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {990#false} is VALID [2022-02-20 14:05:24,849 INFO L290 TraceCheckUtils]: 21: Hoare triple {990#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {990#false} is VALID [2022-02-20 14:05:24,849 INFO L290 TraceCheckUtils]: 22: Hoare triple {990#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {990#false} is VALID [2022-02-20 14:05:24,849 INFO L290 TraceCheckUtils]: 23: Hoare triple {990#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {990#false} is VALID [2022-02-20 14:05:24,849 INFO L290 TraceCheckUtils]: 24: Hoare triple {990#false} assume !(main_~i~0#1 < 100000); {990#false} is VALID [2022-02-20 14:05:24,850 INFO L290 TraceCheckUtils]: 25: Hoare triple {990#false} main_~i~0#1 := 0; {990#false} is VALID [2022-02-20 14:05:24,850 INFO L290 TraceCheckUtils]: 26: Hoare triple {990#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {990#false} is VALID [2022-02-20 14:05:24,851 INFO L290 TraceCheckUtils]: 27: Hoare triple {990#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {990#false} is VALID [2022-02-20 14:05:24,851 INFO L290 TraceCheckUtils]: 28: Hoare triple {990#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {990#false} is VALID [2022-02-20 14:05:24,852 INFO L290 TraceCheckUtils]: 29: Hoare triple {990#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {990#false} is VALID [2022-02-20 14:05:24,852 INFO L290 TraceCheckUtils]: 30: Hoare triple {990#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {990#false} is VALID [2022-02-20 14:05:24,852 INFO L290 TraceCheckUtils]: 31: Hoare triple {990#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {990#false} is VALID [2022-02-20 14:05:24,852 INFO L290 TraceCheckUtils]: 32: Hoare triple {990#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {990#false} is VALID [2022-02-20 14:05:24,852 INFO L290 TraceCheckUtils]: 33: Hoare triple {990#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {990#false} is VALID [2022-02-20 14:05:24,852 INFO L290 TraceCheckUtils]: 34: Hoare triple {990#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {990#false} is VALID [2022-02-20 14:05:24,853 INFO L290 TraceCheckUtils]: 35: Hoare triple {990#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {990#false} is VALID [2022-02-20 14:05:24,853 INFO L290 TraceCheckUtils]: 36: Hoare triple {990#false} assume !(main_~i~0#1 < 100000); {990#false} is VALID [2022-02-20 14:05:24,853 INFO L290 TraceCheckUtils]: 37: Hoare triple {990#false} main_~i~0#1 := 0; {990#false} is VALID [2022-02-20 14:05:24,853 INFO L290 TraceCheckUtils]: 38: Hoare triple {990#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {990#false} is VALID [2022-02-20 14:05:24,853 INFO L290 TraceCheckUtils]: 39: Hoare triple {990#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {990#false} is VALID [2022-02-20 14:05:24,853 INFO L290 TraceCheckUtils]: 40: Hoare triple {990#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {990#false} is VALID [2022-02-20 14:05:24,854 INFO L290 TraceCheckUtils]: 41: Hoare triple {990#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {990#false} is VALID [2022-02-20 14:05:24,854 INFO L290 TraceCheckUtils]: 42: Hoare triple {990#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {990#false} is VALID [2022-02-20 14:05:24,854 INFO L290 TraceCheckUtils]: 43: Hoare triple {990#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {990#false} is VALID [2022-02-20 14:05:24,854 INFO L290 TraceCheckUtils]: 44: Hoare triple {990#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {990#false} is VALID [2022-02-20 14:05:24,860 INFO L290 TraceCheckUtils]: 45: Hoare triple {990#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {990#false} is VALID [2022-02-20 14:05:24,860 INFO L290 TraceCheckUtils]: 46: Hoare triple {990#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {990#false} is VALID [2022-02-20 14:05:24,860 INFO L290 TraceCheckUtils]: 47: Hoare triple {990#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {990#false} is VALID [2022-02-20 14:05:24,860 INFO L290 TraceCheckUtils]: 48: Hoare triple {990#false} assume !(main_~i~0#1 < 100000); {990#false} is VALID [2022-02-20 14:05:24,861 INFO L290 TraceCheckUtils]: 49: Hoare triple {990#false} havoc main_~x~0#1;main_~x~0#1 := 0; {990#false} is VALID [2022-02-20 14:05:24,861 INFO L290 TraceCheckUtils]: 50: Hoare triple {990#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 46 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {990#false} is VALID [2022-02-20 14:05:24,861 INFO L290 TraceCheckUtils]: 51: Hoare triple {990#false} assume 0 == __VERIFIER_assert_~cond#1; {990#false} is VALID [2022-02-20 14:05:24,864 INFO L290 TraceCheckUtils]: 52: Hoare triple {990#false} assume !false; {990#false} is VALID [2022-02-20 14:05:24,865 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2022-02-20 14:05:24,865 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:05:24,865 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437055874] [2022-02-20 14:05:24,865 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437055874] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:05:24,867 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936172273] [2022-02-20 14:05:24,867 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 14:05:24,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:05:24,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:05:24,869 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:05:24,876 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:05:26,175 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-02-20 14:05:26,175 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:05:26,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 15 conjunts are in the unsatisfiable core [2022-02-20 14:05:26,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:05:26,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:05:26,384 INFO L290 TraceCheckUtils]: 0: Hoare triple {989#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); {989#true} is VALID [2022-02-20 14:05:26,385 INFO L290 TraceCheckUtils]: 1: Hoare triple {989#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem2#1, main_#t~post1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {989#true} is VALID [2022-02-20 14:05:26,385 INFO L290 TraceCheckUtils]: 2: Hoare triple {989#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {989#true} is VALID [2022-02-20 14:05:26,385 INFO L290 TraceCheckUtils]: 3: Hoare triple {989#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {989#true} is VALID [2022-02-20 14:05:26,385 INFO L290 TraceCheckUtils]: 4: Hoare triple {989#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {989#true} is VALID [2022-02-20 14:05:26,385 INFO L290 TraceCheckUtils]: 5: Hoare triple {989#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {989#true} is VALID [2022-02-20 14:05:26,385 INFO L290 TraceCheckUtils]: 6: Hoare triple {989#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {989#true} is VALID [2022-02-20 14:05:26,386 INFO L290 TraceCheckUtils]: 7: Hoare triple {989#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {989#true} is VALID [2022-02-20 14:05:26,386 INFO L290 TraceCheckUtils]: 8: Hoare triple {989#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {989#true} is VALID [2022-02-20 14:05:26,386 INFO L290 TraceCheckUtils]: 9: Hoare triple {989#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {989#true} is VALID [2022-02-20 14:05:26,386 INFO L290 TraceCheckUtils]: 10: Hoare triple {989#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {989#true} is VALID [2022-02-20 14:05:26,386 INFO L290 TraceCheckUtils]: 11: Hoare triple {989#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {989#true} is VALID [2022-02-20 14:05:26,386 INFO L290 TraceCheckUtils]: 12: Hoare triple {989#true} assume !(main_~i~0#1 < 100000); {989#true} is VALID [2022-02-20 14:05:26,387 INFO L290 TraceCheckUtils]: 13: Hoare triple {989#true} main_~i~0#1 := 0; {1044#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:05:26,387 INFO L290 TraceCheckUtils]: 14: Hoare triple {1044#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {992#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:05:26,388 INFO L290 TraceCheckUtils]: 15: Hoare triple {992#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {993#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:05:26,388 INFO L290 TraceCheckUtils]: 16: Hoare triple {993#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {994#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:05:26,389 INFO L290 TraceCheckUtils]: 17: Hoare triple {994#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {995#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:05:26,389 INFO L290 TraceCheckUtils]: 18: Hoare triple {995#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {996#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:05:26,390 INFO L290 TraceCheckUtils]: 19: Hoare triple {996#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {997#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:05:26,391 INFO L290 TraceCheckUtils]: 20: Hoare triple {997#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {998#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:05:26,391 INFO L290 TraceCheckUtils]: 21: Hoare triple {998#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {999#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:05:26,392 INFO L290 TraceCheckUtils]: 22: Hoare triple {999#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1000#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:05:26,393 INFO L290 TraceCheckUtils]: 23: Hoare triple {1000#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1001#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:05:26,393 INFO L290 TraceCheckUtils]: 24: Hoare triple {1001#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !(main_~i~0#1 < 100000); {990#false} is VALID [2022-02-20 14:05:26,393 INFO L290 TraceCheckUtils]: 25: Hoare triple {990#false} main_~i~0#1 := 0; {990#false} is VALID [2022-02-20 14:05:26,393 INFO L290 TraceCheckUtils]: 26: Hoare triple {990#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {990#false} is VALID [2022-02-20 14:05:26,393 INFO L290 TraceCheckUtils]: 27: Hoare triple {990#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {990#false} is VALID [2022-02-20 14:05:26,393 INFO L290 TraceCheckUtils]: 28: Hoare triple {990#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {990#false} is VALID [2022-02-20 14:05:26,393 INFO L290 TraceCheckUtils]: 29: Hoare triple {990#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {990#false} is VALID [2022-02-20 14:05:26,393 INFO L290 TraceCheckUtils]: 30: Hoare triple {990#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {990#false} is VALID [2022-02-20 14:05:26,394 INFO L290 TraceCheckUtils]: 31: Hoare triple {990#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {990#false} is VALID [2022-02-20 14:05:26,394 INFO L290 TraceCheckUtils]: 32: Hoare triple {990#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {990#false} is VALID [2022-02-20 14:05:26,394 INFO L290 TraceCheckUtils]: 33: Hoare triple {990#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {990#false} is VALID [2022-02-20 14:05:26,394 INFO L290 TraceCheckUtils]: 34: Hoare triple {990#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {990#false} is VALID [2022-02-20 14:05:26,394 INFO L290 TraceCheckUtils]: 35: Hoare triple {990#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {990#false} is VALID [2022-02-20 14:05:26,394 INFO L290 TraceCheckUtils]: 36: Hoare triple {990#false} assume !(main_~i~0#1 < 100000); {990#false} is VALID [2022-02-20 14:05:26,394 INFO L290 TraceCheckUtils]: 37: Hoare triple {990#false} main_~i~0#1 := 0; {990#false} is VALID [2022-02-20 14:05:26,394 INFO L290 TraceCheckUtils]: 38: Hoare triple {990#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {990#false} is VALID [2022-02-20 14:05:26,395 INFO L290 TraceCheckUtils]: 39: Hoare triple {990#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {990#false} is VALID [2022-02-20 14:05:26,395 INFO L290 TraceCheckUtils]: 40: Hoare triple {990#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {990#false} is VALID [2022-02-20 14:05:26,395 INFO L290 TraceCheckUtils]: 41: Hoare triple {990#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {990#false} is VALID [2022-02-20 14:05:26,395 INFO L290 TraceCheckUtils]: 42: Hoare triple {990#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {990#false} is VALID [2022-02-20 14:05:26,395 INFO L290 TraceCheckUtils]: 43: Hoare triple {990#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {990#false} is VALID [2022-02-20 14:05:26,395 INFO L290 TraceCheckUtils]: 44: Hoare triple {990#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {990#false} is VALID [2022-02-20 14:05:26,395 INFO L290 TraceCheckUtils]: 45: Hoare triple {990#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {990#false} is VALID [2022-02-20 14:05:26,396 INFO L290 TraceCheckUtils]: 46: Hoare triple {990#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {990#false} is VALID [2022-02-20 14:05:26,396 INFO L290 TraceCheckUtils]: 47: Hoare triple {990#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {990#false} is VALID [2022-02-20 14:05:26,396 INFO L290 TraceCheckUtils]: 48: Hoare triple {990#false} assume !(main_~i~0#1 < 100000); {990#false} is VALID [2022-02-20 14:05:26,396 INFO L290 TraceCheckUtils]: 49: Hoare triple {990#false} havoc main_~x~0#1;main_~x~0#1 := 0; {990#false} is VALID [2022-02-20 14:05:26,396 INFO L290 TraceCheckUtils]: 50: Hoare triple {990#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 46 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {990#false} is VALID [2022-02-20 14:05:26,396 INFO L290 TraceCheckUtils]: 51: Hoare triple {990#false} assume 0 == __VERIFIER_assert_~cond#1; {990#false} is VALID [2022-02-20 14:05:26,396 INFO L290 TraceCheckUtils]: 52: Hoare triple {990#false} assume !false; {990#false} is VALID [2022-02-20 14:05:26,397 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2022-02-20 14:05:26,397 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:05:26,796 INFO L290 TraceCheckUtils]: 52: Hoare triple {990#false} assume !false; {990#false} is VALID [2022-02-20 14:05:26,796 INFO L290 TraceCheckUtils]: 51: Hoare triple {990#false} assume 0 == __VERIFIER_assert_~cond#1; {990#false} is VALID [2022-02-20 14:05:26,796 INFO L290 TraceCheckUtils]: 50: Hoare triple {990#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 46 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {990#false} is VALID [2022-02-20 14:05:26,796 INFO L290 TraceCheckUtils]: 49: Hoare triple {990#false} havoc main_~x~0#1;main_~x~0#1 := 0; {990#false} is VALID [2022-02-20 14:05:26,796 INFO L290 TraceCheckUtils]: 48: Hoare triple {990#false} assume !(main_~i~0#1 < 100000); {990#false} is VALID [2022-02-20 14:05:26,796 INFO L290 TraceCheckUtils]: 47: Hoare triple {990#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {990#false} is VALID [2022-02-20 14:05:26,796 INFO L290 TraceCheckUtils]: 46: Hoare triple {990#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {990#false} is VALID [2022-02-20 14:05:26,796 INFO L290 TraceCheckUtils]: 45: Hoare triple {990#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {990#false} is VALID [2022-02-20 14:05:26,796 INFO L290 TraceCheckUtils]: 44: Hoare triple {990#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {990#false} is VALID [2022-02-20 14:05:26,797 INFO L290 TraceCheckUtils]: 43: Hoare triple {990#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {990#false} is VALID [2022-02-20 14:05:26,797 INFO L290 TraceCheckUtils]: 42: Hoare triple {990#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {990#false} is VALID [2022-02-20 14:05:26,797 INFO L290 TraceCheckUtils]: 41: Hoare triple {990#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {990#false} is VALID [2022-02-20 14:05:26,797 INFO L290 TraceCheckUtils]: 40: Hoare triple {990#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {990#false} is VALID [2022-02-20 14:05:26,797 INFO L290 TraceCheckUtils]: 39: Hoare triple {990#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {990#false} is VALID [2022-02-20 14:05:26,797 INFO L290 TraceCheckUtils]: 38: Hoare triple {990#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {990#false} is VALID [2022-02-20 14:05:26,797 INFO L290 TraceCheckUtils]: 37: Hoare triple {990#false} main_~i~0#1 := 0; {990#false} is VALID [2022-02-20 14:05:26,797 INFO L290 TraceCheckUtils]: 36: Hoare triple {1210#(< |ULTIMATE.start_main_~i~0#1| 100000)} assume !(main_~i~0#1 < 100000); {990#false} is VALID [2022-02-20 14:05:26,797 INFO L290 TraceCheckUtils]: 35: Hoare triple {990#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1210#(< |ULTIMATE.start_main_~i~0#1| 100000)} is VALID [2022-02-20 14:05:26,797 INFO L290 TraceCheckUtils]: 34: Hoare triple {990#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {990#false} is VALID [2022-02-20 14:05:26,798 INFO L290 TraceCheckUtils]: 33: Hoare triple {990#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {990#false} is VALID [2022-02-20 14:05:26,798 INFO L290 TraceCheckUtils]: 32: Hoare triple {990#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {990#false} is VALID [2022-02-20 14:05:26,798 INFO L290 TraceCheckUtils]: 31: Hoare triple {990#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {990#false} is VALID [2022-02-20 14:05:26,798 INFO L290 TraceCheckUtils]: 30: Hoare triple {990#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {990#false} is VALID [2022-02-20 14:05:26,798 INFO L290 TraceCheckUtils]: 29: Hoare triple {990#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {990#false} is VALID [2022-02-20 14:05:26,798 INFO L290 TraceCheckUtils]: 28: Hoare triple {990#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {990#false} is VALID [2022-02-20 14:05:26,798 INFO L290 TraceCheckUtils]: 27: Hoare triple {990#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {990#false} is VALID [2022-02-20 14:05:26,798 INFO L290 TraceCheckUtils]: 26: Hoare triple {990#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {990#false} is VALID [2022-02-20 14:05:26,798 INFO L290 TraceCheckUtils]: 25: Hoare triple {990#false} main_~i~0#1 := 0; {990#false} is VALID [2022-02-20 14:05:26,798 INFO L290 TraceCheckUtils]: 24: Hoare triple {1210#(< |ULTIMATE.start_main_~i~0#1| 100000)} assume !(main_~i~0#1 < 100000); {990#false} is VALID [2022-02-20 14:05:26,799 INFO L290 TraceCheckUtils]: 23: Hoare triple {1250#(< |ULTIMATE.start_main_~i~0#1| 99999)} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1210#(< |ULTIMATE.start_main_~i~0#1| 100000)} is VALID [2022-02-20 14:05:26,799 INFO L290 TraceCheckUtils]: 22: Hoare triple {1254#(< |ULTIMATE.start_main_~i~0#1| 99998)} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1250#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:05:26,800 INFO L290 TraceCheckUtils]: 21: Hoare triple {1258#(< |ULTIMATE.start_main_~i~0#1| 99997)} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1254#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:05:26,800 INFO L290 TraceCheckUtils]: 20: Hoare triple {1262#(< |ULTIMATE.start_main_~i~0#1| 99996)} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1258#(< |ULTIMATE.start_main_~i~0#1| 99997)} is VALID [2022-02-20 14:05:26,801 INFO L290 TraceCheckUtils]: 19: Hoare triple {1266#(< |ULTIMATE.start_main_~i~0#1| 99995)} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1262#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-20 14:05:26,801 INFO L290 TraceCheckUtils]: 18: Hoare triple {1270#(< |ULTIMATE.start_main_~i~0#1| 99994)} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1266#(< |ULTIMATE.start_main_~i~0#1| 99995)} is VALID [2022-02-20 14:05:26,802 INFO L290 TraceCheckUtils]: 17: Hoare triple {1274#(< |ULTIMATE.start_main_~i~0#1| 99993)} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1270#(< |ULTIMATE.start_main_~i~0#1| 99994)} is VALID [2022-02-20 14:05:26,802 INFO L290 TraceCheckUtils]: 16: Hoare triple {1278#(< |ULTIMATE.start_main_~i~0#1| 99992)} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1274#(< |ULTIMATE.start_main_~i~0#1| 99993)} is VALID [2022-02-20 14:05:26,803 INFO L290 TraceCheckUtils]: 15: Hoare triple {1282#(< |ULTIMATE.start_main_~i~0#1| 99991)} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1278#(< |ULTIMATE.start_main_~i~0#1| 99992)} is VALID [2022-02-20 14:05:26,803 INFO L290 TraceCheckUtils]: 14: Hoare triple {1286#(< |ULTIMATE.start_main_~i~0#1| 99990)} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1282#(< |ULTIMATE.start_main_~i~0#1| 99991)} is VALID [2022-02-20 14:05:26,804 INFO L290 TraceCheckUtils]: 13: Hoare triple {989#true} main_~i~0#1 := 0; {1286#(< |ULTIMATE.start_main_~i~0#1| 99990)} is VALID [2022-02-20 14:05:26,804 INFO L290 TraceCheckUtils]: 12: Hoare triple {989#true} assume !(main_~i~0#1 < 100000); {989#true} is VALID [2022-02-20 14:05:26,804 INFO L290 TraceCheckUtils]: 11: Hoare triple {989#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {989#true} is VALID [2022-02-20 14:05:26,804 INFO L290 TraceCheckUtils]: 10: Hoare triple {989#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {989#true} is VALID [2022-02-20 14:05:26,804 INFO L290 TraceCheckUtils]: 9: Hoare triple {989#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {989#true} is VALID [2022-02-20 14:05:26,804 INFO L290 TraceCheckUtils]: 8: Hoare triple {989#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {989#true} is VALID [2022-02-20 14:05:26,804 INFO L290 TraceCheckUtils]: 7: Hoare triple {989#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {989#true} is VALID [2022-02-20 14:05:26,804 INFO L290 TraceCheckUtils]: 6: Hoare triple {989#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {989#true} is VALID [2022-02-20 14:05:26,804 INFO L290 TraceCheckUtils]: 5: Hoare triple {989#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {989#true} is VALID [2022-02-20 14:05:26,804 INFO L290 TraceCheckUtils]: 4: Hoare triple {989#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {989#true} is VALID [2022-02-20 14:05:26,804 INFO L290 TraceCheckUtils]: 3: Hoare triple {989#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {989#true} is VALID [2022-02-20 14:05:26,804 INFO L290 TraceCheckUtils]: 2: Hoare triple {989#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {989#true} is VALID [2022-02-20 14:05:26,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {989#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem2#1, main_#t~post1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {989#true} is VALID [2022-02-20 14:05:26,805 INFO L290 TraceCheckUtils]: 0: Hoare triple {989#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); {989#true} is VALID [2022-02-20 14:05:26,805 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2022-02-20 14:05:26,805 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1936172273] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:05:26,805 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:05:26,805 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2022-02-20 14:05:26,805 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924466371] [2022-02-20 14:05:26,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:05:26,806 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-02-20 14:05:26,806 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:05:26,806 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:26,839 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:05:26,839 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-02-20 14:05:26,839 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:05:26,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-02-20 14:05:26,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2022-02-20 14:05:26,840 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand has 25 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:27,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:05:27,283 INFO L93 Difference]: Finished difference Result 147 states and 202 transitions. [2022-02-20 14:05:27,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-02-20 14:05:27,283 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-02-20 14:05:27,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:05:27,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:27,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 172 transitions. [2022-02-20 14:05:27,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:27,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 172 transitions. [2022-02-20 14:05:27,288 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 172 transitions. [2022-02-20 14:05:27,403 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:05:27,405 INFO L225 Difference]: With dead ends: 147 [2022-02-20 14:05:27,405 INFO L226 Difference]: Without dead ends: 104 [2022-02-20 14:05:27,406 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2022-02-20 14:05:27,406 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 14:05:27,406 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 14:05:27,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-02-20 14:05:27,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2022-02-20 14:05:27,463 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:05:27,464 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand has 104 states, 103 states have (on average 1.0485436893203883) internal successors, (108), 103 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have 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:05:27,464 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand has 104 states, 103 states have (on average 1.0485436893203883) internal successors, (108), 103 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have 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:05:27,464 INFO L87 Difference]: Start difference. First operand 104 states. Second operand has 104 states, 103 states have (on average 1.0485436893203883) internal successors, (108), 103 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have 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:05:27,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:05:27,466 INFO L93 Difference]: Finished difference Result 104 states and 108 transitions. [2022-02-20 14:05:27,466 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 108 transitions. [2022-02-20 14:05:27,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:05:27,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:05:27,467 INFO L74 IsIncluded]: Start isIncluded. First operand has 104 states, 103 states have (on average 1.0485436893203883) internal successors, (108), 103 states have internal predecessors, (108), 0 states have call successors, (0), 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 104 states. [2022-02-20 14:05:27,467 INFO L87 Difference]: Start difference. First operand has 104 states, 103 states have (on average 1.0485436893203883) internal successors, (108), 103 states have internal predecessors, (108), 0 states have call successors, (0), 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 104 states. [2022-02-20 14:05:27,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:05:27,469 INFO L93 Difference]: Finished difference Result 104 states and 108 transitions. [2022-02-20 14:05:27,469 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 108 transitions. [2022-02-20 14:05:27,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:05:27,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:05:27,470 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:05:27,470 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:05:27,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.0485436893203883) internal successors, (108), 103 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have 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:05:27,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 108 transitions. [2022-02-20 14:05:27,472 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 108 transitions. Word has length 53 [2022-02-20 14:05:27,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:05:27,473 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 108 transitions. [2022-02-20 14:05:27,473 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:27,473 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 108 transitions. [2022-02-20 14:05:27,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-02-20 14:05:27,474 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:05:27,474 INFO L514 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:05:27,493 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:05:27,696 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:05:27,696 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:05:27,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:05:27,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1280824613, now seen corresponding path program 4 times [2022-02-20 14:05:27,697 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:05:27,697 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125411746] [2022-02-20 14:05:27,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:05:27,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:05:27,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:05:28,083 INFO L290 TraceCheckUtils]: 0: Hoare triple {2007#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); {2007#true} is VALID [2022-02-20 14:05:28,084 INFO L290 TraceCheckUtils]: 1: Hoare triple {2007#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem2#1, main_#t~post1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {2009#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:05:28,085 INFO L290 TraceCheckUtils]: 2: Hoare triple {2009#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2010#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:05:28,090 INFO L290 TraceCheckUtils]: 3: Hoare triple {2010#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2011#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:05:28,090 INFO L290 TraceCheckUtils]: 4: Hoare triple {2011#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2012#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:05:28,091 INFO L290 TraceCheckUtils]: 5: Hoare triple {2012#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2013#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:05:28,091 INFO L290 TraceCheckUtils]: 6: Hoare triple {2013#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2014#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:05:28,092 INFO L290 TraceCheckUtils]: 7: Hoare triple {2014#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2015#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:05:28,092 INFO L290 TraceCheckUtils]: 8: Hoare triple {2015#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2016#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:05:28,093 INFO L290 TraceCheckUtils]: 9: Hoare triple {2016#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2017#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:05:28,093 INFO L290 TraceCheckUtils]: 10: Hoare triple {2017#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2018#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:05:28,094 INFO L290 TraceCheckUtils]: 11: Hoare triple {2018#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2019#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:05:28,094 INFO L290 TraceCheckUtils]: 12: Hoare triple {2019#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2020#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-20 14:05:28,094 INFO L290 TraceCheckUtils]: 13: Hoare triple {2020#(<= |ULTIMATE.start_main_~i~0#1| 11)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2021#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 14:05:28,095 INFO L290 TraceCheckUtils]: 14: Hoare triple {2021#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2022#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-20 14:05:28,095 INFO L290 TraceCheckUtils]: 15: Hoare triple {2022#(<= |ULTIMATE.start_main_~i~0#1| 13)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2023#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 14:05:28,096 INFO L290 TraceCheckUtils]: 16: Hoare triple {2023#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2024#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-20 14:05:28,096 INFO L290 TraceCheckUtils]: 17: Hoare triple {2024#(<= |ULTIMATE.start_main_~i~0#1| 15)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2025#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 14:05:28,097 INFO L290 TraceCheckUtils]: 18: Hoare triple {2025#(<= |ULTIMATE.start_main_~i~0#1| 16)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2026#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-20 14:05:28,097 INFO L290 TraceCheckUtils]: 19: Hoare triple {2026#(<= |ULTIMATE.start_main_~i~0#1| 17)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2027#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 14:05:28,098 INFO L290 TraceCheckUtils]: 20: Hoare triple {2027#(<= |ULTIMATE.start_main_~i~0#1| 18)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2028#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-20 14:05:28,098 INFO L290 TraceCheckUtils]: 21: Hoare triple {2028#(<= |ULTIMATE.start_main_~i~0#1| 19)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2029#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 14:05:28,099 INFO L290 TraceCheckUtils]: 22: Hoare triple {2029#(<= |ULTIMATE.start_main_~i~0#1| 20)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2030#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-20 14:05:28,099 INFO L290 TraceCheckUtils]: 23: Hoare triple {2030#(<= |ULTIMATE.start_main_~i~0#1| 21)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2031#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-20 14:05:28,099 INFO L290 TraceCheckUtils]: 24: Hoare triple {2031#(<= |ULTIMATE.start_main_~i~0#1| 22)} assume !(main_~i~0#1 < 100000); {2008#false} is VALID [2022-02-20 14:05:28,099 INFO L290 TraceCheckUtils]: 25: Hoare triple {2008#false} main_~i~0#1 := 0; {2008#false} is VALID [2022-02-20 14:05:28,100 INFO L290 TraceCheckUtils]: 26: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,100 INFO L290 TraceCheckUtils]: 27: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,100 INFO L290 TraceCheckUtils]: 28: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,100 INFO L290 TraceCheckUtils]: 29: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,100 INFO L290 TraceCheckUtils]: 30: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,100 INFO L290 TraceCheckUtils]: 31: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,104 INFO L290 TraceCheckUtils]: 32: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,105 INFO L290 TraceCheckUtils]: 33: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,105 INFO L290 TraceCheckUtils]: 34: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,105 INFO L290 TraceCheckUtils]: 35: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,105 INFO L290 TraceCheckUtils]: 36: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,105 INFO L290 TraceCheckUtils]: 37: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,105 INFO L290 TraceCheckUtils]: 38: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,105 INFO L290 TraceCheckUtils]: 39: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,105 INFO L290 TraceCheckUtils]: 40: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,105 INFO L290 TraceCheckUtils]: 41: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,105 INFO L290 TraceCheckUtils]: 42: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,105 INFO L290 TraceCheckUtils]: 43: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,105 INFO L290 TraceCheckUtils]: 44: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,105 INFO L290 TraceCheckUtils]: 45: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,106 INFO L290 TraceCheckUtils]: 46: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,106 INFO L290 TraceCheckUtils]: 47: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,116 INFO L290 TraceCheckUtils]: 48: Hoare triple {2008#false} assume !(main_~i~0#1 < 100000); {2008#false} is VALID [2022-02-20 14:05:28,116 INFO L290 TraceCheckUtils]: 49: Hoare triple {2008#false} main_~i~0#1 := 0; {2008#false} is VALID [2022-02-20 14:05:28,116 INFO L290 TraceCheckUtils]: 50: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,116 INFO L290 TraceCheckUtils]: 51: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,116 INFO L290 TraceCheckUtils]: 52: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,116 INFO L290 TraceCheckUtils]: 53: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,116 INFO L290 TraceCheckUtils]: 54: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,116 INFO L290 TraceCheckUtils]: 55: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,116 INFO L290 TraceCheckUtils]: 56: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,117 INFO L290 TraceCheckUtils]: 57: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,117 INFO L290 TraceCheckUtils]: 58: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,117 INFO L290 TraceCheckUtils]: 59: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,117 INFO L290 TraceCheckUtils]: 60: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,117 INFO L290 TraceCheckUtils]: 61: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,117 INFO L290 TraceCheckUtils]: 62: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,117 INFO L290 TraceCheckUtils]: 63: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,117 INFO L290 TraceCheckUtils]: 64: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,117 INFO L290 TraceCheckUtils]: 65: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,117 INFO L290 TraceCheckUtils]: 66: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,117 INFO L290 TraceCheckUtils]: 67: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,117 INFO L290 TraceCheckUtils]: 68: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,117 INFO L290 TraceCheckUtils]: 69: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,117 INFO L290 TraceCheckUtils]: 70: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,118 INFO L290 TraceCheckUtils]: 71: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,118 INFO L290 TraceCheckUtils]: 72: Hoare triple {2008#false} assume !(main_~i~0#1 < 100000); {2008#false} is VALID [2022-02-20 14:05:28,118 INFO L290 TraceCheckUtils]: 73: Hoare triple {2008#false} main_~i~0#1 := 0; {2008#false} is VALID [2022-02-20 14:05:28,118 INFO L290 TraceCheckUtils]: 74: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,118 INFO L290 TraceCheckUtils]: 75: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,118 INFO L290 TraceCheckUtils]: 76: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,119 INFO L290 TraceCheckUtils]: 77: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,119 INFO L290 TraceCheckUtils]: 78: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,119 INFO L290 TraceCheckUtils]: 79: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,119 INFO L290 TraceCheckUtils]: 80: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,119 INFO L290 TraceCheckUtils]: 81: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,119 INFO L290 TraceCheckUtils]: 82: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,119 INFO L290 TraceCheckUtils]: 83: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,120 INFO L290 TraceCheckUtils]: 84: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,120 INFO L290 TraceCheckUtils]: 85: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,120 INFO L290 TraceCheckUtils]: 86: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,120 INFO L290 TraceCheckUtils]: 87: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,120 INFO L290 TraceCheckUtils]: 88: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,120 INFO L290 TraceCheckUtils]: 89: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,120 INFO L290 TraceCheckUtils]: 90: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,120 INFO L290 TraceCheckUtils]: 91: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,121 INFO L290 TraceCheckUtils]: 92: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,121 INFO L290 TraceCheckUtils]: 93: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,121 INFO L290 TraceCheckUtils]: 94: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,121 INFO L290 TraceCheckUtils]: 95: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,121 INFO L290 TraceCheckUtils]: 96: Hoare triple {2008#false} assume !(main_~i~0#1 < 100000); {2008#false} is VALID [2022-02-20 14:05:28,121 INFO L290 TraceCheckUtils]: 97: Hoare triple {2008#false} havoc main_~x~0#1;main_~x~0#1 := 0; {2008#false} is VALID [2022-02-20 14:05:28,121 INFO L290 TraceCheckUtils]: 98: Hoare triple {2008#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 46 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2008#false} is VALID [2022-02-20 14:05:28,122 INFO L290 TraceCheckUtils]: 99: Hoare triple {2008#false} assume 0 == __VERIFIER_assert_~cond#1; {2008#false} is VALID [2022-02-20 14:05:28,122 INFO L290 TraceCheckUtils]: 100: Hoare triple {2008#false} assume !false; {2008#false} is VALID [2022-02-20 14:05:28,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 759 trivial. 0 not checked. [2022-02-20 14:05:28,122 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:05:28,123 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125411746] [2022-02-20 14:05:28,123 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125411746] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:05:28,123 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1797383786] [2022-02-20 14:05:28,125 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-20 14:05:28,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:05:28,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:05:28,126 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:05:28,127 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:05:28,267 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-20 14:05:28,267 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:05:28,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 673 conjuncts, 24 conjunts are in the unsatisfiable core [2022-02-20 14:05:28,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:05:28,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:05:28,595 INFO L290 TraceCheckUtils]: 0: Hoare triple {2007#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); {2007#true} is VALID [2022-02-20 14:05:28,596 INFO L290 TraceCheckUtils]: 1: Hoare triple {2007#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem2#1, main_#t~post1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {2038#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:05:28,597 INFO L290 TraceCheckUtils]: 2: Hoare triple {2038#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2010#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:05:28,597 INFO L290 TraceCheckUtils]: 3: Hoare triple {2010#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2011#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:05:28,598 INFO L290 TraceCheckUtils]: 4: Hoare triple {2011#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2012#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:05:28,598 INFO L290 TraceCheckUtils]: 5: Hoare triple {2012#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2013#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:05:28,599 INFO L290 TraceCheckUtils]: 6: Hoare triple {2013#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2014#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:05:28,599 INFO L290 TraceCheckUtils]: 7: Hoare triple {2014#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2015#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:05:28,600 INFO L290 TraceCheckUtils]: 8: Hoare triple {2015#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2016#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:05:28,601 INFO L290 TraceCheckUtils]: 9: Hoare triple {2016#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2017#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:05:28,601 INFO L290 TraceCheckUtils]: 10: Hoare triple {2017#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2018#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:05:28,602 INFO L290 TraceCheckUtils]: 11: Hoare triple {2018#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2019#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:05:28,602 INFO L290 TraceCheckUtils]: 12: Hoare triple {2019#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2020#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-20 14:05:28,603 INFO L290 TraceCheckUtils]: 13: Hoare triple {2020#(<= |ULTIMATE.start_main_~i~0#1| 11)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2021#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 14:05:28,603 INFO L290 TraceCheckUtils]: 14: Hoare triple {2021#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2022#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-20 14:05:28,604 INFO L290 TraceCheckUtils]: 15: Hoare triple {2022#(<= |ULTIMATE.start_main_~i~0#1| 13)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2023#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 14:05:28,605 INFO L290 TraceCheckUtils]: 16: Hoare triple {2023#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2024#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-20 14:05:28,606 INFO L290 TraceCheckUtils]: 17: Hoare triple {2024#(<= |ULTIMATE.start_main_~i~0#1| 15)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2025#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 14:05:28,606 INFO L290 TraceCheckUtils]: 18: Hoare triple {2025#(<= |ULTIMATE.start_main_~i~0#1| 16)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2026#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-20 14:05:28,607 INFO L290 TraceCheckUtils]: 19: Hoare triple {2026#(<= |ULTIMATE.start_main_~i~0#1| 17)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2027#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 14:05:28,607 INFO L290 TraceCheckUtils]: 20: Hoare triple {2027#(<= |ULTIMATE.start_main_~i~0#1| 18)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2028#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-20 14:05:28,608 INFO L290 TraceCheckUtils]: 21: Hoare triple {2028#(<= |ULTIMATE.start_main_~i~0#1| 19)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2029#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 14:05:28,608 INFO L290 TraceCheckUtils]: 22: Hoare triple {2029#(<= |ULTIMATE.start_main_~i~0#1| 20)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2030#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-20 14:05:28,609 INFO L290 TraceCheckUtils]: 23: Hoare triple {2030#(<= |ULTIMATE.start_main_~i~0#1| 21)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2031#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-20 14:05:28,609 INFO L290 TraceCheckUtils]: 24: Hoare triple {2031#(<= |ULTIMATE.start_main_~i~0#1| 22)} assume !(main_~i~0#1 < 100000); {2008#false} is VALID [2022-02-20 14:05:28,609 INFO L290 TraceCheckUtils]: 25: Hoare triple {2008#false} main_~i~0#1 := 0; {2008#false} is VALID [2022-02-20 14:05:28,610 INFO L290 TraceCheckUtils]: 26: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,610 INFO L290 TraceCheckUtils]: 27: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,610 INFO L290 TraceCheckUtils]: 28: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,610 INFO L290 TraceCheckUtils]: 29: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,610 INFO L290 TraceCheckUtils]: 30: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,610 INFO L290 TraceCheckUtils]: 31: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,610 INFO L290 TraceCheckUtils]: 32: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,610 INFO L290 TraceCheckUtils]: 33: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,610 INFO L290 TraceCheckUtils]: 34: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,610 INFO L290 TraceCheckUtils]: 35: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,610 INFO L290 TraceCheckUtils]: 36: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,610 INFO L290 TraceCheckUtils]: 37: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,611 INFO L290 TraceCheckUtils]: 38: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,611 INFO L290 TraceCheckUtils]: 39: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,611 INFO L290 TraceCheckUtils]: 40: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,611 INFO L290 TraceCheckUtils]: 41: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,611 INFO L290 TraceCheckUtils]: 42: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,611 INFO L290 TraceCheckUtils]: 43: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,611 INFO L290 TraceCheckUtils]: 44: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,611 INFO L290 TraceCheckUtils]: 45: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,612 INFO L290 TraceCheckUtils]: 46: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,612 INFO L290 TraceCheckUtils]: 47: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,612 INFO L290 TraceCheckUtils]: 48: Hoare triple {2008#false} assume !(main_~i~0#1 < 100000); {2008#false} is VALID [2022-02-20 14:05:28,612 INFO L290 TraceCheckUtils]: 49: Hoare triple {2008#false} main_~i~0#1 := 0; {2008#false} is VALID [2022-02-20 14:05:28,612 INFO L290 TraceCheckUtils]: 50: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,612 INFO L290 TraceCheckUtils]: 51: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,612 INFO L290 TraceCheckUtils]: 52: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,613 INFO L290 TraceCheckUtils]: 53: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,613 INFO L290 TraceCheckUtils]: 54: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,613 INFO L290 TraceCheckUtils]: 55: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,613 INFO L290 TraceCheckUtils]: 56: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,613 INFO L290 TraceCheckUtils]: 57: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,613 INFO L290 TraceCheckUtils]: 58: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,613 INFO L290 TraceCheckUtils]: 59: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,613 INFO L290 TraceCheckUtils]: 60: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,614 INFO L290 TraceCheckUtils]: 61: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,614 INFO L290 TraceCheckUtils]: 62: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,614 INFO L290 TraceCheckUtils]: 63: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,614 INFO L290 TraceCheckUtils]: 64: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,614 INFO L290 TraceCheckUtils]: 65: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,614 INFO L290 TraceCheckUtils]: 66: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,614 INFO L290 TraceCheckUtils]: 67: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,615 INFO L290 TraceCheckUtils]: 68: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,615 INFO L290 TraceCheckUtils]: 69: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,615 INFO L290 TraceCheckUtils]: 70: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,615 INFO L290 TraceCheckUtils]: 71: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,615 INFO L290 TraceCheckUtils]: 72: Hoare triple {2008#false} assume !(main_~i~0#1 < 100000); {2008#false} is VALID [2022-02-20 14:05:28,615 INFO L290 TraceCheckUtils]: 73: Hoare triple {2008#false} main_~i~0#1 := 0; {2008#false} is VALID [2022-02-20 14:05:28,615 INFO L290 TraceCheckUtils]: 74: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,615 INFO L290 TraceCheckUtils]: 75: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,616 INFO L290 TraceCheckUtils]: 76: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,616 INFO L290 TraceCheckUtils]: 77: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,616 INFO L290 TraceCheckUtils]: 78: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,616 INFO L290 TraceCheckUtils]: 79: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,616 INFO L290 TraceCheckUtils]: 80: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,616 INFO L290 TraceCheckUtils]: 81: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,616 INFO L290 TraceCheckUtils]: 82: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,617 INFO L290 TraceCheckUtils]: 83: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,617 INFO L290 TraceCheckUtils]: 84: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,617 INFO L290 TraceCheckUtils]: 85: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,617 INFO L290 TraceCheckUtils]: 86: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,617 INFO L290 TraceCheckUtils]: 87: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,617 INFO L290 TraceCheckUtils]: 88: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,617 INFO L290 TraceCheckUtils]: 89: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,618 INFO L290 TraceCheckUtils]: 90: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,618 INFO L290 TraceCheckUtils]: 91: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,618 INFO L290 TraceCheckUtils]: 92: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,618 INFO L290 TraceCheckUtils]: 93: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,618 INFO L290 TraceCheckUtils]: 94: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,618 INFO L290 TraceCheckUtils]: 95: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:28,618 INFO L290 TraceCheckUtils]: 96: Hoare triple {2008#false} assume !(main_~i~0#1 < 100000); {2008#false} is VALID [2022-02-20 14:05:28,618 INFO L290 TraceCheckUtils]: 97: Hoare triple {2008#false} havoc main_~x~0#1;main_~x~0#1 := 0; {2008#false} is VALID [2022-02-20 14:05:28,619 INFO L290 TraceCheckUtils]: 98: Hoare triple {2008#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 46 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2008#false} is VALID [2022-02-20 14:05:28,619 INFO L290 TraceCheckUtils]: 99: Hoare triple {2008#false} assume 0 == __VERIFIER_assert_~cond#1; {2008#false} is VALID [2022-02-20 14:05:28,619 INFO L290 TraceCheckUtils]: 100: Hoare triple {2008#false} assume !false; {2008#false} is VALID [2022-02-20 14:05:28,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 759 trivial. 0 not checked. [2022-02-20 14:05:28,620 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:05:29,600 INFO L290 TraceCheckUtils]: 100: Hoare triple {2008#false} assume !false; {2008#false} is VALID [2022-02-20 14:05:29,601 INFO L290 TraceCheckUtils]: 99: Hoare triple {2008#false} assume 0 == __VERIFIER_assert_~cond#1; {2008#false} is VALID [2022-02-20 14:05:29,601 INFO L290 TraceCheckUtils]: 98: Hoare triple {2008#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 46 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2008#false} is VALID [2022-02-20 14:05:29,601 INFO L290 TraceCheckUtils]: 97: Hoare triple {2008#false} havoc main_~x~0#1;main_~x~0#1 := 0; {2008#false} is VALID [2022-02-20 14:05:29,601 INFO L290 TraceCheckUtils]: 96: Hoare triple {2008#false} assume !(main_~i~0#1 < 100000); {2008#false} is VALID [2022-02-20 14:05:29,601 INFO L290 TraceCheckUtils]: 95: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:29,602 INFO L290 TraceCheckUtils]: 94: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:29,602 INFO L290 TraceCheckUtils]: 93: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:29,602 INFO L290 TraceCheckUtils]: 92: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:29,602 INFO L290 TraceCheckUtils]: 91: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:29,602 INFO L290 TraceCheckUtils]: 90: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:29,602 INFO L290 TraceCheckUtils]: 89: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:29,602 INFO L290 TraceCheckUtils]: 88: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:29,602 INFO L290 TraceCheckUtils]: 87: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:29,603 INFO L290 TraceCheckUtils]: 86: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:29,603 INFO L290 TraceCheckUtils]: 85: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:29,603 INFO L290 TraceCheckUtils]: 84: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:29,603 INFO L290 TraceCheckUtils]: 83: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:29,603 INFO L290 TraceCheckUtils]: 82: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:29,603 INFO L290 TraceCheckUtils]: 81: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:29,603 INFO L290 TraceCheckUtils]: 80: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:29,604 INFO L290 TraceCheckUtils]: 79: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:29,604 INFO L290 TraceCheckUtils]: 78: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:29,604 INFO L290 TraceCheckUtils]: 77: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:29,604 INFO L290 TraceCheckUtils]: 76: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:29,604 INFO L290 TraceCheckUtils]: 75: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:29,604 INFO L290 TraceCheckUtils]: 74: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:29,604 INFO L290 TraceCheckUtils]: 73: Hoare triple {2008#false} main_~i~0#1 := 0; {2008#false} is VALID [2022-02-20 14:05:29,604 INFO L290 TraceCheckUtils]: 72: Hoare triple {2008#false} assume !(main_~i~0#1 < 100000); {2008#false} is VALID [2022-02-20 14:05:29,605 INFO L290 TraceCheckUtils]: 71: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:29,605 INFO L290 TraceCheckUtils]: 70: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:29,605 INFO L290 TraceCheckUtils]: 69: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:29,605 INFO L290 TraceCheckUtils]: 68: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:29,605 INFO L290 TraceCheckUtils]: 67: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:29,605 INFO L290 TraceCheckUtils]: 66: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:29,605 INFO L290 TraceCheckUtils]: 65: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:29,606 INFO L290 TraceCheckUtils]: 64: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:29,606 INFO L290 TraceCheckUtils]: 63: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:29,606 INFO L290 TraceCheckUtils]: 62: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:29,606 INFO L290 TraceCheckUtils]: 61: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:29,606 INFO L290 TraceCheckUtils]: 60: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:29,606 INFO L290 TraceCheckUtils]: 59: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:29,606 INFO L290 TraceCheckUtils]: 58: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:29,606 INFO L290 TraceCheckUtils]: 57: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:29,607 INFO L290 TraceCheckUtils]: 56: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:29,607 INFO L290 TraceCheckUtils]: 55: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:29,607 INFO L290 TraceCheckUtils]: 54: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:29,607 INFO L290 TraceCheckUtils]: 53: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:29,607 INFO L290 TraceCheckUtils]: 52: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:29,607 INFO L290 TraceCheckUtils]: 51: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:29,607 INFO L290 TraceCheckUtils]: 50: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:29,607 INFO L290 TraceCheckUtils]: 49: Hoare triple {2008#false} main_~i~0#1 := 0; {2008#false} is VALID [2022-02-20 14:05:29,608 INFO L290 TraceCheckUtils]: 48: Hoare triple {2008#false} assume !(main_~i~0#1 < 100000); {2008#false} is VALID [2022-02-20 14:05:29,608 INFO L290 TraceCheckUtils]: 47: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:29,608 INFO L290 TraceCheckUtils]: 46: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:29,608 INFO L290 TraceCheckUtils]: 45: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:29,608 INFO L290 TraceCheckUtils]: 44: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:29,608 INFO L290 TraceCheckUtils]: 43: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:29,608 INFO L290 TraceCheckUtils]: 42: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:29,609 INFO L290 TraceCheckUtils]: 41: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:29,609 INFO L290 TraceCheckUtils]: 40: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:29,609 INFO L290 TraceCheckUtils]: 39: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:29,609 INFO L290 TraceCheckUtils]: 38: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:29,609 INFO L290 TraceCheckUtils]: 37: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:29,609 INFO L290 TraceCheckUtils]: 36: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:29,609 INFO L290 TraceCheckUtils]: 35: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:29,609 INFO L290 TraceCheckUtils]: 34: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:29,610 INFO L290 TraceCheckUtils]: 33: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:29,610 INFO L290 TraceCheckUtils]: 32: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:29,610 INFO L290 TraceCheckUtils]: 31: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:29,610 INFO L290 TraceCheckUtils]: 30: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:29,610 INFO L290 TraceCheckUtils]: 29: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:29,610 INFO L290 TraceCheckUtils]: 28: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:29,610 INFO L290 TraceCheckUtils]: 27: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:29,610 INFO L290 TraceCheckUtils]: 26: Hoare triple {2008#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2008#false} is VALID [2022-02-20 14:05:29,611 INFO L290 TraceCheckUtils]: 25: Hoare triple {2008#false} main_~i~0#1 := 0; {2008#false} is VALID [2022-02-20 14:05:29,611 INFO L290 TraceCheckUtils]: 24: Hoare triple {2564#(< |ULTIMATE.start_main_~i~0#1| 100000)} assume !(main_~i~0#1 < 100000); {2008#false} is VALID [2022-02-20 14:05:29,612 INFO L290 TraceCheckUtils]: 23: Hoare triple {2568#(< |ULTIMATE.start_main_~i~0#1| 99999)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2564#(< |ULTIMATE.start_main_~i~0#1| 100000)} is VALID [2022-02-20 14:05:29,612 INFO L290 TraceCheckUtils]: 22: Hoare triple {2572#(< |ULTIMATE.start_main_~i~0#1| 99998)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2568#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:05:29,613 INFO L290 TraceCheckUtils]: 21: Hoare triple {2576#(< |ULTIMATE.start_main_~i~0#1| 99997)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2572#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:05:29,613 INFO L290 TraceCheckUtils]: 20: Hoare triple {2580#(< |ULTIMATE.start_main_~i~0#1| 99996)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2576#(< |ULTIMATE.start_main_~i~0#1| 99997)} is VALID [2022-02-20 14:05:29,614 INFO L290 TraceCheckUtils]: 19: Hoare triple {2584#(< |ULTIMATE.start_main_~i~0#1| 99995)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2580#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-20 14:05:29,614 INFO L290 TraceCheckUtils]: 18: Hoare triple {2588#(< |ULTIMATE.start_main_~i~0#1| 99994)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2584#(< |ULTIMATE.start_main_~i~0#1| 99995)} is VALID [2022-02-20 14:05:29,615 INFO L290 TraceCheckUtils]: 17: Hoare triple {2592#(< |ULTIMATE.start_main_~i~0#1| 99993)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2588#(< |ULTIMATE.start_main_~i~0#1| 99994)} is VALID [2022-02-20 14:05:29,615 INFO L290 TraceCheckUtils]: 16: Hoare triple {2596#(< |ULTIMATE.start_main_~i~0#1| 99992)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2592#(< |ULTIMATE.start_main_~i~0#1| 99993)} is VALID [2022-02-20 14:05:29,615 INFO L290 TraceCheckUtils]: 15: Hoare triple {2600#(< |ULTIMATE.start_main_~i~0#1| 99991)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2596#(< |ULTIMATE.start_main_~i~0#1| 99992)} is VALID [2022-02-20 14:05:29,616 INFO L290 TraceCheckUtils]: 14: Hoare triple {2604#(< |ULTIMATE.start_main_~i~0#1| 99990)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2600#(< |ULTIMATE.start_main_~i~0#1| 99991)} is VALID [2022-02-20 14:05:29,616 INFO L290 TraceCheckUtils]: 13: Hoare triple {2608#(< |ULTIMATE.start_main_~i~0#1| 99989)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2604#(< |ULTIMATE.start_main_~i~0#1| 99990)} is VALID [2022-02-20 14:05:29,617 INFO L290 TraceCheckUtils]: 12: Hoare triple {2612#(< |ULTIMATE.start_main_~i~0#1| 99988)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2608#(< |ULTIMATE.start_main_~i~0#1| 99989)} is VALID [2022-02-20 14:05:29,617 INFO L290 TraceCheckUtils]: 11: Hoare triple {2616#(< |ULTIMATE.start_main_~i~0#1| 99987)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2612#(< |ULTIMATE.start_main_~i~0#1| 99988)} is VALID [2022-02-20 14:05:29,618 INFO L290 TraceCheckUtils]: 10: Hoare triple {2620#(< |ULTIMATE.start_main_~i~0#1| 99986)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2616#(< |ULTIMATE.start_main_~i~0#1| 99987)} is VALID [2022-02-20 14:05:29,618 INFO L290 TraceCheckUtils]: 9: Hoare triple {2624#(< |ULTIMATE.start_main_~i~0#1| 99985)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2620#(< |ULTIMATE.start_main_~i~0#1| 99986)} is VALID [2022-02-20 14:05:29,619 INFO L290 TraceCheckUtils]: 8: Hoare triple {2628#(< |ULTIMATE.start_main_~i~0#1| 99984)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2624#(< |ULTIMATE.start_main_~i~0#1| 99985)} is VALID [2022-02-20 14:05:29,619 INFO L290 TraceCheckUtils]: 7: Hoare triple {2632#(< |ULTIMATE.start_main_~i~0#1| 99983)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2628#(< |ULTIMATE.start_main_~i~0#1| 99984)} is VALID [2022-02-20 14:05:29,620 INFO L290 TraceCheckUtils]: 6: Hoare triple {2636#(< |ULTIMATE.start_main_~i~0#1| 99982)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2632#(< |ULTIMATE.start_main_~i~0#1| 99983)} is VALID [2022-02-20 14:05:29,620 INFO L290 TraceCheckUtils]: 5: Hoare triple {2640#(< |ULTIMATE.start_main_~i~0#1| 99981)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2636#(< |ULTIMATE.start_main_~i~0#1| 99982)} is VALID [2022-02-20 14:05:29,621 INFO L290 TraceCheckUtils]: 4: Hoare triple {2644#(< |ULTIMATE.start_main_~i~0#1| 99980)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2640#(< |ULTIMATE.start_main_~i~0#1| 99981)} is VALID [2022-02-20 14:05:29,621 INFO L290 TraceCheckUtils]: 3: Hoare triple {2648#(< |ULTIMATE.start_main_~i~0#1| 99979)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2644#(< |ULTIMATE.start_main_~i~0#1| 99980)} is VALID [2022-02-20 14:05:29,622 INFO L290 TraceCheckUtils]: 2: Hoare triple {2652#(< |ULTIMATE.start_main_~i~0#1| 99978)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2648#(< |ULTIMATE.start_main_~i~0#1| 99979)} is VALID [2022-02-20 14:05:29,622 INFO L290 TraceCheckUtils]: 1: Hoare triple {2007#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem2#1, main_#t~post1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {2652#(< |ULTIMATE.start_main_~i~0#1| 99978)} is VALID [2022-02-20 14:05:29,622 INFO L290 TraceCheckUtils]: 0: Hoare triple {2007#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); {2007#true} is VALID [2022-02-20 14:05:29,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 759 trivial. 0 not checked. [2022-02-20 14:05:29,623 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1797383786] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:05:29,623 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:05:29,623 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2022-02-20 14:05:29,623 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630087449] [2022-02-20 14:05:29,624 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:05:29,624 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 49 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2022-02-20 14:05:29,624 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:05:29,625 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 49 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 49 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:29,652 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:05:29,652 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-02-20 14:05:29,653 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:05:29,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-02-20 14:05:29,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2022-02-20 14:05:29,654 INFO L87 Difference]: Start difference. First operand 104 states and 108 transitions. Second operand has 49 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 49 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:30,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:05:30,763 INFO L93 Difference]: Finished difference Result 279 states and 382 transitions. [2022-02-20 14:05:30,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-02-20 14:05:30,763 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 49 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2022-02-20 14:05:30,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:05:30,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 49 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:30,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 316 transitions. [2022-02-20 14:05:30,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 49 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:30,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 316 transitions. [2022-02-20 14:05:30,771 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 316 transitions. [2022-02-20 14:05:30,973 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 316 edges. 316 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:05:30,978 INFO L225 Difference]: With dead ends: 279 [2022-02-20 14:05:30,978 INFO L226 Difference]: Without dead ends: 200 [2022-02-20 14:05:30,979 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2022-02-20 14:05:30,979 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 585 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 585 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 14:05:30,979 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [585 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 14:05:30,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-02-20 14:05:31,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2022-02-20 14:05:31,109 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:05:31,112 INFO L82 GeneralOperation]: Start isEquivalent. First operand 200 states. Second operand has 200 states, 199 states have (on average 1.0251256281407035) internal successors, (204), 199 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have 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:05:31,113 INFO L74 IsIncluded]: Start isIncluded. First operand 200 states. Second operand has 200 states, 199 states have (on average 1.0251256281407035) internal successors, (204), 199 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have 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:05:31,113 INFO L87 Difference]: Start difference. First operand 200 states. Second operand has 200 states, 199 states have (on average 1.0251256281407035) internal successors, (204), 199 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have 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:05:31,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:05:31,117 INFO L93 Difference]: Finished difference Result 200 states and 204 transitions. [2022-02-20 14:05:31,117 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 204 transitions. [2022-02-20 14:05:31,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:05:31,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:05:31,118 INFO L74 IsIncluded]: Start isIncluded. First operand has 200 states, 199 states have (on average 1.0251256281407035) internal successors, (204), 199 states have internal predecessors, (204), 0 states have call successors, (0), 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 200 states. [2022-02-20 14:05:31,118 INFO L87 Difference]: Start difference. First operand has 200 states, 199 states have (on average 1.0251256281407035) internal successors, (204), 199 states have internal predecessors, (204), 0 states have call successors, (0), 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 200 states. [2022-02-20 14:05:31,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:05:31,122 INFO L93 Difference]: Finished difference Result 200 states and 204 transitions. [2022-02-20 14:05:31,122 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 204 transitions. [2022-02-20 14:05:31,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:05:31,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:05:31,122 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:05:31,122 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:05:31,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 199 states have (on average 1.0251256281407035) internal successors, (204), 199 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have 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:05:31,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 204 transitions. [2022-02-20 14:05:31,126 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 204 transitions. Word has length 101 [2022-02-20 14:05:31,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:05:31,128 INFO L470 AbstractCegarLoop]: Abstraction has 200 states and 204 transitions. [2022-02-20 14:05:31,128 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 49 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:31,128 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 204 transitions. [2022-02-20 14:05:31,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2022-02-20 14:05:31,132 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:05:31,132 INFO L514 BasicCegarLoop]: trace histogram [46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:05:31,151 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:05:31,349 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:05:31,350 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:05:31,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:05:31,350 INFO L85 PathProgramCache]: Analyzing trace with hash -545690075, now seen corresponding path program 5 times [2022-02-20 14:05:31,350 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:05:31,351 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407875887] [2022-02-20 14:05:31,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:05:31,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:05:31,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:05:32,446 INFO L290 TraceCheckUtils]: 0: Hoare triple {3985#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); {3985#true} is VALID [2022-02-20 14:05:32,447 INFO L290 TraceCheckUtils]: 1: Hoare triple {3985#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem2#1, main_#t~post1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {3987#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:05:32,448 INFO L290 TraceCheckUtils]: 2: Hoare triple {3987#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3988#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:05:32,448 INFO L290 TraceCheckUtils]: 3: Hoare triple {3988#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3989#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:05:32,449 INFO L290 TraceCheckUtils]: 4: Hoare triple {3989#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3990#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:05:32,449 INFO L290 TraceCheckUtils]: 5: Hoare triple {3990#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3991#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:05:32,450 INFO L290 TraceCheckUtils]: 6: Hoare triple {3991#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3992#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:05:32,450 INFO L290 TraceCheckUtils]: 7: Hoare triple {3992#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3993#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:05:32,451 INFO L290 TraceCheckUtils]: 8: Hoare triple {3993#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3994#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:05:32,451 INFO L290 TraceCheckUtils]: 9: Hoare triple {3994#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3995#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:05:32,452 INFO L290 TraceCheckUtils]: 10: Hoare triple {3995#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3996#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:05:32,452 INFO L290 TraceCheckUtils]: 11: Hoare triple {3996#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3997#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:05:32,453 INFO L290 TraceCheckUtils]: 12: Hoare triple {3997#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3998#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-20 14:05:32,453 INFO L290 TraceCheckUtils]: 13: Hoare triple {3998#(<= |ULTIMATE.start_main_~i~0#1| 11)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3999#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 14:05:32,454 INFO L290 TraceCheckUtils]: 14: Hoare triple {3999#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4000#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-20 14:05:32,456 INFO L290 TraceCheckUtils]: 15: Hoare triple {4000#(<= |ULTIMATE.start_main_~i~0#1| 13)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4001#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 14:05:32,458 INFO L290 TraceCheckUtils]: 16: Hoare triple {4001#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4002#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-20 14:05:32,458 INFO L290 TraceCheckUtils]: 17: Hoare triple {4002#(<= |ULTIMATE.start_main_~i~0#1| 15)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4003#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 14:05:32,459 INFO L290 TraceCheckUtils]: 18: Hoare triple {4003#(<= |ULTIMATE.start_main_~i~0#1| 16)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4004#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-20 14:05:32,459 INFO L290 TraceCheckUtils]: 19: Hoare triple {4004#(<= |ULTIMATE.start_main_~i~0#1| 17)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4005#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 14:05:32,460 INFO L290 TraceCheckUtils]: 20: Hoare triple {4005#(<= |ULTIMATE.start_main_~i~0#1| 18)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4006#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-20 14:05:32,461 INFO L290 TraceCheckUtils]: 21: Hoare triple {4006#(<= |ULTIMATE.start_main_~i~0#1| 19)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4007#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 14:05:32,462 INFO L290 TraceCheckUtils]: 22: Hoare triple {4007#(<= |ULTIMATE.start_main_~i~0#1| 20)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4008#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-20 14:05:32,462 INFO L290 TraceCheckUtils]: 23: Hoare triple {4008#(<= |ULTIMATE.start_main_~i~0#1| 21)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4009#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-20 14:05:32,463 INFO L290 TraceCheckUtils]: 24: Hoare triple {4009#(<= |ULTIMATE.start_main_~i~0#1| 22)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4010#(<= |ULTIMATE.start_main_~i~0#1| 23)} is VALID [2022-02-20 14:05:32,463 INFO L290 TraceCheckUtils]: 25: Hoare triple {4010#(<= |ULTIMATE.start_main_~i~0#1| 23)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4011#(<= |ULTIMATE.start_main_~i~0#1| 24)} is VALID [2022-02-20 14:05:32,466 INFO L290 TraceCheckUtils]: 26: Hoare triple {4011#(<= |ULTIMATE.start_main_~i~0#1| 24)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4012#(<= |ULTIMATE.start_main_~i~0#1| 25)} is VALID [2022-02-20 14:05:32,467 INFO L290 TraceCheckUtils]: 27: Hoare triple {4012#(<= |ULTIMATE.start_main_~i~0#1| 25)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4013#(<= |ULTIMATE.start_main_~i~0#1| 26)} is VALID [2022-02-20 14:05:32,467 INFO L290 TraceCheckUtils]: 28: Hoare triple {4013#(<= |ULTIMATE.start_main_~i~0#1| 26)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4014#(<= |ULTIMATE.start_main_~i~0#1| 27)} is VALID [2022-02-20 14:05:32,468 INFO L290 TraceCheckUtils]: 29: Hoare triple {4014#(<= |ULTIMATE.start_main_~i~0#1| 27)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4015#(<= |ULTIMATE.start_main_~i~0#1| 28)} is VALID [2022-02-20 14:05:32,468 INFO L290 TraceCheckUtils]: 30: Hoare triple {4015#(<= |ULTIMATE.start_main_~i~0#1| 28)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4016#(<= |ULTIMATE.start_main_~i~0#1| 29)} is VALID [2022-02-20 14:05:32,469 INFO L290 TraceCheckUtils]: 31: Hoare triple {4016#(<= |ULTIMATE.start_main_~i~0#1| 29)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4017#(<= |ULTIMATE.start_main_~i~0#1| 30)} is VALID [2022-02-20 14:05:32,469 INFO L290 TraceCheckUtils]: 32: Hoare triple {4017#(<= |ULTIMATE.start_main_~i~0#1| 30)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4018#(<= |ULTIMATE.start_main_~i~0#1| 31)} is VALID [2022-02-20 14:05:32,470 INFO L290 TraceCheckUtils]: 33: Hoare triple {4018#(<= |ULTIMATE.start_main_~i~0#1| 31)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4019#(<= |ULTIMATE.start_main_~i~0#1| 32)} is VALID [2022-02-20 14:05:32,470 INFO L290 TraceCheckUtils]: 34: Hoare triple {4019#(<= |ULTIMATE.start_main_~i~0#1| 32)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4020#(<= |ULTIMATE.start_main_~i~0#1| 33)} is VALID [2022-02-20 14:05:32,471 INFO L290 TraceCheckUtils]: 35: Hoare triple {4020#(<= |ULTIMATE.start_main_~i~0#1| 33)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4021#(<= |ULTIMATE.start_main_~i~0#1| 34)} is VALID [2022-02-20 14:05:32,471 INFO L290 TraceCheckUtils]: 36: Hoare triple {4021#(<= |ULTIMATE.start_main_~i~0#1| 34)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4022#(<= |ULTIMATE.start_main_~i~0#1| 35)} is VALID [2022-02-20 14:05:32,472 INFO L290 TraceCheckUtils]: 37: Hoare triple {4022#(<= |ULTIMATE.start_main_~i~0#1| 35)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4023#(<= |ULTIMATE.start_main_~i~0#1| 36)} is VALID [2022-02-20 14:05:32,472 INFO L290 TraceCheckUtils]: 38: Hoare triple {4023#(<= |ULTIMATE.start_main_~i~0#1| 36)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4024#(<= |ULTIMATE.start_main_~i~0#1| 37)} is VALID [2022-02-20 14:05:32,473 INFO L290 TraceCheckUtils]: 39: Hoare triple {4024#(<= |ULTIMATE.start_main_~i~0#1| 37)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4025#(<= |ULTIMATE.start_main_~i~0#1| 38)} is VALID [2022-02-20 14:05:32,473 INFO L290 TraceCheckUtils]: 40: Hoare triple {4025#(<= |ULTIMATE.start_main_~i~0#1| 38)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4026#(<= |ULTIMATE.start_main_~i~0#1| 39)} is VALID [2022-02-20 14:05:32,474 INFO L290 TraceCheckUtils]: 41: Hoare triple {4026#(<= |ULTIMATE.start_main_~i~0#1| 39)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4027#(<= |ULTIMATE.start_main_~i~0#1| 40)} is VALID [2022-02-20 14:05:32,474 INFO L290 TraceCheckUtils]: 42: Hoare triple {4027#(<= |ULTIMATE.start_main_~i~0#1| 40)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4028#(<= |ULTIMATE.start_main_~i~0#1| 41)} is VALID [2022-02-20 14:05:32,475 INFO L290 TraceCheckUtils]: 43: Hoare triple {4028#(<= |ULTIMATE.start_main_~i~0#1| 41)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4029#(<= |ULTIMATE.start_main_~i~0#1| 42)} is VALID [2022-02-20 14:05:32,475 INFO L290 TraceCheckUtils]: 44: Hoare triple {4029#(<= |ULTIMATE.start_main_~i~0#1| 42)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4030#(<= |ULTIMATE.start_main_~i~0#1| 43)} is VALID [2022-02-20 14:05:32,475 INFO L290 TraceCheckUtils]: 45: Hoare triple {4030#(<= |ULTIMATE.start_main_~i~0#1| 43)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4031#(<= |ULTIMATE.start_main_~i~0#1| 44)} is VALID [2022-02-20 14:05:32,476 INFO L290 TraceCheckUtils]: 46: Hoare triple {4031#(<= |ULTIMATE.start_main_~i~0#1| 44)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4032#(<= |ULTIMATE.start_main_~i~0#1| 45)} is VALID [2022-02-20 14:05:32,476 INFO L290 TraceCheckUtils]: 47: Hoare triple {4032#(<= |ULTIMATE.start_main_~i~0#1| 45)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4033#(<= |ULTIMATE.start_main_~i~0#1| 46)} is VALID [2022-02-20 14:05:32,477 INFO L290 TraceCheckUtils]: 48: Hoare triple {4033#(<= |ULTIMATE.start_main_~i~0#1| 46)} assume !(main_~i~0#1 < 100000); {3986#false} is VALID [2022-02-20 14:05:32,477 INFO L290 TraceCheckUtils]: 49: Hoare triple {3986#false} main_~i~0#1 := 0; {3986#false} is VALID [2022-02-20 14:05:32,477 INFO L290 TraceCheckUtils]: 50: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,477 INFO L290 TraceCheckUtils]: 51: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,477 INFO L290 TraceCheckUtils]: 52: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,478 INFO L290 TraceCheckUtils]: 53: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,478 INFO L290 TraceCheckUtils]: 54: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,478 INFO L290 TraceCheckUtils]: 55: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,478 INFO L290 TraceCheckUtils]: 56: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,478 INFO L290 TraceCheckUtils]: 57: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,478 INFO L290 TraceCheckUtils]: 58: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,478 INFO L290 TraceCheckUtils]: 59: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,478 INFO L290 TraceCheckUtils]: 60: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,478 INFO L290 TraceCheckUtils]: 61: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,479 INFO L290 TraceCheckUtils]: 62: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,479 INFO L290 TraceCheckUtils]: 63: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,479 INFO L290 TraceCheckUtils]: 64: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,479 INFO L290 TraceCheckUtils]: 65: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,479 INFO L290 TraceCheckUtils]: 66: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,479 INFO L290 TraceCheckUtils]: 67: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,479 INFO L290 TraceCheckUtils]: 68: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,479 INFO L290 TraceCheckUtils]: 69: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,480 INFO L290 TraceCheckUtils]: 70: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,480 INFO L290 TraceCheckUtils]: 71: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,480 INFO L290 TraceCheckUtils]: 72: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,480 INFO L290 TraceCheckUtils]: 73: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,480 INFO L290 TraceCheckUtils]: 74: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,480 INFO L290 TraceCheckUtils]: 75: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,480 INFO L290 TraceCheckUtils]: 76: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,480 INFO L290 TraceCheckUtils]: 77: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,481 INFO L290 TraceCheckUtils]: 78: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,481 INFO L290 TraceCheckUtils]: 79: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,481 INFO L290 TraceCheckUtils]: 80: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,481 INFO L290 TraceCheckUtils]: 81: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,481 INFO L290 TraceCheckUtils]: 82: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,481 INFO L290 TraceCheckUtils]: 83: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,481 INFO L290 TraceCheckUtils]: 84: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,481 INFO L290 TraceCheckUtils]: 85: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,481 INFO L290 TraceCheckUtils]: 86: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,482 INFO L290 TraceCheckUtils]: 87: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,482 INFO L290 TraceCheckUtils]: 88: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,482 INFO L290 TraceCheckUtils]: 89: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,482 INFO L290 TraceCheckUtils]: 90: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,482 INFO L290 TraceCheckUtils]: 91: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,482 INFO L290 TraceCheckUtils]: 92: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,482 INFO L290 TraceCheckUtils]: 93: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,482 INFO L290 TraceCheckUtils]: 94: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,483 INFO L290 TraceCheckUtils]: 95: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,483 INFO L290 TraceCheckUtils]: 96: Hoare triple {3986#false} assume !(main_~i~0#1 < 100000); {3986#false} is VALID [2022-02-20 14:05:32,483 INFO L290 TraceCheckUtils]: 97: Hoare triple {3986#false} main_~i~0#1 := 0; {3986#false} is VALID [2022-02-20 14:05:32,483 INFO L290 TraceCheckUtils]: 98: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,483 INFO L290 TraceCheckUtils]: 99: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,483 INFO L290 TraceCheckUtils]: 100: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,483 INFO L290 TraceCheckUtils]: 101: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,483 INFO L290 TraceCheckUtils]: 102: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,483 INFO L290 TraceCheckUtils]: 103: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,484 INFO L290 TraceCheckUtils]: 104: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,484 INFO L290 TraceCheckUtils]: 105: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,484 INFO L290 TraceCheckUtils]: 106: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,484 INFO L290 TraceCheckUtils]: 107: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,484 INFO L290 TraceCheckUtils]: 108: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,484 INFO L290 TraceCheckUtils]: 109: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,484 INFO L290 TraceCheckUtils]: 110: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,484 INFO L290 TraceCheckUtils]: 111: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,485 INFO L290 TraceCheckUtils]: 112: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,485 INFO L290 TraceCheckUtils]: 113: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,485 INFO L290 TraceCheckUtils]: 114: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,485 INFO L290 TraceCheckUtils]: 115: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,485 INFO L290 TraceCheckUtils]: 116: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,485 INFO L290 TraceCheckUtils]: 117: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,485 INFO L290 TraceCheckUtils]: 118: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,485 INFO L290 TraceCheckUtils]: 119: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,485 INFO L290 TraceCheckUtils]: 120: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,486 INFO L290 TraceCheckUtils]: 121: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,486 INFO L290 TraceCheckUtils]: 122: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,486 INFO L290 TraceCheckUtils]: 123: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,486 INFO L290 TraceCheckUtils]: 124: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,486 INFO L290 TraceCheckUtils]: 125: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,486 INFO L290 TraceCheckUtils]: 126: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,486 INFO L290 TraceCheckUtils]: 127: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,486 INFO L290 TraceCheckUtils]: 128: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,487 INFO L290 TraceCheckUtils]: 129: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,487 INFO L290 TraceCheckUtils]: 130: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,487 INFO L290 TraceCheckUtils]: 131: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,487 INFO L290 TraceCheckUtils]: 132: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,487 INFO L290 TraceCheckUtils]: 133: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,487 INFO L290 TraceCheckUtils]: 134: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,487 INFO L290 TraceCheckUtils]: 135: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,487 INFO L290 TraceCheckUtils]: 136: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,487 INFO L290 TraceCheckUtils]: 137: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,488 INFO L290 TraceCheckUtils]: 138: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,488 INFO L290 TraceCheckUtils]: 139: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,488 INFO L290 TraceCheckUtils]: 140: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,488 INFO L290 TraceCheckUtils]: 141: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,488 INFO L290 TraceCheckUtils]: 142: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,488 INFO L290 TraceCheckUtils]: 143: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,488 INFO L290 TraceCheckUtils]: 144: Hoare triple {3986#false} assume !(main_~i~0#1 < 100000); {3986#false} is VALID [2022-02-20 14:05:32,488 INFO L290 TraceCheckUtils]: 145: Hoare triple {3986#false} main_~i~0#1 := 0; {3986#false} is VALID [2022-02-20 14:05:32,489 INFO L290 TraceCheckUtils]: 146: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,489 INFO L290 TraceCheckUtils]: 147: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,489 INFO L290 TraceCheckUtils]: 148: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,489 INFO L290 TraceCheckUtils]: 149: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,489 INFO L290 TraceCheckUtils]: 150: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,489 INFO L290 TraceCheckUtils]: 151: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,489 INFO L290 TraceCheckUtils]: 152: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,489 INFO L290 TraceCheckUtils]: 153: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,489 INFO L290 TraceCheckUtils]: 154: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,490 INFO L290 TraceCheckUtils]: 155: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,490 INFO L290 TraceCheckUtils]: 156: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,490 INFO L290 TraceCheckUtils]: 157: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,490 INFO L290 TraceCheckUtils]: 158: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,490 INFO L290 TraceCheckUtils]: 159: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,490 INFO L290 TraceCheckUtils]: 160: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,490 INFO L290 TraceCheckUtils]: 161: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,490 INFO L290 TraceCheckUtils]: 162: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,491 INFO L290 TraceCheckUtils]: 163: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,491 INFO L290 TraceCheckUtils]: 164: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,491 INFO L290 TraceCheckUtils]: 165: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,491 INFO L290 TraceCheckUtils]: 166: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,491 INFO L290 TraceCheckUtils]: 167: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,491 INFO L290 TraceCheckUtils]: 168: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,491 INFO L290 TraceCheckUtils]: 169: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,491 INFO L290 TraceCheckUtils]: 170: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,492 INFO L290 TraceCheckUtils]: 171: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,492 INFO L290 TraceCheckUtils]: 172: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,492 INFO L290 TraceCheckUtils]: 173: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,492 INFO L290 TraceCheckUtils]: 174: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,492 INFO L290 TraceCheckUtils]: 175: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,492 INFO L290 TraceCheckUtils]: 176: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,492 INFO L290 TraceCheckUtils]: 177: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,492 INFO L290 TraceCheckUtils]: 178: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,493 INFO L290 TraceCheckUtils]: 179: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,493 INFO L290 TraceCheckUtils]: 180: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,493 INFO L290 TraceCheckUtils]: 181: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,493 INFO L290 TraceCheckUtils]: 182: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,493 INFO L290 TraceCheckUtils]: 183: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,493 INFO L290 TraceCheckUtils]: 184: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,493 INFO L290 TraceCheckUtils]: 185: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,493 INFO L290 TraceCheckUtils]: 186: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,493 INFO L290 TraceCheckUtils]: 187: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,494 INFO L290 TraceCheckUtils]: 188: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,494 INFO L290 TraceCheckUtils]: 189: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,494 INFO L290 TraceCheckUtils]: 190: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,494 INFO L290 TraceCheckUtils]: 191: Hoare triple {3986#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3986#false} is VALID [2022-02-20 14:05:32,494 INFO L290 TraceCheckUtils]: 192: Hoare triple {3986#false} assume !(main_~i~0#1 < 100000); {3986#false} is VALID [2022-02-20 14:05:32,494 INFO L290 TraceCheckUtils]: 193: Hoare triple {3986#false} havoc main_~x~0#1;main_~x~0#1 := 0; {3986#false} is VALID [2022-02-20 14:05:32,494 INFO L290 TraceCheckUtils]: 194: Hoare triple {3986#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 46 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3986#false} is VALID [2022-02-20 14:05:32,494 INFO L290 TraceCheckUtils]: 195: Hoare triple {3986#false} assume 0 == __VERIFIER_assert_~cond#1; {3986#false} is VALID [2022-02-20 14:05:32,495 INFO L290 TraceCheckUtils]: 196: Hoare triple {3986#false} assume !false; {3986#false} is VALID [2022-02-20 14:05:32,496 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 3243 trivial. 0 not checked. [2022-02-20 14:05:32,496 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:05:32,496 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407875887] [2022-02-20 14:05:32,496 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407875887] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:05:32,496 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141638123] [2022-02-20 14:05:32,497 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-20 14:05:32,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:05:32,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:05:32,498 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:05:32,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process