./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-lopstr16/single_elem_safe.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-lopstr16/single_elem_safe.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 f1aed9bc44add9424c35127ba8c0166402387241540742ea765fb4b7385c8271 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 14:27:06,042 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 14:27:06,045 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 14:27:06,087 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 14:27:06,087 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 14:27:06,091 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 14:27:06,092 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 14:27:06,095 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 14:27:06,098 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 14:27:06,102 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 14:27:06,103 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 14:27:06,104 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 14:27:06,105 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 14:27:06,107 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 14:27:06,108 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 14:27:06,111 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 14:27:06,112 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 14:27:06,113 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 14:27:06,115 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 14:27:06,121 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 14:27:06,122 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 14:27:06,123 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 14:27:06,124 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 14:27:06,125 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 14:27:06,130 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 14:27:06,130 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 14:27:06,131 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 14:27:06,132 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 14:27:06,133 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 14:27:06,134 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 14:27:06,134 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 14:27:06,135 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 14:27:06,136 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 14:27:06,137 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 14:27:06,138 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 14:27:06,139 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 14:27:06,139 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 14:27:06,139 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 14:27:06,140 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 14:27:06,140 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 14:27:06,141 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 14:27:06,142 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:27:06,171 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 14:27:06,171 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 14:27:06,172 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 14:27:06,172 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 14:27:06,173 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 14:27:06,173 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 14:27:06,173 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 14:27:06,173 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 14:27:06,174 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 14:27:06,174 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 14:27:06,175 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 14:27:06,175 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 14:27:06,175 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 14:27:06,175 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 14:27:06,176 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 14:27:06,176 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 14:27:06,176 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 14:27:06,176 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 14:27:06,176 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 14:27:06,176 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 14:27:06,177 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 14:27:06,177 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 14:27:06,177 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 14:27:06,177 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 14:27:06,177 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:27:06,178 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 14:27:06,178 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 14:27:06,179 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 14:27:06,179 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 14:27:06,179 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 14:27:06,180 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 14:27:06,180 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 14:27:06,180 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 14:27:06,180 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 -> f1aed9bc44add9424c35127ba8c0166402387241540742ea765fb4b7385c8271 [2022-02-20 14:27:06,387 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 14:27:06,402 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 14:27:06,405 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 14:27:06,406 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 14:27:06,406 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 14:27:06,407 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-lopstr16/single_elem_safe.i [2022-02-20 14:27:06,457 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bc686bb8/93e4d60b267b4deb817efe0a4cc008a4/FLAGbeb45b31d [2022-02-20 14:27:06,842 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 14:27:06,842 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-lopstr16/single_elem_safe.i [2022-02-20 14:27:06,847 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bc686bb8/93e4d60b267b4deb817efe0a4cc008a4/FLAGbeb45b31d [2022-02-20 14:27:06,859 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bc686bb8/93e4d60b267b4deb817efe0a4cc008a4 [2022-02-20 14:27:06,861 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 14:27:06,862 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 14:27:06,864 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 14:27:06,864 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 14:27:06,866 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 14:27:06,867 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:27:06" (1/1) ... [2022-02-20 14:27:06,868 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31c14a12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:27:06, skipping insertion in model container [2022-02-20 14:27:06,868 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:27:06" (1/1) ... [2022-02-20 14:27:06,874 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 14:27:06,883 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 14:27:07,026 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-lopstr16/single_elem_safe.i[809,822] [2022-02-20 14:27:07,050 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:27:07,059 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 14:27:07,070 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-lopstr16/single_elem_safe.i[809,822] [2022-02-20 14:27:07,077 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:27:07,087 INFO L208 MainTranslator]: Completed translation [2022-02-20 14:27:07,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:27:07 WrapperNode [2022-02-20 14:27:07,088 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 14:27:07,089 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 14:27:07,089 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 14:27:07,089 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 14:27:07,094 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:27:07" (1/1) ... [2022-02-20 14:27:07,099 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:27:07" (1/1) ... [2022-02-20 14:27:07,115 INFO L137 Inliner]: procedures = 19, calls = 20, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 73 [2022-02-20 14:27:07,116 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 14:27:07,117 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 14:27:07,117 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 14:27:07,117 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 14:27:07,122 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:27:07" (1/1) ... [2022-02-20 14:27:07,122 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:27:07" (1/1) ... [2022-02-20 14:27:07,124 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:27:07" (1/1) ... [2022-02-20 14:27:07,126 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:27:07" (1/1) ... [2022-02-20 14:27:07,132 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:27:07" (1/1) ... [2022-02-20 14:27:07,135 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:27:07" (1/1) ... [2022-02-20 14:27:07,135 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:27:07" (1/1) ... [2022-02-20 14:27:07,137 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 14:27:07,138 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 14:27:07,138 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 14:27:07,138 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 14:27:07,147 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:27:07" (1/1) ... [2022-02-20 14:27:07,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:27:07,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:27:07,181 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:27:07,212 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:27:07,230 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 14:27:07,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 14:27:07,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 14:27:07,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 14:27:07,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 14:27:07,231 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 14:27:07,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 14:27:07,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 14:27:07,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 14:27:07,308 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 14:27:07,309 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 14:27:07,527 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 14:27:07,532 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 14:27:07,532 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 14:27:07,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:27:07 BoogieIcfgContainer [2022-02-20 14:27:07,534 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 14:27:07,535 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 14:27:07,535 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 14:27:07,541 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 14:27:07,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 02:27:06" (1/3) ... [2022-02-20 14:27:07,542 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f31d5d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:27:07, skipping insertion in model container [2022-02-20 14:27:07,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:27:07" (2/3) ... [2022-02-20 14:27:07,543 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f31d5d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:27:07, skipping insertion in model container [2022-02-20 14:27:07,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:27:07" (3/3) ... [2022-02-20 14:27:07,544 INFO L111 eAbstractionObserver]: Analyzing ICFG single_elem_safe.i [2022-02-20 14:27:07,547 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 14:27:07,554 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 14:27:07,596 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 14:27:07,600 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:27:07,601 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 14:27:07,611 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 20 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:27:07,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 14:27:07,617 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:27:07,618 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:27:07,619 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:27:07,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:27:07,629 INFO L85 PathProgramCache]: Analyzing trace with hash -739796340, now seen corresponding path program 1 times [2022-02-20 14:27:07,645 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:27:07,645 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118943032] [2022-02-20 14:27:07,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:27:07,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:27:07,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:27:07,801 INFO L290 TraceCheckUtils]: 0: Hoare triple {24#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(19, 2);~#a~0.base, ~#a~0.offset := 3, 0;call #Ultimate.allocInit(4000000, 3);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base); {24#true} is VALID [2022-02-20 14:27:07,801 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~post1#1, main_~q~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~short10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~post7#1, main_~s1~0#1.base, main_~s1~0#1.offset, main_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; {24#true} is VALID [2022-02-20 14:27:07,802 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume !true; {25#false} is VALID [2022-02-20 14:27:07,802 INFO L290 TraceCheckUtils]: 3: Hoare triple {25#false} call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(main_#t~malloc6#1.base, main_#t~malloc6#1.offset, ~#a~0.base, 12 + ~#a~0.offset, 4);havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_~i~0#1 := 0; {25#false} is VALID [2022-02-20 14:27:07,802 INFO L290 TraceCheckUtils]: 4: Hoare triple {25#false} assume !!(main_~i~0#1 < 1000000);call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4);main_~s1~0#1.base, main_~s1~0#1.offset := main_#t~mem8#1.base, main_#t~mem8#1.offset;havoc main_#t~mem8#1.base, main_#t~mem8#1.offset;main_#t~short10#1 := 3 != main_~i~0#1 && (main_~s1~0#1.base != 0 || main_~s1~0#1.offset != 0); {25#false} is VALID [2022-02-20 14:27:07,803 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#false} assume !main_#t~short10#1; {25#false} is VALID [2022-02-20 14:27:07,803 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#false} assume main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1;call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~s1~0#1.base, main_~s1~0#1.offset, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem11#1.base != 0 || main_#t~mem11#1.offset != 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {25#false} is VALID [2022-02-20 14:27:07,803 INFO L290 TraceCheckUtils]: 7: Hoare triple {25#false} assume 0 == __VERIFIER_assert_~cond#1; {25#false} is VALID [2022-02-20 14:27:07,803 INFO L290 TraceCheckUtils]: 8: Hoare triple {25#false} assume !false; {25#false} is VALID [2022-02-20 14:27:07,804 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:27:07,805 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:27:07,805 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118943032] [2022-02-20 14:27:07,805 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118943032] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:27:07,806 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:27:07,806 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 14:27:07,807 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927615593] [2022-02-20 14:27:07,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:27:07,811 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 14:27:07,812 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:27:07,814 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have 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:27:07,825 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:27:07,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 14:27:07,826 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:27:07,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 14:27:07,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 14:27:07,854 INFO L87 Difference]: Start difference. First operand has 21 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 20 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 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have 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:27:07,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:27:07,897 INFO L93 Difference]: Finished difference Result 34 states and 47 transitions. [2022-02-20 14:27:07,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 14:27:07,897 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 14:27:07,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:27:07,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have 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:27:07,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 47 transitions. [2022-02-20 14:27:07,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have 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:27:07,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 47 transitions. [2022-02-20 14:27:07,904 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 47 transitions. [2022-02-20 14:27:07,945 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:27:07,951 INFO L225 Difference]: With dead ends: 34 [2022-02-20 14:27:07,951 INFO L226 Difference]: Without dead ends: 17 [2022-02-20 14:27:07,953 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 14:27:07,956 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:27:07,958 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:27:07,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-02-20 14:27:07,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-02-20 14:27:07,992 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:27:07,993 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:27:07,994 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:27:07,995 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:27:07,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:27:07,996 INFO L93 Difference]: Finished difference Result 17 states and 23 transitions. [2022-02-20 14:27:07,996 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 23 transitions. [2022-02-20 14:27:08,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:27:08,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:27:08,001 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 17 states. [2022-02-20 14:27:08,001 INFO L87 Difference]: Start difference. First operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 17 states. [2022-02-20 14:27:08,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:27:08,019 INFO L93 Difference]: Finished difference Result 17 states and 23 transitions. [2022-02-20 14:27:08,019 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 23 transitions. [2022-02-20 14:27:08,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:27:08,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:27:08,020 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:27:08,020 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:27:08,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:27:08,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2022-02-20 14:27:08,023 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 23 transitions. Word has length 9 [2022-02-20 14:27:08,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:27:08,023 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 23 transitions. [2022-02-20 14:27:08,024 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have 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:27:08,024 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 23 transitions. [2022-02-20 14:27:08,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 14:27:08,024 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:27:08,024 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:27:08,025 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 14:27:08,025 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:27:08,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:27:08,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1452551885, now seen corresponding path program 1 times [2022-02-20 14:27:08,026 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:27:08,026 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457389266] [2022-02-20 14:27:08,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:27:08,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:27:08,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:27:08,078 INFO L290 TraceCheckUtils]: 0: Hoare triple {120#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(19, 2);~#a~0.base, ~#a~0.offset := 3, 0;call #Ultimate.allocInit(4000000, 3);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base); {120#true} is VALID [2022-02-20 14:27:08,079 INFO L290 TraceCheckUtils]: 1: Hoare triple {120#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~post1#1, main_~q~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~short10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~post7#1, main_~s1~0#1.base, main_~s1~0#1.offset, main_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; {122#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:27:08,080 INFO L290 TraceCheckUtils]: 2: Hoare triple {122#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~i~0#1 < 1000000); {121#false} is VALID [2022-02-20 14:27:08,080 INFO L290 TraceCheckUtils]: 3: Hoare triple {121#false} call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(main_#t~malloc6#1.base, main_#t~malloc6#1.offset, ~#a~0.base, 12 + ~#a~0.offset, 4);havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_~i~0#1 := 0; {121#false} is VALID [2022-02-20 14:27:08,080 INFO L290 TraceCheckUtils]: 4: Hoare triple {121#false} assume !!(main_~i~0#1 < 1000000);call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4);main_~s1~0#1.base, main_~s1~0#1.offset := main_#t~mem8#1.base, main_#t~mem8#1.offset;havoc main_#t~mem8#1.base, main_#t~mem8#1.offset;main_#t~short10#1 := 3 != main_~i~0#1 && (main_~s1~0#1.base != 0 || main_~s1~0#1.offset != 0); {121#false} is VALID [2022-02-20 14:27:08,080 INFO L290 TraceCheckUtils]: 5: Hoare triple {121#false} assume !main_#t~short10#1; {121#false} is VALID [2022-02-20 14:27:08,081 INFO L290 TraceCheckUtils]: 6: Hoare triple {121#false} assume main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1;call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~s1~0#1.base, main_~s1~0#1.offset, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem11#1.base != 0 || main_#t~mem11#1.offset != 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {121#false} is VALID [2022-02-20 14:27:08,081 INFO L290 TraceCheckUtils]: 7: Hoare triple {121#false} assume 0 == __VERIFIER_assert_~cond#1; {121#false} is VALID [2022-02-20 14:27:08,081 INFO L290 TraceCheckUtils]: 8: Hoare triple {121#false} assume !false; {121#false} is VALID [2022-02-20 14:27:08,081 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:27:08,082 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:27:08,082 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457389266] [2022-02-20 14:27:08,082 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457389266] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:27:08,082 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:27:08,082 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:27:08,083 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287473041] [2022-02-20 14:27:08,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:27:08,084 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 14:27:08,084 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:27:08,084 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have 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:27:08,093 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:27:08,093 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:27:08,093 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:27:08,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:27:08,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:27:08,094 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have 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:27:08,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:27:08,183 INFO L93 Difference]: Finished difference Result 40 states and 54 transitions. [2022-02-20 14:27:08,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:27:08,184 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 14:27:08,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:27:08,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have 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:27:08,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-02-20 14:27:08,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have 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:27:08,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-02-20 14:27:08,186 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 54 transitions. [2022-02-20 14:27:08,253 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:27:08,255 INFO L225 Difference]: With dead ends: 40 [2022-02-20 14:27:08,256 INFO L226 Difference]: Without dead ends: 31 [2022-02-20 14:27:08,257 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:27:08,258 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 17 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:27:08,261 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 33 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:27:08,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-02-20 14:27:08,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 18. [2022-02-20 14:27:08,265 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:27:08,266 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 18 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 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:27:08,266 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 18 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 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:27:08,267 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 18 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 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:27:08,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:27:08,270 INFO L93 Difference]: Finished difference Result 31 states and 42 transitions. [2022-02-20 14:27:08,270 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2022-02-20 14:27:08,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:27:08,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:27:08,271 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 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 31 states. [2022-02-20 14:27:08,272 INFO L87 Difference]: Start difference. First operand has 18 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 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 31 states. [2022-02-20 14:27:08,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:27:08,275 INFO L93 Difference]: Finished difference Result 31 states and 42 transitions. [2022-02-20 14:27:08,276 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2022-02-20 14:27:08,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:27:08,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:27:08,276 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:27:08,277 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:27:08,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 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:27:08,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2022-02-20 14:27:08,281 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 24 transitions. Word has length 9 [2022-02-20 14:27:08,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:27:08,281 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 24 transitions. [2022-02-20 14:27:08,281 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have 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:27:08,282 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 24 transitions. [2022-02-20 14:27:08,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 14:27:08,282 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:27:08,282 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:27:08,283 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 14:27:08,284 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:27:08,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:27:08,285 INFO L85 PathProgramCache]: Analyzing trace with hash 479393663, now seen corresponding path program 1 times [2022-02-20 14:27:08,285 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:27:08,285 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255570752] [2022-02-20 14:27:08,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:27:08,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:27:08,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:27:08,380 INFO L290 TraceCheckUtils]: 0: Hoare triple {253#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);~#a~0.base, ~#a~0.offset := 3, 0;call #Ultimate.allocInit(4000000, 3);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base); {253#true} is VALID [2022-02-20 14:27:08,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {253#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~post1#1, main_~q~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~short10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~post7#1, main_~s1~0#1.base, main_~s1~0#1.offset, main_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; {253#true} is VALID [2022-02-20 14:27:08,382 INFO L290 TraceCheckUtils]: 2: Hoare triple {253#true} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {253#true} is VALID [2022-02-20 14:27:08,382 INFO L290 TraceCheckUtils]: 3: Hoare triple {253#true} assume 0 == main_~q~0#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~s~0#1.base, main_~s~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int((if main_~q~0#1 < 0 && 0 != main_~q~0#1 % 2 then main_~q~0#1 % 2 - 2 else main_~q~0#1 % 2), main_~s~0#1.base, 4 + main_~s~0#1.offset, 4); {255#(not (= |ULTIMATE.start_main_~s~0#1.base| 0))} is VALID [2022-02-20 14:27:08,383 INFO L290 TraceCheckUtils]: 4: Hoare triple {255#(not (= |ULTIMATE.start_main_~s~0#1.base| 0))} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {254#false} is VALID [2022-02-20 14:27:08,383 INFO L290 TraceCheckUtils]: 5: Hoare triple {254#false} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {254#false} is VALID [2022-02-20 14:27:08,383 INFO L290 TraceCheckUtils]: 6: Hoare triple {254#false} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {254#false} is VALID [2022-02-20 14:27:08,384 INFO L290 TraceCheckUtils]: 7: Hoare triple {254#false} assume !(main_~i~0#1 < 1000000); {254#false} is VALID [2022-02-20 14:27:08,384 INFO L290 TraceCheckUtils]: 8: Hoare triple {254#false} call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(main_#t~malloc6#1.base, main_#t~malloc6#1.offset, ~#a~0.base, 12 + ~#a~0.offset, 4);havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_~i~0#1 := 0; {254#false} is VALID [2022-02-20 14:27:08,385 INFO L290 TraceCheckUtils]: 9: Hoare triple {254#false} assume !!(main_~i~0#1 < 1000000);call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4);main_~s1~0#1.base, main_~s1~0#1.offset := main_#t~mem8#1.base, main_#t~mem8#1.offset;havoc main_#t~mem8#1.base, main_#t~mem8#1.offset;main_#t~short10#1 := 3 != main_~i~0#1 && (main_~s1~0#1.base != 0 || main_~s1~0#1.offset != 0); {254#false} is VALID [2022-02-20 14:27:08,385 INFO L290 TraceCheckUtils]: 10: Hoare triple {254#false} assume !main_#t~short10#1; {254#false} is VALID [2022-02-20 14:27:08,385 INFO L290 TraceCheckUtils]: 11: Hoare triple {254#false} assume main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1;call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~s1~0#1.base, main_~s1~0#1.offset, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem11#1.base != 0 || main_#t~mem11#1.offset != 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {254#false} is VALID [2022-02-20 14:27:08,385 INFO L290 TraceCheckUtils]: 12: Hoare triple {254#false} assume 0 == __VERIFIER_assert_~cond#1; {254#false} is VALID [2022-02-20 14:27:08,386 INFO L290 TraceCheckUtils]: 13: Hoare triple {254#false} assume !false; {254#false} is VALID [2022-02-20 14:27:08,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:27:08,387 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:27:08,387 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255570752] [2022-02-20 14:27:08,387 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255570752] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:27:08,387 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:27:08,388 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:27:08,388 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643584804] [2022-02-20 14:27:08,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:27:08,389 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 14:27:08,389 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:27:08,389 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:27:08,400 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:27:08,400 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:27:08,401 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:27:08,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:27:08,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:27:08,402 INFO L87 Difference]: Start difference. First operand 18 states and 24 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:27:08,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:27:08,455 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2022-02-20 14:27:08,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:27:08,456 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 14:27:08,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:27:08,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:27:08,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2022-02-20 14:27:08,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:27:08,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2022-02-20 14:27:08,458 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 63 transitions. [2022-02-20 14:27:08,527 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:27:08,530 INFO L225 Difference]: With dead ends: 47 [2022-02-20 14:27:08,531 INFO L226 Difference]: Without dead ends: 32 [2022-02-20 14:27:08,533 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:27:08,538 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 17 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:27:08,539 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 49 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:27:08,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-02-20 14:27:08,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 19. [2022-02-20 14:27:08,545 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:27:08,552 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 19 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have 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:27:08,553 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 19 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have 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:27:08,553 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 19 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have 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:27:08,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:27:08,555 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-02-20 14:27:08,555 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-02-20 14:27:08,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:27:08,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:27:08,556 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 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:27:08,556 INFO L87 Difference]: Start difference. First operand has 19 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 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:27:08,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:27:08,559 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-02-20 14:27:08,559 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-02-20 14:27:08,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:27:08,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:27:08,560 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:27:08,560 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:27:08,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have 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:27:08,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2022-02-20 14:27:08,561 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 14 [2022-02-20 14:27:08,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:27:08,562 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2022-02-20 14:27:08,562 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:27:08,562 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2022-02-20 14:27:08,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 14:27:08,563 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:27:08,563 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:27:08,563 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 14:27:08,563 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:27:08,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:27:08,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1180458241, now seen corresponding path program 1 times [2022-02-20 14:27:08,564 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:27:08,565 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801188464] [2022-02-20 14:27:08,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:27:08,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:27:08,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:27:08,637 INFO L290 TraceCheckUtils]: 0: Hoare triple {398#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(19, 2);~#a~0.base, ~#a~0.offset := 3, 0;call #Ultimate.allocInit(4000000, 3);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base); {398#true} is VALID [2022-02-20 14:27:08,652 INFO L290 TraceCheckUtils]: 1: Hoare triple {398#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~post1#1, main_~q~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~short10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~post7#1, main_~s1~0#1.base, main_~s1~0#1.offset, main_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; {400#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:27:08,652 INFO L290 TraceCheckUtils]: 2: Hoare triple {400#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {400#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:27:08,653 INFO L290 TraceCheckUtils]: 3: Hoare triple {400#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(0 == main_~q~0#1); {400#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:27:08,653 INFO L290 TraceCheckUtils]: 4: Hoare triple {400#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {400#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:27:08,653 INFO L290 TraceCheckUtils]: 5: Hoare triple {400#(= |ULTIMATE.start_main_~i~0#1| 0)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {400#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:27:08,654 INFO L290 TraceCheckUtils]: 6: Hoare triple {400#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {401#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:27:08,655 INFO L290 TraceCheckUtils]: 7: Hoare triple {401#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < 1000000); {399#false} is VALID [2022-02-20 14:27:08,655 INFO L290 TraceCheckUtils]: 8: Hoare triple {399#false} call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(main_#t~malloc6#1.base, main_#t~malloc6#1.offset, ~#a~0.base, 12 + ~#a~0.offset, 4);havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_~i~0#1 := 0; {399#false} is VALID [2022-02-20 14:27:08,656 INFO L290 TraceCheckUtils]: 9: Hoare triple {399#false} assume !!(main_~i~0#1 < 1000000);call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4);main_~s1~0#1.base, main_~s1~0#1.offset := main_#t~mem8#1.base, main_#t~mem8#1.offset;havoc main_#t~mem8#1.base, main_#t~mem8#1.offset;main_#t~short10#1 := 3 != main_~i~0#1 && (main_~s1~0#1.base != 0 || main_~s1~0#1.offset != 0); {399#false} is VALID [2022-02-20 14:27:08,656 INFO L290 TraceCheckUtils]: 10: Hoare triple {399#false} assume !main_#t~short10#1; {399#false} is VALID [2022-02-20 14:27:08,656 INFO L290 TraceCheckUtils]: 11: Hoare triple {399#false} assume main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1;call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~s1~0#1.base, main_~s1~0#1.offset, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem11#1.base != 0 || main_#t~mem11#1.offset != 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {399#false} is VALID [2022-02-20 14:27:08,656 INFO L290 TraceCheckUtils]: 12: Hoare triple {399#false} assume 0 == __VERIFIER_assert_~cond#1; {399#false} is VALID [2022-02-20 14:27:08,656 INFO L290 TraceCheckUtils]: 13: Hoare triple {399#false} assume !false; {399#false} is VALID [2022-02-20 14:27:08,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:27:08,657 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:27:08,657 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801188464] [2022-02-20 14:27:08,657 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801188464] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:27:08,658 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038274987] [2022-02-20 14:27:08,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:27:08,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:27:08,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:27:08,660 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:27:08,668 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:27:08,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:27:08,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 14:27:08,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:27:08,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:27:08,784 INFO L290 TraceCheckUtils]: 0: Hoare triple {398#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(19, 2);~#a~0.base, ~#a~0.offset := 3, 0;call #Ultimate.allocInit(4000000, 3);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base); {398#true} is VALID [2022-02-20 14:27:08,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {398#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~post1#1, main_~q~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~short10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~post7#1, main_~s1~0#1.base, main_~s1~0#1.offset, main_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; {398#true} is VALID [2022-02-20 14:27:08,784 INFO L290 TraceCheckUtils]: 2: Hoare triple {398#true} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {398#true} is VALID [2022-02-20 14:27:08,785 INFO L290 TraceCheckUtils]: 3: Hoare triple {398#true} assume !(0 == main_~q~0#1); {398#true} is VALID [2022-02-20 14:27:08,787 INFO L290 TraceCheckUtils]: 4: Hoare triple {398#true} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {398#true} is VALID [2022-02-20 14:27:08,787 INFO L290 TraceCheckUtils]: 5: Hoare triple {398#true} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {398#true} is VALID [2022-02-20 14:27:08,787 INFO L290 TraceCheckUtils]: 6: Hoare triple {398#true} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {398#true} is VALID [2022-02-20 14:27:08,788 INFO L290 TraceCheckUtils]: 7: Hoare triple {398#true} assume !(main_~i~0#1 < 1000000); {398#true} is VALID [2022-02-20 14:27:08,788 INFO L290 TraceCheckUtils]: 8: Hoare triple {398#true} call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(main_#t~malloc6#1.base, main_#t~malloc6#1.offset, ~#a~0.base, 12 + ~#a~0.offset, 4);havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_~i~0#1 := 0; {398#true} is VALID [2022-02-20 14:27:08,789 INFO L290 TraceCheckUtils]: 9: Hoare triple {398#true} assume !!(main_~i~0#1 < 1000000);call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4);main_~s1~0#1.base, main_~s1~0#1.offset := main_#t~mem8#1.base, main_#t~mem8#1.offset;havoc main_#t~mem8#1.base, main_#t~mem8#1.offset;main_#t~short10#1 := 3 != main_~i~0#1 && (main_~s1~0#1.base != 0 || main_~s1~0#1.offset != 0); {398#true} is VALID [2022-02-20 14:27:08,790 INFO L290 TraceCheckUtils]: 10: Hoare triple {398#true} assume !main_#t~short10#1; {435#(not |ULTIMATE.start_main_#t~short10#1|)} is VALID [2022-02-20 14:27:08,790 INFO L290 TraceCheckUtils]: 11: Hoare triple {435#(not |ULTIMATE.start_main_#t~short10#1|)} assume main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1;call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~s1~0#1.base, main_~s1~0#1.offset, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem11#1.base != 0 || main_#t~mem11#1.offset != 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {399#false} is VALID [2022-02-20 14:27:08,790 INFO L290 TraceCheckUtils]: 12: Hoare triple {399#false} assume 0 == __VERIFIER_assert_~cond#1; {399#false} is VALID [2022-02-20 14:27:08,791 INFO L290 TraceCheckUtils]: 13: Hoare triple {399#false} assume !false; {399#false} is VALID [2022-02-20 14:27:08,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 14:27:08,791 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:27:08,791 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038274987] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:27:08,791 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 14:27:08,792 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-02-20 14:27:08,792 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132985961] [2022-02-20 14:27:08,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:27:08,799 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 14:27:08,799 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:27:08,799 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:27:08,808 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:27:08,808 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:27:08,809 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:27:08,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:27:08,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:27:08,810 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:27:08,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:27:08,838 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2022-02-20 14:27:08,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:27:08,838 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 14:27:08,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:27:08,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:27:08,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-02-20 14:27:08,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:27:08,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-02-20 14:27:08,841 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 35 transitions. [2022-02-20 14:27:08,870 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:27:08,873 INFO L225 Difference]: With dead ends: 28 [2022-02-20 14:27:08,873 INFO L226 Difference]: Without dead ends: 20 [2022-02-20 14:27:08,875 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:27:08,877 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:27:08,878 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:27:08,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-02-20 14:27:08,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-02-20 14:27:08,880 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:27:08,881 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have 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:27:08,881 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have 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:27:08,881 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have 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:27:08,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:27:08,883 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2022-02-20 14:27:08,883 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2022-02-20 14:27:08,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:27:08,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:27:08,885 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 0 states have call successors, (0), 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:27:08,886 INFO L87 Difference]: Start difference. First operand has 20 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 0 states have call successors, (0), 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:27:08,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:27:08,887 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2022-02-20 14:27:08,888 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2022-02-20 14:27:08,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:27:08,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:27:08,888 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:27:08,888 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:27:08,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have 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:27:08,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2022-02-20 14:27:08,889 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 26 transitions. Word has length 14 [2022-02-20 14:27:08,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:27:08,889 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 26 transitions. [2022-02-20 14:27:08,889 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:27:08,889 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2022-02-20 14:27:08,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 14:27:08,892 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:27:08,893 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:27:08,913 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:27:09,110 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:27:09,110 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:27:09,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:27:09,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1180398659, now seen corresponding path program 1 times [2022-02-20 14:27:09,111 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:27:09,111 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679512785] [2022-02-20 14:27:09,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:27:09,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:27:09,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:27:09,159 INFO L290 TraceCheckUtils]: 0: Hoare triple {539#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(19, 2);~#a~0.base, ~#a~0.offset := 3, 0;call #Ultimate.allocInit(4000000, 3);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base); {539#true} is VALID [2022-02-20 14:27:09,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {539#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~post1#1, main_~q~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~short10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~post7#1, main_~s1~0#1.base, main_~s1~0#1.offset, main_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; {541#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:27:09,160 INFO L290 TraceCheckUtils]: 2: Hoare triple {541#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {541#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:27:09,161 INFO L290 TraceCheckUtils]: 3: Hoare triple {541#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(0 == main_~q~0#1); {541#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:27:09,161 INFO L290 TraceCheckUtils]: 4: Hoare triple {541#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {541#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:27:09,162 INFO L290 TraceCheckUtils]: 5: Hoare triple {541#(= |ULTIMATE.start_main_~i~0#1| 0)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {541#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:27:09,162 INFO L290 TraceCheckUtils]: 6: Hoare triple {541#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {542#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:27:09,163 INFO L290 TraceCheckUtils]: 7: Hoare triple {542#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < 1000000); {540#false} is VALID [2022-02-20 14:27:09,163 INFO L290 TraceCheckUtils]: 8: Hoare triple {540#false} call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(main_#t~malloc6#1.base, main_#t~malloc6#1.offset, ~#a~0.base, 12 + ~#a~0.offset, 4);havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_~i~0#1 := 0; {540#false} is VALID [2022-02-20 14:27:09,163 INFO L290 TraceCheckUtils]: 9: Hoare triple {540#false} assume !!(main_~i~0#1 < 1000000);call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4);main_~s1~0#1.base, main_~s1~0#1.offset := main_#t~mem8#1.base, main_#t~mem8#1.offset;havoc main_#t~mem8#1.base, main_#t~mem8#1.offset;main_#t~short10#1 := 3 != main_~i~0#1 && (main_~s1~0#1.base != 0 || main_~s1~0#1.offset != 0); {540#false} is VALID [2022-02-20 14:27:09,163 INFO L290 TraceCheckUtils]: 10: Hoare triple {540#false} assume main_#t~short10#1;call main_#t~mem9#1 := read~int(main_~s1~0#1.base, 4 + main_~s1~0#1.offset, 4);main_#t~short10#1 := 0 == main_#t~mem9#1; {540#false} is VALID [2022-02-20 14:27:09,164 INFO L290 TraceCheckUtils]: 11: Hoare triple {540#false} assume main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1;call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~s1~0#1.base, main_~s1~0#1.offset, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem11#1.base != 0 || main_#t~mem11#1.offset != 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {540#false} is VALID [2022-02-20 14:27:09,164 INFO L290 TraceCheckUtils]: 12: Hoare triple {540#false} assume 0 == __VERIFIER_assert_~cond#1; {540#false} is VALID [2022-02-20 14:27:09,164 INFO L290 TraceCheckUtils]: 13: Hoare triple {540#false} assume !false; {540#false} is VALID [2022-02-20 14:27:09,164 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:27:09,165 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:27:09,165 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679512785] [2022-02-20 14:27:09,165 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679512785] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:27:09,165 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450133101] [2022-02-20 14:27:09,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:27:09,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:27:09,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:27:09,180 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:27:09,220 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:27:09,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:27:09,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 14:27:09,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:27:09,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:27:09,406 INFO L290 TraceCheckUtils]: 0: Hoare triple {539#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(19, 2);~#a~0.base, ~#a~0.offset := 3, 0;call #Ultimate.allocInit(4000000, 3);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base); {539#true} is VALID [2022-02-20 14:27:09,407 INFO L290 TraceCheckUtils]: 1: Hoare triple {539#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~post1#1, main_~q~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~short10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~post7#1, main_~s1~0#1.base, main_~s1~0#1.offset, main_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; {549#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:27:09,407 INFO L290 TraceCheckUtils]: 2: Hoare triple {549#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {549#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:27:09,408 INFO L290 TraceCheckUtils]: 3: Hoare triple {549#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(0 == main_~q~0#1); {549#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:27:09,408 INFO L290 TraceCheckUtils]: 4: Hoare triple {549#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {549#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:27:09,409 INFO L290 TraceCheckUtils]: 5: Hoare triple {549#(<= |ULTIMATE.start_main_~i~0#1| 0)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {549#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:27:09,409 INFO L290 TraceCheckUtils]: 6: Hoare triple {549#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {542#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:27:09,410 INFO L290 TraceCheckUtils]: 7: Hoare triple {542#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < 1000000); {540#false} is VALID [2022-02-20 14:27:09,410 INFO L290 TraceCheckUtils]: 8: Hoare triple {540#false} call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(main_#t~malloc6#1.base, main_#t~malloc6#1.offset, ~#a~0.base, 12 + ~#a~0.offset, 4);havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_~i~0#1 := 0; {540#false} is VALID [2022-02-20 14:27:09,410 INFO L290 TraceCheckUtils]: 9: Hoare triple {540#false} assume !!(main_~i~0#1 < 1000000);call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4);main_~s1~0#1.base, main_~s1~0#1.offset := main_#t~mem8#1.base, main_#t~mem8#1.offset;havoc main_#t~mem8#1.base, main_#t~mem8#1.offset;main_#t~short10#1 := 3 != main_~i~0#1 && (main_~s1~0#1.base != 0 || main_~s1~0#1.offset != 0); {540#false} is VALID [2022-02-20 14:27:09,410 INFO L290 TraceCheckUtils]: 10: Hoare triple {540#false} assume main_#t~short10#1;call main_#t~mem9#1 := read~int(main_~s1~0#1.base, 4 + main_~s1~0#1.offset, 4);main_#t~short10#1 := 0 == main_#t~mem9#1; {540#false} is VALID [2022-02-20 14:27:09,410 INFO L290 TraceCheckUtils]: 11: Hoare triple {540#false} assume main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1;call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~s1~0#1.base, main_~s1~0#1.offset, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem11#1.base != 0 || main_#t~mem11#1.offset != 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {540#false} is VALID [2022-02-20 14:27:09,410 INFO L290 TraceCheckUtils]: 12: Hoare triple {540#false} assume 0 == __VERIFIER_assert_~cond#1; {540#false} is VALID [2022-02-20 14:27:09,410 INFO L290 TraceCheckUtils]: 13: Hoare triple {540#false} assume !false; {540#false} is VALID [2022-02-20 14:27:09,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:27:09,410 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:27:09,496 INFO L290 TraceCheckUtils]: 13: Hoare triple {540#false} assume !false; {540#false} is VALID [2022-02-20 14:27:09,497 INFO L290 TraceCheckUtils]: 12: Hoare triple {540#false} assume 0 == __VERIFIER_assert_~cond#1; {540#false} is VALID [2022-02-20 14:27:09,497 INFO L290 TraceCheckUtils]: 11: Hoare triple {540#false} assume main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1;call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~s1~0#1.base, main_~s1~0#1.offset, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem11#1.base != 0 || main_#t~mem11#1.offset != 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {540#false} is VALID [2022-02-20 14:27:09,497 INFO L290 TraceCheckUtils]: 10: Hoare triple {540#false} assume main_#t~short10#1;call main_#t~mem9#1 := read~int(main_~s1~0#1.base, 4 + main_~s1~0#1.offset, 4);main_#t~short10#1 := 0 == main_#t~mem9#1; {540#false} is VALID [2022-02-20 14:27:09,497 INFO L290 TraceCheckUtils]: 9: Hoare triple {540#false} assume !!(main_~i~0#1 < 1000000);call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4);main_~s1~0#1.base, main_~s1~0#1.offset := main_#t~mem8#1.base, main_#t~mem8#1.offset;havoc main_#t~mem8#1.base, main_#t~mem8#1.offset;main_#t~short10#1 := 3 != main_~i~0#1 && (main_~s1~0#1.base != 0 || main_~s1~0#1.offset != 0); {540#false} is VALID [2022-02-20 14:27:09,497 INFO L290 TraceCheckUtils]: 8: Hoare triple {540#false} call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(main_#t~malloc6#1.base, main_#t~malloc6#1.offset, ~#a~0.base, 12 + ~#a~0.offset, 4);havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_~i~0#1 := 0; {540#false} is VALID [2022-02-20 14:27:09,498 INFO L290 TraceCheckUtils]: 7: Hoare triple {604#(< |ULTIMATE.start_main_~i~0#1| 1000000)} assume !(main_~i~0#1 < 1000000); {540#false} is VALID [2022-02-20 14:27:09,498 INFO L290 TraceCheckUtils]: 6: Hoare triple {608#(< |ULTIMATE.start_main_~i~0#1| 999999)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {604#(< |ULTIMATE.start_main_~i~0#1| 1000000)} is VALID [2022-02-20 14:27:09,499 INFO L290 TraceCheckUtils]: 5: Hoare triple {608#(< |ULTIMATE.start_main_~i~0#1| 999999)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {608#(< |ULTIMATE.start_main_~i~0#1| 999999)} is VALID [2022-02-20 14:27:09,499 INFO L290 TraceCheckUtils]: 4: Hoare triple {608#(< |ULTIMATE.start_main_~i~0#1| 999999)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {608#(< |ULTIMATE.start_main_~i~0#1| 999999)} is VALID [2022-02-20 14:27:09,499 INFO L290 TraceCheckUtils]: 3: Hoare triple {608#(< |ULTIMATE.start_main_~i~0#1| 999999)} assume !(0 == main_~q~0#1); {608#(< |ULTIMATE.start_main_~i~0#1| 999999)} is VALID [2022-02-20 14:27:09,500 INFO L290 TraceCheckUtils]: 2: Hoare triple {608#(< |ULTIMATE.start_main_~i~0#1| 999999)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {608#(< |ULTIMATE.start_main_~i~0#1| 999999)} is VALID [2022-02-20 14:27:09,500 INFO L290 TraceCheckUtils]: 1: Hoare triple {539#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~post1#1, main_~q~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~short10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~post7#1, main_~s1~0#1.base, main_~s1~0#1.offset, main_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; {608#(< |ULTIMATE.start_main_~i~0#1| 999999)} is VALID [2022-02-20 14:27:09,500 INFO L290 TraceCheckUtils]: 0: Hoare triple {539#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(19, 2);~#a~0.base, ~#a~0.offset := 3, 0;call #Ultimate.allocInit(4000000, 3);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base); {539#true} is VALID [2022-02-20 14:27:09,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:27:09,501 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450133101] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:27:09,501 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:27:09,501 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-02-20 14:27:09,501 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886106948] [2022-02-20 14:27:09,501 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:27:09,502 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 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 14 [2022-02-20 14:27:09,502 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:27:09,502 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have 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:27:09,527 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:27:09,539 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 14:27:09,539 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:27:09,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 14:27:09,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-02-20 14:27:09,540 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have 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:27:09,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:27:09,707 INFO L93 Difference]: Finished difference Result 79 states and 105 transitions. [2022-02-20 14:27:09,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 14:27:09,707 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 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 14 [2022-02-20 14:27:09,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:27:09,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have 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:27:09,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions. [2022-02-20 14:27:09,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have 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:27:09,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions. [2022-02-20 14:27:09,711 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 96 transitions. [2022-02-20 14:27:09,799 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:27:09,801 INFO L225 Difference]: With dead ends: 79 [2022-02-20 14:27:09,801 INFO L226 Difference]: Without dead ends: 69 [2022-02-20 14:27:09,801 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 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:27:09,802 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 102 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:27:09,802 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 76 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:27:09,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-02-20 14:27:09,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 41. [2022-02-20 14:27:09,808 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:27:09,809 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 41 states, 40 states have (on average 1.4) internal successors, (56), 40 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:27:09,809 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 41 states, 40 states have (on average 1.4) internal successors, (56), 40 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:27:09,809 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 41 states, 40 states have (on average 1.4) internal successors, (56), 40 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:27:09,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:27:09,811 INFO L93 Difference]: Finished difference Result 69 states and 90 transitions. [2022-02-20 14:27:09,811 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 90 transitions. [2022-02-20 14:27:09,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:27:09,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:27:09,812 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 40 states have (on average 1.4) internal successors, (56), 40 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 69 states. [2022-02-20 14:27:09,812 INFO L87 Difference]: Start difference. First operand has 41 states, 40 states have (on average 1.4) internal successors, (56), 40 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 69 states. [2022-02-20 14:27:09,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:27:09,813 INFO L93 Difference]: Finished difference Result 69 states and 90 transitions. [2022-02-20 14:27:09,814 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 90 transitions. [2022-02-20 14:27:09,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:27:09,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:27:09,814 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:27:09,814 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:27:09,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.4) internal successors, (56), 40 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:27:09,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 56 transitions. [2022-02-20 14:27:09,815 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 56 transitions. Word has length 14 [2022-02-20 14:27:09,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:27:09,816 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 56 transitions. [2022-02-20 14:27:09,816 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have 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:27:09,816 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 56 transitions. [2022-02-20 14:27:09,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 14:27:09,816 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:27:09,817 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:27:09,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-20 14:27:10,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:27:10,035 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:27:10,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:27:10,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1702929931, now seen corresponding path program 2 times [2022-02-20 14:27:10,036 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:27:10,036 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959184049] [2022-02-20 14:27:10,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:27:10,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:27:10,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:27:10,142 INFO L290 TraceCheckUtils]: 0: Hoare triple {901#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(19, 2);~#a~0.base, ~#a~0.offset := 3, 0;call #Ultimate.allocInit(4000000, 3);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base); {901#true} is VALID [2022-02-20 14:27:10,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {901#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~post1#1, main_~q~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~short10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~post7#1, main_~s1~0#1.base, main_~s1~0#1.offset, main_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; {903#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:27:10,143 INFO L290 TraceCheckUtils]: 2: Hoare triple {903#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {903#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:27:10,143 INFO L290 TraceCheckUtils]: 3: Hoare triple {903#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(0 == main_~q~0#1); {903#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:27:10,144 INFO L290 TraceCheckUtils]: 4: Hoare triple {903#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {903#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:27:10,144 INFO L290 TraceCheckUtils]: 5: Hoare triple {903#(= |ULTIMATE.start_main_~i~0#1| 0)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {903#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:27:10,144 INFO L290 TraceCheckUtils]: 6: Hoare triple {903#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {904#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:27:10,145 INFO L290 TraceCheckUtils]: 7: Hoare triple {904#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {904#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:27:10,145 INFO L290 TraceCheckUtils]: 8: Hoare triple {904#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(0 == main_~q~0#1); {904#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:27:10,145 INFO L290 TraceCheckUtils]: 9: Hoare triple {904#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {904#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:27:10,146 INFO L290 TraceCheckUtils]: 10: Hoare triple {904#(<= |ULTIMATE.start_main_~i~0#1| 1)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {904#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:27:10,146 INFO L290 TraceCheckUtils]: 11: Hoare triple {904#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {905#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:27:10,147 INFO L290 TraceCheckUtils]: 12: Hoare triple {905#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {905#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:27:10,147 INFO L290 TraceCheckUtils]: 13: Hoare triple {905#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(0 == main_~q~0#1); {905#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:27:10,147 INFO L290 TraceCheckUtils]: 14: Hoare triple {905#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {905#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:27:10,148 INFO L290 TraceCheckUtils]: 15: Hoare triple {905#(<= |ULTIMATE.start_main_~i~0#1| 2)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {905#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:27:10,148 INFO L290 TraceCheckUtils]: 16: Hoare triple {905#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {906#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:27:10,148 INFO L290 TraceCheckUtils]: 17: Hoare triple {906#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {906#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:27:10,149 INFO L290 TraceCheckUtils]: 18: Hoare triple {906#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !(0 == main_~q~0#1); {906#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:27:10,149 INFO L290 TraceCheckUtils]: 19: Hoare triple {906#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {906#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:27:10,149 INFO L290 TraceCheckUtils]: 20: Hoare triple {906#(<= |ULTIMATE.start_main_~i~0#1| 3)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {906#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:27:10,150 INFO L290 TraceCheckUtils]: 21: Hoare triple {906#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {907#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:27:10,150 INFO L290 TraceCheckUtils]: 22: Hoare triple {907#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !(main_~i~0#1 < 1000000); {902#false} is VALID [2022-02-20 14:27:10,150 INFO L290 TraceCheckUtils]: 23: Hoare triple {902#false} call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(main_#t~malloc6#1.base, main_#t~malloc6#1.offset, ~#a~0.base, 12 + ~#a~0.offset, 4);havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_~i~0#1 := 0; {902#false} is VALID [2022-02-20 14:27:10,151 INFO L290 TraceCheckUtils]: 24: Hoare triple {902#false} assume !!(main_~i~0#1 < 1000000);call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4);main_~s1~0#1.base, main_~s1~0#1.offset := main_#t~mem8#1.base, main_#t~mem8#1.offset;havoc main_#t~mem8#1.base, main_#t~mem8#1.offset;main_#t~short10#1 := 3 != main_~i~0#1 && (main_~s1~0#1.base != 0 || main_~s1~0#1.offset != 0); {902#false} is VALID [2022-02-20 14:27:10,151 INFO L290 TraceCheckUtils]: 25: Hoare triple {902#false} assume main_#t~short10#1;call main_#t~mem9#1 := read~int(main_~s1~0#1.base, 4 + main_~s1~0#1.offset, 4);main_#t~short10#1 := 0 == main_#t~mem9#1; {902#false} is VALID [2022-02-20 14:27:10,151 INFO L290 TraceCheckUtils]: 26: Hoare triple {902#false} assume main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1;call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~s1~0#1.base, main_~s1~0#1.offset, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem11#1.base != 0 || main_#t~mem11#1.offset != 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {902#false} is VALID [2022-02-20 14:27:10,151 INFO L290 TraceCheckUtils]: 27: Hoare triple {902#false} assume 0 == __VERIFIER_assert_~cond#1; {902#false} is VALID [2022-02-20 14:27:10,151 INFO L290 TraceCheckUtils]: 28: Hoare triple {902#false} assume !false; {902#false} is VALID [2022-02-20 14:27:10,151 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:27:10,152 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:27:10,152 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959184049] [2022-02-20 14:27:10,152 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959184049] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:27:10,152 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1065706834] [2022-02-20 14:27:10,152 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 14:27:10,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:27:10,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:27:10,153 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:27:10,154 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:27:10,216 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 14:27:10,217 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:27:10,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 14:27:10,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:27:10,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:27:10,372 INFO L290 TraceCheckUtils]: 0: Hoare triple {901#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(19, 2);~#a~0.base, ~#a~0.offset := 3, 0;call #Ultimate.allocInit(4000000, 3);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base); {901#true} is VALID [2022-02-20 14:27:10,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {901#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~post1#1, main_~q~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~short10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~post7#1, main_~s1~0#1.base, main_~s1~0#1.offset, main_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; {914#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:27:10,373 INFO L290 TraceCheckUtils]: 2: Hoare triple {914#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {914#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:27:10,374 INFO L290 TraceCheckUtils]: 3: Hoare triple {914#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(0 == main_~q~0#1); {914#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:27:10,374 INFO L290 TraceCheckUtils]: 4: Hoare triple {914#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {914#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:27:10,374 INFO L290 TraceCheckUtils]: 5: Hoare triple {914#(<= |ULTIMATE.start_main_~i~0#1| 0)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {914#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:27:10,375 INFO L290 TraceCheckUtils]: 6: Hoare triple {914#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {904#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:27:10,375 INFO L290 TraceCheckUtils]: 7: Hoare triple {904#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {904#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:27:10,376 INFO L290 TraceCheckUtils]: 8: Hoare triple {904#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(0 == main_~q~0#1); {904#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:27:10,377 INFO L290 TraceCheckUtils]: 9: Hoare triple {904#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {904#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:27:10,377 INFO L290 TraceCheckUtils]: 10: Hoare triple {904#(<= |ULTIMATE.start_main_~i~0#1| 1)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {904#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:27:10,377 INFO L290 TraceCheckUtils]: 11: Hoare triple {904#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {905#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:27:10,378 INFO L290 TraceCheckUtils]: 12: Hoare triple {905#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {905#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:27:10,378 INFO L290 TraceCheckUtils]: 13: Hoare triple {905#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(0 == main_~q~0#1); {905#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:27:10,378 INFO L290 TraceCheckUtils]: 14: Hoare triple {905#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {905#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:27:10,379 INFO L290 TraceCheckUtils]: 15: Hoare triple {905#(<= |ULTIMATE.start_main_~i~0#1| 2)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {905#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:27:10,379 INFO L290 TraceCheckUtils]: 16: Hoare triple {905#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {906#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:27:10,380 INFO L290 TraceCheckUtils]: 17: Hoare triple {906#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {906#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:27:10,380 INFO L290 TraceCheckUtils]: 18: Hoare triple {906#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !(0 == main_~q~0#1); {906#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:27:10,380 INFO L290 TraceCheckUtils]: 19: Hoare triple {906#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {906#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:27:10,381 INFO L290 TraceCheckUtils]: 20: Hoare triple {906#(<= |ULTIMATE.start_main_~i~0#1| 3)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {906#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:27:10,381 INFO L290 TraceCheckUtils]: 21: Hoare triple {906#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {907#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:27:10,382 INFO L290 TraceCheckUtils]: 22: Hoare triple {907#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !(main_~i~0#1 < 1000000); {902#false} is VALID [2022-02-20 14:27:10,382 INFO L290 TraceCheckUtils]: 23: Hoare triple {902#false} call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(main_#t~malloc6#1.base, main_#t~malloc6#1.offset, ~#a~0.base, 12 + ~#a~0.offset, 4);havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_~i~0#1 := 0; {902#false} is VALID [2022-02-20 14:27:10,382 INFO L290 TraceCheckUtils]: 24: Hoare triple {902#false} assume !!(main_~i~0#1 < 1000000);call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4);main_~s1~0#1.base, main_~s1~0#1.offset := main_#t~mem8#1.base, main_#t~mem8#1.offset;havoc main_#t~mem8#1.base, main_#t~mem8#1.offset;main_#t~short10#1 := 3 != main_~i~0#1 && (main_~s1~0#1.base != 0 || main_~s1~0#1.offset != 0); {902#false} is VALID [2022-02-20 14:27:10,382 INFO L290 TraceCheckUtils]: 25: Hoare triple {902#false} assume main_#t~short10#1;call main_#t~mem9#1 := read~int(main_~s1~0#1.base, 4 + main_~s1~0#1.offset, 4);main_#t~short10#1 := 0 == main_#t~mem9#1; {902#false} is VALID [2022-02-20 14:27:10,382 INFO L290 TraceCheckUtils]: 26: Hoare triple {902#false} assume main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1;call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~s1~0#1.base, main_~s1~0#1.offset, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem11#1.base != 0 || main_#t~mem11#1.offset != 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {902#false} is VALID [2022-02-20 14:27:10,383 INFO L290 TraceCheckUtils]: 27: Hoare triple {902#false} assume 0 == __VERIFIER_assert_~cond#1; {902#false} is VALID [2022-02-20 14:27:10,383 INFO L290 TraceCheckUtils]: 28: Hoare triple {902#false} assume !false; {902#false} is VALID [2022-02-20 14:27:10,383 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:27:10,383 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:27:10,580 INFO L290 TraceCheckUtils]: 28: Hoare triple {902#false} assume !false; {902#false} is VALID [2022-02-20 14:27:10,581 INFO L290 TraceCheckUtils]: 27: Hoare triple {902#false} assume 0 == __VERIFIER_assert_~cond#1; {902#false} is VALID [2022-02-20 14:27:10,581 INFO L290 TraceCheckUtils]: 26: Hoare triple {902#false} assume main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1;call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~s1~0#1.base, main_~s1~0#1.offset, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem11#1.base != 0 || main_#t~mem11#1.offset != 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {902#false} is VALID [2022-02-20 14:27:10,581 INFO L290 TraceCheckUtils]: 25: Hoare triple {902#false} assume main_#t~short10#1;call main_#t~mem9#1 := read~int(main_~s1~0#1.base, 4 + main_~s1~0#1.offset, 4);main_#t~short10#1 := 0 == main_#t~mem9#1; {902#false} is VALID [2022-02-20 14:27:10,581 INFO L290 TraceCheckUtils]: 24: Hoare triple {902#false} assume !!(main_~i~0#1 < 1000000);call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4);main_~s1~0#1.base, main_~s1~0#1.offset := main_#t~mem8#1.base, main_#t~mem8#1.offset;havoc main_#t~mem8#1.base, main_#t~mem8#1.offset;main_#t~short10#1 := 3 != main_~i~0#1 && (main_~s1~0#1.base != 0 || main_~s1~0#1.offset != 0); {902#false} is VALID [2022-02-20 14:27:10,581 INFO L290 TraceCheckUtils]: 23: Hoare triple {902#false} call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(main_#t~malloc6#1.base, main_#t~malloc6#1.offset, ~#a~0.base, 12 + ~#a~0.offset, 4);havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_~i~0#1 := 0; {902#false} is VALID [2022-02-20 14:27:10,581 INFO L290 TraceCheckUtils]: 22: Hoare triple {1014#(< |ULTIMATE.start_main_~i~0#1| 1000000)} assume !(main_~i~0#1 < 1000000); {902#false} is VALID [2022-02-20 14:27:10,582 INFO L290 TraceCheckUtils]: 21: Hoare triple {1018#(< |ULTIMATE.start_main_~i~0#1| 999999)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1014#(< |ULTIMATE.start_main_~i~0#1| 1000000)} is VALID [2022-02-20 14:27:10,582 INFO L290 TraceCheckUtils]: 20: Hoare triple {1018#(< |ULTIMATE.start_main_~i~0#1| 999999)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {1018#(< |ULTIMATE.start_main_~i~0#1| 999999)} is VALID [2022-02-20 14:27:10,583 INFO L290 TraceCheckUtils]: 19: Hoare triple {1018#(< |ULTIMATE.start_main_~i~0#1| 999999)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {1018#(< |ULTIMATE.start_main_~i~0#1| 999999)} is VALID [2022-02-20 14:27:10,583 INFO L290 TraceCheckUtils]: 18: Hoare triple {1018#(< |ULTIMATE.start_main_~i~0#1| 999999)} assume !(0 == main_~q~0#1); {1018#(< |ULTIMATE.start_main_~i~0#1| 999999)} is VALID [2022-02-20 14:27:10,583 INFO L290 TraceCheckUtils]: 17: Hoare triple {1018#(< |ULTIMATE.start_main_~i~0#1| 999999)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {1018#(< |ULTIMATE.start_main_~i~0#1| 999999)} is VALID [2022-02-20 14:27:10,584 INFO L290 TraceCheckUtils]: 16: Hoare triple {1034#(< |ULTIMATE.start_main_~i~0#1| 999998)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1018#(< |ULTIMATE.start_main_~i~0#1| 999999)} is VALID [2022-02-20 14:27:10,584 INFO L290 TraceCheckUtils]: 15: Hoare triple {1034#(< |ULTIMATE.start_main_~i~0#1| 999998)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {1034#(< |ULTIMATE.start_main_~i~0#1| 999998)} is VALID [2022-02-20 14:27:10,584 INFO L290 TraceCheckUtils]: 14: Hoare triple {1034#(< |ULTIMATE.start_main_~i~0#1| 999998)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {1034#(< |ULTIMATE.start_main_~i~0#1| 999998)} is VALID [2022-02-20 14:27:10,585 INFO L290 TraceCheckUtils]: 13: Hoare triple {1034#(< |ULTIMATE.start_main_~i~0#1| 999998)} assume !(0 == main_~q~0#1); {1034#(< |ULTIMATE.start_main_~i~0#1| 999998)} is VALID [2022-02-20 14:27:10,585 INFO L290 TraceCheckUtils]: 12: Hoare triple {1034#(< |ULTIMATE.start_main_~i~0#1| 999998)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {1034#(< |ULTIMATE.start_main_~i~0#1| 999998)} is VALID [2022-02-20 14:27:10,589 INFO L290 TraceCheckUtils]: 11: Hoare triple {1050#(< |ULTIMATE.start_main_~i~0#1| 999997)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1034#(< |ULTIMATE.start_main_~i~0#1| 999998)} is VALID [2022-02-20 14:27:10,590 INFO L290 TraceCheckUtils]: 10: Hoare triple {1050#(< |ULTIMATE.start_main_~i~0#1| 999997)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {1050#(< |ULTIMATE.start_main_~i~0#1| 999997)} is VALID [2022-02-20 14:27:10,591 INFO L290 TraceCheckUtils]: 9: Hoare triple {1050#(< |ULTIMATE.start_main_~i~0#1| 999997)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {1050#(< |ULTIMATE.start_main_~i~0#1| 999997)} is VALID [2022-02-20 14:27:10,591 INFO L290 TraceCheckUtils]: 8: Hoare triple {1050#(< |ULTIMATE.start_main_~i~0#1| 999997)} assume !(0 == main_~q~0#1); {1050#(< |ULTIMATE.start_main_~i~0#1| 999997)} is VALID [2022-02-20 14:27:10,592 INFO L290 TraceCheckUtils]: 7: Hoare triple {1050#(< |ULTIMATE.start_main_~i~0#1| 999997)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {1050#(< |ULTIMATE.start_main_~i~0#1| 999997)} is VALID [2022-02-20 14:27:10,592 INFO L290 TraceCheckUtils]: 6: Hoare triple {1066#(< |ULTIMATE.start_main_~i~0#1| 999996)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1050#(< |ULTIMATE.start_main_~i~0#1| 999997)} is VALID [2022-02-20 14:27:10,593 INFO L290 TraceCheckUtils]: 5: Hoare triple {1066#(< |ULTIMATE.start_main_~i~0#1| 999996)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {1066#(< |ULTIMATE.start_main_~i~0#1| 999996)} is VALID [2022-02-20 14:27:10,593 INFO L290 TraceCheckUtils]: 4: Hoare triple {1066#(< |ULTIMATE.start_main_~i~0#1| 999996)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {1066#(< |ULTIMATE.start_main_~i~0#1| 999996)} is VALID [2022-02-20 14:27:10,596 INFO L290 TraceCheckUtils]: 3: Hoare triple {1066#(< |ULTIMATE.start_main_~i~0#1| 999996)} assume !(0 == main_~q~0#1); {1066#(< |ULTIMATE.start_main_~i~0#1| 999996)} is VALID [2022-02-20 14:27:10,597 INFO L290 TraceCheckUtils]: 2: Hoare triple {1066#(< |ULTIMATE.start_main_~i~0#1| 999996)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {1066#(< |ULTIMATE.start_main_~i~0#1| 999996)} is VALID [2022-02-20 14:27:10,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {901#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~post1#1, main_~q~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~short10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~post7#1, main_~s1~0#1.base, main_~s1~0#1.offset, main_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; {1066#(< |ULTIMATE.start_main_~i~0#1| 999996)} is VALID [2022-02-20 14:27:10,597 INFO L290 TraceCheckUtils]: 0: Hoare triple {901#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(19, 2);~#a~0.base, ~#a~0.offset := 3, 0;call #Ultimate.allocInit(4000000, 3);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base); {901#true} is VALID [2022-02-20 14:27:10,598 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:27:10,598 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1065706834] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:27:10,598 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:27:10,598 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-02-20 14:27:10,598 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954638308] [2022-02-20 14:27:10,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:27:10,599 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 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:27:10,599 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:27:10,599 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have 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:27:10,638 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:27:10,638 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 14:27:10,638 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:27:10,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 14:27:10,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-02-20 14:27:10,639 INFO L87 Difference]: Start difference. First operand 41 states and 56 transitions. Second operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have 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:27:10,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:27:10,977 INFO L93 Difference]: Finished difference Result 175 states and 234 transitions. [2022-02-20 14:27:10,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 14:27:10,977 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 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:27:10,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:27:10,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have 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:27:10,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 213 transitions. [2022-02-20 14:27:10,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have 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:27:10,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 213 transitions. [2022-02-20 14:27:10,982 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 213 transitions. [2022-02-20 14:27:11,136 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 213 edges. 213 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:27:11,140 INFO L225 Difference]: With dead ends: 175 [2022-02-20 14:27:11,141 INFO L226 Difference]: Without dead ends: 165 [2022-02-20 14:27:11,142 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-02-20 14:27:11,142 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 359 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:27:11,142 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [359 Valid, 161 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:27:11,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-02-20 14:27:11,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 83. [2022-02-20 14:27:11,160 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:27:11,160 INFO L82 GeneralOperation]: Start isEquivalent. First operand 165 states. Second operand has 83 states, 82 states have (on average 1.4146341463414633) internal successors, (116), 82 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have 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:27:11,160 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand has 83 states, 82 states have (on average 1.4146341463414633) internal successors, (116), 82 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have 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:27:11,161 INFO L87 Difference]: Start difference. First operand 165 states. Second operand has 83 states, 82 states have (on average 1.4146341463414633) internal successors, (116), 82 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have 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:27:11,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:27:11,164 INFO L93 Difference]: Finished difference Result 165 states and 216 transitions. [2022-02-20 14:27:11,164 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 216 transitions. [2022-02-20 14:27:11,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:27:11,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:27:11,167 INFO L74 IsIncluded]: Start isIncluded. First operand has 83 states, 82 states have (on average 1.4146341463414633) internal successors, (116), 82 states have internal predecessors, (116), 0 states have call successors, (0), 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 165 states. [2022-02-20 14:27:11,167 INFO L87 Difference]: Start difference. First operand has 83 states, 82 states have (on average 1.4146341463414633) internal successors, (116), 82 states have internal predecessors, (116), 0 states have call successors, (0), 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 165 states. [2022-02-20 14:27:11,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:27:11,172 INFO L93 Difference]: Finished difference Result 165 states and 216 transitions. [2022-02-20 14:27:11,172 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 216 transitions. [2022-02-20 14:27:11,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:27:11,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:27:11,173 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:27:11,173 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:27:11,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 82 states have (on average 1.4146341463414633) internal successors, (116), 82 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have 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:27:11,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 116 transitions. [2022-02-20 14:27:11,176 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 116 transitions. Word has length 29 [2022-02-20 14:27:11,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:27:11,177 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 116 transitions. [2022-02-20 14:27:11,177 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have 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:27:11,177 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 116 transitions. [2022-02-20 14:27:11,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 14:27:11,180 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:27:11,180 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:27:11,199 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:27:11,393 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:27:11,394 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:27:11,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:27:11,394 INFO L85 PathProgramCache]: Analyzing trace with hash -389972939, now seen corresponding path program 3 times [2022-02-20 14:27:11,394 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:27:11,394 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939150629] [2022-02-20 14:27:11,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:27:11,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:27:11,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:27:11,607 INFO L290 TraceCheckUtils]: 0: Hoare triple {1707#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(19, 2);~#a~0.base, ~#a~0.offset := 3, 0;call #Ultimate.allocInit(4000000, 3);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base); {1707#true} is VALID [2022-02-20 14:27:11,608 INFO L290 TraceCheckUtils]: 1: Hoare triple {1707#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~post1#1, main_~q~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~short10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~post7#1, main_~s1~0#1.base, main_~s1~0#1.offset, main_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; {1709#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:27:11,609 INFO L290 TraceCheckUtils]: 2: Hoare triple {1709#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {1709#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:27:11,609 INFO L290 TraceCheckUtils]: 3: Hoare triple {1709#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(0 == main_~q~0#1); {1709#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:27:11,610 INFO L290 TraceCheckUtils]: 4: Hoare triple {1709#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {1709#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:27:11,610 INFO L290 TraceCheckUtils]: 5: Hoare triple {1709#(= |ULTIMATE.start_main_~i~0#1| 0)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {1709#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:27:11,611 INFO L290 TraceCheckUtils]: 6: Hoare triple {1709#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1710#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:27:11,611 INFO L290 TraceCheckUtils]: 7: Hoare triple {1710#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {1710#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:27:11,611 INFO L290 TraceCheckUtils]: 8: Hoare triple {1710#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(0 == main_~q~0#1); {1710#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:27:11,612 INFO L290 TraceCheckUtils]: 9: Hoare triple {1710#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {1710#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:27:11,612 INFO L290 TraceCheckUtils]: 10: Hoare triple {1710#(<= |ULTIMATE.start_main_~i~0#1| 1)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {1710#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:27:11,613 INFO L290 TraceCheckUtils]: 11: Hoare triple {1710#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1711#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:27:11,614 INFO L290 TraceCheckUtils]: 12: Hoare triple {1711#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {1711#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:27:11,614 INFO L290 TraceCheckUtils]: 13: Hoare triple {1711#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(0 == main_~q~0#1); {1711#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:27:11,614 INFO L290 TraceCheckUtils]: 14: Hoare triple {1711#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {1711#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:27:11,615 INFO L290 TraceCheckUtils]: 15: Hoare triple {1711#(<= |ULTIMATE.start_main_~i~0#1| 2)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {1711#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:27:11,615 INFO L290 TraceCheckUtils]: 16: Hoare triple {1711#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1712#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:27:11,615 INFO L290 TraceCheckUtils]: 17: Hoare triple {1712#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {1712#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:27:11,616 INFO L290 TraceCheckUtils]: 18: Hoare triple {1712#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !(0 == main_~q~0#1); {1712#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:27:11,616 INFO L290 TraceCheckUtils]: 19: Hoare triple {1712#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {1712#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:27:11,616 INFO L290 TraceCheckUtils]: 20: Hoare triple {1712#(<= |ULTIMATE.start_main_~i~0#1| 3)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {1712#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:27:11,617 INFO L290 TraceCheckUtils]: 21: Hoare triple {1712#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1713#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:27:11,617 INFO L290 TraceCheckUtils]: 22: Hoare triple {1713#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {1713#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:27:11,618 INFO L290 TraceCheckUtils]: 23: Hoare triple {1713#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !(0 == main_~q~0#1); {1713#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:27:11,618 INFO L290 TraceCheckUtils]: 24: Hoare triple {1713#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {1713#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:27:11,618 INFO L290 TraceCheckUtils]: 25: Hoare triple {1713#(<= |ULTIMATE.start_main_~i~0#1| 4)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {1713#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:27:11,619 INFO L290 TraceCheckUtils]: 26: Hoare triple {1713#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1714#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:27:11,619 INFO L290 TraceCheckUtils]: 27: Hoare triple {1714#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {1714#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:27:11,619 INFO L290 TraceCheckUtils]: 28: Hoare triple {1714#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !(0 == main_~q~0#1); {1714#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:27:11,620 INFO L290 TraceCheckUtils]: 29: Hoare triple {1714#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {1714#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:27:11,620 INFO L290 TraceCheckUtils]: 30: Hoare triple {1714#(<= |ULTIMATE.start_main_~i~0#1| 5)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {1714#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:27:11,621 INFO L290 TraceCheckUtils]: 31: Hoare triple {1714#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1715#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:27:11,621 INFO L290 TraceCheckUtils]: 32: Hoare triple {1715#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {1715#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:27:11,621 INFO L290 TraceCheckUtils]: 33: Hoare triple {1715#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !(0 == main_~q~0#1); {1715#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:27:11,622 INFO L290 TraceCheckUtils]: 34: Hoare triple {1715#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {1715#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:27:11,622 INFO L290 TraceCheckUtils]: 35: Hoare triple {1715#(<= |ULTIMATE.start_main_~i~0#1| 6)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {1715#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:27:11,622 INFO L290 TraceCheckUtils]: 36: Hoare triple {1715#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1716#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:27:11,623 INFO L290 TraceCheckUtils]: 37: Hoare triple {1716#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {1716#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:27:11,623 INFO L290 TraceCheckUtils]: 38: Hoare triple {1716#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !(0 == main_~q~0#1); {1716#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:27:11,623 INFO L290 TraceCheckUtils]: 39: Hoare triple {1716#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {1716#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:27:11,624 INFO L290 TraceCheckUtils]: 40: Hoare triple {1716#(<= |ULTIMATE.start_main_~i~0#1| 7)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {1716#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:27:11,624 INFO L290 TraceCheckUtils]: 41: Hoare triple {1716#(<= |ULTIMATE.start_main_~i~0#1| 7)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1717#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:27:11,625 INFO L290 TraceCheckUtils]: 42: Hoare triple {1717#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {1717#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:27:11,625 INFO L290 TraceCheckUtils]: 43: Hoare triple {1717#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !(0 == main_~q~0#1); {1717#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:27:11,626 INFO L290 TraceCheckUtils]: 44: Hoare triple {1717#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {1717#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:27:11,626 INFO L290 TraceCheckUtils]: 45: Hoare triple {1717#(<= |ULTIMATE.start_main_~i~0#1| 8)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {1717#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:27:11,626 INFO L290 TraceCheckUtils]: 46: Hoare triple {1717#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1718#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:27:11,627 INFO L290 TraceCheckUtils]: 47: Hoare triple {1718#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {1718#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:27:11,627 INFO L290 TraceCheckUtils]: 48: Hoare triple {1718#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !(0 == main_~q~0#1); {1718#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:27:11,627 INFO L290 TraceCheckUtils]: 49: Hoare triple {1718#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {1718#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:27:11,628 INFO L290 TraceCheckUtils]: 50: Hoare triple {1718#(<= |ULTIMATE.start_main_~i~0#1| 9)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {1718#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:27:11,628 INFO L290 TraceCheckUtils]: 51: Hoare triple {1718#(<= |ULTIMATE.start_main_~i~0#1| 9)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1719#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:27:11,629 INFO L290 TraceCheckUtils]: 52: Hoare triple {1719#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !(main_~i~0#1 < 1000000); {1708#false} is VALID [2022-02-20 14:27:11,632 INFO L290 TraceCheckUtils]: 53: Hoare triple {1708#false} call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(main_#t~malloc6#1.base, main_#t~malloc6#1.offset, ~#a~0.base, 12 + ~#a~0.offset, 4);havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_~i~0#1 := 0; {1708#false} is VALID [2022-02-20 14:27:11,633 INFO L290 TraceCheckUtils]: 54: Hoare triple {1708#false} assume !!(main_~i~0#1 < 1000000);call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4);main_~s1~0#1.base, main_~s1~0#1.offset := main_#t~mem8#1.base, main_#t~mem8#1.offset;havoc main_#t~mem8#1.base, main_#t~mem8#1.offset;main_#t~short10#1 := 3 != main_~i~0#1 && (main_~s1~0#1.base != 0 || main_~s1~0#1.offset != 0); {1708#false} is VALID [2022-02-20 14:27:11,633 INFO L290 TraceCheckUtils]: 55: Hoare triple {1708#false} assume main_#t~short10#1;call main_#t~mem9#1 := read~int(main_~s1~0#1.base, 4 + main_~s1~0#1.offset, 4);main_#t~short10#1 := 0 == main_#t~mem9#1; {1708#false} is VALID [2022-02-20 14:27:11,634 INFO L290 TraceCheckUtils]: 56: Hoare triple {1708#false} assume main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1;call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~s1~0#1.base, main_~s1~0#1.offset, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem11#1.base != 0 || main_#t~mem11#1.offset != 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1708#false} is VALID [2022-02-20 14:27:11,636 INFO L290 TraceCheckUtils]: 57: Hoare triple {1708#false} assume 0 == __VERIFIER_assert_~cond#1; {1708#false} is VALID [2022-02-20 14:27:11,637 INFO L290 TraceCheckUtils]: 58: Hoare triple {1708#false} assume !false; {1708#false} is VALID [2022-02-20 14:27:11,640 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:27:11,640 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:27:11,640 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939150629] [2022-02-20 14:27:11,640 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939150629] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:27:11,640 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770936284] [2022-02-20 14:27:11,640 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 14:27:11,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:27:11,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:27:11,642 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:27:11,643 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:27:12,323 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-02-20 14:27:12,323 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:27:12,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 14:27:12,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:27:12,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:27:12,657 INFO L290 TraceCheckUtils]: 0: Hoare triple {1707#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(19, 2);~#a~0.base, ~#a~0.offset := 3, 0;call #Ultimate.allocInit(4000000, 3);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base); {1707#true} is VALID [2022-02-20 14:27:12,658 INFO L290 TraceCheckUtils]: 1: Hoare triple {1707#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~post1#1, main_~q~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~short10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~post7#1, main_~s1~0#1.base, main_~s1~0#1.offset, main_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; {1726#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:27:12,658 INFO L290 TraceCheckUtils]: 2: Hoare triple {1726#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {1726#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:27:12,659 INFO L290 TraceCheckUtils]: 3: Hoare triple {1726#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(0 == main_~q~0#1); {1726#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:27:12,659 INFO L290 TraceCheckUtils]: 4: Hoare triple {1726#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {1726#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:27:12,660 INFO L290 TraceCheckUtils]: 5: Hoare triple {1726#(<= |ULTIMATE.start_main_~i~0#1| 0)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {1726#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:27:12,661 INFO L290 TraceCheckUtils]: 6: Hoare triple {1726#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1710#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:27:12,664 INFO L290 TraceCheckUtils]: 7: Hoare triple {1710#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {1710#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:27:12,665 INFO L290 TraceCheckUtils]: 8: Hoare triple {1710#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(0 == main_~q~0#1); {1710#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:27:12,666 INFO L290 TraceCheckUtils]: 9: Hoare triple {1710#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {1710#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:27:12,666 INFO L290 TraceCheckUtils]: 10: Hoare triple {1710#(<= |ULTIMATE.start_main_~i~0#1| 1)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {1710#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:27:12,667 INFO L290 TraceCheckUtils]: 11: Hoare triple {1710#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1711#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:27:12,668 INFO L290 TraceCheckUtils]: 12: Hoare triple {1711#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {1711#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:27:12,668 INFO L290 TraceCheckUtils]: 13: Hoare triple {1711#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(0 == main_~q~0#1); {1711#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:27:12,668 INFO L290 TraceCheckUtils]: 14: Hoare triple {1711#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {1711#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:27:12,669 INFO L290 TraceCheckUtils]: 15: Hoare triple {1711#(<= |ULTIMATE.start_main_~i~0#1| 2)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {1711#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:27:12,669 INFO L290 TraceCheckUtils]: 16: Hoare triple {1711#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1712#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:27:12,669 INFO L290 TraceCheckUtils]: 17: Hoare triple {1712#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {1712#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:27:12,670 INFO L290 TraceCheckUtils]: 18: Hoare triple {1712#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !(0 == main_~q~0#1); {1712#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:27:12,670 INFO L290 TraceCheckUtils]: 19: Hoare triple {1712#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {1712#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:27:12,670 INFO L290 TraceCheckUtils]: 20: Hoare triple {1712#(<= |ULTIMATE.start_main_~i~0#1| 3)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {1712#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:27:12,671 INFO L290 TraceCheckUtils]: 21: Hoare triple {1712#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1713#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:27:12,671 INFO L290 TraceCheckUtils]: 22: Hoare triple {1713#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {1713#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:27:12,671 INFO L290 TraceCheckUtils]: 23: Hoare triple {1713#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !(0 == main_~q~0#1); {1713#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:27:12,672 INFO L290 TraceCheckUtils]: 24: Hoare triple {1713#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {1713#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:27:12,672 INFO L290 TraceCheckUtils]: 25: Hoare triple {1713#(<= |ULTIMATE.start_main_~i~0#1| 4)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {1713#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:27:12,673 INFO L290 TraceCheckUtils]: 26: Hoare triple {1713#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1714#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:27:12,673 INFO L290 TraceCheckUtils]: 27: Hoare triple {1714#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {1714#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:27:12,673 INFO L290 TraceCheckUtils]: 28: Hoare triple {1714#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !(0 == main_~q~0#1); {1714#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:27:12,674 INFO L290 TraceCheckUtils]: 29: Hoare triple {1714#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {1714#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:27:12,674 INFO L290 TraceCheckUtils]: 30: Hoare triple {1714#(<= |ULTIMATE.start_main_~i~0#1| 5)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {1714#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:27:12,675 INFO L290 TraceCheckUtils]: 31: Hoare triple {1714#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1715#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:27:12,675 INFO L290 TraceCheckUtils]: 32: Hoare triple {1715#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {1715#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:27:12,677 INFO L290 TraceCheckUtils]: 33: Hoare triple {1715#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !(0 == main_~q~0#1); {1715#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:27:12,677 INFO L290 TraceCheckUtils]: 34: Hoare triple {1715#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {1715#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:27:12,677 INFO L290 TraceCheckUtils]: 35: Hoare triple {1715#(<= |ULTIMATE.start_main_~i~0#1| 6)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {1715#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:27:12,678 INFO L290 TraceCheckUtils]: 36: Hoare triple {1715#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1716#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:27:12,678 INFO L290 TraceCheckUtils]: 37: Hoare triple {1716#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {1716#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:27:12,679 INFO L290 TraceCheckUtils]: 38: Hoare triple {1716#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !(0 == main_~q~0#1); {1716#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:27:12,679 INFO L290 TraceCheckUtils]: 39: Hoare triple {1716#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {1716#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:27:12,680 INFO L290 TraceCheckUtils]: 40: Hoare triple {1716#(<= |ULTIMATE.start_main_~i~0#1| 7)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {1716#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:27:12,680 INFO L290 TraceCheckUtils]: 41: Hoare triple {1716#(<= |ULTIMATE.start_main_~i~0#1| 7)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1717#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:27:12,681 INFO L290 TraceCheckUtils]: 42: Hoare triple {1717#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {1717#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:27:12,681 INFO L290 TraceCheckUtils]: 43: Hoare triple {1717#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !(0 == main_~q~0#1); {1717#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:27:12,682 INFO L290 TraceCheckUtils]: 44: Hoare triple {1717#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {1717#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:27:12,682 INFO L290 TraceCheckUtils]: 45: Hoare triple {1717#(<= |ULTIMATE.start_main_~i~0#1| 8)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {1717#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:27:12,682 INFO L290 TraceCheckUtils]: 46: Hoare triple {1717#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1718#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:27:12,683 INFO L290 TraceCheckUtils]: 47: Hoare triple {1718#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {1718#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:27:12,683 INFO L290 TraceCheckUtils]: 48: Hoare triple {1718#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !(0 == main_~q~0#1); {1718#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:27:12,684 INFO L290 TraceCheckUtils]: 49: Hoare triple {1718#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {1718#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:27:12,684 INFO L290 TraceCheckUtils]: 50: Hoare triple {1718#(<= |ULTIMATE.start_main_~i~0#1| 9)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {1718#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:27:12,684 INFO L290 TraceCheckUtils]: 51: Hoare triple {1718#(<= |ULTIMATE.start_main_~i~0#1| 9)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1719#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:27:12,685 INFO L290 TraceCheckUtils]: 52: Hoare triple {1719#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !(main_~i~0#1 < 1000000); {1708#false} is VALID [2022-02-20 14:27:12,685 INFO L290 TraceCheckUtils]: 53: Hoare triple {1708#false} call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(main_#t~malloc6#1.base, main_#t~malloc6#1.offset, ~#a~0.base, 12 + ~#a~0.offset, 4);havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_~i~0#1 := 0; {1708#false} is VALID [2022-02-20 14:27:12,685 INFO L290 TraceCheckUtils]: 54: Hoare triple {1708#false} assume !!(main_~i~0#1 < 1000000);call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4);main_~s1~0#1.base, main_~s1~0#1.offset := main_#t~mem8#1.base, main_#t~mem8#1.offset;havoc main_#t~mem8#1.base, main_#t~mem8#1.offset;main_#t~short10#1 := 3 != main_~i~0#1 && (main_~s1~0#1.base != 0 || main_~s1~0#1.offset != 0); {1708#false} is VALID [2022-02-20 14:27:12,685 INFO L290 TraceCheckUtils]: 55: Hoare triple {1708#false} assume main_#t~short10#1;call main_#t~mem9#1 := read~int(main_~s1~0#1.base, 4 + main_~s1~0#1.offset, 4);main_#t~short10#1 := 0 == main_#t~mem9#1; {1708#false} is VALID [2022-02-20 14:27:12,685 INFO L290 TraceCheckUtils]: 56: Hoare triple {1708#false} assume main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1;call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~s1~0#1.base, main_~s1~0#1.offset, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem11#1.base != 0 || main_#t~mem11#1.offset != 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1708#false} is VALID [2022-02-20 14:27:12,685 INFO L290 TraceCheckUtils]: 57: Hoare triple {1708#false} assume 0 == __VERIFIER_assert_~cond#1; {1708#false} is VALID [2022-02-20 14:27:12,686 INFO L290 TraceCheckUtils]: 58: Hoare triple {1708#false} assume !false; {1708#false} is VALID [2022-02-20 14:27:12,686 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:27:12,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:27:13,129 INFO L290 TraceCheckUtils]: 58: Hoare triple {1708#false} assume !false; {1708#false} is VALID [2022-02-20 14:27:13,130 INFO L290 TraceCheckUtils]: 57: Hoare triple {1708#false} assume 0 == __VERIFIER_assert_~cond#1; {1708#false} is VALID [2022-02-20 14:27:13,130 INFO L290 TraceCheckUtils]: 56: Hoare triple {1708#false} assume main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1;call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~s1~0#1.base, main_~s1~0#1.offset, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem11#1.base != 0 || main_#t~mem11#1.offset != 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1708#false} is VALID [2022-02-20 14:27:13,130 INFO L290 TraceCheckUtils]: 55: Hoare triple {1708#false} assume main_#t~short10#1;call main_#t~mem9#1 := read~int(main_~s1~0#1.base, 4 + main_~s1~0#1.offset, 4);main_#t~short10#1 := 0 == main_#t~mem9#1; {1708#false} is VALID [2022-02-20 14:27:13,130 INFO L290 TraceCheckUtils]: 54: Hoare triple {1708#false} assume !!(main_~i~0#1 < 1000000);call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4);main_~s1~0#1.base, main_~s1~0#1.offset := main_#t~mem8#1.base, main_#t~mem8#1.offset;havoc main_#t~mem8#1.base, main_#t~mem8#1.offset;main_#t~short10#1 := 3 != main_~i~0#1 && (main_~s1~0#1.base != 0 || main_~s1~0#1.offset != 0); {1708#false} is VALID [2022-02-20 14:27:13,131 INFO L290 TraceCheckUtils]: 53: Hoare triple {1708#false} call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(main_#t~malloc6#1.base, main_#t~malloc6#1.offset, ~#a~0.base, 12 + ~#a~0.offset, 4);havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_~i~0#1 := 0; {1708#false} is VALID [2022-02-20 14:27:13,131 INFO L290 TraceCheckUtils]: 52: Hoare triple {1916#(< |ULTIMATE.start_main_~i~0#1| 1000000)} assume !(main_~i~0#1 < 1000000); {1708#false} is VALID [2022-02-20 14:27:13,132 INFO L290 TraceCheckUtils]: 51: Hoare triple {1920#(< |ULTIMATE.start_main_~i~0#1| 999999)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1916#(< |ULTIMATE.start_main_~i~0#1| 1000000)} is VALID [2022-02-20 14:27:13,132 INFO L290 TraceCheckUtils]: 50: Hoare triple {1920#(< |ULTIMATE.start_main_~i~0#1| 999999)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {1920#(< |ULTIMATE.start_main_~i~0#1| 999999)} is VALID [2022-02-20 14:27:13,133 INFO L290 TraceCheckUtils]: 49: Hoare triple {1920#(< |ULTIMATE.start_main_~i~0#1| 999999)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {1920#(< |ULTIMATE.start_main_~i~0#1| 999999)} is VALID [2022-02-20 14:27:13,133 INFO L290 TraceCheckUtils]: 48: Hoare triple {1920#(< |ULTIMATE.start_main_~i~0#1| 999999)} assume !(0 == main_~q~0#1); {1920#(< |ULTIMATE.start_main_~i~0#1| 999999)} is VALID [2022-02-20 14:27:13,133 INFO L290 TraceCheckUtils]: 47: Hoare triple {1920#(< |ULTIMATE.start_main_~i~0#1| 999999)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {1920#(< |ULTIMATE.start_main_~i~0#1| 999999)} is VALID [2022-02-20 14:27:13,134 INFO L290 TraceCheckUtils]: 46: Hoare triple {1936#(< |ULTIMATE.start_main_~i~0#1| 999998)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1920#(< |ULTIMATE.start_main_~i~0#1| 999999)} is VALID [2022-02-20 14:27:13,134 INFO L290 TraceCheckUtils]: 45: Hoare triple {1936#(< |ULTIMATE.start_main_~i~0#1| 999998)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {1936#(< |ULTIMATE.start_main_~i~0#1| 999998)} is VALID [2022-02-20 14:27:13,135 INFO L290 TraceCheckUtils]: 44: Hoare triple {1936#(< |ULTIMATE.start_main_~i~0#1| 999998)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {1936#(< |ULTIMATE.start_main_~i~0#1| 999998)} is VALID [2022-02-20 14:27:13,135 INFO L290 TraceCheckUtils]: 43: Hoare triple {1936#(< |ULTIMATE.start_main_~i~0#1| 999998)} assume !(0 == main_~q~0#1); {1936#(< |ULTIMATE.start_main_~i~0#1| 999998)} is VALID [2022-02-20 14:27:13,136 INFO L290 TraceCheckUtils]: 42: Hoare triple {1936#(< |ULTIMATE.start_main_~i~0#1| 999998)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {1936#(< |ULTIMATE.start_main_~i~0#1| 999998)} is VALID [2022-02-20 14:27:13,136 INFO L290 TraceCheckUtils]: 41: Hoare triple {1952#(< |ULTIMATE.start_main_~i~0#1| 999997)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1936#(< |ULTIMATE.start_main_~i~0#1| 999998)} is VALID [2022-02-20 14:27:13,137 INFO L290 TraceCheckUtils]: 40: Hoare triple {1952#(< |ULTIMATE.start_main_~i~0#1| 999997)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {1952#(< |ULTIMATE.start_main_~i~0#1| 999997)} is VALID [2022-02-20 14:27:13,137 INFO L290 TraceCheckUtils]: 39: Hoare triple {1952#(< |ULTIMATE.start_main_~i~0#1| 999997)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {1952#(< |ULTIMATE.start_main_~i~0#1| 999997)} is VALID [2022-02-20 14:27:13,137 INFO L290 TraceCheckUtils]: 38: Hoare triple {1952#(< |ULTIMATE.start_main_~i~0#1| 999997)} assume !(0 == main_~q~0#1); {1952#(< |ULTIMATE.start_main_~i~0#1| 999997)} is VALID [2022-02-20 14:27:13,138 INFO L290 TraceCheckUtils]: 37: Hoare triple {1952#(< |ULTIMATE.start_main_~i~0#1| 999997)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {1952#(< |ULTIMATE.start_main_~i~0#1| 999997)} is VALID [2022-02-20 14:27:13,142 INFO L290 TraceCheckUtils]: 36: Hoare triple {1968#(< |ULTIMATE.start_main_~i~0#1| 999996)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1952#(< |ULTIMATE.start_main_~i~0#1| 999997)} is VALID [2022-02-20 14:27:13,143 INFO L290 TraceCheckUtils]: 35: Hoare triple {1968#(< |ULTIMATE.start_main_~i~0#1| 999996)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {1968#(< |ULTIMATE.start_main_~i~0#1| 999996)} is VALID [2022-02-20 14:27:13,143 INFO L290 TraceCheckUtils]: 34: Hoare triple {1968#(< |ULTIMATE.start_main_~i~0#1| 999996)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {1968#(< |ULTIMATE.start_main_~i~0#1| 999996)} is VALID [2022-02-20 14:27:13,143 INFO L290 TraceCheckUtils]: 33: Hoare triple {1968#(< |ULTIMATE.start_main_~i~0#1| 999996)} assume !(0 == main_~q~0#1); {1968#(< |ULTIMATE.start_main_~i~0#1| 999996)} is VALID [2022-02-20 14:27:13,144 INFO L290 TraceCheckUtils]: 32: Hoare triple {1968#(< |ULTIMATE.start_main_~i~0#1| 999996)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {1968#(< |ULTIMATE.start_main_~i~0#1| 999996)} is VALID [2022-02-20 14:27:13,144 INFO L290 TraceCheckUtils]: 31: Hoare triple {1984#(< |ULTIMATE.start_main_~i~0#1| 999995)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1968#(< |ULTIMATE.start_main_~i~0#1| 999996)} is VALID [2022-02-20 14:27:13,145 INFO L290 TraceCheckUtils]: 30: Hoare triple {1984#(< |ULTIMATE.start_main_~i~0#1| 999995)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {1984#(< |ULTIMATE.start_main_~i~0#1| 999995)} is VALID [2022-02-20 14:27:13,145 INFO L290 TraceCheckUtils]: 29: Hoare triple {1984#(< |ULTIMATE.start_main_~i~0#1| 999995)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {1984#(< |ULTIMATE.start_main_~i~0#1| 999995)} is VALID [2022-02-20 14:27:13,145 INFO L290 TraceCheckUtils]: 28: Hoare triple {1984#(< |ULTIMATE.start_main_~i~0#1| 999995)} assume !(0 == main_~q~0#1); {1984#(< |ULTIMATE.start_main_~i~0#1| 999995)} is VALID [2022-02-20 14:27:13,146 INFO L290 TraceCheckUtils]: 27: Hoare triple {1984#(< |ULTIMATE.start_main_~i~0#1| 999995)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {1984#(< |ULTIMATE.start_main_~i~0#1| 999995)} is VALID [2022-02-20 14:27:13,146 INFO L290 TraceCheckUtils]: 26: Hoare triple {2000#(< |ULTIMATE.start_main_~i~0#1| 999994)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1984#(< |ULTIMATE.start_main_~i~0#1| 999995)} is VALID [2022-02-20 14:27:13,147 INFO L290 TraceCheckUtils]: 25: Hoare triple {2000#(< |ULTIMATE.start_main_~i~0#1| 999994)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {2000#(< |ULTIMATE.start_main_~i~0#1| 999994)} is VALID [2022-02-20 14:27:13,147 INFO L290 TraceCheckUtils]: 24: Hoare triple {2000#(< |ULTIMATE.start_main_~i~0#1| 999994)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {2000#(< |ULTIMATE.start_main_~i~0#1| 999994)} is VALID [2022-02-20 14:27:13,148 INFO L290 TraceCheckUtils]: 23: Hoare triple {2000#(< |ULTIMATE.start_main_~i~0#1| 999994)} assume !(0 == main_~q~0#1); {2000#(< |ULTIMATE.start_main_~i~0#1| 999994)} is VALID [2022-02-20 14:27:13,148 INFO L290 TraceCheckUtils]: 22: Hoare triple {2000#(< |ULTIMATE.start_main_~i~0#1| 999994)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {2000#(< |ULTIMATE.start_main_~i~0#1| 999994)} is VALID [2022-02-20 14:27:13,148 INFO L290 TraceCheckUtils]: 21: Hoare triple {2016#(< |ULTIMATE.start_main_~i~0#1| 999993)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2000#(< |ULTIMATE.start_main_~i~0#1| 999994)} is VALID [2022-02-20 14:27:13,149 INFO L290 TraceCheckUtils]: 20: Hoare triple {2016#(< |ULTIMATE.start_main_~i~0#1| 999993)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {2016#(< |ULTIMATE.start_main_~i~0#1| 999993)} is VALID [2022-02-20 14:27:13,149 INFO L290 TraceCheckUtils]: 19: Hoare triple {2016#(< |ULTIMATE.start_main_~i~0#1| 999993)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {2016#(< |ULTIMATE.start_main_~i~0#1| 999993)} is VALID [2022-02-20 14:27:13,150 INFO L290 TraceCheckUtils]: 18: Hoare triple {2016#(< |ULTIMATE.start_main_~i~0#1| 999993)} assume !(0 == main_~q~0#1); {2016#(< |ULTIMATE.start_main_~i~0#1| 999993)} is VALID [2022-02-20 14:27:13,150 INFO L290 TraceCheckUtils]: 17: Hoare triple {2016#(< |ULTIMATE.start_main_~i~0#1| 999993)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {2016#(< |ULTIMATE.start_main_~i~0#1| 999993)} is VALID [2022-02-20 14:27:13,151 INFO L290 TraceCheckUtils]: 16: Hoare triple {2032#(< |ULTIMATE.start_main_~i~0#1| 999992)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2016#(< |ULTIMATE.start_main_~i~0#1| 999993)} is VALID [2022-02-20 14:27:13,151 INFO L290 TraceCheckUtils]: 15: Hoare triple {2032#(< |ULTIMATE.start_main_~i~0#1| 999992)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {2032#(< |ULTIMATE.start_main_~i~0#1| 999992)} is VALID [2022-02-20 14:27:13,151 INFO L290 TraceCheckUtils]: 14: Hoare triple {2032#(< |ULTIMATE.start_main_~i~0#1| 999992)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {2032#(< |ULTIMATE.start_main_~i~0#1| 999992)} is VALID [2022-02-20 14:27:13,152 INFO L290 TraceCheckUtils]: 13: Hoare triple {2032#(< |ULTIMATE.start_main_~i~0#1| 999992)} assume !(0 == main_~q~0#1); {2032#(< |ULTIMATE.start_main_~i~0#1| 999992)} is VALID [2022-02-20 14:27:13,152 INFO L290 TraceCheckUtils]: 12: Hoare triple {2032#(< |ULTIMATE.start_main_~i~0#1| 999992)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {2032#(< |ULTIMATE.start_main_~i~0#1| 999992)} is VALID [2022-02-20 14:27:13,153 INFO L290 TraceCheckUtils]: 11: Hoare triple {2048#(< |ULTIMATE.start_main_~i~0#1| 999991)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2032#(< |ULTIMATE.start_main_~i~0#1| 999992)} is VALID [2022-02-20 14:27:13,153 INFO L290 TraceCheckUtils]: 10: Hoare triple {2048#(< |ULTIMATE.start_main_~i~0#1| 999991)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {2048#(< |ULTIMATE.start_main_~i~0#1| 999991)} is VALID [2022-02-20 14:27:13,153 INFO L290 TraceCheckUtils]: 9: Hoare triple {2048#(< |ULTIMATE.start_main_~i~0#1| 999991)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {2048#(< |ULTIMATE.start_main_~i~0#1| 999991)} is VALID [2022-02-20 14:27:13,154 INFO L290 TraceCheckUtils]: 8: Hoare triple {2048#(< |ULTIMATE.start_main_~i~0#1| 999991)} assume !(0 == main_~q~0#1); {2048#(< |ULTIMATE.start_main_~i~0#1| 999991)} is VALID [2022-02-20 14:27:13,154 INFO L290 TraceCheckUtils]: 7: Hoare triple {2048#(< |ULTIMATE.start_main_~i~0#1| 999991)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {2048#(< |ULTIMATE.start_main_~i~0#1| 999991)} is VALID [2022-02-20 14:27:13,155 INFO L290 TraceCheckUtils]: 6: Hoare triple {2064#(< |ULTIMATE.start_main_~i~0#1| 999990)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2048#(< |ULTIMATE.start_main_~i~0#1| 999991)} is VALID [2022-02-20 14:27:13,155 INFO L290 TraceCheckUtils]: 5: Hoare triple {2064#(< |ULTIMATE.start_main_~i~0#1| 999990)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {2064#(< |ULTIMATE.start_main_~i~0#1| 999990)} is VALID [2022-02-20 14:27:13,156 INFO L290 TraceCheckUtils]: 4: Hoare triple {2064#(< |ULTIMATE.start_main_~i~0#1| 999990)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {2064#(< |ULTIMATE.start_main_~i~0#1| 999990)} is VALID [2022-02-20 14:27:13,156 INFO L290 TraceCheckUtils]: 3: Hoare triple {2064#(< |ULTIMATE.start_main_~i~0#1| 999990)} assume !(0 == main_~q~0#1); {2064#(< |ULTIMATE.start_main_~i~0#1| 999990)} is VALID [2022-02-20 14:27:13,156 INFO L290 TraceCheckUtils]: 2: Hoare triple {2064#(< |ULTIMATE.start_main_~i~0#1| 999990)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {2064#(< |ULTIMATE.start_main_~i~0#1| 999990)} is VALID [2022-02-20 14:27:13,157 INFO L290 TraceCheckUtils]: 1: Hoare triple {1707#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~post1#1, main_~q~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~short10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~post7#1, main_~s1~0#1.base, main_~s1~0#1.offset, main_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; {2064#(< |ULTIMATE.start_main_~i~0#1| 999990)} is VALID [2022-02-20 14:27:13,157 INFO L290 TraceCheckUtils]: 0: Hoare triple {1707#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(19, 2);~#a~0.base, ~#a~0.offset := 3, 0;call #Ultimate.allocInit(4000000, 3);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base); {1707#true} is VALID [2022-02-20 14:27:13,157 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:27:13,158 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770936284] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:27:13,158 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:27:13,158 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2022-02-20 14:27:13,158 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571788732] [2022-02-20 14:27:13,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:27:13,158 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 4.68) internal successors, (117), 25 states have internal predecessors, (117), 0 states have call successors, (0), 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 59 [2022-02-20 14:27:13,159 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:27:13,159 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 4.68) internal successors, (117), 25 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have 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:27:13,245 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:27:13,245 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-02-20 14:27:13,245 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:27:13,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-02-20 14:27:13,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2022-02-20 14:27:13,246 INFO L87 Difference]: Start difference. First operand 83 states and 116 transitions. Second operand has 25 states, 25 states have (on average 4.68) internal successors, (117), 25 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have 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:27:14,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:27:14,044 INFO L93 Difference]: Finished difference Result 367 states and 492 transitions. [2022-02-20 14:27:14,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-02-20 14:27:14,044 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 4.68) internal successors, (117), 25 states have internal predecessors, (117), 0 states have call successors, (0), 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 59 [2022-02-20 14:27:14,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:27:14,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 4.68) internal successors, (117), 25 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have 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:27:14,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 447 transitions. [2022-02-20 14:27:14,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 4.68) internal successors, (117), 25 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have 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:27:14,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 447 transitions. [2022-02-20 14:27:14,054 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 447 transitions. [2022-02-20 14:27:14,386 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 447 edges. 447 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:27:14,394 INFO L225 Difference]: With dead ends: 367 [2022-02-20 14:27:14,394 INFO L226 Difference]: Without dead ends: 357 [2022-02-20 14:27:14,395 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 106 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:27:14,395 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 894 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 894 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:27:14,396 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [894 Valid, 329 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:27:14,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2022-02-20 14:27:14,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 167. [2022-02-20 14:27:14,416 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:27:14,416 INFO L82 GeneralOperation]: Start isEquivalent. First operand 357 states. Second operand has 167 states, 166 states have (on average 1.4216867469879517) internal successors, (236), 166 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have 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:27:14,416 INFO L74 IsIncluded]: Start isIncluded. First operand 357 states. Second operand has 167 states, 166 states have (on average 1.4216867469879517) internal successors, (236), 166 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have 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:27:14,417 INFO L87 Difference]: Start difference. First operand 357 states. Second operand has 167 states, 166 states have (on average 1.4216867469879517) internal successors, (236), 166 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have 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:27:14,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:27:14,427 INFO L93 Difference]: Finished difference Result 357 states and 468 transitions. [2022-02-20 14:27:14,428 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 468 transitions. [2022-02-20 14:27:14,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:27:14,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:27:14,429 INFO L74 IsIncluded]: Start isIncluded. First operand has 167 states, 166 states have (on average 1.4216867469879517) internal successors, (236), 166 states have internal predecessors, (236), 0 states have call successors, (0), 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 357 states. [2022-02-20 14:27:14,429 INFO L87 Difference]: Start difference. First operand has 167 states, 166 states have (on average 1.4216867469879517) internal successors, (236), 166 states have internal predecessors, (236), 0 states have call successors, (0), 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 357 states. [2022-02-20 14:27:14,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:27:14,438 INFO L93 Difference]: Finished difference Result 357 states and 468 transitions. [2022-02-20 14:27:14,438 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 468 transitions. [2022-02-20 14:27:14,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:27:14,439 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:27:14,439 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:27:14,439 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:27:14,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 166 states have (on average 1.4216867469879517) internal successors, (236), 166 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have 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:27:14,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 236 transitions. [2022-02-20 14:27:14,444 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 236 transitions. Word has length 59 [2022-02-20 14:27:14,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:27:14,444 INFO L470 AbstractCegarLoop]: Abstraction has 167 states and 236 transitions. [2022-02-20 14:27:14,445 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 4.68) internal successors, (117), 25 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have 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:27:14,445 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 236 transitions. [2022-02-20 14:27:14,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-02-20 14:27:14,446 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:27:14,446 INFO L514 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:27:14,465 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:27:14,659 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:27:14,660 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:27:14,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:27:14,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1749643445, now seen corresponding path program 4 times [2022-02-20 14:27:14,660 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:27:14,660 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360841182] [2022-02-20 14:27:14,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:27:14,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:27:14,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:27:15,053 INFO L290 TraceCheckUtils]: 0: Hoare triple {3401#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(19, 2);~#a~0.base, ~#a~0.offset := 3, 0;call #Ultimate.allocInit(4000000, 3);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base); {3401#true} is VALID [2022-02-20 14:27:15,054 INFO L290 TraceCheckUtils]: 1: Hoare triple {3401#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~post1#1, main_~q~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~short10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~post7#1, main_~s1~0#1.base, main_~s1~0#1.offset, main_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; {3403#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:27:15,054 INFO L290 TraceCheckUtils]: 2: Hoare triple {3403#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {3403#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:27:15,055 INFO L290 TraceCheckUtils]: 3: Hoare triple {3403#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(0 == main_~q~0#1); {3403#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:27:15,055 INFO L290 TraceCheckUtils]: 4: Hoare triple {3403#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {3403#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:27:15,056 INFO L290 TraceCheckUtils]: 5: Hoare triple {3403#(= |ULTIMATE.start_main_~i~0#1| 0)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {3403#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:27:15,057 INFO L290 TraceCheckUtils]: 6: Hoare triple {3403#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3404#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:27:15,057 INFO L290 TraceCheckUtils]: 7: Hoare triple {3404#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {3404#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:27:15,060 INFO L290 TraceCheckUtils]: 8: Hoare triple {3404#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(0 == main_~q~0#1); {3404#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:27:15,060 INFO L290 TraceCheckUtils]: 9: Hoare triple {3404#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {3404#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:27:15,061 INFO L290 TraceCheckUtils]: 10: Hoare triple {3404#(<= |ULTIMATE.start_main_~i~0#1| 1)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {3404#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:27:15,061 INFO L290 TraceCheckUtils]: 11: Hoare triple {3404#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3405#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:27:15,061 INFO L290 TraceCheckUtils]: 12: Hoare triple {3405#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {3405#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:27:15,062 INFO L290 TraceCheckUtils]: 13: Hoare triple {3405#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(0 == main_~q~0#1); {3405#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:27:15,062 INFO L290 TraceCheckUtils]: 14: Hoare triple {3405#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {3405#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:27:15,074 INFO L290 TraceCheckUtils]: 15: Hoare triple {3405#(<= |ULTIMATE.start_main_~i~0#1| 2)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {3405#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:27:15,075 INFO L290 TraceCheckUtils]: 16: Hoare triple {3405#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3406#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:27:15,075 INFO L290 TraceCheckUtils]: 17: Hoare triple {3406#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {3406#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:27:15,075 INFO L290 TraceCheckUtils]: 18: Hoare triple {3406#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !(0 == main_~q~0#1); {3406#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:27:15,076 INFO L290 TraceCheckUtils]: 19: Hoare triple {3406#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {3406#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:27:15,076 INFO L290 TraceCheckUtils]: 20: Hoare triple {3406#(<= |ULTIMATE.start_main_~i~0#1| 3)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {3406#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:27:15,078 INFO L290 TraceCheckUtils]: 21: Hoare triple {3406#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3407#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:27:15,078 INFO L290 TraceCheckUtils]: 22: Hoare triple {3407#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {3407#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:27:15,078 INFO L290 TraceCheckUtils]: 23: Hoare triple {3407#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !(0 == main_~q~0#1); {3407#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:27:15,078 INFO L290 TraceCheckUtils]: 24: Hoare triple {3407#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {3407#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:27:15,079 INFO L290 TraceCheckUtils]: 25: Hoare triple {3407#(<= |ULTIMATE.start_main_~i~0#1| 4)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {3407#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:27:15,079 INFO L290 TraceCheckUtils]: 26: Hoare triple {3407#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3408#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:27:15,079 INFO L290 TraceCheckUtils]: 27: Hoare triple {3408#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {3408#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:27:15,080 INFO L290 TraceCheckUtils]: 28: Hoare triple {3408#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !(0 == main_~q~0#1); {3408#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:27:15,080 INFO L290 TraceCheckUtils]: 29: Hoare triple {3408#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {3408#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:27:15,080 INFO L290 TraceCheckUtils]: 30: Hoare triple {3408#(<= |ULTIMATE.start_main_~i~0#1| 5)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {3408#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:27:15,081 INFO L290 TraceCheckUtils]: 31: Hoare triple {3408#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3409#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:27:15,081 INFO L290 TraceCheckUtils]: 32: Hoare triple {3409#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {3409#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:27:15,081 INFO L290 TraceCheckUtils]: 33: Hoare triple {3409#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !(0 == main_~q~0#1); {3409#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:27:15,081 INFO L290 TraceCheckUtils]: 34: Hoare triple {3409#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {3409#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:27:15,082 INFO L290 TraceCheckUtils]: 35: Hoare triple {3409#(<= |ULTIMATE.start_main_~i~0#1| 6)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {3409#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:27:15,082 INFO L290 TraceCheckUtils]: 36: Hoare triple {3409#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3410#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:27:15,082 INFO L290 TraceCheckUtils]: 37: Hoare triple {3410#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {3410#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:27:15,083 INFO L290 TraceCheckUtils]: 38: Hoare triple {3410#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !(0 == main_~q~0#1); {3410#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:27:15,083 INFO L290 TraceCheckUtils]: 39: Hoare triple {3410#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {3410#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:27:15,083 INFO L290 TraceCheckUtils]: 40: Hoare triple {3410#(<= |ULTIMATE.start_main_~i~0#1| 7)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {3410#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:27:15,084 INFO L290 TraceCheckUtils]: 41: Hoare triple {3410#(<= |ULTIMATE.start_main_~i~0#1| 7)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3411#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:27:15,084 INFO L290 TraceCheckUtils]: 42: Hoare triple {3411#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {3411#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:27:15,087 INFO L290 TraceCheckUtils]: 43: Hoare triple {3411#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !(0 == main_~q~0#1); {3411#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:27:15,088 INFO L290 TraceCheckUtils]: 44: Hoare triple {3411#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {3411#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:27:15,088 INFO L290 TraceCheckUtils]: 45: Hoare triple {3411#(<= |ULTIMATE.start_main_~i~0#1| 8)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {3411#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:27:15,089 INFO L290 TraceCheckUtils]: 46: Hoare triple {3411#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3412#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:27:15,089 INFO L290 TraceCheckUtils]: 47: Hoare triple {3412#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {3412#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:27:15,089 INFO L290 TraceCheckUtils]: 48: Hoare triple {3412#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !(0 == main_~q~0#1); {3412#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:27:15,090 INFO L290 TraceCheckUtils]: 49: Hoare triple {3412#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {3412#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:27:15,091 INFO L290 TraceCheckUtils]: 50: Hoare triple {3412#(<= |ULTIMATE.start_main_~i~0#1| 9)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {3412#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:27:15,091 INFO L290 TraceCheckUtils]: 51: Hoare triple {3412#(<= |ULTIMATE.start_main_~i~0#1| 9)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3413#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:27:15,091 INFO L290 TraceCheckUtils]: 52: Hoare triple {3413#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {3413#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:27:15,092 INFO L290 TraceCheckUtils]: 53: Hoare triple {3413#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !(0 == main_~q~0#1); {3413#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:27:15,092 INFO L290 TraceCheckUtils]: 54: Hoare triple {3413#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {3413#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:27:15,092 INFO L290 TraceCheckUtils]: 55: Hoare triple {3413#(<= |ULTIMATE.start_main_~i~0#1| 10)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {3413#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:27:15,093 INFO L290 TraceCheckUtils]: 56: Hoare triple {3413#(<= |ULTIMATE.start_main_~i~0#1| 10)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3414#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-20 14:27:15,093 INFO L290 TraceCheckUtils]: 57: Hoare triple {3414#(<= |ULTIMATE.start_main_~i~0#1| 11)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {3414#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-20 14:27:15,093 INFO L290 TraceCheckUtils]: 58: Hoare triple {3414#(<= |ULTIMATE.start_main_~i~0#1| 11)} assume !(0 == main_~q~0#1); {3414#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-20 14:27:15,094 INFO L290 TraceCheckUtils]: 59: Hoare triple {3414#(<= |ULTIMATE.start_main_~i~0#1| 11)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {3414#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-20 14:27:15,094 INFO L290 TraceCheckUtils]: 60: Hoare triple {3414#(<= |ULTIMATE.start_main_~i~0#1| 11)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {3414#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-20 14:27:15,094 INFO L290 TraceCheckUtils]: 61: Hoare triple {3414#(<= |ULTIMATE.start_main_~i~0#1| 11)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3415#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 14:27:15,095 INFO L290 TraceCheckUtils]: 62: Hoare triple {3415#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {3415#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 14:27:15,095 INFO L290 TraceCheckUtils]: 63: Hoare triple {3415#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume !(0 == main_~q~0#1); {3415#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 14:27:15,095 INFO L290 TraceCheckUtils]: 64: Hoare triple {3415#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {3415#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 14:27:15,096 INFO L290 TraceCheckUtils]: 65: Hoare triple {3415#(<= |ULTIMATE.start_main_~i~0#1| 12)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {3415#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 14:27:15,096 INFO L290 TraceCheckUtils]: 66: Hoare triple {3415#(<= |ULTIMATE.start_main_~i~0#1| 12)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3416#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-20 14:27:15,097 INFO L290 TraceCheckUtils]: 67: Hoare triple {3416#(<= |ULTIMATE.start_main_~i~0#1| 13)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {3416#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-20 14:27:15,098 INFO L290 TraceCheckUtils]: 68: Hoare triple {3416#(<= |ULTIMATE.start_main_~i~0#1| 13)} assume !(0 == main_~q~0#1); {3416#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-20 14:27:15,098 INFO L290 TraceCheckUtils]: 69: Hoare triple {3416#(<= |ULTIMATE.start_main_~i~0#1| 13)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {3416#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-20 14:27:15,098 INFO L290 TraceCheckUtils]: 70: Hoare triple {3416#(<= |ULTIMATE.start_main_~i~0#1| 13)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {3416#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-20 14:27:15,099 INFO L290 TraceCheckUtils]: 71: Hoare triple {3416#(<= |ULTIMATE.start_main_~i~0#1| 13)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3417#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 14:27:15,099 INFO L290 TraceCheckUtils]: 72: Hoare triple {3417#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {3417#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 14:27:15,099 INFO L290 TraceCheckUtils]: 73: Hoare triple {3417#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume !(0 == main_~q~0#1); {3417#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 14:27:15,100 INFO L290 TraceCheckUtils]: 74: Hoare triple {3417#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {3417#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 14:27:15,100 INFO L290 TraceCheckUtils]: 75: Hoare triple {3417#(<= |ULTIMATE.start_main_~i~0#1| 14)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {3417#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 14:27:15,100 INFO L290 TraceCheckUtils]: 76: Hoare triple {3417#(<= |ULTIMATE.start_main_~i~0#1| 14)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3418#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-20 14:27:15,101 INFO L290 TraceCheckUtils]: 77: Hoare triple {3418#(<= |ULTIMATE.start_main_~i~0#1| 15)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {3418#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-20 14:27:15,101 INFO L290 TraceCheckUtils]: 78: Hoare triple {3418#(<= |ULTIMATE.start_main_~i~0#1| 15)} assume !(0 == main_~q~0#1); {3418#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-20 14:27:15,101 INFO L290 TraceCheckUtils]: 79: Hoare triple {3418#(<= |ULTIMATE.start_main_~i~0#1| 15)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {3418#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-20 14:27:15,102 INFO L290 TraceCheckUtils]: 80: Hoare triple {3418#(<= |ULTIMATE.start_main_~i~0#1| 15)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {3418#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-20 14:27:15,102 INFO L290 TraceCheckUtils]: 81: Hoare triple {3418#(<= |ULTIMATE.start_main_~i~0#1| 15)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3419#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 14:27:15,102 INFO L290 TraceCheckUtils]: 82: Hoare triple {3419#(<= |ULTIMATE.start_main_~i~0#1| 16)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {3419#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 14:27:15,103 INFO L290 TraceCheckUtils]: 83: Hoare triple {3419#(<= |ULTIMATE.start_main_~i~0#1| 16)} assume !(0 == main_~q~0#1); {3419#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 14:27:15,103 INFO L290 TraceCheckUtils]: 84: Hoare triple {3419#(<= |ULTIMATE.start_main_~i~0#1| 16)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {3419#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 14:27:15,103 INFO L290 TraceCheckUtils]: 85: Hoare triple {3419#(<= |ULTIMATE.start_main_~i~0#1| 16)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {3419#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 14:27:15,104 INFO L290 TraceCheckUtils]: 86: Hoare triple {3419#(<= |ULTIMATE.start_main_~i~0#1| 16)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3420#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-20 14:27:15,104 INFO L290 TraceCheckUtils]: 87: Hoare triple {3420#(<= |ULTIMATE.start_main_~i~0#1| 17)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {3420#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-20 14:27:15,104 INFO L290 TraceCheckUtils]: 88: Hoare triple {3420#(<= |ULTIMATE.start_main_~i~0#1| 17)} assume !(0 == main_~q~0#1); {3420#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-20 14:27:15,105 INFO L290 TraceCheckUtils]: 89: Hoare triple {3420#(<= |ULTIMATE.start_main_~i~0#1| 17)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {3420#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-20 14:27:15,105 INFO L290 TraceCheckUtils]: 90: Hoare triple {3420#(<= |ULTIMATE.start_main_~i~0#1| 17)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {3420#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-20 14:27:15,105 INFO L290 TraceCheckUtils]: 91: Hoare triple {3420#(<= |ULTIMATE.start_main_~i~0#1| 17)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3421#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 14:27:15,106 INFO L290 TraceCheckUtils]: 92: Hoare triple {3421#(<= |ULTIMATE.start_main_~i~0#1| 18)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {3421#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 14:27:15,106 INFO L290 TraceCheckUtils]: 93: Hoare triple {3421#(<= |ULTIMATE.start_main_~i~0#1| 18)} assume !(0 == main_~q~0#1); {3421#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 14:27:15,106 INFO L290 TraceCheckUtils]: 94: Hoare triple {3421#(<= |ULTIMATE.start_main_~i~0#1| 18)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {3421#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 14:27:15,107 INFO L290 TraceCheckUtils]: 95: Hoare triple {3421#(<= |ULTIMATE.start_main_~i~0#1| 18)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {3421#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 14:27:15,107 INFO L290 TraceCheckUtils]: 96: Hoare triple {3421#(<= |ULTIMATE.start_main_~i~0#1| 18)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3422#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-20 14:27:15,107 INFO L290 TraceCheckUtils]: 97: Hoare triple {3422#(<= |ULTIMATE.start_main_~i~0#1| 19)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {3422#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-20 14:27:15,108 INFO L290 TraceCheckUtils]: 98: Hoare triple {3422#(<= |ULTIMATE.start_main_~i~0#1| 19)} assume !(0 == main_~q~0#1); {3422#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-20 14:27:15,108 INFO L290 TraceCheckUtils]: 99: Hoare triple {3422#(<= |ULTIMATE.start_main_~i~0#1| 19)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {3422#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-20 14:27:15,108 INFO L290 TraceCheckUtils]: 100: Hoare triple {3422#(<= |ULTIMATE.start_main_~i~0#1| 19)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {3422#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-20 14:27:15,109 INFO L290 TraceCheckUtils]: 101: Hoare triple {3422#(<= |ULTIMATE.start_main_~i~0#1| 19)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3423#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 14:27:15,109 INFO L290 TraceCheckUtils]: 102: Hoare triple {3423#(<= |ULTIMATE.start_main_~i~0#1| 20)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {3423#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 14:27:15,109 INFO L290 TraceCheckUtils]: 103: Hoare triple {3423#(<= |ULTIMATE.start_main_~i~0#1| 20)} assume !(0 == main_~q~0#1); {3423#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 14:27:15,109 INFO L290 TraceCheckUtils]: 104: Hoare triple {3423#(<= |ULTIMATE.start_main_~i~0#1| 20)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {3423#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 14:27:15,110 INFO L290 TraceCheckUtils]: 105: Hoare triple {3423#(<= |ULTIMATE.start_main_~i~0#1| 20)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {3423#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 14:27:15,110 INFO L290 TraceCheckUtils]: 106: Hoare triple {3423#(<= |ULTIMATE.start_main_~i~0#1| 20)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3424#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-20 14:27:15,110 INFO L290 TraceCheckUtils]: 107: Hoare triple {3424#(<= |ULTIMATE.start_main_~i~0#1| 21)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {3424#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-20 14:27:15,111 INFO L290 TraceCheckUtils]: 108: Hoare triple {3424#(<= |ULTIMATE.start_main_~i~0#1| 21)} assume !(0 == main_~q~0#1); {3424#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-20 14:27:15,111 INFO L290 TraceCheckUtils]: 109: Hoare triple {3424#(<= |ULTIMATE.start_main_~i~0#1| 21)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {3424#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-20 14:27:15,111 INFO L290 TraceCheckUtils]: 110: Hoare triple {3424#(<= |ULTIMATE.start_main_~i~0#1| 21)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {3424#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-20 14:27:15,112 INFO L290 TraceCheckUtils]: 111: Hoare triple {3424#(<= |ULTIMATE.start_main_~i~0#1| 21)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3425#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-20 14:27:15,112 INFO L290 TraceCheckUtils]: 112: Hoare triple {3425#(<= |ULTIMATE.start_main_~i~0#1| 22)} assume !(main_~i~0#1 < 1000000); {3402#false} is VALID [2022-02-20 14:27:15,112 INFO L290 TraceCheckUtils]: 113: Hoare triple {3402#false} call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(main_#t~malloc6#1.base, main_#t~malloc6#1.offset, ~#a~0.base, 12 + ~#a~0.offset, 4);havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_~i~0#1 := 0; {3402#false} is VALID [2022-02-20 14:27:15,112 INFO L290 TraceCheckUtils]: 114: Hoare triple {3402#false} assume !!(main_~i~0#1 < 1000000);call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4);main_~s1~0#1.base, main_~s1~0#1.offset := main_#t~mem8#1.base, main_#t~mem8#1.offset;havoc main_#t~mem8#1.base, main_#t~mem8#1.offset;main_#t~short10#1 := 3 != main_~i~0#1 && (main_~s1~0#1.base != 0 || main_~s1~0#1.offset != 0); {3402#false} is VALID [2022-02-20 14:27:15,112 INFO L290 TraceCheckUtils]: 115: Hoare triple {3402#false} assume main_#t~short10#1;call main_#t~mem9#1 := read~int(main_~s1~0#1.base, 4 + main_~s1~0#1.offset, 4);main_#t~short10#1 := 0 == main_#t~mem9#1; {3402#false} is VALID [2022-02-20 14:27:15,113 INFO L290 TraceCheckUtils]: 116: Hoare triple {3402#false} assume main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1;call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~s1~0#1.base, main_~s1~0#1.offset, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem11#1.base != 0 || main_#t~mem11#1.offset != 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3402#false} is VALID [2022-02-20 14:27:15,113 INFO L290 TraceCheckUtils]: 117: Hoare triple {3402#false} assume 0 == __VERIFIER_assert_~cond#1; {3402#false} is VALID [2022-02-20 14:27:15,113 INFO L290 TraceCheckUtils]: 118: Hoare triple {3402#false} assume !false; {3402#false} is VALID [2022-02-20 14:27:15,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1177 backedges. 0 proven. 1177 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:27:15,114 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:27:15,114 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360841182] [2022-02-20 14:27:15,114 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360841182] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:27:15,114 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225177246] [2022-02-20 14:27:15,114 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-20 14:27:15,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:27:15,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:27:15,116 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:27:15,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-20 14:27:16,140 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-20 14:27:16,140 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:27:16,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 24 conjunts are in the unsatisfiable core [2022-02-20 14:27:16,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:27:16,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:27:16,741 INFO L290 TraceCheckUtils]: 0: Hoare triple {3401#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(19, 2);~#a~0.base, ~#a~0.offset := 3, 0;call #Ultimate.allocInit(4000000, 3);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base); {3401#true} is VALID [2022-02-20 14:27:16,742 INFO L290 TraceCheckUtils]: 1: Hoare triple {3401#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~post1#1, main_~q~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~short10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~post7#1, main_~s1~0#1.base, main_~s1~0#1.offset, main_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; {3432#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:27:16,742 INFO L290 TraceCheckUtils]: 2: Hoare triple {3432#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {3432#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:27:16,742 INFO L290 TraceCheckUtils]: 3: Hoare triple {3432#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(0 == main_~q~0#1); {3432#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:27:16,743 INFO L290 TraceCheckUtils]: 4: Hoare triple {3432#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {3432#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:27:16,743 INFO L290 TraceCheckUtils]: 5: Hoare triple {3432#(<= |ULTIMATE.start_main_~i~0#1| 0)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {3432#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:27:16,744 INFO L290 TraceCheckUtils]: 6: Hoare triple {3432#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3404#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:27:16,744 INFO L290 TraceCheckUtils]: 7: Hoare triple {3404#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {3404#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:27:16,744 INFO L290 TraceCheckUtils]: 8: Hoare triple {3404#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(0 == main_~q~0#1); {3404#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:27:16,745 INFO L290 TraceCheckUtils]: 9: Hoare triple {3404#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {3404#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:27:16,745 INFO L290 TraceCheckUtils]: 10: Hoare triple {3404#(<= |ULTIMATE.start_main_~i~0#1| 1)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {3404#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:27:16,745 INFO L290 TraceCheckUtils]: 11: Hoare triple {3404#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3405#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:27:16,746 INFO L290 TraceCheckUtils]: 12: Hoare triple {3405#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {3405#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:27:16,746 INFO L290 TraceCheckUtils]: 13: Hoare triple {3405#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(0 == main_~q~0#1); {3405#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:27:16,746 INFO L290 TraceCheckUtils]: 14: Hoare triple {3405#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {3405#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:27:16,747 INFO L290 TraceCheckUtils]: 15: Hoare triple {3405#(<= |ULTIMATE.start_main_~i~0#1| 2)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {3405#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:27:16,747 INFO L290 TraceCheckUtils]: 16: Hoare triple {3405#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3406#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:27:16,748 INFO L290 TraceCheckUtils]: 17: Hoare triple {3406#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {3406#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:27:16,748 INFO L290 TraceCheckUtils]: 18: Hoare triple {3406#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !(0 == main_~q~0#1); {3406#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:27:16,748 INFO L290 TraceCheckUtils]: 19: Hoare triple {3406#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {3406#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:27:16,749 INFO L290 TraceCheckUtils]: 20: Hoare triple {3406#(<= |ULTIMATE.start_main_~i~0#1| 3)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {3406#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:27:16,749 INFO L290 TraceCheckUtils]: 21: Hoare triple {3406#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3407#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:27:16,749 INFO L290 TraceCheckUtils]: 22: Hoare triple {3407#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {3407#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:27:16,750 INFO L290 TraceCheckUtils]: 23: Hoare triple {3407#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !(0 == main_~q~0#1); {3407#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:27:16,750 INFO L290 TraceCheckUtils]: 24: Hoare triple {3407#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {3407#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:27:16,750 INFO L290 TraceCheckUtils]: 25: Hoare triple {3407#(<= |ULTIMATE.start_main_~i~0#1| 4)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {3407#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:27:16,751 INFO L290 TraceCheckUtils]: 26: Hoare triple {3407#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3408#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:27:16,751 INFO L290 TraceCheckUtils]: 27: Hoare triple {3408#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {3408#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:27:16,752 INFO L290 TraceCheckUtils]: 28: Hoare triple {3408#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !(0 == main_~q~0#1); {3408#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:27:16,752 INFO L290 TraceCheckUtils]: 29: Hoare triple {3408#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {3408#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:27:16,752 INFO L290 TraceCheckUtils]: 30: Hoare triple {3408#(<= |ULTIMATE.start_main_~i~0#1| 5)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {3408#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:27:16,753 INFO L290 TraceCheckUtils]: 31: Hoare triple {3408#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3409#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:27:16,753 INFO L290 TraceCheckUtils]: 32: Hoare triple {3409#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {3409#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:27:16,753 INFO L290 TraceCheckUtils]: 33: Hoare triple {3409#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !(0 == main_~q~0#1); {3409#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:27:16,754 INFO L290 TraceCheckUtils]: 34: Hoare triple {3409#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {3409#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:27:16,754 INFO L290 TraceCheckUtils]: 35: Hoare triple {3409#(<= |ULTIMATE.start_main_~i~0#1| 6)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {3409#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:27:16,754 INFO L290 TraceCheckUtils]: 36: Hoare triple {3409#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3410#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:27:16,755 INFO L290 TraceCheckUtils]: 37: Hoare triple {3410#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {3410#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:27:16,755 INFO L290 TraceCheckUtils]: 38: Hoare triple {3410#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !(0 == main_~q~0#1); {3410#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:27:16,755 INFO L290 TraceCheckUtils]: 39: Hoare triple {3410#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {3410#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:27:16,756 INFO L290 TraceCheckUtils]: 40: Hoare triple {3410#(<= |ULTIMATE.start_main_~i~0#1| 7)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {3410#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:27:16,756 INFO L290 TraceCheckUtils]: 41: Hoare triple {3410#(<= |ULTIMATE.start_main_~i~0#1| 7)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3411#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:27:16,757 INFO L290 TraceCheckUtils]: 42: Hoare triple {3411#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {3411#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:27:16,757 INFO L290 TraceCheckUtils]: 43: Hoare triple {3411#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !(0 == main_~q~0#1); {3411#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:27:16,757 INFO L290 TraceCheckUtils]: 44: Hoare triple {3411#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {3411#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:27:16,758 INFO L290 TraceCheckUtils]: 45: Hoare triple {3411#(<= |ULTIMATE.start_main_~i~0#1| 8)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {3411#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:27:16,758 INFO L290 TraceCheckUtils]: 46: Hoare triple {3411#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3412#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:27:16,758 INFO L290 TraceCheckUtils]: 47: Hoare triple {3412#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {3412#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:27:16,759 INFO L290 TraceCheckUtils]: 48: Hoare triple {3412#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !(0 == main_~q~0#1); {3412#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:27:16,759 INFO L290 TraceCheckUtils]: 49: Hoare triple {3412#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {3412#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:27:16,759 INFO L290 TraceCheckUtils]: 50: Hoare triple {3412#(<= |ULTIMATE.start_main_~i~0#1| 9)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {3412#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:27:16,760 INFO L290 TraceCheckUtils]: 51: Hoare triple {3412#(<= |ULTIMATE.start_main_~i~0#1| 9)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3413#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:27:16,760 INFO L290 TraceCheckUtils]: 52: Hoare triple {3413#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {3413#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:27:16,760 INFO L290 TraceCheckUtils]: 53: Hoare triple {3413#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !(0 == main_~q~0#1); {3413#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:27:16,761 INFO L290 TraceCheckUtils]: 54: Hoare triple {3413#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {3413#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:27:16,761 INFO L290 TraceCheckUtils]: 55: Hoare triple {3413#(<= |ULTIMATE.start_main_~i~0#1| 10)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {3413#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:27:16,762 INFO L290 TraceCheckUtils]: 56: Hoare triple {3413#(<= |ULTIMATE.start_main_~i~0#1| 10)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3414#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-20 14:27:16,762 INFO L290 TraceCheckUtils]: 57: Hoare triple {3414#(<= |ULTIMATE.start_main_~i~0#1| 11)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {3414#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-20 14:27:16,762 INFO L290 TraceCheckUtils]: 58: Hoare triple {3414#(<= |ULTIMATE.start_main_~i~0#1| 11)} assume !(0 == main_~q~0#1); {3414#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-20 14:27:16,763 INFO L290 TraceCheckUtils]: 59: Hoare triple {3414#(<= |ULTIMATE.start_main_~i~0#1| 11)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {3414#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-20 14:27:16,763 INFO L290 TraceCheckUtils]: 60: Hoare triple {3414#(<= |ULTIMATE.start_main_~i~0#1| 11)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {3414#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-20 14:27:16,763 INFO L290 TraceCheckUtils]: 61: Hoare triple {3414#(<= |ULTIMATE.start_main_~i~0#1| 11)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3415#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 14:27:16,764 INFO L290 TraceCheckUtils]: 62: Hoare triple {3415#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {3415#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 14:27:16,764 INFO L290 TraceCheckUtils]: 63: Hoare triple {3415#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume !(0 == main_~q~0#1); {3415#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 14:27:16,764 INFO L290 TraceCheckUtils]: 64: Hoare triple {3415#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {3415#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 14:27:16,765 INFO L290 TraceCheckUtils]: 65: Hoare triple {3415#(<= |ULTIMATE.start_main_~i~0#1| 12)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {3415#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 14:27:16,765 INFO L290 TraceCheckUtils]: 66: Hoare triple {3415#(<= |ULTIMATE.start_main_~i~0#1| 12)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3416#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-20 14:27:16,766 INFO L290 TraceCheckUtils]: 67: Hoare triple {3416#(<= |ULTIMATE.start_main_~i~0#1| 13)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {3416#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-20 14:27:16,766 INFO L290 TraceCheckUtils]: 68: Hoare triple {3416#(<= |ULTIMATE.start_main_~i~0#1| 13)} assume !(0 == main_~q~0#1); {3416#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-20 14:27:16,766 INFO L290 TraceCheckUtils]: 69: Hoare triple {3416#(<= |ULTIMATE.start_main_~i~0#1| 13)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {3416#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-20 14:27:16,767 INFO L290 TraceCheckUtils]: 70: Hoare triple {3416#(<= |ULTIMATE.start_main_~i~0#1| 13)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {3416#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-20 14:27:16,767 INFO L290 TraceCheckUtils]: 71: Hoare triple {3416#(<= |ULTIMATE.start_main_~i~0#1| 13)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3417#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 14:27:16,767 INFO L290 TraceCheckUtils]: 72: Hoare triple {3417#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {3417#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 14:27:16,768 INFO L290 TraceCheckUtils]: 73: Hoare triple {3417#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume !(0 == main_~q~0#1); {3417#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 14:27:16,768 INFO L290 TraceCheckUtils]: 74: Hoare triple {3417#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {3417#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 14:27:16,768 INFO L290 TraceCheckUtils]: 75: Hoare triple {3417#(<= |ULTIMATE.start_main_~i~0#1| 14)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {3417#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 14:27:16,769 INFO L290 TraceCheckUtils]: 76: Hoare triple {3417#(<= |ULTIMATE.start_main_~i~0#1| 14)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3418#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-20 14:27:16,769 INFO L290 TraceCheckUtils]: 77: Hoare triple {3418#(<= |ULTIMATE.start_main_~i~0#1| 15)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {3418#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-20 14:27:16,770 INFO L290 TraceCheckUtils]: 78: Hoare triple {3418#(<= |ULTIMATE.start_main_~i~0#1| 15)} assume !(0 == main_~q~0#1); {3418#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-20 14:27:16,770 INFO L290 TraceCheckUtils]: 79: Hoare triple {3418#(<= |ULTIMATE.start_main_~i~0#1| 15)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {3418#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-20 14:27:16,770 INFO L290 TraceCheckUtils]: 80: Hoare triple {3418#(<= |ULTIMATE.start_main_~i~0#1| 15)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {3418#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-20 14:27:16,771 INFO L290 TraceCheckUtils]: 81: Hoare triple {3418#(<= |ULTIMATE.start_main_~i~0#1| 15)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3419#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 14:27:16,771 INFO L290 TraceCheckUtils]: 82: Hoare triple {3419#(<= |ULTIMATE.start_main_~i~0#1| 16)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {3419#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 14:27:16,772 INFO L290 TraceCheckUtils]: 83: Hoare triple {3419#(<= |ULTIMATE.start_main_~i~0#1| 16)} assume !(0 == main_~q~0#1); {3419#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 14:27:16,772 INFO L290 TraceCheckUtils]: 84: Hoare triple {3419#(<= |ULTIMATE.start_main_~i~0#1| 16)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {3419#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 14:27:16,772 INFO L290 TraceCheckUtils]: 85: Hoare triple {3419#(<= |ULTIMATE.start_main_~i~0#1| 16)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {3419#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 14:27:16,773 INFO L290 TraceCheckUtils]: 86: Hoare triple {3419#(<= |ULTIMATE.start_main_~i~0#1| 16)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3420#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-20 14:27:16,773 INFO L290 TraceCheckUtils]: 87: Hoare triple {3420#(<= |ULTIMATE.start_main_~i~0#1| 17)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {3420#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-20 14:27:16,774 INFO L290 TraceCheckUtils]: 88: Hoare triple {3420#(<= |ULTIMATE.start_main_~i~0#1| 17)} assume !(0 == main_~q~0#1); {3420#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-20 14:27:16,774 INFO L290 TraceCheckUtils]: 89: Hoare triple {3420#(<= |ULTIMATE.start_main_~i~0#1| 17)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {3420#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-20 14:27:16,774 INFO L290 TraceCheckUtils]: 90: Hoare triple {3420#(<= |ULTIMATE.start_main_~i~0#1| 17)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {3420#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-20 14:27:16,775 INFO L290 TraceCheckUtils]: 91: Hoare triple {3420#(<= |ULTIMATE.start_main_~i~0#1| 17)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3421#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 14:27:16,775 INFO L290 TraceCheckUtils]: 92: Hoare triple {3421#(<= |ULTIMATE.start_main_~i~0#1| 18)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {3421#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 14:27:16,775 INFO L290 TraceCheckUtils]: 93: Hoare triple {3421#(<= |ULTIMATE.start_main_~i~0#1| 18)} assume !(0 == main_~q~0#1); {3421#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 14:27:16,776 INFO L290 TraceCheckUtils]: 94: Hoare triple {3421#(<= |ULTIMATE.start_main_~i~0#1| 18)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {3421#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 14:27:16,776 INFO L290 TraceCheckUtils]: 95: Hoare triple {3421#(<= |ULTIMATE.start_main_~i~0#1| 18)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {3421#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 14:27:16,777 INFO L290 TraceCheckUtils]: 96: Hoare triple {3421#(<= |ULTIMATE.start_main_~i~0#1| 18)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3422#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-20 14:27:16,777 INFO L290 TraceCheckUtils]: 97: Hoare triple {3422#(<= |ULTIMATE.start_main_~i~0#1| 19)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {3422#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-20 14:27:16,777 INFO L290 TraceCheckUtils]: 98: Hoare triple {3422#(<= |ULTIMATE.start_main_~i~0#1| 19)} assume !(0 == main_~q~0#1); {3422#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-20 14:27:16,778 INFO L290 TraceCheckUtils]: 99: Hoare triple {3422#(<= |ULTIMATE.start_main_~i~0#1| 19)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {3422#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-20 14:27:16,778 INFO L290 TraceCheckUtils]: 100: Hoare triple {3422#(<= |ULTIMATE.start_main_~i~0#1| 19)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {3422#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-20 14:27:16,779 INFO L290 TraceCheckUtils]: 101: Hoare triple {3422#(<= |ULTIMATE.start_main_~i~0#1| 19)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3423#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 14:27:16,779 INFO L290 TraceCheckUtils]: 102: Hoare triple {3423#(<= |ULTIMATE.start_main_~i~0#1| 20)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {3423#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 14:27:16,779 INFO L290 TraceCheckUtils]: 103: Hoare triple {3423#(<= |ULTIMATE.start_main_~i~0#1| 20)} assume !(0 == main_~q~0#1); {3423#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 14:27:16,780 INFO L290 TraceCheckUtils]: 104: Hoare triple {3423#(<= |ULTIMATE.start_main_~i~0#1| 20)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {3423#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 14:27:16,780 INFO L290 TraceCheckUtils]: 105: Hoare triple {3423#(<= |ULTIMATE.start_main_~i~0#1| 20)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {3423#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 14:27:16,780 INFO L290 TraceCheckUtils]: 106: Hoare triple {3423#(<= |ULTIMATE.start_main_~i~0#1| 20)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3424#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-20 14:27:16,781 INFO L290 TraceCheckUtils]: 107: Hoare triple {3424#(<= |ULTIMATE.start_main_~i~0#1| 21)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {3424#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-20 14:27:16,781 INFO L290 TraceCheckUtils]: 108: Hoare triple {3424#(<= |ULTIMATE.start_main_~i~0#1| 21)} assume !(0 == main_~q~0#1); {3424#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-20 14:27:16,782 INFO L290 TraceCheckUtils]: 109: Hoare triple {3424#(<= |ULTIMATE.start_main_~i~0#1| 21)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {3424#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-20 14:27:16,782 INFO L290 TraceCheckUtils]: 110: Hoare triple {3424#(<= |ULTIMATE.start_main_~i~0#1| 21)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {3424#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-20 14:27:16,782 INFO L290 TraceCheckUtils]: 111: Hoare triple {3424#(<= |ULTIMATE.start_main_~i~0#1| 21)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3425#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-20 14:27:16,783 INFO L290 TraceCheckUtils]: 112: Hoare triple {3425#(<= |ULTIMATE.start_main_~i~0#1| 22)} assume !(main_~i~0#1 < 1000000); {3402#false} is VALID [2022-02-20 14:27:16,783 INFO L290 TraceCheckUtils]: 113: Hoare triple {3402#false} call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(main_#t~malloc6#1.base, main_#t~malloc6#1.offset, ~#a~0.base, 12 + ~#a~0.offset, 4);havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_~i~0#1 := 0; {3402#false} is VALID [2022-02-20 14:27:16,783 INFO L290 TraceCheckUtils]: 114: Hoare triple {3402#false} assume !!(main_~i~0#1 < 1000000);call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4);main_~s1~0#1.base, main_~s1~0#1.offset := main_#t~mem8#1.base, main_#t~mem8#1.offset;havoc main_#t~mem8#1.base, main_#t~mem8#1.offset;main_#t~short10#1 := 3 != main_~i~0#1 && (main_~s1~0#1.base != 0 || main_~s1~0#1.offset != 0); {3402#false} is VALID [2022-02-20 14:27:16,783 INFO L290 TraceCheckUtils]: 115: Hoare triple {3402#false} assume main_#t~short10#1;call main_#t~mem9#1 := read~int(main_~s1~0#1.base, 4 + main_~s1~0#1.offset, 4);main_#t~short10#1 := 0 == main_#t~mem9#1; {3402#false} is VALID [2022-02-20 14:27:16,783 INFO L290 TraceCheckUtils]: 116: Hoare triple {3402#false} assume main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1;call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~s1~0#1.base, main_~s1~0#1.offset, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem11#1.base != 0 || main_#t~mem11#1.offset != 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3402#false} is VALID [2022-02-20 14:27:16,784 INFO L290 TraceCheckUtils]: 117: Hoare triple {3402#false} assume 0 == __VERIFIER_assert_~cond#1; {3402#false} is VALID [2022-02-20 14:27:16,784 INFO L290 TraceCheckUtils]: 118: Hoare triple {3402#false} assume !false; {3402#false} is VALID [2022-02-20 14:27:16,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1177 backedges. 0 proven. 1177 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:27:16,785 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:27:17,844 INFO L290 TraceCheckUtils]: 118: Hoare triple {3402#false} assume !false; {3402#false} is VALID [2022-02-20 14:27:17,844 INFO L290 TraceCheckUtils]: 117: Hoare triple {3402#false} assume 0 == __VERIFIER_assert_~cond#1; {3402#false} is VALID [2022-02-20 14:27:17,844 INFO L290 TraceCheckUtils]: 116: Hoare triple {3402#false} assume main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1;call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~s1~0#1.base, main_~s1~0#1.offset, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem11#1.base != 0 || main_#t~mem11#1.offset != 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3402#false} is VALID [2022-02-20 14:27:17,845 INFO L290 TraceCheckUtils]: 115: Hoare triple {3402#false} assume main_#t~short10#1;call main_#t~mem9#1 := read~int(main_~s1~0#1.base, 4 + main_~s1~0#1.offset, 4);main_#t~short10#1 := 0 == main_#t~mem9#1; {3402#false} is VALID [2022-02-20 14:27:17,845 INFO L290 TraceCheckUtils]: 114: Hoare triple {3402#false} assume !!(main_~i~0#1 < 1000000);call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4);main_~s1~0#1.base, main_~s1~0#1.offset := main_#t~mem8#1.base, main_#t~mem8#1.offset;havoc main_#t~mem8#1.base, main_#t~mem8#1.offset;main_#t~short10#1 := 3 != main_~i~0#1 && (main_~s1~0#1.base != 0 || main_~s1~0#1.offset != 0); {3402#false} is VALID [2022-02-20 14:27:17,845 INFO L290 TraceCheckUtils]: 113: Hoare triple {3402#false} call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(main_#t~malloc6#1.base, main_#t~malloc6#1.offset, ~#a~0.base, 12 + ~#a~0.offset, 4);havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_~i~0#1 := 0; {3402#false} is VALID [2022-02-20 14:27:17,845 INFO L290 TraceCheckUtils]: 112: Hoare triple {3802#(< |ULTIMATE.start_main_~i~0#1| 1000000)} assume !(main_~i~0#1 < 1000000); {3402#false} is VALID [2022-02-20 14:27:17,846 INFO L290 TraceCheckUtils]: 111: Hoare triple {3806#(< |ULTIMATE.start_main_~i~0#1| 999999)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3802#(< |ULTIMATE.start_main_~i~0#1| 1000000)} is VALID [2022-02-20 14:27:17,846 INFO L290 TraceCheckUtils]: 110: Hoare triple {3806#(< |ULTIMATE.start_main_~i~0#1| 999999)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {3806#(< |ULTIMATE.start_main_~i~0#1| 999999)} is VALID [2022-02-20 14:27:17,846 INFO L290 TraceCheckUtils]: 109: Hoare triple {3806#(< |ULTIMATE.start_main_~i~0#1| 999999)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {3806#(< |ULTIMATE.start_main_~i~0#1| 999999)} is VALID [2022-02-20 14:27:17,847 INFO L290 TraceCheckUtils]: 108: Hoare triple {3806#(< |ULTIMATE.start_main_~i~0#1| 999999)} assume !(0 == main_~q~0#1); {3806#(< |ULTIMATE.start_main_~i~0#1| 999999)} is VALID [2022-02-20 14:27:17,847 INFO L290 TraceCheckUtils]: 107: Hoare triple {3806#(< |ULTIMATE.start_main_~i~0#1| 999999)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {3806#(< |ULTIMATE.start_main_~i~0#1| 999999)} is VALID [2022-02-20 14:27:17,847 INFO L290 TraceCheckUtils]: 106: Hoare triple {3822#(< |ULTIMATE.start_main_~i~0#1| 999998)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3806#(< |ULTIMATE.start_main_~i~0#1| 999999)} is VALID [2022-02-20 14:27:17,848 INFO L290 TraceCheckUtils]: 105: Hoare triple {3822#(< |ULTIMATE.start_main_~i~0#1| 999998)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {3822#(< |ULTIMATE.start_main_~i~0#1| 999998)} is VALID [2022-02-20 14:27:17,848 INFO L290 TraceCheckUtils]: 104: Hoare triple {3822#(< |ULTIMATE.start_main_~i~0#1| 999998)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {3822#(< |ULTIMATE.start_main_~i~0#1| 999998)} is VALID [2022-02-20 14:27:17,848 INFO L290 TraceCheckUtils]: 103: Hoare triple {3822#(< |ULTIMATE.start_main_~i~0#1| 999998)} assume !(0 == main_~q~0#1); {3822#(< |ULTIMATE.start_main_~i~0#1| 999998)} is VALID [2022-02-20 14:27:17,849 INFO L290 TraceCheckUtils]: 102: Hoare triple {3822#(< |ULTIMATE.start_main_~i~0#1| 999998)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {3822#(< |ULTIMATE.start_main_~i~0#1| 999998)} is VALID [2022-02-20 14:27:17,849 INFO L290 TraceCheckUtils]: 101: Hoare triple {3838#(< |ULTIMATE.start_main_~i~0#1| 999997)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3822#(< |ULTIMATE.start_main_~i~0#1| 999998)} is VALID [2022-02-20 14:27:17,850 INFO L290 TraceCheckUtils]: 100: Hoare triple {3838#(< |ULTIMATE.start_main_~i~0#1| 999997)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {3838#(< |ULTIMATE.start_main_~i~0#1| 999997)} is VALID [2022-02-20 14:27:17,850 INFO L290 TraceCheckUtils]: 99: Hoare triple {3838#(< |ULTIMATE.start_main_~i~0#1| 999997)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {3838#(< |ULTIMATE.start_main_~i~0#1| 999997)} is VALID [2022-02-20 14:27:17,851 INFO L290 TraceCheckUtils]: 98: Hoare triple {3838#(< |ULTIMATE.start_main_~i~0#1| 999997)} assume !(0 == main_~q~0#1); {3838#(< |ULTIMATE.start_main_~i~0#1| 999997)} is VALID [2022-02-20 14:27:17,851 INFO L290 TraceCheckUtils]: 97: Hoare triple {3838#(< |ULTIMATE.start_main_~i~0#1| 999997)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {3838#(< |ULTIMATE.start_main_~i~0#1| 999997)} is VALID [2022-02-20 14:27:17,852 INFO L290 TraceCheckUtils]: 96: Hoare triple {3854#(< |ULTIMATE.start_main_~i~0#1| 999996)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3838#(< |ULTIMATE.start_main_~i~0#1| 999997)} is VALID [2022-02-20 14:27:17,852 INFO L290 TraceCheckUtils]: 95: Hoare triple {3854#(< |ULTIMATE.start_main_~i~0#1| 999996)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {3854#(< |ULTIMATE.start_main_~i~0#1| 999996)} is VALID [2022-02-20 14:27:17,852 INFO L290 TraceCheckUtils]: 94: Hoare triple {3854#(< |ULTIMATE.start_main_~i~0#1| 999996)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {3854#(< |ULTIMATE.start_main_~i~0#1| 999996)} is VALID [2022-02-20 14:27:17,852 INFO L290 TraceCheckUtils]: 93: Hoare triple {3854#(< |ULTIMATE.start_main_~i~0#1| 999996)} assume !(0 == main_~q~0#1); {3854#(< |ULTIMATE.start_main_~i~0#1| 999996)} is VALID [2022-02-20 14:27:17,853 INFO L290 TraceCheckUtils]: 92: Hoare triple {3854#(< |ULTIMATE.start_main_~i~0#1| 999996)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {3854#(< |ULTIMATE.start_main_~i~0#1| 999996)} is VALID [2022-02-20 14:27:17,853 INFO L290 TraceCheckUtils]: 91: Hoare triple {3870#(< |ULTIMATE.start_main_~i~0#1| 999995)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3854#(< |ULTIMATE.start_main_~i~0#1| 999996)} is VALID [2022-02-20 14:27:17,853 INFO L290 TraceCheckUtils]: 90: Hoare triple {3870#(< |ULTIMATE.start_main_~i~0#1| 999995)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {3870#(< |ULTIMATE.start_main_~i~0#1| 999995)} is VALID [2022-02-20 14:27:17,854 INFO L290 TraceCheckUtils]: 89: Hoare triple {3870#(< |ULTIMATE.start_main_~i~0#1| 999995)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {3870#(< |ULTIMATE.start_main_~i~0#1| 999995)} is VALID [2022-02-20 14:27:17,854 INFO L290 TraceCheckUtils]: 88: Hoare triple {3870#(< |ULTIMATE.start_main_~i~0#1| 999995)} assume !(0 == main_~q~0#1); {3870#(< |ULTIMATE.start_main_~i~0#1| 999995)} is VALID [2022-02-20 14:27:17,854 INFO L290 TraceCheckUtils]: 87: Hoare triple {3870#(< |ULTIMATE.start_main_~i~0#1| 999995)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {3870#(< |ULTIMATE.start_main_~i~0#1| 999995)} is VALID [2022-02-20 14:27:17,855 INFO L290 TraceCheckUtils]: 86: Hoare triple {3886#(< |ULTIMATE.start_main_~i~0#1| 999994)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3870#(< |ULTIMATE.start_main_~i~0#1| 999995)} is VALID [2022-02-20 14:27:17,855 INFO L290 TraceCheckUtils]: 85: Hoare triple {3886#(< |ULTIMATE.start_main_~i~0#1| 999994)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {3886#(< |ULTIMATE.start_main_~i~0#1| 999994)} is VALID [2022-02-20 14:27:17,855 INFO L290 TraceCheckUtils]: 84: Hoare triple {3886#(< |ULTIMATE.start_main_~i~0#1| 999994)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {3886#(< |ULTIMATE.start_main_~i~0#1| 999994)} is VALID [2022-02-20 14:27:17,856 INFO L290 TraceCheckUtils]: 83: Hoare triple {3886#(< |ULTIMATE.start_main_~i~0#1| 999994)} assume !(0 == main_~q~0#1); {3886#(< |ULTIMATE.start_main_~i~0#1| 999994)} is VALID [2022-02-20 14:27:17,856 INFO L290 TraceCheckUtils]: 82: Hoare triple {3886#(< |ULTIMATE.start_main_~i~0#1| 999994)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {3886#(< |ULTIMATE.start_main_~i~0#1| 999994)} is VALID [2022-02-20 14:27:17,856 INFO L290 TraceCheckUtils]: 81: Hoare triple {3902#(< |ULTIMATE.start_main_~i~0#1| 999993)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3886#(< |ULTIMATE.start_main_~i~0#1| 999994)} is VALID [2022-02-20 14:27:17,857 INFO L290 TraceCheckUtils]: 80: Hoare triple {3902#(< |ULTIMATE.start_main_~i~0#1| 999993)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {3902#(< |ULTIMATE.start_main_~i~0#1| 999993)} is VALID [2022-02-20 14:27:17,857 INFO L290 TraceCheckUtils]: 79: Hoare triple {3902#(< |ULTIMATE.start_main_~i~0#1| 999993)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {3902#(< |ULTIMATE.start_main_~i~0#1| 999993)} is VALID [2022-02-20 14:27:17,857 INFO L290 TraceCheckUtils]: 78: Hoare triple {3902#(< |ULTIMATE.start_main_~i~0#1| 999993)} assume !(0 == main_~q~0#1); {3902#(< |ULTIMATE.start_main_~i~0#1| 999993)} is VALID [2022-02-20 14:27:17,858 INFO L290 TraceCheckUtils]: 77: Hoare triple {3902#(< |ULTIMATE.start_main_~i~0#1| 999993)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {3902#(< |ULTIMATE.start_main_~i~0#1| 999993)} is VALID [2022-02-20 14:27:17,858 INFO L290 TraceCheckUtils]: 76: Hoare triple {3918#(< |ULTIMATE.start_main_~i~0#1| 999992)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3902#(< |ULTIMATE.start_main_~i~0#1| 999993)} is VALID [2022-02-20 14:27:17,858 INFO L290 TraceCheckUtils]: 75: Hoare triple {3918#(< |ULTIMATE.start_main_~i~0#1| 999992)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {3918#(< |ULTIMATE.start_main_~i~0#1| 999992)} is VALID [2022-02-20 14:27:17,859 INFO L290 TraceCheckUtils]: 74: Hoare triple {3918#(< |ULTIMATE.start_main_~i~0#1| 999992)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {3918#(< |ULTIMATE.start_main_~i~0#1| 999992)} is VALID [2022-02-20 14:27:17,859 INFO L290 TraceCheckUtils]: 73: Hoare triple {3918#(< |ULTIMATE.start_main_~i~0#1| 999992)} assume !(0 == main_~q~0#1); {3918#(< |ULTIMATE.start_main_~i~0#1| 999992)} is VALID [2022-02-20 14:27:17,859 INFO L290 TraceCheckUtils]: 72: Hoare triple {3918#(< |ULTIMATE.start_main_~i~0#1| 999992)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {3918#(< |ULTIMATE.start_main_~i~0#1| 999992)} is VALID [2022-02-20 14:27:17,860 INFO L290 TraceCheckUtils]: 71: Hoare triple {3934#(< |ULTIMATE.start_main_~i~0#1| 999991)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3918#(< |ULTIMATE.start_main_~i~0#1| 999992)} is VALID [2022-02-20 14:27:17,860 INFO L290 TraceCheckUtils]: 70: Hoare triple {3934#(< |ULTIMATE.start_main_~i~0#1| 999991)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {3934#(< |ULTIMATE.start_main_~i~0#1| 999991)} is VALID [2022-02-20 14:27:17,860 INFO L290 TraceCheckUtils]: 69: Hoare triple {3934#(< |ULTIMATE.start_main_~i~0#1| 999991)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {3934#(< |ULTIMATE.start_main_~i~0#1| 999991)} is VALID [2022-02-20 14:27:17,861 INFO L290 TraceCheckUtils]: 68: Hoare triple {3934#(< |ULTIMATE.start_main_~i~0#1| 999991)} assume !(0 == main_~q~0#1); {3934#(< |ULTIMATE.start_main_~i~0#1| 999991)} is VALID [2022-02-20 14:27:17,861 INFO L290 TraceCheckUtils]: 67: Hoare triple {3934#(< |ULTIMATE.start_main_~i~0#1| 999991)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {3934#(< |ULTIMATE.start_main_~i~0#1| 999991)} is VALID [2022-02-20 14:27:17,861 INFO L290 TraceCheckUtils]: 66: Hoare triple {3950#(< |ULTIMATE.start_main_~i~0#1| 999990)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3934#(< |ULTIMATE.start_main_~i~0#1| 999991)} is VALID [2022-02-20 14:27:17,862 INFO L290 TraceCheckUtils]: 65: Hoare triple {3950#(< |ULTIMATE.start_main_~i~0#1| 999990)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {3950#(< |ULTIMATE.start_main_~i~0#1| 999990)} is VALID [2022-02-20 14:27:17,862 INFO L290 TraceCheckUtils]: 64: Hoare triple {3950#(< |ULTIMATE.start_main_~i~0#1| 999990)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {3950#(< |ULTIMATE.start_main_~i~0#1| 999990)} is VALID [2022-02-20 14:27:17,862 INFO L290 TraceCheckUtils]: 63: Hoare triple {3950#(< |ULTIMATE.start_main_~i~0#1| 999990)} assume !(0 == main_~q~0#1); {3950#(< |ULTIMATE.start_main_~i~0#1| 999990)} is VALID [2022-02-20 14:27:17,862 INFO L290 TraceCheckUtils]: 62: Hoare triple {3950#(< |ULTIMATE.start_main_~i~0#1| 999990)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {3950#(< |ULTIMATE.start_main_~i~0#1| 999990)} is VALID [2022-02-20 14:27:17,863 INFO L290 TraceCheckUtils]: 61: Hoare triple {3966#(< |ULTIMATE.start_main_~i~0#1| 999989)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3950#(< |ULTIMATE.start_main_~i~0#1| 999990)} is VALID [2022-02-20 14:27:17,863 INFO L290 TraceCheckUtils]: 60: Hoare triple {3966#(< |ULTIMATE.start_main_~i~0#1| 999989)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {3966#(< |ULTIMATE.start_main_~i~0#1| 999989)} is VALID [2022-02-20 14:27:17,863 INFO L290 TraceCheckUtils]: 59: Hoare triple {3966#(< |ULTIMATE.start_main_~i~0#1| 999989)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {3966#(< |ULTIMATE.start_main_~i~0#1| 999989)} is VALID [2022-02-20 14:27:17,864 INFO L290 TraceCheckUtils]: 58: Hoare triple {3966#(< |ULTIMATE.start_main_~i~0#1| 999989)} assume !(0 == main_~q~0#1); {3966#(< |ULTIMATE.start_main_~i~0#1| 999989)} is VALID [2022-02-20 14:27:17,864 INFO L290 TraceCheckUtils]: 57: Hoare triple {3966#(< |ULTIMATE.start_main_~i~0#1| 999989)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {3966#(< |ULTIMATE.start_main_~i~0#1| 999989)} is VALID [2022-02-20 14:27:17,865 INFO L290 TraceCheckUtils]: 56: Hoare triple {3982#(< |ULTIMATE.start_main_~i~0#1| 999988)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3966#(< |ULTIMATE.start_main_~i~0#1| 999989)} is VALID [2022-02-20 14:27:17,865 INFO L290 TraceCheckUtils]: 55: Hoare triple {3982#(< |ULTIMATE.start_main_~i~0#1| 999988)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {3982#(< |ULTIMATE.start_main_~i~0#1| 999988)} is VALID [2022-02-20 14:27:17,865 INFO L290 TraceCheckUtils]: 54: Hoare triple {3982#(< |ULTIMATE.start_main_~i~0#1| 999988)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {3982#(< |ULTIMATE.start_main_~i~0#1| 999988)} is VALID [2022-02-20 14:27:17,865 INFO L290 TraceCheckUtils]: 53: Hoare triple {3982#(< |ULTIMATE.start_main_~i~0#1| 999988)} assume !(0 == main_~q~0#1); {3982#(< |ULTIMATE.start_main_~i~0#1| 999988)} is VALID [2022-02-20 14:27:17,866 INFO L290 TraceCheckUtils]: 52: Hoare triple {3982#(< |ULTIMATE.start_main_~i~0#1| 999988)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {3982#(< |ULTIMATE.start_main_~i~0#1| 999988)} is VALID [2022-02-20 14:27:17,866 INFO L290 TraceCheckUtils]: 51: Hoare triple {3998#(< |ULTIMATE.start_main_~i~0#1| 999987)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3982#(< |ULTIMATE.start_main_~i~0#1| 999988)} is VALID [2022-02-20 14:27:17,867 INFO L290 TraceCheckUtils]: 50: Hoare triple {3998#(< |ULTIMATE.start_main_~i~0#1| 999987)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {3998#(< |ULTIMATE.start_main_~i~0#1| 999987)} is VALID [2022-02-20 14:27:17,867 INFO L290 TraceCheckUtils]: 49: Hoare triple {3998#(< |ULTIMATE.start_main_~i~0#1| 999987)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {3998#(< |ULTIMATE.start_main_~i~0#1| 999987)} is VALID [2022-02-20 14:27:17,867 INFO L290 TraceCheckUtils]: 48: Hoare triple {3998#(< |ULTIMATE.start_main_~i~0#1| 999987)} assume !(0 == main_~q~0#1); {3998#(< |ULTIMATE.start_main_~i~0#1| 999987)} is VALID [2022-02-20 14:27:17,868 INFO L290 TraceCheckUtils]: 47: Hoare triple {3998#(< |ULTIMATE.start_main_~i~0#1| 999987)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {3998#(< |ULTIMATE.start_main_~i~0#1| 999987)} is VALID [2022-02-20 14:27:17,868 INFO L290 TraceCheckUtils]: 46: Hoare triple {4014#(< |ULTIMATE.start_main_~i~0#1| 999986)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3998#(< |ULTIMATE.start_main_~i~0#1| 999987)} is VALID [2022-02-20 14:27:17,868 INFO L290 TraceCheckUtils]: 45: Hoare triple {4014#(< |ULTIMATE.start_main_~i~0#1| 999986)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {4014#(< |ULTIMATE.start_main_~i~0#1| 999986)} is VALID [2022-02-20 14:27:17,869 INFO L290 TraceCheckUtils]: 44: Hoare triple {4014#(< |ULTIMATE.start_main_~i~0#1| 999986)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {4014#(< |ULTIMATE.start_main_~i~0#1| 999986)} is VALID [2022-02-20 14:27:17,869 INFO L290 TraceCheckUtils]: 43: Hoare triple {4014#(< |ULTIMATE.start_main_~i~0#1| 999986)} assume !(0 == main_~q~0#1); {4014#(< |ULTIMATE.start_main_~i~0#1| 999986)} is VALID [2022-02-20 14:27:17,869 INFO L290 TraceCheckUtils]: 42: Hoare triple {4014#(< |ULTIMATE.start_main_~i~0#1| 999986)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {4014#(< |ULTIMATE.start_main_~i~0#1| 999986)} is VALID [2022-02-20 14:27:17,870 INFO L290 TraceCheckUtils]: 41: Hoare triple {4030#(< |ULTIMATE.start_main_~i~0#1| 999985)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {4014#(< |ULTIMATE.start_main_~i~0#1| 999986)} is VALID [2022-02-20 14:27:17,870 INFO L290 TraceCheckUtils]: 40: Hoare triple {4030#(< |ULTIMATE.start_main_~i~0#1| 999985)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {4030#(< |ULTIMATE.start_main_~i~0#1| 999985)} is VALID [2022-02-20 14:27:17,870 INFO L290 TraceCheckUtils]: 39: Hoare triple {4030#(< |ULTIMATE.start_main_~i~0#1| 999985)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {4030#(< |ULTIMATE.start_main_~i~0#1| 999985)} is VALID [2022-02-20 14:27:17,871 INFO L290 TraceCheckUtils]: 38: Hoare triple {4030#(< |ULTIMATE.start_main_~i~0#1| 999985)} assume !(0 == main_~q~0#1); {4030#(< |ULTIMATE.start_main_~i~0#1| 999985)} is VALID [2022-02-20 14:27:17,871 INFO L290 TraceCheckUtils]: 37: Hoare triple {4030#(< |ULTIMATE.start_main_~i~0#1| 999985)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {4030#(< |ULTIMATE.start_main_~i~0#1| 999985)} is VALID [2022-02-20 14:27:17,871 INFO L290 TraceCheckUtils]: 36: Hoare triple {4046#(< |ULTIMATE.start_main_~i~0#1| 999984)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {4030#(< |ULTIMATE.start_main_~i~0#1| 999985)} is VALID [2022-02-20 14:27:17,872 INFO L290 TraceCheckUtils]: 35: Hoare triple {4046#(< |ULTIMATE.start_main_~i~0#1| 999984)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {4046#(< |ULTIMATE.start_main_~i~0#1| 999984)} is VALID [2022-02-20 14:27:17,872 INFO L290 TraceCheckUtils]: 34: Hoare triple {4046#(< |ULTIMATE.start_main_~i~0#1| 999984)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {4046#(< |ULTIMATE.start_main_~i~0#1| 999984)} is VALID [2022-02-20 14:27:17,872 INFO L290 TraceCheckUtils]: 33: Hoare triple {4046#(< |ULTIMATE.start_main_~i~0#1| 999984)} assume !(0 == main_~q~0#1); {4046#(< |ULTIMATE.start_main_~i~0#1| 999984)} is VALID [2022-02-20 14:27:17,873 INFO L290 TraceCheckUtils]: 32: Hoare triple {4046#(< |ULTIMATE.start_main_~i~0#1| 999984)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {4046#(< |ULTIMATE.start_main_~i~0#1| 999984)} is VALID [2022-02-20 14:27:17,873 INFO L290 TraceCheckUtils]: 31: Hoare triple {4062#(< |ULTIMATE.start_main_~i~0#1| 999983)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {4046#(< |ULTIMATE.start_main_~i~0#1| 999984)} is VALID [2022-02-20 14:27:17,873 INFO L290 TraceCheckUtils]: 30: Hoare triple {4062#(< |ULTIMATE.start_main_~i~0#1| 999983)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {4062#(< |ULTIMATE.start_main_~i~0#1| 999983)} is VALID [2022-02-20 14:27:17,874 INFO L290 TraceCheckUtils]: 29: Hoare triple {4062#(< |ULTIMATE.start_main_~i~0#1| 999983)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {4062#(< |ULTIMATE.start_main_~i~0#1| 999983)} is VALID [2022-02-20 14:27:17,874 INFO L290 TraceCheckUtils]: 28: Hoare triple {4062#(< |ULTIMATE.start_main_~i~0#1| 999983)} assume !(0 == main_~q~0#1); {4062#(< |ULTIMATE.start_main_~i~0#1| 999983)} is VALID [2022-02-20 14:27:17,874 INFO L290 TraceCheckUtils]: 27: Hoare triple {4062#(< |ULTIMATE.start_main_~i~0#1| 999983)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {4062#(< |ULTIMATE.start_main_~i~0#1| 999983)} is VALID [2022-02-20 14:27:17,875 INFO L290 TraceCheckUtils]: 26: Hoare triple {4078#(< |ULTIMATE.start_main_~i~0#1| 999982)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {4062#(< |ULTIMATE.start_main_~i~0#1| 999983)} is VALID [2022-02-20 14:27:17,875 INFO L290 TraceCheckUtils]: 25: Hoare triple {4078#(< |ULTIMATE.start_main_~i~0#1| 999982)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {4078#(< |ULTIMATE.start_main_~i~0#1| 999982)} is VALID [2022-02-20 14:27:17,875 INFO L290 TraceCheckUtils]: 24: Hoare triple {4078#(< |ULTIMATE.start_main_~i~0#1| 999982)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {4078#(< |ULTIMATE.start_main_~i~0#1| 999982)} is VALID [2022-02-20 14:27:17,876 INFO L290 TraceCheckUtils]: 23: Hoare triple {4078#(< |ULTIMATE.start_main_~i~0#1| 999982)} assume !(0 == main_~q~0#1); {4078#(< |ULTIMATE.start_main_~i~0#1| 999982)} is VALID [2022-02-20 14:27:17,876 INFO L290 TraceCheckUtils]: 22: Hoare triple {4078#(< |ULTIMATE.start_main_~i~0#1| 999982)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {4078#(< |ULTIMATE.start_main_~i~0#1| 999982)} is VALID [2022-02-20 14:27:17,876 INFO L290 TraceCheckUtils]: 21: Hoare triple {4094#(< |ULTIMATE.start_main_~i~0#1| 999981)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {4078#(< |ULTIMATE.start_main_~i~0#1| 999982)} is VALID [2022-02-20 14:27:17,877 INFO L290 TraceCheckUtils]: 20: Hoare triple {4094#(< |ULTIMATE.start_main_~i~0#1| 999981)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {4094#(< |ULTIMATE.start_main_~i~0#1| 999981)} is VALID [2022-02-20 14:27:17,877 INFO L290 TraceCheckUtils]: 19: Hoare triple {4094#(< |ULTIMATE.start_main_~i~0#1| 999981)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {4094#(< |ULTIMATE.start_main_~i~0#1| 999981)} is VALID [2022-02-20 14:27:17,877 INFO L290 TraceCheckUtils]: 18: Hoare triple {4094#(< |ULTIMATE.start_main_~i~0#1| 999981)} assume !(0 == main_~q~0#1); {4094#(< |ULTIMATE.start_main_~i~0#1| 999981)} is VALID [2022-02-20 14:27:17,878 INFO L290 TraceCheckUtils]: 17: Hoare triple {4094#(< |ULTIMATE.start_main_~i~0#1| 999981)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {4094#(< |ULTIMATE.start_main_~i~0#1| 999981)} is VALID [2022-02-20 14:27:17,878 INFO L290 TraceCheckUtils]: 16: Hoare triple {4110#(< |ULTIMATE.start_main_~i~0#1| 999980)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {4094#(< |ULTIMATE.start_main_~i~0#1| 999981)} is VALID [2022-02-20 14:27:17,878 INFO L290 TraceCheckUtils]: 15: Hoare triple {4110#(< |ULTIMATE.start_main_~i~0#1| 999980)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {4110#(< |ULTIMATE.start_main_~i~0#1| 999980)} is VALID [2022-02-20 14:27:17,879 INFO L290 TraceCheckUtils]: 14: Hoare triple {4110#(< |ULTIMATE.start_main_~i~0#1| 999980)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {4110#(< |ULTIMATE.start_main_~i~0#1| 999980)} is VALID [2022-02-20 14:27:17,879 INFO L290 TraceCheckUtils]: 13: Hoare triple {4110#(< |ULTIMATE.start_main_~i~0#1| 999980)} assume !(0 == main_~q~0#1); {4110#(< |ULTIMATE.start_main_~i~0#1| 999980)} is VALID [2022-02-20 14:27:17,879 INFO L290 TraceCheckUtils]: 12: Hoare triple {4110#(< |ULTIMATE.start_main_~i~0#1| 999980)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {4110#(< |ULTIMATE.start_main_~i~0#1| 999980)} is VALID [2022-02-20 14:27:17,880 INFO L290 TraceCheckUtils]: 11: Hoare triple {4126#(< |ULTIMATE.start_main_~i~0#1| 999979)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {4110#(< |ULTIMATE.start_main_~i~0#1| 999980)} is VALID [2022-02-20 14:27:17,880 INFO L290 TraceCheckUtils]: 10: Hoare triple {4126#(< |ULTIMATE.start_main_~i~0#1| 999979)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {4126#(< |ULTIMATE.start_main_~i~0#1| 999979)} is VALID [2022-02-20 14:27:17,880 INFO L290 TraceCheckUtils]: 9: Hoare triple {4126#(< |ULTIMATE.start_main_~i~0#1| 999979)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {4126#(< |ULTIMATE.start_main_~i~0#1| 999979)} is VALID [2022-02-20 14:27:17,880 INFO L290 TraceCheckUtils]: 8: Hoare triple {4126#(< |ULTIMATE.start_main_~i~0#1| 999979)} assume !(0 == main_~q~0#1); {4126#(< |ULTIMATE.start_main_~i~0#1| 999979)} is VALID [2022-02-20 14:27:17,881 INFO L290 TraceCheckUtils]: 7: Hoare triple {4126#(< |ULTIMATE.start_main_~i~0#1| 999979)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {4126#(< |ULTIMATE.start_main_~i~0#1| 999979)} is VALID [2022-02-20 14:27:17,881 INFO L290 TraceCheckUtils]: 6: Hoare triple {4142#(< |ULTIMATE.start_main_~i~0#1| 999978)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {4126#(< |ULTIMATE.start_main_~i~0#1| 999979)} is VALID [2022-02-20 14:27:17,909 INFO L290 TraceCheckUtils]: 5: Hoare triple {4142#(< |ULTIMATE.start_main_~i~0#1| 999978)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {4142#(< |ULTIMATE.start_main_~i~0#1| 999978)} is VALID [2022-02-20 14:27:17,910 INFO L290 TraceCheckUtils]: 4: Hoare triple {4142#(< |ULTIMATE.start_main_~i~0#1| 999978)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {4142#(< |ULTIMATE.start_main_~i~0#1| 999978)} is VALID [2022-02-20 14:27:17,910 INFO L290 TraceCheckUtils]: 3: Hoare triple {4142#(< |ULTIMATE.start_main_~i~0#1| 999978)} assume !(0 == main_~q~0#1); {4142#(< |ULTIMATE.start_main_~i~0#1| 999978)} is VALID [2022-02-20 14:27:17,910 INFO L290 TraceCheckUtils]: 2: Hoare triple {4142#(< |ULTIMATE.start_main_~i~0#1| 999978)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {4142#(< |ULTIMATE.start_main_~i~0#1| 999978)} is VALID [2022-02-20 14:27:17,911 INFO L290 TraceCheckUtils]: 1: Hoare triple {3401#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~post1#1, main_~q~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~short10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~post7#1, main_~s1~0#1.base, main_~s1~0#1.offset, main_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; {4142#(< |ULTIMATE.start_main_~i~0#1| 999978)} is VALID [2022-02-20 14:27:17,911 INFO L290 TraceCheckUtils]: 0: Hoare triple {3401#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(19, 2);~#a~0.base, ~#a~0.offset := 3, 0;call #Ultimate.allocInit(4000000, 3);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base); {3401#true} is VALID [2022-02-20 14:27:17,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1177 backedges. 0 proven. 1177 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:27:17,912 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [225177246] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:27:17,912 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:27:17,912 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2022-02-20 14:27:17,912 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212315743] [2022-02-20 14:27:17,913 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:27:17,913 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 4.836734693877551) internal successors, (237), 49 states have internal predecessors, (237), 0 states have call successors, (0), 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 119 [2022-02-20 14:27:17,914 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:27:17,914 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 49 states, 49 states have (on average 4.836734693877551) internal successors, (237), 49 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have 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:27:18,065 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 237 edges. 237 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:27:18,065 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-02-20 14:27:18,065 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:27:18,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-02-20 14:27:18,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2022-02-20 14:27:18,066 INFO L87 Difference]: Start difference. First operand 167 states and 236 transitions. Second operand has 49 states, 49 states have (on average 4.836734693877551) internal successors, (237), 49 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have 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:27:20,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:27:20,002 INFO L93 Difference]: Finished difference Result 751 states and 1008 transitions. [2022-02-20 14:27:20,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-02-20 14:27:20,002 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 4.836734693877551) internal successors, (237), 49 states have internal predecessors, (237), 0 states have call successors, (0), 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 119 [2022-02-20 14:27:20,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:27:20,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 4.836734693877551) internal successors, (237), 49 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have 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:27:20,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 915 transitions. [2022-02-20 14:27:20,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 4.836734693877551) internal successors, (237), 49 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have 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:27:20,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 915 transitions. [2022-02-20 14:27:20,019 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 915 transitions. [2022-02-20 14:27:20,631 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 915 edges. 915 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:27:20,649 INFO L225 Difference]: With dead ends: 751 [2022-02-20 14:27:20,649 INFO L226 Difference]: Without dead ends: 741 [2022-02-20 14:27:20,650 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 214 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:27:20,650 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 2330 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2330 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 14:27:20,651 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2330 Valid, 667 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 14:27:20,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2022-02-20 14:27:20,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 335. [2022-02-20 14:27:20,680 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:27:20,681 INFO L82 GeneralOperation]: Start isEquivalent. First operand 741 states. Second operand has 335 states, 334 states have (on average 1.4251497005988023) internal successors, (476), 334 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have 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:27:20,682 INFO L74 IsIncluded]: Start isIncluded. First operand 741 states. Second operand has 335 states, 334 states have (on average 1.4251497005988023) internal successors, (476), 334 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have 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:27:20,682 INFO L87 Difference]: Start difference. First operand 741 states. Second operand has 335 states, 334 states have (on average 1.4251497005988023) internal successors, (476), 334 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have 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:27:20,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:27:20,699 INFO L93 Difference]: Finished difference Result 741 states and 972 transitions. [2022-02-20 14:27:20,700 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 972 transitions. [2022-02-20 14:27:20,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:27:20,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:27:20,702 INFO L74 IsIncluded]: Start isIncluded. First operand has 335 states, 334 states have (on average 1.4251497005988023) internal successors, (476), 334 states have internal predecessors, (476), 0 states have call successors, (0), 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 741 states. [2022-02-20 14:27:20,702 INFO L87 Difference]: Start difference. First operand has 335 states, 334 states have (on average 1.4251497005988023) internal successors, (476), 334 states have internal predecessors, (476), 0 states have call successors, (0), 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 741 states. [2022-02-20 14:27:20,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:27:20,719 INFO L93 Difference]: Finished difference Result 741 states and 972 transitions. [2022-02-20 14:27:20,720 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 972 transitions. [2022-02-20 14:27:20,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:27:20,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:27:20,721 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:27:20,721 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:27:20,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 334 states have (on average 1.4251497005988023) internal successors, (476), 334 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have 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:27:20,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 476 transitions. [2022-02-20 14:27:20,726 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 476 transitions. Word has length 119 [2022-02-20 14:27:20,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:27:20,727 INFO L470 AbstractCegarLoop]: Abstraction has 335 states and 476 transitions. [2022-02-20 14:27:20,727 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 4.836734693877551) internal successors, (237), 49 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have 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:27:20,727 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 476 transitions. [2022-02-20 14:27:20,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2022-02-20 14:27:20,729 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:27:20,729 INFO L514 BasicCegarLoop]: trace histogram [46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:27:20,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-20 14:27:20,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:27:20,951 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:27:20,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:27:20,952 INFO L85 PathProgramCache]: Analyzing trace with hash 643307957, now seen corresponding path program 5 times [2022-02-20 14:27:20,952 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:27:20,952 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369472326] [2022-02-20 14:27:20,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:27:20,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:27:21,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:27:22,123 INFO L290 TraceCheckUtils]: 0: Hoare triple {6871#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(19, 2);~#a~0.base, ~#a~0.offset := 3, 0;call #Ultimate.allocInit(4000000, 3);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base); {6871#true} is VALID [2022-02-20 14:27:22,124 INFO L290 TraceCheckUtils]: 1: Hoare triple {6871#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~post1#1, main_~q~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~short10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~post7#1, main_~s1~0#1.base, main_~s1~0#1.offset, main_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; {6873#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:27:22,124 INFO L290 TraceCheckUtils]: 2: Hoare triple {6873#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {6873#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:27:22,124 INFO L290 TraceCheckUtils]: 3: Hoare triple {6873#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(0 == main_~q~0#1); {6873#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:27:22,124 INFO L290 TraceCheckUtils]: 4: Hoare triple {6873#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {6873#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:27:22,125 INFO L290 TraceCheckUtils]: 5: Hoare triple {6873#(= |ULTIMATE.start_main_~i~0#1| 0)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {6873#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:27:22,125 INFO L290 TraceCheckUtils]: 6: Hoare triple {6873#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {6874#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:27:22,125 INFO L290 TraceCheckUtils]: 7: Hoare triple {6874#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {6874#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:27:22,126 INFO L290 TraceCheckUtils]: 8: Hoare triple {6874#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(0 == main_~q~0#1); {6874#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:27:22,126 INFO L290 TraceCheckUtils]: 9: Hoare triple {6874#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {6874#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:27:22,126 INFO L290 TraceCheckUtils]: 10: Hoare triple {6874#(<= |ULTIMATE.start_main_~i~0#1| 1)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {6874#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:27:22,127 INFO L290 TraceCheckUtils]: 11: Hoare triple {6874#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {6875#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:27:22,127 INFO L290 TraceCheckUtils]: 12: Hoare triple {6875#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {6875#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:27:22,127 INFO L290 TraceCheckUtils]: 13: Hoare triple {6875#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(0 == main_~q~0#1); {6875#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:27:22,127 INFO L290 TraceCheckUtils]: 14: Hoare triple {6875#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {6875#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:27:22,134 INFO L290 TraceCheckUtils]: 15: Hoare triple {6875#(<= |ULTIMATE.start_main_~i~0#1| 2)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {6875#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:27:22,134 INFO L290 TraceCheckUtils]: 16: Hoare triple {6875#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {6876#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:27:22,135 INFO L290 TraceCheckUtils]: 17: Hoare triple {6876#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {6876#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:27:22,135 INFO L290 TraceCheckUtils]: 18: Hoare triple {6876#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !(0 == main_~q~0#1); {6876#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:27:22,135 INFO L290 TraceCheckUtils]: 19: Hoare triple {6876#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {6876#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:27:22,135 INFO L290 TraceCheckUtils]: 20: Hoare triple {6876#(<= |ULTIMATE.start_main_~i~0#1| 3)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {6876#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:27:22,136 INFO L290 TraceCheckUtils]: 21: Hoare triple {6876#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {6877#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:27:22,136 INFO L290 TraceCheckUtils]: 22: Hoare triple {6877#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {6877#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:27:22,136 INFO L290 TraceCheckUtils]: 23: Hoare triple {6877#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !(0 == main_~q~0#1); {6877#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:27:22,137 INFO L290 TraceCheckUtils]: 24: Hoare triple {6877#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {6877#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:27:22,137 INFO L290 TraceCheckUtils]: 25: Hoare triple {6877#(<= |ULTIMATE.start_main_~i~0#1| 4)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {6877#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:27:22,137 INFO L290 TraceCheckUtils]: 26: Hoare triple {6877#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {6878#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:27:22,138 INFO L290 TraceCheckUtils]: 27: Hoare triple {6878#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {6878#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:27:22,138 INFO L290 TraceCheckUtils]: 28: Hoare triple {6878#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !(0 == main_~q~0#1); {6878#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:27:22,138 INFO L290 TraceCheckUtils]: 29: Hoare triple {6878#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {6878#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:27:22,138 INFO L290 TraceCheckUtils]: 30: Hoare triple {6878#(<= |ULTIMATE.start_main_~i~0#1| 5)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {6878#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:27:22,139 INFO L290 TraceCheckUtils]: 31: Hoare triple {6878#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {6879#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:27:22,139 INFO L290 TraceCheckUtils]: 32: Hoare triple {6879#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {6879#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:27:22,139 INFO L290 TraceCheckUtils]: 33: Hoare triple {6879#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !(0 == main_~q~0#1); {6879#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:27:22,140 INFO L290 TraceCheckUtils]: 34: Hoare triple {6879#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {6879#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:27:22,140 INFO L290 TraceCheckUtils]: 35: Hoare triple {6879#(<= |ULTIMATE.start_main_~i~0#1| 6)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {6879#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:27:22,140 INFO L290 TraceCheckUtils]: 36: Hoare triple {6879#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {6880#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:27:22,141 INFO L290 TraceCheckUtils]: 37: Hoare triple {6880#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {6880#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:27:22,141 INFO L290 TraceCheckUtils]: 38: Hoare triple {6880#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !(0 == main_~q~0#1); {6880#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:27:22,141 INFO L290 TraceCheckUtils]: 39: Hoare triple {6880#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {6880#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:27:22,141 INFO L290 TraceCheckUtils]: 40: Hoare triple {6880#(<= |ULTIMATE.start_main_~i~0#1| 7)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {6880#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:27:22,142 INFO L290 TraceCheckUtils]: 41: Hoare triple {6880#(<= |ULTIMATE.start_main_~i~0#1| 7)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {6881#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:27:22,142 INFO L290 TraceCheckUtils]: 42: Hoare triple {6881#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {6881#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:27:22,142 INFO L290 TraceCheckUtils]: 43: Hoare triple {6881#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !(0 == main_~q~0#1); {6881#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:27:22,143 INFO L290 TraceCheckUtils]: 44: Hoare triple {6881#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {6881#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:27:22,143 INFO L290 TraceCheckUtils]: 45: Hoare triple {6881#(<= |ULTIMATE.start_main_~i~0#1| 8)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {6881#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:27:22,143 INFO L290 TraceCheckUtils]: 46: Hoare triple {6881#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {6882#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:27:22,144 INFO L290 TraceCheckUtils]: 47: Hoare triple {6882#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {6882#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:27:22,144 INFO L290 TraceCheckUtils]: 48: Hoare triple {6882#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !(0 == main_~q~0#1); {6882#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:27:22,144 INFO L290 TraceCheckUtils]: 49: Hoare triple {6882#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {6882#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:27:22,144 INFO L290 TraceCheckUtils]: 50: Hoare triple {6882#(<= |ULTIMATE.start_main_~i~0#1| 9)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {6882#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:27:22,145 INFO L290 TraceCheckUtils]: 51: Hoare triple {6882#(<= |ULTIMATE.start_main_~i~0#1| 9)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {6883#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:27:22,145 INFO L290 TraceCheckUtils]: 52: Hoare triple {6883#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {6883#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:27:22,145 INFO L290 TraceCheckUtils]: 53: Hoare triple {6883#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !(0 == main_~q~0#1); {6883#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:27:22,146 INFO L290 TraceCheckUtils]: 54: Hoare triple {6883#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {6883#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:27:22,146 INFO L290 TraceCheckUtils]: 55: Hoare triple {6883#(<= |ULTIMATE.start_main_~i~0#1| 10)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {6883#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:27:22,146 INFO L290 TraceCheckUtils]: 56: Hoare triple {6883#(<= |ULTIMATE.start_main_~i~0#1| 10)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {6884#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-20 14:27:22,147 INFO L290 TraceCheckUtils]: 57: Hoare triple {6884#(<= |ULTIMATE.start_main_~i~0#1| 11)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {6884#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-20 14:27:22,147 INFO L290 TraceCheckUtils]: 58: Hoare triple {6884#(<= |ULTIMATE.start_main_~i~0#1| 11)} assume !(0 == main_~q~0#1); {6884#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-20 14:27:22,147 INFO L290 TraceCheckUtils]: 59: Hoare triple {6884#(<= |ULTIMATE.start_main_~i~0#1| 11)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {6884#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-20 14:27:22,148 INFO L290 TraceCheckUtils]: 60: Hoare triple {6884#(<= |ULTIMATE.start_main_~i~0#1| 11)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {6884#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-20 14:27:22,148 INFO L290 TraceCheckUtils]: 61: Hoare triple {6884#(<= |ULTIMATE.start_main_~i~0#1| 11)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {6885#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 14:27:22,148 INFO L290 TraceCheckUtils]: 62: Hoare triple {6885#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {6885#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 14:27:22,148 INFO L290 TraceCheckUtils]: 63: Hoare triple {6885#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume !(0 == main_~q~0#1); {6885#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 14:27:22,149 INFO L290 TraceCheckUtils]: 64: Hoare triple {6885#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {6885#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 14:27:22,149 INFO L290 TraceCheckUtils]: 65: Hoare triple {6885#(<= |ULTIMATE.start_main_~i~0#1| 12)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {6885#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 14:27:22,149 INFO L290 TraceCheckUtils]: 66: Hoare triple {6885#(<= |ULTIMATE.start_main_~i~0#1| 12)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {6886#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-20 14:27:22,155 INFO L290 TraceCheckUtils]: 67: Hoare triple {6886#(<= |ULTIMATE.start_main_~i~0#1| 13)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {6886#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-20 14:27:22,156 INFO L290 TraceCheckUtils]: 68: Hoare triple {6886#(<= |ULTIMATE.start_main_~i~0#1| 13)} assume !(0 == main_~q~0#1); {6886#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-20 14:27:22,156 INFO L290 TraceCheckUtils]: 69: Hoare triple {6886#(<= |ULTIMATE.start_main_~i~0#1| 13)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {6886#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-20 14:27:22,156 INFO L290 TraceCheckUtils]: 70: Hoare triple {6886#(<= |ULTIMATE.start_main_~i~0#1| 13)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {6886#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-20 14:27:22,157 INFO L290 TraceCheckUtils]: 71: Hoare triple {6886#(<= |ULTIMATE.start_main_~i~0#1| 13)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {6887#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 14:27:22,157 INFO L290 TraceCheckUtils]: 72: Hoare triple {6887#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {6887#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 14:27:22,158 INFO L290 TraceCheckUtils]: 73: Hoare triple {6887#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume !(0 == main_~q~0#1); {6887#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 14:27:22,158 INFO L290 TraceCheckUtils]: 74: Hoare triple {6887#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {6887#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 14:27:22,158 INFO L290 TraceCheckUtils]: 75: Hoare triple {6887#(<= |ULTIMATE.start_main_~i~0#1| 14)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {6887#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 14:27:22,159 INFO L290 TraceCheckUtils]: 76: Hoare triple {6887#(<= |ULTIMATE.start_main_~i~0#1| 14)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {6888#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-20 14:27:22,159 INFO L290 TraceCheckUtils]: 77: Hoare triple {6888#(<= |ULTIMATE.start_main_~i~0#1| 15)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {6888#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-20 14:27:22,160 INFO L290 TraceCheckUtils]: 78: Hoare triple {6888#(<= |ULTIMATE.start_main_~i~0#1| 15)} assume !(0 == main_~q~0#1); {6888#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-20 14:27:22,160 INFO L290 TraceCheckUtils]: 79: Hoare triple {6888#(<= |ULTIMATE.start_main_~i~0#1| 15)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {6888#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-20 14:27:22,160 INFO L290 TraceCheckUtils]: 80: Hoare triple {6888#(<= |ULTIMATE.start_main_~i~0#1| 15)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {6888#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-20 14:27:22,161 INFO L290 TraceCheckUtils]: 81: Hoare triple {6888#(<= |ULTIMATE.start_main_~i~0#1| 15)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {6889#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 14:27:22,161 INFO L290 TraceCheckUtils]: 82: Hoare triple {6889#(<= |ULTIMATE.start_main_~i~0#1| 16)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {6889#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 14:27:22,162 INFO L290 TraceCheckUtils]: 83: Hoare triple {6889#(<= |ULTIMATE.start_main_~i~0#1| 16)} assume !(0 == main_~q~0#1); {6889#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 14:27:22,162 INFO L290 TraceCheckUtils]: 84: Hoare triple {6889#(<= |ULTIMATE.start_main_~i~0#1| 16)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {6889#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 14:27:22,162 INFO L290 TraceCheckUtils]: 85: Hoare triple {6889#(<= |ULTIMATE.start_main_~i~0#1| 16)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {6889#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 14:27:22,163 INFO L290 TraceCheckUtils]: 86: Hoare triple {6889#(<= |ULTIMATE.start_main_~i~0#1| 16)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {6890#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-20 14:27:22,163 INFO L290 TraceCheckUtils]: 87: Hoare triple {6890#(<= |ULTIMATE.start_main_~i~0#1| 17)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {6890#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-20 14:27:22,164 INFO L290 TraceCheckUtils]: 88: Hoare triple {6890#(<= |ULTIMATE.start_main_~i~0#1| 17)} assume !(0 == main_~q~0#1); {6890#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-20 14:27:22,164 INFO L290 TraceCheckUtils]: 89: Hoare triple {6890#(<= |ULTIMATE.start_main_~i~0#1| 17)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {6890#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-20 14:27:22,164 INFO L290 TraceCheckUtils]: 90: Hoare triple {6890#(<= |ULTIMATE.start_main_~i~0#1| 17)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {6890#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-20 14:27:22,165 INFO L290 TraceCheckUtils]: 91: Hoare triple {6890#(<= |ULTIMATE.start_main_~i~0#1| 17)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {6891#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 14:27:22,165 INFO L290 TraceCheckUtils]: 92: Hoare triple {6891#(<= |ULTIMATE.start_main_~i~0#1| 18)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {6891#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 14:27:22,166 INFO L290 TraceCheckUtils]: 93: Hoare triple {6891#(<= |ULTIMATE.start_main_~i~0#1| 18)} assume !(0 == main_~q~0#1); {6891#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 14:27:22,166 INFO L290 TraceCheckUtils]: 94: Hoare triple {6891#(<= |ULTIMATE.start_main_~i~0#1| 18)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {6891#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 14:27:22,166 INFO L290 TraceCheckUtils]: 95: Hoare triple {6891#(<= |ULTIMATE.start_main_~i~0#1| 18)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {6891#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 14:27:22,167 INFO L290 TraceCheckUtils]: 96: Hoare triple {6891#(<= |ULTIMATE.start_main_~i~0#1| 18)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {6892#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-20 14:27:22,167 INFO L290 TraceCheckUtils]: 97: Hoare triple {6892#(<= |ULTIMATE.start_main_~i~0#1| 19)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {6892#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-20 14:27:22,167 INFO L290 TraceCheckUtils]: 98: Hoare triple {6892#(<= |ULTIMATE.start_main_~i~0#1| 19)} assume !(0 == main_~q~0#1); {6892#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-20 14:27:22,167 INFO L290 TraceCheckUtils]: 99: Hoare triple {6892#(<= |ULTIMATE.start_main_~i~0#1| 19)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {6892#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-20 14:27:22,168 INFO L290 TraceCheckUtils]: 100: Hoare triple {6892#(<= |ULTIMATE.start_main_~i~0#1| 19)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {6892#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-20 14:27:22,168 INFO L290 TraceCheckUtils]: 101: Hoare triple {6892#(<= |ULTIMATE.start_main_~i~0#1| 19)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {6893#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 14:27:22,169 INFO L290 TraceCheckUtils]: 102: Hoare triple {6893#(<= |ULTIMATE.start_main_~i~0#1| 20)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {6893#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 14:27:22,169 INFO L290 TraceCheckUtils]: 103: Hoare triple {6893#(<= |ULTIMATE.start_main_~i~0#1| 20)} assume !(0 == main_~q~0#1); {6893#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 14:27:22,169 INFO L290 TraceCheckUtils]: 104: Hoare triple {6893#(<= |ULTIMATE.start_main_~i~0#1| 20)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {6893#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 14:27:22,170 INFO L290 TraceCheckUtils]: 105: Hoare triple {6893#(<= |ULTIMATE.start_main_~i~0#1| 20)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {6893#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 14:27:22,170 INFO L290 TraceCheckUtils]: 106: Hoare triple {6893#(<= |ULTIMATE.start_main_~i~0#1| 20)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {6894#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-20 14:27:22,171 INFO L290 TraceCheckUtils]: 107: Hoare triple {6894#(<= |ULTIMATE.start_main_~i~0#1| 21)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {6894#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-20 14:27:22,171 INFO L290 TraceCheckUtils]: 108: Hoare triple {6894#(<= |ULTIMATE.start_main_~i~0#1| 21)} assume !(0 == main_~q~0#1); {6894#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-20 14:27:22,171 INFO L290 TraceCheckUtils]: 109: Hoare triple {6894#(<= |ULTIMATE.start_main_~i~0#1| 21)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {6894#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-20 14:27:22,172 INFO L290 TraceCheckUtils]: 110: Hoare triple {6894#(<= |ULTIMATE.start_main_~i~0#1| 21)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {6894#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-20 14:27:22,172 INFO L290 TraceCheckUtils]: 111: Hoare triple {6894#(<= |ULTIMATE.start_main_~i~0#1| 21)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {6895#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-20 14:27:22,172 INFO L290 TraceCheckUtils]: 112: Hoare triple {6895#(<= |ULTIMATE.start_main_~i~0#1| 22)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {6895#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-20 14:27:22,173 INFO L290 TraceCheckUtils]: 113: Hoare triple {6895#(<= |ULTIMATE.start_main_~i~0#1| 22)} assume !(0 == main_~q~0#1); {6895#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-20 14:27:22,173 INFO L290 TraceCheckUtils]: 114: Hoare triple {6895#(<= |ULTIMATE.start_main_~i~0#1| 22)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {6895#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-20 14:27:22,173 INFO L290 TraceCheckUtils]: 115: Hoare triple {6895#(<= |ULTIMATE.start_main_~i~0#1| 22)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {6895#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-20 14:27:22,174 INFO L290 TraceCheckUtils]: 116: Hoare triple {6895#(<= |ULTIMATE.start_main_~i~0#1| 22)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {6896#(<= |ULTIMATE.start_main_~i~0#1| 23)} is VALID [2022-02-20 14:27:22,174 INFO L290 TraceCheckUtils]: 117: Hoare triple {6896#(<= |ULTIMATE.start_main_~i~0#1| 23)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {6896#(<= |ULTIMATE.start_main_~i~0#1| 23)} is VALID [2022-02-20 14:27:22,174 INFO L290 TraceCheckUtils]: 118: Hoare triple {6896#(<= |ULTIMATE.start_main_~i~0#1| 23)} assume !(0 == main_~q~0#1); {6896#(<= |ULTIMATE.start_main_~i~0#1| 23)} is VALID [2022-02-20 14:27:22,175 INFO L290 TraceCheckUtils]: 119: Hoare triple {6896#(<= |ULTIMATE.start_main_~i~0#1| 23)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {6896#(<= |ULTIMATE.start_main_~i~0#1| 23)} is VALID [2022-02-20 14:27:22,175 INFO L290 TraceCheckUtils]: 120: Hoare triple {6896#(<= |ULTIMATE.start_main_~i~0#1| 23)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {6896#(<= |ULTIMATE.start_main_~i~0#1| 23)} is VALID [2022-02-20 14:27:22,176 INFO L290 TraceCheckUtils]: 121: Hoare triple {6896#(<= |ULTIMATE.start_main_~i~0#1| 23)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {6897#(<= |ULTIMATE.start_main_~i~0#1| 24)} is VALID [2022-02-20 14:27:22,176 INFO L290 TraceCheckUtils]: 122: Hoare triple {6897#(<= |ULTIMATE.start_main_~i~0#1| 24)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {6897#(<= |ULTIMATE.start_main_~i~0#1| 24)} is VALID [2022-02-20 14:27:22,176 INFO L290 TraceCheckUtils]: 123: Hoare triple {6897#(<= |ULTIMATE.start_main_~i~0#1| 24)} assume !(0 == main_~q~0#1); {6897#(<= |ULTIMATE.start_main_~i~0#1| 24)} is VALID [2022-02-20 14:27:22,177 INFO L290 TraceCheckUtils]: 124: Hoare triple {6897#(<= |ULTIMATE.start_main_~i~0#1| 24)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {6897#(<= |ULTIMATE.start_main_~i~0#1| 24)} is VALID [2022-02-20 14:27:22,177 INFO L290 TraceCheckUtils]: 125: Hoare triple {6897#(<= |ULTIMATE.start_main_~i~0#1| 24)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {6897#(<= |ULTIMATE.start_main_~i~0#1| 24)} is VALID [2022-02-20 14:27:22,177 INFO L290 TraceCheckUtils]: 126: Hoare triple {6897#(<= |ULTIMATE.start_main_~i~0#1| 24)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {6898#(<= |ULTIMATE.start_main_~i~0#1| 25)} is VALID [2022-02-20 14:27:22,178 INFO L290 TraceCheckUtils]: 127: Hoare triple {6898#(<= |ULTIMATE.start_main_~i~0#1| 25)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {6898#(<= |ULTIMATE.start_main_~i~0#1| 25)} is VALID [2022-02-20 14:27:22,178 INFO L290 TraceCheckUtils]: 128: Hoare triple {6898#(<= |ULTIMATE.start_main_~i~0#1| 25)} assume !(0 == main_~q~0#1); {6898#(<= |ULTIMATE.start_main_~i~0#1| 25)} is VALID [2022-02-20 14:27:22,178 INFO L290 TraceCheckUtils]: 129: Hoare triple {6898#(<= |ULTIMATE.start_main_~i~0#1| 25)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {6898#(<= |ULTIMATE.start_main_~i~0#1| 25)} is VALID [2022-02-20 14:27:22,179 INFO L290 TraceCheckUtils]: 130: Hoare triple {6898#(<= |ULTIMATE.start_main_~i~0#1| 25)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {6898#(<= |ULTIMATE.start_main_~i~0#1| 25)} is VALID [2022-02-20 14:27:22,179 INFO L290 TraceCheckUtils]: 131: Hoare triple {6898#(<= |ULTIMATE.start_main_~i~0#1| 25)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {6899#(<= |ULTIMATE.start_main_~i~0#1| 26)} is VALID [2022-02-20 14:27:22,180 INFO L290 TraceCheckUtils]: 132: Hoare triple {6899#(<= |ULTIMATE.start_main_~i~0#1| 26)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {6899#(<= |ULTIMATE.start_main_~i~0#1| 26)} is VALID [2022-02-20 14:27:22,180 INFO L290 TraceCheckUtils]: 133: Hoare triple {6899#(<= |ULTIMATE.start_main_~i~0#1| 26)} assume !(0 == main_~q~0#1); {6899#(<= |ULTIMATE.start_main_~i~0#1| 26)} is VALID [2022-02-20 14:27:22,180 INFO L290 TraceCheckUtils]: 134: Hoare triple {6899#(<= |ULTIMATE.start_main_~i~0#1| 26)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {6899#(<= |ULTIMATE.start_main_~i~0#1| 26)} is VALID [2022-02-20 14:27:22,181 INFO L290 TraceCheckUtils]: 135: Hoare triple {6899#(<= |ULTIMATE.start_main_~i~0#1| 26)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {6899#(<= |ULTIMATE.start_main_~i~0#1| 26)} is VALID [2022-02-20 14:27:22,181 INFO L290 TraceCheckUtils]: 136: Hoare triple {6899#(<= |ULTIMATE.start_main_~i~0#1| 26)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {6900#(<= |ULTIMATE.start_main_~i~0#1| 27)} is VALID [2022-02-20 14:27:22,181 INFO L290 TraceCheckUtils]: 137: Hoare triple {6900#(<= |ULTIMATE.start_main_~i~0#1| 27)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {6900#(<= |ULTIMATE.start_main_~i~0#1| 27)} is VALID [2022-02-20 14:27:22,182 INFO L290 TraceCheckUtils]: 138: Hoare triple {6900#(<= |ULTIMATE.start_main_~i~0#1| 27)} assume !(0 == main_~q~0#1); {6900#(<= |ULTIMATE.start_main_~i~0#1| 27)} is VALID [2022-02-20 14:27:22,182 INFO L290 TraceCheckUtils]: 139: Hoare triple {6900#(<= |ULTIMATE.start_main_~i~0#1| 27)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {6900#(<= |ULTIMATE.start_main_~i~0#1| 27)} is VALID [2022-02-20 14:27:22,182 INFO L290 TraceCheckUtils]: 140: Hoare triple {6900#(<= |ULTIMATE.start_main_~i~0#1| 27)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {6900#(<= |ULTIMATE.start_main_~i~0#1| 27)} is VALID [2022-02-20 14:27:22,183 INFO L290 TraceCheckUtils]: 141: Hoare triple {6900#(<= |ULTIMATE.start_main_~i~0#1| 27)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {6901#(<= |ULTIMATE.start_main_~i~0#1| 28)} is VALID [2022-02-20 14:27:22,183 INFO L290 TraceCheckUtils]: 142: Hoare triple {6901#(<= |ULTIMATE.start_main_~i~0#1| 28)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {6901#(<= |ULTIMATE.start_main_~i~0#1| 28)} is VALID [2022-02-20 14:27:22,183 INFO L290 TraceCheckUtils]: 143: Hoare triple {6901#(<= |ULTIMATE.start_main_~i~0#1| 28)} assume !(0 == main_~q~0#1); {6901#(<= |ULTIMATE.start_main_~i~0#1| 28)} is VALID [2022-02-20 14:27:22,184 INFO L290 TraceCheckUtils]: 144: Hoare triple {6901#(<= |ULTIMATE.start_main_~i~0#1| 28)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {6901#(<= |ULTIMATE.start_main_~i~0#1| 28)} is VALID [2022-02-20 14:27:22,184 INFO L290 TraceCheckUtils]: 145: Hoare triple {6901#(<= |ULTIMATE.start_main_~i~0#1| 28)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {6901#(<= |ULTIMATE.start_main_~i~0#1| 28)} is VALID [2022-02-20 14:27:22,184 INFO L290 TraceCheckUtils]: 146: Hoare triple {6901#(<= |ULTIMATE.start_main_~i~0#1| 28)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {6902#(<= |ULTIMATE.start_main_~i~0#1| 29)} is VALID [2022-02-20 14:27:22,185 INFO L290 TraceCheckUtils]: 147: Hoare triple {6902#(<= |ULTIMATE.start_main_~i~0#1| 29)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {6902#(<= |ULTIMATE.start_main_~i~0#1| 29)} is VALID [2022-02-20 14:27:22,185 INFO L290 TraceCheckUtils]: 148: Hoare triple {6902#(<= |ULTIMATE.start_main_~i~0#1| 29)} assume !(0 == main_~q~0#1); {6902#(<= |ULTIMATE.start_main_~i~0#1| 29)} is VALID [2022-02-20 14:27:22,185 INFO L290 TraceCheckUtils]: 149: Hoare triple {6902#(<= |ULTIMATE.start_main_~i~0#1| 29)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {6902#(<= |ULTIMATE.start_main_~i~0#1| 29)} is VALID [2022-02-20 14:27:22,186 INFO L290 TraceCheckUtils]: 150: Hoare triple {6902#(<= |ULTIMATE.start_main_~i~0#1| 29)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {6902#(<= |ULTIMATE.start_main_~i~0#1| 29)} is VALID [2022-02-20 14:27:22,186 INFO L290 TraceCheckUtils]: 151: Hoare triple {6902#(<= |ULTIMATE.start_main_~i~0#1| 29)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {6903#(<= |ULTIMATE.start_main_~i~0#1| 30)} is VALID [2022-02-20 14:27:22,186 INFO L290 TraceCheckUtils]: 152: Hoare triple {6903#(<= |ULTIMATE.start_main_~i~0#1| 30)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {6903#(<= |ULTIMATE.start_main_~i~0#1| 30)} is VALID [2022-02-20 14:27:22,187 INFO L290 TraceCheckUtils]: 153: Hoare triple {6903#(<= |ULTIMATE.start_main_~i~0#1| 30)} assume !(0 == main_~q~0#1); {6903#(<= |ULTIMATE.start_main_~i~0#1| 30)} is VALID [2022-02-20 14:27:22,187 INFO L290 TraceCheckUtils]: 154: Hoare triple {6903#(<= |ULTIMATE.start_main_~i~0#1| 30)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {6903#(<= |ULTIMATE.start_main_~i~0#1| 30)} is VALID [2022-02-20 14:27:22,187 INFO L290 TraceCheckUtils]: 155: Hoare triple {6903#(<= |ULTIMATE.start_main_~i~0#1| 30)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {6903#(<= |ULTIMATE.start_main_~i~0#1| 30)} is VALID [2022-02-20 14:27:22,188 INFO L290 TraceCheckUtils]: 156: Hoare triple {6903#(<= |ULTIMATE.start_main_~i~0#1| 30)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {6904#(<= |ULTIMATE.start_main_~i~0#1| 31)} is VALID [2022-02-20 14:27:22,188 INFO L290 TraceCheckUtils]: 157: Hoare triple {6904#(<= |ULTIMATE.start_main_~i~0#1| 31)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {6904#(<= |ULTIMATE.start_main_~i~0#1| 31)} is VALID [2022-02-20 14:27:22,188 INFO L290 TraceCheckUtils]: 158: Hoare triple {6904#(<= |ULTIMATE.start_main_~i~0#1| 31)} assume !(0 == main_~q~0#1); {6904#(<= |ULTIMATE.start_main_~i~0#1| 31)} is VALID [2022-02-20 14:27:22,188 INFO L290 TraceCheckUtils]: 159: Hoare triple {6904#(<= |ULTIMATE.start_main_~i~0#1| 31)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {6904#(<= |ULTIMATE.start_main_~i~0#1| 31)} is VALID [2022-02-20 14:27:22,189 INFO L290 TraceCheckUtils]: 160: Hoare triple {6904#(<= |ULTIMATE.start_main_~i~0#1| 31)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {6904#(<= |ULTIMATE.start_main_~i~0#1| 31)} is VALID [2022-02-20 14:27:22,189 INFO L290 TraceCheckUtils]: 161: Hoare triple {6904#(<= |ULTIMATE.start_main_~i~0#1| 31)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {6905#(<= |ULTIMATE.start_main_~i~0#1| 32)} is VALID [2022-02-20 14:27:22,189 INFO L290 TraceCheckUtils]: 162: Hoare triple {6905#(<= |ULTIMATE.start_main_~i~0#1| 32)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {6905#(<= |ULTIMATE.start_main_~i~0#1| 32)} is VALID [2022-02-20 14:27:22,190 INFO L290 TraceCheckUtils]: 163: Hoare triple {6905#(<= |ULTIMATE.start_main_~i~0#1| 32)} assume !(0 == main_~q~0#1); {6905#(<= |ULTIMATE.start_main_~i~0#1| 32)} is VALID [2022-02-20 14:27:22,190 INFO L290 TraceCheckUtils]: 164: Hoare triple {6905#(<= |ULTIMATE.start_main_~i~0#1| 32)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {6905#(<= |ULTIMATE.start_main_~i~0#1| 32)} is VALID [2022-02-20 14:27:22,190 INFO L290 TraceCheckUtils]: 165: Hoare triple {6905#(<= |ULTIMATE.start_main_~i~0#1| 32)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {6905#(<= |ULTIMATE.start_main_~i~0#1| 32)} is VALID [2022-02-20 14:27:22,191 INFO L290 TraceCheckUtils]: 166: Hoare triple {6905#(<= |ULTIMATE.start_main_~i~0#1| 32)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {6906#(<= |ULTIMATE.start_main_~i~0#1| 33)} is VALID [2022-02-20 14:27:22,191 INFO L290 TraceCheckUtils]: 167: Hoare triple {6906#(<= |ULTIMATE.start_main_~i~0#1| 33)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {6906#(<= |ULTIMATE.start_main_~i~0#1| 33)} is VALID [2022-02-20 14:27:22,191 INFO L290 TraceCheckUtils]: 168: Hoare triple {6906#(<= |ULTIMATE.start_main_~i~0#1| 33)} assume !(0 == main_~q~0#1); {6906#(<= |ULTIMATE.start_main_~i~0#1| 33)} is VALID [2022-02-20 14:27:22,191 INFO L290 TraceCheckUtils]: 169: Hoare triple {6906#(<= |ULTIMATE.start_main_~i~0#1| 33)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {6906#(<= |ULTIMATE.start_main_~i~0#1| 33)} is VALID [2022-02-20 14:27:22,192 INFO L290 TraceCheckUtils]: 170: Hoare triple {6906#(<= |ULTIMATE.start_main_~i~0#1| 33)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {6906#(<= |ULTIMATE.start_main_~i~0#1| 33)} is VALID [2022-02-20 14:27:22,192 INFO L290 TraceCheckUtils]: 171: Hoare triple {6906#(<= |ULTIMATE.start_main_~i~0#1| 33)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {6907#(<= |ULTIMATE.start_main_~i~0#1| 34)} is VALID [2022-02-20 14:27:22,192 INFO L290 TraceCheckUtils]: 172: Hoare triple {6907#(<= |ULTIMATE.start_main_~i~0#1| 34)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {6907#(<= |ULTIMATE.start_main_~i~0#1| 34)} is VALID [2022-02-20 14:27:22,193 INFO L290 TraceCheckUtils]: 173: Hoare triple {6907#(<= |ULTIMATE.start_main_~i~0#1| 34)} assume !(0 == main_~q~0#1); {6907#(<= |ULTIMATE.start_main_~i~0#1| 34)} is VALID [2022-02-20 14:27:22,193 INFO L290 TraceCheckUtils]: 174: Hoare triple {6907#(<= |ULTIMATE.start_main_~i~0#1| 34)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {6907#(<= |ULTIMATE.start_main_~i~0#1| 34)} is VALID [2022-02-20 14:27:22,193 INFO L290 TraceCheckUtils]: 175: Hoare triple {6907#(<= |ULTIMATE.start_main_~i~0#1| 34)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {6907#(<= |ULTIMATE.start_main_~i~0#1| 34)} is VALID [2022-02-20 14:27:22,193 INFO L290 TraceCheckUtils]: 176: Hoare triple {6907#(<= |ULTIMATE.start_main_~i~0#1| 34)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {6908#(<= |ULTIMATE.start_main_~i~0#1| 35)} is VALID [2022-02-20 14:27:22,194 INFO L290 TraceCheckUtils]: 177: Hoare triple {6908#(<= |ULTIMATE.start_main_~i~0#1| 35)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {6908#(<= |ULTIMATE.start_main_~i~0#1| 35)} is VALID [2022-02-20 14:27:22,194 INFO L290 TraceCheckUtils]: 178: Hoare triple {6908#(<= |ULTIMATE.start_main_~i~0#1| 35)} assume !(0 == main_~q~0#1); {6908#(<= |ULTIMATE.start_main_~i~0#1| 35)} is VALID [2022-02-20 14:27:22,194 INFO L290 TraceCheckUtils]: 179: Hoare triple {6908#(<= |ULTIMATE.start_main_~i~0#1| 35)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {6908#(<= |ULTIMATE.start_main_~i~0#1| 35)} is VALID [2022-02-20 14:27:22,194 INFO L290 TraceCheckUtils]: 180: Hoare triple {6908#(<= |ULTIMATE.start_main_~i~0#1| 35)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {6908#(<= |ULTIMATE.start_main_~i~0#1| 35)} is VALID [2022-02-20 14:27:22,195 INFO L290 TraceCheckUtils]: 181: Hoare triple {6908#(<= |ULTIMATE.start_main_~i~0#1| 35)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {6909#(<= |ULTIMATE.start_main_~i~0#1| 36)} is VALID [2022-02-20 14:27:22,195 INFO L290 TraceCheckUtils]: 182: Hoare triple {6909#(<= |ULTIMATE.start_main_~i~0#1| 36)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {6909#(<= |ULTIMATE.start_main_~i~0#1| 36)} is VALID [2022-02-20 14:27:22,195 INFO L290 TraceCheckUtils]: 183: Hoare triple {6909#(<= |ULTIMATE.start_main_~i~0#1| 36)} assume !(0 == main_~q~0#1); {6909#(<= |ULTIMATE.start_main_~i~0#1| 36)} is VALID [2022-02-20 14:27:22,196 INFO L290 TraceCheckUtils]: 184: Hoare triple {6909#(<= |ULTIMATE.start_main_~i~0#1| 36)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {6909#(<= |ULTIMATE.start_main_~i~0#1| 36)} is VALID [2022-02-20 14:27:22,196 INFO L290 TraceCheckUtils]: 185: Hoare triple {6909#(<= |ULTIMATE.start_main_~i~0#1| 36)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {6909#(<= |ULTIMATE.start_main_~i~0#1| 36)} is VALID [2022-02-20 14:27:22,196 INFO L290 TraceCheckUtils]: 186: Hoare triple {6909#(<= |ULTIMATE.start_main_~i~0#1| 36)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {6910#(<= |ULTIMATE.start_main_~i~0#1| 37)} is VALID [2022-02-20 14:27:22,196 INFO L290 TraceCheckUtils]: 187: Hoare triple {6910#(<= |ULTIMATE.start_main_~i~0#1| 37)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {6910#(<= |ULTIMATE.start_main_~i~0#1| 37)} is VALID [2022-02-20 14:27:22,197 INFO L290 TraceCheckUtils]: 188: Hoare triple {6910#(<= |ULTIMATE.start_main_~i~0#1| 37)} assume !(0 == main_~q~0#1); {6910#(<= |ULTIMATE.start_main_~i~0#1| 37)} is VALID [2022-02-20 14:27:22,197 INFO L290 TraceCheckUtils]: 189: Hoare triple {6910#(<= |ULTIMATE.start_main_~i~0#1| 37)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {6910#(<= |ULTIMATE.start_main_~i~0#1| 37)} is VALID [2022-02-20 14:27:22,197 INFO L290 TraceCheckUtils]: 190: Hoare triple {6910#(<= |ULTIMATE.start_main_~i~0#1| 37)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {6910#(<= |ULTIMATE.start_main_~i~0#1| 37)} is VALID [2022-02-20 14:27:22,198 INFO L290 TraceCheckUtils]: 191: Hoare triple {6910#(<= |ULTIMATE.start_main_~i~0#1| 37)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {6911#(<= |ULTIMATE.start_main_~i~0#1| 38)} is VALID [2022-02-20 14:27:22,198 INFO L290 TraceCheckUtils]: 192: Hoare triple {6911#(<= |ULTIMATE.start_main_~i~0#1| 38)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {6911#(<= |ULTIMATE.start_main_~i~0#1| 38)} is VALID [2022-02-20 14:27:22,198 INFO L290 TraceCheckUtils]: 193: Hoare triple {6911#(<= |ULTIMATE.start_main_~i~0#1| 38)} assume !(0 == main_~q~0#1); {6911#(<= |ULTIMATE.start_main_~i~0#1| 38)} is VALID [2022-02-20 14:27:22,198 INFO L290 TraceCheckUtils]: 194: Hoare triple {6911#(<= |ULTIMATE.start_main_~i~0#1| 38)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {6911#(<= |ULTIMATE.start_main_~i~0#1| 38)} is VALID [2022-02-20 14:27:22,199 INFO L290 TraceCheckUtils]: 195: Hoare triple {6911#(<= |ULTIMATE.start_main_~i~0#1| 38)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {6911#(<= |ULTIMATE.start_main_~i~0#1| 38)} is VALID [2022-02-20 14:27:22,199 INFO L290 TraceCheckUtils]: 196: Hoare triple {6911#(<= |ULTIMATE.start_main_~i~0#1| 38)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {6912#(<= |ULTIMATE.start_main_~i~0#1| 39)} is VALID [2022-02-20 14:27:22,200 INFO L290 TraceCheckUtils]: 197: Hoare triple {6912#(<= |ULTIMATE.start_main_~i~0#1| 39)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {6912#(<= |ULTIMATE.start_main_~i~0#1| 39)} is VALID [2022-02-20 14:27:22,200 INFO L290 TraceCheckUtils]: 198: Hoare triple {6912#(<= |ULTIMATE.start_main_~i~0#1| 39)} assume !(0 == main_~q~0#1); {6912#(<= |ULTIMATE.start_main_~i~0#1| 39)} is VALID [2022-02-20 14:27:22,200 INFO L290 TraceCheckUtils]: 199: Hoare triple {6912#(<= |ULTIMATE.start_main_~i~0#1| 39)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {6912#(<= |ULTIMATE.start_main_~i~0#1| 39)} is VALID [2022-02-20 14:27:22,200 INFO L290 TraceCheckUtils]: 200: Hoare triple {6912#(<= |ULTIMATE.start_main_~i~0#1| 39)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {6912#(<= |ULTIMATE.start_main_~i~0#1| 39)} is VALID [2022-02-20 14:27:22,201 INFO L290 TraceCheckUtils]: 201: Hoare triple {6912#(<= |ULTIMATE.start_main_~i~0#1| 39)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {6913#(<= |ULTIMATE.start_main_~i~0#1| 40)} is VALID [2022-02-20 14:27:22,201 INFO L290 TraceCheckUtils]: 202: Hoare triple {6913#(<= |ULTIMATE.start_main_~i~0#1| 40)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {6913#(<= |ULTIMATE.start_main_~i~0#1| 40)} is VALID [2022-02-20 14:27:22,201 INFO L290 TraceCheckUtils]: 203: Hoare triple {6913#(<= |ULTIMATE.start_main_~i~0#1| 40)} assume !(0 == main_~q~0#1); {6913#(<= |ULTIMATE.start_main_~i~0#1| 40)} is VALID [2022-02-20 14:27:22,202 INFO L290 TraceCheckUtils]: 204: Hoare triple {6913#(<= |ULTIMATE.start_main_~i~0#1| 40)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {6913#(<= |ULTIMATE.start_main_~i~0#1| 40)} is VALID [2022-02-20 14:27:22,202 INFO L290 TraceCheckUtils]: 205: Hoare triple {6913#(<= |ULTIMATE.start_main_~i~0#1| 40)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {6913#(<= |ULTIMATE.start_main_~i~0#1| 40)} is VALID [2022-02-20 14:27:22,202 INFO L290 TraceCheckUtils]: 206: Hoare triple {6913#(<= |ULTIMATE.start_main_~i~0#1| 40)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {6914#(<= |ULTIMATE.start_main_~i~0#1| 41)} is VALID [2022-02-20 14:27:22,202 INFO L290 TraceCheckUtils]: 207: Hoare triple {6914#(<= |ULTIMATE.start_main_~i~0#1| 41)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {6914#(<= |ULTIMATE.start_main_~i~0#1| 41)} is VALID [2022-02-20 14:27:22,203 INFO L290 TraceCheckUtils]: 208: Hoare triple {6914#(<= |ULTIMATE.start_main_~i~0#1| 41)} assume !(0 == main_~q~0#1); {6914#(<= |ULTIMATE.start_main_~i~0#1| 41)} is VALID [2022-02-20 14:27:22,203 INFO L290 TraceCheckUtils]: 209: Hoare triple {6914#(<= |ULTIMATE.start_main_~i~0#1| 41)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {6914#(<= |ULTIMATE.start_main_~i~0#1| 41)} is VALID [2022-02-20 14:27:22,203 INFO L290 TraceCheckUtils]: 210: Hoare triple {6914#(<= |ULTIMATE.start_main_~i~0#1| 41)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {6914#(<= |ULTIMATE.start_main_~i~0#1| 41)} is VALID [2022-02-20 14:27:22,204 INFO L290 TraceCheckUtils]: 211: Hoare triple {6914#(<= |ULTIMATE.start_main_~i~0#1| 41)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {6915#(<= |ULTIMATE.start_main_~i~0#1| 42)} is VALID [2022-02-20 14:27:22,204 INFO L290 TraceCheckUtils]: 212: Hoare triple {6915#(<= |ULTIMATE.start_main_~i~0#1| 42)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {6915#(<= |ULTIMATE.start_main_~i~0#1| 42)} is VALID [2022-02-20 14:27:22,204 INFO L290 TraceCheckUtils]: 213: Hoare triple {6915#(<= |ULTIMATE.start_main_~i~0#1| 42)} assume !(0 == main_~q~0#1); {6915#(<= |ULTIMATE.start_main_~i~0#1| 42)} is VALID [2022-02-20 14:27:22,205 INFO L290 TraceCheckUtils]: 214: Hoare triple {6915#(<= |ULTIMATE.start_main_~i~0#1| 42)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {6915#(<= |ULTIMATE.start_main_~i~0#1| 42)} is VALID [2022-02-20 14:27:22,205 INFO L290 TraceCheckUtils]: 215: Hoare triple {6915#(<= |ULTIMATE.start_main_~i~0#1| 42)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {6915#(<= |ULTIMATE.start_main_~i~0#1| 42)} is VALID [2022-02-20 14:27:22,205 INFO L290 TraceCheckUtils]: 216: Hoare triple {6915#(<= |ULTIMATE.start_main_~i~0#1| 42)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {6916#(<= |ULTIMATE.start_main_~i~0#1| 43)} is VALID [2022-02-20 14:27:22,205 INFO L290 TraceCheckUtils]: 217: Hoare triple {6916#(<= |ULTIMATE.start_main_~i~0#1| 43)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {6916#(<= |ULTIMATE.start_main_~i~0#1| 43)} is VALID [2022-02-20 14:27:22,206 INFO L290 TraceCheckUtils]: 218: Hoare triple {6916#(<= |ULTIMATE.start_main_~i~0#1| 43)} assume !(0 == main_~q~0#1); {6916#(<= |ULTIMATE.start_main_~i~0#1| 43)} is VALID [2022-02-20 14:27:22,206 INFO L290 TraceCheckUtils]: 219: Hoare triple {6916#(<= |ULTIMATE.start_main_~i~0#1| 43)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {6916#(<= |ULTIMATE.start_main_~i~0#1| 43)} is VALID [2022-02-20 14:27:22,206 INFO L290 TraceCheckUtils]: 220: Hoare triple {6916#(<= |ULTIMATE.start_main_~i~0#1| 43)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {6916#(<= |ULTIMATE.start_main_~i~0#1| 43)} is VALID [2022-02-20 14:27:22,206 INFO L290 TraceCheckUtils]: 221: Hoare triple {6916#(<= |ULTIMATE.start_main_~i~0#1| 43)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {6917#(<= |ULTIMATE.start_main_~i~0#1| 44)} is VALID [2022-02-20 14:27:22,207 INFO L290 TraceCheckUtils]: 222: Hoare triple {6917#(<= |ULTIMATE.start_main_~i~0#1| 44)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {6917#(<= |ULTIMATE.start_main_~i~0#1| 44)} is VALID [2022-02-20 14:27:22,207 INFO L290 TraceCheckUtils]: 223: Hoare triple {6917#(<= |ULTIMATE.start_main_~i~0#1| 44)} assume !(0 == main_~q~0#1); {6917#(<= |ULTIMATE.start_main_~i~0#1| 44)} is VALID [2022-02-20 14:27:22,207 INFO L290 TraceCheckUtils]: 224: Hoare triple {6917#(<= |ULTIMATE.start_main_~i~0#1| 44)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {6917#(<= |ULTIMATE.start_main_~i~0#1| 44)} is VALID [2022-02-20 14:27:22,207 INFO L290 TraceCheckUtils]: 225: Hoare triple {6917#(<= |ULTIMATE.start_main_~i~0#1| 44)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {6917#(<= |ULTIMATE.start_main_~i~0#1| 44)} is VALID [2022-02-20 14:27:22,208 INFO L290 TraceCheckUtils]: 226: Hoare triple {6917#(<= |ULTIMATE.start_main_~i~0#1| 44)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {6918#(<= |ULTIMATE.start_main_~i~0#1| 45)} is VALID [2022-02-20 14:27:22,208 INFO L290 TraceCheckUtils]: 227: Hoare triple {6918#(<= |ULTIMATE.start_main_~i~0#1| 45)} assume !!(main_~i~0#1 < 1000000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~s~0#1.base, main_~s~0#1.offset := 0, 0; {6918#(<= |ULTIMATE.start_main_~i~0#1| 45)} is VALID [2022-02-20 14:27:22,208 INFO L290 TraceCheckUtils]: 228: Hoare triple {6918#(<= |ULTIMATE.start_main_~i~0#1| 45)} assume !(0 == main_~q~0#1); {6918#(<= |ULTIMATE.start_main_~i~0#1| 45)} is VALID [2022-02-20 14:27:22,209 INFO L290 TraceCheckUtils]: 229: Hoare triple {6918#(<= |ULTIMATE.start_main_~i~0#1| 45)} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {6918#(<= |ULTIMATE.start_main_~i~0#1| 45)} is VALID [2022-02-20 14:27:22,209 INFO L290 TraceCheckUtils]: 230: Hoare triple {6918#(<= |ULTIMATE.start_main_~i~0#1| 45)} call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4); {6918#(<= |ULTIMATE.start_main_~i~0#1| 45)} is VALID [2022-02-20 14:27:22,209 INFO L290 TraceCheckUtils]: 231: Hoare triple {6918#(<= |ULTIMATE.start_main_~i~0#1| 45)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {6919#(<= |ULTIMATE.start_main_~i~0#1| 46)} is VALID [2022-02-20 14:27:22,210 INFO L290 TraceCheckUtils]: 232: Hoare triple {6919#(<= |ULTIMATE.start_main_~i~0#1| 46)} assume !(main_~i~0#1 < 1000000); {6872#false} is VALID [2022-02-20 14:27:22,210 INFO L290 TraceCheckUtils]: 233: Hoare triple {6872#false} call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(main_#t~malloc6#1.base, main_#t~malloc6#1.offset, ~#a~0.base, 12 + ~#a~0.offset, 4);havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_~i~0#1 := 0; {6872#false} is VALID [2022-02-20 14:27:22,210 INFO L290 TraceCheckUtils]: 234: Hoare triple {6872#false} assume !!(main_~i~0#1 < 1000000);call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 4);main_~s1~0#1.base, main_~s1~0#1.offset := main_#t~mem8#1.base, main_#t~mem8#1.offset;havoc main_#t~mem8#1.base, main_#t~mem8#1.offset;main_#t~short10#1 := 3 != main_~i~0#1 && (main_~s1~0#1.base != 0 || main_~s1~0#1.offset != 0); {6872#false} is VALID [2022-02-20 14:27:22,210 INFO L290 TraceCheckUtils]: 235: Hoare triple {6872#false} assume main_#t~short10#1;call main_#t~mem9#1 := read~int(main_~s1~0#1.base, 4 + main_~s1~0#1.offset, 4);main_#t~short10#1 := 0 == main_#t~mem9#1; {6872#false} is VALID [2022-02-20 14:27:22,210 INFO L290 TraceCheckUtils]: 236: Hoare triple {6872#false} assume main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1;call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~s1~0#1.base, main_~s1~0#1.offset, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem11#1.base != 0 || main_#t~mem11#1.offset != 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {6872#false} is VALID [2022-02-20 14:27:22,210 INFO L290 TraceCheckUtils]: 237: Hoare triple {6872#false} assume 0 == __VERIFIER_assert_~cond#1; {6872#false} is VALID [2022-02-20 14:27:22,210 INFO L290 TraceCheckUtils]: 238: Hoare triple {6872#false} assume !false; {6872#false} is VALID [2022-02-20 14:27:22,212 INFO L134 CoverageAnalysis]: Checked inductivity of 5221 backedges. 0 proven. 5221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:27:22,213 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:27:22,213 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369472326] [2022-02-20 14:27:22,213 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369472326] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:27:22,213 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1213479369] [2022-02-20 14:27:22,213 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-20 14:27:22,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:27:22,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:27:22,214 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:27:22,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process