./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-examples/standard_init1_ground-2.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-examples/standard_init1_ground-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f3516892ee2b21e8ecfb58de859daab8a3f4cb53e76493a39d9f7eca6aa47ee2 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 14:04:23,782 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 14:04:23,783 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 14:04:23,801 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 14:04:23,801 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 14:04:23,802 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 14:04:23,803 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 14:04:23,804 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 14:04:23,805 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 14:04:23,806 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 14:04:23,806 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 14:04:23,807 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 14:04:23,807 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 14:04:23,808 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 14:04:23,809 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 14:04:23,809 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 14:04:23,810 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 14:04:23,811 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 14:04:23,812 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 14:04:23,813 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 14:04:23,814 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 14:04:23,814 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 14:04:23,815 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 14:04:23,816 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 14:04:23,817 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 14:04:23,818 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 14:04:23,818 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 14:04:23,818 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 14:04:23,819 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 14:04:23,819 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 14:04:23,820 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 14:04:23,820 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 14:04:23,821 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 14:04:23,821 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 14:04:23,822 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 14:04:23,822 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 14:04:23,822 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 14:04:23,823 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 14:04:23,823 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 14:04:23,823 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 14:04:23,824 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 14:04:23,825 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:04:23,837 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 14:04:23,838 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 14:04:23,838 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 14:04:23,838 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 14:04:23,838 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 14:04:23,839 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 14:04:23,839 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 14:04:23,839 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 14:04:23,839 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 14:04:23,840 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 14:04:23,840 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 14:04:23,840 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 14:04:23,840 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 14:04:23,840 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 14:04:23,840 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 14:04:23,840 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 14:04:23,841 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 14:04:23,841 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 14:04:23,841 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 14:04:23,841 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 14:04:23,841 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 14:04:23,841 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 14:04:23,841 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 14:04:23,842 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 14:04:23,842 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:04:23,842 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 14:04:23,842 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 14:04:23,842 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 14:04:23,842 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 14:04:23,843 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 14:04:23,843 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 14:04:23,843 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 14:04:23,843 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 14:04:23,843 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 -> f3516892ee2b21e8ecfb58de859daab8a3f4cb53e76493a39d9f7eca6aa47ee2 [2022-02-20 14:04:24,039 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 14:04:24,059 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 14:04:24,062 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 14:04:24,063 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 14:04:24,064 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 14:04:24,065 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-examples/standard_init1_ground-2.i [2022-02-20 14:04:24,132 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/155c73e57/f1511a1c571a4f75ac3253b28e66b7a2/FLAG4b79a4758 [2022-02-20 14:04:24,463 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 14:04:24,463 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/standard_init1_ground-2.i [2022-02-20 14:04:24,471 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/155c73e57/f1511a1c571a4f75ac3253b28e66b7a2/FLAG4b79a4758 [2022-02-20 14:04:24,480 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/155c73e57/f1511a1c571a4f75ac3253b28e66b7a2 [2022-02-20 14:04:24,482 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 14:04:24,484 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 14:04:24,485 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 14:04:24,487 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 14:04:24,491 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 14:04:24,492 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:04:24" (1/1) ... [2022-02-20 14:04:24,493 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25fa8a4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:04:24, skipping insertion in model container [2022-02-20 14:04:24,494 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:04:24" (1/1) ... [2022-02-20 14:04:24,500 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 14:04:24,511 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 14:04:24,653 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/standard_init1_ground-2.i[816,829] [2022-02-20 14:04:24,672 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:04:24,677 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 14:04:24,685 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/standard_init1_ground-2.i[816,829] [2022-02-20 14:04:24,689 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:04:24,699 INFO L208 MainTranslator]: Completed translation [2022-02-20 14:04:24,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:04:24 WrapperNode [2022-02-20 14:04:24,699 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 14:04:24,700 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 14:04:24,700 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 14:04:24,700 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 14:04:24,707 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:04:24" (1/1) ... [2022-02-20 14:04:24,713 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:04:24" (1/1) ... [2022-02-20 14:04:24,735 INFO L137 Inliner]: procedures = 15, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 40 [2022-02-20 14:04:24,735 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 14:04:24,736 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 14:04:24,736 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 14:04:24,736 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 14:04:24,741 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:04:24" (1/1) ... [2022-02-20 14:04:24,742 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:04:24" (1/1) ... [2022-02-20 14:04:24,751 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:04:24" (1/1) ... [2022-02-20 14:04:24,752 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:04:24" (1/1) ... [2022-02-20 14:04:24,758 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:04:24" (1/1) ... [2022-02-20 14:04:24,764 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:04:24" (1/1) ... [2022-02-20 14:04:24,769 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:04:24" (1/1) ... [2022-02-20 14:04:24,770 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 14:04:24,771 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 14:04:24,772 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 14:04:24,772 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 14:04:24,773 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:04:24" (1/1) ... [2022-02-20 14:04:24,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:04:24,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:04:24,830 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:04:24,876 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:04:24,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 14:04:24,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 14:04:24,901 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 14:04:24,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 14:04:24,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 14:04:24,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 14:04:24,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 14:04:24,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 14:04:24,960 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 14:04:24,961 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 14:04:25,081 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 14:04:25,085 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 14:04:25,086 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 14:04:25,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:04:25 BoogieIcfgContainer [2022-02-20 14:04:25,089 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 14:04:25,090 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 14:04:25,090 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 14:04:25,101 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 14:04:25,101 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 02:04:24" (1/3) ... [2022-02-20 14:04:25,102 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d51851 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:04:25, skipping insertion in model container [2022-02-20 14:04:25,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:04:24" (2/3) ... [2022-02-20 14:04:25,116 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d51851 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:04:25, skipping insertion in model container [2022-02-20 14:04:25,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:04:25" (3/3) ... [2022-02-20 14:04:25,117 INFO L111 eAbstractionObserver]: Analyzing ICFG standard_init1_ground-2.i [2022-02-20 14:04:25,121 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 14:04:25,121 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 14:04:25,185 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 14:04:25,190 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:04:25,203 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 14:04:25,214 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 12 states have (on average 1.5) internal successors, (18), 13 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:04:25,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 14:04:25,229 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:04:25,230 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:04:25,230 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:04:25,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:04:25,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1808850128, now seen corresponding path program 1 times [2022-02-20 14:04:25,241 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:04:25,255 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059420797] [2022-02-20 14:04:25,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:04:25,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:04:25,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:04:25,411 INFO L290 TraceCheckUtils]: 0: Hoare triple {17#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {17#true} is VALID [2022-02-20 14:04:25,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {17#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem2#1, main_#t~post1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {19#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:04:25,414 INFO L290 TraceCheckUtils]: 2: Hoare triple {19#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~i~0#1 < 100000); {18#false} is VALID [2022-02-20 14:04:25,415 INFO L290 TraceCheckUtils]: 3: Hoare triple {18#false} havoc main_~x~0#1;main_~x~0#1 := 0; {18#false} is VALID [2022-02-20 14:04:25,415 INFO L290 TraceCheckUtils]: 4: Hoare triple {18#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 42 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {18#false} is VALID [2022-02-20 14:04:25,415 INFO L290 TraceCheckUtils]: 5: Hoare triple {18#false} assume 0 == __VERIFIER_assert_~cond#1; {18#false} is VALID [2022-02-20 14:04:25,416 INFO L290 TraceCheckUtils]: 6: Hoare triple {18#false} assume !false; {18#false} is VALID [2022-02-20 14:04:25,416 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:04:25,417 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:04:25,417 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059420797] [2022-02-20 14:04:25,418 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059420797] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:04:25,419 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:04:25,419 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:04:25,421 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175643877] [2022-02-20 14:04:25,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:04:25,426 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-02-20 14:04:25,426 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:04:25,429 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:25,448 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:04:25,448 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:04:25,449 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:04:25,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:04:25,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:04:25,471 INFO L87 Difference]: Start difference. First operand has 14 states, 12 states have (on average 1.5) internal successors, (18), 13 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 has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:25,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:04:25,511 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2022-02-20 14:04:25,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:04:25,512 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-02-20 14:04:25,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:04:25,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:25,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-02-20 14:04:25,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:25,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-02-20 14:04:25,522 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 34 transitions. [2022-02-20 14:04:25,583 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:04:25,597 INFO L225 Difference]: With dead ends: 26 [2022-02-20 14:04:25,598 INFO L226 Difference]: Without dead ends: 11 [2022-02-20 14:04:25,599 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:04:25,604 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:04:25,605 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:04:25,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2022-02-20 14:04:25,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2022-02-20 14:04:25,625 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:04:25,626 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states. Second operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:25,626 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:25,627 INFO L87 Difference]: Start difference. First operand 11 states. Second operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:25,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:04:25,630 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2022-02-20 14:04:25,630 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2022-02-20 14:04:25,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:04:25,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:04:25,631 INFO L74 IsIncluded]: Start isIncluded. First operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 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 11 states. [2022-02-20 14:04:25,632 INFO L87 Difference]: Start difference. First operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 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 11 states. [2022-02-20 14:04:25,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:04:25,634 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2022-02-20 14:04:25,634 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2022-02-20 14:04:25,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:04:25,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:04:25,635 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:04:25,635 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:04:25,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:25,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2022-02-20 14:04:25,642 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 7 [2022-02-20 14:04:25,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:04:25,642 INFO L470 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2022-02-20 14:04:25,642 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:25,644 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2022-02-20 14:04:25,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 14:04:25,644 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:04:25,644 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:04:25,645 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 14:04:25,646 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:04:25,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:04:25,648 INFO L85 PathProgramCache]: Analyzing trace with hash 291255051, now seen corresponding path program 1 times [2022-02-20 14:04:25,649 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:04:25,650 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789285694] [2022-02-20 14:04:25,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:04:25,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:04:25,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:04:25,718 INFO L290 TraceCheckUtils]: 0: Hoare triple {90#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {90#true} is VALID [2022-02-20 14:04:25,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {90#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem2#1, main_#t~post1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {92#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:04:25,721 INFO L290 TraceCheckUtils]: 2: Hoare triple {92#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {93#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:04:25,721 INFO L290 TraceCheckUtils]: 3: Hoare triple {93#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < 100000); {91#false} is VALID [2022-02-20 14:04:25,721 INFO L290 TraceCheckUtils]: 4: Hoare triple {91#false} havoc main_~x~0#1;main_~x~0#1 := 0; {91#false} is VALID [2022-02-20 14:04:25,722 INFO L290 TraceCheckUtils]: 5: Hoare triple {91#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 42 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {91#false} is VALID [2022-02-20 14:04:25,728 INFO L290 TraceCheckUtils]: 6: Hoare triple {91#false} assume 0 == __VERIFIER_assert_~cond#1; {91#false} is VALID [2022-02-20 14:04:25,729 INFO L290 TraceCheckUtils]: 7: Hoare triple {91#false} assume !false; {91#false} is VALID [2022-02-20 14:04:25,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:04:25,730 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:04:25,730 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789285694] [2022-02-20 14:04:25,730 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789285694] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:04:25,730 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [377722315] [2022-02-20 14:04:25,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:04:25,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:04:25,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:04:25,768 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:04:25,784 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:04:25,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:04:25,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 14:04:25,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:04:25,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:04:25,869 INFO L290 TraceCheckUtils]: 0: Hoare triple {90#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {90#true} is VALID [2022-02-20 14:04:25,870 INFO L290 TraceCheckUtils]: 1: Hoare triple {90#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem2#1, main_#t~post1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {100#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:04:25,871 INFO L290 TraceCheckUtils]: 2: Hoare triple {100#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {93#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:04:25,871 INFO L290 TraceCheckUtils]: 3: Hoare triple {93#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < 100000); {91#false} is VALID [2022-02-20 14:04:25,871 INFO L290 TraceCheckUtils]: 4: Hoare triple {91#false} havoc main_~x~0#1;main_~x~0#1 := 0; {91#false} is VALID [2022-02-20 14:04:25,872 INFO L290 TraceCheckUtils]: 5: Hoare triple {91#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 42 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {91#false} is VALID [2022-02-20 14:04:25,872 INFO L290 TraceCheckUtils]: 6: Hoare triple {91#false} assume 0 == __VERIFIER_assert_~cond#1; {91#false} is VALID [2022-02-20 14:04:25,872 INFO L290 TraceCheckUtils]: 7: Hoare triple {91#false} assume !false; {91#false} is VALID [2022-02-20 14:04:25,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:04:25,872 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:04:25,929 INFO L290 TraceCheckUtils]: 7: Hoare triple {91#false} assume !false; {91#false} is VALID [2022-02-20 14:04:25,929 INFO L290 TraceCheckUtils]: 6: Hoare triple {91#false} assume 0 == __VERIFIER_assert_~cond#1; {91#false} is VALID [2022-02-20 14:04:25,929 INFO L290 TraceCheckUtils]: 5: Hoare triple {91#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 42 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {91#false} is VALID [2022-02-20 14:04:25,929 INFO L290 TraceCheckUtils]: 4: Hoare triple {91#false} havoc main_~x~0#1;main_~x~0#1 := 0; {91#false} is VALID [2022-02-20 14:04:25,930 INFO L290 TraceCheckUtils]: 3: Hoare triple {131#(< |ULTIMATE.start_main_~i~0#1| 100000)} assume !(main_~i~0#1 < 100000); {91#false} is VALID [2022-02-20 14:04:25,930 INFO L290 TraceCheckUtils]: 2: Hoare triple {135#(< |ULTIMATE.start_main_~i~0#1| 99999)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {131#(< |ULTIMATE.start_main_~i~0#1| 100000)} is VALID [2022-02-20 14:04:25,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {90#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem2#1, main_#t~post1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {135#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:04:25,931 INFO L290 TraceCheckUtils]: 0: Hoare triple {90#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {90#true} is VALID [2022-02-20 14:04:25,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:04:25,932 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [377722315] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:04:25,932 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:04:25,932 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-02-20 14:04:25,932 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687513590] [2022-02-20 14:04:25,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:04:25,933 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 14:04:25,933 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:04:25,933 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:25,942 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:04:25,942 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 14:04:25,942 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:04:25,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 14:04:25,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-02-20 14:04:25,943 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:25,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:04:25,973 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2022-02-20 14:04:25,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 14:04:25,973 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 14:04:25,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:04:25,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:25,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 25 transitions. [2022-02-20 14:04:25,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:25,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 25 transitions. [2022-02-20 14:04:25,975 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 25 transitions. [2022-02-20 14:04:25,991 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:04:25,991 INFO L225 Difference]: With dead ends: 21 [2022-02-20 14:04:25,992 INFO L226 Difference]: Without dead ends: 14 [2022-02-20 14:04:25,992 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 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:04:25,993 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:04:25,993 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:04:25,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-02-20 14:04:25,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-02-20 14:04:25,997 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:04:25,997 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:25,997 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:25,997 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:25,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:04:25,998 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-02-20 14:04:25,998 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-02-20 14:04:25,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:04:25,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:04:25,999 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 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 14 states. [2022-02-20 14:04:25,999 INFO L87 Difference]: Start difference. First operand has 14 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 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 14 states. [2022-02-20 14:04:26,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:04:26,000 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-02-20 14:04:26,000 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-02-20 14:04:26,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:04:26,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:04:26,000 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:04:26,000 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:04:26,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:26,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-02-20 14:04:26,001 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 8 [2022-02-20 14:04:26,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:04:26,002 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-02-20 14:04:26,002 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:26,002 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-02-20 14:04:26,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 14:04:26,002 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:04:26,003 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:04:26,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-20 14:04:26,222 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:04:26,223 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:04:26,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:04:26,224 INFO L85 PathProgramCache]: Analyzing trace with hash 521278352, now seen corresponding path program 2 times [2022-02-20 14:04:26,224 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:04:26,224 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246172347] [2022-02-20 14:04:26,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:04:26,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:04:26,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:04:26,294 INFO L290 TraceCheckUtils]: 0: Hoare triple {217#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {217#true} is VALID [2022-02-20 14:04:26,295 INFO L290 TraceCheckUtils]: 1: Hoare triple {217#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem2#1, main_#t~post1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {219#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:04:26,295 INFO L290 TraceCheckUtils]: 2: Hoare triple {219#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {220#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:04:26,296 INFO L290 TraceCheckUtils]: 3: Hoare triple {220#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {221#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:04:26,297 INFO L290 TraceCheckUtils]: 4: Hoare triple {221#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {222#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:04:26,297 INFO L290 TraceCheckUtils]: 5: Hoare triple {222#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {223#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:04:26,298 INFO L290 TraceCheckUtils]: 6: Hoare triple {223#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !(main_~i~0#1 < 100000); {218#false} is VALID [2022-02-20 14:04:26,298 INFO L290 TraceCheckUtils]: 7: Hoare triple {218#false} havoc main_~x~0#1;main_~x~0#1 := 0; {218#false} is VALID [2022-02-20 14:04:26,298 INFO L290 TraceCheckUtils]: 8: Hoare triple {218#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 42 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {218#false} is VALID [2022-02-20 14:04:26,298 INFO L290 TraceCheckUtils]: 9: Hoare triple {218#false} assume 0 == __VERIFIER_assert_~cond#1; {218#false} is VALID [2022-02-20 14:04:26,299 INFO L290 TraceCheckUtils]: 10: Hoare triple {218#false} assume !false; {218#false} is VALID [2022-02-20 14:04:26,299 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:04:26,299 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:04:26,299 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246172347] [2022-02-20 14:04:26,299 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246172347] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:04:26,300 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [883878067] [2022-02-20 14:04:26,300 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 14:04:26,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:04:26,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:04:26,303 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:04:26,304 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:04:26,338 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 14:04:26,338 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:04:26,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 14:04:26,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:04:26,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:04:26,420 INFO L290 TraceCheckUtils]: 0: Hoare triple {217#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {217#true} is VALID [2022-02-20 14:04:26,421 INFO L290 TraceCheckUtils]: 1: Hoare triple {217#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem2#1, main_#t~post1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {230#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:04:26,422 INFO L290 TraceCheckUtils]: 2: Hoare triple {230#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {220#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:04:26,422 INFO L290 TraceCheckUtils]: 3: Hoare triple {220#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {221#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:04:26,423 INFO L290 TraceCheckUtils]: 4: Hoare triple {221#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {222#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:04:26,423 INFO L290 TraceCheckUtils]: 5: Hoare triple {222#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {223#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:04:26,424 INFO L290 TraceCheckUtils]: 6: Hoare triple {223#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !(main_~i~0#1 < 100000); {218#false} is VALID [2022-02-20 14:04:26,424 INFO L290 TraceCheckUtils]: 7: Hoare triple {218#false} havoc main_~x~0#1;main_~x~0#1 := 0; {218#false} is VALID [2022-02-20 14:04:26,424 INFO L290 TraceCheckUtils]: 8: Hoare triple {218#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 42 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {218#false} is VALID [2022-02-20 14:04:26,424 INFO L290 TraceCheckUtils]: 9: Hoare triple {218#false} assume 0 == __VERIFIER_assert_~cond#1; {218#false} is VALID [2022-02-20 14:04:26,424 INFO L290 TraceCheckUtils]: 10: Hoare triple {218#false} assume !false; {218#false} is VALID [2022-02-20 14:04:26,425 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:04:26,425 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:04:26,538 INFO L290 TraceCheckUtils]: 10: Hoare triple {218#false} assume !false; {218#false} is VALID [2022-02-20 14:04:26,539 INFO L290 TraceCheckUtils]: 9: Hoare triple {218#false} assume 0 == __VERIFIER_assert_~cond#1; {218#false} is VALID [2022-02-20 14:04:26,539 INFO L290 TraceCheckUtils]: 8: Hoare triple {218#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 42 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {218#false} is VALID [2022-02-20 14:04:26,539 INFO L290 TraceCheckUtils]: 7: Hoare triple {218#false} havoc main_~x~0#1;main_~x~0#1 := 0; {218#false} is VALID [2022-02-20 14:04:26,539 INFO L290 TraceCheckUtils]: 6: Hoare triple {270#(< |ULTIMATE.start_main_~i~0#1| 100000)} assume !(main_~i~0#1 < 100000); {218#false} is VALID [2022-02-20 14:04:26,540 INFO L290 TraceCheckUtils]: 5: Hoare triple {274#(< |ULTIMATE.start_main_~i~0#1| 99999)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {270#(< |ULTIMATE.start_main_~i~0#1| 100000)} is VALID [2022-02-20 14:04:26,541 INFO L290 TraceCheckUtils]: 4: Hoare triple {278#(< |ULTIMATE.start_main_~i~0#1| 99998)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {274#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:04:26,541 INFO L290 TraceCheckUtils]: 3: Hoare triple {282#(< |ULTIMATE.start_main_~i~0#1| 99997)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {278#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:04:26,542 INFO L290 TraceCheckUtils]: 2: Hoare triple {286#(< |ULTIMATE.start_main_~i~0#1| 99996)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {282#(< |ULTIMATE.start_main_~i~0#1| 99997)} is VALID [2022-02-20 14:04:26,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {217#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem2#1, main_#t~post1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {286#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-20 14:04:26,543 INFO L290 TraceCheckUtils]: 0: Hoare triple {217#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {217#true} is VALID [2022-02-20 14:04:26,543 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:04:26,544 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [883878067] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:04:26,544 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:04:26,544 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-02-20 14:04:26,545 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857121989] [2022-02-20 14:04:26,545 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:04:26,547 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 14:04:26,547 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:04:26,549 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:26,562 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:04:26,562 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 14:04:26,562 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:04:26,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 14:04:26,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-02-20 14:04:26,564 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:26,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:04:26,618 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2022-02-20 14:04:26,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 14:04:26,618 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 14:04:26,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:04:26,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:26,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 34 transitions. [2022-02-20 14:04:26,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:26,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 34 transitions. [2022-02-20 14:04:26,622 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 34 transitions. [2022-02-20 14:04:26,645 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:04:26,648 INFO L225 Difference]: With dead ends: 27 [2022-02-20 14:04:26,649 INFO L226 Difference]: Without dead ends: 20 [2022-02-20 14:04:26,649 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 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:04:26,652 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:04:26,652 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:04:26,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-02-20 14:04:26,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-02-20 14:04:26,661 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:04:26,661 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:26,662 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:26,662 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:26,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:04:26,663 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-02-20 14:04:26,663 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-02-20 14:04:26,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:04:26,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:04:26,665 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 20 states. [2022-02-20 14:04:26,665 INFO L87 Difference]: Start difference. First operand has 20 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 20 states. [2022-02-20 14:04:26,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:04:26,667 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-02-20 14:04:26,667 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-02-20 14:04:26,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:04:26,668 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:04:26,668 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:04:26,668 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:04:26,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:26,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2022-02-20 14:04:26,669 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 11 [2022-02-20 14:04:26,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:04:26,669 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2022-02-20 14:04:26,669 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:26,669 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-02-20 14:04:26,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 14:04:26,670 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:04:26,670 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:04:26,706 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:04:26,892 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:04:26,893 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:04:26,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:04:26,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1061727824, now seen corresponding path program 3 times [2022-02-20 14:04:26,893 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:04:26,893 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529788639] [2022-02-20 14:04:26,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:04:26,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:04:26,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:04:27,033 INFO L290 TraceCheckUtils]: 0: Hoare triple {404#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {404#true} is VALID [2022-02-20 14:04:27,034 INFO L290 TraceCheckUtils]: 1: Hoare triple {404#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem2#1, main_#t~post1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {406#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:04:27,034 INFO L290 TraceCheckUtils]: 2: Hoare triple {406#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {407#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:04:27,035 INFO L290 TraceCheckUtils]: 3: Hoare triple {407#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {408#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:04:27,035 INFO L290 TraceCheckUtils]: 4: Hoare triple {408#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {409#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:04:27,036 INFO L290 TraceCheckUtils]: 5: Hoare triple {409#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {410#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:04:27,037 INFO L290 TraceCheckUtils]: 6: Hoare triple {410#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {411#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:04:27,037 INFO L290 TraceCheckUtils]: 7: Hoare triple {411#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {412#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:04:27,038 INFO L290 TraceCheckUtils]: 8: Hoare triple {412#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {413#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:04:27,038 INFO L290 TraceCheckUtils]: 9: Hoare triple {413#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {414#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:04:27,039 INFO L290 TraceCheckUtils]: 10: Hoare triple {414#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {415#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:04:27,040 INFO L290 TraceCheckUtils]: 11: Hoare triple {415#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {416#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:04:27,040 INFO L290 TraceCheckUtils]: 12: Hoare triple {416#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !(main_~i~0#1 < 100000); {405#false} is VALID [2022-02-20 14:04:27,040 INFO L290 TraceCheckUtils]: 13: Hoare triple {405#false} havoc main_~x~0#1;main_~x~0#1 := 0; {405#false} is VALID [2022-02-20 14:04:27,040 INFO L290 TraceCheckUtils]: 14: Hoare triple {405#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 42 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {405#false} is VALID [2022-02-20 14:04:27,041 INFO L290 TraceCheckUtils]: 15: Hoare triple {405#false} assume 0 == __VERIFIER_assert_~cond#1; {405#false} is VALID [2022-02-20 14:04:27,041 INFO L290 TraceCheckUtils]: 16: Hoare triple {405#false} assume !false; {405#false} is VALID [2022-02-20 14:04:27,041 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:04:27,041 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:04:27,041 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529788639] [2022-02-20 14:04:27,041 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529788639] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:04:27,042 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247624304] [2022-02-20 14:04:27,042 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 14:04:27,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:04:27,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:04:27,043 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:04:27,078 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:04:27,121 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-02-20 14:04:27,121 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:04:27,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 14:04:27,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:04:27,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:04:27,286 INFO L290 TraceCheckUtils]: 0: Hoare triple {404#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {404#true} is VALID [2022-02-20 14:04:27,287 INFO L290 TraceCheckUtils]: 1: Hoare triple {404#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem2#1, main_#t~post1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {423#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:04:27,288 INFO L290 TraceCheckUtils]: 2: Hoare triple {423#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {407#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:04:27,290 INFO L290 TraceCheckUtils]: 3: Hoare triple {407#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {408#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:04:27,291 INFO L290 TraceCheckUtils]: 4: Hoare triple {408#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {409#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:04:27,291 INFO L290 TraceCheckUtils]: 5: Hoare triple {409#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {410#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:04:27,292 INFO L290 TraceCheckUtils]: 6: Hoare triple {410#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {411#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:04:27,292 INFO L290 TraceCheckUtils]: 7: Hoare triple {411#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {412#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:04:27,293 INFO L290 TraceCheckUtils]: 8: Hoare triple {412#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {413#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:04:27,293 INFO L290 TraceCheckUtils]: 9: Hoare triple {413#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {414#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:04:27,294 INFO L290 TraceCheckUtils]: 10: Hoare triple {414#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {415#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:04:27,294 INFO L290 TraceCheckUtils]: 11: Hoare triple {415#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {416#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:04:27,295 INFO L290 TraceCheckUtils]: 12: Hoare triple {416#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !(main_~i~0#1 < 100000); {405#false} is VALID [2022-02-20 14:04:27,295 INFO L290 TraceCheckUtils]: 13: Hoare triple {405#false} havoc main_~x~0#1;main_~x~0#1 := 0; {405#false} is VALID [2022-02-20 14:04:27,295 INFO L290 TraceCheckUtils]: 14: Hoare triple {405#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 42 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {405#false} is VALID [2022-02-20 14:04:27,295 INFO L290 TraceCheckUtils]: 15: Hoare triple {405#false} assume 0 == __VERIFIER_assert_~cond#1; {405#false} is VALID [2022-02-20 14:04:27,295 INFO L290 TraceCheckUtils]: 16: Hoare triple {405#false} assume !false; {405#false} is VALID [2022-02-20 14:04:27,296 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:04:27,296 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:04:27,545 INFO L290 TraceCheckUtils]: 16: Hoare triple {405#false} assume !false; {405#false} is VALID [2022-02-20 14:04:27,545 INFO L290 TraceCheckUtils]: 15: Hoare triple {405#false} assume 0 == __VERIFIER_assert_~cond#1; {405#false} is VALID [2022-02-20 14:04:27,546 INFO L290 TraceCheckUtils]: 14: Hoare triple {405#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 42 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {405#false} is VALID [2022-02-20 14:04:27,546 INFO L290 TraceCheckUtils]: 13: Hoare triple {405#false} havoc main_~x~0#1;main_~x~0#1 := 0; {405#false} is VALID [2022-02-20 14:04:27,546 INFO L290 TraceCheckUtils]: 12: Hoare triple {481#(< |ULTIMATE.start_main_~i~0#1| 100000)} assume !(main_~i~0#1 < 100000); {405#false} is VALID [2022-02-20 14:04:27,547 INFO L290 TraceCheckUtils]: 11: Hoare triple {485#(< |ULTIMATE.start_main_~i~0#1| 99999)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {481#(< |ULTIMATE.start_main_~i~0#1| 100000)} is VALID [2022-02-20 14:04:27,548 INFO L290 TraceCheckUtils]: 10: Hoare triple {489#(< |ULTIMATE.start_main_~i~0#1| 99998)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {485#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:04:27,550 INFO L290 TraceCheckUtils]: 9: Hoare triple {493#(< |ULTIMATE.start_main_~i~0#1| 99997)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {489#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:04:27,551 INFO L290 TraceCheckUtils]: 8: Hoare triple {497#(< |ULTIMATE.start_main_~i~0#1| 99996)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {493#(< |ULTIMATE.start_main_~i~0#1| 99997)} is VALID [2022-02-20 14:04:27,552 INFO L290 TraceCheckUtils]: 7: Hoare triple {501#(< |ULTIMATE.start_main_~i~0#1| 99995)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {497#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-20 14:04:27,552 INFO L290 TraceCheckUtils]: 6: Hoare triple {505#(< |ULTIMATE.start_main_~i~0#1| 99994)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {501#(< |ULTIMATE.start_main_~i~0#1| 99995)} is VALID [2022-02-20 14:04:27,560 INFO L290 TraceCheckUtils]: 5: Hoare triple {509#(< |ULTIMATE.start_main_~i~0#1| 99993)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {505#(< |ULTIMATE.start_main_~i~0#1| 99994)} is VALID [2022-02-20 14:04:27,561 INFO L290 TraceCheckUtils]: 4: Hoare triple {513#(< |ULTIMATE.start_main_~i~0#1| 99992)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {509#(< |ULTIMATE.start_main_~i~0#1| 99993)} is VALID [2022-02-20 14:04:27,561 INFO L290 TraceCheckUtils]: 3: Hoare triple {517#(< |ULTIMATE.start_main_~i~0#1| 99991)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {513#(< |ULTIMATE.start_main_~i~0#1| 99992)} is VALID [2022-02-20 14:04:27,562 INFO L290 TraceCheckUtils]: 2: Hoare triple {521#(< |ULTIMATE.start_main_~i~0#1| 99990)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {517#(< |ULTIMATE.start_main_~i~0#1| 99991)} is VALID [2022-02-20 14:04:27,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {404#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem2#1, main_#t~post1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {521#(< |ULTIMATE.start_main_~i~0#1| 99990)} is VALID [2022-02-20 14:04:27,563 INFO L290 TraceCheckUtils]: 0: Hoare triple {404#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {404#true} is VALID [2022-02-20 14:04:27,563 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:04:27,564 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247624304] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:04:27,564 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:04:27,564 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2022-02-20 14:04:27,564 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710663162] [2022-02-20 14:04:27,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:04:27,565 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-20 14:04:27,565 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:04:27,565 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:27,590 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:04:27,591 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-02-20 14:04:27,591 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:04:27,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-02-20 14:04:27,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2022-02-20 14:04:27,592 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand has 25 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:27,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:04:27,723 INFO L93 Difference]: Finished difference Result 39 states and 52 transitions. [2022-02-20 14:04:27,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-02-20 14:04:27,723 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-20 14:04:27,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:04:27,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:27,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 52 transitions. [2022-02-20 14:04:27,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:27,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 52 transitions. [2022-02-20 14:04:27,732 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 52 transitions. [2022-02-20 14:04:27,778 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:04:27,779 INFO L225 Difference]: With dead ends: 39 [2022-02-20 14:04:27,779 INFO L226 Difference]: Without dead ends: 32 [2022-02-20 14:04:27,780 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2022-02-20 14:04:27,780 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:04:27,781 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:04:27,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-02-20 14:04:27,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-02-20 14:04:27,804 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:04:27,804 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:27,805 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:27,805 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:27,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:04:27,806 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2022-02-20 14:04:27,806 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2022-02-20 14:04:27,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:04:27,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:04:27,806 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 32 states. [2022-02-20 14:04:27,811 INFO L87 Difference]: Start difference. First operand has 32 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 32 states. [2022-02-20 14:04:27,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:04:27,816 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2022-02-20 14:04:27,816 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2022-02-20 14:04:27,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:04:27,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:04:27,816 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:04:27,816 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:04:27,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:27,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2022-02-20 14:04:27,818 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 17 [2022-02-20 14:04:27,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:04:27,818 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2022-02-20 14:04:27,818 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:27,828 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2022-02-20 14:04:27,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 14:04:27,830 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:04:27,830 INFO L514 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:04:27,847 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:04:28,030 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:04:28,031 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:04:28,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:04:28,031 INFO L85 PathProgramCache]: Analyzing trace with hash 265717232, now seen corresponding path program 4 times [2022-02-20 14:04:28,031 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:04:28,031 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722106382] [2022-02-20 14:04:28,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:04:28,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:04:28,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:04:28,500 INFO L290 TraceCheckUtils]: 0: Hoare triple {711#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {711#true} is VALID [2022-02-20 14:04:28,501 INFO L290 TraceCheckUtils]: 1: Hoare triple {711#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem2#1, main_#t~post1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {713#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:04:28,501 INFO L290 TraceCheckUtils]: 2: Hoare triple {713#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {714#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:04:28,502 INFO L290 TraceCheckUtils]: 3: Hoare triple {714#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {715#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:04:28,502 INFO L290 TraceCheckUtils]: 4: Hoare triple {715#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {716#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:04:28,503 INFO L290 TraceCheckUtils]: 5: Hoare triple {716#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {717#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:04:28,503 INFO L290 TraceCheckUtils]: 6: Hoare triple {717#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {718#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:04:28,504 INFO L290 TraceCheckUtils]: 7: Hoare triple {718#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {719#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:04:28,504 INFO L290 TraceCheckUtils]: 8: Hoare triple {719#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {720#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:04:28,505 INFO L290 TraceCheckUtils]: 9: Hoare triple {720#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {721#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:04:28,505 INFO L290 TraceCheckUtils]: 10: Hoare triple {721#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {722#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:04:28,506 INFO L290 TraceCheckUtils]: 11: Hoare triple {722#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {723#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:04:28,506 INFO L290 TraceCheckUtils]: 12: Hoare triple {723#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {724#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-20 14:04:28,507 INFO L290 TraceCheckUtils]: 13: Hoare triple {724#(<= |ULTIMATE.start_main_~i~0#1| 11)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {725#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 14:04:28,511 INFO L290 TraceCheckUtils]: 14: Hoare triple {725#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {726#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-20 14:04:28,512 INFO L290 TraceCheckUtils]: 15: Hoare triple {726#(<= |ULTIMATE.start_main_~i~0#1| 13)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {727#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 14:04:28,513 INFO L290 TraceCheckUtils]: 16: Hoare triple {727#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {728#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-20 14:04:28,513 INFO L290 TraceCheckUtils]: 17: Hoare triple {728#(<= |ULTIMATE.start_main_~i~0#1| 15)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {729#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 14:04:28,514 INFO L290 TraceCheckUtils]: 18: Hoare triple {729#(<= |ULTIMATE.start_main_~i~0#1| 16)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {730#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-20 14:04:28,514 INFO L290 TraceCheckUtils]: 19: Hoare triple {730#(<= |ULTIMATE.start_main_~i~0#1| 17)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {731#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 14:04:28,515 INFO L290 TraceCheckUtils]: 20: Hoare triple {731#(<= |ULTIMATE.start_main_~i~0#1| 18)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {732#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-20 14:04:28,515 INFO L290 TraceCheckUtils]: 21: Hoare triple {732#(<= |ULTIMATE.start_main_~i~0#1| 19)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {733#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 14:04:28,516 INFO L290 TraceCheckUtils]: 22: Hoare triple {733#(<= |ULTIMATE.start_main_~i~0#1| 20)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {734#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-20 14:04:28,516 INFO L290 TraceCheckUtils]: 23: Hoare triple {734#(<= |ULTIMATE.start_main_~i~0#1| 21)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {735#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-20 14:04:28,516 INFO L290 TraceCheckUtils]: 24: Hoare triple {735#(<= |ULTIMATE.start_main_~i~0#1| 22)} assume !(main_~i~0#1 < 100000); {712#false} is VALID [2022-02-20 14:04:28,516 INFO L290 TraceCheckUtils]: 25: Hoare triple {712#false} havoc main_~x~0#1;main_~x~0#1 := 0; {712#false} is VALID [2022-02-20 14:04:28,517 INFO L290 TraceCheckUtils]: 26: Hoare triple {712#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 42 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {712#false} is VALID [2022-02-20 14:04:28,517 INFO L290 TraceCheckUtils]: 27: Hoare triple {712#false} assume 0 == __VERIFIER_assert_~cond#1; {712#false} is VALID [2022-02-20 14:04:28,517 INFO L290 TraceCheckUtils]: 28: Hoare triple {712#false} assume !false; {712#false} is VALID [2022-02-20 14:04:28,517 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:04:28,517 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:04:28,517 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722106382] [2022-02-20 14:04:28,517 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722106382] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:04:28,517 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182918190] [2022-02-20 14:04:28,518 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-20 14:04:28,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:04:28,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:04:28,536 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:04:28,537 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:04:28,594 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-20 14:04:28,594 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:04:28,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 24 conjunts are in the unsatisfiable core [2022-02-20 14:04:28,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:04:28,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:04:28,815 INFO L290 TraceCheckUtils]: 0: Hoare triple {711#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {711#true} is VALID [2022-02-20 14:04:28,816 INFO L290 TraceCheckUtils]: 1: Hoare triple {711#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem2#1, main_#t~post1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {742#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:04:28,816 INFO L290 TraceCheckUtils]: 2: Hoare triple {742#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {714#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:04:28,817 INFO L290 TraceCheckUtils]: 3: Hoare triple {714#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {715#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:04:28,817 INFO L290 TraceCheckUtils]: 4: Hoare triple {715#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {716#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:04:28,818 INFO L290 TraceCheckUtils]: 5: Hoare triple {716#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {717#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:04:28,818 INFO L290 TraceCheckUtils]: 6: Hoare triple {717#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {718#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:04:28,819 INFO L290 TraceCheckUtils]: 7: Hoare triple {718#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {719#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:04:28,819 INFO L290 TraceCheckUtils]: 8: Hoare triple {719#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {720#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:04:28,819 INFO L290 TraceCheckUtils]: 9: Hoare triple {720#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {721#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:04:28,820 INFO L290 TraceCheckUtils]: 10: Hoare triple {721#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {722#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:04:28,820 INFO L290 TraceCheckUtils]: 11: Hoare triple {722#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {723#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:04:28,821 INFO L290 TraceCheckUtils]: 12: Hoare triple {723#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {724#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-20 14:04:28,821 INFO L290 TraceCheckUtils]: 13: Hoare triple {724#(<= |ULTIMATE.start_main_~i~0#1| 11)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {725#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 14:04:28,822 INFO L290 TraceCheckUtils]: 14: Hoare triple {725#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {726#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-20 14:04:28,822 INFO L290 TraceCheckUtils]: 15: Hoare triple {726#(<= |ULTIMATE.start_main_~i~0#1| 13)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {727#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 14:04:28,823 INFO L290 TraceCheckUtils]: 16: Hoare triple {727#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {728#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-20 14:04:28,823 INFO L290 TraceCheckUtils]: 17: Hoare triple {728#(<= |ULTIMATE.start_main_~i~0#1| 15)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {729#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 14:04:28,824 INFO L290 TraceCheckUtils]: 18: Hoare triple {729#(<= |ULTIMATE.start_main_~i~0#1| 16)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {730#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-20 14:04:28,824 INFO L290 TraceCheckUtils]: 19: Hoare triple {730#(<= |ULTIMATE.start_main_~i~0#1| 17)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {731#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 14:04:28,824 INFO L290 TraceCheckUtils]: 20: Hoare triple {731#(<= |ULTIMATE.start_main_~i~0#1| 18)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {732#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-20 14:04:28,825 INFO L290 TraceCheckUtils]: 21: Hoare triple {732#(<= |ULTIMATE.start_main_~i~0#1| 19)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {733#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 14:04:28,825 INFO L290 TraceCheckUtils]: 22: Hoare triple {733#(<= |ULTIMATE.start_main_~i~0#1| 20)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {734#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-20 14:04:28,826 INFO L290 TraceCheckUtils]: 23: Hoare triple {734#(<= |ULTIMATE.start_main_~i~0#1| 21)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {735#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-20 14:04:28,826 INFO L290 TraceCheckUtils]: 24: Hoare triple {735#(<= |ULTIMATE.start_main_~i~0#1| 22)} assume !(main_~i~0#1 < 100000); {712#false} is VALID [2022-02-20 14:04:28,826 INFO L290 TraceCheckUtils]: 25: Hoare triple {712#false} havoc main_~x~0#1;main_~x~0#1 := 0; {712#false} is VALID [2022-02-20 14:04:28,826 INFO L290 TraceCheckUtils]: 26: Hoare triple {712#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 42 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {712#false} is VALID [2022-02-20 14:04:28,826 INFO L290 TraceCheckUtils]: 27: Hoare triple {712#false} assume 0 == __VERIFIER_assert_~cond#1; {712#false} is VALID [2022-02-20 14:04:28,826 INFO L290 TraceCheckUtils]: 28: Hoare triple {712#false} assume !false; {712#false} is VALID [2022-02-20 14:04:28,827 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:04:28,827 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:04:29,686 INFO L290 TraceCheckUtils]: 28: Hoare triple {712#false} assume !false; {712#false} is VALID [2022-02-20 14:04:29,687 INFO L290 TraceCheckUtils]: 27: Hoare triple {712#false} assume 0 == __VERIFIER_assert_~cond#1; {712#false} is VALID [2022-02-20 14:04:29,687 INFO L290 TraceCheckUtils]: 26: Hoare triple {712#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 42 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {712#false} is VALID [2022-02-20 14:04:29,687 INFO L290 TraceCheckUtils]: 25: Hoare triple {712#false} havoc main_~x~0#1;main_~x~0#1 := 0; {712#false} is VALID [2022-02-20 14:04:29,688 INFO L290 TraceCheckUtils]: 24: Hoare triple {836#(< |ULTIMATE.start_main_~i~0#1| 100000)} assume !(main_~i~0#1 < 100000); {712#false} is VALID [2022-02-20 14:04:29,688 INFO L290 TraceCheckUtils]: 23: Hoare triple {840#(< |ULTIMATE.start_main_~i~0#1| 99999)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {836#(< |ULTIMATE.start_main_~i~0#1| 100000)} is VALID [2022-02-20 14:04:29,689 INFO L290 TraceCheckUtils]: 22: Hoare triple {844#(< |ULTIMATE.start_main_~i~0#1| 99998)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {840#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:04:29,689 INFO L290 TraceCheckUtils]: 21: Hoare triple {848#(< |ULTIMATE.start_main_~i~0#1| 99997)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {844#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:04:29,690 INFO L290 TraceCheckUtils]: 20: Hoare triple {852#(< |ULTIMATE.start_main_~i~0#1| 99996)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {848#(< |ULTIMATE.start_main_~i~0#1| 99997)} is VALID [2022-02-20 14:04:29,691 INFO L290 TraceCheckUtils]: 19: Hoare triple {856#(< |ULTIMATE.start_main_~i~0#1| 99995)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {852#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-20 14:04:29,691 INFO L290 TraceCheckUtils]: 18: Hoare triple {860#(< |ULTIMATE.start_main_~i~0#1| 99994)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {856#(< |ULTIMATE.start_main_~i~0#1| 99995)} is VALID [2022-02-20 14:04:29,692 INFO L290 TraceCheckUtils]: 17: Hoare triple {864#(< |ULTIMATE.start_main_~i~0#1| 99993)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {860#(< |ULTIMATE.start_main_~i~0#1| 99994)} is VALID [2022-02-20 14:04:29,692 INFO L290 TraceCheckUtils]: 16: Hoare triple {868#(< |ULTIMATE.start_main_~i~0#1| 99992)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {864#(< |ULTIMATE.start_main_~i~0#1| 99993)} is VALID [2022-02-20 14:04:29,693 INFO L290 TraceCheckUtils]: 15: Hoare triple {872#(< |ULTIMATE.start_main_~i~0#1| 99991)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {868#(< |ULTIMATE.start_main_~i~0#1| 99992)} is VALID [2022-02-20 14:04:29,693 INFO L290 TraceCheckUtils]: 14: Hoare triple {876#(< |ULTIMATE.start_main_~i~0#1| 99990)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {872#(< |ULTIMATE.start_main_~i~0#1| 99991)} is VALID [2022-02-20 14:04:29,694 INFO L290 TraceCheckUtils]: 13: Hoare triple {880#(< |ULTIMATE.start_main_~i~0#1| 99989)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {876#(< |ULTIMATE.start_main_~i~0#1| 99990)} is VALID [2022-02-20 14:04:29,694 INFO L290 TraceCheckUtils]: 12: Hoare triple {884#(< |ULTIMATE.start_main_~i~0#1| 99988)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {880#(< |ULTIMATE.start_main_~i~0#1| 99989)} is VALID [2022-02-20 14:04:29,695 INFO L290 TraceCheckUtils]: 11: Hoare triple {888#(< |ULTIMATE.start_main_~i~0#1| 99987)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {884#(< |ULTIMATE.start_main_~i~0#1| 99988)} is VALID [2022-02-20 14:04:29,695 INFO L290 TraceCheckUtils]: 10: Hoare triple {892#(< |ULTIMATE.start_main_~i~0#1| 99986)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {888#(< |ULTIMATE.start_main_~i~0#1| 99987)} is VALID [2022-02-20 14:04:29,696 INFO L290 TraceCheckUtils]: 9: Hoare triple {896#(< |ULTIMATE.start_main_~i~0#1| 99985)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {892#(< |ULTIMATE.start_main_~i~0#1| 99986)} is VALID [2022-02-20 14:04:29,697 INFO L290 TraceCheckUtils]: 8: Hoare triple {900#(< |ULTIMATE.start_main_~i~0#1| 99984)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {896#(< |ULTIMATE.start_main_~i~0#1| 99985)} is VALID [2022-02-20 14:04:29,697 INFO L290 TraceCheckUtils]: 7: Hoare triple {904#(< |ULTIMATE.start_main_~i~0#1| 99983)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {900#(< |ULTIMATE.start_main_~i~0#1| 99984)} is VALID [2022-02-20 14:04:29,698 INFO L290 TraceCheckUtils]: 6: Hoare triple {908#(< |ULTIMATE.start_main_~i~0#1| 99982)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {904#(< |ULTIMATE.start_main_~i~0#1| 99983)} is VALID [2022-02-20 14:04:29,699 INFO L290 TraceCheckUtils]: 5: Hoare triple {912#(< |ULTIMATE.start_main_~i~0#1| 99981)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {908#(< |ULTIMATE.start_main_~i~0#1| 99982)} is VALID [2022-02-20 14:04:29,699 INFO L290 TraceCheckUtils]: 4: Hoare triple {916#(< |ULTIMATE.start_main_~i~0#1| 99980)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {912#(< |ULTIMATE.start_main_~i~0#1| 99981)} is VALID [2022-02-20 14:04:29,700 INFO L290 TraceCheckUtils]: 3: Hoare triple {920#(< |ULTIMATE.start_main_~i~0#1| 99979)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {916#(< |ULTIMATE.start_main_~i~0#1| 99980)} is VALID [2022-02-20 14:04:29,700 INFO L290 TraceCheckUtils]: 2: Hoare triple {924#(< |ULTIMATE.start_main_~i~0#1| 99978)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {920#(< |ULTIMATE.start_main_~i~0#1| 99979)} is VALID [2022-02-20 14:04:29,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {711#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem2#1, main_#t~post1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {924#(< |ULTIMATE.start_main_~i~0#1| 99978)} is VALID [2022-02-20 14:04:29,701 INFO L290 TraceCheckUtils]: 0: Hoare triple {711#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {711#true} is VALID [2022-02-20 14:04:29,701 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:04:29,701 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [182918190] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:04:29,701 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:04:29,701 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2022-02-20 14:04:29,701 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357015469] [2022-02-20 14:04:29,701 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:04:29,702 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 49 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-02-20 14:04:29,702 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:04:29,702 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 49 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 49 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:29,735 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:04:29,735 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-02-20 14:04:29,735 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:04:29,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-02-20 14:04:29,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2022-02-20 14:04:29,737 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 49 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 49 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:29,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:04:29,905 INFO L93 Difference]: Finished difference Result 63 states and 88 transitions. [2022-02-20 14:04:29,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-02-20 14:04:29,906 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 49 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-02-20 14:04:29,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:04:29,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 49 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:29,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 88 transitions. [2022-02-20 14:04:29,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 49 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:29,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 88 transitions. [2022-02-20 14:04:29,909 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 88 transitions. [2022-02-20 14:04:29,959 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:04:29,960 INFO L225 Difference]: With dead ends: 63 [2022-02-20 14:04:29,960 INFO L226 Difference]: Without dead ends: 56 [2022-02-20 14:04:29,961 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2022-02-20 14:04:29,961 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:04:29,962 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:04:29,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-02-20 14:04:29,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-02-20 14:04:29,994 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:04:29,994 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 56 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 55 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:29,994 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 56 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 55 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:29,994 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 56 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 55 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:29,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:04:29,996 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2022-02-20 14:04:29,996 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2022-02-20 14:04:29,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:04:29,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:04:29,997 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 55 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 56 states. [2022-02-20 14:04:29,997 INFO L87 Difference]: Start difference. First operand has 56 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 55 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 56 states. [2022-02-20 14:04:29,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:04:29,998 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2022-02-20 14:04:29,998 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2022-02-20 14:04:29,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:04:29,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:04:29,999 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:04:29,999 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:04:29,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 55 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:30,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2022-02-20 14:04:30,000 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 29 [2022-02-20 14:04:30,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:04:30,001 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2022-02-20 14:04:30,001 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 49 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:30,001 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2022-02-20 14:04:30,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-20 14:04:30,002 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:04:30,002 INFO L514 BasicCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:04:30,035 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:04:30,217 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:04:30,218 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:04:30,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:04:30,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1684000368, now seen corresponding path program 5 times [2022-02-20 14:04:30,219 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:04:30,219 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259019635] [2022-02-20 14:04:30,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:04:30,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:04:30,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:04:31,255 INFO L290 TraceCheckUtils]: 0: Hoare triple {1258#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {1258#true} is VALID [2022-02-20 14:04:31,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {1258#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem2#1, main_#t~post1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {1260#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:04:31,260 INFO L290 TraceCheckUtils]: 2: Hoare triple {1260#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1261#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:04:31,260 INFO L290 TraceCheckUtils]: 3: Hoare triple {1261#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1262#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:04:31,261 INFO L290 TraceCheckUtils]: 4: Hoare triple {1262#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1263#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:04:31,261 INFO L290 TraceCheckUtils]: 5: Hoare triple {1263#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1264#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:04:31,262 INFO L290 TraceCheckUtils]: 6: Hoare triple {1264#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1265#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:04:31,263 INFO L290 TraceCheckUtils]: 7: Hoare triple {1265#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1266#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:04:31,263 INFO L290 TraceCheckUtils]: 8: Hoare triple {1266#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1267#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:04:31,263 INFO L290 TraceCheckUtils]: 9: Hoare triple {1267#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1268#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:04:31,280 INFO L290 TraceCheckUtils]: 10: Hoare triple {1268#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1269#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:04:31,280 INFO L290 TraceCheckUtils]: 11: Hoare triple {1269#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1270#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:04:31,281 INFO L290 TraceCheckUtils]: 12: Hoare triple {1270#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1271#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-20 14:04:31,281 INFO L290 TraceCheckUtils]: 13: Hoare triple {1271#(<= |ULTIMATE.start_main_~i~0#1| 11)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1272#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 14:04:31,282 INFO L290 TraceCheckUtils]: 14: Hoare triple {1272#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1273#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-20 14:04:31,282 INFO L290 TraceCheckUtils]: 15: Hoare triple {1273#(<= |ULTIMATE.start_main_~i~0#1| 13)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1274#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 14:04:31,283 INFO L290 TraceCheckUtils]: 16: Hoare triple {1274#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1275#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-20 14:04:31,283 INFO L290 TraceCheckUtils]: 17: Hoare triple {1275#(<= |ULTIMATE.start_main_~i~0#1| 15)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1276#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 14:04:31,284 INFO L290 TraceCheckUtils]: 18: Hoare triple {1276#(<= |ULTIMATE.start_main_~i~0#1| 16)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1277#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-20 14:04:31,284 INFO L290 TraceCheckUtils]: 19: Hoare triple {1277#(<= |ULTIMATE.start_main_~i~0#1| 17)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1278#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 14:04:31,284 INFO L290 TraceCheckUtils]: 20: Hoare triple {1278#(<= |ULTIMATE.start_main_~i~0#1| 18)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1279#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-20 14:04:31,285 INFO L290 TraceCheckUtils]: 21: Hoare triple {1279#(<= |ULTIMATE.start_main_~i~0#1| 19)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1280#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 14:04:31,285 INFO L290 TraceCheckUtils]: 22: Hoare triple {1280#(<= |ULTIMATE.start_main_~i~0#1| 20)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1281#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-20 14:04:31,286 INFO L290 TraceCheckUtils]: 23: Hoare triple {1281#(<= |ULTIMATE.start_main_~i~0#1| 21)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1282#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-20 14:04:31,286 INFO L290 TraceCheckUtils]: 24: Hoare triple {1282#(<= |ULTIMATE.start_main_~i~0#1| 22)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1283#(<= |ULTIMATE.start_main_~i~0#1| 23)} is VALID [2022-02-20 14:04:31,287 INFO L290 TraceCheckUtils]: 25: Hoare triple {1283#(<= |ULTIMATE.start_main_~i~0#1| 23)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1284#(<= |ULTIMATE.start_main_~i~0#1| 24)} is VALID [2022-02-20 14:04:31,288 INFO L290 TraceCheckUtils]: 26: Hoare triple {1284#(<= |ULTIMATE.start_main_~i~0#1| 24)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1285#(<= |ULTIMATE.start_main_~i~0#1| 25)} is VALID [2022-02-20 14:04:31,288 INFO L290 TraceCheckUtils]: 27: Hoare triple {1285#(<= |ULTIMATE.start_main_~i~0#1| 25)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1286#(<= |ULTIMATE.start_main_~i~0#1| 26)} is VALID [2022-02-20 14:04:31,289 INFO L290 TraceCheckUtils]: 28: Hoare triple {1286#(<= |ULTIMATE.start_main_~i~0#1| 26)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1287#(<= |ULTIMATE.start_main_~i~0#1| 27)} is VALID [2022-02-20 14:04:31,289 INFO L290 TraceCheckUtils]: 29: Hoare triple {1287#(<= |ULTIMATE.start_main_~i~0#1| 27)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1288#(<= |ULTIMATE.start_main_~i~0#1| 28)} is VALID [2022-02-20 14:04:31,290 INFO L290 TraceCheckUtils]: 30: Hoare triple {1288#(<= |ULTIMATE.start_main_~i~0#1| 28)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1289#(<= |ULTIMATE.start_main_~i~0#1| 29)} is VALID [2022-02-20 14:04:31,290 INFO L290 TraceCheckUtils]: 31: Hoare triple {1289#(<= |ULTIMATE.start_main_~i~0#1| 29)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1290#(<= |ULTIMATE.start_main_~i~0#1| 30)} is VALID [2022-02-20 14:04:31,290 INFO L290 TraceCheckUtils]: 32: Hoare triple {1290#(<= |ULTIMATE.start_main_~i~0#1| 30)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1291#(<= |ULTIMATE.start_main_~i~0#1| 31)} is VALID [2022-02-20 14:04:31,291 INFO L290 TraceCheckUtils]: 33: Hoare triple {1291#(<= |ULTIMATE.start_main_~i~0#1| 31)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1292#(<= |ULTIMATE.start_main_~i~0#1| 32)} is VALID [2022-02-20 14:04:31,291 INFO L290 TraceCheckUtils]: 34: Hoare triple {1292#(<= |ULTIMATE.start_main_~i~0#1| 32)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1293#(<= |ULTIMATE.start_main_~i~0#1| 33)} is VALID [2022-02-20 14:04:31,292 INFO L290 TraceCheckUtils]: 35: Hoare triple {1293#(<= |ULTIMATE.start_main_~i~0#1| 33)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1294#(<= |ULTIMATE.start_main_~i~0#1| 34)} is VALID [2022-02-20 14:04:31,292 INFO L290 TraceCheckUtils]: 36: Hoare triple {1294#(<= |ULTIMATE.start_main_~i~0#1| 34)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1295#(<= |ULTIMATE.start_main_~i~0#1| 35)} is VALID [2022-02-20 14:04:31,298 INFO L290 TraceCheckUtils]: 37: Hoare triple {1295#(<= |ULTIMATE.start_main_~i~0#1| 35)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1296#(<= |ULTIMATE.start_main_~i~0#1| 36)} is VALID [2022-02-20 14:04:31,299 INFO L290 TraceCheckUtils]: 38: Hoare triple {1296#(<= |ULTIMATE.start_main_~i~0#1| 36)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1297#(<= |ULTIMATE.start_main_~i~0#1| 37)} is VALID [2022-02-20 14:04:31,300 INFO L290 TraceCheckUtils]: 39: Hoare triple {1297#(<= |ULTIMATE.start_main_~i~0#1| 37)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1298#(<= |ULTIMATE.start_main_~i~0#1| 38)} is VALID [2022-02-20 14:04:31,301 INFO L290 TraceCheckUtils]: 40: Hoare triple {1298#(<= |ULTIMATE.start_main_~i~0#1| 38)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1299#(<= |ULTIMATE.start_main_~i~0#1| 39)} is VALID [2022-02-20 14:04:31,305 INFO L290 TraceCheckUtils]: 41: Hoare triple {1299#(<= |ULTIMATE.start_main_~i~0#1| 39)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1300#(<= |ULTIMATE.start_main_~i~0#1| 40)} is VALID [2022-02-20 14:04:31,306 INFO L290 TraceCheckUtils]: 42: Hoare triple {1300#(<= |ULTIMATE.start_main_~i~0#1| 40)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1301#(<= |ULTIMATE.start_main_~i~0#1| 41)} is VALID [2022-02-20 14:04:31,308 INFO L290 TraceCheckUtils]: 43: Hoare triple {1301#(<= |ULTIMATE.start_main_~i~0#1| 41)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1302#(<= |ULTIMATE.start_main_~i~0#1| 42)} is VALID [2022-02-20 14:04:31,308 INFO L290 TraceCheckUtils]: 44: Hoare triple {1302#(<= |ULTIMATE.start_main_~i~0#1| 42)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1303#(<= |ULTIMATE.start_main_~i~0#1| 43)} is VALID [2022-02-20 14:04:31,309 INFO L290 TraceCheckUtils]: 45: Hoare triple {1303#(<= |ULTIMATE.start_main_~i~0#1| 43)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1304#(<= |ULTIMATE.start_main_~i~0#1| 44)} is VALID [2022-02-20 14:04:31,310 INFO L290 TraceCheckUtils]: 46: Hoare triple {1304#(<= |ULTIMATE.start_main_~i~0#1| 44)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1305#(<= |ULTIMATE.start_main_~i~0#1| 45)} is VALID [2022-02-20 14:04:31,311 INFO L290 TraceCheckUtils]: 47: Hoare triple {1305#(<= |ULTIMATE.start_main_~i~0#1| 45)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1306#(<= |ULTIMATE.start_main_~i~0#1| 46)} is VALID [2022-02-20 14:04:31,312 INFO L290 TraceCheckUtils]: 48: Hoare triple {1306#(<= |ULTIMATE.start_main_~i~0#1| 46)} assume !(main_~i~0#1 < 100000); {1259#false} is VALID [2022-02-20 14:04:31,312 INFO L290 TraceCheckUtils]: 49: Hoare triple {1259#false} havoc main_~x~0#1;main_~x~0#1 := 0; {1259#false} is VALID [2022-02-20 14:04:31,312 INFO L290 TraceCheckUtils]: 50: Hoare triple {1259#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 42 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1259#false} is VALID [2022-02-20 14:04:31,312 INFO L290 TraceCheckUtils]: 51: Hoare triple {1259#false} assume 0 == __VERIFIER_assert_~cond#1; {1259#false} is VALID [2022-02-20 14:04:31,327 INFO L290 TraceCheckUtils]: 52: Hoare triple {1259#false} assume !false; {1259#false} is VALID [2022-02-20 14:04:31,328 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:04:31,329 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:04:31,329 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259019635] [2022-02-20 14:04:31,330 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259019635] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:04:31,330 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1261747720] [2022-02-20 14:04:31,330 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-20 14:04:31,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:04:31,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:04:31,331 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:04:31,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-20 14:05:07,909 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2022-02-20 14:05:07,909 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:05:07,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 48 conjunts are in the unsatisfiable core [2022-02-20 14:05:07,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:05:08,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:05:08,399 INFO L290 TraceCheckUtils]: 0: Hoare triple {1258#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {1258#true} is VALID [2022-02-20 14:05:08,400 INFO L290 TraceCheckUtils]: 1: Hoare triple {1258#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem2#1, main_#t~post1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {1313#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:05:08,400 INFO L290 TraceCheckUtils]: 2: Hoare triple {1313#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1261#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:05:08,401 INFO L290 TraceCheckUtils]: 3: Hoare triple {1261#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1262#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:05:08,406 INFO L290 TraceCheckUtils]: 4: Hoare triple {1262#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1263#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:05:08,406 INFO L290 TraceCheckUtils]: 5: Hoare triple {1263#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1264#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:05:08,407 INFO L290 TraceCheckUtils]: 6: Hoare triple {1264#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1265#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:05:08,407 INFO L290 TraceCheckUtils]: 7: Hoare triple {1265#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1266#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:05:08,408 INFO L290 TraceCheckUtils]: 8: Hoare triple {1266#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1267#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:05:08,408 INFO L290 TraceCheckUtils]: 9: Hoare triple {1267#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1268#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:05:08,409 INFO L290 TraceCheckUtils]: 10: Hoare triple {1268#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1269#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:05:08,409 INFO L290 TraceCheckUtils]: 11: Hoare triple {1269#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1270#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:05:08,409 INFO L290 TraceCheckUtils]: 12: Hoare triple {1270#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1271#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-20 14:05:08,410 INFO L290 TraceCheckUtils]: 13: Hoare triple {1271#(<= |ULTIMATE.start_main_~i~0#1| 11)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1272#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 14:05:08,410 INFO L290 TraceCheckUtils]: 14: Hoare triple {1272#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1273#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-20 14:05:08,411 INFO L290 TraceCheckUtils]: 15: Hoare triple {1273#(<= |ULTIMATE.start_main_~i~0#1| 13)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1274#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 14:05:08,411 INFO L290 TraceCheckUtils]: 16: Hoare triple {1274#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1275#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-20 14:05:08,420 INFO L290 TraceCheckUtils]: 17: Hoare triple {1275#(<= |ULTIMATE.start_main_~i~0#1| 15)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1276#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 14:05:08,421 INFO L290 TraceCheckUtils]: 18: Hoare triple {1276#(<= |ULTIMATE.start_main_~i~0#1| 16)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1277#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-20 14:05:08,421 INFO L290 TraceCheckUtils]: 19: Hoare triple {1277#(<= |ULTIMATE.start_main_~i~0#1| 17)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1278#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 14:05:08,422 INFO L290 TraceCheckUtils]: 20: Hoare triple {1278#(<= |ULTIMATE.start_main_~i~0#1| 18)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1279#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-20 14:05:08,422 INFO L290 TraceCheckUtils]: 21: Hoare triple {1279#(<= |ULTIMATE.start_main_~i~0#1| 19)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1280#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 14:05:08,423 INFO L290 TraceCheckUtils]: 22: Hoare triple {1280#(<= |ULTIMATE.start_main_~i~0#1| 20)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1281#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-20 14:05:08,424 INFO L290 TraceCheckUtils]: 23: Hoare triple {1281#(<= |ULTIMATE.start_main_~i~0#1| 21)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1282#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-20 14:05:08,424 INFO L290 TraceCheckUtils]: 24: Hoare triple {1282#(<= |ULTIMATE.start_main_~i~0#1| 22)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1283#(<= |ULTIMATE.start_main_~i~0#1| 23)} is VALID [2022-02-20 14:05:08,425 INFO L290 TraceCheckUtils]: 25: Hoare triple {1283#(<= |ULTIMATE.start_main_~i~0#1| 23)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1284#(<= |ULTIMATE.start_main_~i~0#1| 24)} is VALID [2022-02-20 14:05:08,425 INFO L290 TraceCheckUtils]: 26: Hoare triple {1284#(<= |ULTIMATE.start_main_~i~0#1| 24)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1285#(<= |ULTIMATE.start_main_~i~0#1| 25)} is VALID [2022-02-20 14:05:08,426 INFO L290 TraceCheckUtils]: 27: Hoare triple {1285#(<= |ULTIMATE.start_main_~i~0#1| 25)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1286#(<= |ULTIMATE.start_main_~i~0#1| 26)} is VALID [2022-02-20 14:05:08,426 INFO L290 TraceCheckUtils]: 28: Hoare triple {1286#(<= |ULTIMATE.start_main_~i~0#1| 26)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1287#(<= |ULTIMATE.start_main_~i~0#1| 27)} is VALID [2022-02-20 14:05:08,427 INFO L290 TraceCheckUtils]: 29: Hoare triple {1287#(<= |ULTIMATE.start_main_~i~0#1| 27)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1288#(<= |ULTIMATE.start_main_~i~0#1| 28)} is VALID [2022-02-20 14:05:08,428 INFO L290 TraceCheckUtils]: 30: Hoare triple {1288#(<= |ULTIMATE.start_main_~i~0#1| 28)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1289#(<= |ULTIMATE.start_main_~i~0#1| 29)} is VALID [2022-02-20 14:05:08,429 INFO L290 TraceCheckUtils]: 31: Hoare triple {1289#(<= |ULTIMATE.start_main_~i~0#1| 29)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1290#(<= |ULTIMATE.start_main_~i~0#1| 30)} is VALID [2022-02-20 14:05:08,430 INFO L290 TraceCheckUtils]: 32: Hoare triple {1290#(<= |ULTIMATE.start_main_~i~0#1| 30)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1291#(<= |ULTIMATE.start_main_~i~0#1| 31)} is VALID [2022-02-20 14:05:08,430 INFO L290 TraceCheckUtils]: 33: Hoare triple {1291#(<= |ULTIMATE.start_main_~i~0#1| 31)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1292#(<= |ULTIMATE.start_main_~i~0#1| 32)} is VALID [2022-02-20 14:05:08,432 INFO L290 TraceCheckUtils]: 34: Hoare triple {1292#(<= |ULTIMATE.start_main_~i~0#1| 32)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1293#(<= |ULTIMATE.start_main_~i~0#1| 33)} is VALID [2022-02-20 14:05:08,432 INFO L290 TraceCheckUtils]: 35: Hoare triple {1293#(<= |ULTIMATE.start_main_~i~0#1| 33)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1294#(<= |ULTIMATE.start_main_~i~0#1| 34)} is VALID [2022-02-20 14:05:08,432 INFO L290 TraceCheckUtils]: 36: Hoare triple {1294#(<= |ULTIMATE.start_main_~i~0#1| 34)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1295#(<= |ULTIMATE.start_main_~i~0#1| 35)} is VALID [2022-02-20 14:05:08,433 INFO L290 TraceCheckUtils]: 37: Hoare triple {1295#(<= |ULTIMATE.start_main_~i~0#1| 35)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1296#(<= |ULTIMATE.start_main_~i~0#1| 36)} is VALID [2022-02-20 14:05:08,433 INFO L290 TraceCheckUtils]: 38: Hoare triple {1296#(<= |ULTIMATE.start_main_~i~0#1| 36)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1297#(<= |ULTIMATE.start_main_~i~0#1| 37)} is VALID [2022-02-20 14:05:08,434 INFO L290 TraceCheckUtils]: 39: Hoare triple {1297#(<= |ULTIMATE.start_main_~i~0#1| 37)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1298#(<= |ULTIMATE.start_main_~i~0#1| 38)} is VALID [2022-02-20 14:05:08,434 INFO L290 TraceCheckUtils]: 40: Hoare triple {1298#(<= |ULTIMATE.start_main_~i~0#1| 38)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1299#(<= |ULTIMATE.start_main_~i~0#1| 39)} is VALID [2022-02-20 14:05:08,435 INFO L290 TraceCheckUtils]: 41: Hoare triple {1299#(<= |ULTIMATE.start_main_~i~0#1| 39)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1300#(<= |ULTIMATE.start_main_~i~0#1| 40)} is VALID [2022-02-20 14:05:08,436 INFO L290 TraceCheckUtils]: 42: Hoare triple {1300#(<= |ULTIMATE.start_main_~i~0#1| 40)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1301#(<= |ULTIMATE.start_main_~i~0#1| 41)} is VALID [2022-02-20 14:05:08,436 INFO L290 TraceCheckUtils]: 43: Hoare triple {1301#(<= |ULTIMATE.start_main_~i~0#1| 41)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1302#(<= |ULTIMATE.start_main_~i~0#1| 42)} is VALID [2022-02-20 14:05:08,437 INFO L290 TraceCheckUtils]: 44: Hoare triple {1302#(<= |ULTIMATE.start_main_~i~0#1| 42)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1303#(<= |ULTIMATE.start_main_~i~0#1| 43)} is VALID [2022-02-20 14:05:08,437 INFO L290 TraceCheckUtils]: 45: Hoare triple {1303#(<= |ULTIMATE.start_main_~i~0#1| 43)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1304#(<= |ULTIMATE.start_main_~i~0#1| 44)} is VALID [2022-02-20 14:05:08,438 INFO L290 TraceCheckUtils]: 46: Hoare triple {1304#(<= |ULTIMATE.start_main_~i~0#1| 44)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1305#(<= |ULTIMATE.start_main_~i~0#1| 45)} is VALID [2022-02-20 14:05:08,438 INFO L290 TraceCheckUtils]: 47: Hoare triple {1305#(<= |ULTIMATE.start_main_~i~0#1| 45)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1306#(<= |ULTIMATE.start_main_~i~0#1| 46)} is VALID [2022-02-20 14:05:08,438 INFO L290 TraceCheckUtils]: 48: Hoare triple {1306#(<= |ULTIMATE.start_main_~i~0#1| 46)} assume !(main_~i~0#1 < 100000); {1259#false} is VALID [2022-02-20 14:05:08,438 INFO L290 TraceCheckUtils]: 49: Hoare triple {1259#false} havoc main_~x~0#1;main_~x~0#1 := 0; {1259#false} is VALID [2022-02-20 14:05:08,439 INFO L290 TraceCheckUtils]: 50: Hoare triple {1259#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 42 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1259#false} is VALID [2022-02-20 14:05:08,439 INFO L290 TraceCheckUtils]: 51: Hoare triple {1259#false} assume 0 == __VERIFIER_assert_~cond#1; {1259#false} is VALID [2022-02-20 14:05:08,439 INFO L290 TraceCheckUtils]: 52: Hoare triple {1259#false} assume !false; {1259#false} is VALID [2022-02-20 14:05:08,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:05:08,441 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:05:10,360 INFO L290 TraceCheckUtils]: 52: Hoare triple {1259#false} assume !false; {1259#false} is VALID [2022-02-20 14:05:10,360 INFO L290 TraceCheckUtils]: 51: Hoare triple {1259#false} assume 0 == __VERIFIER_assert_~cond#1; {1259#false} is VALID [2022-02-20 14:05:10,360 INFO L290 TraceCheckUtils]: 50: Hoare triple {1259#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 42 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1259#false} is VALID [2022-02-20 14:05:10,360 INFO L290 TraceCheckUtils]: 49: Hoare triple {1259#false} havoc main_~x~0#1;main_~x~0#1 := 0; {1259#false} is VALID [2022-02-20 14:05:10,361 INFO L290 TraceCheckUtils]: 48: Hoare triple {1479#(< |ULTIMATE.start_main_~i~0#1| 100000)} assume !(main_~i~0#1 < 100000); {1259#false} is VALID [2022-02-20 14:05:10,362 INFO L290 TraceCheckUtils]: 47: Hoare triple {1483#(< |ULTIMATE.start_main_~i~0#1| 99999)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1479#(< |ULTIMATE.start_main_~i~0#1| 100000)} is VALID [2022-02-20 14:05:10,363 INFO L290 TraceCheckUtils]: 46: Hoare triple {1487#(< |ULTIMATE.start_main_~i~0#1| 99998)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1483#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:05:10,363 INFO L290 TraceCheckUtils]: 45: Hoare triple {1491#(< |ULTIMATE.start_main_~i~0#1| 99997)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1487#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:05:10,364 INFO L290 TraceCheckUtils]: 44: Hoare triple {1495#(< |ULTIMATE.start_main_~i~0#1| 99996)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1491#(< |ULTIMATE.start_main_~i~0#1| 99997)} is VALID [2022-02-20 14:05:10,364 INFO L290 TraceCheckUtils]: 43: Hoare triple {1499#(< |ULTIMATE.start_main_~i~0#1| 99995)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1495#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-20 14:05:10,365 INFO L290 TraceCheckUtils]: 42: Hoare triple {1503#(< |ULTIMATE.start_main_~i~0#1| 99994)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1499#(< |ULTIMATE.start_main_~i~0#1| 99995)} is VALID [2022-02-20 14:05:10,365 INFO L290 TraceCheckUtils]: 41: Hoare triple {1507#(< |ULTIMATE.start_main_~i~0#1| 99993)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1503#(< |ULTIMATE.start_main_~i~0#1| 99994)} is VALID [2022-02-20 14:05:10,366 INFO L290 TraceCheckUtils]: 40: Hoare triple {1511#(< |ULTIMATE.start_main_~i~0#1| 99992)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1507#(< |ULTIMATE.start_main_~i~0#1| 99993)} is VALID [2022-02-20 14:05:10,366 INFO L290 TraceCheckUtils]: 39: Hoare triple {1515#(< |ULTIMATE.start_main_~i~0#1| 99991)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1511#(< |ULTIMATE.start_main_~i~0#1| 99992)} is VALID [2022-02-20 14:05:10,367 INFO L290 TraceCheckUtils]: 38: Hoare triple {1519#(< |ULTIMATE.start_main_~i~0#1| 99990)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1515#(< |ULTIMATE.start_main_~i~0#1| 99991)} is VALID [2022-02-20 14:05:10,367 INFO L290 TraceCheckUtils]: 37: Hoare triple {1523#(< |ULTIMATE.start_main_~i~0#1| 99989)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1519#(< |ULTIMATE.start_main_~i~0#1| 99990)} is VALID [2022-02-20 14:05:10,368 INFO L290 TraceCheckUtils]: 36: Hoare triple {1527#(< |ULTIMATE.start_main_~i~0#1| 99988)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1523#(< |ULTIMATE.start_main_~i~0#1| 99989)} is VALID [2022-02-20 14:05:10,368 INFO L290 TraceCheckUtils]: 35: Hoare triple {1531#(< |ULTIMATE.start_main_~i~0#1| 99987)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1527#(< |ULTIMATE.start_main_~i~0#1| 99988)} is VALID [2022-02-20 14:05:10,369 INFO L290 TraceCheckUtils]: 34: Hoare triple {1535#(< |ULTIMATE.start_main_~i~0#1| 99986)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1531#(< |ULTIMATE.start_main_~i~0#1| 99987)} is VALID [2022-02-20 14:05:10,369 INFO L290 TraceCheckUtils]: 33: Hoare triple {1539#(< |ULTIMATE.start_main_~i~0#1| 99985)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1535#(< |ULTIMATE.start_main_~i~0#1| 99986)} is VALID [2022-02-20 14:05:10,370 INFO L290 TraceCheckUtils]: 32: Hoare triple {1543#(< |ULTIMATE.start_main_~i~0#1| 99984)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1539#(< |ULTIMATE.start_main_~i~0#1| 99985)} is VALID [2022-02-20 14:05:10,370 INFO L290 TraceCheckUtils]: 31: Hoare triple {1547#(< |ULTIMATE.start_main_~i~0#1| 99983)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1543#(< |ULTIMATE.start_main_~i~0#1| 99984)} is VALID [2022-02-20 14:05:10,371 INFO L290 TraceCheckUtils]: 30: Hoare triple {1551#(< |ULTIMATE.start_main_~i~0#1| 99982)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1547#(< |ULTIMATE.start_main_~i~0#1| 99983)} is VALID [2022-02-20 14:05:10,371 INFO L290 TraceCheckUtils]: 29: Hoare triple {1555#(< |ULTIMATE.start_main_~i~0#1| 99981)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1551#(< |ULTIMATE.start_main_~i~0#1| 99982)} is VALID [2022-02-20 14:05:10,372 INFO L290 TraceCheckUtils]: 28: Hoare triple {1559#(< |ULTIMATE.start_main_~i~0#1| 99980)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1555#(< |ULTIMATE.start_main_~i~0#1| 99981)} is VALID [2022-02-20 14:05:10,372 INFO L290 TraceCheckUtils]: 27: Hoare triple {1563#(< |ULTIMATE.start_main_~i~0#1| 99979)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1559#(< |ULTIMATE.start_main_~i~0#1| 99980)} is VALID [2022-02-20 14:05:10,373 INFO L290 TraceCheckUtils]: 26: Hoare triple {1567#(< |ULTIMATE.start_main_~i~0#1| 99978)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1563#(< |ULTIMATE.start_main_~i~0#1| 99979)} is VALID [2022-02-20 14:05:10,373 INFO L290 TraceCheckUtils]: 25: Hoare triple {1571#(< |ULTIMATE.start_main_~i~0#1| 99977)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1567#(< |ULTIMATE.start_main_~i~0#1| 99978)} is VALID [2022-02-20 14:05:10,374 INFO L290 TraceCheckUtils]: 24: Hoare triple {1575#(< |ULTIMATE.start_main_~i~0#1| 99976)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1571#(< |ULTIMATE.start_main_~i~0#1| 99977)} is VALID [2022-02-20 14:05:10,374 INFO L290 TraceCheckUtils]: 23: Hoare triple {1579#(< |ULTIMATE.start_main_~i~0#1| 99975)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1575#(< |ULTIMATE.start_main_~i~0#1| 99976)} is VALID [2022-02-20 14:05:10,375 INFO L290 TraceCheckUtils]: 22: Hoare triple {1583#(< |ULTIMATE.start_main_~i~0#1| 99974)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1579#(< |ULTIMATE.start_main_~i~0#1| 99975)} is VALID [2022-02-20 14:05:10,375 INFO L290 TraceCheckUtils]: 21: Hoare triple {1587#(< |ULTIMATE.start_main_~i~0#1| 99973)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1583#(< |ULTIMATE.start_main_~i~0#1| 99974)} is VALID [2022-02-20 14:05:10,376 INFO L290 TraceCheckUtils]: 20: Hoare triple {1591#(< |ULTIMATE.start_main_~i~0#1| 99972)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1587#(< |ULTIMATE.start_main_~i~0#1| 99973)} is VALID [2022-02-20 14:05:10,376 INFO L290 TraceCheckUtils]: 19: Hoare triple {1595#(< |ULTIMATE.start_main_~i~0#1| 99971)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1591#(< |ULTIMATE.start_main_~i~0#1| 99972)} is VALID [2022-02-20 14:05:10,377 INFO L290 TraceCheckUtils]: 18: Hoare triple {1599#(< |ULTIMATE.start_main_~i~0#1| 99970)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1595#(< |ULTIMATE.start_main_~i~0#1| 99971)} is VALID [2022-02-20 14:05:10,377 INFO L290 TraceCheckUtils]: 17: Hoare triple {1603#(< |ULTIMATE.start_main_~i~0#1| 99969)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1599#(< |ULTIMATE.start_main_~i~0#1| 99970)} is VALID [2022-02-20 14:05:10,378 INFO L290 TraceCheckUtils]: 16: Hoare triple {1607#(< |ULTIMATE.start_main_~i~0#1| 99968)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1603#(< |ULTIMATE.start_main_~i~0#1| 99969)} is VALID [2022-02-20 14:05:10,378 INFO L290 TraceCheckUtils]: 15: Hoare triple {1611#(< |ULTIMATE.start_main_~i~0#1| 99967)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1607#(< |ULTIMATE.start_main_~i~0#1| 99968)} is VALID [2022-02-20 14:05:10,379 INFO L290 TraceCheckUtils]: 14: Hoare triple {1615#(< |ULTIMATE.start_main_~i~0#1| 99966)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1611#(< |ULTIMATE.start_main_~i~0#1| 99967)} is VALID [2022-02-20 14:05:10,379 INFO L290 TraceCheckUtils]: 13: Hoare triple {1619#(< |ULTIMATE.start_main_~i~0#1| 99965)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1615#(< |ULTIMATE.start_main_~i~0#1| 99966)} is VALID [2022-02-20 14:05:10,380 INFO L290 TraceCheckUtils]: 12: Hoare triple {1623#(< |ULTIMATE.start_main_~i~0#1| 99964)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1619#(< |ULTIMATE.start_main_~i~0#1| 99965)} is VALID [2022-02-20 14:05:10,380 INFO L290 TraceCheckUtils]: 11: Hoare triple {1627#(< |ULTIMATE.start_main_~i~0#1| 99963)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1623#(< |ULTIMATE.start_main_~i~0#1| 99964)} is VALID [2022-02-20 14:05:10,381 INFO L290 TraceCheckUtils]: 10: Hoare triple {1631#(< |ULTIMATE.start_main_~i~0#1| 99962)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1627#(< |ULTIMATE.start_main_~i~0#1| 99963)} is VALID [2022-02-20 14:05:10,381 INFO L290 TraceCheckUtils]: 9: Hoare triple {1635#(< |ULTIMATE.start_main_~i~0#1| 99961)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1631#(< |ULTIMATE.start_main_~i~0#1| 99962)} is VALID [2022-02-20 14:05:10,382 INFO L290 TraceCheckUtils]: 8: Hoare triple {1639#(< |ULTIMATE.start_main_~i~0#1| 99960)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1635#(< |ULTIMATE.start_main_~i~0#1| 99961)} is VALID [2022-02-20 14:05:10,382 INFO L290 TraceCheckUtils]: 7: Hoare triple {1643#(< |ULTIMATE.start_main_~i~0#1| 99959)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1639#(< |ULTIMATE.start_main_~i~0#1| 99960)} is VALID [2022-02-20 14:05:10,383 INFO L290 TraceCheckUtils]: 6: Hoare triple {1647#(< |ULTIMATE.start_main_~i~0#1| 99958)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1643#(< |ULTIMATE.start_main_~i~0#1| 99959)} is VALID [2022-02-20 14:05:10,383 INFO L290 TraceCheckUtils]: 5: Hoare triple {1651#(< |ULTIMATE.start_main_~i~0#1| 99957)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1647#(< |ULTIMATE.start_main_~i~0#1| 99958)} is VALID [2022-02-20 14:05:10,384 INFO L290 TraceCheckUtils]: 4: Hoare triple {1655#(< |ULTIMATE.start_main_~i~0#1| 99956)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1651#(< |ULTIMATE.start_main_~i~0#1| 99957)} is VALID [2022-02-20 14:05:10,384 INFO L290 TraceCheckUtils]: 3: Hoare triple {1659#(< |ULTIMATE.start_main_~i~0#1| 99955)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1655#(< |ULTIMATE.start_main_~i~0#1| 99956)} is VALID [2022-02-20 14:05:10,385 INFO L290 TraceCheckUtils]: 2: Hoare triple {1663#(< |ULTIMATE.start_main_~i~0#1| 99954)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1659#(< |ULTIMATE.start_main_~i~0#1| 99955)} is VALID [2022-02-20 14:05:10,385 INFO L290 TraceCheckUtils]: 1: Hoare triple {1258#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem2#1, main_#t~post1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {1663#(< |ULTIMATE.start_main_~i~0#1| 99954)} is VALID [2022-02-20 14:05:10,385 INFO L290 TraceCheckUtils]: 0: Hoare triple {1258#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {1258#true} is VALID [2022-02-20 14:05:10,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:05:10,386 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1261747720] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:05:10,386 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:05:10,386 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2022-02-20 14:05:10,386 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59443892] [2022-02-20 14:05:10,386 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:05:10,387 INFO L78 Accepts]: Start accepts. Automaton has has 97 states, 97 states have (on average 1.0618556701030928) internal successors, (103), 97 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-02-20 14:05:10,387 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:05:10,388 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 97 states, 97 states have (on average 1.0618556701030928) internal successors, (103), 97 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:10,436 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:05:10,436 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 97 states [2022-02-20 14:05:10,436 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:05:10,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2022-02-20 14:05:10,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2022-02-20 14:05:10,440 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand has 97 states, 97 states have (on average 1.0618556701030928) internal successors, (103), 97 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:10,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:05:10,733 INFO L93 Difference]: Finished difference Result 111 states and 160 transitions. [2022-02-20 14:05:10,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-02-20 14:05:10,733 INFO L78 Accepts]: Start accepts. Automaton has has 97 states, 97 states have (on average 1.0618556701030928) internal successors, (103), 97 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-02-20 14:05:10,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:05:10,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 97 states have (on average 1.0618556701030928) internal successors, (103), 97 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:10,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 160 transitions. [2022-02-20 14:05:10,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 97 states have (on average 1.0618556701030928) internal successors, (103), 97 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:10,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 160 transitions. [2022-02-20 14:05:10,738 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 96 states and 160 transitions. [2022-02-20 14:05:10,846 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:05:10,848 INFO L225 Difference]: With dead ends: 111 [2022-02-20 14:05:10,848 INFO L226 Difference]: Without dead ends: 104 [2022-02-20 14:05:10,850 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2022-02-20 14:05:10,851 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:05:10,851 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:05:10,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-02-20 14:05:10,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2022-02-20 14:05:10,916 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:05:10,917 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand has 104 states, 103 states have (on average 1.0194174757281553) internal successors, (105), 103 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:10,919 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand has 104 states, 103 states have (on average 1.0194174757281553) internal successors, (105), 103 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:10,919 INFO L87 Difference]: Start difference. First operand 104 states. Second operand has 104 states, 103 states have (on average 1.0194174757281553) internal successors, (105), 103 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:10,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:05:10,921 INFO L93 Difference]: Finished difference Result 104 states and 105 transitions. [2022-02-20 14:05:10,921 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2022-02-20 14:05:10,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:05:10,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:05:10,922 INFO L74 IsIncluded]: Start isIncluded. First operand has 104 states, 103 states have (on average 1.0194174757281553) internal successors, (105), 103 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 104 states. [2022-02-20 14:05:10,923 INFO L87 Difference]: Start difference. First operand has 104 states, 103 states have (on average 1.0194174757281553) internal successors, (105), 103 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 104 states. [2022-02-20 14:05:10,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:05:10,925 INFO L93 Difference]: Finished difference Result 104 states and 105 transitions. [2022-02-20 14:05:10,925 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2022-02-20 14:05:10,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:05:10,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:05:10,928 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:05:10,929 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:05:10,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.0194174757281553) internal successors, (105), 103 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:10,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 105 transitions. [2022-02-20 14:05:10,931 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 105 transitions. Word has length 53 [2022-02-20 14:05:10,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:05:10,931 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 105 transitions. [2022-02-20 14:05:10,931 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 97 states, 97 states have (on average 1.0618556701030928) internal successors, (103), 97 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:10,932 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2022-02-20 14:05:10,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-02-20 14:05:10,934 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:05:10,935 INFO L514 BasicCegarLoop]: trace histogram [94, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:05:10,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-20 14:05:11,155 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:05:11,155 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:05:11,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:05:11,156 INFO L85 PathProgramCache]: Analyzing trace with hash -765599888, now seen corresponding path program 6 times [2022-02-20 14:05:11,156 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:05:11,156 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707361262] [2022-02-20 14:05:11,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:05:11,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:05:11,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:05:13,684 INFO L290 TraceCheckUtils]: 0: Hoare triple {2285#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {2285#true} is VALID [2022-02-20 14:05:13,687 INFO L290 TraceCheckUtils]: 1: Hoare triple {2285#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem2#1, main_#t~post1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {2287#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:05:13,687 INFO L290 TraceCheckUtils]: 2: Hoare triple {2287#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2288#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:05:13,688 INFO L290 TraceCheckUtils]: 3: Hoare triple {2288#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2289#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:05:13,688 INFO L290 TraceCheckUtils]: 4: Hoare triple {2289#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2290#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:05:13,689 INFO L290 TraceCheckUtils]: 5: Hoare triple {2290#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2291#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:05:13,690 INFO L290 TraceCheckUtils]: 6: Hoare triple {2291#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2292#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:05:13,691 INFO L290 TraceCheckUtils]: 7: Hoare triple {2292#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2293#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:05:13,691 INFO L290 TraceCheckUtils]: 8: Hoare triple {2293#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2294#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:05:13,694 INFO L290 TraceCheckUtils]: 9: Hoare triple {2294#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2295#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:05:13,694 INFO L290 TraceCheckUtils]: 10: Hoare triple {2295#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2296#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:05:13,695 INFO L290 TraceCheckUtils]: 11: Hoare triple {2296#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2297#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:05:13,695 INFO L290 TraceCheckUtils]: 12: Hoare triple {2297#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2298#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-20 14:05:13,695 INFO L290 TraceCheckUtils]: 13: Hoare triple {2298#(<= |ULTIMATE.start_main_~i~0#1| 11)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2299#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 14:05:13,696 INFO L290 TraceCheckUtils]: 14: Hoare triple {2299#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2300#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-20 14:05:13,697 INFO L290 TraceCheckUtils]: 15: Hoare triple {2300#(<= |ULTIMATE.start_main_~i~0#1| 13)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2301#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 14:05:13,697 INFO L290 TraceCheckUtils]: 16: Hoare triple {2301#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2302#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-20 14:05:13,698 INFO L290 TraceCheckUtils]: 17: Hoare triple {2302#(<= |ULTIMATE.start_main_~i~0#1| 15)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2303#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 14:05:13,698 INFO L290 TraceCheckUtils]: 18: Hoare triple {2303#(<= |ULTIMATE.start_main_~i~0#1| 16)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2304#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-20 14:05:13,699 INFO L290 TraceCheckUtils]: 19: Hoare triple {2304#(<= |ULTIMATE.start_main_~i~0#1| 17)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2305#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 14:05:13,699 INFO L290 TraceCheckUtils]: 20: Hoare triple {2305#(<= |ULTIMATE.start_main_~i~0#1| 18)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2306#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-20 14:05:13,700 INFO L290 TraceCheckUtils]: 21: Hoare triple {2306#(<= |ULTIMATE.start_main_~i~0#1| 19)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2307#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 14:05:13,701 INFO L290 TraceCheckUtils]: 22: Hoare triple {2307#(<= |ULTIMATE.start_main_~i~0#1| 20)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2308#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-20 14:05:13,701 INFO L290 TraceCheckUtils]: 23: Hoare triple {2308#(<= |ULTIMATE.start_main_~i~0#1| 21)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2309#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-20 14:05:13,701 INFO L290 TraceCheckUtils]: 24: Hoare triple {2309#(<= |ULTIMATE.start_main_~i~0#1| 22)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2310#(<= |ULTIMATE.start_main_~i~0#1| 23)} is VALID [2022-02-20 14:05:13,702 INFO L290 TraceCheckUtils]: 25: Hoare triple {2310#(<= |ULTIMATE.start_main_~i~0#1| 23)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2311#(<= |ULTIMATE.start_main_~i~0#1| 24)} is VALID [2022-02-20 14:05:13,702 INFO L290 TraceCheckUtils]: 26: Hoare triple {2311#(<= |ULTIMATE.start_main_~i~0#1| 24)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2312#(<= |ULTIMATE.start_main_~i~0#1| 25)} is VALID [2022-02-20 14:05:13,703 INFO L290 TraceCheckUtils]: 27: Hoare triple {2312#(<= |ULTIMATE.start_main_~i~0#1| 25)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2313#(<= |ULTIMATE.start_main_~i~0#1| 26)} is VALID [2022-02-20 14:05:13,703 INFO L290 TraceCheckUtils]: 28: Hoare triple {2313#(<= |ULTIMATE.start_main_~i~0#1| 26)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2314#(<= |ULTIMATE.start_main_~i~0#1| 27)} is VALID [2022-02-20 14:05:13,703 INFO L290 TraceCheckUtils]: 29: Hoare triple {2314#(<= |ULTIMATE.start_main_~i~0#1| 27)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2315#(<= |ULTIMATE.start_main_~i~0#1| 28)} is VALID [2022-02-20 14:05:13,704 INFO L290 TraceCheckUtils]: 30: Hoare triple {2315#(<= |ULTIMATE.start_main_~i~0#1| 28)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2316#(<= |ULTIMATE.start_main_~i~0#1| 29)} is VALID [2022-02-20 14:05:13,704 INFO L290 TraceCheckUtils]: 31: Hoare triple {2316#(<= |ULTIMATE.start_main_~i~0#1| 29)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2317#(<= |ULTIMATE.start_main_~i~0#1| 30)} is VALID [2022-02-20 14:05:13,705 INFO L290 TraceCheckUtils]: 32: Hoare triple {2317#(<= |ULTIMATE.start_main_~i~0#1| 30)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2318#(<= |ULTIMATE.start_main_~i~0#1| 31)} is VALID [2022-02-20 14:05:13,705 INFO L290 TraceCheckUtils]: 33: Hoare triple {2318#(<= |ULTIMATE.start_main_~i~0#1| 31)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2319#(<= |ULTIMATE.start_main_~i~0#1| 32)} is VALID [2022-02-20 14:05:13,705 INFO L290 TraceCheckUtils]: 34: Hoare triple {2319#(<= |ULTIMATE.start_main_~i~0#1| 32)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2320#(<= |ULTIMATE.start_main_~i~0#1| 33)} is VALID [2022-02-20 14:05:13,706 INFO L290 TraceCheckUtils]: 35: Hoare triple {2320#(<= |ULTIMATE.start_main_~i~0#1| 33)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2321#(<= |ULTIMATE.start_main_~i~0#1| 34)} is VALID [2022-02-20 14:05:13,706 INFO L290 TraceCheckUtils]: 36: Hoare triple {2321#(<= |ULTIMATE.start_main_~i~0#1| 34)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2322#(<= |ULTIMATE.start_main_~i~0#1| 35)} is VALID [2022-02-20 14:05:13,707 INFO L290 TraceCheckUtils]: 37: Hoare triple {2322#(<= |ULTIMATE.start_main_~i~0#1| 35)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2323#(<= |ULTIMATE.start_main_~i~0#1| 36)} is VALID [2022-02-20 14:05:13,707 INFO L290 TraceCheckUtils]: 38: Hoare triple {2323#(<= |ULTIMATE.start_main_~i~0#1| 36)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2324#(<= |ULTIMATE.start_main_~i~0#1| 37)} is VALID [2022-02-20 14:05:13,708 INFO L290 TraceCheckUtils]: 39: Hoare triple {2324#(<= |ULTIMATE.start_main_~i~0#1| 37)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2325#(<= |ULTIMATE.start_main_~i~0#1| 38)} is VALID [2022-02-20 14:05:13,708 INFO L290 TraceCheckUtils]: 40: Hoare triple {2325#(<= |ULTIMATE.start_main_~i~0#1| 38)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2326#(<= |ULTIMATE.start_main_~i~0#1| 39)} is VALID [2022-02-20 14:05:13,709 INFO L290 TraceCheckUtils]: 41: Hoare triple {2326#(<= |ULTIMATE.start_main_~i~0#1| 39)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2327#(<= |ULTIMATE.start_main_~i~0#1| 40)} is VALID [2022-02-20 14:05:13,709 INFO L290 TraceCheckUtils]: 42: Hoare triple {2327#(<= |ULTIMATE.start_main_~i~0#1| 40)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2328#(<= |ULTIMATE.start_main_~i~0#1| 41)} is VALID [2022-02-20 14:05:13,710 INFO L290 TraceCheckUtils]: 43: Hoare triple {2328#(<= |ULTIMATE.start_main_~i~0#1| 41)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2329#(<= |ULTIMATE.start_main_~i~0#1| 42)} is VALID [2022-02-20 14:05:13,710 INFO L290 TraceCheckUtils]: 44: Hoare triple {2329#(<= |ULTIMATE.start_main_~i~0#1| 42)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2330#(<= |ULTIMATE.start_main_~i~0#1| 43)} is VALID [2022-02-20 14:05:13,710 INFO L290 TraceCheckUtils]: 45: Hoare triple {2330#(<= |ULTIMATE.start_main_~i~0#1| 43)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2331#(<= |ULTIMATE.start_main_~i~0#1| 44)} is VALID [2022-02-20 14:05:13,711 INFO L290 TraceCheckUtils]: 46: Hoare triple {2331#(<= |ULTIMATE.start_main_~i~0#1| 44)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2332#(<= |ULTIMATE.start_main_~i~0#1| 45)} is VALID [2022-02-20 14:05:13,711 INFO L290 TraceCheckUtils]: 47: Hoare triple {2332#(<= |ULTIMATE.start_main_~i~0#1| 45)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2333#(<= |ULTIMATE.start_main_~i~0#1| 46)} is VALID [2022-02-20 14:05:13,712 INFO L290 TraceCheckUtils]: 48: Hoare triple {2333#(<= |ULTIMATE.start_main_~i~0#1| 46)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2334#(<= |ULTIMATE.start_main_~i~0#1| 47)} is VALID [2022-02-20 14:05:13,712 INFO L290 TraceCheckUtils]: 49: Hoare triple {2334#(<= |ULTIMATE.start_main_~i~0#1| 47)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2335#(<= |ULTIMATE.start_main_~i~0#1| 48)} is VALID [2022-02-20 14:05:13,716 INFO L290 TraceCheckUtils]: 50: Hoare triple {2335#(<= |ULTIMATE.start_main_~i~0#1| 48)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2336#(<= |ULTIMATE.start_main_~i~0#1| 49)} is VALID [2022-02-20 14:05:13,716 INFO L290 TraceCheckUtils]: 51: Hoare triple {2336#(<= |ULTIMATE.start_main_~i~0#1| 49)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2337#(<= |ULTIMATE.start_main_~i~0#1| 50)} is VALID [2022-02-20 14:05:13,717 INFO L290 TraceCheckUtils]: 52: Hoare triple {2337#(<= |ULTIMATE.start_main_~i~0#1| 50)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2338#(<= |ULTIMATE.start_main_~i~0#1| 51)} is VALID [2022-02-20 14:05:13,717 INFO L290 TraceCheckUtils]: 53: Hoare triple {2338#(<= |ULTIMATE.start_main_~i~0#1| 51)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2339#(<= |ULTIMATE.start_main_~i~0#1| 52)} is VALID [2022-02-20 14:05:13,718 INFO L290 TraceCheckUtils]: 54: Hoare triple {2339#(<= |ULTIMATE.start_main_~i~0#1| 52)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2340#(<= |ULTIMATE.start_main_~i~0#1| 53)} is VALID [2022-02-20 14:05:13,718 INFO L290 TraceCheckUtils]: 55: Hoare triple {2340#(<= |ULTIMATE.start_main_~i~0#1| 53)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2341#(<= |ULTIMATE.start_main_~i~0#1| 54)} is VALID [2022-02-20 14:05:13,726 INFO L290 TraceCheckUtils]: 56: Hoare triple {2341#(<= |ULTIMATE.start_main_~i~0#1| 54)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2342#(<= |ULTIMATE.start_main_~i~0#1| 55)} is VALID [2022-02-20 14:05:13,726 INFO L290 TraceCheckUtils]: 57: Hoare triple {2342#(<= |ULTIMATE.start_main_~i~0#1| 55)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2343#(<= |ULTIMATE.start_main_~i~0#1| 56)} is VALID [2022-02-20 14:05:13,727 INFO L290 TraceCheckUtils]: 58: Hoare triple {2343#(<= |ULTIMATE.start_main_~i~0#1| 56)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2344#(<= |ULTIMATE.start_main_~i~0#1| 57)} is VALID [2022-02-20 14:05:13,727 INFO L290 TraceCheckUtils]: 59: Hoare triple {2344#(<= |ULTIMATE.start_main_~i~0#1| 57)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2345#(<= |ULTIMATE.start_main_~i~0#1| 58)} is VALID [2022-02-20 14:05:13,731 INFO L290 TraceCheckUtils]: 60: Hoare triple {2345#(<= |ULTIMATE.start_main_~i~0#1| 58)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2346#(<= |ULTIMATE.start_main_~i~0#1| 59)} is VALID [2022-02-20 14:05:13,731 INFO L290 TraceCheckUtils]: 61: Hoare triple {2346#(<= |ULTIMATE.start_main_~i~0#1| 59)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2347#(<= |ULTIMATE.start_main_~i~0#1| 60)} is VALID [2022-02-20 14:05:13,732 INFO L290 TraceCheckUtils]: 62: Hoare triple {2347#(<= |ULTIMATE.start_main_~i~0#1| 60)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2348#(<= |ULTIMATE.start_main_~i~0#1| 61)} is VALID [2022-02-20 14:05:13,732 INFO L290 TraceCheckUtils]: 63: Hoare triple {2348#(<= |ULTIMATE.start_main_~i~0#1| 61)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2349#(<= |ULTIMATE.start_main_~i~0#1| 62)} is VALID [2022-02-20 14:05:13,733 INFO L290 TraceCheckUtils]: 64: Hoare triple {2349#(<= |ULTIMATE.start_main_~i~0#1| 62)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2350#(<= |ULTIMATE.start_main_~i~0#1| 63)} is VALID [2022-02-20 14:05:13,733 INFO L290 TraceCheckUtils]: 65: Hoare triple {2350#(<= |ULTIMATE.start_main_~i~0#1| 63)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2351#(<= |ULTIMATE.start_main_~i~0#1| 64)} is VALID [2022-02-20 14:05:13,734 INFO L290 TraceCheckUtils]: 66: Hoare triple {2351#(<= |ULTIMATE.start_main_~i~0#1| 64)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2352#(<= |ULTIMATE.start_main_~i~0#1| 65)} is VALID [2022-02-20 14:05:13,734 INFO L290 TraceCheckUtils]: 67: Hoare triple {2352#(<= |ULTIMATE.start_main_~i~0#1| 65)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2353#(<= |ULTIMATE.start_main_~i~0#1| 66)} is VALID [2022-02-20 14:05:13,735 INFO L290 TraceCheckUtils]: 68: Hoare triple {2353#(<= |ULTIMATE.start_main_~i~0#1| 66)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2354#(<= |ULTIMATE.start_main_~i~0#1| 67)} is VALID [2022-02-20 14:05:13,735 INFO L290 TraceCheckUtils]: 69: Hoare triple {2354#(<= |ULTIMATE.start_main_~i~0#1| 67)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2355#(<= |ULTIMATE.start_main_~i~0#1| 68)} is VALID [2022-02-20 14:05:13,736 INFO L290 TraceCheckUtils]: 70: Hoare triple {2355#(<= |ULTIMATE.start_main_~i~0#1| 68)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2356#(<= |ULTIMATE.start_main_~i~0#1| 69)} is VALID [2022-02-20 14:05:13,736 INFO L290 TraceCheckUtils]: 71: Hoare triple {2356#(<= |ULTIMATE.start_main_~i~0#1| 69)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2357#(<= |ULTIMATE.start_main_~i~0#1| 70)} is VALID [2022-02-20 14:05:13,737 INFO L290 TraceCheckUtils]: 72: Hoare triple {2357#(<= |ULTIMATE.start_main_~i~0#1| 70)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2358#(<= |ULTIMATE.start_main_~i~0#1| 71)} is VALID [2022-02-20 14:05:13,737 INFO L290 TraceCheckUtils]: 73: Hoare triple {2358#(<= |ULTIMATE.start_main_~i~0#1| 71)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2359#(<= |ULTIMATE.start_main_~i~0#1| 72)} is VALID [2022-02-20 14:05:13,738 INFO L290 TraceCheckUtils]: 74: Hoare triple {2359#(<= |ULTIMATE.start_main_~i~0#1| 72)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2360#(<= |ULTIMATE.start_main_~i~0#1| 73)} is VALID [2022-02-20 14:05:13,739 INFO L290 TraceCheckUtils]: 75: Hoare triple {2360#(<= |ULTIMATE.start_main_~i~0#1| 73)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2361#(<= |ULTIMATE.start_main_~i~0#1| 74)} is VALID [2022-02-20 14:05:13,740 INFO L290 TraceCheckUtils]: 76: Hoare triple {2361#(<= |ULTIMATE.start_main_~i~0#1| 74)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2362#(<= |ULTIMATE.start_main_~i~0#1| 75)} is VALID [2022-02-20 14:05:13,741 INFO L290 TraceCheckUtils]: 77: Hoare triple {2362#(<= |ULTIMATE.start_main_~i~0#1| 75)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2363#(<= |ULTIMATE.start_main_~i~0#1| 76)} is VALID [2022-02-20 14:05:13,741 INFO L290 TraceCheckUtils]: 78: Hoare triple {2363#(<= |ULTIMATE.start_main_~i~0#1| 76)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2364#(<= |ULTIMATE.start_main_~i~0#1| 77)} is VALID [2022-02-20 14:05:13,742 INFO L290 TraceCheckUtils]: 79: Hoare triple {2364#(<= |ULTIMATE.start_main_~i~0#1| 77)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2365#(<= |ULTIMATE.start_main_~i~0#1| 78)} is VALID [2022-02-20 14:05:13,748 INFO L290 TraceCheckUtils]: 80: Hoare triple {2365#(<= |ULTIMATE.start_main_~i~0#1| 78)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2366#(<= |ULTIMATE.start_main_~i~0#1| 79)} is VALID [2022-02-20 14:05:13,748 INFO L290 TraceCheckUtils]: 81: Hoare triple {2366#(<= |ULTIMATE.start_main_~i~0#1| 79)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2367#(<= |ULTIMATE.start_main_~i~0#1| 80)} is VALID [2022-02-20 14:05:13,749 INFO L290 TraceCheckUtils]: 82: Hoare triple {2367#(<= |ULTIMATE.start_main_~i~0#1| 80)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2368#(<= |ULTIMATE.start_main_~i~0#1| 81)} is VALID [2022-02-20 14:05:13,750 INFO L290 TraceCheckUtils]: 83: Hoare triple {2368#(<= |ULTIMATE.start_main_~i~0#1| 81)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2369#(<= |ULTIMATE.start_main_~i~0#1| 82)} is VALID [2022-02-20 14:05:13,750 INFO L290 TraceCheckUtils]: 84: Hoare triple {2369#(<= |ULTIMATE.start_main_~i~0#1| 82)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2370#(<= |ULTIMATE.start_main_~i~0#1| 83)} is VALID [2022-02-20 14:05:13,751 INFO L290 TraceCheckUtils]: 85: Hoare triple {2370#(<= |ULTIMATE.start_main_~i~0#1| 83)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2371#(<= |ULTIMATE.start_main_~i~0#1| 84)} is VALID [2022-02-20 14:05:13,751 INFO L290 TraceCheckUtils]: 86: Hoare triple {2371#(<= |ULTIMATE.start_main_~i~0#1| 84)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2372#(<= |ULTIMATE.start_main_~i~0#1| 85)} is VALID [2022-02-20 14:05:13,752 INFO L290 TraceCheckUtils]: 87: Hoare triple {2372#(<= |ULTIMATE.start_main_~i~0#1| 85)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2373#(<= |ULTIMATE.start_main_~i~0#1| 86)} is VALID [2022-02-20 14:05:13,752 INFO L290 TraceCheckUtils]: 88: Hoare triple {2373#(<= |ULTIMATE.start_main_~i~0#1| 86)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2374#(<= |ULTIMATE.start_main_~i~0#1| 87)} is VALID [2022-02-20 14:05:13,753 INFO L290 TraceCheckUtils]: 89: Hoare triple {2374#(<= |ULTIMATE.start_main_~i~0#1| 87)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2375#(<= |ULTIMATE.start_main_~i~0#1| 88)} is VALID [2022-02-20 14:05:13,753 INFO L290 TraceCheckUtils]: 90: Hoare triple {2375#(<= |ULTIMATE.start_main_~i~0#1| 88)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2376#(<= |ULTIMATE.start_main_~i~0#1| 89)} is VALID [2022-02-20 14:05:13,754 INFO L290 TraceCheckUtils]: 91: Hoare triple {2376#(<= |ULTIMATE.start_main_~i~0#1| 89)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2377#(<= |ULTIMATE.start_main_~i~0#1| 90)} is VALID [2022-02-20 14:05:13,754 INFO L290 TraceCheckUtils]: 92: Hoare triple {2377#(<= |ULTIMATE.start_main_~i~0#1| 90)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2378#(<= |ULTIMATE.start_main_~i~0#1| 91)} is VALID [2022-02-20 14:05:13,767 INFO L290 TraceCheckUtils]: 93: Hoare triple {2378#(<= |ULTIMATE.start_main_~i~0#1| 91)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2379#(<= |ULTIMATE.start_main_~i~0#1| 92)} is VALID [2022-02-20 14:05:13,768 INFO L290 TraceCheckUtils]: 94: Hoare triple {2379#(<= |ULTIMATE.start_main_~i~0#1| 92)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2380#(<= |ULTIMATE.start_main_~i~0#1| 93)} is VALID [2022-02-20 14:05:13,769 INFO L290 TraceCheckUtils]: 95: Hoare triple {2380#(<= |ULTIMATE.start_main_~i~0#1| 93)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2381#(<= |ULTIMATE.start_main_~i~0#1| 94)} is VALID [2022-02-20 14:05:13,769 INFO L290 TraceCheckUtils]: 96: Hoare triple {2381#(<= |ULTIMATE.start_main_~i~0#1| 94)} assume !(main_~i~0#1 < 100000); {2286#false} is VALID [2022-02-20 14:05:13,769 INFO L290 TraceCheckUtils]: 97: Hoare triple {2286#false} havoc main_~x~0#1;main_~x~0#1 := 0; {2286#false} is VALID [2022-02-20 14:05:13,769 INFO L290 TraceCheckUtils]: 98: Hoare triple {2286#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 42 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2286#false} is VALID [2022-02-20 14:05:13,769 INFO L290 TraceCheckUtils]: 99: Hoare triple {2286#false} assume 0 == __VERIFIER_assert_~cond#1; {2286#false} is VALID [2022-02-20 14:05:13,769 INFO L290 TraceCheckUtils]: 100: Hoare triple {2286#false} assume !false; {2286#false} is VALID [2022-02-20 14:05:13,772 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:05:13,772 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:05:13,772 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707361262] [2022-02-20 14:05:13,772 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707361262] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:05:13,772 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [405747516] [2022-02-20 14:05:13,772 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-20 14:05:13,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:05:13,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:05:13,788 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:05:13,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process