./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-lopstr16/partial_lesser_bound.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/partial_lesser_bound.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 bb0dadf0e8f232b05f9d0197df303d37d10164a820174c4773d99bdc295fe4aa --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 14:26:53,914 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 14:26:53,916 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 14:26:53,947 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 14:26:53,947 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 14:26:53,950 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 14:26:53,952 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 14:26:53,955 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 14:26:53,957 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 14:26:53,961 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 14:26:53,962 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 14:26:53,963 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 14:26:53,964 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 14:26:53,966 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 14:26:53,969 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 14:26:53,972 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 14:26:53,973 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 14:26:53,974 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 14:26:53,977 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 14:26:53,980 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 14:26:53,981 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 14:26:53,982 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 14:26:53,984 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 14:26:53,985 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 14:26:53,991 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 14:26:53,993 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 14:26:53,993 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 14:26:53,995 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 14:26:53,996 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 14:26:53,997 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 14:26:53,998 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 14:26:53,998 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 14:26:54,000 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 14:26:54,001 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 14:26:54,002 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 14:26:54,002 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 14:26:54,003 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 14:26:54,003 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 14:26:54,003 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 14:26:54,004 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 14:26:54,005 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 14:26:54,006 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:26:54,034 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 14:26:54,035 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 14:26:54,036 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 14:26:54,036 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 14:26:54,037 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 14:26:54,037 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 14:26:54,038 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 14:26:54,038 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 14:26:54,038 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 14:26:54,039 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 14:26:54,039 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 14:26:54,040 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 14:26:54,040 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 14:26:54,040 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 14:26:54,040 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 14:26:54,040 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 14:26:54,040 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 14:26:54,040 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 14:26:54,040 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 14:26:54,040 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 14:26:54,041 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 14:26:54,041 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 14:26:54,041 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 14:26:54,041 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 14:26:54,041 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:26:54,041 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 14:26:54,041 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 14:26:54,041 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 14:26:54,041 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 14:26:54,042 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 14:26:54,042 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 14:26:54,042 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 14:26:54,042 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 14:26:54,042 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 -> bb0dadf0e8f232b05f9d0197df303d37d10164a820174c4773d99bdc295fe4aa [2022-02-20 14:26:54,259 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 14:26:54,283 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 14:26:54,286 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 14:26:54,287 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 14:26:54,287 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 14:26:54,288 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-lopstr16/partial_lesser_bound.i [2022-02-20 14:26:54,353 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e963a03f3/0c19843c8d2541cdbf0412c34664eaa1/FLAGce6479bdb [2022-02-20 14:26:54,709 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 14:26:54,709 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-lopstr16/partial_lesser_bound.i [2022-02-20 14:26:54,714 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e963a03f3/0c19843c8d2541cdbf0412c34664eaa1/FLAGce6479bdb [2022-02-20 14:26:54,725 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e963a03f3/0c19843c8d2541cdbf0412c34664eaa1 [2022-02-20 14:26:54,728 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 14:26:54,729 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 14:26:54,730 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 14:26:54,731 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 14:26:54,733 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 14:26:54,734 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:26:54" (1/1) ... [2022-02-20 14:26:54,735 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d6b357f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:54, skipping insertion in model container [2022-02-20 14:26:54,735 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:26:54" (1/1) ... [2022-02-20 14:26:54,740 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 14:26:54,751 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 14:26:54,887 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/partial_lesser_bound.i[813,826] [2022-02-20 14:26:54,902 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:26:54,912 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 14:26:54,923 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/partial_lesser_bound.i[813,826] [2022-02-20 14:26:54,928 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:26:54,942 INFO L208 MainTranslator]: Completed translation [2022-02-20 14:26:54,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:54 WrapperNode [2022-02-20 14:26:54,943 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 14:26:54,944 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 14:26:54,944 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 14:26:54,944 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 14:26:54,951 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:26:54" (1/1) ... [2022-02-20 14:26:54,959 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:26:54" (1/1) ... [2022-02-20 14:26:54,977 INFO L137 Inliner]: procedures = 18, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 51 [2022-02-20 14:26:54,978 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 14:26:54,979 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 14:26:54,979 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 14:26:54,979 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 14:26:54,986 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:54" (1/1) ... [2022-02-20 14:26:54,986 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:54" (1/1) ... [2022-02-20 14:26:54,988 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:54" (1/1) ... [2022-02-20 14:26:54,988 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:54" (1/1) ... [2022-02-20 14:26:54,993 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:54" (1/1) ... [2022-02-20 14:26:54,997 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:54" (1/1) ... [2022-02-20 14:26:54,998 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:54" (1/1) ... [2022-02-20 14:26:55,000 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 14:26:55,007 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 14:26:55,007 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 14:26:55,007 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 14:26:55,009 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:54" (1/1) ... [2022-02-20 14:26:55,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:26:55,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:26:55,053 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:26:55,077 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:26:55,095 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 14:26:55,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 14:26:55,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 14:26:55,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 14:26:55,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 14:26:55,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 14:26:55,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 14:26:55,178 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 14:26:55,180 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 14:26:55,375 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 14:26:55,381 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 14:26:55,382 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-20 14:26:55,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:26:55 BoogieIcfgContainer [2022-02-20 14:26:55,384 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 14:26:55,385 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 14:26:55,385 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 14:26:55,389 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 14:26:55,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 02:26:54" (1/3) ... [2022-02-20 14:26:55,390 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25ac6368 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:26:55, skipping insertion in model container [2022-02-20 14:26:55,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:54" (2/3) ... [2022-02-20 14:26:55,390 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25ac6368 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:26:55, skipping insertion in model container [2022-02-20 14:26:55,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:26:55" (3/3) ... [2022-02-20 14:26:55,392 INFO L111 eAbstractionObserver]: Analyzing ICFG partial_lesser_bound.i [2022-02-20 14:26:55,396 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 14:26:55,396 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 14:26:55,436 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 14:26:55,442 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:26:55,442 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 14:26:55,454 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 16 states have (on average 1.5) 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:26:55,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 14:26:55,458 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:26:55,458 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:26:55,458 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:26:55,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:26:55,463 INFO L85 PathProgramCache]: Analyzing trace with hash -2016449835, now seen corresponding path program 1 times [2022-02-20 14:26:55,471 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:26:55,471 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116149366] [2022-02-20 14:26:55,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:26:55,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:26:55,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:55,683 INFO L290 TraceCheckUtils]: 0: Hoare triple {21#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(23, 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);~i~0 := 0; {21#true} is VALID [2022-02-20 14:26:55,684 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~post2#1, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~post4#1;~i~0 := 0; {23#(= ~i~0 0)} is VALID [2022-02-20 14:26:55,689 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#(= ~i~0 0)} assume !(~i~0 < 1000000); {22#false} is VALID [2022-02-20 14:26:55,689 INFO L290 TraceCheckUtils]: 3: Hoare triple {22#false} ~i~0 := 0; {22#false} is VALID [2022-02-20 14:26:55,689 INFO L290 TraceCheckUtils]: 4: Hoare triple {22#false} assume !(~i~0 < 500000); {22#false} is VALID [2022-02-20 14:26:55,690 INFO L290 TraceCheckUtils]: 5: Hoare triple {22#false} ~i~0 := 0; {22#false} is VALID [2022-02-20 14:26:55,690 INFO L290 TraceCheckUtils]: 6: Hoare triple {22#false} assume !!(~i~0 < 500000);call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem5#1.base != 0 || main_#t~mem5#1.offset != 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {22#false} is VALID [2022-02-20 14:26:55,690 INFO L290 TraceCheckUtils]: 7: Hoare triple {22#false} assume 0 == __VERIFIER_assert_~cond#1; {22#false} is VALID [2022-02-20 14:26:55,690 INFO L290 TraceCheckUtils]: 8: Hoare triple {22#false} assume !false; {22#false} is VALID [2022-02-20 14:26:55,692 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:26:55,692 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:26:55,692 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116149366] [2022-02-20 14:26:55,693 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116149366] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:26:55,693 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:26:55,693 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:26:55,695 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488525281] [2022-02-20 14:26:55,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:26:55,700 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:26:55,702 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:26:55,705 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:26:55,720 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:26:55,720 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:26:55,720 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:26:55,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:26:55,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:26:55,745 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.5) 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 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:26:55,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:55,841 INFO L93 Difference]: Finished difference Result 42 states and 59 transitions. [2022-02-20 14:26:55,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:26:55,842 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:26:55,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:26:55,845 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:26:55,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2022-02-20 14:26:55,855 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:26:55,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2022-02-20 14:26:55,864 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 59 transitions. [2022-02-20 14:26:55,950 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:26:55,958 INFO L225 Difference]: With dead ends: 42 [2022-02-20 14:26:55,958 INFO L226 Difference]: Without dead ends: 24 [2022-02-20 14:26:55,961 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:26:55,964 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 7 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:26:55,966 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 21 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:26:55,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-02-20 14:26:55,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 16. [2022-02-20 14:26:55,988 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:26:55,989 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:55,990 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:55,990 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:55,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:55,993 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-02-20 14:26:55,993 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-02-20 14:26:55,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:26:55,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:26:55,994 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 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 24 states. [2022-02-20 14:26:55,995 INFO L87 Difference]: Start difference. First operand has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 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 24 states. [2022-02-20 14:26:55,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:55,998 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-02-20 14:26:55,998 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-02-20 14:26:55,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:26:55,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:26:55,999 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:26:55,999 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:26:55,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:56,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2022-02-20 14:26:56,002 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 9 [2022-02-20 14:26:56,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:26:56,002 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2022-02-20 14:26:56,003 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:26:56,003 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-02-20 14:26:56,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 14:26:56,003 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:26:56,004 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:26:56,004 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 14:26:56,004 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:26:56,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:26:56,005 INFO L85 PathProgramCache]: Analyzing trace with hash 2031054225, now seen corresponding path program 1 times [2022-02-20 14:26:56,005 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:26:56,006 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965315342] [2022-02-20 14:26:56,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:26:56,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:26:56,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:56,078 INFO L290 TraceCheckUtils]: 0: Hoare triple {147#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(23, 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);~i~0 := 0; {147#true} is VALID [2022-02-20 14:26:56,079 INFO L290 TraceCheckUtils]: 1: Hoare triple {147#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~post2#1, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~post4#1;~i~0 := 0; {149#(= ~i~0 0)} is VALID [2022-02-20 14:26:56,081 INFO L290 TraceCheckUtils]: 2: Hoare triple {149#(= ~i~0 0)} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {149#(= ~i~0 0)} is VALID [2022-02-20 14:26:56,081 INFO L290 TraceCheckUtils]: 3: Hoare triple {149#(= ~i~0 0)} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {150#(<= ~i~0 1)} is VALID [2022-02-20 14:26:56,083 INFO L290 TraceCheckUtils]: 4: Hoare triple {150#(<= ~i~0 1)} assume !(~i~0 < 1000000); {148#false} is VALID [2022-02-20 14:26:56,087 INFO L290 TraceCheckUtils]: 5: Hoare triple {148#false} ~i~0 := 0; {148#false} is VALID [2022-02-20 14:26:56,087 INFO L290 TraceCheckUtils]: 6: Hoare triple {148#false} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {148#false} is VALID [2022-02-20 14:26:56,087 INFO L290 TraceCheckUtils]: 7: Hoare triple {148#false} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {148#false} is VALID [2022-02-20 14:26:56,088 INFO L290 TraceCheckUtils]: 8: Hoare triple {148#false} assume !(~i~0 < 500000); {148#false} is VALID [2022-02-20 14:26:56,088 INFO L290 TraceCheckUtils]: 9: Hoare triple {148#false} ~i~0 := 0; {148#false} is VALID [2022-02-20 14:26:56,088 INFO L290 TraceCheckUtils]: 10: Hoare triple {148#false} assume !!(~i~0 < 500000);call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem5#1.base != 0 || main_#t~mem5#1.offset != 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {148#false} is VALID [2022-02-20 14:26:56,088 INFO L290 TraceCheckUtils]: 11: Hoare triple {148#false} assume 0 == __VERIFIER_assert_~cond#1; {148#false} is VALID [2022-02-20 14:26:56,088 INFO L290 TraceCheckUtils]: 12: Hoare triple {148#false} assume !false; {148#false} is VALID [2022-02-20 14:26:56,089 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 14:26:56,089 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:26:56,089 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965315342] [2022-02-20 14:26:56,090 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965315342] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:26:56,090 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1072612126] [2022-02-20 14:26:56,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:26:56,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:26:56,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:26:56,092 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:26:56,095 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:26:56,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:56,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 14:26:56,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:56,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:26:56,249 INFO L290 TraceCheckUtils]: 0: Hoare triple {147#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(23, 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);~i~0 := 0; {147#true} is VALID [2022-02-20 14:26:56,250 INFO L290 TraceCheckUtils]: 1: Hoare triple {147#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~post2#1, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~post4#1;~i~0 := 0; {157#(<= ~i~0 0)} is VALID [2022-02-20 14:26:56,250 INFO L290 TraceCheckUtils]: 2: Hoare triple {157#(<= ~i~0 0)} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {157#(<= ~i~0 0)} is VALID [2022-02-20 14:26:56,251 INFO L290 TraceCheckUtils]: 3: Hoare triple {157#(<= ~i~0 0)} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {150#(<= ~i~0 1)} is VALID [2022-02-20 14:26:56,252 INFO L290 TraceCheckUtils]: 4: Hoare triple {150#(<= ~i~0 1)} assume !(~i~0 < 1000000); {148#false} is VALID [2022-02-20 14:26:56,252 INFO L290 TraceCheckUtils]: 5: Hoare triple {148#false} ~i~0 := 0; {148#false} is VALID [2022-02-20 14:26:56,252 INFO L290 TraceCheckUtils]: 6: Hoare triple {148#false} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {148#false} is VALID [2022-02-20 14:26:56,252 INFO L290 TraceCheckUtils]: 7: Hoare triple {148#false} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {148#false} is VALID [2022-02-20 14:26:56,253 INFO L290 TraceCheckUtils]: 8: Hoare triple {148#false} assume !(~i~0 < 500000); {148#false} is VALID [2022-02-20 14:26:56,253 INFO L290 TraceCheckUtils]: 9: Hoare triple {148#false} ~i~0 := 0; {148#false} is VALID [2022-02-20 14:26:56,253 INFO L290 TraceCheckUtils]: 10: Hoare triple {148#false} assume !!(~i~0 < 500000);call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem5#1.base != 0 || main_#t~mem5#1.offset != 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {148#false} is VALID [2022-02-20 14:26:56,253 INFO L290 TraceCheckUtils]: 11: Hoare triple {148#false} assume 0 == __VERIFIER_assert_~cond#1; {148#false} is VALID [2022-02-20 14:26:56,254 INFO L290 TraceCheckUtils]: 12: Hoare triple {148#false} assume !false; {148#false} is VALID [2022-02-20 14:26:56,254 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 14:26:56,254 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:26:56,354 INFO L290 TraceCheckUtils]: 12: Hoare triple {148#false} assume !false; {148#false} is VALID [2022-02-20 14:26:56,354 INFO L290 TraceCheckUtils]: 11: Hoare triple {148#false} assume 0 == __VERIFIER_assert_~cond#1; {148#false} is VALID [2022-02-20 14:26:56,360 INFO L290 TraceCheckUtils]: 10: Hoare triple {148#false} assume !!(~i~0 < 500000);call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem5#1.base != 0 || main_#t~mem5#1.offset != 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {148#false} is VALID [2022-02-20 14:26:56,361 INFO L290 TraceCheckUtils]: 9: Hoare triple {148#false} ~i~0 := 0; {148#false} is VALID [2022-02-20 14:26:56,361 INFO L290 TraceCheckUtils]: 8: Hoare triple {148#false} assume !(~i~0 < 500000); {148#false} is VALID [2022-02-20 14:26:56,361 INFO L290 TraceCheckUtils]: 7: Hoare triple {148#false} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {148#false} is VALID [2022-02-20 14:26:56,361 INFO L290 TraceCheckUtils]: 6: Hoare triple {148#false} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {148#false} is VALID [2022-02-20 14:26:56,362 INFO L290 TraceCheckUtils]: 5: Hoare triple {148#false} ~i~0 := 0; {148#false} is VALID [2022-02-20 14:26:56,363 INFO L290 TraceCheckUtils]: 4: Hoare triple {215#(< ~i~0 1000000)} assume !(~i~0 < 1000000); {148#false} is VALID [2022-02-20 14:26:56,363 INFO L290 TraceCheckUtils]: 3: Hoare triple {219#(< ~i~0 999999)} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {215#(< ~i~0 1000000)} is VALID [2022-02-20 14:26:56,364 INFO L290 TraceCheckUtils]: 2: Hoare triple {219#(< ~i~0 999999)} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {219#(< ~i~0 999999)} is VALID [2022-02-20 14:26:56,365 INFO L290 TraceCheckUtils]: 1: Hoare triple {147#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~post2#1, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~post4#1;~i~0 := 0; {219#(< ~i~0 999999)} is VALID [2022-02-20 14:26:56,365 INFO L290 TraceCheckUtils]: 0: Hoare triple {147#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(23, 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);~i~0 := 0; {147#true} is VALID [2022-02-20 14:26:56,365 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 14:26:56,366 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1072612126] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:26:56,366 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:26:56,366 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-02-20 14:26:56,367 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794135234] [2022-02-20 14:26:56,367 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:26:56,371 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 14:26:56,372 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:26:56,372 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:56,394 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:26:56,395 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 14:26:56,395 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:26:56,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 14:26:56,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-02-20 14:26:56,398 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:56,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:56,579 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2022-02-20 14:26:56,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 14:26:56,580 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 14:26:56,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:26:56,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:56,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2022-02-20 14:26:56,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:56,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2022-02-20 14:26:56,584 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 58 transitions. [2022-02-20 14:26:56,634 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:26:56,636 INFO L225 Difference]: With dead ends: 51 [2022-02-20 14:26:56,637 INFO L226 Difference]: Without dead ends: 40 [2022-02-20 14:26:56,639 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 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:26:56,641 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 53 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:26:56,642 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 17 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:26:56,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-02-20 14:26:56,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 24. [2022-02-20 14:26:56,655 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:26:56,655 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 24 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 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:26:56,656 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 24 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 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:26:56,658 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 24 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 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:26:56,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:56,661 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2022-02-20 14:26:56,661 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-02-20 14:26:56,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:26:56,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:26:56,664 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 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 40 states. [2022-02-20 14:26:56,665 INFO L87 Difference]: Start difference. First operand has 24 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 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 40 states. [2022-02-20 14:26:56,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:56,670 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2022-02-20 14:26:56,670 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-02-20 14:26:56,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:26:56,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:26:56,672 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:26:56,672 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:26:56,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 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:26:56,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2022-02-20 14:26:56,679 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 13 [2022-02-20 14:26:56,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:26:56,680 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-02-20 14:26:56,680 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:56,680 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-02-20 14:26:56,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 14:26:56,681 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:26:56,682 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:26:56,713 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:26:56,895 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:26:56,896 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:26:56,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:26:56,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1754797751, now seen corresponding path program 2 times [2022-02-20 14:26:56,897 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:26:56,897 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6732370] [2022-02-20 14:26:56,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:26:56,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:26:56,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:57,079 INFO L290 TraceCheckUtils]: 0: Hoare triple {408#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(23, 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);~i~0 := 0; {408#true} is VALID [2022-02-20 14:26:57,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {408#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~post2#1, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~post4#1;~i~0 := 0; {410#(= ~i~0 0)} is VALID [2022-02-20 14:26:57,084 INFO L290 TraceCheckUtils]: 2: Hoare triple {410#(= ~i~0 0)} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {410#(= ~i~0 0)} is VALID [2022-02-20 14:26:57,085 INFO L290 TraceCheckUtils]: 3: Hoare triple {410#(= ~i~0 0)} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {411#(<= ~i~0 1)} is VALID [2022-02-20 14:26:57,085 INFO L290 TraceCheckUtils]: 4: Hoare triple {411#(<= ~i~0 1)} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {411#(<= ~i~0 1)} is VALID [2022-02-20 14:26:57,086 INFO L290 TraceCheckUtils]: 5: Hoare triple {411#(<= ~i~0 1)} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {412#(<= ~i~0 2)} is VALID [2022-02-20 14:26:57,087 INFO L290 TraceCheckUtils]: 6: Hoare triple {412#(<= ~i~0 2)} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {412#(<= ~i~0 2)} is VALID [2022-02-20 14:26:57,091 INFO L290 TraceCheckUtils]: 7: Hoare triple {412#(<= ~i~0 2)} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {413#(<= ~i~0 3)} is VALID [2022-02-20 14:26:57,092 INFO L290 TraceCheckUtils]: 8: Hoare triple {413#(<= ~i~0 3)} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {413#(<= ~i~0 3)} is VALID [2022-02-20 14:26:57,093 INFO L290 TraceCheckUtils]: 9: Hoare triple {413#(<= ~i~0 3)} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {414#(<= ~i~0 4)} is VALID [2022-02-20 14:26:57,094 INFO L290 TraceCheckUtils]: 10: Hoare triple {414#(<= ~i~0 4)} assume !(~i~0 < 1000000); {409#false} is VALID [2022-02-20 14:26:57,094 INFO L290 TraceCheckUtils]: 11: Hoare triple {409#false} ~i~0 := 0; {409#false} is VALID [2022-02-20 14:26:57,094 INFO L290 TraceCheckUtils]: 12: Hoare triple {409#false} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {409#false} is VALID [2022-02-20 14:26:57,094 INFO L290 TraceCheckUtils]: 13: Hoare triple {409#false} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {409#false} is VALID [2022-02-20 14:26:57,095 INFO L290 TraceCheckUtils]: 14: Hoare triple {409#false} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {409#false} is VALID [2022-02-20 14:26:57,095 INFO L290 TraceCheckUtils]: 15: Hoare triple {409#false} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {409#false} is VALID [2022-02-20 14:26:57,095 INFO L290 TraceCheckUtils]: 16: Hoare triple {409#false} assume !(~i~0 < 500000); {409#false} is VALID [2022-02-20 14:26:57,095 INFO L290 TraceCheckUtils]: 17: Hoare triple {409#false} ~i~0 := 0; {409#false} is VALID [2022-02-20 14:26:57,095 INFO L290 TraceCheckUtils]: 18: Hoare triple {409#false} assume !!(~i~0 < 500000);call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem5#1.base != 0 || main_#t~mem5#1.offset != 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {409#false} is VALID [2022-02-20 14:26:57,096 INFO L290 TraceCheckUtils]: 19: Hoare triple {409#false} assume 0 == __VERIFIER_assert_~cond#1; {409#false} is VALID [2022-02-20 14:26:57,096 INFO L290 TraceCheckUtils]: 20: Hoare triple {409#false} assume !false; {409#false} is VALID [2022-02-20 14:26:57,096 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 14:26:57,097 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:26:57,097 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6732370] [2022-02-20 14:26:57,099 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6732370] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:26:57,099 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1630293047] [2022-02-20 14:26:57,099 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 14:26:57,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:26:57,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:26:57,101 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:26:57,123 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:26:57,212 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 14:26:57,212 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:26:57,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 14:26:57,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:57,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:26:57,402 INFO L290 TraceCheckUtils]: 0: Hoare triple {408#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(23, 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);~i~0 := 0; {408#true} is VALID [2022-02-20 14:26:57,403 INFO L290 TraceCheckUtils]: 1: Hoare triple {408#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~post2#1, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~post4#1;~i~0 := 0; {421#(<= ~i~0 0)} is VALID [2022-02-20 14:26:57,404 INFO L290 TraceCheckUtils]: 2: Hoare triple {421#(<= ~i~0 0)} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {421#(<= ~i~0 0)} is VALID [2022-02-20 14:26:57,405 INFO L290 TraceCheckUtils]: 3: Hoare triple {421#(<= ~i~0 0)} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {411#(<= ~i~0 1)} is VALID [2022-02-20 14:26:57,405 INFO L290 TraceCheckUtils]: 4: Hoare triple {411#(<= ~i~0 1)} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {411#(<= ~i~0 1)} is VALID [2022-02-20 14:26:57,406 INFO L290 TraceCheckUtils]: 5: Hoare triple {411#(<= ~i~0 1)} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {412#(<= ~i~0 2)} is VALID [2022-02-20 14:26:57,406 INFO L290 TraceCheckUtils]: 6: Hoare triple {412#(<= ~i~0 2)} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {412#(<= ~i~0 2)} is VALID [2022-02-20 14:26:57,407 INFO L290 TraceCheckUtils]: 7: Hoare triple {412#(<= ~i~0 2)} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {413#(<= ~i~0 3)} is VALID [2022-02-20 14:26:57,407 INFO L290 TraceCheckUtils]: 8: Hoare triple {413#(<= ~i~0 3)} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {413#(<= ~i~0 3)} is VALID [2022-02-20 14:26:57,408 INFO L290 TraceCheckUtils]: 9: Hoare triple {413#(<= ~i~0 3)} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {414#(<= ~i~0 4)} is VALID [2022-02-20 14:26:57,408 INFO L290 TraceCheckUtils]: 10: Hoare triple {414#(<= ~i~0 4)} assume !(~i~0 < 1000000); {409#false} is VALID [2022-02-20 14:26:57,409 INFO L290 TraceCheckUtils]: 11: Hoare triple {409#false} ~i~0 := 0; {409#false} is VALID [2022-02-20 14:26:57,409 INFO L290 TraceCheckUtils]: 12: Hoare triple {409#false} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {409#false} is VALID [2022-02-20 14:26:57,409 INFO L290 TraceCheckUtils]: 13: Hoare triple {409#false} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {409#false} is VALID [2022-02-20 14:26:57,409 INFO L290 TraceCheckUtils]: 14: Hoare triple {409#false} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {409#false} is VALID [2022-02-20 14:26:57,410 INFO L290 TraceCheckUtils]: 15: Hoare triple {409#false} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {409#false} is VALID [2022-02-20 14:26:57,410 INFO L290 TraceCheckUtils]: 16: Hoare triple {409#false} assume !(~i~0 < 500000); {409#false} is VALID [2022-02-20 14:26:57,410 INFO L290 TraceCheckUtils]: 17: Hoare triple {409#false} ~i~0 := 0; {409#false} is VALID [2022-02-20 14:26:57,410 INFO L290 TraceCheckUtils]: 18: Hoare triple {409#false} assume !!(~i~0 < 500000);call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem5#1.base != 0 || main_#t~mem5#1.offset != 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {409#false} is VALID [2022-02-20 14:26:57,411 INFO L290 TraceCheckUtils]: 19: Hoare triple {409#false} assume 0 == __VERIFIER_assert_~cond#1; {409#false} is VALID [2022-02-20 14:26:57,411 INFO L290 TraceCheckUtils]: 20: Hoare triple {409#false} assume !false; {409#false} is VALID [2022-02-20 14:26:57,411 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 14:26:57,411 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:26:57,589 INFO L290 TraceCheckUtils]: 20: Hoare triple {409#false} assume !false; {409#false} is VALID [2022-02-20 14:26:57,589 INFO L290 TraceCheckUtils]: 19: Hoare triple {409#false} assume 0 == __VERIFIER_assert_~cond#1; {409#false} is VALID [2022-02-20 14:26:57,589 INFO L290 TraceCheckUtils]: 18: Hoare triple {409#false} assume !!(~i~0 < 500000);call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem5#1.base != 0 || main_#t~mem5#1.offset != 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {409#false} is VALID [2022-02-20 14:26:57,590 INFO L290 TraceCheckUtils]: 17: Hoare triple {409#false} ~i~0 := 0; {409#false} is VALID [2022-02-20 14:26:57,590 INFO L290 TraceCheckUtils]: 16: Hoare triple {409#false} assume !(~i~0 < 500000); {409#false} is VALID [2022-02-20 14:26:57,590 INFO L290 TraceCheckUtils]: 15: Hoare triple {409#false} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {409#false} is VALID [2022-02-20 14:26:57,590 INFO L290 TraceCheckUtils]: 14: Hoare triple {409#false} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {409#false} is VALID [2022-02-20 14:26:57,591 INFO L290 TraceCheckUtils]: 13: Hoare triple {409#false} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {409#false} is VALID [2022-02-20 14:26:57,591 INFO L290 TraceCheckUtils]: 12: Hoare triple {409#false} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {409#false} is VALID [2022-02-20 14:26:57,591 INFO L290 TraceCheckUtils]: 11: Hoare triple {409#false} ~i~0 := 0; {409#false} is VALID [2022-02-20 14:26:57,592 INFO L290 TraceCheckUtils]: 10: Hoare triple {509#(< ~i~0 1000000)} assume !(~i~0 < 1000000); {409#false} is VALID [2022-02-20 14:26:57,592 INFO L290 TraceCheckUtils]: 9: Hoare triple {513#(< ~i~0 999999)} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {509#(< ~i~0 1000000)} is VALID [2022-02-20 14:26:57,593 INFO L290 TraceCheckUtils]: 8: Hoare triple {513#(< ~i~0 999999)} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {513#(< ~i~0 999999)} is VALID [2022-02-20 14:26:57,593 INFO L290 TraceCheckUtils]: 7: Hoare triple {520#(< ~i~0 999998)} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {513#(< ~i~0 999999)} is VALID [2022-02-20 14:26:57,594 INFO L290 TraceCheckUtils]: 6: Hoare triple {520#(< ~i~0 999998)} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {520#(< ~i~0 999998)} is VALID [2022-02-20 14:26:57,595 INFO L290 TraceCheckUtils]: 5: Hoare triple {527#(< ~i~0 999997)} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {520#(< ~i~0 999998)} is VALID [2022-02-20 14:26:57,595 INFO L290 TraceCheckUtils]: 4: Hoare triple {527#(< ~i~0 999997)} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {527#(< ~i~0 999997)} is VALID [2022-02-20 14:26:57,598 INFO L290 TraceCheckUtils]: 3: Hoare triple {534#(< ~i~0 999996)} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {527#(< ~i~0 999997)} is VALID [2022-02-20 14:26:57,598 INFO L290 TraceCheckUtils]: 2: Hoare triple {534#(< ~i~0 999996)} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {534#(< ~i~0 999996)} is VALID [2022-02-20 14:26:57,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {408#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~post2#1, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~post4#1;~i~0 := 0; {534#(< ~i~0 999996)} is VALID [2022-02-20 14:26:57,599 INFO L290 TraceCheckUtils]: 0: Hoare triple {408#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(23, 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);~i~0 := 0; {408#true} is VALID [2022-02-20 14:26:57,599 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 14:26:57,600 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1630293047] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:26:57,600 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:26:57,600 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-02-20 14:26:57,600 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875316331] [2022-02-20 14:26:57,600 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:26:57,601 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-02-20 14:26:57,601 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:26:57,602 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:57,631 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:26:57,632 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 14:26:57,632 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:26:57,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 14:26:57,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-02-20 14:26:57,633 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:57,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:57,942 INFO L93 Difference]: Finished difference Result 89 states and 102 transitions. [2022-02-20 14:26:57,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 14:26:57,943 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-02-20 14:26:57,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:26:57,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:57,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 99 transitions. [2022-02-20 14:26:57,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:57,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 99 transitions. [2022-02-20 14:26:57,955 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 99 transitions. [2022-02-20 14:26:58,039 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:26:58,044 INFO L225 Difference]: With dead ends: 89 [2022-02-20 14:26:58,044 INFO L226 Difference]: Without dead ends: 76 [2022-02-20 14:26:58,045 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 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:26:58,048 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 115 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:26:58,048 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 29 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:26:58,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-02-20 14:26:58,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 42. [2022-02-20 14:26:58,076 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:26:58,076 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 42 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 41 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:58,076 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 42 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 41 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:58,077 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 42 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 41 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:58,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:58,081 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2022-02-20 14:26:58,081 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2022-02-20 14:26:58,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:26:58,082 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:26:58,082 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 41 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 76 states. [2022-02-20 14:26:58,082 INFO L87 Difference]: Start difference. First operand has 42 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 41 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 76 states. [2022-02-20 14:26:58,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:58,085 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2022-02-20 14:26:58,085 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2022-02-20 14:26:58,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:26:58,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:26:58,086 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:26:58,086 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:26:58,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 41 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:58,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2022-02-20 14:26:58,088 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 21 [2022-02-20 14:26:58,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:26:58,089 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2022-02-20 14:26:58,089 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:58,089 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2022-02-20 14:26:58,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-02-20 14:26:58,090 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:26:58,090 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:26:58,118 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:26:58,303 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-02-20 14:26:58,304 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:26:58,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:26:58,304 INFO L85 PathProgramCache]: Analyzing trace with hash -707072841, now seen corresponding path program 3 times [2022-02-20 14:26:58,305 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:26:58,305 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679654642] [2022-02-20 14:26:58,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:26:58,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:26:58,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:58,505 INFO L290 TraceCheckUtils]: 0: Hoare triple {873#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(23, 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);~i~0 := 0; {873#true} is VALID [2022-02-20 14:26:58,506 INFO L290 TraceCheckUtils]: 1: Hoare triple {873#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~post2#1, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~post4#1;~i~0 := 0; {875#(= ~i~0 0)} is VALID [2022-02-20 14:26:58,506 INFO L290 TraceCheckUtils]: 2: Hoare triple {875#(= ~i~0 0)} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {875#(= ~i~0 0)} is VALID [2022-02-20 14:26:58,507 INFO L290 TraceCheckUtils]: 3: Hoare triple {875#(= ~i~0 0)} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {876#(<= ~i~0 1)} is VALID [2022-02-20 14:26:58,508 INFO L290 TraceCheckUtils]: 4: Hoare triple {876#(<= ~i~0 1)} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {876#(<= ~i~0 1)} is VALID [2022-02-20 14:26:58,509 INFO L290 TraceCheckUtils]: 5: Hoare triple {876#(<= ~i~0 1)} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {877#(<= ~i~0 2)} is VALID [2022-02-20 14:26:58,509 INFO L290 TraceCheckUtils]: 6: Hoare triple {877#(<= ~i~0 2)} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {877#(<= ~i~0 2)} is VALID [2022-02-20 14:26:58,511 INFO L290 TraceCheckUtils]: 7: Hoare triple {877#(<= ~i~0 2)} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {878#(<= ~i~0 3)} is VALID [2022-02-20 14:26:58,512 INFO L290 TraceCheckUtils]: 8: Hoare triple {878#(<= ~i~0 3)} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {878#(<= ~i~0 3)} is VALID [2022-02-20 14:26:58,520 INFO L290 TraceCheckUtils]: 9: Hoare triple {878#(<= ~i~0 3)} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {879#(<= ~i~0 4)} is VALID [2022-02-20 14:26:58,521 INFO L290 TraceCheckUtils]: 10: Hoare triple {879#(<= ~i~0 4)} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {879#(<= ~i~0 4)} is VALID [2022-02-20 14:26:58,521 INFO L290 TraceCheckUtils]: 11: Hoare triple {879#(<= ~i~0 4)} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {880#(<= ~i~0 5)} is VALID [2022-02-20 14:26:58,522 INFO L290 TraceCheckUtils]: 12: Hoare triple {880#(<= ~i~0 5)} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {880#(<= ~i~0 5)} is VALID [2022-02-20 14:26:58,522 INFO L290 TraceCheckUtils]: 13: Hoare triple {880#(<= ~i~0 5)} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {881#(<= ~i~0 6)} is VALID [2022-02-20 14:26:58,523 INFO L290 TraceCheckUtils]: 14: Hoare triple {881#(<= ~i~0 6)} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {881#(<= ~i~0 6)} is VALID [2022-02-20 14:26:58,523 INFO L290 TraceCheckUtils]: 15: Hoare triple {881#(<= ~i~0 6)} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {882#(<= ~i~0 7)} is VALID [2022-02-20 14:26:58,524 INFO L290 TraceCheckUtils]: 16: Hoare triple {882#(<= ~i~0 7)} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {882#(<= ~i~0 7)} is VALID [2022-02-20 14:26:58,524 INFO L290 TraceCheckUtils]: 17: Hoare triple {882#(<= ~i~0 7)} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {883#(<= ~i~0 8)} is VALID [2022-02-20 14:26:58,525 INFO L290 TraceCheckUtils]: 18: Hoare triple {883#(<= ~i~0 8)} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {883#(<= ~i~0 8)} is VALID [2022-02-20 14:26:58,526 INFO L290 TraceCheckUtils]: 19: Hoare triple {883#(<= ~i~0 8)} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {884#(<= ~i~0 9)} is VALID [2022-02-20 14:26:58,526 INFO L290 TraceCheckUtils]: 20: Hoare triple {884#(<= ~i~0 9)} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {884#(<= ~i~0 9)} is VALID [2022-02-20 14:26:58,527 INFO L290 TraceCheckUtils]: 21: Hoare triple {884#(<= ~i~0 9)} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {885#(<= ~i~0 10)} is VALID [2022-02-20 14:26:58,527 INFO L290 TraceCheckUtils]: 22: Hoare triple {885#(<= ~i~0 10)} assume !(~i~0 < 1000000); {874#false} is VALID [2022-02-20 14:26:58,527 INFO L290 TraceCheckUtils]: 23: Hoare triple {874#false} ~i~0 := 0; {874#false} is VALID [2022-02-20 14:26:58,527 INFO L290 TraceCheckUtils]: 24: Hoare triple {874#false} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {874#false} is VALID [2022-02-20 14:26:58,528 INFO L290 TraceCheckUtils]: 25: Hoare triple {874#false} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {874#false} is VALID [2022-02-20 14:26:58,528 INFO L290 TraceCheckUtils]: 26: Hoare triple {874#false} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {874#false} is VALID [2022-02-20 14:26:58,528 INFO L290 TraceCheckUtils]: 27: Hoare triple {874#false} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {874#false} is VALID [2022-02-20 14:26:58,528 INFO L290 TraceCheckUtils]: 28: Hoare triple {874#false} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {874#false} is VALID [2022-02-20 14:26:58,528 INFO L290 TraceCheckUtils]: 29: Hoare triple {874#false} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {874#false} is VALID [2022-02-20 14:26:58,529 INFO L290 TraceCheckUtils]: 30: Hoare triple {874#false} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {874#false} is VALID [2022-02-20 14:26:58,529 INFO L290 TraceCheckUtils]: 31: Hoare triple {874#false} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {874#false} is VALID [2022-02-20 14:26:58,529 INFO L290 TraceCheckUtils]: 32: Hoare triple {874#false} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {874#false} is VALID [2022-02-20 14:26:58,529 INFO L290 TraceCheckUtils]: 33: Hoare triple {874#false} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {874#false} is VALID [2022-02-20 14:26:58,529 INFO L290 TraceCheckUtils]: 34: Hoare triple {874#false} assume !(~i~0 < 500000); {874#false} is VALID [2022-02-20 14:26:58,530 INFO L290 TraceCheckUtils]: 35: Hoare triple {874#false} ~i~0 := 0; {874#false} is VALID [2022-02-20 14:26:58,530 INFO L290 TraceCheckUtils]: 36: Hoare triple {874#false} assume !!(~i~0 < 500000);call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem5#1.base != 0 || main_#t~mem5#1.offset != 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {874#false} is VALID [2022-02-20 14:26:58,530 INFO L290 TraceCheckUtils]: 37: Hoare triple {874#false} assume 0 == __VERIFIER_assert_~cond#1; {874#false} is VALID [2022-02-20 14:26:58,530 INFO L290 TraceCheckUtils]: 38: Hoare triple {874#false} assume !false; {874#false} is VALID [2022-02-20 14:26:58,531 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-02-20 14:26:58,531 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:26:58,531 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679654642] [2022-02-20 14:26:58,531 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679654642] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:26:58,531 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987114217] [2022-02-20 14:26:58,532 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 14:26:58,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:26:58,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:26:58,533 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:26:58,544 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:26:59,022 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-02-20 14:26:59,022 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:26:59,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 14:26:59,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:59,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:26:59,207 INFO L290 TraceCheckUtils]: 0: Hoare triple {873#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(23, 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);~i~0 := 0; {873#true} is VALID [2022-02-20 14:26:59,208 INFO L290 TraceCheckUtils]: 1: Hoare triple {873#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~post2#1, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~post4#1;~i~0 := 0; {873#true} is VALID [2022-02-20 14:26:59,208 INFO L290 TraceCheckUtils]: 2: Hoare triple {873#true} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {873#true} is VALID [2022-02-20 14:26:59,208 INFO L290 TraceCheckUtils]: 3: Hoare triple {873#true} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {873#true} is VALID [2022-02-20 14:26:59,208 INFO L290 TraceCheckUtils]: 4: Hoare triple {873#true} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {873#true} is VALID [2022-02-20 14:26:59,208 INFO L290 TraceCheckUtils]: 5: Hoare triple {873#true} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {873#true} is VALID [2022-02-20 14:26:59,209 INFO L290 TraceCheckUtils]: 6: Hoare triple {873#true} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {873#true} is VALID [2022-02-20 14:26:59,209 INFO L290 TraceCheckUtils]: 7: Hoare triple {873#true} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {873#true} is VALID [2022-02-20 14:26:59,209 INFO L290 TraceCheckUtils]: 8: Hoare triple {873#true} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {873#true} is VALID [2022-02-20 14:26:59,209 INFO L290 TraceCheckUtils]: 9: Hoare triple {873#true} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {873#true} is VALID [2022-02-20 14:26:59,209 INFO L290 TraceCheckUtils]: 10: Hoare triple {873#true} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {873#true} is VALID [2022-02-20 14:26:59,209 INFO L290 TraceCheckUtils]: 11: Hoare triple {873#true} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {873#true} is VALID [2022-02-20 14:26:59,209 INFO L290 TraceCheckUtils]: 12: Hoare triple {873#true} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {873#true} is VALID [2022-02-20 14:26:59,209 INFO L290 TraceCheckUtils]: 13: Hoare triple {873#true} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {873#true} is VALID [2022-02-20 14:26:59,210 INFO L290 TraceCheckUtils]: 14: Hoare triple {873#true} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {873#true} is VALID [2022-02-20 14:26:59,210 INFO L290 TraceCheckUtils]: 15: Hoare triple {873#true} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {873#true} is VALID [2022-02-20 14:26:59,210 INFO L290 TraceCheckUtils]: 16: Hoare triple {873#true} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {873#true} is VALID [2022-02-20 14:26:59,210 INFO L290 TraceCheckUtils]: 17: Hoare triple {873#true} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {873#true} is VALID [2022-02-20 14:26:59,210 INFO L290 TraceCheckUtils]: 18: Hoare triple {873#true} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {873#true} is VALID [2022-02-20 14:26:59,210 INFO L290 TraceCheckUtils]: 19: Hoare triple {873#true} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {873#true} is VALID [2022-02-20 14:26:59,210 INFO L290 TraceCheckUtils]: 20: Hoare triple {873#true} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {873#true} is VALID [2022-02-20 14:26:59,210 INFO L290 TraceCheckUtils]: 21: Hoare triple {873#true} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {873#true} is VALID [2022-02-20 14:26:59,210 INFO L290 TraceCheckUtils]: 22: Hoare triple {873#true} assume !(~i~0 < 1000000); {873#true} is VALID [2022-02-20 14:26:59,211 INFO L290 TraceCheckUtils]: 23: Hoare triple {873#true} ~i~0 := 0; {958#(<= ~i~0 0)} is VALID [2022-02-20 14:26:59,211 INFO L290 TraceCheckUtils]: 24: Hoare triple {958#(<= ~i~0 0)} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {958#(<= ~i~0 0)} is VALID [2022-02-20 14:26:59,212 INFO L290 TraceCheckUtils]: 25: Hoare triple {958#(<= ~i~0 0)} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {876#(<= ~i~0 1)} is VALID [2022-02-20 14:26:59,212 INFO L290 TraceCheckUtils]: 26: Hoare triple {876#(<= ~i~0 1)} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {876#(<= ~i~0 1)} is VALID [2022-02-20 14:26:59,213 INFO L290 TraceCheckUtils]: 27: Hoare triple {876#(<= ~i~0 1)} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {877#(<= ~i~0 2)} is VALID [2022-02-20 14:26:59,214 INFO L290 TraceCheckUtils]: 28: Hoare triple {877#(<= ~i~0 2)} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {877#(<= ~i~0 2)} is VALID [2022-02-20 14:26:59,214 INFO L290 TraceCheckUtils]: 29: Hoare triple {877#(<= ~i~0 2)} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {878#(<= ~i~0 3)} is VALID [2022-02-20 14:26:59,215 INFO L290 TraceCheckUtils]: 30: Hoare triple {878#(<= ~i~0 3)} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {878#(<= ~i~0 3)} is VALID [2022-02-20 14:26:59,215 INFO L290 TraceCheckUtils]: 31: Hoare triple {878#(<= ~i~0 3)} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {879#(<= ~i~0 4)} is VALID [2022-02-20 14:26:59,216 INFO L290 TraceCheckUtils]: 32: Hoare triple {879#(<= ~i~0 4)} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {879#(<= ~i~0 4)} is VALID [2022-02-20 14:26:59,216 INFO L290 TraceCheckUtils]: 33: Hoare triple {879#(<= ~i~0 4)} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {880#(<= ~i~0 5)} is VALID [2022-02-20 14:26:59,217 INFO L290 TraceCheckUtils]: 34: Hoare triple {880#(<= ~i~0 5)} assume !(~i~0 < 500000); {874#false} is VALID [2022-02-20 14:26:59,218 INFO L290 TraceCheckUtils]: 35: Hoare triple {874#false} ~i~0 := 0; {874#false} is VALID [2022-02-20 14:26:59,218 INFO L290 TraceCheckUtils]: 36: Hoare triple {874#false} assume !!(~i~0 < 500000);call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem5#1.base != 0 || main_#t~mem5#1.offset != 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {874#false} is VALID [2022-02-20 14:26:59,218 INFO L290 TraceCheckUtils]: 37: Hoare triple {874#false} assume 0 == __VERIFIER_assert_~cond#1; {874#false} is VALID [2022-02-20 14:26:59,218 INFO L290 TraceCheckUtils]: 38: Hoare triple {874#false} assume !false; {874#false} is VALID [2022-02-20 14:26:59,219 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-02-20 14:26:59,219 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:26:59,417 INFO L290 TraceCheckUtils]: 38: Hoare triple {874#false} assume !false; {874#false} is VALID [2022-02-20 14:26:59,417 INFO L290 TraceCheckUtils]: 37: Hoare triple {874#false} assume 0 == __VERIFIER_assert_~cond#1; {874#false} is VALID [2022-02-20 14:26:59,417 INFO L290 TraceCheckUtils]: 36: Hoare triple {874#false} assume !!(~i~0 < 500000);call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem5#1.base != 0 || main_#t~mem5#1.offset != 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {874#false} is VALID [2022-02-20 14:26:59,417 INFO L290 TraceCheckUtils]: 35: Hoare triple {874#false} ~i~0 := 0; {874#false} is VALID [2022-02-20 14:26:59,418 INFO L290 TraceCheckUtils]: 34: Hoare triple {1016#(< ~i~0 500000)} assume !(~i~0 < 500000); {874#false} is VALID [2022-02-20 14:26:59,419 INFO L290 TraceCheckUtils]: 33: Hoare triple {1020#(< ~i~0 499999)} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1016#(< ~i~0 500000)} is VALID [2022-02-20 14:26:59,419 INFO L290 TraceCheckUtils]: 32: Hoare triple {1020#(< ~i~0 499999)} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {1020#(< ~i~0 499999)} is VALID [2022-02-20 14:26:59,419 INFO L290 TraceCheckUtils]: 31: Hoare triple {1027#(< ~i~0 499998)} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1020#(< ~i~0 499999)} is VALID [2022-02-20 14:26:59,420 INFO L290 TraceCheckUtils]: 30: Hoare triple {1027#(< ~i~0 499998)} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {1027#(< ~i~0 499998)} is VALID [2022-02-20 14:26:59,421 INFO L290 TraceCheckUtils]: 29: Hoare triple {1034#(< ~i~0 499997)} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1027#(< ~i~0 499998)} is VALID [2022-02-20 14:26:59,421 INFO L290 TraceCheckUtils]: 28: Hoare triple {1034#(< ~i~0 499997)} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {1034#(< ~i~0 499997)} is VALID [2022-02-20 14:26:59,422 INFO L290 TraceCheckUtils]: 27: Hoare triple {1041#(< ~i~0 499996)} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1034#(< ~i~0 499997)} is VALID [2022-02-20 14:26:59,422 INFO L290 TraceCheckUtils]: 26: Hoare triple {1041#(< ~i~0 499996)} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {1041#(< ~i~0 499996)} is VALID [2022-02-20 14:26:59,424 INFO L290 TraceCheckUtils]: 25: Hoare triple {1048#(< ~i~0 499995)} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1041#(< ~i~0 499996)} is VALID [2022-02-20 14:26:59,424 INFO L290 TraceCheckUtils]: 24: Hoare triple {1048#(< ~i~0 499995)} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {1048#(< ~i~0 499995)} is VALID [2022-02-20 14:26:59,425 INFO L290 TraceCheckUtils]: 23: Hoare triple {873#true} ~i~0 := 0; {1048#(< ~i~0 499995)} is VALID [2022-02-20 14:26:59,425 INFO L290 TraceCheckUtils]: 22: Hoare triple {873#true} assume !(~i~0 < 1000000); {873#true} is VALID [2022-02-20 14:26:59,426 INFO L290 TraceCheckUtils]: 21: Hoare triple {873#true} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {873#true} is VALID [2022-02-20 14:26:59,426 INFO L290 TraceCheckUtils]: 20: Hoare triple {873#true} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {873#true} is VALID [2022-02-20 14:26:59,426 INFO L290 TraceCheckUtils]: 19: Hoare triple {873#true} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {873#true} is VALID [2022-02-20 14:26:59,426 INFO L290 TraceCheckUtils]: 18: Hoare triple {873#true} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {873#true} is VALID [2022-02-20 14:26:59,426 INFO L290 TraceCheckUtils]: 17: Hoare triple {873#true} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {873#true} is VALID [2022-02-20 14:26:59,427 INFO L290 TraceCheckUtils]: 16: Hoare triple {873#true} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {873#true} is VALID [2022-02-20 14:26:59,427 INFO L290 TraceCheckUtils]: 15: Hoare triple {873#true} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {873#true} is VALID [2022-02-20 14:26:59,427 INFO L290 TraceCheckUtils]: 14: Hoare triple {873#true} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {873#true} is VALID [2022-02-20 14:26:59,427 INFO L290 TraceCheckUtils]: 13: Hoare triple {873#true} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {873#true} is VALID [2022-02-20 14:26:59,427 INFO L290 TraceCheckUtils]: 12: Hoare triple {873#true} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {873#true} is VALID [2022-02-20 14:26:59,428 INFO L290 TraceCheckUtils]: 11: Hoare triple {873#true} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {873#true} is VALID [2022-02-20 14:26:59,428 INFO L290 TraceCheckUtils]: 10: Hoare triple {873#true} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {873#true} is VALID [2022-02-20 14:26:59,428 INFO L290 TraceCheckUtils]: 9: Hoare triple {873#true} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {873#true} is VALID [2022-02-20 14:26:59,428 INFO L290 TraceCheckUtils]: 8: Hoare triple {873#true} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {873#true} is VALID [2022-02-20 14:26:59,428 INFO L290 TraceCheckUtils]: 7: Hoare triple {873#true} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {873#true} is VALID [2022-02-20 14:26:59,428 INFO L290 TraceCheckUtils]: 6: Hoare triple {873#true} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {873#true} is VALID [2022-02-20 14:26:59,429 INFO L290 TraceCheckUtils]: 5: Hoare triple {873#true} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {873#true} is VALID [2022-02-20 14:26:59,429 INFO L290 TraceCheckUtils]: 4: Hoare triple {873#true} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {873#true} is VALID [2022-02-20 14:26:59,429 INFO L290 TraceCheckUtils]: 3: Hoare triple {873#true} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {873#true} is VALID [2022-02-20 14:26:59,429 INFO L290 TraceCheckUtils]: 2: Hoare triple {873#true} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {873#true} is VALID [2022-02-20 14:26:59,429 INFO L290 TraceCheckUtils]: 1: Hoare triple {873#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~post2#1, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~post4#1;~i~0 := 0; {873#true} is VALID [2022-02-20 14:26:59,430 INFO L290 TraceCheckUtils]: 0: Hoare triple {873#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(23, 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);~i~0 := 0; {873#true} is VALID [2022-02-20 14:26:59,430 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-02-20 14:26:59,430 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987114217] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:26:59,430 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:26:59,430 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 20 [2022-02-20 14:26:59,431 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522612335] [2022-02-20 14:26:59,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:26:59,431 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.95) internal successors, (59), 20 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-02-20 14:26:59,432 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:26:59,432 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 2.95) internal successors, (59), 20 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:59,478 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:26:59,479 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-02-20 14:26:59,479 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:26:59,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-02-20 14:26:59,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2022-02-20 14:26:59,480 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand has 20 states, 20 states have (on average 2.95) internal successors, (59), 20 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call 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:00,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:27:00,142 INFO L93 Difference]: Finished difference Result 197 states and 219 transitions. [2022-02-20 14:27:00,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-02-20 14:27:00,143 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.95) internal successors, (59), 20 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-02-20 14:27:00,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:27:00,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 2.95) internal successors, (59), 20 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call 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:00,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 210 transitions. [2022-02-20 14:27:00,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 2.95) internal successors, (59), 20 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call 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:00,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 210 transitions. [2022-02-20 14:27:00,151 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 210 transitions. [2022-02-20 14:27:00,320 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 210 edges. 210 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:27:00,325 INFO L225 Difference]: With dead ends: 197 [2022-02-20 14:27:00,325 INFO L226 Difference]: Without dead ends: 178 [2022-02-20 14:27:00,326 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2022-02-20 14:27:00,326 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 267 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 14:27:00,327 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [267 Valid, 74 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 14:27:00,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-02-20 14:27:00,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 80. [2022-02-20 14:27:00,401 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:27:00,401 INFO L82 GeneralOperation]: Start isEquivalent. First operand 178 states. Second operand has 80 states, 79 states have (on average 1.0379746835443038) internal successors, (82), 79 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call 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:00,401 INFO L74 IsIncluded]: Start isIncluded. First operand 178 states. Second operand has 80 states, 79 states have (on average 1.0379746835443038) internal successors, (82), 79 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call 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:00,402 INFO L87 Difference]: Start difference. First operand 178 states. Second operand has 80 states, 79 states have (on average 1.0379746835443038) internal successors, (82), 79 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call 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:00,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:27:00,407 INFO L93 Difference]: Finished difference Result 178 states and 180 transitions. [2022-02-20 14:27:00,407 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 180 transitions. [2022-02-20 14:27:00,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:27:00,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:27:00,409 INFO L74 IsIncluded]: Start isIncluded. First operand has 80 states, 79 states have (on average 1.0379746835443038) internal successors, (82), 79 states have internal predecessors, (82), 0 states have call successors, (0), 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 178 states. [2022-02-20 14:27:00,409 INFO L87 Difference]: Start difference. First operand has 80 states, 79 states have (on average 1.0379746835443038) internal successors, (82), 79 states have internal predecessors, (82), 0 states have call successors, (0), 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 178 states. [2022-02-20 14:27:00,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:27:00,415 INFO L93 Difference]: Finished difference Result 178 states and 180 transitions. [2022-02-20 14:27:00,415 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 180 transitions. [2022-02-20 14:27:00,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:27:00,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:27:00,416 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:27:00,416 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:27:00,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.0379746835443038) internal successors, (82), 79 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call 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:00,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2022-02-20 14:27:00,419 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 39 [2022-02-20 14:27:00,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:27:00,419 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2022-02-20 14:27:00,419 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.95) internal successors, (59), 20 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call 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:00,420 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2022-02-20 14:27:00,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-20 14:27:00,421 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:27:00,421 INFO L514 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:27:00,450 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:00,645 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:27:00,645 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:27:00,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:27:00,646 INFO L85 PathProgramCache]: Analyzing trace with hash -775280303, now seen corresponding path program 4 times [2022-02-20 14:27:00,646 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:27:00,646 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831856247] [2022-02-20 14:27:00,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:27:00,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:27:00,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:27:01,034 INFO L290 TraceCheckUtils]: 0: Hoare triple {1854#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(23, 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);~i~0 := 0; {1854#true} is VALID [2022-02-20 14:27:01,035 INFO L290 TraceCheckUtils]: 1: Hoare triple {1854#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~post2#1, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~post4#1;~i~0 := 0; {1856#(= ~i~0 0)} is VALID [2022-02-20 14:27:01,039 INFO L290 TraceCheckUtils]: 2: Hoare triple {1856#(= ~i~0 0)} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1856#(= ~i~0 0)} is VALID [2022-02-20 14:27:01,040 INFO L290 TraceCheckUtils]: 3: Hoare triple {1856#(= ~i~0 0)} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1857#(<= ~i~0 1)} is VALID [2022-02-20 14:27:01,041 INFO L290 TraceCheckUtils]: 4: Hoare triple {1857#(<= ~i~0 1)} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1857#(<= ~i~0 1)} is VALID [2022-02-20 14:27:01,041 INFO L290 TraceCheckUtils]: 5: Hoare triple {1857#(<= ~i~0 1)} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1858#(<= ~i~0 2)} is VALID [2022-02-20 14:27:01,042 INFO L290 TraceCheckUtils]: 6: Hoare triple {1858#(<= ~i~0 2)} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1858#(<= ~i~0 2)} is VALID [2022-02-20 14:27:01,042 INFO L290 TraceCheckUtils]: 7: Hoare triple {1858#(<= ~i~0 2)} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1859#(<= ~i~0 3)} is VALID [2022-02-20 14:27:01,043 INFO L290 TraceCheckUtils]: 8: Hoare triple {1859#(<= ~i~0 3)} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1859#(<= ~i~0 3)} is VALID [2022-02-20 14:27:01,043 INFO L290 TraceCheckUtils]: 9: Hoare triple {1859#(<= ~i~0 3)} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1860#(<= ~i~0 4)} is VALID [2022-02-20 14:27:01,044 INFO L290 TraceCheckUtils]: 10: Hoare triple {1860#(<= ~i~0 4)} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1860#(<= ~i~0 4)} is VALID [2022-02-20 14:27:01,044 INFO L290 TraceCheckUtils]: 11: Hoare triple {1860#(<= ~i~0 4)} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1861#(<= ~i~0 5)} is VALID [2022-02-20 14:27:01,044 INFO L290 TraceCheckUtils]: 12: Hoare triple {1861#(<= ~i~0 5)} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1861#(<= ~i~0 5)} is VALID [2022-02-20 14:27:01,045 INFO L290 TraceCheckUtils]: 13: Hoare triple {1861#(<= ~i~0 5)} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1862#(<= ~i~0 6)} is VALID [2022-02-20 14:27:01,045 INFO L290 TraceCheckUtils]: 14: Hoare triple {1862#(<= ~i~0 6)} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1862#(<= ~i~0 6)} is VALID [2022-02-20 14:27:01,051 INFO L290 TraceCheckUtils]: 15: Hoare triple {1862#(<= ~i~0 6)} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1863#(<= ~i~0 7)} is VALID [2022-02-20 14:27:01,052 INFO L290 TraceCheckUtils]: 16: Hoare triple {1863#(<= ~i~0 7)} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1863#(<= ~i~0 7)} is VALID [2022-02-20 14:27:01,053 INFO L290 TraceCheckUtils]: 17: Hoare triple {1863#(<= ~i~0 7)} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1864#(<= ~i~0 8)} is VALID [2022-02-20 14:27:01,054 INFO L290 TraceCheckUtils]: 18: Hoare triple {1864#(<= ~i~0 8)} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1864#(<= ~i~0 8)} is VALID [2022-02-20 14:27:01,054 INFO L290 TraceCheckUtils]: 19: Hoare triple {1864#(<= ~i~0 8)} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1865#(<= ~i~0 9)} is VALID [2022-02-20 14:27:01,055 INFO L290 TraceCheckUtils]: 20: Hoare triple {1865#(<= ~i~0 9)} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1865#(<= ~i~0 9)} is VALID [2022-02-20 14:27:01,055 INFO L290 TraceCheckUtils]: 21: Hoare triple {1865#(<= ~i~0 9)} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1866#(<= ~i~0 10)} is VALID [2022-02-20 14:27:01,056 INFO L290 TraceCheckUtils]: 22: Hoare triple {1866#(<= ~i~0 10)} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1866#(<= ~i~0 10)} is VALID [2022-02-20 14:27:01,056 INFO L290 TraceCheckUtils]: 23: Hoare triple {1866#(<= ~i~0 10)} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1867#(<= ~i~0 11)} is VALID [2022-02-20 14:27:01,057 INFO L290 TraceCheckUtils]: 24: Hoare triple {1867#(<= ~i~0 11)} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1867#(<= ~i~0 11)} is VALID [2022-02-20 14:27:01,057 INFO L290 TraceCheckUtils]: 25: Hoare triple {1867#(<= ~i~0 11)} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1868#(<= ~i~0 12)} is VALID [2022-02-20 14:27:01,058 INFO L290 TraceCheckUtils]: 26: Hoare triple {1868#(<= ~i~0 12)} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1868#(<= ~i~0 12)} is VALID [2022-02-20 14:27:01,058 INFO L290 TraceCheckUtils]: 27: Hoare triple {1868#(<= ~i~0 12)} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1869#(<= ~i~0 13)} is VALID [2022-02-20 14:27:01,059 INFO L290 TraceCheckUtils]: 28: Hoare triple {1869#(<= ~i~0 13)} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1869#(<= ~i~0 13)} is VALID [2022-02-20 14:27:01,059 INFO L290 TraceCheckUtils]: 29: Hoare triple {1869#(<= ~i~0 13)} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1870#(<= ~i~0 14)} is VALID [2022-02-20 14:27:01,060 INFO L290 TraceCheckUtils]: 30: Hoare triple {1870#(<= ~i~0 14)} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1870#(<= ~i~0 14)} is VALID [2022-02-20 14:27:01,060 INFO L290 TraceCheckUtils]: 31: Hoare triple {1870#(<= ~i~0 14)} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1871#(<= ~i~0 15)} is VALID [2022-02-20 14:27:01,060 INFO L290 TraceCheckUtils]: 32: Hoare triple {1871#(<= ~i~0 15)} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1871#(<= ~i~0 15)} is VALID [2022-02-20 14:27:01,061 INFO L290 TraceCheckUtils]: 33: Hoare triple {1871#(<= ~i~0 15)} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1872#(<= ~i~0 16)} is VALID [2022-02-20 14:27:01,061 INFO L290 TraceCheckUtils]: 34: Hoare triple {1872#(<= ~i~0 16)} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1872#(<= ~i~0 16)} is VALID [2022-02-20 14:27:01,062 INFO L290 TraceCheckUtils]: 35: Hoare triple {1872#(<= ~i~0 16)} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1873#(<= ~i~0 17)} is VALID [2022-02-20 14:27:01,062 INFO L290 TraceCheckUtils]: 36: Hoare triple {1873#(<= ~i~0 17)} assume !(~i~0 < 1000000); {1855#false} is VALID [2022-02-20 14:27:01,062 INFO L290 TraceCheckUtils]: 37: Hoare triple {1855#false} ~i~0 := 0; {1855#false} is VALID [2022-02-20 14:27:01,063 INFO L290 TraceCheckUtils]: 38: Hoare triple {1855#false} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {1855#false} is VALID [2022-02-20 14:27:01,063 INFO L290 TraceCheckUtils]: 39: Hoare triple {1855#false} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1855#false} is VALID [2022-02-20 14:27:01,063 INFO L290 TraceCheckUtils]: 40: Hoare triple {1855#false} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {1855#false} is VALID [2022-02-20 14:27:01,063 INFO L290 TraceCheckUtils]: 41: Hoare triple {1855#false} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1855#false} is VALID [2022-02-20 14:27:01,063 INFO L290 TraceCheckUtils]: 42: Hoare triple {1855#false} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {1855#false} is VALID [2022-02-20 14:27:01,063 INFO L290 TraceCheckUtils]: 43: Hoare triple {1855#false} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1855#false} is VALID [2022-02-20 14:27:01,063 INFO L290 TraceCheckUtils]: 44: Hoare triple {1855#false} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {1855#false} is VALID [2022-02-20 14:27:01,063 INFO L290 TraceCheckUtils]: 45: Hoare triple {1855#false} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1855#false} is VALID [2022-02-20 14:27:01,063 INFO L290 TraceCheckUtils]: 46: Hoare triple {1855#false} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {1855#false} is VALID [2022-02-20 14:27:01,063 INFO L290 TraceCheckUtils]: 47: Hoare triple {1855#false} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1855#false} is VALID [2022-02-20 14:27:01,063 INFO L290 TraceCheckUtils]: 48: Hoare triple {1855#false} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {1855#false} is VALID [2022-02-20 14:27:01,064 INFO L290 TraceCheckUtils]: 49: Hoare triple {1855#false} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1855#false} is VALID [2022-02-20 14:27:01,064 INFO L290 TraceCheckUtils]: 50: Hoare triple {1855#false} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {1855#false} is VALID [2022-02-20 14:27:01,064 INFO L290 TraceCheckUtils]: 51: Hoare triple {1855#false} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1855#false} is VALID [2022-02-20 14:27:01,064 INFO L290 TraceCheckUtils]: 52: Hoare triple {1855#false} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {1855#false} is VALID [2022-02-20 14:27:01,064 INFO L290 TraceCheckUtils]: 53: Hoare triple {1855#false} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1855#false} is VALID [2022-02-20 14:27:01,064 INFO L290 TraceCheckUtils]: 54: Hoare triple {1855#false} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {1855#false} is VALID [2022-02-20 14:27:01,064 INFO L290 TraceCheckUtils]: 55: Hoare triple {1855#false} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1855#false} is VALID [2022-02-20 14:27:01,065 INFO L290 TraceCheckUtils]: 56: Hoare triple {1855#false} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {1855#false} is VALID [2022-02-20 14:27:01,065 INFO L290 TraceCheckUtils]: 57: Hoare triple {1855#false} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1855#false} is VALID [2022-02-20 14:27:01,065 INFO L290 TraceCheckUtils]: 58: Hoare triple {1855#false} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {1855#false} is VALID [2022-02-20 14:27:01,065 INFO L290 TraceCheckUtils]: 59: Hoare triple {1855#false} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1855#false} is VALID [2022-02-20 14:27:01,065 INFO L290 TraceCheckUtils]: 60: Hoare triple {1855#false} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {1855#false} is VALID [2022-02-20 14:27:01,065 INFO L290 TraceCheckUtils]: 61: Hoare triple {1855#false} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1855#false} is VALID [2022-02-20 14:27:01,065 INFO L290 TraceCheckUtils]: 62: Hoare triple {1855#false} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {1855#false} is VALID [2022-02-20 14:27:01,065 INFO L290 TraceCheckUtils]: 63: Hoare triple {1855#false} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1855#false} is VALID [2022-02-20 14:27:01,065 INFO L290 TraceCheckUtils]: 64: Hoare triple {1855#false} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {1855#false} is VALID [2022-02-20 14:27:01,065 INFO L290 TraceCheckUtils]: 65: Hoare triple {1855#false} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1855#false} is VALID [2022-02-20 14:27:01,066 INFO L290 TraceCheckUtils]: 66: Hoare triple {1855#false} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {1855#false} is VALID [2022-02-20 14:27:01,066 INFO L290 TraceCheckUtils]: 67: Hoare triple {1855#false} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1855#false} is VALID [2022-02-20 14:27:01,066 INFO L290 TraceCheckUtils]: 68: Hoare triple {1855#false} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {1855#false} is VALID [2022-02-20 14:27:01,066 INFO L290 TraceCheckUtils]: 69: Hoare triple {1855#false} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1855#false} is VALID [2022-02-20 14:27:01,066 INFO L290 TraceCheckUtils]: 70: Hoare triple {1855#false} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {1855#false} is VALID [2022-02-20 14:27:01,067 INFO L290 TraceCheckUtils]: 71: Hoare triple {1855#false} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1855#false} is VALID [2022-02-20 14:27:01,067 INFO L290 TraceCheckUtils]: 72: Hoare triple {1855#false} assume !(~i~0 < 500000); {1855#false} is VALID [2022-02-20 14:27:01,067 INFO L290 TraceCheckUtils]: 73: Hoare triple {1855#false} ~i~0 := 0; {1855#false} is VALID [2022-02-20 14:27:01,067 INFO L290 TraceCheckUtils]: 74: Hoare triple {1855#false} assume !!(~i~0 < 500000);call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem5#1.base != 0 || main_#t~mem5#1.offset != 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1855#false} is VALID [2022-02-20 14:27:01,067 INFO L290 TraceCheckUtils]: 75: Hoare triple {1855#false} assume 0 == __VERIFIER_assert_~cond#1; {1855#false} is VALID [2022-02-20 14:27:01,067 INFO L290 TraceCheckUtils]: 76: Hoare triple {1855#false} assume !false; {1855#false} is VALID [2022-02-20 14:27:01,068 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2022-02-20 14:27:01,068 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:27:01,068 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831856247] [2022-02-20 14:27:01,069 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831856247] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:27:01,069 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805732309] [2022-02-20 14:27:01,069 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-20 14:27:01,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:27:01,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:27:01,070 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:01,102 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:01,290 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-20 14:27:01,291 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:27:01,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 735 conjuncts, 19 conjunts are in the unsatisfiable core [2022-02-20 14:27:01,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:27:01,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:27:01,753 INFO L290 TraceCheckUtils]: 0: Hoare triple {1854#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(23, 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);~i~0 := 0; {1854#true} is VALID [2022-02-20 14:27:01,753 INFO L290 TraceCheckUtils]: 1: Hoare triple {1854#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~post2#1, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~post4#1;~i~0 := 0; {1854#true} is VALID [2022-02-20 14:27:01,753 INFO L290 TraceCheckUtils]: 2: Hoare triple {1854#true} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1854#true} is VALID [2022-02-20 14:27:01,753 INFO L290 TraceCheckUtils]: 3: Hoare triple {1854#true} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1854#true} is VALID [2022-02-20 14:27:01,753 INFO L290 TraceCheckUtils]: 4: Hoare triple {1854#true} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1854#true} is VALID [2022-02-20 14:27:01,753 INFO L290 TraceCheckUtils]: 5: Hoare triple {1854#true} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1854#true} is VALID [2022-02-20 14:27:01,753 INFO L290 TraceCheckUtils]: 6: Hoare triple {1854#true} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1854#true} is VALID [2022-02-20 14:27:01,754 INFO L290 TraceCheckUtils]: 7: Hoare triple {1854#true} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1854#true} is VALID [2022-02-20 14:27:01,754 INFO L290 TraceCheckUtils]: 8: Hoare triple {1854#true} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1854#true} is VALID [2022-02-20 14:27:01,754 INFO L290 TraceCheckUtils]: 9: Hoare triple {1854#true} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1854#true} is VALID [2022-02-20 14:27:01,754 INFO L290 TraceCheckUtils]: 10: Hoare triple {1854#true} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1854#true} is VALID [2022-02-20 14:27:01,754 INFO L290 TraceCheckUtils]: 11: Hoare triple {1854#true} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1854#true} is VALID [2022-02-20 14:27:01,754 INFO L290 TraceCheckUtils]: 12: Hoare triple {1854#true} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1854#true} is VALID [2022-02-20 14:27:01,754 INFO L290 TraceCheckUtils]: 13: Hoare triple {1854#true} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1854#true} is VALID [2022-02-20 14:27:01,754 INFO L290 TraceCheckUtils]: 14: Hoare triple {1854#true} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1854#true} is VALID [2022-02-20 14:27:01,754 INFO L290 TraceCheckUtils]: 15: Hoare triple {1854#true} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1854#true} is VALID [2022-02-20 14:27:01,755 INFO L290 TraceCheckUtils]: 16: Hoare triple {1854#true} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1854#true} is VALID [2022-02-20 14:27:01,755 INFO L290 TraceCheckUtils]: 17: Hoare triple {1854#true} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1854#true} is VALID [2022-02-20 14:27:01,755 INFO L290 TraceCheckUtils]: 18: Hoare triple {1854#true} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1854#true} is VALID [2022-02-20 14:27:01,755 INFO L290 TraceCheckUtils]: 19: Hoare triple {1854#true} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1854#true} is VALID [2022-02-20 14:27:01,755 INFO L290 TraceCheckUtils]: 20: Hoare triple {1854#true} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1854#true} is VALID [2022-02-20 14:27:01,755 INFO L290 TraceCheckUtils]: 21: Hoare triple {1854#true} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1854#true} is VALID [2022-02-20 14:27:01,755 INFO L290 TraceCheckUtils]: 22: Hoare triple {1854#true} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1854#true} is VALID [2022-02-20 14:27:01,755 INFO L290 TraceCheckUtils]: 23: Hoare triple {1854#true} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1854#true} is VALID [2022-02-20 14:27:01,755 INFO L290 TraceCheckUtils]: 24: Hoare triple {1854#true} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1854#true} is VALID [2022-02-20 14:27:01,756 INFO L290 TraceCheckUtils]: 25: Hoare triple {1854#true} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1854#true} is VALID [2022-02-20 14:27:01,756 INFO L290 TraceCheckUtils]: 26: Hoare triple {1854#true} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1854#true} is VALID [2022-02-20 14:27:01,756 INFO L290 TraceCheckUtils]: 27: Hoare triple {1854#true} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1854#true} is VALID [2022-02-20 14:27:01,756 INFO L290 TraceCheckUtils]: 28: Hoare triple {1854#true} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1854#true} is VALID [2022-02-20 14:27:01,756 INFO L290 TraceCheckUtils]: 29: Hoare triple {1854#true} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1854#true} is VALID [2022-02-20 14:27:01,756 INFO L290 TraceCheckUtils]: 30: Hoare triple {1854#true} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1854#true} is VALID [2022-02-20 14:27:01,756 INFO L290 TraceCheckUtils]: 31: Hoare triple {1854#true} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1854#true} is VALID [2022-02-20 14:27:01,756 INFO L290 TraceCheckUtils]: 32: Hoare triple {1854#true} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1854#true} is VALID [2022-02-20 14:27:01,757 INFO L290 TraceCheckUtils]: 33: Hoare triple {1854#true} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1854#true} is VALID [2022-02-20 14:27:01,757 INFO L290 TraceCheckUtils]: 34: Hoare triple {1854#true} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1854#true} is VALID [2022-02-20 14:27:01,757 INFO L290 TraceCheckUtils]: 35: Hoare triple {1854#true} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1854#true} is VALID [2022-02-20 14:27:01,757 INFO L290 TraceCheckUtils]: 36: Hoare triple {1854#true} assume !(~i~0 < 1000000); {1854#true} is VALID [2022-02-20 14:27:01,760 INFO L290 TraceCheckUtils]: 37: Hoare triple {1854#true} ~i~0 := 0; {1988#(<= ~i~0 0)} is VALID [2022-02-20 14:27:01,760 INFO L290 TraceCheckUtils]: 38: Hoare triple {1988#(<= ~i~0 0)} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {1988#(<= ~i~0 0)} is VALID [2022-02-20 14:27:01,761 INFO L290 TraceCheckUtils]: 39: Hoare triple {1988#(<= ~i~0 0)} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1857#(<= ~i~0 1)} is VALID [2022-02-20 14:27:01,761 INFO L290 TraceCheckUtils]: 40: Hoare triple {1857#(<= ~i~0 1)} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {1857#(<= ~i~0 1)} is VALID [2022-02-20 14:27:01,762 INFO L290 TraceCheckUtils]: 41: Hoare triple {1857#(<= ~i~0 1)} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1858#(<= ~i~0 2)} is VALID [2022-02-20 14:27:01,762 INFO L290 TraceCheckUtils]: 42: Hoare triple {1858#(<= ~i~0 2)} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {1858#(<= ~i~0 2)} is VALID [2022-02-20 14:27:01,762 INFO L290 TraceCheckUtils]: 43: Hoare triple {1858#(<= ~i~0 2)} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1859#(<= ~i~0 3)} is VALID [2022-02-20 14:27:01,763 INFO L290 TraceCheckUtils]: 44: Hoare triple {1859#(<= ~i~0 3)} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {1859#(<= ~i~0 3)} is VALID [2022-02-20 14:27:01,763 INFO L290 TraceCheckUtils]: 45: Hoare triple {1859#(<= ~i~0 3)} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1860#(<= ~i~0 4)} is VALID [2022-02-20 14:27:01,764 INFO L290 TraceCheckUtils]: 46: Hoare triple {1860#(<= ~i~0 4)} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {1860#(<= ~i~0 4)} is VALID [2022-02-20 14:27:01,764 INFO L290 TraceCheckUtils]: 47: Hoare triple {1860#(<= ~i~0 4)} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1861#(<= ~i~0 5)} is VALID [2022-02-20 14:27:01,764 INFO L290 TraceCheckUtils]: 48: Hoare triple {1861#(<= ~i~0 5)} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {1861#(<= ~i~0 5)} is VALID [2022-02-20 14:27:01,765 INFO L290 TraceCheckUtils]: 49: Hoare triple {1861#(<= ~i~0 5)} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1862#(<= ~i~0 6)} is VALID [2022-02-20 14:27:01,765 INFO L290 TraceCheckUtils]: 50: Hoare triple {1862#(<= ~i~0 6)} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {1862#(<= ~i~0 6)} is VALID [2022-02-20 14:27:01,766 INFO L290 TraceCheckUtils]: 51: Hoare triple {1862#(<= ~i~0 6)} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1863#(<= ~i~0 7)} is VALID [2022-02-20 14:27:01,766 INFO L290 TraceCheckUtils]: 52: Hoare triple {1863#(<= ~i~0 7)} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {1863#(<= ~i~0 7)} is VALID [2022-02-20 14:27:01,767 INFO L290 TraceCheckUtils]: 53: Hoare triple {1863#(<= ~i~0 7)} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1864#(<= ~i~0 8)} is VALID [2022-02-20 14:27:01,767 INFO L290 TraceCheckUtils]: 54: Hoare triple {1864#(<= ~i~0 8)} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {1864#(<= ~i~0 8)} is VALID [2022-02-20 14:27:01,768 INFO L290 TraceCheckUtils]: 55: Hoare triple {1864#(<= ~i~0 8)} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1865#(<= ~i~0 9)} is VALID [2022-02-20 14:27:01,768 INFO L290 TraceCheckUtils]: 56: Hoare triple {1865#(<= ~i~0 9)} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {1865#(<= ~i~0 9)} is VALID [2022-02-20 14:27:01,768 INFO L290 TraceCheckUtils]: 57: Hoare triple {1865#(<= ~i~0 9)} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1866#(<= ~i~0 10)} is VALID [2022-02-20 14:27:01,769 INFO L290 TraceCheckUtils]: 58: Hoare triple {1866#(<= ~i~0 10)} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {1866#(<= ~i~0 10)} is VALID [2022-02-20 14:27:01,769 INFO L290 TraceCheckUtils]: 59: Hoare triple {1866#(<= ~i~0 10)} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1867#(<= ~i~0 11)} is VALID [2022-02-20 14:27:01,770 INFO L290 TraceCheckUtils]: 60: Hoare triple {1867#(<= ~i~0 11)} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {1867#(<= ~i~0 11)} is VALID [2022-02-20 14:27:01,770 INFO L290 TraceCheckUtils]: 61: Hoare triple {1867#(<= ~i~0 11)} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1868#(<= ~i~0 12)} is VALID [2022-02-20 14:27:01,770 INFO L290 TraceCheckUtils]: 62: Hoare triple {1868#(<= ~i~0 12)} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {1868#(<= ~i~0 12)} is VALID [2022-02-20 14:27:01,771 INFO L290 TraceCheckUtils]: 63: Hoare triple {1868#(<= ~i~0 12)} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1869#(<= ~i~0 13)} is VALID [2022-02-20 14:27:01,771 INFO L290 TraceCheckUtils]: 64: Hoare triple {1869#(<= ~i~0 13)} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {1869#(<= ~i~0 13)} is VALID [2022-02-20 14:27:01,772 INFO L290 TraceCheckUtils]: 65: Hoare triple {1869#(<= ~i~0 13)} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1870#(<= ~i~0 14)} is VALID [2022-02-20 14:27:01,773 INFO L290 TraceCheckUtils]: 66: Hoare triple {1870#(<= ~i~0 14)} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {1870#(<= ~i~0 14)} is VALID [2022-02-20 14:27:01,773 INFO L290 TraceCheckUtils]: 67: Hoare triple {1870#(<= ~i~0 14)} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1871#(<= ~i~0 15)} is VALID [2022-02-20 14:27:01,774 INFO L290 TraceCheckUtils]: 68: Hoare triple {1871#(<= ~i~0 15)} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {1871#(<= ~i~0 15)} is VALID [2022-02-20 14:27:01,775 INFO L290 TraceCheckUtils]: 69: Hoare triple {1871#(<= ~i~0 15)} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1872#(<= ~i~0 16)} is VALID [2022-02-20 14:27:01,777 INFO L290 TraceCheckUtils]: 70: Hoare triple {1872#(<= ~i~0 16)} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {1872#(<= ~i~0 16)} is VALID [2022-02-20 14:27:01,782 INFO L290 TraceCheckUtils]: 71: Hoare triple {1872#(<= ~i~0 16)} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1873#(<= ~i~0 17)} is VALID [2022-02-20 14:27:01,783 INFO L290 TraceCheckUtils]: 72: Hoare triple {1873#(<= ~i~0 17)} assume !(~i~0 < 500000); {1855#false} is VALID [2022-02-20 14:27:01,783 INFO L290 TraceCheckUtils]: 73: Hoare triple {1855#false} ~i~0 := 0; {1855#false} is VALID [2022-02-20 14:27:01,783 INFO L290 TraceCheckUtils]: 74: Hoare triple {1855#false} assume !!(~i~0 < 500000);call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem5#1.base != 0 || main_#t~mem5#1.offset != 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1855#false} is VALID [2022-02-20 14:27:01,783 INFO L290 TraceCheckUtils]: 75: Hoare triple {1855#false} assume 0 == __VERIFIER_assert_~cond#1; {1855#false} is VALID [2022-02-20 14:27:01,783 INFO L290 TraceCheckUtils]: 76: Hoare triple {1855#false} assume !false; {1855#false} is VALID [2022-02-20 14:27:01,784 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2022-02-20 14:27:01,784 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:27:02,554 INFO L290 TraceCheckUtils]: 76: Hoare triple {1855#false} assume !false; {1855#false} is VALID [2022-02-20 14:27:02,555 INFO L290 TraceCheckUtils]: 75: Hoare triple {1855#false} assume 0 == __VERIFIER_assert_~cond#1; {1855#false} is VALID [2022-02-20 14:27:02,555 INFO L290 TraceCheckUtils]: 74: Hoare triple {1855#false} assume !!(~i~0 < 500000);call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem5#1.base != 0 || main_#t~mem5#1.offset != 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1855#false} is VALID [2022-02-20 14:27:02,555 INFO L290 TraceCheckUtils]: 73: Hoare triple {1855#false} ~i~0 := 0; {1855#false} is VALID [2022-02-20 14:27:02,555 INFO L290 TraceCheckUtils]: 72: Hoare triple {2118#(< ~i~0 500000)} assume !(~i~0 < 500000); {1855#false} is VALID [2022-02-20 14:27:02,556 INFO L290 TraceCheckUtils]: 71: Hoare triple {2122#(< ~i~0 499999)} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2118#(< ~i~0 500000)} is VALID [2022-02-20 14:27:02,556 INFO L290 TraceCheckUtils]: 70: Hoare triple {2122#(< ~i~0 499999)} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {2122#(< ~i~0 499999)} is VALID [2022-02-20 14:27:02,557 INFO L290 TraceCheckUtils]: 69: Hoare triple {2129#(< ~i~0 499998)} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2122#(< ~i~0 499999)} is VALID [2022-02-20 14:27:02,557 INFO L290 TraceCheckUtils]: 68: Hoare triple {2129#(< ~i~0 499998)} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {2129#(< ~i~0 499998)} is VALID [2022-02-20 14:27:02,558 INFO L290 TraceCheckUtils]: 67: Hoare triple {2136#(< ~i~0 499997)} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2129#(< ~i~0 499998)} is VALID [2022-02-20 14:27:02,558 INFO L290 TraceCheckUtils]: 66: Hoare triple {2136#(< ~i~0 499997)} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {2136#(< ~i~0 499997)} is VALID [2022-02-20 14:27:02,558 INFO L290 TraceCheckUtils]: 65: Hoare triple {2143#(< ~i~0 499996)} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2136#(< ~i~0 499997)} is VALID [2022-02-20 14:27:02,559 INFO L290 TraceCheckUtils]: 64: Hoare triple {2143#(< ~i~0 499996)} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {2143#(< ~i~0 499996)} is VALID [2022-02-20 14:27:02,559 INFO L290 TraceCheckUtils]: 63: Hoare triple {2150#(< ~i~0 499995)} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2143#(< ~i~0 499996)} is VALID [2022-02-20 14:27:02,559 INFO L290 TraceCheckUtils]: 62: Hoare triple {2150#(< ~i~0 499995)} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {2150#(< ~i~0 499995)} is VALID [2022-02-20 14:27:02,560 INFO L290 TraceCheckUtils]: 61: Hoare triple {2157#(< ~i~0 499994)} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2150#(< ~i~0 499995)} is VALID [2022-02-20 14:27:02,560 INFO L290 TraceCheckUtils]: 60: Hoare triple {2157#(< ~i~0 499994)} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {2157#(< ~i~0 499994)} is VALID [2022-02-20 14:27:02,561 INFO L290 TraceCheckUtils]: 59: Hoare triple {2164#(< ~i~0 499993)} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2157#(< ~i~0 499994)} is VALID [2022-02-20 14:27:02,561 INFO L290 TraceCheckUtils]: 58: Hoare triple {2164#(< ~i~0 499993)} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {2164#(< ~i~0 499993)} is VALID [2022-02-20 14:27:02,561 INFO L290 TraceCheckUtils]: 57: Hoare triple {2171#(< ~i~0 499992)} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2164#(< ~i~0 499993)} is VALID [2022-02-20 14:27:02,562 INFO L290 TraceCheckUtils]: 56: Hoare triple {2171#(< ~i~0 499992)} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {2171#(< ~i~0 499992)} is VALID [2022-02-20 14:27:02,562 INFO L290 TraceCheckUtils]: 55: Hoare triple {2178#(< ~i~0 499991)} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2171#(< ~i~0 499992)} is VALID [2022-02-20 14:27:02,562 INFO L290 TraceCheckUtils]: 54: Hoare triple {2178#(< ~i~0 499991)} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {2178#(< ~i~0 499991)} is VALID [2022-02-20 14:27:02,563 INFO L290 TraceCheckUtils]: 53: Hoare triple {2185#(< ~i~0 499990)} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2178#(< ~i~0 499991)} is VALID [2022-02-20 14:27:02,563 INFO L290 TraceCheckUtils]: 52: Hoare triple {2185#(< ~i~0 499990)} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {2185#(< ~i~0 499990)} is VALID [2022-02-20 14:27:02,564 INFO L290 TraceCheckUtils]: 51: Hoare triple {2192#(< ~i~0 499989)} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2185#(< ~i~0 499990)} is VALID [2022-02-20 14:27:02,564 INFO L290 TraceCheckUtils]: 50: Hoare triple {2192#(< ~i~0 499989)} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {2192#(< ~i~0 499989)} is VALID [2022-02-20 14:27:02,568 INFO L290 TraceCheckUtils]: 49: Hoare triple {2199#(< ~i~0 499988)} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2192#(< ~i~0 499989)} is VALID [2022-02-20 14:27:02,568 INFO L290 TraceCheckUtils]: 48: Hoare triple {2199#(< ~i~0 499988)} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {2199#(< ~i~0 499988)} is VALID [2022-02-20 14:27:02,569 INFO L290 TraceCheckUtils]: 47: Hoare triple {2206#(< ~i~0 499987)} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2199#(< ~i~0 499988)} is VALID [2022-02-20 14:27:02,569 INFO L290 TraceCheckUtils]: 46: Hoare triple {2206#(< ~i~0 499987)} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {2206#(< ~i~0 499987)} is VALID [2022-02-20 14:27:02,569 INFO L290 TraceCheckUtils]: 45: Hoare triple {2213#(< ~i~0 499986)} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2206#(< ~i~0 499987)} is VALID [2022-02-20 14:27:02,570 INFO L290 TraceCheckUtils]: 44: Hoare triple {2213#(< ~i~0 499986)} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {2213#(< ~i~0 499986)} is VALID [2022-02-20 14:27:02,570 INFO L290 TraceCheckUtils]: 43: Hoare triple {2220#(< ~i~0 499985)} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2213#(< ~i~0 499986)} is VALID [2022-02-20 14:27:02,571 INFO L290 TraceCheckUtils]: 42: Hoare triple {2220#(< ~i~0 499985)} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {2220#(< ~i~0 499985)} is VALID [2022-02-20 14:27:02,571 INFO L290 TraceCheckUtils]: 41: Hoare triple {2227#(< ~i~0 499984)} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2220#(< ~i~0 499985)} is VALID [2022-02-20 14:27:02,571 INFO L290 TraceCheckUtils]: 40: Hoare triple {2227#(< ~i~0 499984)} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {2227#(< ~i~0 499984)} is VALID [2022-02-20 14:27:02,572 INFO L290 TraceCheckUtils]: 39: Hoare triple {2234#(< ~i~0 499983)} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2227#(< ~i~0 499984)} is VALID [2022-02-20 14:27:02,572 INFO L290 TraceCheckUtils]: 38: Hoare triple {2234#(< ~i~0 499983)} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {2234#(< ~i~0 499983)} is VALID [2022-02-20 14:27:02,572 INFO L290 TraceCheckUtils]: 37: Hoare triple {1854#true} ~i~0 := 0; {2234#(< ~i~0 499983)} is VALID [2022-02-20 14:27:02,573 INFO L290 TraceCheckUtils]: 36: Hoare triple {1854#true} assume !(~i~0 < 1000000); {1854#true} is VALID [2022-02-20 14:27:02,573 INFO L290 TraceCheckUtils]: 35: Hoare triple {1854#true} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1854#true} is VALID [2022-02-20 14:27:02,573 INFO L290 TraceCheckUtils]: 34: Hoare triple {1854#true} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1854#true} is VALID [2022-02-20 14:27:02,573 INFO L290 TraceCheckUtils]: 33: Hoare triple {1854#true} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1854#true} is VALID [2022-02-20 14:27:02,573 INFO L290 TraceCheckUtils]: 32: Hoare triple {1854#true} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1854#true} is VALID [2022-02-20 14:27:02,573 INFO L290 TraceCheckUtils]: 31: Hoare triple {1854#true} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1854#true} is VALID [2022-02-20 14:27:02,573 INFO L290 TraceCheckUtils]: 30: Hoare triple {1854#true} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1854#true} is VALID [2022-02-20 14:27:02,573 INFO L290 TraceCheckUtils]: 29: Hoare triple {1854#true} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1854#true} is VALID [2022-02-20 14:27:02,573 INFO L290 TraceCheckUtils]: 28: Hoare triple {1854#true} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1854#true} is VALID [2022-02-20 14:27:02,573 INFO L290 TraceCheckUtils]: 27: Hoare triple {1854#true} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1854#true} is VALID [2022-02-20 14:27:02,573 INFO L290 TraceCheckUtils]: 26: Hoare triple {1854#true} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1854#true} is VALID [2022-02-20 14:27:02,574 INFO L290 TraceCheckUtils]: 25: Hoare triple {1854#true} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1854#true} is VALID [2022-02-20 14:27:02,574 INFO L290 TraceCheckUtils]: 24: Hoare triple {1854#true} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1854#true} is VALID [2022-02-20 14:27:02,574 INFO L290 TraceCheckUtils]: 23: Hoare triple {1854#true} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1854#true} is VALID [2022-02-20 14:27:02,574 INFO L290 TraceCheckUtils]: 22: Hoare triple {1854#true} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1854#true} is VALID [2022-02-20 14:27:02,574 INFO L290 TraceCheckUtils]: 21: Hoare triple {1854#true} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1854#true} is VALID [2022-02-20 14:27:02,574 INFO L290 TraceCheckUtils]: 20: Hoare triple {1854#true} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1854#true} is VALID [2022-02-20 14:27:02,574 INFO L290 TraceCheckUtils]: 19: Hoare triple {1854#true} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1854#true} is VALID [2022-02-20 14:27:02,574 INFO L290 TraceCheckUtils]: 18: Hoare triple {1854#true} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1854#true} is VALID [2022-02-20 14:27:02,574 INFO L290 TraceCheckUtils]: 17: Hoare triple {1854#true} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1854#true} is VALID [2022-02-20 14:27:02,575 INFO L290 TraceCheckUtils]: 16: Hoare triple {1854#true} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1854#true} is VALID [2022-02-20 14:27:02,575 INFO L290 TraceCheckUtils]: 15: Hoare triple {1854#true} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1854#true} is VALID [2022-02-20 14:27:02,575 INFO L290 TraceCheckUtils]: 14: Hoare triple {1854#true} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1854#true} is VALID [2022-02-20 14:27:02,575 INFO L290 TraceCheckUtils]: 13: Hoare triple {1854#true} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1854#true} is VALID [2022-02-20 14:27:02,575 INFO L290 TraceCheckUtils]: 12: Hoare triple {1854#true} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1854#true} is VALID [2022-02-20 14:27:02,575 INFO L290 TraceCheckUtils]: 11: Hoare triple {1854#true} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1854#true} is VALID [2022-02-20 14:27:02,575 INFO L290 TraceCheckUtils]: 10: Hoare triple {1854#true} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1854#true} is VALID [2022-02-20 14:27:02,576 INFO L290 TraceCheckUtils]: 9: Hoare triple {1854#true} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1854#true} is VALID [2022-02-20 14:27:02,576 INFO L290 TraceCheckUtils]: 8: Hoare triple {1854#true} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1854#true} is VALID [2022-02-20 14:27:02,576 INFO L290 TraceCheckUtils]: 7: Hoare triple {1854#true} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1854#true} is VALID [2022-02-20 14:27:02,576 INFO L290 TraceCheckUtils]: 6: Hoare triple {1854#true} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1854#true} is VALID [2022-02-20 14:27:02,576 INFO L290 TraceCheckUtils]: 5: Hoare triple {1854#true} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1854#true} is VALID [2022-02-20 14:27:02,576 INFO L290 TraceCheckUtils]: 4: Hoare triple {1854#true} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1854#true} is VALID [2022-02-20 14:27:02,577 INFO L290 TraceCheckUtils]: 3: Hoare triple {1854#true} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1854#true} is VALID [2022-02-20 14:27:02,577 INFO L290 TraceCheckUtils]: 2: Hoare triple {1854#true} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1854#true} is VALID [2022-02-20 14:27:02,577 INFO L290 TraceCheckUtils]: 1: Hoare triple {1854#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~post2#1, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~post4#1;~i~0 := 0; {1854#true} is VALID [2022-02-20 14:27:02,577 INFO L290 TraceCheckUtils]: 0: Hoare triple {1854#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(23, 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);~i~0 := 0; {1854#true} is VALID [2022-02-20 14:27:02,578 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2022-02-20 14:27:02,578 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [805732309] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:27:02,578 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:27:02,578 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2022-02-20 14:27:02,578 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175830290] [2022-02-20 14:27:02,578 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:27:02,579 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 3.1025641025641026) internal successors, (121), 39 states have internal predecessors, (121), 0 states have call successors, (0), 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 77 [2022-02-20 14:27:02,580 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:27:02,580 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 39 states, 39 states have (on average 3.1025641025641026) internal successors, (121), 39 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call 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:02,686 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:27:02,686 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-02-20 14:27:02,687 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:27:02,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-02-20 14:27:02,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2022-02-20 14:27:02,688 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand has 39 states, 39 states have (on average 3.1025641025641026) internal successors, (121), 39 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call 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:04,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:27:04,389 INFO L93 Difference]: Finished difference Result 411 states and 452 transitions. [2022-02-20 14:27:04,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-02-20 14:27:04,390 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 3.1025641025641026) internal successors, (121), 39 states have internal predecessors, (121), 0 states have call successors, (0), 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 77 [2022-02-20 14:27:04,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:27:04,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 3.1025641025641026) internal successors, (121), 39 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call 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:04,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 419 transitions. [2022-02-20 14:27:04,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 3.1025641025641026) internal successors, (121), 39 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call 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:04,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 419 transitions. [2022-02-20 14:27:04,401 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 419 transitions. [2022-02-20 14:27:04,683 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 419 edges. 419 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:27:04,691 INFO L225 Difference]: With dead ends: 411 [2022-02-20 14:27:04,692 INFO L226 Difference]: Without dead ends: 368 [2022-02-20 14:27:04,693 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2022-02-20 14:27:04,693 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 745 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 270 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 14:27:04,694 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [745 Valid, 154 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [270 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 14:27:04,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2022-02-20 14:27:04,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 156. [2022-02-20 14:27:04,837 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:27:04,838 INFO L82 GeneralOperation]: Start isEquivalent. First operand 368 states. Second operand has 156 states, 155 states have (on average 1.0193548387096774) internal successors, (158), 155 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call 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:04,838 INFO L74 IsIncluded]: Start isIncluded. First operand 368 states. Second operand has 156 states, 155 states have (on average 1.0193548387096774) internal successors, (158), 155 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call 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:04,838 INFO L87 Difference]: Start difference. First operand 368 states. Second operand has 156 states, 155 states have (on average 1.0193548387096774) internal successors, (158), 155 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call 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:04,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:27:04,848 INFO L93 Difference]: Finished difference Result 368 states and 370 transitions. [2022-02-20 14:27:04,848 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 370 transitions. [2022-02-20 14:27:04,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:27:04,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:27:04,849 INFO L74 IsIncluded]: Start isIncluded. First operand has 156 states, 155 states have (on average 1.0193548387096774) internal successors, (158), 155 states have internal predecessors, (158), 0 states have call successors, (0), 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 368 states. [2022-02-20 14:27:04,849 INFO L87 Difference]: Start difference. First operand has 156 states, 155 states have (on average 1.0193548387096774) internal successors, (158), 155 states have internal predecessors, (158), 0 states have call successors, (0), 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 368 states. [2022-02-20 14:27:04,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:27:04,860 INFO L93 Difference]: Finished difference Result 368 states and 370 transitions. [2022-02-20 14:27:04,860 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 370 transitions. [2022-02-20 14:27:04,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:27:04,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:27:04,861 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:27:04,861 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:27:04,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 1.0193548387096774) internal successors, (158), 155 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call 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:04,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 158 transitions. [2022-02-20 14:27:04,865 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 158 transitions. Word has length 77 [2022-02-20 14:27:04,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:27:04,865 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 158 transitions. [2022-02-20 14:27:04,866 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 3.1025641025641026) internal successors, (121), 39 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call 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:04,866 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 158 transitions. [2022-02-20 14:27:04,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-02-20 14:27:04,867 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:27:04,867 INFO L514 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:27:04,889 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:05,079 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:27:05,080 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:27:05,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:27:05,080 INFO L85 PathProgramCache]: Analyzing trace with hash 433379653, now seen corresponding path program 5 times [2022-02-20 14:27:05,080 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:27:05,080 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306854259] [2022-02-20 14:27:05,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:27:05,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:27:05,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:27:06,020 INFO L290 TraceCheckUtils]: 0: Hoare triple {3859#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(23, 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);~i~0 := 0; {3859#true} is VALID [2022-02-20 14:27:06,020 INFO L290 TraceCheckUtils]: 1: Hoare triple {3859#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~post2#1, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~post4#1;~i~0 := 0; {3861#(= ~i~0 0)} is VALID [2022-02-20 14:27:06,020 INFO L290 TraceCheckUtils]: 2: Hoare triple {3861#(= ~i~0 0)} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3861#(= ~i~0 0)} is VALID [2022-02-20 14:27:06,021 INFO L290 TraceCheckUtils]: 3: Hoare triple {3861#(= ~i~0 0)} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3862#(<= ~i~0 1)} is VALID [2022-02-20 14:27:06,021 INFO L290 TraceCheckUtils]: 4: Hoare triple {3862#(<= ~i~0 1)} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3862#(<= ~i~0 1)} is VALID [2022-02-20 14:27:06,022 INFO L290 TraceCheckUtils]: 5: Hoare triple {3862#(<= ~i~0 1)} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3863#(<= ~i~0 2)} is VALID [2022-02-20 14:27:06,022 INFO L290 TraceCheckUtils]: 6: Hoare triple {3863#(<= ~i~0 2)} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3863#(<= ~i~0 2)} is VALID [2022-02-20 14:27:06,023 INFO L290 TraceCheckUtils]: 7: Hoare triple {3863#(<= ~i~0 2)} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3864#(<= ~i~0 3)} is VALID [2022-02-20 14:27:06,023 INFO L290 TraceCheckUtils]: 8: Hoare triple {3864#(<= ~i~0 3)} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3864#(<= ~i~0 3)} is VALID [2022-02-20 14:27:06,027 INFO L290 TraceCheckUtils]: 9: Hoare triple {3864#(<= ~i~0 3)} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3865#(<= ~i~0 4)} is VALID [2022-02-20 14:27:06,027 INFO L290 TraceCheckUtils]: 10: Hoare triple {3865#(<= ~i~0 4)} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3865#(<= ~i~0 4)} is VALID [2022-02-20 14:27:06,028 INFO L290 TraceCheckUtils]: 11: Hoare triple {3865#(<= ~i~0 4)} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3866#(<= ~i~0 5)} is VALID [2022-02-20 14:27:06,028 INFO L290 TraceCheckUtils]: 12: Hoare triple {3866#(<= ~i~0 5)} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3866#(<= ~i~0 5)} is VALID [2022-02-20 14:27:06,029 INFO L290 TraceCheckUtils]: 13: Hoare triple {3866#(<= ~i~0 5)} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3867#(<= ~i~0 6)} is VALID [2022-02-20 14:27:06,029 INFO L290 TraceCheckUtils]: 14: Hoare triple {3867#(<= ~i~0 6)} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3867#(<= ~i~0 6)} is VALID [2022-02-20 14:27:06,030 INFO L290 TraceCheckUtils]: 15: Hoare triple {3867#(<= ~i~0 6)} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3868#(<= ~i~0 7)} is VALID [2022-02-20 14:27:06,030 INFO L290 TraceCheckUtils]: 16: Hoare triple {3868#(<= ~i~0 7)} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3868#(<= ~i~0 7)} is VALID [2022-02-20 14:27:06,030 INFO L290 TraceCheckUtils]: 17: Hoare triple {3868#(<= ~i~0 7)} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3869#(<= ~i~0 8)} is VALID [2022-02-20 14:27:06,031 INFO L290 TraceCheckUtils]: 18: Hoare triple {3869#(<= ~i~0 8)} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3869#(<= ~i~0 8)} is VALID [2022-02-20 14:27:06,031 INFO L290 TraceCheckUtils]: 19: Hoare triple {3869#(<= ~i~0 8)} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3870#(<= ~i~0 9)} is VALID [2022-02-20 14:27:06,032 INFO L290 TraceCheckUtils]: 20: Hoare triple {3870#(<= ~i~0 9)} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3870#(<= ~i~0 9)} is VALID [2022-02-20 14:27:06,032 INFO L290 TraceCheckUtils]: 21: Hoare triple {3870#(<= ~i~0 9)} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3871#(<= ~i~0 10)} is VALID [2022-02-20 14:27:06,033 INFO L290 TraceCheckUtils]: 22: Hoare triple {3871#(<= ~i~0 10)} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3871#(<= ~i~0 10)} is VALID [2022-02-20 14:27:06,033 INFO L290 TraceCheckUtils]: 23: Hoare triple {3871#(<= ~i~0 10)} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3872#(<= ~i~0 11)} is VALID [2022-02-20 14:27:06,034 INFO L290 TraceCheckUtils]: 24: Hoare triple {3872#(<= ~i~0 11)} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3872#(<= ~i~0 11)} is VALID [2022-02-20 14:27:06,034 INFO L290 TraceCheckUtils]: 25: Hoare triple {3872#(<= ~i~0 11)} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3873#(<= ~i~0 12)} is VALID [2022-02-20 14:27:06,034 INFO L290 TraceCheckUtils]: 26: Hoare triple {3873#(<= ~i~0 12)} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3873#(<= ~i~0 12)} is VALID [2022-02-20 14:27:06,035 INFO L290 TraceCheckUtils]: 27: Hoare triple {3873#(<= ~i~0 12)} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3874#(<= ~i~0 13)} is VALID [2022-02-20 14:27:06,035 INFO L290 TraceCheckUtils]: 28: Hoare triple {3874#(<= ~i~0 13)} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3874#(<= ~i~0 13)} is VALID [2022-02-20 14:27:06,036 INFO L290 TraceCheckUtils]: 29: Hoare triple {3874#(<= ~i~0 13)} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3875#(<= ~i~0 14)} is VALID [2022-02-20 14:27:06,036 INFO L290 TraceCheckUtils]: 30: Hoare triple {3875#(<= ~i~0 14)} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3875#(<= ~i~0 14)} is VALID [2022-02-20 14:27:06,037 INFO L290 TraceCheckUtils]: 31: Hoare triple {3875#(<= ~i~0 14)} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3876#(<= ~i~0 15)} is VALID [2022-02-20 14:27:06,037 INFO L290 TraceCheckUtils]: 32: Hoare triple {3876#(<= ~i~0 15)} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3876#(<= ~i~0 15)} is VALID [2022-02-20 14:27:06,038 INFO L290 TraceCheckUtils]: 33: Hoare triple {3876#(<= ~i~0 15)} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3877#(<= ~i~0 16)} is VALID [2022-02-20 14:27:06,038 INFO L290 TraceCheckUtils]: 34: Hoare triple {3877#(<= ~i~0 16)} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3877#(<= ~i~0 16)} is VALID [2022-02-20 14:27:06,038 INFO L290 TraceCheckUtils]: 35: Hoare triple {3877#(<= ~i~0 16)} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3878#(<= ~i~0 17)} is VALID [2022-02-20 14:27:06,039 INFO L290 TraceCheckUtils]: 36: Hoare triple {3878#(<= ~i~0 17)} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3878#(<= ~i~0 17)} is VALID [2022-02-20 14:27:06,039 INFO L290 TraceCheckUtils]: 37: Hoare triple {3878#(<= ~i~0 17)} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3879#(<= ~i~0 18)} is VALID [2022-02-20 14:27:06,040 INFO L290 TraceCheckUtils]: 38: Hoare triple {3879#(<= ~i~0 18)} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3879#(<= ~i~0 18)} is VALID [2022-02-20 14:27:06,040 INFO L290 TraceCheckUtils]: 39: Hoare triple {3879#(<= ~i~0 18)} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3880#(<= ~i~0 19)} is VALID [2022-02-20 14:27:06,041 INFO L290 TraceCheckUtils]: 40: Hoare triple {3880#(<= ~i~0 19)} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3880#(<= ~i~0 19)} is VALID [2022-02-20 14:27:06,041 INFO L290 TraceCheckUtils]: 41: Hoare triple {3880#(<= ~i~0 19)} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3881#(<= ~i~0 20)} is VALID [2022-02-20 14:27:06,041 INFO L290 TraceCheckUtils]: 42: Hoare triple {3881#(<= ~i~0 20)} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3881#(<= ~i~0 20)} is VALID [2022-02-20 14:27:06,042 INFO L290 TraceCheckUtils]: 43: Hoare triple {3881#(<= ~i~0 20)} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3882#(<= ~i~0 21)} is VALID [2022-02-20 14:27:06,042 INFO L290 TraceCheckUtils]: 44: Hoare triple {3882#(<= ~i~0 21)} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3882#(<= ~i~0 21)} is VALID [2022-02-20 14:27:06,043 INFO L290 TraceCheckUtils]: 45: Hoare triple {3882#(<= ~i~0 21)} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3883#(<= ~i~0 22)} is VALID [2022-02-20 14:27:06,043 INFO L290 TraceCheckUtils]: 46: Hoare triple {3883#(<= ~i~0 22)} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3883#(<= ~i~0 22)} is VALID [2022-02-20 14:27:06,044 INFO L290 TraceCheckUtils]: 47: Hoare triple {3883#(<= ~i~0 22)} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3884#(<= ~i~0 23)} is VALID [2022-02-20 14:27:06,044 INFO L290 TraceCheckUtils]: 48: Hoare triple {3884#(<= ~i~0 23)} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3884#(<= ~i~0 23)} is VALID [2022-02-20 14:27:06,045 INFO L290 TraceCheckUtils]: 49: Hoare triple {3884#(<= ~i~0 23)} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3885#(<= ~i~0 24)} is VALID [2022-02-20 14:27:06,045 INFO L290 TraceCheckUtils]: 50: Hoare triple {3885#(<= ~i~0 24)} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3885#(<= ~i~0 24)} is VALID [2022-02-20 14:27:06,046 INFO L290 TraceCheckUtils]: 51: Hoare triple {3885#(<= ~i~0 24)} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3886#(<= ~i~0 25)} is VALID [2022-02-20 14:27:06,046 INFO L290 TraceCheckUtils]: 52: Hoare triple {3886#(<= ~i~0 25)} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3886#(<= ~i~0 25)} is VALID [2022-02-20 14:27:06,047 INFO L290 TraceCheckUtils]: 53: Hoare triple {3886#(<= ~i~0 25)} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3887#(<= ~i~0 26)} is VALID [2022-02-20 14:27:06,047 INFO L290 TraceCheckUtils]: 54: Hoare triple {3887#(<= ~i~0 26)} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3887#(<= ~i~0 26)} is VALID [2022-02-20 14:27:06,048 INFO L290 TraceCheckUtils]: 55: Hoare triple {3887#(<= ~i~0 26)} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3888#(<= ~i~0 27)} is VALID [2022-02-20 14:27:06,048 INFO L290 TraceCheckUtils]: 56: Hoare triple {3888#(<= ~i~0 27)} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3888#(<= ~i~0 27)} is VALID [2022-02-20 14:27:06,049 INFO L290 TraceCheckUtils]: 57: Hoare triple {3888#(<= ~i~0 27)} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3889#(<= ~i~0 28)} is VALID [2022-02-20 14:27:06,049 INFO L290 TraceCheckUtils]: 58: Hoare triple {3889#(<= ~i~0 28)} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3889#(<= ~i~0 28)} is VALID [2022-02-20 14:27:06,050 INFO L290 TraceCheckUtils]: 59: Hoare triple {3889#(<= ~i~0 28)} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3890#(<= ~i~0 29)} is VALID [2022-02-20 14:27:06,050 INFO L290 TraceCheckUtils]: 60: Hoare triple {3890#(<= ~i~0 29)} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3890#(<= ~i~0 29)} is VALID [2022-02-20 14:27:06,051 INFO L290 TraceCheckUtils]: 61: Hoare triple {3890#(<= ~i~0 29)} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3891#(<= ~i~0 30)} is VALID [2022-02-20 14:27:06,051 INFO L290 TraceCheckUtils]: 62: Hoare triple {3891#(<= ~i~0 30)} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3891#(<= ~i~0 30)} is VALID [2022-02-20 14:27:06,052 INFO L290 TraceCheckUtils]: 63: Hoare triple {3891#(<= ~i~0 30)} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3892#(<= ~i~0 31)} is VALID [2022-02-20 14:27:06,052 INFO L290 TraceCheckUtils]: 64: Hoare triple {3892#(<= ~i~0 31)} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3892#(<= ~i~0 31)} is VALID [2022-02-20 14:27:06,053 INFO L290 TraceCheckUtils]: 65: Hoare triple {3892#(<= ~i~0 31)} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3893#(<= ~i~0 32)} is VALID [2022-02-20 14:27:06,053 INFO L290 TraceCheckUtils]: 66: Hoare triple {3893#(<= ~i~0 32)} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3893#(<= ~i~0 32)} is VALID [2022-02-20 14:27:06,054 INFO L290 TraceCheckUtils]: 67: Hoare triple {3893#(<= ~i~0 32)} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3894#(<= ~i~0 33)} is VALID [2022-02-20 14:27:06,054 INFO L290 TraceCheckUtils]: 68: Hoare triple {3894#(<= ~i~0 33)} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3894#(<= ~i~0 33)} is VALID [2022-02-20 14:27:06,055 INFO L290 TraceCheckUtils]: 69: Hoare triple {3894#(<= ~i~0 33)} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3895#(<= ~i~0 34)} is VALID [2022-02-20 14:27:06,055 INFO L290 TraceCheckUtils]: 70: Hoare triple {3895#(<= ~i~0 34)} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3895#(<= ~i~0 34)} is VALID [2022-02-20 14:27:06,056 INFO L290 TraceCheckUtils]: 71: Hoare triple {3895#(<= ~i~0 34)} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3896#(<= ~i~0 35)} is VALID [2022-02-20 14:27:06,056 INFO L290 TraceCheckUtils]: 72: Hoare triple {3896#(<= ~i~0 35)} assume !!(~i~0 < 1000000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3896#(<= ~i~0 35)} is VALID [2022-02-20 14:27:06,057 INFO L290 TraceCheckUtils]: 73: Hoare triple {3896#(<= ~i~0 35)} main_#t~post1#1 := ~i~0;~i~0 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3897#(<= ~i~0 36)} is VALID [2022-02-20 14:27:06,057 INFO L290 TraceCheckUtils]: 74: Hoare triple {3897#(<= ~i~0 36)} assume !(~i~0 < 1000000); {3860#false} is VALID [2022-02-20 14:27:06,057 INFO L290 TraceCheckUtils]: 75: Hoare triple {3860#false} ~i~0 := 0; {3860#false} is VALID [2022-02-20 14:27:06,057 INFO L290 TraceCheckUtils]: 76: Hoare triple {3860#false} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {3860#false} is VALID [2022-02-20 14:27:06,058 INFO L290 TraceCheckUtils]: 77: Hoare triple {3860#false} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {3860#false} is VALID [2022-02-20 14:27:06,058 INFO L290 TraceCheckUtils]: 78: Hoare triple {3860#false} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {3860#false} is VALID [2022-02-20 14:27:06,058 INFO L290 TraceCheckUtils]: 79: Hoare triple {3860#false} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {3860#false} is VALID [2022-02-20 14:27:06,058 INFO L290 TraceCheckUtils]: 80: Hoare triple {3860#false} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {3860#false} is VALID [2022-02-20 14:27:06,058 INFO L290 TraceCheckUtils]: 81: Hoare triple {3860#false} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {3860#false} is VALID [2022-02-20 14:27:06,058 INFO L290 TraceCheckUtils]: 82: Hoare triple {3860#false} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {3860#false} is VALID [2022-02-20 14:27:06,058 INFO L290 TraceCheckUtils]: 83: Hoare triple {3860#false} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {3860#false} is VALID [2022-02-20 14:27:06,059 INFO L290 TraceCheckUtils]: 84: Hoare triple {3860#false} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {3860#false} is VALID [2022-02-20 14:27:06,059 INFO L290 TraceCheckUtils]: 85: Hoare triple {3860#false} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {3860#false} is VALID [2022-02-20 14:27:06,059 INFO L290 TraceCheckUtils]: 86: Hoare triple {3860#false} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {3860#false} is VALID [2022-02-20 14:27:06,059 INFO L290 TraceCheckUtils]: 87: Hoare triple {3860#false} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {3860#false} is VALID [2022-02-20 14:27:06,059 INFO L290 TraceCheckUtils]: 88: Hoare triple {3860#false} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {3860#false} is VALID [2022-02-20 14:27:06,059 INFO L290 TraceCheckUtils]: 89: Hoare triple {3860#false} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {3860#false} is VALID [2022-02-20 14:27:06,059 INFO L290 TraceCheckUtils]: 90: Hoare triple {3860#false} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {3860#false} is VALID [2022-02-20 14:27:06,060 INFO L290 TraceCheckUtils]: 91: Hoare triple {3860#false} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {3860#false} is VALID [2022-02-20 14:27:06,060 INFO L290 TraceCheckUtils]: 92: Hoare triple {3860#false} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {3860#false} is VALID [2022-02-20 14:27:06,060 INFO L290 TraceCheckUtils]: 93: Hoare triple {3860#false} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {3860#false} is VALID [2022-02-20 14:27:06,060 INFO L290 TraceCheckUtils]: 94: Hoare triple {3860#false} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {3860#false} is VALID [2022-02-20 14:27:06,060 INFO L290 TraceCheckUtils]: 95: Hoare triple {3860#false} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {3860#false} is VALID [2022-02-20 14:27:06,060 INFO L290 TraceCheckUtils]: 96: Hoare triple {3860#false} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {3860#false} is VALID [2022-02-20 14:27:06,061 INFO L290 TraceCheckUtils]: 97: Hoare triple {3860#false} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {3860#false} is VALID [2022-02-20 14:27:06,061 INFO L290 TraceCheckUtils]: 98: Hoare triple {3860#false} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {3860#false} is VALID [2022-02-20 14:27:06,061 INFO L290 TraceCheckUtils]: 99: Hoare triple {3860#false} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {3860#false} is VALID [2022-02-20 14:27:06,061 INFO L290 TraceCheckUtils]: 100: Hoare triple {3860#false} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {3860#false} is VALID [2022-02-20 14:27:06,061 INFO L290 TraceCheckUtils]: 101: Hoare triple {3860#false} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {3860#false} is VALID [2022-02-20 14:27:06,061 INFO L290 TraceCheckUtils]: 102: Hoare triple {3860#false} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {3860#false} is VALID [2022-02-20 14:27:06,061 INFO L290 TraceCheckUtils]: 103: Hoare triple {3860#false} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {3860#false} is VALID [2022-02-20 14:27:06,062 INFO L290 TraceCheckUtils]: 104: Hoare triple {3860#false} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {3860#false} is VALID [2022-02-20 14:27:06,062 INFO L290 TraceCheckUtils]: 105: Hoare triple {3860#false} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {3860#false} is VALID [2022-02-20 14:27:06,062 INFO L290 TraceCheckUtils]: 106: Hoare triple {3860#false} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {3860#false} is VALID [2022-02-20 14:27:06,062 INFO L290 TraceCheckUtils]: 107: Hoare triple {3860#false} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {3860#false} is VALID [2022-02-20 14:27:06,062 INFO L290 TraceCheckUtils]: 108: Hoare triple {3860#false} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {3860#false} is VALID [2022-02-20 14:27:06,062 INFO L290 TraceCheckUtils]: 109: Hoare triple {3860#false} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {3860#false} is VALID [2022-02-20 14:27:06,062 INFO L290 TraceCheckUtils]: 110: Hoare triple {3860#false} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {3860#false} is VALID [2022-02-20 14:27:06,062 INFO L290 TraceCheckUtils]: 111: Hoare triple {3860#false} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {3860#false} is VALID [2022-02-20 14:27:06,062 INFO L290 TraceCheckUtils]: 112: Hoare triple {3860#false} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {3860#false} is VALID [2022-02-20 14:27:06,063 INFO L290 TraceCheckUtils]: 113: Hoare triple {3860#false} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {3860#false} is VALID [2022-02-20 14:27:06,063 INFO L290 TraceCheckUtils]: 114: Hoare triple {3860#false} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {3860#false} is VALID [2022-02-20 14:27:06,063 INFO L290 TraceCheckUtils]: 115: Hoare triple {3860#false} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {3860#false} is VALID [2022-02-20 14:27:06,063 INFO L290 TraceCheckUtils]: 116: Hoare triple {3860#false} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {3860#false} is VALID [2022-02-20 14:27:06,063 INFO L290 TraceCheckUtils]: 117: Hoare triple {3860#false} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {3860#false} is VALID [2022-02-20 14:27:06,063 INFO L290 TraceCheckUtils]: 118: Hoare triple {3860#false} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {3860#false} is VALID [2022-02-20 14:27:06,063 INFO L290 TraceCheckUtils]: 119: Hoare triple {3860#false} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {3860#false} is VALID [2022-02-20 14:27:06,063 INFO L290 TraceCheckUtils]: 120: Hoare triple {3860#false} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {3860#false} is VALID [2022-02-20 14:27:06,063 INFO L290 TraceCheckUtils]: 121: Hoare triple {3860#false} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {3860#false} is VALID [2022-02-20 14:27:06,063 INFO L290 TraceCheckUtils]: 122: Hoare triple {3860#false} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {3860#false} is VALID [2022-02-20 14:27:06,063 INFO L290 TraceCheckUtils]: 123: Hoare triple {3860#false} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {3860#false} is VALID [2022-02-20 14:27:06,063 INFO L290 TraceCheckUtils]: 124: Hoare triple {3860#false} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {3860#false} is VALID [2022-02-20 14:27:06,063 INFO L290 TraceCheckUtils]: 125: Hoare triple {3860#false} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {3860#false} is VALID [2022-02-20 14:27:06,064 INFO L290 TraceCheckUtils]: 126: Hoare triple {3860#false} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {3860#false} is VALID [2022-02-20 14:27:06,064 INFO L290 TraceCheckUtils]: 127: Hoare triple {3860#false} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {3860#false} is VALID [2022-02-20 14:27:06,064 INFO L290 TraceCheckUtils]: 128: Hoare triple {3860#false} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {3860#false} is VALID [2022-02-20 14:27:06,064 INFO L290 TraceCheckUtils]: 129: Hoare triple {3860#false} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {3860#false} is VALID [2022-02-20 14:27:06,064 INFO L290 TraceCheckUtils]: 130: Hoare triple {3860#false} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {3860#false} is VALID [2022-02-20 14:27:06,064 INFO L290 TraceCheckUtils]: 131: Hoare triple {3860#false} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {3860#false} is VALID [2022-02-20 14:27:06,064 INFO L290 TraceCheckUtils]: 132: Hoare triple {3860#false} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {3860#false} is VALID [2022-02-20 14:27:06,065 INFO L290 TraceCheckUtils]: 133: Hoare triple {3860#false} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {3860#false} is VALID [2022-02-20 14:27:06,065 INFO L290 TraceCheckUtils]: 134: Hoare triple {3860#false} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {3860#false} is VALID [2022-02-20 14:27:06,065 INFO L290 TraceCheckUtils]: 135: Hoare triple {3860#false} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {3860#false} is VALID [2022-02-20 14:27:06,065 INFO L290 TraceCheckUtils]: 136: Hoare triple {3860#false} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {3860#false} is VALID [2022-02-20 14:27:06,065 INFO L290 TraceCheckUtils]: 137: Hoare triple {3860#false} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {3860#false} is VALID [2022-02-20 14:27:06,065 INFO L290 TraceCheckUtils]: 138: Hoare triple {3860#false} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {3860#false} is VALID [2022-02-20 14:27:06,065 INFO L290 TraceCheckUtils]: 139: Hoare triple {3860#false} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {3860#false} is VALID [2022-02-20 14:27:06,066 INFO L290 TraceCheckUtils]: 140: Hoare triple {3860#false} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {3860#false} is VALID [2022-02-20 14:27:06,066 INFO L290 TraceCheckUtils]: 141: Hoare triple {3860#false} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {3860#false} is VALID [2022-02-20 14:27:06,066 INFO L290 TraceCheckUtils]: 142: Hoare triple {3860#false} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {3860#false} is VALID [2022-02-20 14:27:06,066 INFO L290 TraceCheckUtils]: 143: Hoare triple {3860#false} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {3860#false} is VALID [2022-02-20 14:27:06,066 INFO L290 TraceCheckUtils]: 144: Hoare triple {3860#false} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {3860#false} is VALID [2022-02-20 14:27:06,066 INFO L290 TraceCheckUtils]: 145: Hoare triple {3860#false} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {3860#false} is VALID [2022-02-20 14:27:06,067 INFO L290 TraceCheckUtils]: 146: Hoare triple {3860#false} assume !!(~i~0 < 500000);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {3860#false} is VALID [2022-02-20 14:27:06,067 INFO L290 TraceCheckUtils]: 147: Hoare triple {3860#false} main_#t~post2#1 := ~i~0;~i~0 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {3860#false} is VALID [2022-02-20 14:27:06,067 INFO L290 TraceCheckUtils]: 148: Hoare triple {3860#false} assume !(~i~0 < 500000); {3860#false} is VALID [2022-02-20 14:27:06,067 INFO L290 TraceCheckUtils]: 149: Hoare triple {3860#false} ~i~0 := 0; {3860#false} is VALID [2022-02-20 14:27:06,067 INFO L290 TraceCheckUtils]: 150: Hoare triple {3860#false} assume !!(~i~0 < 500000);call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem5#1.base != 0 || main_#t~mem5#1.offset != 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3860#false} is VALID [2022-02-20 14:27:06,067 INFO L290 TraceCheckUtils]: 151: Hoare triple {3860#false} assume 0 == __VERIFIER_assert_~cond#1; {3860#false} is VALID [2022-02-20 14:27:06,077 INFO L290 TraceCheckUtils]: 152: Hoare triple {3860#false} assume !false; {3860#false} is VALID [2022-02-20 14:27:06,078 INFO L134 CoverageAnalysis]: Checked inductivity of 2592 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 1296 trivial. 0 not checked. [2022-02-20 14:27:06,078 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:27:06,078 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306854259] [2022-02-20 14:27:06,079 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306854259] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:27:06,079 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799818809] [2022-02-20 14:27:06,079 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-20 14:27:06,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:27:06,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:27:06,084 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:06,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process