./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-examples/standard_init2_ground-1.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-examples/standard_init2_ground-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cf1af1de3644d7f65779e1f0fa1695f30c94933219211c16e44b2dad6d7664ff --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 14:04:24,673 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 14:04:24,678 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 14:04:24,721 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 14:04:24,722 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 14:04:24,725 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 14:04:24,727 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 14:04:24,733 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 14:04:24,735 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 14:04:24,741 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 14:04:24,742 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 14:04:24,744 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 14:04:24,744 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 14:04:24,746 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 14:04:24,748 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 14:04:24,752 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 14:04:24,753 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 14:04:24,754 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 14:04:24,755 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 14:04:24,758 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 14:04:24,763 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 14:04:24,764 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 14:04:24,766 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 14:04:24,767 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 14:04:24,771 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 14:04:24,771 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 14:04:24,771 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 14:04:24,773 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 14:04:24,773 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 14:04:24,774 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 14:04:24,774 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 14:04:24,776 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 14:04:24,777 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 14:04:24,778 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 14:04:24,779 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 14:04:24,779 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 14:04:24,780 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 14:04:24,780 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 14:04:24,780 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 14:04:24,782 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 14:04:24,782 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 14:04:24,783 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:24,821 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 14:04:24,822 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 14:04:24,822 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 14:04:24,823 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 14:04:24,823 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 14:04:24,824 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 14:04:24,824 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 14:04:24,824 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 14:04:24,824 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 14:04:24,825 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 14:04:24,826 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 14:04:24,826 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 14:04:24,826 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 14:04:24,826 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 14:04:24,826 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 14:04:24,826 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 14:04:24,827 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 14:04:24,827 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 14:04:24,827 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 14:04:24,827 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 14:04:24,827 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 14:04:24,828 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 14:04:24,828 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 14:04:24,828 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 14:04:24,828 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:04:24,828 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 14:04:24,828 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 14:04:24,829 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 14:04:24,829 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 14:04:24,829 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 14:04:24,829 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 14:04:24,829 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 14:04:24,830 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 14:04:24,830 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 -> cf1af1de3644d7f65779e1f0fa1695f30c94933219211c16e44b2dad6d7664ff [2022-02-20 14:04:25,099 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 14:04:25,121 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 14:04:25,125 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 14:04:25,126 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 14:04:25,127 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 14:04:25,128 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-examples/standard_init2_ground-1.i [2022-02-20 14:04:25,203 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f70d5c271/7cf1c157abbf4ef1a70c031d6d03b4ad/FLAG7df092578 [2022-02-20 14:04:25,647 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 14:04:25,648 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/standard_init2_ground-1.i [2022-02-20 14:04:25,657 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f70d5c271/7cf1c157abbf4ef1a70c031d6d03b4ad/FLAG7df092578 [2022-02-20 14:04:26,034 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f70d5c271/7cf1c157abbf4ef1a70c031d6d03b4ad [2022-02-20 14:04:26,037 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 14:04:26,038 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 14:04:26,041 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 14:04:26,042 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 14:04:26,045 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 14:04:26,046 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:04:26" (1/1) ... [2022-02-20 14:04:26,049 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4180d5af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:04:26, skipping insertion in model container [2022-02-20 14:04:26,049 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:04:26" (1/1) ... [2022-02-20 14:04:26,055 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 14:04:26,070 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 14:04:26,226 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_init2_ground-1.i[816,829] [2022-02-20 14:04:26,241 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:04:26,249 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 14:04:26,261 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_init2_ground-1.i[816,829] [2022-02-20 14:04:26,266 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:04:26,279 INFO L208 MainTranslator]: Completed translation [2022-02-20 14:04:26,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:04:26 WrapperNode [2022-02-20 14:04:26,280 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 14:04:26,281 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 14:04:26,281 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 14:04:26,281 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 14:04:26,286 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:26" (1/1) ... [2022-02-20 14:04:26,293 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:26" (1/1) ... [2022-02-20 14:04:26,320 INFO L137 Inliner]: procedures = 15, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 47 [2022-02-20 14:04:26,321 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 14:04:26,321 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 14:04:26,322 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 14:04:26,322 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 14:04:26,328 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:26" (1/1) ... [2022-02-20 14:04:26,329 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:26" (1/1) ... [2022-02-20 14:04:26,338 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:26" (1/1) ... [2022-02-20 14:04:26,339 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:26" (1/1) ... [2022-02-20 14:04:26,349 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:26" (1/1) ... [2022-02-20 14:04:26,357 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:26" (1/1) ... [2022-02-20 14:04:26,362 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:26" (1/1) ... [2022-02-20 14:04:26,363 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 14:04:26,365 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 14:04:26,366 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 14:04:26,366 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 14:04:26,368 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:04:26" (1/1) ... [2022-02-20 14:04:26,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:04:26,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:04:26,403 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:26,421 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:26,443 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 14:04:26,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 14:04:26,444 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 14:04:26,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 14:04:26,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 14:04:26,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 14:04:26,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 14:04:26,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 14:04:26,496 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 14:04:26,498 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 14:04:26,685 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 14:04:26,691 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 14:04:26,691 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-20 14:04:26,693 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:04:26 BoogieIcfgContainer [2022-02-20 14:04:26,693 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 14:04:26,695 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 14:04:26,695 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 14:04:26,700 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 14:04:26,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 02:04:26" (1/3) ... [2022-02-20 14:04:26,709 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3446fd98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:04:26, skipping insertion in model container [2022-02-20 14:04:26,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:04:26" (2/3) ... [2022-02-20 14:04:26,709 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3446fd98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:04:26, skipping insertion in model container [2022-02-20 14:04:26,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:04:26" (3/3) ... [2022-02-20 14:04:26,711 INFO L111 eAbstractionObserver]: Analyzing ICFG standard_init2_ground-1.i [2022-02-20 14:04:26,716 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 14:04:26,720 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 14:04:26,786 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 14:04:26,809 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:26,809 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 14:04:26,839 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:26,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 14:04:26,845 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:04:26,858 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:04:26,859 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:04:26,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:04:26,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1157636873, now seen corresponding path program 1 times [2022-02-20 14:04:26,877 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:04:26,878 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054599556] [2022-02-20 14:04:26,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:04:26,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:04:27,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:04:27,094 INFO L290 TraceCheckUtils]: 0: Hoare triple {19#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); {19#true} is VALID [2022-02-20 14:04:27,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {19#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; {21#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:04:27,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {21#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~i~0#1 < 100000); {20#false} is VALID [2022-02-20 14:04:27,099 INFO L290 TraceCheckUtils]: 3: Hoare triple {20#false} main_~i~0#1 := 0; {20#false} is VALID [2022-02-20 14:04:27,100 INFO L290 TraceCheckUtils]: 4: Hoare triple {20#false} assume !(main_~i~0#1 < 100000); {20#false} is VALID [2022-02-20 14:04:27,100 INFO L290 TraceCheckUtils]: 5: Hoare triple {20#false} havoc main_~x~0#1;main_~x~0#1 := 0; {20#false} is VALID [2022-02-20 14:04:27,101 INFO L290 TraceCheckUtils]: 6: Hoare triple {20#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; {20#false} is VALID [2022-02-20 14:04:27,101 INFO L290 TraceCheckUtils]: 7: Hoare triple {20#false} assume 0 == __VERIFIER_assert_~cond#1; {20#false} is VALID [2022-02-20 14:04:27,101 INFO L290 TraceCheckUtils]: 8: Hoare triple {20#false} assume !false; {20#false} is VALID [2022-02-20 14:04:27,103 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:27,104 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:04:27,105 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054599556] [2022-02-20 14:04:27,106 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054599556] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:04:27,106 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:04:27,107 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:04:27,110 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129616791] [2022-02-20 14:04:27,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:04:27,116 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 14:04:27,118 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:04:27,121 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:27,139 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:04:27,140 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:04:27,140 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:04:27,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:04:27,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:04:27,169 INFO L87 Difference]: Start difference. First operand has 16 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:27,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:04:27,250 INFO L93 Difference]: Finished difference Result 31 states and 45 transitions. [2022-02-20 14:04:27,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:04:27,251 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 14:04:27,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:04:27,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:27,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2022-02-20 14:04:27,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:27,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2022-02-20 14:04:27,269 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 45 transitions. [2022-02-20 14:04:27,333 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:04:27,350 INFO L225 Difference]: With dead ends: 31 [2022-02-20 14:04:27,353 INFO L226 Difference]: Without dead ends: 14 [2022-02-20 14:04:27,356 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:27,361 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:04:27,362 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:04:27,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-02-20 14:04:27,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-02-20 14:04:27,392 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:04:27,393 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call 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,394 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call 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,394 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call 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,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:04:27,401 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2022-02-20 14:04:27,401 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2022-02-20 14:04:27,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:04:27,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:04:27,403 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 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:27,404 INFO L87 Difference]: Start difference. First operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 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:27,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:04:27,406 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2022-02-20 14:04:27,406 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2022-02-20 14:04:27,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:04:27,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:04:27,407 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:04:27,407 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:04:27,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call 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,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2022-02-20 14:04:27,413 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 9 [2022-02-20 14:04:27,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:04:27,414 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2022-02-20 14:04:27,414 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:27,416 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2022-02-20 14:04:27,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 14:04:27,417 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:04:27,417 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:04:27,418 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 14:04:27,419 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:04:27,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:04:27,424 INFO L85 PathProgramCache]: Analyzing trace with hash 970257334, now seen corresponding path program 1 times [2022-02-20 14:04:27,426 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:04:27,426 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802176803] [2022-02-20 14:04:27,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:04:27,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:04:27,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:04:27,490 INFO L290 TraceCheckUtils]: 0: Hoare triple {111#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); {111#true} is VALID [2022-02-20 14:04:27,492 INFO L290 TraceCheckUtils]: 1: Hoare triple {111#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; {113#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:04:27,495 INFO L290 TraceCheckUtils]: 2: Hoare triple {113#(= |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; {114#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:04:27,497 INFO L290 TraceCheckUtils]: 3: Hoare triple {114#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < 100000); {112#false} is VALID [2022-02-20 14:04:27,503 INFO L290 TraceCheckUtils]: 4: Hoare triple {112#false} main_~i~0#1 := 0; {112#false} is VALID [2022-02-20 14:04:27,503 INFO L290 TraceCheckUtils]: 5: Hoare triple {112#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {112#false} is VALID [2022-02-20 14:04:27,504 INFO L290 TraceCheckUtils]: 6: Hoare triple {112#false} assume !(main_~i~0#1 < 100000); {112#false} is VALID [2022-02-20 14:04:27,504 INFO L290 TraceCheckUtils]: 7: Hoare triple {112#false} havoc main_~x~0#1;main_~x~0#1 := 0; {112#false} is VALID [2022-02-20 14:04:27,504 INFO L290 TraceCheckUtils]: 8: Hoare triple {112#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; {112#false} is VALID [2022-02-20 14:04:27,504 INFO L290 TraceCheckUtils]: 9: Hoare triple {112#false} assume 0 == __VERIFIER_assert_~cond#1; {112#false} is VALID [2022-02-20 14:04:27,505 INFO L290 TraceCheckUtils]: 10: Hoare triple {112#false} assume !false; {112#false} is VALID [2022-02-20 14:04:27,505 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 14:04:27,505 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:04:27,506 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802176803] [2022-02-20 14:04:27,506 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802176803] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:04:27,506 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984518555] [2022-02-20 14:04:27,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:04:27,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:04:27,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:04:27,513 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:27,514 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:27,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:04:27,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 14:04:27,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:04:27,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:04:27,668 INFO L290 TraceCheckUtils]: 0: Hoare triple {111#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); {111#true} is VALID [2022-02-20 14:04:27,669 INFO L290 TraceCheckUtils]: 1: Hoare triple {111#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; {121#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:04:27,670 INFO L290 TraceCheckUtils]: 2: Hoare triple {121#(<= |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; {114#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:04:27,671 INFO L290 TraceCheckUtils]: 3: Hoare triple {114#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < 100000); {112#false} is VALID [2022-02-20 14:04:27,671 INFO L290 TraceCheckUtils]: 4: Hoare triple {112#false} main_~i~0#1 := 0; {112#false} is VALID [2022-02-20 14:04:27,671 INFO L290 TraceCheckUtils]: 5: Hoare triple {112#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {112#false} is VALID [2022-02-20 14:04:27,672 INFO L290 TraceCheckUtils]: 6: Hoare triple {112#false} assume !(main_~i~0#1 < 100000); {112#false} is VALID [2022-02-20 14:04:27,673 INFO L290 TraceCheckUtils]: 7: Hoare triple {112#false} havoc main_~x~0#1;main_~x~0#1 := 0; {112#false} is VALID [2022-02-20 14:04:27,673 INFO L290 TraceCheckUtils]: 8: Hoare triple {112#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; {112#false} is VALID [2022-02-20 14:04:27,673 INFO L290 TraceCheckUtils]: 9: Hoare triple {112#false} assume 0 == __VERIFIER_assert_~cond#1; {112#false} is VALID [2022-02-20 14:04:27,674 INFO L290 TraceCheckUtils]: 10: Hoare triple {112#false} assume !false; {112#false} is VALID [2022-02-20 14:04:27,674 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 14:04:27,674 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:04:27,746 INFO L290 TraceCheckUtils]: 10: Hoare triple {112#false} assume !false; {112#false} is VALID [2022-02-20 14:04:27,746 INFO L290 TraceCheckUtils]: 9: Hoare triple {112#false} assume 0 == __VERIFIER_assert_~cond#1; {112#false} is VALID [2022-02-20 14:04:27,746 INFO L290 TraceCheckUtils]: 8: Hoare triple {112#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; {112#false} is VALID [2022-02-20 14:04:27,746 INFO L290 TraceCheckUtils]: 7: Hoare triple {112#false} havoc main_~x~0#1;main_~x~0#1 := 0; {112#false} is VALID [2022-02-20 14:04:27,747 INFO L290 TraceCheckUtils]: 6: Hoare triple {112#false} assume !(main_~i~0#1 < 100000); {112#false} is VALID [2022-02-20 14:04:27,747 INFO L290 TraceCheckUtils]: 5: Hoare triple {112#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {112#false} is VALID [2022-02-20 14:04:27,747 INFO L290 TraceCheckUtils]: 4: Hoare triple {112#false} main_~i~0#1 := 0; {112#false} is VALID [2022-02-20 14:04:27,748 INFO L290 TraceCheckUtils]: 3: Hoare triple {170#(< |ULTIMATE.start_main_~i~0#1| 100000)} assume !(main_~i~0#1 < 100000); {112#false} is VALID [2022-02-20 14:04:27,749 INFO L290 TraceCheckUtils]: 2: Hoare triple {174#(< |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; {170#(< |ULTIMATE.start_main_~i~0#1| 100000)} is VALID [2022-02-20 14:04:27,749 INFO L290 TraceCheckUtils]: 1: Hoare triple {111#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; {174#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:04:27,750 INFO L290 TraceCheckUtils]: 0: Hoare triple {111#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); {111#true} is VALID [2022-02-20 14:04:27,751 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 14:04:27,752 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [984518555] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:04:27,755 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:04:27,755 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-02-20 14:04:27,756 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532234749] [2022-02-20 14:04:27,757 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:04:27,758 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 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:27,758 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:04:27,759 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call 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,772 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:04:27,773 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 14:04:27,774 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:04:27,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 14:04:27,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-02-20 14:04:27,775 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call 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,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:04:27,915 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2022-02-20 14:04:27,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 14:04:27,917 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 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:27,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:04:27,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call 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,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. [2022-02-20 14:04:27,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call 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,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. [2022-02-20 14:04:27,923 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 38 transitions. [2022-02-20 14:04:27,960 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:04:27,963 INFO L225 Difference]: With dead ends: 30 [2022-02-20 14:04:27,964 INFO L226 Difference]: Without dead ends: 20 [2022-02-20 14:04:27,965 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 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:27,967 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:04:27,968 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:04:27,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-02-20 14:04:27,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-02-20 14:04:27,978 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:04:27,978 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:27,979 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:27,979 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:27,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:04:27,981 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-02-20 14:04:27,981 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-02-20 14:04:27,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:04:27,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:04:27,983 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 20 states. [2022-02-20 14:04:27,986 INFO L87 Difference]: Start difference. First operand has 20 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 20 states. [2022-02-20 14:04:27,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:04:27,989 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-02-20 14:04:27,989 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-02-20 14:04:27,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:04:27,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:04:27,990 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:04:27,990 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:04:27,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:27,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2022-02-20 14:04:27,994 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 11 [2022-02-20 14:04:27,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:04:27,995 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2022-02-20 14:04:27,995 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call 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,995 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-02-20 14:04:27,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 14:04:27,996 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:04:27,996 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:04:28,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 14:04:28,209 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:28,209 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:04:28,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:04:28,210 INFO L85 PathProgramCache]: Analyzing trace with hash -57021897, now seen corresponding path program 2 times [2022-02-20 14:04:28,210 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:04:28,210 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384083996] [2022-02-20 14:04:28,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:04:28,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:04:28,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:04:28,342 INFO L290 TraceCheckUtils]: 0: Hoare triple {295#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); {295#true} is VALID [2022-02-20 14:04:28,343 INFO L290 TraceCheckUtils]: 1: Hoare triple {295#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; {297#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:04:28,347 INFO L290 TraceCheckUtils]: 2: Hoare triple {297#(= |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; {298#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:04:28,349 INFO L290 TraceCheckUtils]: 3: Hoare triple {298#(<= |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; {299#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:04:28,349 INFO L290 TraceCheckUtils]: 4: Hoare triple {299#(<= |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; {300#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:04:28,350 INFO L290 TraceCheckUtils]: 5: Hoare triple {300#(<= |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; {301#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:04:28,351 INFO L290 TraceCheckUtils]: 6: Hoare triple {301#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !(main_~i~0#1 < 100000); {296#false} is VALID [2022-02-20 14:04:28,351 INFO L290 TraceCheckUtils]: 7: Hoare triple {296#false} main_~i~0#1 := 0; {296#false} is VALID [2022-02-20 14:04:28,352 INFO L290 TraceCheckUtils]: 8: Hoare triple {296#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {296#false} is VALID [2022-02-20 14:04:28,352 INFO L290 TraceCheckUtils]: 9: Hoare triple {296#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {296#false} is VALID [2022-02-20 14:04:28,352 INFO L290 TraceCheckUtils]: 10: Hoare triple {296#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {296#false} is VALID [2022-02-20 14:04:28,352 INFO L290 TraceCheckUtils]: 11: Hoare triple {296#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {296#false} is VALID [2022-02-20 14:04:28,352 INFO L290 TraceCheckUtils]: 12: Hoare triple {296#false} assume !(main_~i~0#1 < 100000); {296#false} is VALID [2022-02-20 14:04:28,353 INFO L290 TraceCheckUtils]: 13: Hoare triple {296#false} havoc main_~x~0#1;main_~x~0#1 := 0; {296#false} is VALID [2022-02-20 14:04:28,353 INFO L290 TraceCheckUtils]: 14: Hoare triple {296#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; {296#false} is VALID [2022-02-20 14:04:28,353 INFO L290 TraceCheckUtils]: 15: Hoare triple {296#false} assume 0 == __VERIFIER_assert_~cond#1; {296#false} is VALID [2022-02-20 14:04:28,353 INFO L290 TraceCheckUtils]: 16: Hoare triple {296#false} assume !false; {296#false} is VALID [2022-02-20 14:04:28,354 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-02-20 14:04:28,354 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:04:28,354 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384083996] [2022-02-20 14:04:28,354 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384083996] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:04:28,354 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1114625474] [2022-02-20 14:04:28,354 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 14:04:28,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:04:28,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:04:28,356 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:28,357 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:28,418 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 14:04:28,418 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:04:28,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 14:04:28,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:04:28,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:04:28,550 INFO L290 TraceCheckUtils]: 0: Hoare triple {295#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); {295#true} is VALID [2022-02-20 14:04:28,552 INFO L290 TraceCheckUtils]: 1: Hoare triple {295#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; {308#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:04:28,552 INFO L290 TraceCheckUtils]: 2: Hoare triple {308#(<= |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; {298#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:04:28,553 INFO L290 TraceCheckUtils]: 3: Hoare triple {298#(<= |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; {299#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:04:28,554 INFO L290 TraceCheckUtils]: 4: Hoare triple {299#(<= |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; {300#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:04:28,554 INFO L290 TraceCheckUtils]: 5: Hoare triple {300#(<= |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; {301#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:04:28,555 INFO L290 TraceCheckUtils]: 6: Hoare triple {301#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !(main_~i~0#1 < 100000); {296#false} is VALID [2022-02-20 14:04:28,555 INFO L290 TraceCheckUtils]: 7: Hoare triple {296#false} main_~i~0#1 := 0; {296#false} is VALID [2022-02-20 14:04:28,555 INFO L290 TraceCheckUtils]: 8: Hoare triple {296#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {296#false} is VALID [2022-02-20 14:04:28,556 INFO L290 TraceCheckUtils]: 9: Hoare triple {296#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {296#false} is VALID [2022-02-20 14:04:28,556 INFO L290 TraceCheckUtils]: 10: Hoare triple {296#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {296#false} is VALID [2022-02-20 14:04:28,556 INFO L290 TraceCheckUtils]: 11: Hoare triple {296#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {296#false} is VALID [2022-02-20 14:04:28,556 INFO L290 TraceCheckUtils]: 12: Hoare triple {296#false} assume !(main_~i~0#1 < 100000); {296#false} is VALID [2022-02-20 14:04:28,556 INFO L290 TraceCheckUtils]: 13: Hoare triple {296#false} havoc main_~x~0#1;main_~x~0#1 := 0; {296#false} is VALID [2022-02-20 14:04:28,557 INFO L290 TraceCheckUtils]: 14: Hoare triple {296#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; {296#false} is VALID [2022-02-20 14:04:28,557 INFO L290 TraceCheckUtils]: 15: Hoare triple {296#false} assume 0 == __VERIFIER_assert_~cond#1; {296#false} is VALID [2022-02-20 14:04:28,557 INFO L290 TraceCheckUtils]: 16: Hoare triple {296#false} assume !false; {296#false} is VALID [2022-02-20 14:04:28,557 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-02-20 14:04:28,557 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:04:28,718 INFO L290 TraceCheckUtils]: 16: Hoare triple {296#false} assume !false; {296#false} is VALID [2022-02-20 14:04:28,719 INFO L290 TraceCheckUtils]: 15: Hoare triple {296#false} assume 0 == __VERIFIER_assert_~cond#1; {296#false} is VALID [2022-02-20 14:04:28,719 INFO L290 TraceCheckUtils]: 14: Hoare triple {296#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; {296#false} is VALID [2022-02-20 14:04:28,719 INFO L290 TraceCheckUtils]: 13: Hoare triple {296#false} havoc main_~x~0#1;main_~x~0#1 := 0; {296#false} is VALID [2022-02-20 14:04:28,719 INFO L290 TraceCheckUtils]: 12: Hoare triple {296#false} assume !(main_~i~0#1 < 100000); {296#false} is VALID [2022-02-20 14:04:28,720 INFO L290 TraceCheckUtils]: 11: Hoare triple {296#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {296#false} is VALID [2022-02-20 14:04:28,720 INFO L290 TraceCheckUtils]: 10: Hoare triple {296#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {296#false} is VALID [2022-02-20 14:04:28,720 INFO L290 TraceCheckUtils]: 9: Hoare triple {296#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {296#false} is VALID [2022-02-20 14:04:28,720 INFO L290 TraceCheckUtils]: 8: Hoare triple {296#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {296#false} is VALID [2022-02-20 14:04:28,720 INFO L290 TraceCheckUtils]: 7: Hoare triple {296#false} main_~i~0#1 := 0; {296#false} is VALID [2022-02-20 14:04:28,721 INFO L290 TraceCheckUtils]: 6: Hoare triple {384#(< |ULTIMATE.start_main_~i~0#1| 100000)} assume !(main_~i~0#1 < 100000); {296#false} is VALID [2022-02-20 14:04:28,722 INFO L290 TraceCheckUtils]: 5: Hoare triple {388#(< |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; {384#(< |ULTIMATE.start_main_~i~0#1| 100000)} is VALID [2022-02-20 14:04:28,733 INFO L290 TraceCheckUtils]: 4: Hoare triple {392#(< |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; {388#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:04:28,734 INFO L290 TraceCheckUtils]: 3: Hoare triple {396#(< |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; {392#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:04:28,735 INFO L290 TraceCheckUtils]: 2: Hoare triple {400#(< |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; {396#(< |ULTIMATE.start_main_~i~0#1| 99997)} is VALID [2022-02-20 14:04:28,736 INFO L290 TraceCheckUtils]: 1: Hoare triple {295#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; {400#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-20 14:04:28,736 INFO L290 TraceCheckUtils]: 0: Hoare triple {295#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); {295#true} is VALID [2022-02-20 14:04:28,736 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-02-20 14:04:28,737 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1114625474] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:04:28,737 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:04:28,737 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-02-20 14:04:28,737 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925117273] [2022-02-20 14:04:28,737 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:04:28,738 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-20 14:04:28,739 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:04:28,739 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:28,766 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:04:28,766 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 14:04:28,766 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:04:28,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 14:04:28,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-02-20 14:04:28,768 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:28,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:04:28,922 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2022-02-20 14:04:28,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 14:04:28,923 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-20 14:04:28,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:04:28,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:28,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 56 transitions. [2022-02-20 14:04:28,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:28,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 56 transitions. [2022-02-20 14:04:28,928 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 56 transitions. [2022-02-20 14:04:28,987 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:04:28,988 INFO L225 Difference]: With dead ends: 45 [2022-02-20 14:04:28,989 INFO L226 Difference]: Without dead ends: 32 [2022-02-20 14:04:28,990 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 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:28,990 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:04:28,992 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:04:28,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-02-20 14:04:29,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-02-20 14:04:29,013 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:04:29,014 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call 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,014 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call 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,014 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call 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,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:04:29,016 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2022-02-20 14:04:29,016 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2022-02-20 14:04:29,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:04:29,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:04:29,017 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 0 states have call successors, (0), 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:29,017 INFO L87 Difference]: Start difference. First operand has 32 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 0 states have call successors, (0), 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:29,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:04:29,018 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2022-02-20 14:04:29,019 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2022-02-20 14:04:29,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:04:29,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:04:29,019 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:04:29,019 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:04:29,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call 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,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2022-02-20 14:04:29,021 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 17 [2022-02-20 14:04:29,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:04:29,021 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2022-02-20 14:04:29,021 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:29,022 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2022-02-20 14:04:29,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 14:04:29,022 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:04:29,022 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:04:29,042 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-02-20 14:04:29,231 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:29,232 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:04:29,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:04:29,232 INFO L85 PathProgramCache]: Analyzing trace with hash 163359255, now seen corresponding path program 3 times [2022-02-20 14:04:29,232 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:04:29,232 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20037513] [2022-02-20 14:04:29,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:04:29,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:04:29,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:04:29,484 INFO L290 TraceCheckUtils]: 0: Hoare triple {599#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); {599#true} is VALID [2022-02-20 14:04:29,485 INFO L290 TraceCheckUtils]: 1: Hoare triple {599#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; {601#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:04:29,485 INFO L290 TraceCheckUtils]: 2: Hoare triple {601#(= |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; {602#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:04:29,486 INFO L290 TraceCheckUtils]: 3: Hoare triple {602#(<= |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; {603#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:04:29,487 INFO L290 TraceCheckUtils]: 4: Hoare triple {603#(<= |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; {604#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:04:29,488 INFO L290 TraceCheckUtils]: 5: Hoare triple {604#(<= |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; {605#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:04:29,489 INFO L290 TraceCheckUtils]: 6: Hoare triple {605#(<= |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; {606#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:04:29,490 INFO L290 TraceCheckUtils]: 7: Hoare triple {606#(<= |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; {607#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:04:29,490 INFO L290 TraceCheckUtils]: 8: Hoare triple {607#(<= |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; {608#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:04:29,491 INFO L290 TraceCheckUtils]: 9: Hoare triple {608#(<= |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; {609#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:04:29,492 INFO L290 TraceCheckUtils]: 10: Hoare triple {609#(<= |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; {610#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:04:29,493 INFO L290 TraceCheckUtils]: 11: Hoare triple {610#(<= |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; {611#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:04:29,493 INFO L290 TraceCheckUtils]: 12: Hoare triple {611#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !(main_~i~0#1 < 100000); {600#false} is VALID [2022-02-20 14:04:29,493 INFO L290 TraceCheckUtils]: 13: Hoare triple {600#false} main_~i~0#1 := 0; {600#false} is VALID [2022-02-20 14:04:29,493 INFO L290 TraceCheckUtils]: 14: Hoare triple {600#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {600#false} is VALID [2022-02-20 14:04:29,494 INFO L290 TraceCheckUtils]: 15: Hoare triple {600#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {600#false} is VALID [2022-02-20 14:04:29,494 INFO L290 TraceCheckUtils]: 16: Hoare triple {600#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {600#false} is VALID [2022-02-20 14:04:29,494 INFO L290 TraceCheckUtils]: 17: Hoare triple {600#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {600#false} is VALID [2022-02-20 14:04:29,494 INFO L290 TraceCheckUtils]: 18: Hoare triple {600#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {600#false} is VALID [2022-02-20 14:04:29,494 INFO L290 TraceCheckUtils]: 19: Hoare triple {600#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {600#false} is VALID [2022-02-20 14:04:29,494 INFO L290 TraceCheckUtils]: 20: Hoare triple {600#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {600#false} is VALID [2022-02-20 14:04:29,494 INFO L290 TraceCheckUtils]: 21: Hoare triple {600#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {600#false} is VALID [2022-02-20 14:04:29,494 INFO L290 TraceCheckUtils]: 22: Hoare triple {600#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {600#false} is VALID [2022-02-20 14:04:29,494 INFO L290 TraceCheckUtils]: 23: Hoare triple {600#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {600#false} is VALID [2022-02-20 14:04:29,494 INFO L290 TraceCheckUtils]: 24: Hoare triple {600#false} assume !(main_~i~0#1 < 100000); {600#false} is VALID [2022-02-20 14:04:29,495 INFO L290 TraceCheckUtils]: 25: Hoare triple {600#false} havoc main_~x~0#1;main_~x~0#1 := 0; {600#false} is VALID [2022-02-20 14:04:29,495 INFO L290 TraceCheckUtils]: 26: Hoare triple {600#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; {600#false} is VALID [2022-02-20 14:04:29,495 INFO L290 TraceCheckUtils]: 27: Hoare triple {600#false} assume 0 == __VERIFIER_assert_~cond#1; {600#false} is VALID [2022-02-20 14:04:29,495 INFO L290 TraceCheckUtils]: 28: Hoare triple {600#false} assume !false; {600#false} is VALID [2022-02-20 14:04:29,495 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-02-20 14:04:29,495 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:04:29,496 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20037513] [2022-02-20 14:04:29,496 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20037513] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:04:29,496 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390718802] [2022-02-20 14:04:29,496 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 14:04:29,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:04:29,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:04:29,497 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:29,502 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:29,690 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-02-20 14:04:29,691 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:04:29,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 14:04:29,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:04:29,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:04:29,892 INFO L290 TraceCheckUtils]: 0: Hoare triple {599#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); {599#true} is VALID [2022-02-20 14:04:29,893 INFO L290 TraceCheckUtils]: 1: Hoare triple {599#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; {599#true} is VALID [2022-02-20 14:04:29,893 INFO L290 TraceCheckUtils]: 2: Hoare triple {599#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {599#true} is VALID [2022-02-20 14:04:29,893 INFO L290 TraceCheckUtils]: 3: Hoare triple {599#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {599#true} is VALID [2022-02-20 14:04:29,893 INFO L290 TraceCheckUtils]: 4: Hoare triple {599#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {599#true} is VALID [2022-02-20 14:04:29,894 INFO L290 TraceCheckUtils]: 5: Hoare triple {599#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {599#true} is VALID [2022-02-20 14:04:29,894 INFO L290 TraceCheckUtils]: 6: Hoare triple {599#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {599#true} is VALID [2022-02-20 14:04:29,894 INFO L290 TraceCheckUtils]: 7: Hoare triple {599#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {599#true} is VALID [2022-02-20 14:04:29,894 INFO L290 TraceCheckUtils]: 8: Hoare triple {599#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {599#true} is VALID [2022-02-20 14:04:29,894 INFO L290 TraceCheckUtils]: 9: Hoare triple {599#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {599#true} is VALID [2022-02-20 14:04:29,895 INFO L290 TraceCheckUtils]: 10: Hoare triple {599#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {599#true} is VALID [2022-02-20 14:04:29,895 INFO L290 TraceCheckUtils]: 11: Hoare triple {599#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {599#true} is VALID [2022-02-20 14:04:29,895 INFO L290 TraceCheckUtils]: 12: Hoare triple {599#true} assume !(main_~i~0#1 < 100000); {599#true} is VALID [2022-02-20 14:04:29,903 INFO L290 TraceCheckUtils]: 13: Hoare triple {599#true} main_~i~0#1 := 0; {654#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:04:29,905 INFO L290 TraceCheckUtils]: 14: Hoare triple {654#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {602#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:04:29,905 INFO L290 TraceCheckUtils]: 15: Hoare triple {602#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {603#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:04:29,906 INFO L290 TraceCheckUtils]: 16: Hoare triple {603#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {604#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:04:29,907 INFO L290 TraceCheckUtils]: 17: Hoare triple {604#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {605#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:04:29,907 INFO L290 TraceCheckUtils]: 18: Hoare triple {605#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {606#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:04:29,908 INFO L290 TraceCheckUtils]: 19: Hoare triple {606#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {607#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:04:29,909 INFO L290 TraceCheckUtils]: 20: Hoare triple {607#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {608#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:04:29,909 INFO L290 TraceCheckUtils]: 21: Hoare triple {608#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {609#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:04:29,910 INFO L290 TraceCheckUtils]: 22: Hoare triple {609#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {610#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:04:29,911 INFO L290 TraceCheckUtils]: 23: Hoare triple {610#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {611#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:04:29,911 INFO L290 TraceCheckUtils]: 24: Hoare triple {611#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !(main_~i~0#1 < 100000); {600#false} is VALID [2022-02-20 14:04:29,911 INFO L290 TraceCheckUtils]: 25: Hoare triple {600#false} havoc main_~x~0#1;main_~x~0#1 := 0; {600#false} is VALID [2022-02-20 14:04:29,911 INFO L290 TraceCheckUtils]: 26: Hoare triple {600#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; {600#false} is VALID [2022-02-20 14:04:29,912 INFO L290 TraceCheckUtils]: 27: Hoare triple {600#false} assume 0 == __VERIFIER_assert_~cond#1; {600#false} is VALID [2022-02-20 14:04:29,912 INFO L290 TraceCheckUtils]: 28: Hoare triple {600#false} assume !false; {600#false} is VALID [2022-02-20 14:04:29,912 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-02-20 14:04:29,912 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:04:30,241 INFO L290 TraceCheckUtils]: 28: Hoare triple {600#false} assume !false; {600#false} is VALID [2022-02-20 14:04:30,242 INFO L290 TraceCheckUtils]: 27: Hoare triple {600#false} assume 0 == __VERIFIER_assert_~cond#1; {600#false} is VALID [2022-02-20 14:04:30,242 INFO L290 TraceCheckUtils]: 26: Hoare triple {600#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; {600#false} is VALID [2022-02-20 14:04:30,242 INFO L290 TraceCheckUtils]: 25: Hoare triple {600#false} havoc main_~x~0#1;main_~x~0#1 := 0; {600#false} is VALID [2022-02-20 14:04:30,243 INFO L290 TraceCheckUtils]: 24: Hoare triple {712#(< |ULTIMATE.start_main_~i~0#1| 100000)} assume !(main_~i~0#1 < 100000); {600#false} is VALID [2022-02-20 14:04:30,244 INFO L290 TraceCheckUtils]: 23: Hoare triple {716#(< |ULTIMATE.start_main_~i~0#1| 99999)} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {712#(< |ULTIMATE.start_main_~i~0#1| 100000)} is VALID [2022-02-20 14:04:30,245 INFO L290 TraceCheckUtils]: 22: Hoare triple {720#(< |ULTIMATE.start_main_~i~0#1| 99998)} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {716#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:04:30,245 INFO L290 TraceCheckUtils]: 21: Hoare triple {724#(< |ULTIMATE.start_main_~i~0#1| 99997)} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {720#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:04:30,246 INFO L290 TraceCheckUtils]: 20: Hoare triple {728#(< |ULTIMATE.start_main_~i~0#1| 99996)} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {724#(< |ULTIMATE.start_main_~i~0#1| 99997)} is VALID [2022-02-20 14:04:30,247 INFO L290 TraceCheckUtils]: 19: Hoare triple {732#(< |ULTIMATE.start_main_~i~0#1| 99995)} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {728#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-20 14:04:30,248 INFO L290 TraceCheckUtils]: 18: Hoare triple {736#(< |ULTIMATE.start_main_~i~0#1| 99994)} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {732#(< |ULTIMATE.start_main_~i~0#1| 99995)} is VALID [2022-02-20 14:04:30,248 INFO L290 TraceCheckUtils]: 17: Hoare triple {740#(< |ULTIMATE.start_main_~i~0#1| 99993)} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {736#(< |ULTIMATE.start_main_~i~0#1| 99994)} is VALID [2022-02-20 14:04:30,249 INFO L290 TraceCheckUtils]: 16: Hoare triple {744#(< |ULTIMATE.start_main_~i~0#1| 99992)} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {740#(< |ULTIMATE.start_main_~i~0#1| 99993)} is VALID [2022-02-20 14:04:30,250 INFO L290 TraceCheckUtils]: 15: Hoare triple {748#(< |ULTIMATE.start_main_~i~0#1| 99991)} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {744#(< |ULTIMATE.start_main_~i~0#1| 99992)} is VALID [2022-02-20 14:04:30,251 INFO L290 TraceCheckUtils]: 14: Hoare triple {752#(< |ULTIMATE.start_main_~i~0#1| 99990)} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {748#(< |ULTIMATE.start_main_~i~0#1| 99991)} is VALID [2022-02-20 14:04:30,251 INFO L290 TraceCheckUtils]: 13: Hoare triple {599#true} main_~i~0#1 := 0; {752#(< |ULTIMATE.start_main_~i~0#1| 99990)} is VALID [2022-02-20 14:04:30,251 INFO L290 TraceCheckUtils]: 12: Hoare triple {599#true} assume !(main_~i~0#1 < 100000); {599#true} is VALID [2022-02-20 14:04:30,252 INFO L290 TraceCheckUtils]: 11: Hoare triple {599#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {599#true} is VALID [2022-02-20 14:04:30,252 INFO L290 TraceCheckUtils]: 10: Hoare triple {599#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {599#true} is VALID [2022-02-20 14:04:30,252 INFO L290 TraceCheckUtils]: 9: Hoare triple {599#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {599#true} is VALID [2022-02-20 14:04:30,252 INFO L290 TraceCheckUtils]: 8: Hoare triple {599#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {599#true} is VALID [2022-02-20 14:04:30,252 INFO L290 TraceCheckUtils]: 7: Hoare triple {599#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {599#true} is VALID [2022-02-20 14:04:30,252 INFO L290 TraceCheckUtils]: 6: Hoare triple {599#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {599#true} is VALID [2022-02-20 14:04:30,253 INFO L290 TraceCheckUtils]: 5: Hoare triple {599#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {599#true} is VALID [2022-02-20 14:04:30,253 INFO L290 TraceCheckUtils]: 4: Hoare triple {599#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {599#true} is VALID [2022-02-20 14:04:30,253 INFO L290 TraceCheckUtils]: 3: Hoare triple {599#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {599#true} is VALID [2022-02-20 14:04:30,253 INFO L290 TraceCheckUtils]: 2: Hoare triple {599#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {599#true} is VALID [2022-02-20 14:04:30,253 INFO L290 TraceCheckUtils]: 1: Hoare triple {599#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; {599#true} is VALID [2022-02-20 14:04:30,254 INFO L290 TraceCheckUtils]: 0: Hoare triple {599#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); {599#true} is VALID [2022-02-20 14:04:30,254 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-02-20 14:04:30,254 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1390718802] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:04:30,254 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:04:30,255 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2022-02-20 14:04:30,255 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18608125] [2022-02-20 14:04:30,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:04:30,256 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.88) internal successors, (47), 25 states have internal predecessors, (47), 0 states have call successors, (0), 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:30,256 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:04:30,256 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 1.88) internal successors, (47), 25 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call 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,297 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:04:30,297 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-02-20 14:04:30,298 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:04:30,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-02-20 14:04:30,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2022-02-20 14:04:30,299 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 25 states, 25 states have (on average 1.88) internal successors, (47), 25 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call 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,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:04:30,655 INFO L93 Difference]: Finished difference Result 75 states and 102 transitions. [2022-02-20 14:04:30,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-02-20 14:04:30,655 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.88) internal successors, (47), 25 states have internal predecessors, (47), 0 states have call successors, (0), 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:30,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:04:30,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.88) internal successors, (47), 25 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call 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,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 92 transitions. [2022-02-20 14:04:30,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.88) internal successors, (47), 25 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call 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,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 92 transitions. [2022-02-20 14:04:30,659 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 92 transitions. [2022-02-20 14:04:30,739 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:04:30,740 INFO L225 Difference]: With dead ends: 75 [2022-02-20 14:04:30,740 INFO L226 Difference]: Without dead ends: 56 [2022-02-20 14:04:30,741 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 46 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:30,741 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:04:30,742 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:04:30,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-02-20 14:04:30,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-02-20 14:04:30,778 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:04:30,778 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 56 states, 55 states have (on average 1.0545454545454545) internal successors, (58), 55 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call 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,779 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 56 states, 55 states have (on average 1.0545454545454545) internal successors, (58), 55 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call 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,779 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 56 states, 55 states have (on average 1.0545454545454545) internal successors, (58), 55 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call 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,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:04:30,781 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2022-02-20 14:04:30,781 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2022-02-20 14:04:30,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:04:30,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:04:30,782 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 55 states have (on average 1.0545454545454545) internal successors, (58), 55 states have internal predecessors, (58), 0 states have call successors, (0), 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:30,782 INFO L87 Difference]: Start difference. First operand has 56 states, 55 states have (on average 1.0545454545454545) internal successors, (58), 55 states have internal predecessors, (58), 0 states have call successors, (0), 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:30,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:04:30,784 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2022-02-20 14:04:30,785 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2022-02-20 14:04:30,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:04:30,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:04:30,785 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:04:30,785 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:04:30,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.0545454545454545) internal successors, (58), 55 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call 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,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2022-02-20 14:04:30,788 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 29 [2022-02-20 14:04:30,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:04:30,788 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2022-02-20 14:04:30,788 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.88) internal successors, (47), 25 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call 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,788 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2022-02-20 14:04:30,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-20 14:04:30,790 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:04:30,790 INFO L514 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:04:30,815 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:31,007 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:31,008 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:04:31,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:04:31,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1745445335, now seen corresponding path program 4 times [2022-02-20 14:04:31,008 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:04:31,008 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622751343] [2022-02-20 14:04:31,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:04:31,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:04:31,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:04:31,455 INFO L290 TraceCheckUtils]: 0: Hoare triple {1143#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); {1143#true} is VALID [2022-02-20 14:04:31,456 INFO L290 TraceCheckUtils]: 1: Hoare triple {1143#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; {1145#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:04:31,457 INFO L290 TraceCheckUtils]: 2: Hoare triple {1145#(= |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; {1146#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:04:31,458 INFO L290 TraceCheckUtils]: 3: Hoare triple {1146#(<= |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; {1147#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:04:31,458 INFO L290 TraceCheckUtils]: 4: Hoare triple {1147#(<= |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; {1148#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:04:31,460 INFO L290 TraceCheckUtils]: 5: Hoare triple {1148#(<= |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; {1149#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:04:31,460 INFO L290 TraceCheckUtils]: 6: Hoare triple {1149#(<= |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; {1150#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:04:31,461 INFO L290 TraceCheckUtils]: 7: Hoare triple {1150#(<= |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; {1151#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:04:31,465 INFO L290 TraceCheckUtils]: 8: Hoare triple {1151#(<= |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; {1152#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:04:31,465 INFO L290 TraceCheckUtils]: 9: Hoare triple {1152#(<= |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; {1153#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:04:31,466 INFO L290 TraceCheckUtils]: 10: Hoare triple {1153#(<= |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; {1154#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:04:31,466 INFO L290 TraceCheckUtils]: 11: Hoare triple {1154#(<= |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; {1155#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:04:31,467 INFO L290 TraceCheckUtils]: 12: Hoare triple {1155#(<= |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; {1156#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-20 14:04:31,468 INFO L290 TraceCheckUtils]: 13: Hoare triple {1156#(<= |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; {1157#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 14:04:31,469 INFO L290 TraceCheckUtils]: 14: Hoare triple {1157#(<= |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; {1158#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-20 14:04:31,469 INFO L290 TraceCheckUtils]: 15: Hoare triple {1158#(<= |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; {1159#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 14:04:31,470 INFO L290 TraceCheckUtils]: 16: Hoare triple {1159#(<= |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; {1160#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-20 14:04:31,471 INFO L290 TraceCheckUtils]: 17: Hoare triple {1160#(<= |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; {1161#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 14:04:31,471 INFO L290 TraceCheckUtils]: 18: Hoare triple {1161#(<= |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; {1162#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-20 14:04:31,472 INFO L290 TraceCheckUtils]: 19: Hoare triple {1162#(<= |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; {1163#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 14:04:31,472 INFO L290 TraceCheckUtils]: 20: Hoare triple {1163#(<= |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; {1164#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-20 14:04:31,473 INFO L290 TraceCheckUtils]: 21: Hoare triple {1164#(<= |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; {1165#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 14:04:31,474 INFO L290 TraceCheckUtils]: 22: Hoare triple {1165#(<= |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; {1166#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-20 14:04:31,474 INFO L290 TraceCheckUtils]: 23: Hoare triple {1166#(<= |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; {1167#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-20 14:04:31,483 INFO L290 TraceCheckUtils]: 24: Hoare triple {1167#(<= |ULTIMATE.start_main_~i~0#1| 22)} assume !(main_~i~0#1 < 100000); {1144#false} is VALID [2022-02-20 14:04:31,483 INFO L290 TraceCheckUtils]: 25: Hoare triple {1144#false} main_~i~0#1 := 0; {1144#false} is VALID [2022-02-20 14:04:31,483 INFO L290 TraceCheckUtils]: 26: Hoare triple {1144#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1144#false} is VALID [2022-02-20 14:04:31,483 INFO L290 TraceCheckUtils]: 27: Hoare triple {1144#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1144#false} is VALID [2022-02-20 14:04:31,483 INFO L290 TraceCheckUtils]: 28: Hoare triple {1144#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1144#false} is VALID [2022-02-20 14:04:31,483 INFO L290 TraceCheckUtils]: 29: Hoare triple {1144#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1144#false} is VALID [2022-02-20 14:04:31,483 INFO L290 TraceCheckUtils]: 30: Hoare triple {1144#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1144#false} is VALID [2022-02-20 14:04:31,483 INFO L290 TraceCheckUtils]: 31: Hoare triple {1144#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1144#false} is VALID [2022-02-20 14:04:31,484 INFO L290 TraceCheckUtils]: 32: Hoare triple {1144#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1144#false} is VALID [2022-02-20 14:04:31,484 INFO L290 TraceCheckUtils]: 33: Hoare triple {1144#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1144#false} is VALID [2022-02-20 14:04:31,484 INFO L290 TraceCheckUtils]: 34: Hoare triple {1144#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1144#false} is VALID [2022-02-20 14:04:31,484 INFO L290 TraceCheckUtils]: 35: Hoare triple {1144#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1144#false} is VALID [2022-02-20 14:04:31,484 INFO L290 TraceCheckUtils]: 36: Hoare triple {1144#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1144#false} is VALID [2022-02-20 14:04:31,484 INFO L290 TraceCheckUtils]: 37: Hoare triple {1144#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1144#false} is VALID [2022-02-20 14:04:31,484 INFO L290 TraceCheckUtils]: 38: Hoare triple {1144#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1144#false} is VALID [2022-02-20 14:04:31,484 INFO L290 TraceCheckUtils]: 39: Hoare triple {1144#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1144#false} is VALID [2022-02-20 14:04:31,484 INFO L290 TraceCheckUtils]: 40: Hoare triple {1144#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1144#false} is VALID [2022-02-20 14:04:31,484 INFO L290 TraceCheckUtils]: 41: Hoare triple {1144#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1144#false} is VALID [2022-02-20 14:04:31,484 INFO L290 TraceCheckUtils]: 42: Hoare triple {1144#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1144#false} is VALID [2022-02-20 14:04:31,484 INFO L290 TraceCheckUtils]: 43: Hoare triple {1144#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1144#false} is VALID [2022-02-20 14:04:31,485 INFO L290 TraceCheckUtils]: 44: Hoare triple {1144#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1144#false} is VALID [2022-02-20 14:04:31,485 INFO L290 TraceCheckUtils]: 45: Hoare triple {1144#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1144#false} is VALID [2022-02-20 14:04:31,485 INFO L290 TraceCheckUtils]: 46: Hoare triple {1144#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1144#false} is VALID [2022-02-20 14:04:31,485 INFO L290 TraceCheckUtils]: 47: Hoare triple {1144#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1144#false} is VALID [2022-02-20 14:04:31,485 INFO L290 TraceCheckUtils]: 48: Hoare triple {1144#false} assume !(main_~i~0#1 < 100000); {1144#false} is VALID [2022-02-20 14:04:31,485 INFO L290 TraceCheckUtils]: 49: Hoare triple {1144#false} havoc main_~x~0#1;main_~x~0#1 := 0; {1144#false} is VALID [2022-02-20 14:04:31,485 INFO L290 TraceCheckUtils]: 50: Hoare triple {1144#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; {1144#false} is VALID [2022-02-20 14:04:31,485 INFO L290 TraceCheckUtils]: 51: Hoare triple {1144#false} assume 0 == __VERIFIER_assert_~cond#1; {1144#false} is VALID [2022-02-20 14:04:31,485 INFO L290 TraceCheckUtils]: 52: Hoare triple {1144#false} assume !false; {1144#false} is VALID [2022-02-20 14:04:31,487 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2022-02-20 14:04:31,487 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:04:31,487 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622751343] [2022-02-20 14:04:31,487 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622751343] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:04:31,487 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1985957318] [2022-02-20 14:04:31,487 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-20 14:04:31,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:04:31,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:04:31,490 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:31,491 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:31,617 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-20 14:04:31,617 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:04:31,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 24 conjunts are in the unsatisfiable core [2022-02-20 14:04:31,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:04:31,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:04:32,039 INFO L290 TraceCheckUtils]: 0: Hoare triple {1143#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); {1143#true} is VALID [2022-02-20 14:04:32,040 INFO L290 TraceCheckUtils]: 1: Hoare triple {1143#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; {1174#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:04:32,041 INFO L290 TraceCheckUtils]: 2: Hoare triple {1174#(<= |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; {1146#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:04:32,041 INFO L290 TraceCheckUtils]: 3: Hoare triple {1146#(<= |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; {1147#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:04:32,042 INFO L290 TraceCheckUtils]: 4: Hoare triple {1147#(<= |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; {1148#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:04:32,042 INFO L290 TraceCheckUtils]: 5: Hoare triple {1148#(<= |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; {1149#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:04:32,043 INFO L290 TraceCheckUtils]: 6: Hoare triple {1149#(<= |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; {1150#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:04:32,044 INFO L290 TraceCheckUtils]: 7: Hoare triple {1150#(<= |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; {1151#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:04:32,044 INFO L290 TraceCheckUtils]: 8: Hoare triple {1151#(<= |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; {1152#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:04:32,045 INFO L290 TraceCheckUtils]: 9: Hoare triple {1152#(<= |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; {1153#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:04:32,045 INFO L290 TraceCheckUtils]: 10: Hoare triple {1153#(<= |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; {1154#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:04:32,046 INFO L290 TraceCheckUtils]: 11: Hoare triple {1154#(<= |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; {1155#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:04:32,046 INFO L290 TraceCheckUtils]: 12: Hoare triple {1155#(<= |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; {1156#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-20 14:04:32,047 INFO L290 TraceCheckUtils]: 13: Hoare triple {1156#(<= |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; {1157#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 14:04:32,048 INFO L290 TraceCheckUtils]: 14: Hoare triple {1157#(<= |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; {1158#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-20 14:04:32,048 INFO L290 TraceCheckUtils]: 15: Hoare triple {1158#(<= |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; {1159#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 14:04:32,049 INFO L290 TraceCheckUtils]: 16: Hoare triple {1159#(<= |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; {1160#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-20 14:04:32,051 INFO L290 TraceCheckUtils]: 17: Hoare triple {1160#(<= |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; {1161#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 14:04:32,054 INFO L290 TraceCheckUtils]: 18: Hoare triple {1161#(<= |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; {1162#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-20 14:04:32,055 INFO L290 TraceCheckUtils]: 19: Hoare triple {1162#(<= |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; {1163#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 14:04:32,057 INFO L290 TraceCheckUtils]: 20: Hoare triple {1163#(<= |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; {1164#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-20 14:04:32,058 INFO L290 TraceCheckUtils]: 21: Hoare triple {1164#(<= |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; {1165#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 14:04:32,061 INFO L290 TraceCheckUtils]: 22: Hoare triple {1165#(<= |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; {1166#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-20 14:04:32,061 INFO L290 TraceCheckUtils]: 23: Hoare triple {1166#(<= |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; {1167#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-20 14:04:32,062 INFO L290 TraceCheckUtils]: 24: Hoare triple {1167#(<= |ULTIMATE.start_main_~i~0#1| 22)} assume !(main_~i~0#1 < 100000); {1144#false} is VALID [2022-02-20 14:04:32,062 INFO L290 TraceCheckUtils]: 25: Hoare triple {1144#false} main_~i~0#1 := 0; {1144#false} is VALID [2022-02-20 14:04:32,062 INFO L290 TraceCheckUtils]: 26: Hoare triple {1144#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1144#false} is VALID [2022-02-20 14:04:32,062 INFO L290 TraceCheckUtils]: 27: Hoare triple {1144#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1144#false} is VALID [2022-02-20 14:04:32,062 INFO L290 TraceCheckUtils]: 28: Hoare triple {1144#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1144#false} is VALID [2022-02-20 14:04:32,062 INFO L290 TraceCheckUtils]: 29: Hoare triple {1144#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1144#false} is VALID [2022-02-20 14:04:32,063 INFO L290 TraceCheckUtils]: 30: Hoare triple {1144#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1144#false} is VALID [2022-02-20 14:04:32,063 INFO L290 TraceCheckUtils]: 31: Hoare triple {1144#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1144#false} is VALID [2022-02-20 14:04:32,063 INFO L290 TraceCheckUtils]: 32: Hoare triple {1144#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1144#false} is VALID [2022-02-20 14:04:32,063 INFO L290 TraceCheckUtils]: 33: Hoare triple {1144#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1144#false} is VALID [2022-02-20 14:04:32,063 INFO L290 TraceCheckUtils]: 34: Hoare triple {1144#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1144#false} is VALID [2022-02-20 14:04:32,063 INFO L290 TraceCheckUtils]: 35: Hoare triple {1144#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1144#false} is VALID [2022-02-20 14:04:32,063 INFO L290 TraceCheckUtils]: 36: Hoare triple {1144#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1144#false} is VALID [2022-02-20 14:04:32,063 INFO L290 TraceCheckUtils]: 37: Hoare triple {1144#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1144#false} is VALID [2022-02-20 14:04:32,064 INFO L290 TraceCheckUtils]: 38: Hoare triple {1144#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1144#false} is VALID [2022-02-20 14:04:32,064 INFO L290 TraceCheckUtils]: 39: Hoare triple {1144#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1144#false} is VALID [2022-02-20 14:04:32,064 INFO L290 TraceCheckUtils]: 40: Hoare triple {1144#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1144#false} is VALID [2022-02-20 14:04:32,064 INFO L290 TraceCheckUtils]: 41: Hoare triple {1144#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1144#false} is VALID [2022-02-20 14:04:32,064 INFO L290 TraceCheckUtils]: 42: Hoare triple {1144#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1144#false} is VALID [2022-02-20 14:04:32,064 INFO L290 TraceCheckUtils]: 43: Hoare triple {1144#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1144#false} is VALID [2022-02-20 14:04:32,064 INFO L290 TraceCheckUtils]: 44: Hoare triple {1144#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1144#false} is VALID [2022-02-20 14:04:32,064 INFO L290 TraceCheckUtils]: 45: Hoare triple {1144#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1144#false} is VALID [2022-02-20 14:04:32,065 INFO L290 TraceCheckUtils]: 46: Hoare triple {1144#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1144#false} is VALID [2022-02-20 14:04:32,065 INFO L290 TraceCheckUtils]: 47: Hoare triple {1144#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1144#false} is VALID [2022-02-20 14:04:32,065 INFO L290 TraceCheckUtils]: 48: Hoare triple {1144#false} assume !(main_~i~0#1 < 100000); {1144#false} is VALID [2022-02-20 14:04:32,065 INFO L290 TraceCheckUtils]: 49: Hoare triple {1144#false} havoc main_~x~0#1;main_~x~0#1 := 0; {1144#false} is VALID [2022-02-20 14:04:32,065 INFO L290 TraceCheckUtils]: 50: Hoare triple {1144#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; {1144#false} is VALID [2022-02-20 14:04:32,065 INFO L290 TraceCheckUtils]: 51: Hoare triple {1144#false} assume 0 == __VERIFIER_assert_~cond#1; {1144#false} is VALID [2022-02-20 14:04:32,065 INFO L290 TraceCheckUtils]: 52: Hoare triple {1144#false} assume !false; {1144#false} is VALID [2022-02-20 14:04:32,066 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2022-02-20 14:04:32,066 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:04:33,069 INFO L290 TraceCheckUtils]: 52: Hoare triple {1144#false} assume !false; {1144#false} is VALID [2022-02-20 14:04:33,069 INFO L290 TraceCheckUtils]: 51: Hoare triple {1144#false} assume 0 == __VERIFIER_assert_~cond#1; {1144#false} is VALID [2022-02-20 14:04:33,069 INFO L290 TraceCheckUtils]: 50: Hoare triple {1144#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; {1144#false} is VALID [2022-02-20 14:04:33,069 INFO L290 TraceCheckUtils]: 49: Hoare triple {1144#false} havoc main_~x~0#1;main_~x~0#1 := 0; {1144#false} is VALID [2022-02-20 14:04:33,069 INFO L290 TraceCheckUtils]: 48: Hoare triple {1144#false} assume !(main_~i~0#1 < 100000); {1144#false} is VALID [2022-02-20 14:04:33,070 INFO L290 TraceCheckUtils]: 47: Hoare triple {1144#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1144#false} is VALID [2022-02-20 14:04:33,070 INFO L290 TraceCheckUtils]: 46: Hoare triple {1144#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1144#false} is VALID [2022-02-20 14:04:33,070 INFO L290 TraceCheckUtils]: 45: Hoare triple {1144#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1144#false} is VALID [2022-02-20 14:04:33,070 INFO L290 TraceCheckUtils]: 44: Hoare triple {1144#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1144#false} is VALID [2022-02-20 14:04:33,071 INFO L290 TraceCheckUtils]: 43: Hoare triple {1144#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1144#false} is VALID [2022-02-20 14:04:33,071 INFO L290 TraceCheckUtils]: 42: Hoare triple {1144#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1144#false} is VALID [2022-02-20 14:04:33,072 INFO L290 TraceCheckUtils]: 41: Hoare triple {1144#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1144#false} is VALID [2022-02-20 14:04:33,072 INFO L290 TraceCheckUtils]: 40: Hoare triple {1144#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1144#false} is VALID [2022-02-20 14:04:33,072 INFO L290 TraceCheckUtils]: 39: Hoare triple {1144#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1144#false} is VALID [2022-02-20 14:04:33,073 INFO L290 TraceCheckUtils]: 38: Hoare triple {1144#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1144#false} is VALID [2022-02-20 14:04:33,073 INFO L290 TraceCheckUtils]: 37: Hoare triple {1144#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1144#false} is VALID [2022-02-20 14:04:33,073 INFO L290 TraceCheckUtils]: 36: Hoare triple {1144#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1144#false} is VALID [2022-02-20 14:04:33,073 INFO L290 TraceCheckUtils]: 35: Hoare triple {1144#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1144#false} is VALID [2022-02-20 14:04:33,073 INFO L290 TraceCheckUtils]: 34: Hoare triple {1144#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1144#false} is VALID [2022-02-20 14:04:33,073 INFO L290 TraceCheckUtils]: 33: Hoare triple {1144#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1144#false} is VALID [2022-02-20 14:04:33,074 INFO L290 TraceCheckUtils]: 32: Hoare triple {1144#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1144#false} is VALID [2022-02-20 14:04:33,074 INFO L290 TraceCheckUtils]: 31: Hoare triple {1144#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1144#false} is VALID [2022-02-20 14:04:33,074 INFO L290 TraceCheckUtils]: 30: Hoare triple {1144#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1144#false} is VALID [2022-02-20 14:04:33,074 INFO L290 TraceCheckUtils]: 29: Hoare triple {1144#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1144#false} is VALID [2022-02-20 14:04:33,074 INFO L290 TraceCheckUtils]: 28: Hoare triple {1144#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1144#false} is VALID [2022-02-20 14:04:33,074 INFO L290 TraceCheckUtils]: 27: Hoare triple {1144#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1144#false} is VALID [2022-02-20 14:04:33,074 INFO L290 TraceCheckUtils]: 26: Hoare triple {1144#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1144#false} is VALID [2022-02-20 14:04:33,075 INFO L290 TraceCheckUtils]: 25: Hoare triple {1144#false} main_~i~0#1 := 0; {1144#false} is VALID [2022-02-20 14:04:33,076 INFO L290 TraceCheckUtils]: 24: Hoare triple {1412#(< |ULTIMATE.start_main_~i~0#1| 100000)} assume !(main_~i~0#1 < 100000); {1144#false} is VALID [2022-02-20 14:04:33,077 INFO L290 TraceCheckUtils]: 23: Hoare triple {1416#(< |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; {1412#(< |ULTIMATE.start_main_~i~0#1| 100000)} is VALID [2022-02-20 14:04:33,077 INFO L290 TraceCheckUtils]: 22: Hoare triple {1420#(< |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; {1416#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:04:33,078 INFO L290 TraceCheckUtils]: 21: Hoare triple {1424#(< |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; {1420#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:04:33,079 INFO L290 TraceCheckUtils]: 20: Hoare triple {1428#(< |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; {1424#(< |ULTIMATE.start_main_~i~0#1| 99997)} is VALID [2022-02-20 14:04:33,079 INFO L290 TraceCheckUtils]: 19: Hoare triple {1432#(< |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; {1428#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-20 14:04:33,080 INFO L290 TraceCheckUtils]: 18: Hoare triple {1436#(< |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; {1432#(< |ULTIMATE.start_main_~i~0#1| 99995)} is VALID [2022-02-20 14:04:33,080 INFO L290 TraceCheckUtils]: 17: Hoare triple {1440#(< |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; {1436#(< |ULTIMATE.start_main_~i~0#1| 99994)} is VALID [2022-02-20 14:04:33,081 INFO L290 TraceCheckUtils]: 16: Hoare triple {1444#(< |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; {1440#(< |ULTIMATE.start_main_~i~0#1| 99993)} is VALID [2022-02-20 14:04:33,082 INFO L290 TraceCheckUtils]: 15: Hoare triple {1448#(< |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; {1444#(< |ULTIMATE.start_main_~i~0#1| 99992)} is VALID [2022-02-20 14:04:33,083 INFO L290 TraceCheckUtils]: 14: Hoare triple {1452#(< |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; {1448#(< |ULTIMATE.start_main_~i~0#1| 99991)} is VALID [2022-02-20 14:04:33,084 INFO L290 TraceCheckUtils]: 13: Hoare triple {1456#(< |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; {1452#(< |ULTIMATE.start_main_~i~0#1| 99990)} is VALID [2022-02-20 14:04:33,084 INFO L290 TraceCheckUtils]: 12: Hoare triple {1460#(< |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; {1456#(< |ULTIMATE.start_main_~i~0#1| 99989)} is VALID [2022-02-20 14:04:33,085 INFO L290 TraceCheckUtils]: 11: Hoare triple {1464#(< |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; {1460#(< |ULTIMATE.start_main_~i~0#1| 99988)} is VALID [2022-02-20 14:04:33,086 INFO L290 TraceCheckUtils]: 10: Hoare triple {1468#(< |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; {1464#(< |ULTIMATE.start_main_~i~0#1| 99987)} is VALID [2022-02-20 14:04:33,086 INFO L290 TraceCheckUtils]: 9: Hoare triple {1472#(< |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; {1468#(< |ULTIMATE.start_main_~i~0#1| 99986)} is VALID [2022-02-20 14:04:33,087 INFO L290 TraceCheckUtils]: 8: Hoare triple {1476#(< |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; {1472#(< |ULTIMATE.start_main_~i~0#1| 99985)} is VALID [2022-02-20 14:04:33,088 INFO L290 TraceCheckUtils]: 7: Hoare triple {1480#(< |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; {1476#(< |ULTIMATE.start_main_~i~0#1| 99984)} is VALID [2022-02-20 14:04:33,089 INFO L290 TraceCheckUtils]: 6: Hoare triple {1484#(< |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; {1480#(< |ULTIMATE.start_main_~i~0#1| 99983)} is VALID [2022-02-20 14:04:33,090 INFO L290 TraceCheckUtils]: 5: Hoare triple {1488#(< |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; {1484#(< |ULTIMATE.start_main_~i~0#1| 99982)} is VALID [2022-02-20 14:04:33,090 INFO L290 TraceCheckUtils]: 4: Hoare triple {1492#(< |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; {1488#(< |ULTIMATE.start_main_~i~0#1| 99981)} is VALID [2022-02-20 14:04:33,091 INFO L290 TraceCheckUtils]: 3: Hoare triple {1496#(< |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; {1492#(< |ULTIMATE.start_main_~i~0#1| 99980)} is VALID [2022-02-20 14:04:33,092 INFO L290 TraceCheckUtils]: 2: Hoare triple {1500#(< |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; {1496#(< |ULTIMATE.start_main_~i~0#1| 99979)} is VALID [2022-02-20 14:04:33,092 INFO L290 TraceCheckUtils]: 1: Hoare triple {1143#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; {1500#(< |ULTIMATE.start_main_~i~0#1| 99978)} is VALID [2022-02-20 14:04:33,092 INFO L290 TraceCheckUtils]: 0: Hoare triple {1143#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); {1143#true} is VALID [2022-02-20 14:04:33,094 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2022-02-20 14:04:33,094 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1985957318] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:04:33,094 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:04:33,094 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2022-02-20 14:04:33,095 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207440932] [2022-02-20 14:04:33,095 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:04:33,097 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.183673469387755) internal successors, (58), 49 states have internal predecessors, (58), 0 states have call successors, (0), 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:04:33,097 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:04:33,098 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 49 states, 49 states have (on average 1.183673469387755) internal successors, (58), 49 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call 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:33,134 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:04:33,134 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-02-20 14:04:33,134 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:04:33,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-02-20 14:04:33,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2022-02-20 14:04:33,136 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand has 49 states, 49 states have (on average 1.183673469387755) internal successors, (58), 49 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call 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:33,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:04:33,716 INFO L93 Difference]: Finished difference Result 135 states and 186 transitions. [2022-02-20 14:04:33,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-02-20 14:04:33,717 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.183673469387755) internal successors, (58), 49 states have internal predecessors, (58), 0 states have call successors, (0), 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:04:33,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:04:33,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.183673469387755) internal successors, (58), 49 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call 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:33,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 164 transitions. [2022-02-20 14:04:33,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.183673469387755) internal successors, (58), 49 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call 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:33,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 164 transitions. [2022-02-20 14:04:33,724 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 164 transitions. [2022-02-20 14:04:33,833 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:04:33,836 INFO L225 Difference]: With dead ends: 135 [2022-02-20 14:04:33,836 INFO L226 Difference]: Without dead ends: 104 [2022-02-20 14:04:33,837 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 82 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:33,838 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 14:04:33,839 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 14:04:33,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-02-20 14:04:33,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2022-02-20 14:04:33,910 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:04:33,911 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand has 104 states, 103 states have (on average 1.029126213592233) internal successors, (106), 103 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call 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:33,911 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand has 104 states, 103 states have (on average 1.029126213592233) internal successors, (106), 103 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call 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:33,911 INFO L87 Difference]: Start difference. First operand 104 states. Second operand has 104 states, 103 states have (on average 1.029126213592233) internal successors, (106), 103 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call 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:33,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:04:33,914 INFO L93 Difference]: Finished difference Result 104 states and 106 transitions. [2022-02-20 14:04:33,915 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 106 transitions. [2022-02-20 14:04:33,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:04:33,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:04:33,916 INFO L74 IsIncluded]: Start isIncluded. First operand has 104 states, 103 states have (on average 1.029126213592233) internal successors, (106), 103 states have internal predecessors, (106), 0 states have call successors, (0), 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:04:33,916 INFO L87 Difference]: Start difference. First operand has 104 states, 103 states have (on average 1.029126213592233) internal successors, (106), 103 states have internal predecessors, (106), 0 states have call successors, (0), 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:04:33,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:04:33,919 INFO L93 Difference]: Finished difference Result 104 states and 106 transitions. [2022-02-20 14:04:33,919 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 106 transitions. [2022-02-20 14:04:33,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:04:33,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:04:33,920 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:04:33,920 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:04:33,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.029126213592233) internal successors, (106), 103 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call 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:33,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 106 transitions. [2022-02-20 14:04:33,924 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 106 transitions. Word has length 53 [2022-02-20 14:04:33,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:04:33,924 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 106 transitions. [2022-02-20 14:04:33,925 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.183673469387755) internal successors, (58), 49 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call 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:33,925 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 106 transitions. [2022-02-20 14:04:33,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-02-20 14:04:33,927 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:04:33,927 INFO L514 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:04:33,957 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:34,143 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:34,144 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:04:34,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:04:34,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1914155351, now seen corresponding path program 5 times [2022-02-20 14:04:34,144 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:04:34,144 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602856928] [2022-02-20 14:04:34,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:04:34,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:04:34,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:04:35,277 INFO L290 TraceCheckUtils]: 0: Hoare triple {2167#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); {2167#true} is VALID [2022-02-20 14:04:35,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {2167#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; {2169#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:04:35,279 INFO L290 TraceCheckUtils]: 2: Hoare triple {2169#(= |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; {2170#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:04:35,280 INFO L290 TraceCheckUtils]: 3: Hoare triple {2170#(<= |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; {2171#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:04:35,280 INFO L290 TraceCheckUtils]: 4: Hoare triple {2171#(<= |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; {2172#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:04:35,281 INFO L290 TraceCheckUtils]: 5: Hoare triple {2172#(<= |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; {2173#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:04:35,281 INFO L290 TraceCheckUtils]: 6: Hoare triple {2173#(<= |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; {2174#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:04:35,282 INFO L290 TraceCheckUtils]: 7: Hoare triple {2174#(<= |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; {2175#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:04:35,282 INFO L290 TraceCheckUtils]: 8: Hoare triple {2175#(<= |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; {2176#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:04:35,283 INFO L290 TraceCheckUtils]: 9: Hoare triple {2176#(<= |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; {2177#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:04:35,283 INFO L290 TraceCheckUtils]: 10: Hoare triple {2177#(<= |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; {2178#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:04:35,284 INFO L290 TraceCheckUtils]: 11: Hoare triple {2178#(<= |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; {2179#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:04:35,284 INFO L290 TraceCheckUtils]: 12: Hoare triple {2179#(<= |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; {2180#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-20 14:04:35,285 INFO L290 TraceCheckUtils]: 13: Hoare triple {2180#(<= |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; {2181#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 14:04:35,285 INFO L290 TraceCheckUtils]: 14: Hoare triple {2181#(<= |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; {2182#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-20 14:04:35,285 INFO L290 TraceCheckUtils]: 15: Hoare triple {2182#(<= |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; {2183#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 14:04:35,286 INFO L290 TraceCheckUtils]: 16: Hoare triple {2183#(<= |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; {2184#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-20 14:04:35,286 INFO L290 TraceCheckUtils]: 17: Hoare triple {2184#(<= |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; {2185#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 14:04:35,287 INFO L290 TraceCheckUtils]: 18: Hoare triple {2185#(<= |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; {2186#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-20 14:04:35,287 INFO L290 TraceCheckUtils]: 19: Hoare triple {2186#(<= |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; {2187#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 14:04:35,288 INFO L290 TraceCheckUtils]: 20: Hoare triple {2187#(<= |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; {2188#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-20 14:04:35,288 INFO L290 TraceCheckUtils]: 21: Hoare triple {2188#(<= |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; {2189#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 14:04:35,289 INFO L290 TraceCheckUtils]: 22: Hoare triple {2189#(<= |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; {2190#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-20 14:04:35,289 INFO L290 TraceCheckUtils]: 23: Hoare triple {2190#(<= |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; {2191#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-20 14:04:35,290 INFO L290 TraceCheckUtils]: 24: Hoare triple {2191#(<= |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; {2192#(<= |ULTIMATE.start_main_~i~0#1| 23)} is VALID [2022-02-20 14:04:35,290 INFO L290 TraceCheckUtils]: 25: Hoare triple {2192#(<= |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; {2193#(<= |ULTIMATE.start_main_~i~0#1| 24)} is VALID [2022-02-20 14:04:35,291 INFO L290 TraceCheckUtils]: 26: Hoare triple {2193#(<= |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; {2194#(<= |ULTIMATE.start_main_~i~0#1| 25)} is VALID [2022-02-20 14:04:35,291 INFO L290 TraceCheckUtils]: 27: Hoare triple {2194#(<= |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; {2195#(<= |ULTIMATE.start_main_~i~0#1| 26)} is VALID [2022-02-20 14:04:35,292 INFO L290 TraceCheckUtils]: 28: Hoare triple {2195#(<= |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; {2196#(<= |ULTIMATE.start_main_~i~0#1| 27)} is VALID [2022-02-20 14:04:35,292 INFO L290 TraceCheckUtils]: 29: Hoare triple {2196#(<= |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; {2197#(<= |ULTIMATE.start_main_~i~0#1| 28)} is VALID [2022-02-20 14:04:35,292 INFO L290 TraceCheckUtils]: 30: Hoare triple {2197#(<= |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; {2198#(<= |ULTIMATE.start_main_~i~0#1| 29)} is VALID [2022-02-20 14:04:35,293 INFO L290 TraceCheckUtils]: 31: Hoare triple {2198#(<= |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; {2199#(<= |ULTIMATE.start_main_~i~0#1| 30)} is VALID [2022-02-20 14:04:35,293 INFO L290 TraceCheckUtils]: 32: Hoare triple {2199#(<= |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; {2200#(<= |ULTIMATE.start_main_~i~0#1| 31)} is VALID [2022-02-20 14:04:35,294 INFO L290 TraceCheckUtils]: 33: Hoare triple {2200#(<= |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; {2201#(<= |ULTIMATE.start_main_~i~0#1| 32)} is VALID [2022-02-20 14:04:35,294 INFO L290 TraceCheckUtils]: 34: Hoare triple {2201#(<= |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; {2202#(<= |ULTIMATE.start_main_~i~0#1| 33)} is VALID [2022-02-20 14:04:35,295 INFO L290 TraceCheckUtils]: 35: Hoare triple {2202#(<= |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; {2203#(<= |ULTIMATE.start_main_~i~0#1| 34)} is VALID [2022-02-20 14:04:35,295 INFO L290 TraceCheckUtils]: 36: Hoare triple {2203#(<= |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; {2204#(<= |ULTIMATE.start_main_~i~0#1| 35)} is VALID [2022-02-20 14:04:35,296 INFO L290 TraceCheckUtils]: 37: Hoare triple {2204#(<= |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; {2205#(<= |ULTIMATE.start_main_~i~0#1| 36)} is VALID [2022-02-20 14:04:35,296 INFO L290 TraceCheckUtils]: 38: Hoare triple {2205#(<= |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; {2206#(<= |ULTIMATE.start_main_~i~0#1| 37)} is VALID [2022-02-20 14:04:35,301 INFO L290 TraceCheckUtils]: 39: Hoare triple {2206#(<= |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; {2207#(<= |ULTIMATE.start_main_~i~0#1| 38)} is VALID [2022-02-20 14:04:35,302 INFO L290 TraceCheckUtils]: 40: Hoare triple {2207#(<= |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; {2208#(<= |ULTIMATE.start_main_~i~0#1| 39)} is VALID [2022-02-20 14:04:35,307 INFO L290 TraceCheckUtils]: 41: Hoare triple {2208#(<= |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; {2209#(<= |ULTIMATE.start_main_~i~0#1| 40)} is VALID [2022-02-20 14:04:35,308 INFO L290 TraceCheckUtils]: 42: Hoare triple {2209#(<= |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; {2210#(<= |ULTIMATE.start_main_~i~0#1| 41)} is VALID [2022-02-20 14:04:35,309 INFO L290 TraceCheckUtils]: 43: Hoare triple {2210#(<= |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; {2211#(<= |ULTIMATE.start_main_~i~0#1| 42)} is VALID [2022-02-20 14:04:35,309 INFO L290 TraceCheckUtils]: 44: Hoare triple {2211#(<= |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; {2212#(<= |ULTIMATE.start_main_~i~0#1| 43)} is VALID [2022-02-20 14:04:35,316 INFO L290 TraceCheckUtils]: 45: Hoare triple {2212#(<= |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; {2213#(<= |ULTIMATE.start_main_~i~0#1| 44)} is VALID [2022-02-20 14:04:35,317 INFO L290 TraceCheckUtils]: 46: Hoare triple {2213#(<= |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; {2214#(<= |ULTIMATE.start_main_~i~0#1| 45)} is VALID [2022-02-20 14:04:35,317 INFO L290 TraceCheckUtils]: 47: Hoare triple {2214#(<= |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; {2215#(<= |ULTIMATE.start_main_~i~0#1| 46)} is VALID [2022-02-20 14:04:35,319 INFO L290 TraceCheckUtils]: 48: Hoare triple {2215#(<= |ULTIMATE.start_main_~i~0#1| 46)} assume !(main_~i~0#1 < 100000); {2168#false} is VALID [2022-02-20 14:04:35,320 INFO L290 TraceCheckUtils]: 49: Hoare triple {2168#false} main_~i~0#1 := 0; {2168#false} is VALID [2022-02-20 14:04:35,320 INFO L290 TraceCheckUtils]: 50: Hoare triple {2168#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2168#false} is VALID [2022-02-20 14:04:35,320 INFO L290 TraceCheckUtils]: 51: Hoare triple {2168#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2168#false} is VALID [2022-02-20 14:04:35,320 INFO L290 TraceCheckUtils]: 52: Hoare triple {2168#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2168#false} is VALID [2022-02-20 14:04:35,321 INFO L290 TraceCheckUtils]: 53: Hoare triple {2168#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2168#false} is VALID [2022-02-20 14:04:35,321 INFO L290 TraceCheckUtils]: 54: Hoare triple {2168#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2168#false} is VALID [2022-02-20 14:04:35,321 INFO L290 TraceCheckUtils]: 55: Hoare triple {2168#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2168#false} is VALID [2022-02-20 14:04:35,321 INFO L290 TraceCheckUtils]: 56: Hoare triple {2168#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2168#false} is VALID [2022-02-20 14:04:35,321 INFO L290 TraceCheckUtils]: 57: Hoare triple {2168#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2168#false} is VALID [2022-02-20 14:04:35,321 INFO L290 TraceCheckUtils]: 58: Hoare triple {2168#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2168#false} is VALID [2022-02-20 14:04:35,321 INFO L290 TraceCheckUtils]: 59: Hoare triple {2168#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2168#false} is VALID [2022-02-20 14:04:35,322 INFO L290 TraceCheckUtils]: 60: Hoare triple {2168#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2168#false} is VALID [2022-02-20 14:04:35,322 INFO L290 TraceCheckUtils]: 61: Hoare triple {2168#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2168#false} is VALID [2022-02-20 14:04:35,322 INFO L290 TraceCheckUtils]: 62: Hoare triple {2168#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2168#false} is VALID [2022-02-20 14:04:35,322 INFO L290 TraceCheckUtils]: 63: Hoare triple {2168#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2168#false} is VALID [2022-02-20 14:04:35,322 INFO L290 TraceCheckUtils]: 64: Hoare triple {2168#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2168#false} is VALID [2022-02-20 14:04:35,322 INFO L290 TraceCheckUtils]: 65: Hoare triple {2168#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2168#false} is VALID [2022-02-20 14:04:35,322 INFO L290 TraceCheckUtils]: 66: Hoare triple {2168#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2168#false} is VALID [2022-02-20 14:04:35,323 INFO L290 TraceCheckUtils]: 67: Hoare triple {2168#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2168#false} is VALID [2022-02-20 14:04:35,323 INFO L290 TraceCheckUtils]: 68: Hoare triple {2168#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2168#false} is VALID [2022-02-20 14:04:35,327 INFO L290 TraceCheckUtils]: 69: Hoare triple {2168#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2168#false} is VALID [2022-02-20 14:04:35,327 INFO L290 TraceCheckUtils]: 70: Hoare triple {2168#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2168#false} is VALID [2022-02-20 14:04:35,327 INFO L290 TraceCheckUtils]: 71: Hoare triple {2168#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2168#false} is VALID [2022-02-20 14:04:35,327 INFO L290 TraceCheckUtils]: 72: Hoare triple {2168#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2168#false} is VALID [2022-02-20 14:04:35,327 INFO L290 TraceCheckUtils]: 73: Hoare triple {2168#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2168#false} is VALID [2022-02-20 14:04:35,328 INFO L290 TraceCheckUtils]: 74: Hoare triple {2168#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2168#false} is VALID [2022-02-20 14:04:35,328 INFO L290 TraceCheckUtils]: 75: Hoare triple {2168#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2168#false} is VALID [2022-02-20 14:04:35,328 INFO L290 TraceCheckUtils]: 76: Hoare triple {2168#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2168#false} is VALID [2022-02-20 14:04:35,328 INFO L290 TraceCheckUtils]: 77: Hoare triple {2168#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2168#false} is VALID [2022-02-20 14:04:35,328 INFO L290 TraceCheckUtils]: 78: Hoare triple {2168#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2168#false} is VALID [2022-02-20 14:04:35,328 INFO L290 TraceCheckUtils]: 79: Hoare triple {2168#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2168#false} is VALID [2022-02-20 14:04:35,328 INFO L290 TraceCheckUtils]: 80: Hoare triple {2168#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2168#false} is VALID [2022-02-20 14:04:35,329 INFO L290 TraceCheckUtils]: 81: Hoare triple {2168#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2168#false} is VALID [2022-02-20 14:04:35,329 INFO L290 TraceCheckUtils]: 82: Hoare triple {2168#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2168#false} is VALID [2022-02-20 14:04:35,329 INFO L290 TraceCheckUtils]: 83: Hoare triple {2168#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2168#false} is VALID [2022-02-20 14:04:35,329 INFO L290 TraceCheckUtils]: 84: Hoare triple {2168#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2168#false} is VALID [2022-02-20 14:04:35,329 INFO L290 TraceCheckUtils]: 85: Hoare triple {2168#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2168#false} is VALID [2022-02-20 14:04:35,329 INFO L290 TraceCheckUtils]: 86: Hoare triple {2168#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2168#false} is VALID [2022-02-20 14:04:35,330 INFO L290 TraceCheckUtils]: 87: Hoare triple {2168#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2168#false} is VALID [2022-02-20 14:04:35,330 INFO L290 TraceCheckUtils]: 88: Hoare triple {2168#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2168#false} is VALID [2022-02-20 14:04:35,330 INFO L290 TraceCheckUtils]: 89: Hoare triple {2168#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2168#false} is VALID [2022-02-20 14:04:35,330 INFO L290 TraceCheckUtils]: 90: Hoare triple {2168#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2168#false} is VALID [2022-02-20 14:04:35,331 INFO L290 TraceCheckUtils]: 91: Hoare triple {2168#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2168#false} is VALID [2022-02-20 14:04:35,331 INFO L290 TraceCheckUtils]: 92: Hoare triple {2168#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2168#false} is VALID [2022-02-20 14:04:35,331 INFO L290 TraceCheckUtils]: 93: Hoare triple {2168#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2168#false} is VALID [2022-02-20 14:04:35,331 INFO L290 TraceCheckUtils]: 94: Hoare triple {2168#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2168#false} is VALID [2022-02-20 14:04:35,331 INFO L290 TraceCheckUtils]: 95: Hoare triple {2168#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2168#false} is VALID [2022-02-20 14:04:35,331 INFO L290 TraceCheckUtils]: 96: Hoare triple {2168#false} assume !(main_~i~0#1 < 100000); {2168#false} is VALID [2022-02-20 14:04:35,331 INFO L290 TraceCheckUtils]: 97: Hoare triple {2168#false} havoc main_~x~0#1;main_~x~0#1 := 0; {2168#false} is VALID [2022-02-20 14:04:35,332 INFO L290 TraceCheckUtils]: 98: Hoare triple {2168#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; {2168#false} is VALID [2022-02-20 14:04:35,332 INFO L290 TraceCheckUtils]: 99: Hoare triple {2168#false} assume 0 == __VERIFIER_assert_~cond#1; {2168#false} is VALID [2022-02-20 14:04:35,332 INFO L290 TraceCheckUtils]: 100: Hoare triple {2168#false} assume !false; {2168#false} is VALID [2022-02-20 14:04:35,333 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2022-02-20 14:04:35,336 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:04:35,337 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602856928] [2022-02-20 14:04:35,337 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602856928] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:04:35,337 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545963311] [2022-02-20 14:04:35,337 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-20 14:04:35,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:04:35,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:04:35,339 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:35,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process