./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-examples/standard_init3_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_init3_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 cf075c7a0f36deed034651e013a7dc7f79bc6e15194db51bf9fa9ace21130e71 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 14:05:14,909 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 14:05:14,912 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 14:05:14,942 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 14:05:14,942 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 14:05:14,945 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 14:05:14,946 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 14:05:14,948 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 14:05:14,950 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 14:05:14,954 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 14:05:14,955 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 14:05:14,956 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 14:05:14,956 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 14:05:14,958 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 14:05:14,960 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 14:05:14,962 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 14:05:14,963 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 14:05:14,964 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 14:05:14,965 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 14:05:14,971 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 14:05:14,972 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 14:05:14,973 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 14:05:14,974 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 14:05:14,975 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 14:05:14,977 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 14:05:14,977 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 14:05:14,977 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 14:05:14,978 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 14:05:14,979 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 14:05:14,979 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 14:05:14,980 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 14:05:14,980 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 14:05:14,981 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 14:05:14,982 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 14:05:14,983 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 14:05:14,983 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 14:05:14,984 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 14:05:14,984 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 14:05:14,984 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 14:05:14,985 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 14:05:14,985 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 14:05:14,986 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 14:05:15,017 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 14:05:15,018 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 14:05:15,018 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 14:05:15,018 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 14:05:15,019 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 14:05:15,020 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 14:05:15,020 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 14:05:15,020 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 14:05:15,020 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 14:05:15,020 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 14:05:15,021 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 14:05:15,021 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 14:05:15,021 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 14:05:15,022 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 14:05:15,022 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 14:05:15,022 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 14:05:15,022 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 14:05:15,022 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 14:05:15,022 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 14:05:15,023 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 14:05:15,023 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 14:05:15,023 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 14:05:15,023 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 14:05:15,023 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 14:05:15,023 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:05:15,024 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 14:05:15,024 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 14:05:15,024 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 14:05:15,024 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 14:05:15,024 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 14:05:15,024 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 14:05:15,025 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 14:05:15,025 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 14:05:15,025 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 -> cf075c7a0f36deed034651e013a7dc7f79bc6e15194db51bf9fa9ace21130e71 [2022-02-20 14:05:15,221 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 14:05:15,241 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 14:05:15,243 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 14:05:15,244 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 14:05:15,244 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 14:05:15,245 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-examples/standard_init3_ground-1.i [2022-02-20 14:05:15,297 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ff5a1f91/1b81f41cbd8a4f58a737173e5482eb93/FLAG25ee04a21 [2022-02-20 14:05:15,664 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 14:05:15,664 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/standard_init3_ground-1.i [2022-02-20 14:05:15,668 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ff5a1f91/1b81f41cbd8a4f58a737173e5482eb93/FLAG25ee04a21 [2022-02-20 14:05:15,677 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ff5a1f91/1b81f41cbd8a4f58a737173e5482eb93 [2022-02-20 14:05:15,678 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 14:05:15,679 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 14:05:15,683 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 14:05:15,684 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 14:05:15,686 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 14:05:15,687 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:05:15" (1/1) ... [2022-02-20 14:05:15,687 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@310769bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:05:15, skipping insertion in model container [2022-02-20 14:05:15,688 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:05:15" (1/1) ... [2022-02-20 14:05:15,692 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 14:05:15,703 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 14:05:15,825 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_init3_ground-1.i[816,829] [2022-02-20 14:05:15,835 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:05:15,847 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 14:05:15,854 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_init3_ground-1.i[816,829] [2022-02-20 14:05:15,859 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:05:15,868 INFO L208 MainTranslator]: Completed translation [2022-02-20 14:05:15,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:05:15 WrapperNode [2022-02-20 14:05:15,868 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 14:05:15,869 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 14:05:15,869 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 14:05:15,870 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 14:05:15,874 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:05:15" (1/1) ... [2022-02-20 14:05:15,880 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:05:15" (1/1) ... [2022-02-20 14:05:15,893 INFO L137 Inliner]: procedures = 15, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 54 [2022-02-20 14:05:15,894 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 14:05:15,894 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 14:05:15,894 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 14:05:15,895 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 14:05:15,900 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:05:15" (1/1) ... [2022-02-20 14:05:15,900 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:05:15" (1/1) ... [2022-02-20 14:05:15,901 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:05:15" (1/1) ... [2022-02-20 14:05:15,901 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:05:15" (1/1) ... [2022-02-20 14:05:15,904 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:05:15" (1/1) ... [2022-02-20 14:05:15,907 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:05:15" (1/1) ... [2022-02-20 14:05:15,908 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:05:15" (1/1) ... [2022-02-20 14:05:15,909 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 14:05:15,910 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 14:05:15,910 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 14:05:15,910 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 14:05:15,911 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:05:15" (1/1) ... [2022-02-20 14:05:15,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:05:15,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:05:15,937 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 14:05:15,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 14:05:15,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 14:05:15,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 14:05:15,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 14:05:15,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 14:05:15,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 14:05:15,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 14:05:15,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 14:05:15,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 14:05:16,011 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 14:05:16,013 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 14:05:16,107 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 14:05:16,111 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 14:05:16,111 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-02-20 14:05:16,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:05:16 BoogieIcfgContainer [2022-02-20 14:05:16,112 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 14:05:16,113 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 14:05:16,114 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 14:05:16,116 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 14:05:16,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 02:05:15" (1/3) ... [2022-02-20 14:05:16,128 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@226c80a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:05:16, skipping insertion in model container [2022-02-20 14:05:16,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:05:15" (2/3) ... [2022-02-20 14:05:16,129 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@226c80a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:05:16, skipping insertion in model container [2022-02-20 14:05:16,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:05:16" (3/3) ... [2022-02-20 14:05:16,130 INFO L111 eAbstractionObserver]: Analyzing ICFG standard_init3_ground-1.i [2022-02-20 14:05:16,133 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 14:05:16,139 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 14:05:16,208 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 14:05:16,213 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 14:05:16,213 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 14:05:16,223 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:16,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 14:05:16,227 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:05:16,227 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:05:16,227 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:05:16,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:05:16,233 INFO L85 PathProgramCache]: Analyzing trace with hash -93359874, now seen corresponding path program 1 times [2022-02-20 14:05:16,240 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:05:16,240 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263740127] [2022-02-20 14:05:16,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:05:16,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:05:16,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:05:16,417 INFO L290 TraceCheckUtils]: 0: Hoare triple {21#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {21#true} is VALID [2022-02-20 14:05:16,430 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~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; {23#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:05:16,430 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~i~0#1 < 100000); {22#false} is VALID [2022-02-20 14:05:16,431 INFO L290 TraceCheckUtils]: 3: Hoare triple {22#false} main_~i~0#1 := 0; {22#false} is VALID [2022-02-20 14:05:16,431 INFO L290 TraceCheckUtils]: 4: Hoare triple {22#false} assume !(main_~i~0#1 < 100000); {22#false} is VALID [2022-02-20 14:05:16,431 INFO L290 TraceCheckUtils]: 5: Hoare triple {22#false} main_~i~0#1 := 0; {22#false} is VALID [2022-02-20 14:05:16,431 INFO L290 TraceCheckUtils]: 6: Hoare triple {22#false} assume !(main_~i~0#1 < 100000); {22#false} is VALID [2022-02-20 14:05:16,432 INFO L290 TraceCheckUtils]: 7: Hoare triple {22#false} havoc main_~x~0#1;main_~x~0#1 := 0; {22#false} is VALID [2022-02-20 14:05:16,432 INFO L290 TraceCheckUtils]: 8: Hoare triple {22#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 43 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {22#false} is VALID [2022-02-20 14:05:16,433 INFO L290 TraceCheckUtils]: 9: Hoare triple {22#false} assume 0 == __VERIFIER_assert_~cond#1; {22#false} is VALID [2022-02-20 14:05:16,433 INFO L290 TraceCheckUtils]: 10: Hoare triple {22#false} assume !false; {22#false} is VALID [2022-02-20 14:05:16,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:05:16,434 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:05:16,435 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263740127] [2022-02-20 14:05:16,436 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263740127] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:05:16,436 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:05:16,436 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:05:16,438 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540173345] [2022-02-20 14:05:16,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:05:16,443 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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:05:16,443 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:05:16,446 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:16,463 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:05:16,463 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:05:16,464 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:05:16,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:05:16,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:05:16,488 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:16,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:05:16,562 INFO L93 Difference]: Finished difference Result 36 states and 56 transitions. [2022-02-20 14:05:16,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:05:16,563 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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:05:16,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:05:16,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:16,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2022-02-20 14:05:16,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:16,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2022-02-20 14:05:16,577 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 56 transitions. [2022-02-20 14:05:16,644 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:05:16,649 INFO L225 Difference]: With dead ends: 36 [2022-02-20 14:05:16,653 INFO L226 Difference]: Without dead ends: 17 [2022-02-20 14:05:16,656 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:05:16,658 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:05:16,659 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:05:16,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-02-20 14:05:16,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-02-20 14:05:16,678 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:05:16,679 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:16,679 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:16,679 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:16,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:05:16,681 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-02-20 14:05:16,681 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-02-20 14:05:16,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:05:16,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:05:16,682 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 17 states. [2022-02-20 14:05:16,682 INFO L87 Difference]: Start difference. First operand has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 17 states. [2022-02-20 14:05:16,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:05:16,683 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-02-20 14:05:16,684 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-02-20 14:05:16,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:05:16,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:05:16,684 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:05:16,684 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:05:16,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:16,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2022-02-20 14:05:16,687 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 11 [2022-02-20 14:05:16,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:05:16,691 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-02-20 14:05:16,691 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:16,693 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-02-20 14:05:16,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 14:05:16,694 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:05:16,694 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:05:16,695 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 14:05:16,695 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:05:16,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:05:16,696 INFO L85 PathProgramCache]: Analyzing trace with hash -168681064, now seen corresponding path program 1 times [2022-02-20 14:05:16,696 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:05:16,696 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654120535] [2022-02-20 14:05:16,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:05:16,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:05:16,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:05:16,742 INFO L290 TraceCheckUtils]: 0: Hoare triple {132#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); {132#true} is VALID [2022-02-20 14:05:16,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {132#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; {134#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:05:16,744 INFO L290 TraceCheckUtils]: 2: Hoare triple {134#(= |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; {135#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:05:16,744 INFO L290 TraceCheckUtils]: 3: Hoare triple {135#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < 100000); {133#false} is VALID [2022-02-20 14:05:16,745 INFO L290 TraceCheckUtils]: 4: Hoare triple {133#false} main_~i~0#1 := 0; {133#false} is VALID [2022-02-20 14:05:16,745 INFO L290 TraceCheckUtils]: 5: Hoare triple {133#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {133#false} is VALID [2022-02-20 14:05:16,745 INFO L290 TraceCheckUtils]: 6: Hoare triple {133#false} assume !(main_~i~0#1 < 100000); {133#false} is VALID [2022-02-20 14:05:16,745 INFO L290 TraceCheckUtils]: 7: Hoare triple {133#false} main_~i~0#1 := 0; {133#false} is VALID [2022-02-20 14:05:16,746 INFO L290 TraceCheckUtils]: 8: Hoare triple {133#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {133#false} is VALID [2022-02-20 14:05:16,746 INFO L290 TraceCheckUtils]: 9: Hoare triple {133#false} assume !(main_~i~0#1 < 100000); {133#false} is VALID [2022-02-20 14:05:16,746 INFO L290 TraceCheckUtils]: 10: Hoare triple {133#false} havoc main_~x~0#1;main_~x~0#1 := 0; {133#false} is VALID [2022-02-20 14:05:16,746 INFO L290 TraceCheckUtils]: 11: Hoare triple {133#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 43 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {133#false} is VALID [2022-02-20 14:05:16,746 INFO L290 TraceCheckUtils]: 12: Hoare triple {133#false} assume 0 == __VERIFIER_assert_~cond#1; {133#false} is VALID [2022-02-20 14:05:16,747 INFO L290 TraceCheckUtils]: 13: Hoare triple {133#false} assume !false; {133#false} is VALID [2022-02-20 14:05:16,747 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 14:05:16,747 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:05:16,748 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654120535] [2022-02-20 14:05:16,748 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654120535] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:05:16,748 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [611001800] [2022-02-20 14:05:16,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:05:16,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:05:16,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:05:16,750 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:05:16,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 14:05:16,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:05:16,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 14:05:16,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:05:16,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:05:16,878 INFO L290 TraceCheckUtils]: 0: Hoare triple {132#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); {132#true} is VALID [2022-02-20 14:05:16,879 INFO L290 TraceCheckUtils]: 1: Hoare triple {132#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; {142#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:05:16,880 INFO L290 TraceCheckUtils]: 2: Hoare triple {142#(<= |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; {135#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:05:16,880 INFO L290 TraceCheckUtils]: 3: Hoare triple {135#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < 100000); {133#false} is VALID [2022-02-20 14:05:16,880 INFO L290 TraceCheckUtils]: 4: Hoare triple {133#false} main_~i~0#1 := 0; {133#false} is VALID [2022-02-20 14:05:16,881 INFO L290 TraceCheckUtils]: 5: Hoare triple {133#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {133#false} is VALID [2022-02-20 14:05:16,881 INFO L290 TraceCheckUtils]: 6: Hoare triple {133#false} assume !(main_~i~0#1 < 100000); {133#false} is VALID [2022-02-20 14:05:16,881 INFO L290 TraceCheckUtils]: 7: Hoare triple {133#false} main_~i~0#1 := 0; {133#false} is VALID [2022-02-20 14:05:16,881 INFO L290 TraceCheckUtils]: 8: Hoare triple {133#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {133#false} is VALID [2022-02-20 14:05:16,881 INFO L290 TraceCheckUtils]: 9: Hoare triple {133#false} assume !(main_~i~0#1 < 100000); {133#false} is VALID [2022-02-20 14:05:16,881 INFO L290 TraceCheckUtils]: 10: Hoare triple {133#false} havoc main_~x~0#1;main_~x~0#1 := 0; {133#false} is VALID [2022-02-20 14:05:16,882 INFO L290 TraceCheckUtils]: 11: Hoare triple {133#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 43 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {133#false} is VALID [2022-02-20 14:05:16,882 INFO L290 TraceCheckUtils]: 12: Hoare triple {133#false} assume 0 == __VERIFIER_assert_~cond#1; {133#false} is VALID [2022-02-20 14:05:16,882 INFO L290 TraceCheckUtils]: 13: Hoare triple {133#false} assume !false; {133#false} is VALID [2022-02-20 14:05:16,882 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 14:05:16,882 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:05:16,935 INFO L290 TraceCheckUtils]: 13: Hoare triple {133#false} assume !false; {133#false} is VALID [2022-02-20 14:05:16,936 INFO L290 TraceCheckUtils]: 12: Hoare triple {133#false} assume 0 == __VERIFIER_assert_~cond#1; {133#false} is VALID [2022-02-20 14:05:16,936 INFO L290 TraceCheckUtils]: 11: Hoare triple {133#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 43 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {133#false} is VALID [2022-02-20 14:05:16,936 INFO L290 TraceCheckUtils]: 10: Hoare triple {133#false} havoc main_~x~0#1;main_~x~0#1 := 0; {133#false} is VALID [2022-02-20 14:05:16,936 INFO L290 TraceCheckUtils]: 9: Hoare triple {133#false} assume !(main_~i~0#1 < 100000); {133#false} is VALID [2022-02-20 14:05:16,936 INFO L290 TraceCheckUtils]: 8: Hoare triple {133#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {133#false} is VALID [2022-02-20 14:05:16,937 INFO L290 TraceCheckUtils]: 7: Hoare triple {133#false} main_~i~0#1 := 0; {133#false} is VALID [2022-02-20 14:05:16,937 INFO L290 TraceCheckUtils]: 6: Hoare triple {133#false} assume !(main_~i~0#1 < 100000); {133#false} is VALID [2022-02-20 14:05:16,937 INFO L290 TraceCheckUtils]: 5: Hoare triple {133#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {133#false} is VALID [2022-02-20 14:05:16,937 INFO L290 TraceCheckUtils]: 4: Hoare triple {133#false} main_~i~0#1 := 0; {133#false} is VALID [2022-02-20 14:05:16,938 INFO L290 TraceCheckUtils]: 3: Hoare triple {209#(< |ULTIMATE.start_main_~i~0#1| 100000)} assume !(main_~i~0#1 < 100000); {133#false} is VALID [2022-02-20 14:05:16,938 INFO L290 TraceCheckUtils]: 2: Hoare triple {213#(< |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; {209#(< |ULTIMATE.start_main_~i~0#1| 100000)} is VALID [2022-02-20 14:05:16,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {132#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; {213#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:05:16,939 INFO L290 TraceCheckUtils]: 0: Hoare triple {132#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); {132#true} is VALID [2022-02-20 14:05:16,939 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 14:05:16,940 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [611001800] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:05:16,940 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:05:16,940 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-02-20 14:05:16,940 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61164553] [2022-02-20 14:05:16,941 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:05:16,941 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 14:05:16,941 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:05:16,942 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:16,954 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:05:16,954 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 14:05:16,954 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:05:16,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 14:05:16,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-02-20 14:05:16,955 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:17,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:05:17,098 INFO L93 Difference]: Finished difference Result 39 states and 53 transitions. [2022-02-20 14:05:17,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 14:05:17,098 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 14:05:17,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:05:17,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:17,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-02-20 14:05:17,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:17,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-02-20 14:05:17,101 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 51 transitions. [2022-02-20 14:05:17,139 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:05:17,140 INFO L225 Difference]: With dead ends: 39 [2022-02-20 14:05:17,140 INFO L226 Difference]: Without dead ends: 26 [2022-02-20 14:05:17,140 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-02-20 14:05:17,141 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:05:17,142 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:05:17,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-02-20 14:05:17,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-02-20 14:05:17,150 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:05:17,150 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:17,151 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:17,151 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:17,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:05:17,152 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-02-20 14:05:17,152 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-02-20 14:05:17,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:05:17,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:05:17,153 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 0 states have call successors, (0), 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 26 states. [2022-02-20 14:05:17,153 INFO L87 Difference]: Start difference. First operand has 26 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 0 states have call successors, (0), 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 26 states. [2022-02-20 14:05:17,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:05:17,154 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-02-20 14:05:17,154 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-02-20 14:05:17,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:05:17,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:05:17,154 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:05:17,155 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:05:17,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:17,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-02-20 14:05:17,156 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 14 [2022-02-20 14:05:17,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:05:17,156 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-02-20 14:05:17,156 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:17,156 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-02-20 14:05:17,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 14:05:17,157 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:05:17,157 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:05:17,176 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-20 14:05:17,370 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:05:17,370 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:05:17,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:05:17,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1736848510, now seen corresponding path program 2 times [2022-02-20 14:05:17,371 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:05:17,371 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003158615] [2022-02-20 14:05:17,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:05:17,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:05:17,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:05:17,466 INFO L290 TraceCheckUtils]: 0: Hoare triple {373#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); {373#true} is VALID [2022-02-20 14:05:17,466 INFO L290 TraceCheckUtils]: 1: Hoare triple {373#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; {375#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:05:17,467 INFO L290 TraceCheckUtils]: 2: Hoare triple {375#(= |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; {376#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:05:17,467 INFO L290 TraceCheckUtils]: 3: Hoare triple {376#(<= |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; {377#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:05:17,468 INFO L290 TraceCheckUtils]: 4: Hoare triple {377#(<= |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; {378#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:05:17,469 INFO L290 TraceCheckUtils]: 5: Hoare triple {378#(<= |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; {379#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:05:17,469 INFO L290 TraceCheckUtils]: 6: Hoare triple {379#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !(main_~i~0#1 < 100000); {374#false} is VALID [2022-02-20 14:05:17,469 INFO L290 TraceCheckUtils]: 7: Hoare triple {374#false} main_~i~0#1 := 0; {374#false} is VALID [2022-02-20 14:05:17,469 INFO L290 TraceCheckUtils]: 8: Hoare triple {374#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {374#false} is VALID [2022-02-20 14:05:17,469 INFO L290 TraceCheckUtils]: 9: Hoare triple {374#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {374#false} is VALID [2022-02-20 14:05:17,470 INFO L290 TraceCheckUtils]: 10: Hoare triple {374#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {374#false} is VALID [2022-02-20 14:05:17,470 INFO L290 TraceCheckUtils]: 11: Hoare triple {374#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {374#false} is VALID [2022-02-20 14:05:17,470 INFO L290 TraceCheckUtils]: 12: Hoare triple {374#false} assume !(main_~i~0#1 < 100000); {374#false} is VALID [2022-02-20 14:05:17,470 INFO L290 TraceCheckUtils]: 13: Hoare triple {374#false} main_~i~0#1 := 0; {374#false} is VALID [2022-02-20 14:05:17,470 INFO L290 TraceCheckUtils]: 14: Hoare triple {374#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {374#false} is VALID [2022-02-20 14:05:17,470 INFO L290 TraceCheckUtils]: 15: Hoare triple {374#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {374#false} is VALID [2022-02-20 14:05:17,471 INFO L290 TraceCheckUtils]: 16: Hoare triple {374#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {374#false} is VALID [2022-02-20 14:05:17,471 INFO L290 TraceCheckUtils]: 17: Hoare triple {374#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {374#false} is VALID [2022-02-20 14:05:17,471 INFO L290 TraceCheckUtils]: 18: Hoare triple {374#false} assume !(main_~i~0#1 < 100000); {374#false} is VALID [2022-02-20 14:05:17,471 INFO L290 TraceCheckUtils]: 19: Hoare triple {374#false} havoc main_~x~0#1;main_~x~0#1 := 0; {374#false} is VALID [2022-02-20 14:05:17,471 INFO L290 TraceCheckUtils]: 20: Hoare triple {374#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 43 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {374#false} is VALID [2022-02-20 14:05:17,471 INFO L290 TraceCheckUtils]: 21: Hoare triple {374#false} assume 0 == __VERIFIER_assert_~cond#1; {374#false} is VALID [2022-02-20 14:05:17,471 INFO L290 TraceCheckUtils]: 22: Hoare triple {374#false} assume !false; {374#false} is VALID [2022-02-20 14:05:17,472 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-02-20 14:05:17,472 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:05:17,472 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003158615] [2022-02-20 14:05:17,472 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003158615] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:05:17,472 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649943097] [2022-02-20 14:05:17,472 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 14:05:17,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:05:17,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:05:17,474 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:05:17,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 14:05:17,535 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 14:05:17,535 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:05:17,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 14:05:17,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:05:17,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:05:17,643 INFO L290 TraceCheckUtils]: 0: Hoare triple {373#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); {373#true} is VALID [2022-02-20 14:05:17,645 INFO L290 TraceCheckUtils]: 1: Hoare triple {373#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; {386#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:05:17,646 INFO L290 TraceCheckUtils]: 2: Hoare triple {386#(<= |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; {376#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:05:17,646 INFO L290 TraceCheckUtils]: 3: Hoare triple {376#(<= |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; {377#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:05:17,647 INFO L290 TraceCheckUtils]: 4: Hoare triple {377#(<= |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; {378#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:05:17,650 INFO L290 TraceCheckUtils]: 5: Hoare triple {378#(<= |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; {379#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:05:17,650 INFO L290 TraceCheckUtils]: 6: Hoare triple {379#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !(main_~i~0#1 < 100000); {374#false} is VALID [2022-02-20 14:05:17,650 INFO L290 TraceCheckUtils]: 7: Hoare triple {374#false} main_~i~0#1 := 0; {374#false} is VALID [2022-02-20 14:05:17,650 INFO L290 TraceCheckUtils]: 8: Hoare triple {374#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {374#false} is VALID [2022-02-20 14:05:17,651 INFO L290 TraceCheckUtils]: 9: Hoare triple {374#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {374#false} is VALID [2022-02-20 14:05:17,651 INFO L290 TraceCheckUtils]: 10: Hoare triple {374#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {374#false} is VALID [2022-02-20 14:05:17,651 INFO L290 TraceCheckUtils]: 11: Hoare triple {374#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {374#false} is VALID [2022-02-20 14:05:17,651 INFO L290 TraceCheckUtils]: 12: Hoare triple {374#false} assume !(main_~i~0#1 < 100000); {374#false} is VALID [2022-02-20 14:05:17,651 INFO L290 TraceCheckUtils]: 13: Hoare triple {374#false} main_~i~0#1 := 0; {374#false} is VALID [2022-02-20 14:05:17,651 INFO L290 TraceCheckUtils]: 14: Hoare triple {374#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {374#false} is VALID [2022-02-20 14:05:17,651 INFO L290 TraceCheckUtils]: 15: Hoare triple {374#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {374#false} is VALID [2022-02-20 14:05:17,652 INFO L290 TraceCheckUtils]: 16: Hoare triple {374#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {374#false} is VALID [2022-02-20 14:05:17,652 INFO L290 TraceCheckUtils]: 17: Hoare triple {374#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {374#false} is VALID [2022-02-20 14:05:17,652 INFO L290 TraceCheckUtils]: 18: Hoare triple {374#false} assume !(main_~i~0#1 < 100000); {374#false} is VALID [2022-02-20 14:05:17,652 INFO L290 TraceCheckUtils]: 19: Hoare triple {374#false} havoc main_~x~0#1;main_~x~0#1 := 0; {374#false} is VALID [2022-02-20 14:05:17,652 INFO L290 TraceCheckUtils]: 20: Hoare triple {374#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 43 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {374#false} is VALID [2022-02-20 14:05:17,652 INFO L290 TraceCheckUtils]: 21: Hoare triple {374#false} assume 0 == __VERIFIER_assert_~cond#1; {374#false} is VALID [2022-02-20 14:05:17,653 INFO L290 TraceCheckUtils]: 22: Hoare triple {374#false} assume !false; {374#false} is VALID [2022-02-20 14:05:17,653 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-02-20 14:05:17,653 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:05:17,804 INFO L290 TraceCheckUtils]: 22: Hoare triple {374#false} assume !false; {374#false} is VALID [2022-02-20 14:05:17,804 INFO L290 TraceCheckUtils]: 21: Hoare triple {374#false} assume 0 == __VERIFIER_assert_~cond#1; {374#false} is VALID [2022-02-20 14:05:17,804 INFO L290 TraceCheckUtils]: 20: Hoare triple {374#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 43 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {374#false} is VALID [2022-02-20 14:05:17,804 INFO L290 TraceCheckUtils]: 19: Hoare triple {374#false} havoc main_~x~0#1;main_~x~0#1 := 0; {374#false} is VALID [2022-02-20 14:05:17,804 INFO L290 TraceCheckUtils]: 18: Hoare triple {374#false} assume !(main_~i~0#1 < 100000); {374#false} is VALID [2022-02-20 14:05:17,804 INFO L290 TraceCheckUtils]: 17: Hoare triple {374#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {374#false} is VALID [2022-02-20 14:05:17,804 INFO L290 TraceCheckUtils]: 16: Hoare triple {374#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {374#false} is VALID [2022-02-20 14:05:17,804 INFO L290 TraceCheckUtils]: 15: Hoare triple {374#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {374#false} is VALID [2022-02-20 14:05:17,805 INFO L290 TraceCheckUtils]: 14: Hoare triple {374#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {374#false} is VALID [2022-02-20 14:05:17,805 INFO L290 TraceCheckUtils]: 13: Hoare triple {374#false} main_~i~0#1 := 0; {374#false} is VALID [2022-02-20 14:05:17,805 INFO L290 TraceCheckUtils]: 12: Hoare triple {374#false} assume !(main_~i~0#1 < 100000); {374#false} is VALID [2022-02-20 14:05:17,805 INFO L290 TraceCheckUtils]: 11: Hoare triple {374#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {374#false} is VALID [2022-02-20 14:05:17,805 INFO L290 TraceCheckUtils]: 10: Hoare triple {374#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {374#false} is VALID [2022-02-20 14:05:17,805 INFO L290 TraceCheckUtils]: 9: Hoare triple {374#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {374#false} is VALID [2022-02-20 14:05:17,806 INFO L290 TraceCheckUtils]: 8: Hoare triple {374#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {374#false} is VALID [2022-02-20 14:05:17,806 INFO L290 TraceCheckUtils]: 7: Hoare triple {374#false} main_~i~0#1 := 0; {374#false} is VALID [2022-02-20 14:05:17,807 INFO L290 TraceCheckUtils]: 6: Hoare triple {498#(< |ULTIMATE.start_main_~i~0#1| 100000)} assume !(main_~i~0#1 < 100000); {374#false} is VALID [2022-02-20 14:05:17,808 INFO L290 TraceCheckUtils]: 5: Hoare triple {502#(< |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; {498#(< |ULTIMATE.start_main_~i~0#1| 100000)} is VALID [2022-02-20 14:05:17,808 INFO L290 TraceCheckUtils]: 4: Hoare triple {506#(< |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; {502#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:05:17,810 INFO L290 TraceCheckUtils]: 3: Hoare triple {510#(< |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; {506#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:05:17,810 INFO L290 TraceCheckUtils]: 2: Hoare triple {514#(< |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; {510#(< |ULTIMATE.start_main_~i~0#1| 99997)} is VALID [2022-02-20 14:05:17,817 INFO L290 TraceCheckUtils]: 1: Hoare triple {373#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; {514#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-20 14:05:17,817 INFO L290 TraceCheckUtils]: 0: Hoare triple {373#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); {373#true} is VALID [2022-02-20 14:05:17,818 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-02-20 14:05:17,818 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [649943097] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:05:17,818 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:05:17,818 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-02-20 14:05:17,818 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608815624] [2022-02-20 14:05:17,819 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:05:17,819 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-02-20 14:05:17,819 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:05:17,820 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:17,834 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:05:17,834 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 14:05:17,834 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:05:17,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 14:05:17,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-02-20 14:05:17,835 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:18,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:05:18,036 INFO L93 Difference]: Finished difference Result 63 states and 86 transitions. [2022-02-20 14:05:18,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 14:05:18,037 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-02-20 14:05:18,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:05:18,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:18,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 78 transitions. [2022-02-20 14:05:18,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:18,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 78 transitions. [2022-02-20 14:05:18,040 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 78 transitions. [2022-02-20 14:05:18,095 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:05:18,096 INFO L225 Difference]: With dead ends: 63 [2022-02-20 14:05:18,096 INFO L226 Difference]: Without dead ends: 44 [2022-02-20 14:05:18,096 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 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:05:18,097 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:05:18,097 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:05:18,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-02-20 14:05:18,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-02-20 14:05:18,115 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:05:18,116 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 43 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:05:18,116 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 43 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:05:18,116 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 43 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:05:18,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:05:18,117 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2022-02-20 14:05:18,118 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2022-02-20 14:05:18,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:05:18,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:05:18,118 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 43 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) Second operand 44 states. [2022-02-20 14:05:18,118 INFO L87 Difference]: Start difference. First operand has 44 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 43 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) Second operand 44 states. [2022-02-20 14:05:18,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:05:18,119 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2022-02-20 14:05:18,119 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2022-02-20 14:05:18,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:05:18,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:05:18,120 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:05:18,120 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:05:18,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 43 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:05:18,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2022-02-20 14:05:18,121 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 23 [2022-02-20 14:05:18,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:05:18,121 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2022-02-20 14:05:18,121 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:18,121 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2022-02-20 14:05:18,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-20 14:05:18,122 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:05:18,122 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:05:18,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-20 14:05:18,341 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-02-20 14:05:18,341 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:05:18,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:05:18,342 INFO L85 PathProgramCache]: Analyzing trace with hash -468119106, now seen corresponding path program 3 times [2022-02-20 14:05:18,342 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:05:18,342 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381466906] [2022-02-20 14:05:18,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:05:18,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:05:18,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:05:18,503 INFO L290 TraceCheckUtils]: 0: Hoare triple {794#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); {794#true} is VALID [2022-02-20 14:05:18,504 INFO L290 TraceCheckUtils]: 1: Hoare triple {794#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; {796#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:05:18,504 INFO L290 TraceCheckUtils]: 2: Hoare triple {796#(= |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; {797#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:05:18,505 INFO L290 TraceCheckUtils]: 3: Hoare triple {797#(<= |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; {798#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:05:18,506 INFO L290 TraceCheckUtils]: 4: Hoare triple {798#(<= |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; {799#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:05:18,506 INFO L290 TraceCheckUtils]: 5: Hoare triple {799#(<= |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; {800#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:05:18,507 INFO L290 TraceCheckUtils]: 6: Hoare triple {800#(<= |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; {801#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:05:18,508 INFO L290 TraceCheckUtils]: 7: Hoare triple {801#(<= |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; {802#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:05:18,508 INFO L290 TraceCheckUtils]: 8: Hoare triple {802#(<= |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; {803#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:05:18,509 INFO L290 TraceCheckUtils]: 9: Hoare triple {803#(<= |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; {804#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:05:18,509 INFO L290 TraceCheckUtils]: 10: Hoare triple {804#(<= |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; {805#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:05:18,510 INFO L290 TraceCheckUtils]: 11: Hoare triple {805#(<= |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; {806#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:05:18,510 INFO L290 TraceCheckUtils]: 12: Hoare triple {806#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !(main_~i~0#1 < 100000); {795#false} is VALID [2022-02-20 14:05:18,510 INFO L290 TraceCheckUtils]: 13: Hoare triple {795#false} main_~i~0#1 := 0; {795#false} is VALID [2022-02-20 14:05:18,510 INFO L290 TraceCheckUtils]: 14: Hoare triple {795#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {795#false} is VALID [2022-02-20 14:05:18,510 INFO L290 TraceCheckUtils]: 15: Hoare triple {795#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {795#false} is VALID [2022-02-20 14:05:18,511 INFO L290 TraceCheckUtils]: 16: Hoare triple {795#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {795#false} is VALID [2022-02-20 14:05:18,511 INFO L290 TraceCheckUtils]: 17: Hoare triple {795#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {795#false} is VALID [2022-02-20 14:05:18,511 INFO L290 TraceCheckUtils]: 18: Hoare triple {795#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {795#false} is VALID [2022-02-20 14:05:18,511 INFO L290 TraceCheckUtils]: 19: Hoare triple {795#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {795#false} is VALID [2022-02-20 14:05:18,511 INFO L290 TraceCheckUtils]: 20: Hoare triple {795#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {795#false} is VALID [2022-02-20 14:05:18,511 INFO L290 TraceCheckUtils]: 21: Hoare triple {795#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {795#false} is VALID [2022-02-20 14:05:18,511 INFO L290 TraceCheckUtils]: 22: Hoare triple {795#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {795#false} is VALID [2022-02-20 14:05:18,512 INFO L290 TraceCheckUtils]: 23: Hoare triple {795#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {795#false} is VALID [2022-02-20 14:05:18,512 INFO L290 TraceCheckUtils]: 24: Hoare triple {795#false} assume !(main_~i~0#1 < 100000); {795#false} is VALID [2022-02-20 14:05:18,512 INFO L290 TraceCheckUtils]: 25: Hoare triple {795#false} main_~i~0#1 := 0; {795#false} is VALID [2022-02-20 14:05:18,512 INFO L290 TraceCheckUtils]: 26: Hoare triple {795#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {795#false} is VALID [2022-02-20 14:05:18,512 INFO L290 TraceCheckUtils]: 27: Hoare triple {795#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {795#false} is VALID [2022-02-20 14:05:18,512 INFO L290 TraceCheckUtils]: 28: Hoare triple {795#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {795#false} is VALID [2022-02-20 14:05:18,512 INFO L290 TraceCheckUtils]: 29: Hoare triple {795#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {795#false} is VALID [2022-02-20 14:05:18,513 INFO L290 TraceCheckUtils]: 30: Hoare triple {795#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {795#false} is VALID [2022-02-20 14:05:18,513 INFO L290 TraceCheckUtils]: 31: Hoare triple {795#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {795#false} is VALID [2022-02-20 14:05:18,513 INFO L290 TraceCheckUtils]: 32: Hoare triple {795#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {795#false} is VALID [2022-02-20 14:05:18,513 INFO L290 TraceCheckUtils]: 33: Hoare triple {795#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {795#false} is VALID [2022-02-20 14:05:18,513 INFO L290 TraceCheckUtils]: 34: Hoare triple {795#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {795#false} is VALID [2022-02-20 14:05:18,513 INFO L290 TraceCheckUtils]: 35: Hoare triple {795#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {795#false} is VALID [2022-02-20 14:05:18,513 INFO L290 TraceCheckUtils]: 36: Hoare triple {795#false} assume !(main_~i~0#1 < 100000); {795#false} is VALID [2022-02-20 14:05:18,514 INFO L290 TraceCheckUtils]: 37: Hoare triple {795#false} havoc main_~x~0#1;main_~x~0#1 := 0; {795#false} is VALID [2022-02-20 14:05:18,514 INFO L290 TraceCheckUtils]: 38: Hoare triple {795#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 43 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {795#false} is VALID [2022-02-20 14:05:18,514 INFO L290 TraceCheckUtils]: 39: Hoare triple {795#false} assume 0 == __VERIFIER_assert_~cond#1; {795#false} is VALID [2022-02-20 14:05:18,514 INFO L290 TraceCheckUtils]: 40: Hoare triple {795#false} assume !false; {795#false} is VALID [2022-02-20 14:05:18,514 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2022-02-20 14:05:18,515 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:05:18,515 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381466906] [2022-02-20 14:05:18,515 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381466906] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:05:18,515 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1668024311] [2022-02-20 14:05:18,515 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 14:05:18,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:05:18,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:05:18,520 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:05:18,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-20 14:05:19,015 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-02-20 14:05:19,015 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:05:19,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 14:05:19,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:05:19,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:05:19,244 INFO L290 TraceCheckUtils]: 0: Hoare triple {794#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); {794#true} is VALID [2022-02-20 14:05:19,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {794#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; {794#true} is VALID [2022-02-20 14:05:19,245 INFO L290 TraceCheckUtils]: 2: Hoare triple {794#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; {794#true} is VALID [2022-02-20 14:05:19,245 INFO L290 TraceCheckUtils]: 3: Hoare triple {794#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; {794#true} is VALID [2022-02-20 14:05:19,245 INFO L290 TraceCheckUtils]: 4: Hoare triple {794#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; {794#true} is VALID [2022-02-20 14:05:19,245 INFO L290 TraceCheckUtils]: 5: Hoare triple {794#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; {794#true} is VALID [2022-02-20 14:05:19,245 INFO L290 TraceCheckUtils]: 6: Hoare triple {794#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; {794#true} is VALID [2022-02-20 14:05:19,245 INFO L290 TraceCheckUtils]: 7: Hoare triple {794#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; {794#true} is VALID [2022-02-20 14:05:19,245 INFO L290 TraceCheckUtils]: 8: Hoare triple {794#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; {794#true} is VALID [2022-02-20 14:05:19,245 INFO L290 TraceCheckUtils]: 9: Hoare triple {794#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; {794#true} is VALID [2022-02-20 14:05:19,245 INFO L290 TraceCheckUtils]: 10: Hoare triple {794#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; {794#true} is VALID [2022-02-20 14:05:19,245 INFO L290 TraceCheckUtils]: 11: Hoare triple {794#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; {794#true} is VALID [2022-02-20 14:05:19,245 INFO L290 TraceCheckUtils]: 12: Hoare triple {794#true} assume !(main_~i~0#1 < 100000); {794#true} is VALID [2022-02-20 14:05:19,246 INFO L290 TraceCheckUtils]: 13: Hoare triple {794#true} main_~i~0#1 := 0; {849#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:05:19,246 INFO L290 TraceCheckUtils]: 14: Hoare triple {849#(<= |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; {797#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:05:19,248 INFO L290 TraceCheckUtils]: 15: Hoare triple {797#(<= |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; {798#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:05:19,249 INFO L290 TraceCheckUtils]: 16: Hoare triple {798#(<= |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; {799#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:05:19,260 INFO L290 TraceCheckUtils]: 17: Hoare triple {799#(<= |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; {800#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:05:19,260 INFO L290 TraceCheckUtils]: 18: Hoare triple {800#(<= |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; {801#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:05:19,261 INFO L290 TraceCheckUtils]: 19: Hoare triple {801#(<= |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; {802#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:05:19,262 INFO L290 TraceCheckUtils]: 20: Hoare triple {802#(<= |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; {803#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:05:19,262 INFO L290 TraceCheckUtils]: 21: Hoare triple {803#(<= |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; {804#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:05:19,263 INFO L290 TraceCheckUtils]: 22: Hoare triple {804#(<= |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; {805#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:05:19,264 INFO L290 TraceCheckUtils]: 23: Hoare triple {805#(<= |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; {806#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:05:19,264 INFO L290 TraceCheckUtils]: 24: Hoare triple {806#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !(main_~i~0#1 < 100000); {795#false} is VALID [2022-02-20 14:05:19,264 INFO L290 TraceCheckUtils]: 25: Hoare triple {795#false} main_~i~0#1 := 0; {795#false} is VALID [2022-02-20 14:05:19,265 INFO L290 TraceCheckUtils]: 26: Hoare triple {795#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {795#false} is VALID [2022-02-20 14:05:19,265 INFO L290 TraceCheckUtils]: 27: Hoare triple {795#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {795#false} is VALID [2022-02-20 14:05:19,265 INFO L290 TraceCheckUtils]: 28: Hoare triple {795#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {795#false} is VALID [2022-02-20 14:05:19,265 INFO L290 TraceCheckUtils]: 29: Hoare triple {795#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {795#false} is VALID [2022-02-20 14:05:19,265 INFO L290 TraceCheckUtils]: 30: Hoare triple {795#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {795#false} is VALID [2022-02-20 14:05:19,265 INFO L290 TraceCheckUtils]: 31: Hoare triple {795#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {795#false} is VALID [2022-02-20 14:05:19,265 INFO L290 TraceCheckUtils]: 32: Hoare triple {795#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {795#false} is VALID [2022-02-20 14:05:19,266 INFO L290 TraceCheckUtils]: 33: Hoare triple {795#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {795#false} is VALID [2022-02-20 14:05:19,266 INFO L290 TraceCheckUtils]: 34: Hoare triple {795#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {795#false} is VALID [2022-02-20 14:05:19,272 INFO L290 TraceCheckUtils]: 35: Hoare triple {795#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {795#false} is VALID [2022-02-20 14:05:19,272 INFO L290 TraceCheckUtils]: 36: Hoare triple {795#false} assume !(main_~i~0#1 < 100000); {795#false} is VALID [2022-02-20 14:05:19,272 INFO L290 TraceCheckUtils]: 37: Hoare triple {795#false} havoc main_~x~0#1;main_~x~0#1 := 0; {795#false} is VALID [2022-02-20 14:05:19,272 INFO L290 TraceCheckUtils]: 38: Hoare triple {795#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 43 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {795#false} is VALID [2022-02-20 14:05:19,272 INFO L290 TraceCheckUtils]: 39: Hoare triple {795#false} assume 0 == __VERIFIER_assert_~cond#1; {795#false} is VALID [2022-02-20 14:05:19,273 INFO L290 TraceCheckUtils]: 40: Hoare triple {795#false} assume !false; {795#false} is VALID [2022-02-20 14:05:19,273 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2022-02-20 14:05:19,273 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:05:19,585 INFO L290 TraceCheckUtils]: 40: Hoare triple {795#false} assume !false; {795#false} is VALID [2022-02-20 14:05:19,585 INFO L290 TraceCheckUtils]: 39: Hoare triple {795#false} assume 0 == __VERIFIER_assert_~cond#1; {795#false} is VALID [2022-02-20 14:05:19,585 INFO L290 TraceCheckUtils]: 38: Hoare triple {795#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 43 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {795#false} is VALID [2022-02-20 14:05:19,585 INFO L290 TraceCheckUtils]: 37: Hoare triple {795#false} havoc main_~x~0#1;main_~x~0#1 := 0; {795#false} is VALID [2022-02-20 14:05:19,585 INFO L290 TraceCheckUtils]: 36: Hoare triple {795#false} assume !(main_~i~0#1 < 100000); {795#false} is VALID [2022-02-20 14:05:19,585 INFO L290 TraceCheckUtils]: 35: Hoare triple {795#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {795#false} is VALID [2022-02-20 14:05:19,585 INFO L290 TraceCheckUtils]: 34: Hoare triple {795#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {795#false} is VALID [2022-02-20 14:05:19,586 INFO L290 TraceCheckUtils]: 33: Hoare triple {795#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {795#false} is VALID [2022-02-20 14:05:19,586 INFO L290 TraceCheckUtils]: 32: Hoare triple {795#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {795#false} is VALID [2022-02-20 14:05:19,586 INFO L290 TraceCheckUtils]: 31: Hoare triple {795#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {795#false} is VALID [2022-02-20 14:05:19,586 INFO L290 TraceCheckUtils]: 30: Hoare triple {795#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {795#false} is VALID [2022-02-20 14:05:19,586 INFO L290 TraceCheckUtils]: 29: Hoare triple {795#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {795#false} is VALID [2022-02-20 14:05:19,586 INFO L290 TraceCheckUtils]: 28: Hoare triple {795#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {795#false} is VALID [2022-02-20 14:05:19,586 INFO L290 TraceCheckUtils]: 27: Hoare triple {795#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {795#false} is VALID [2022-02-20 14:05:19,586 INFO L290 TraceCheckUtils]: 26: Hoare triple {795#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {795#false} is VALID [2022-02-20 14:05:19,586 INFO L290 TraceCheckUtils]: 25: Hoare triple {795#false} main_~i~0#1 := 0; {795#false} is VALID [2022-02-20 14:05:19,591 INFO L290 TraceCheckUtils]: 24: Hoare triple {979#(< |ULTIMATE.start_main_~i~0#1| 100000)} assume !(main_~i~0#1 < 100000); {795#false} is VALID [2022-02-20 14:05:19,592 INFO L290 TraceCheckUtils]: 23: Hoare triple {983#(< |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; {979#(< |ULTIMATE.start_main_~i~0#1| 100000)} is VALID [2022-02-20 14:05:19,592 INFO L290 TraceCheckUtils]: 22: Hoare triple {987#(< |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; {983#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:05:19,593 INFO L290 TraceCheckUtils]: 21: Hoare triple {991#(< |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; {987#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:05:19,593 INFO L290 TraceCheckUtils]: 20: Hoare triple {995#(< |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; {991#(< |ULTIMATE.start_main_~i~0#1| 99997)} is VALID [2022-02-20 14:05:19,594 INFO L290 TraceCheckUtils]: 19: Hoare triple {999#(< |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; {995#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-20 14:05:19,594 INFO L290 TraceCheckUtils]: 18: Hoare triple {1003#(< |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; {999#(< |ULTIMATE.start_main_~i~0#1| 99995)} is VALID [2022-02-20 14:05:19,595 INFO L290 TraceCheckUtils]: 17: Hoare triple {1007#(< |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; {1003#(< |ULTIMATE.start_main_~i~0#1| 99994)} is VALID [2022-02-20 14:05:19,595 INFO L290 TraceCheckUtils]: 16: Hoare triple {1011#(< |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; {1007#(< |ULTIMATE.start_main_~i~0#1| 99993)} is VALID [2022-02-20 14:05:19,596 INFO L290 TraceCheckUtils]: 15: Hoare triple {1015#(< |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; {1011#(< |ULTIMATE.start_main_~i~0#1| 99992)} is VALID [2022-02-20 14:05:19,596 INFO L290 TraceCheckUtils]: 14: Hoare triple {1019#(< |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; {1015#(< |ULTIMATE.start_main_~i~0#1| 99991)} is VALID [2022-02-20 14:05:19,597 INFO L290 TraceCheckUtils]: 13: Hoare triple {794#true} main_~i~0#1 := 0; {1019#(< |ULTIMATE.start_main_~i~0#1| 99990)} is VALID [2022-02-20 14:05:19,597 INFO L290 TraceCheckUtils]: 12: Hoare triple {794#true} assume !(main_~i~0#1 < 100000); {794#true} is VALID [2022-02-20 14:05:19,597 INFO L290 TraceCheckUtils]: 11: Hoare triple {794#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; {794#true} is VALID [2022-02-20 14:05:19,597 INFO L290 TraceCheckUtils]: 10: Hoare triple {794#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; {794#true} is VALID [2022-02-20 14:05:19,597 INFO L290 TraceCheckUtils]: 9: Hoare triple {794#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; {794#true} is VALID [2022-02-20 14:05:19,597 INFO L290 TraceCheckUtils]: 8: Hoare triple {794#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; {794#true} is VALID [2022-02-20 14:05:19,597 INFO L290 TraceCheckUtils]: 7: Hoare triple {794#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; {794#true} is VALID [2022-02-20 14:05:19,597 INFO L290 TraceCheckUtils]: 6: Hoare triple {794#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; {794#true} is VALID [2022-02-20 14:05:19,597 INFO L290 TraceCheckUtils]: 5: Hoare triple {794#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; {794#true} is VALID [2022-02-20 14:05:19,597 INFO L290 TraceCheckUtils]: 4: Hoare triple {794#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; {794#true} is VALID [2022-02-20 14:05:19,597 INFO L290 TraceCheckUtils]: 3: Hoare triple {794#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; {794#true} is VALID [2022-02-20 14:05:19,597 INFO L290 TraceCheckUtils]: 2: Hoare triple {794#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; {794#true} is VALID [2022-02-20 14:05:19,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {794#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; {794#true} is VALID [2022-02-20 14:05:19,598 INFO L290 TraceCheckUtils]: 0: Hoare triple {794#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); {794#true} is VALID [2022-02-20 14:05:19,598 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2022-02-20 14:05:19,598 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1668024311] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:05:19,598 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:05:19,598 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2022-02-20 14:05:19,598 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201604539] [2022-02-20 14:05:19,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:05:19,599 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.0) internal successors, (50), 25 states have internal predecessors, (50), 0 states have call successors, (0), 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 41 [2022-02-20 14:05:19,599 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:05:19,599 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 2.0) internal successors, (50), 25 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:19,639 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:05:19,640 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-02-20 14:05:19,640 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:05:19,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-02-20 14:05:19,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2022-02-20 14:05:19,641 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand has 25 states, 25 states have (on average 2.0) internal successors, (50), 25 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:20,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:05:20,057 INFO L93 Difference]: Finished difference Result 111 states and 152 transitions. [2022-02-20 14:05:20,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-02-20 14:05:20,057 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.0) internal successors, (50), 25 states have internal predecessors, (50), 0 states have call successors, (0), 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 41 [2022-02-20 14:05:20,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:05:20,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.0) internal successors, (50), 25 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:20,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 132 transitions. [2022-02-20 14:05:20,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.0) internal successors, (50), 25 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:20,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 132 transitions. [2022-02-20 14:05:20,067 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 132 transitions. [2022-02-20 14:05:20,167 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:05:20,169 INFO L225 Difference]: With dead ends: 111 [2022-02-20 14:05:20,169 INFO L226 Difference]: Without dead ends: 80 [2022-02-20 14:05:20,169 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2022-02-20 14:05:20,170 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 14:05:20,170 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 14:05:20,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-02-20 14:05:20,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-02-20 14:05:20,215 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:05:20,215 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand has 80 states, 79 states have (on average 1.0506329113924051) internal successors, (83), 79 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:20,215 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand has 80 states, 79 states have (on average 1.0506329113924051) internal successors, (83), 79 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:20,215 INFO L87 Difference]: Start difference. First operand 80 states. Second operand has 80 states, 79 states have (on average 1.0506329113924051) internal successors, (83), 79 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:20,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:05:20,217 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2022-02-20 14:05:20,217 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2022-02-20 14:05:20,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:05:20,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:05:20,218 INFO L74 IsIncluded]: Start isIncluded. First operand has 80 states, 79 states have (on average 1.0506329113924051) internal successors, (83), 79 states have internal predecessors, (83), 0 states have call successors, (0), 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 80 states. [2022-02-20 14:05:20,218 INFO L87 Difference]: Start difference. First operand has 80 states, 79 states have (on average 1.0506329113924051) internal successors, (83), 79 states have internal predecessors, (83), 0 states have call successors, (0), 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 80 states. [2022-02-20 14:05:20,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:05:20,220 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2022-02-20 14:05:20,220 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2022-02-20 14:05:20,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:05:20,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:05:20,221 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:05:20,221 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:05:20,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.0506329113924051) internal successors, (83), 79 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:20,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2022-02-20 14:05:20,222 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 41 [2022-02-20 14:05:20,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:05:20,223 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2022-02-20 14:05:20,223 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.0) internal successors, (50), 25 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:20,223 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2022-02-20 14:05:20,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-20 14:05:20,224 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:05:20,224 INFO L514 BasicCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:05:20,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-20 14:05:20,447 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:05:20,448 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:05:20,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:05:20,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1058733118, now seen corresponding path program 4 times [2022-02-20 14:05:20,448 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:05:20,448 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225843169] [2022-02-20 14:05:20,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:05:20,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:05:20,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:05:20,836 INFO L290 TraceCheckUtils]: 0: Hoare triple {1575#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); {1575#true} is VALID [2022-02-20 14:05:20,837 INFO L290 TraceCheckUtils]: 1: Hoare triple {1575#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; {1577#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:05:20,838 INFO L290 TraceCheckUtils]: 2: Hoare triple {1577#(= |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; {1578#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:05:20,839 INFO L290 TraceCheckUtils]: 3: Hoare triple {1578#(<= |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; {1579#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:05:20,840 INFO L290 TraceCheckUtils]: 4: Hoare triple {1579#(<= |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; {1580#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:05:20,840 INFO L290 TraceCheckUtils]: 5: Hoare triple {1580#(<= |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; {1581#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:05:20,841 INFO L290 TraceCheckUtils]: 6: Hoare triple {1581#(<= |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; {1582#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:05:20,841 INFO L290 TraceCheckUtils]: 7: Hoare triple {1582#(<= |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; {1583#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:05:20,842 INFO L290 TraceCheckUtils]: 8: Hoare triple {1583#(<= |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; {1584#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:05:20,843 INFO L290 TraceCheckUtils]: 9: Hoare triple {1584#(<= |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; {1585#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:05:20,846 INFO L290 TraceCheckUtils]: 10: Hoare triple {1585#(<= |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; {1586#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:05:20,846 INFO L290 TraceCheckUtils]: 11: Hoare triple {1586#(<= |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; {1587#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:05:20,847 INFO L290 TraceCheckUtils]: 12: Hoare triple {1587#(<= |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; {1588#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-20 14:05:20,847 INFO L290 TraceCheckUtils]: 13: Hoare triple {1588#(<= |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; {1589#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 14:05:20,848 INFO L290 TraceCheckUtils]: 14: Hoare triple {1589#(<= |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; {1590#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-20 14:05:20,848 INFO L290 TraceCheckUtils]: 15: Hoare triple {1590#(<= |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; {1591#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 14:05:20,848 INFO L290 TraceCheckUtils]: 16: Hoare triple {1591#(<= |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; {1592#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-20 14:05:20,849 INFO L290 TraceCheckUtils]: 17: Hoare triple {1592#(<= |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; {1593#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 14:05:20,849 INFO L290 TraceCheckUtils]: 18: Hoare triple {1593#(<= |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; {1594#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-20 14:05:20,850 INFO L290 TraceCheckUtils]: 19: Hoare triple {1594#(<= |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; {1595#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 14:05:20,850 INFO L290 TraceCheckUtils]: 20: Hoare triple {1595#(<= |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; {1596#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-20 14:05:20,851 INFO L290 TraceCheckUtils]: 21: Hoare triple {1596#(<= |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; {1597#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 14:05:20,851 INFO L290 TraceCheckUtils]: 22: Hoare triple {1597#(<= |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; {1598#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-20 14:05:20,852 INFO L290 TraceCheckUtils]: 23: Hoare triple {1598#(<= |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; {1599#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-20 14:05:20,852 INFO L290 TraceCheckUtils]: 24: Hoare triple {1599#(<= |ULTIMATE.start_main_~i~0#1| 22)} assume !(main_~i~0#1 < 100000); {1576#false} is VALID [2022-02-20 14:05:20,852 INFO L290 TraceCheckUtils]: 25: Hoare triple {1576#false} main_~i~0#1 := 0; {1576#false} is VALID [2022-02-20 14:05:20,852 INFO L290 TraceCheckUtils]: 26: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:20,852 INFO L290 TraceCheckUtils]: 27: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:20,852 INFO L290 TraceCheckUtils]: 28: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:20,852 INFO L290 TraceCheckUtils]: 29: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:20,852 INFO L290 TraceCheckUtils]: 30: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:20,852 INFO L290 TraceCheckUtils]: 31: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:20,852 INFO L290 TraceCheckUtils]: 32: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:20,852 INFO L290 TraceCheckUtils]: 33: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:20,853 INFO L290 TraceCheckUtils]: 34: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:20,853 INFO L290 TraceCheckUtils]: 35: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:20,853 INFO L290 TraceCheckUtils]: 36: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:20,853 INFO L290 TraceCheckUtils]: 37: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:20,853 INFO L290 TraceCheckUtils]: 38: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:20,853 INFO L290 TraceCheckUtils]: 39: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:20,853 INFO L290 TraceCheckUtils]: 40: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:20,853 INFO L290 TraceCheckUtils]: 41: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:20,853 INFO L290 TraceCheckUtils]: 42: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:20,853 INFO L290 TraceCheckUtils]: 43: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:20,853 INFO L290 TraceCheckUtils]: 44: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:20,853 INFO L290 TraceCheckUtils]: 45: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:20,853 INFO L290 TraceCheckUtils]: 46: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:20,853 INFO L290 TraceCheckUtils]: 47: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:20,854 INFO L290 TraceCheckUtils]: 48: Hoare triple {1576#false} assume !(main_~i~0#1 < 100000); {1576#false} is VALID [2022-02-20 14:05:20,854 INFO L290 TraceCheckUtils]: 49: Hoare triple {1576#false} main_~i~0#1 := 0; {1576#false} is VALID [2022-02-20 14:05:20,854 INFO L290 TraceCheckUtils]: 50: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:20,854 INFO L290 TraceCheckUtils]: 51: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:20,854 INFO L290 TraceCheckUtils]: 52: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:20,854 INFO L290 TraceCheckUtils]: 53: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:20,854 INFO L290 TraceCheckUtils]: 54: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:20,854 INFO L290 TraceCheckUtils]: 55: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:20,854 INFO L290 TraceCheckUtils]: 56: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:20,855 INFO L290 TraceCheckUtils]: 57: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:20,855 INFO L290 TraceCheckUtils]: 58: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:20,855 INFO L290 TraceCheckUtils]: 59: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:20,855 INFO L290 TraceCheckUtils]: 60: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:20,855 INFO L290 TraceCheckUtils]: 61: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:20,855 INFO L290 TraceCheckUtils]: 62: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:20,855 INFO L290 TraceCheckUtils]: 63: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:20,855 INFO L290 TraceCheckUtils]: 64: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:20,856 INFO L290 TraceCheckUtils]: 65: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:20,856 INFO L290 TraceCheckUtils]: 66: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:20,856 INFO L290 TraceCheckUtils]: 67: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:20,856 INFO L290 TraceCheckUtils]: 68: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:20,856 INFO L290 TraceCheckUtils]: 69: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:20,856 INFO L290 TraceCheckUtils]: 70: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:20,856 INFO L290 TraceCheckUtils]: 71: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:20,856 INFO L290 TraceCheckUtils]: 72: Hoare triple {1576#false} assume !(main_~i~0#1 < 100000); {1576#false} is VALID [2022-02-20 14:05:20,856 INFO L290 TraceCheckUtils]: 73: Hoare triple {1576#false} havoc main_~x~0#1;main_~x~0#1 := 0; {1576#false} is VALID [2022-02-20 14:05:20,857 INFO L290 TraceCheckUtils]: 74: Hoare triple {1576#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 43 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1576#false} is VALID [2022-02-20 14:05:20,857 INFO L290 TraceCheckUtils]: 75: Hoare triple {1576#false} assume 0 == __VERIFIER_assert_~cond#1; {1576#false} is VALID [2022-02-20 14:05:20,857 INFO L290 TraceCheckUtils]: 76: Hoare triple {1576#false} assume !false; {1576#false} is VALID [2022-02-20 14:05:20,857 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2022-02-20 14:05:20,858 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:05:20,858 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225843169] [2022-02-20 14:05:20,858 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225843169] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:05:20,858 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817714925] [2022-02-20 14:05:20,858 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-20 14:05:20,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:05:20,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:05:20,859 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:05:20,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-20 14:05:20,980 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-20 14:05:20,980 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:05:20,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 24 conjunts are in the unsatisfiable core [2022-02-20 14:05:21,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:05:21,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:05:21,305 INFO L290 TraceCheckUtils]: 0: Hoare triple {1575#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); {1575#true} is VALID [2022-02-20 14:05:21,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {1575#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; {1606#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:05:21,306 INFO L290 TraceCheckUtils]: 2: Hoare triple {1606#(<= |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; {1578#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:05:21,307 INFO L290 TraceCheckUtils]: 3: Hoare triple {1578#(<= |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; {1579#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:05:21,311 INFO L290 TraceCheckUtils]: 4: Hoare triple {1579#(<= |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; {1580#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:05:21,312 INFO L290 TraceCheckUtils]: 5: Hoare triple {1580#(<= |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; {1581#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:05:21,313 INFO L290 TraceCheckUtils]: 6: Hoare triple {1581#(<= |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; {1582#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:05:21,313 INFO L290 TraceCheckUtils]: 7: Hoare triple {1582#(<= |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; {1583#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:05:21,313 INFO L290 TraceCheckUtils]: 8: Hoare triple {1583#(<= |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; {1584#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:05:21,314 INFO L290 TraceCheckUtils]: 9: Hoare triple {1584#(<= |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; {1585#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:05:21,314 INFO L290 TraceCheckUtils]: 10: Hoare triple {1585#(<= |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; {1586#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:05:21,315 INFO L290 TraceCheckUtils]: 11: Hoare triple {1586#(<= |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; {1587#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:05:21,315 INFO L290 TraceCheckUtils]: 12: Hoare triple {1587#(<= |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; {1588#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-20 14:05:21,316 INFO L290 TraceCheckUtils]: 13: Hoare triple {1588#(<= |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; {1589#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 14:05:21,316 INFO L290 TraceCheckUtils]: 14: Hoare triple {1589#(<= |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; {1590#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-20 14:05:21,317 INFO L290 TraceCheckUtils]: 15: Hoare triple {1590#(<= |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; {1591#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 14:05:21,317 INFO L290 TraceCheckUtils]: 16: Hoare triple {1591#(<= |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; {1592#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-20 14:05:21,317 INFO L290 TraceCheckUtils]: 17: Hoare triple {1592#(<= |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; {1593#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 14:05:21,318 INFO L290 TraceCheckUtils]: 18: Hoare triple {1593#(<= |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; {1594#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-20 14:05:21,318 INFO L290 TraceCheckUtils]: 19: Hoare triple {1594#(<= |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; {1595#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 14:05:21,319 INFO L290 TraceCheckUtils]: 20: Hoare triple {1595#(<= |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; {1596#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-20 14:05:21,319 INFO L290 TraceCheckUtils]: 21: Hoare triple {1596#(<= |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; {1597#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 14:05:21,320 INFO L290 TraceCheckUtils]: 22: Hoare triple {1597#(<= |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; {1598#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-20 14:05:21,320 INFO L290 TraceCheckUtils]: 23: Hoare triple {1598#(<= |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; {1599#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-20 14:05:21,320 INFO L290 TraceCheckUtils]: 24: Hoare triple {1599#(<= |ULTIMATE.start_main_~i~0#1| 22)} assume !(main_~i~0#1 < 100000); {1576#false} is VALID [2022-02-20 14:05:21,321 INFO L290 TraceCheckUtils]: 25: Hoare triple {1576#false} main_~i~0#1 := 0; {1576#false} is VALID [2022-02-20 14:05:21,321 INFO L290 TraceCheckUtils]: 26: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:21,321 INFO L290 TraceCheckUtils]: 27: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:21,321 INFO L290 TraceCheckUtils]: 28: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:21,321 INFO L290 TraceCheckUtils]: 29: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:21,321 INFO L290 TraceCheckUtils]: 30: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:21,321 INFO L290 TraceCheckUtils]: 31: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:21,321 INFO L290 TraceCheckUtils]: 32: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:21,321 INFO L290 TraceCheckUtils]: 33: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:21,322 INFO L290 TraceCheckUtils]: 34: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:21,322 INFO L290 TraceCheckUtils]: 35: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:21,322 INFO L290 TraceCheckUtils]: 36: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:21,322 INFO L290 TraceCheckUtils]: 37: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:21,322 INFO L290 TraceCheckUtils]: 38: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:21,322 INFO L290 TraceCheckUtils]: 39: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:21,322 INFO L290 TraceCheckUtils]: 40: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:21,322 INFO L290 TraceCheckUtils]: 41: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:21,323 INFO L290 TraceCheckUtils]: 42: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:21,323 INFO L290 TraceCheckUtils]: 43: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:21,323 INFO L290 TraceCheckUtils]: 44: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:21,323 INFO L290 TraceCheckUtils]: 45: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:21,323 INFO L290 TraceCheckUtils]: 46: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:21,323 INFO L290 TraceCheckUtils]: 47: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:21,323 INFO L290 TraceCheckUtils]: 48: Hoare triple {1576#false} assume !(main_~i~0#1 < 100000); {1576#false} is VALID [2022-02-20 14:05:21,323 INFO L290 TraceCheckUtils]: 49: Hoare triple {1576#false} main_~i~0#1 := 0; {1576#false} is VALID [2022-02-20 14:05:21,324 INFO L290 TraceCheckUtils]: 50: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:21,325 INFO L290 TraceCheckUtils]: 51: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:21,327 INFO L290 TraceCheckUtils]: 52: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:21,329 INFO L290 TraceCheckUtils]: 53: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:21,329 INFO L290 TraceCheckUtils]: 54: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:21,329 INFO L290 TraceCheckUtils]: 55: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:21,329 INFO L290 TraceCheckUtils]: 56: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:21,329 INFO L290 TraceCheckUtils]: 57: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:21,330 INFO L290 TraceCheckUtils]: 58: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:21,330 INFO L290 TraceCheckUtils]: 59: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:21,330 INFO L290 TraceCheckUtils]: 60: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:21,331 INFO L290 TraceCheckUtils]: 61: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:21,331 INFO L290 TraceCheckUtils]: 62: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:21,331 INFO L290 TraceCheckUtils]: 63: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:21,331 INFO L290 TraceCheckUtils]: 64: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:21,331 INFO L290 TraceCheckUtils]: 65: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:21,331 INFO L290 TraceCheckUtils]: 66: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:21,331 INFO L290 TraceCheckUtils]: 67: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:21,331 INFO L290 TraceCheckUtils]: 68: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:21,331 INFO L290 TraceCheckUtils]: 69: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:21,331 INFO L290 TraceCheckUtils]: 70: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:21,332 INFO L290 TraceCheckUtils]: 71: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:21,332 INFO L290 TraceCheckUtils]: 72: Hoare triple {1576#false} assume !(main_~i~0#1 < 100000); {1576#false} is VALID [2022-02-20 14:05:21,332 INFO L290 TraceCheckUtils]: 73: Hoare triple {1576#false} havoc main_~x~0#1;main_~x~0#1 := 0; {1576#false} is VALID [2022-02-20 14:05:21,332 INFO L290 TraceCheckUtils]: 74: Hoare triple {1576#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 43 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1576#false} is VALID [2022-02-20 14:05:21,332 INFO L290 TraceCheckUtils]: 75: Hoare triple {1576#false} assume 0 == __VERIFIER_assert_~cond#1; {1576#false} is VALID [2022-02-20 14:05:21,332 INFO L290 TraceCheckUtils]: 76: Hoare triple {1576#false} assume !false; {1576#false} is VALID [2022-02-20 14:05:21,335 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2022-02-20 14:05:21,335 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:05:22,179 INFO L290 TraceCheckUtils]: 76: Hoare triple {1576#false} assume !false; {1576#false} is VALID [2022-02-20 14:05:22,179 INFO L290 TraceCheckUtils]: 75: Hoare triple {1576#false} assume 0 == __VERIFIER_assert_~cond#1; {1576#false} is VALID [2022-02-20 14:05:22,179 INFO L290 TraceCheckUtils]: 74: Hoare triple {1576#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 43 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1576#false} is VALID [2022-02-20 14:05:22,180 INFO L290 TraceCheckUtils]: 73: Hoare triple {1576#false} havoc main_~x~0#1;main_~x~0#1 := 0; {1576#false} is VALID [2022-02-20 14:05:22,180 INFO L290 TraceCheckUtils]: 72: Hoare triple {1576#false} assume !(main_~i~0#1 < 100000); {1576#false} is VALID [2022-02-20 14:05:22,180 INFO L290 TraceCheckUtils]: 71: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:22,180 INFO L290 TraceCheckUtils]: 70: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:22,180 INFO L290 TraceCheckUtils]: 69: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:22,180 INFO L290 TraceCheckUtils]: 68: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:22,180 INFO L290 TraceCheckUtils]: 67: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:22,180 INFO L290 TraceCheckUtils]: 66: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:22,180 INFO L290 TraceCheckUtils]: 65: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:22,180 INFO L290 TraceCheckUtils]: 64: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:22,180 INFO L290 TraceCheckUtils]: 63: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:22,180 INFO L290 TraceCheckUtils]: 62: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:22,180 INFO L290 TraceCheckUtils]: 61: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:22,180 INFO L290 TraceCheckUtils]: 60: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:22,181 INFO L290 TraceCheckUtils]: 59: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:22,181 INFO L290 TraceCheckUtils]: 58: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:22,181 INFO L290 TraceCheckUtils]: 57: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:22,181 INFO L290 TraceCheckUtils]: 56: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:22,181 INFO L290 TraceCheckUtils]: 55: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:22,181 INFO L290 TraceCheckUtils]: 54: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:22,181 INFO L290 TraceCheckUtils]: 53: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:22,181 INFO L290 TraceCheckUtils]: 52: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:22,181 INFO L290 TraceCheckUtils]: 51: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:22,182 INFO L290 TraceCheckUtils]: 50: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:22,182 INFO L290 TraceCheckUtils]: 49: Hoare triple {1576#false} main_~i~0#1 := 0; {1576#false} is VALID [2022-02-20 14:05:22,182 INFO L290 TraceCheckUtils]: 48: Hoare triple {1576#false} assume !(main_~i~0#1 < 100000); {1576#false} is VALID [2022-02-20 14:05:22,182 INFO L290 TraceCheckUtils]: 47: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:22,182 INFO L290 TraceCheckUtils]: 46: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:22,182 INFO L290 TraceCheckUtils]: 45: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:22,182 INFO L290 TraceCheckUtils]: 44: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:22,182 INFO L290 TraceCheckUtils]: 43: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:22,182 INFO L290 TraceCheckUtils]: 42: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:22,183 INFO L290 TraceCheckUtils]: 41: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:22,183 INFO L290 TraceCheckUtils]: 40: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:22,183 INFO L290 TraceCheckUtils]: 39: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:22,183 INFO L290 TraceCheckUtils]: 38: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:22,183 INFO L290 TraceCheckUtils]: 37: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:22,183 INFO L290 TraceCheckUtils]: 36: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:22,183 INFO L290 TraceCheckUtils]: 35: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:22,183 INFO L290 TraceCheckUtils]: 34: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:22,183 INFO L290 TraceCheckUtils]: 33: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:22,184 INFO L290 TraceCheckUtils]: 32: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:22,184 INFO L290 TraceCheckUtils]: 31: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:22,184 INFO L290 TraceCheckUtils]: 30: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:22,184 INFO L290 TraceCheckUtils]: 29: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:22,184 INFO L290 TraceCheckUtils]: 28: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:22,184 INFO L290 TraceCheckUtils]: 27: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:22,184 INFO L290 TraceCheckUtils]: 26: Hoare triple {1576#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1576#false} is VALID [2022-02-20 14:05:22,184 INFO L290 TraceCheckUtils]: 25: Hoare triple {1576#false} main_~i~0#1 := 0; {1576#false} is VALID [2022-02-20 14:05:22,185 INFO L290 TraceCheckUtils]: 24: Hoare triple {1988#(< |ULTIMATE.start_main_~i~0#1| 100000)} assume !(main_~i~0#1 < 100000); {1576#false} is VALID [2022-02-20 14:05:22,185 INFO L290 TraceCheckUtils]: 23: Hoare triple {1992#(< |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; {1988#(< |ULTIMATE.start_main_~i~0#1| 100000)} is VALID [2022-02-20 14:05:22,186 INFO L290 TraceCheckUtils]: 22: Hoare triple {1996#(< |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; {1992#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:05:22,186 INFO L290 TraceCheckUtils]: 21: Hoare triple {2000#(< |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; {1996#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:05:22,187 INFO L290 TraceCheckUtils]: 20: Hoare triple {2004#(< |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; {2000#(< |ULTIMATE.start_main_~i~0#1| 99997)} is VALID [2022-02-20 14:05:22,187 INFO L290 TraceCheckUtils]: 19: Hoare triple {2008#(< |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; {2004#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-20 14:05:22,188 INFO L290 TraceCheckUtils]: 18: Hoare triple {2012#(< |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; {2008#(< |ULTIMATE.start_main_~i~0#1| 99995)} is VALID [2022-02-20 14:05:22,188 INFO L290 TraceCheckUtils]: 17: Hoare triple {2016#(< |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; {2012#(< |ULTIMATE.start_main_~i~0#1| 99994)} is VALID [2022-02-20 14:05:22,189 INFO L290 TraceCheckUtils]: 16: Hoare triple {2020#(< |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; {2016#(< |ULTIMATE.start_main_~i~0#1| 99993)} is VALID [2022-02-20 14:05:22,189 INFO L290 TraceCheckUtils]: 15: Hoare triple {2024#(< |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; {2020#(< |ULTIMATE.start_main_~i~0#1| 99992)} is VALID [2022-02-20 14:05:22,189 INFO L290 TraceCheckUtils]: 14: Hoare triple {2028#(< |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; {2024#(< |ULTIMATE.start_main_~i~0#1| 99991)} is VALID [2022-02-20 14:05:22,190 INFO L290 TraceCheckUtils]: 13: Hoare triple {2032#(< |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; {2028#(< |ULTIMATE.start_main_~i~0#1| 99990)} is VALID [2022-02-20 14:05:22,190 INFO L290 TraceCheckUtils]: 12: Hoare triple {2036#(< |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; {2032#(< |ULTIMATE.start_main_~i~0#1| 99989)} is VALID [2022-02-20 14:05:22,191 INFO L290 TraceCheckUtils]: 11: Hoare triple {2040#(< |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; {2036#(< |ULTIMATE.start_main_~i~0#1| 99988)} is VALID [2022-02-20 14:05:22,192 INFO L290 TraceCheckUtils]: 10: Hoare triple {2044#(< |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; {2040#(< |ULTIMATE.start_main_~i~0#1| 99987)} is VALID [2022-02-20 14:05:22,192 INFO L290 TraceCheckUtils]: 9: Hoare triple {2048#(< |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; {2044#(< |ULTIMATE.start_main_~i~0#1| 99986)} is VALID [2022-02-20 14:05:22,193 INFO L290 TraceCheckUtils]: 8: Hoare triple {2052#(< |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; {2048#(< |ULTIMATE.start_main_~i~0#1| 99985)} is VALID [2022-02-20 14:05:22,193 INFO L290 TraceCheckUtils]: 7: Hoare triple {2056#(< |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; {2052#(< |ULTIMATE.start_main_~i~0#1| 99984)} is VALID [2022-02-20 14:05:22,193 INFO L290 TraceCheckUtils]: 6: Hoare triple {2060#(< |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; {2056#(< |ULTIMATE.start_main_~i~0#1| 99983)} is VALID [2022-02-20 14:05:22,194 INFO L290 TraceCheckUtils]: 5: Hoare triple {2064#(< |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; {2060#(< |ULTIMATE.start_main_~i~0#1| 99982)} is VALID [2022-02-20 14:05:22,194 INFO L290 TraceCheckUtils]: 4: Hoare triple {2068#(< |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; {2064#(< |ULTIMATE.start_main_~i~0#1| 99981)} is VALID [2022-02-20 14:05:22,195 INFO L290 TraceCheckUtils]: 3: Hoare triple {2072#(< |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; {2068#(< |ULTIMATE.start_main_~i~0#1| 99980)} is VALID [2022-02-20 14:05:22,195 INFO L290 TraceCheckUtils]: 2: Hoare triple {2076#(< |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; {2072#(< |ULTIMATE.start_main_~i~0#1| 99979)} is VALID [2022-02-20 14:05:22,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {1575#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; {2076#(< |ULTIMATE.start_main_~i~0#1| 99978)} is VALID [2022-02-20 14:05:22,196 INFO L290 TraceCheckUtils]: 0: Hoare triple {1575#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); {1575#true} is VALID [2022-02-20 14:05:22,196 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2022-02-20 14:05:22,197 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817714925] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:05:22,197 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:05:22,197 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2022-02-20 14:05:22,197 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121674873] [2022-02-20 14:05:22,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:05:22,198 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 49 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2022-02-20 14:05:22,198 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:05:22,198 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 49 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 49 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:22,228 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:05:22,228 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-02-20 14:05:22,228 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:05:22,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-02-20 14:05:22,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2022-02-20 14:05:22,230 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand has 49 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 49 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:23,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:05:23,063 INFO L93 Difference]: Finished difference Result 207 states and 284 transitions. [2022-02-20 14:05:23,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-02-20 14:05:23,063 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 49 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2022-02-20 14:05:23,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:05:23,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 49 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:23,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 240 transitions. [2022-02-20 14:05:23,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 49 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:23,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 240 transitions. [2022-02-20 14:05:23,070 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 240 transitions. [2022-02-20 14:05:23,219 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 240 edges. 240 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:05:23,221 INFO L225 Difference]: With dead ends: 207 [2022-02-20 14:05:23,221 INFO L226 Difference]: Without dead ends: 152 [2022-02-20 14:05:23,222 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2022-02-20 14:05:23,222 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 419 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 419 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 14:05:23,223 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [419 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 14:05:23,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-02-20 14:05:23,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2022-02-20 14:05:23,321 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:05:23,321 INFO L82 GeneralOperation]: Start isEquivalent. First operand 152 states. Second operand has 152 states, 151 states have (on average 1.0264900662251655) internal successors, (155), 151 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:23,321 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand has 152 states, 151 states have (on average 1.0264900662251655) internal successors, (155), 151 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:23,322 INFO L87 Difference]: Start difference. First operand 152 states. Second operand has 152 states, 151 states have (on average 1.0264900662251655) internal successors, (155), 151 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:23,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:05:23,325 INFO L93 Difference]: Finished difference Result 152 states and 155 transitions. [2022-02-20 14:05:23,325 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 155 transitions. [2022-02-20 14:05:23,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:05:23,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:05:23,328 INFO L74 IsIncluded]: Start isIncluded. First operand has 152 states, 151 states have (on average 1.0264900662251655) internal successors, (155), 151 states have internal predecessors, (155), 0 states have call successors, (0), 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 152 states. [2022-02-20 14:05:23,329 INFO L87 Difference]: Start difference. First operand has 152 states, 151 states have (on average 1.0264900662251655) internal successors, (155), 151 states have internal predecessors, (155), 0 states have call successors, (0), 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 152 states. [2022-02-20 14:05:23,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:05:23,331 INFO L93 Difference]: Finished difference Result 152 states and 155 transitions. [2022-02-20 14:05:23,331 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 155 transitions. [2022-02-20 14:05:23,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:05:23,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:05:23,332 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:05:23,332 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:05:23,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 151 states have (on average 1.0264900662251655) internal successors, (155), 151 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:23,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 155 transitions. [2022-02-20 14:05:23,334 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 155 transitions. Word has length 77 [2022-02-20 14:05:23,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:05:23,335 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 155 transitions. [2022-02-20 14:05:23,335 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 49 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:23,335 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 155 transitions. [2022-02-20 14:05:23,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-02-20 14:05:23,337 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:05:23,337 INFO L514 BasicCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:05:23,357 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-20 14:05:23,551 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:05:23,551 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:05:23,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:05:23,552 INFO L85 PathProgramCache]: Analyzing trace with hash -99643074, now seen corresponding path program 5 times [2022-02-20 14:05:23,552 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:05:23,552 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297892676] [2022-02-20 14:05:23,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:05:23,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:05:23,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:05:24,535 INFO L290 TraceCheckUtils]: 0: Hoare triple {3076#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); {3076#true} is VALID [2022-02-20 14:05:24,536 INFO L290 TraceCheckUtils]: 1: Hoare triple {3076#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; {3078#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:05:24,536 INFO L290 TraceCheckUtils]: 2: Hoare triple {3078#(= |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; {3079#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:05:24,537 INFO L290 TraceCheckUtils]: 3: Hoare triple {3079#(<= |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; {3080#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:05:24,539 INFO L290 TraceCheckUtils]: 4: Hoare triple {3080#(<= |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; {3081#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:05:24,540 INFO L290 TraceCheckUtils]: 5: Hoare triple {3081#(<= |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; {3082#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:05:24,540 INFO L290 TraceCheckUtils]: 6: Hoare triple {3082#(<= |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; {3083#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:05:24,541 INFO L290 TraceCheckUtils]: 7: Hoare triple {3083#(<= |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; {3084#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:05:24,541 INFO L290 TraceCheckUtils]: 8: Hoare triple {3084#(<= |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; {3085#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:05:24,542 INFO L290 TraceCheckUtils]: 9: Hoare triple {3085#(<= |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; {3086#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:05:24,542 INFO L290 TraceCheckUtils]: 10: Hoare triple {3086#(<= |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; {3087#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:05:24,543 INFO L290 TraceCheckUtils]: 11: Hoare triple {3087#(<= |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; {3088#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:05:24,543 INFO L290 TraceCheckUtils]: 12: Hoare triple {3088#(<= |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; {3089#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-20 14:05:24,544 INFO L290 TraceCheckUtils]: 13: Hoare triple {3089#(<= |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; {3090#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 14:05:24,544 INFO L290 TraceCheckUtils]: 14: Hoare triple {3090#(<= |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; {3091#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-20 14:05:24,544 INFO L290 TraceCheckUtils]: 15: Hoare triple {3091#(<= |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; {3092#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 14:05:24,545 INFO L290 TraceCheckUtils]: 16: Hoare triple {3092#(<= |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; {3093#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-20 14:05:24,545 INFO L290 TraceCheckUtils]: 17: Hoare triple {3093#(<= |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; {3094#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 14:05:24,546 INFO L290 TraceCheckUtils]: 18: Hoare triple {3094#(<= |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; {3095#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-20 14:05:24,546 INFO L290 TraceCheckUtils]: 19: Hoare triple {3095#(<= |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; {3096#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 14:05:24,546 INFO L290 TraceCheckUtils]: 20: Hoare triple {3096#(<= |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; {3097#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-20 14:05:24,547 INFO L290 TraceCheckUtils]: 21: Hoare triple {3097#(<= |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; {3098#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 14:05:24,547 INFO L290 TraceCheckUtils]: 22: Hoare triple {3098#(<= |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; {3099#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-20 14:05:24,548 INFO L290 TraceCheckUtils]: 23: Hoare triple {3099#(<= |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; {3100#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-20 14:05:24,548 INFO L290 TraceCheckUtils]: 24: Hoare triple {3100#(<= |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; {3101#(<= |ULTIMATE.start_main_~i~0#1| 23)} is VALID [2022-02-20 14:05:24,549 INFO L290 TraceCheckUtils]: 25: Hoare triple {3101#(<= |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; {3102#(<= |ULTIMATE.start_main_~i~0#1| 24)} is VALID [2022-02-20 14:05:24,551 INFO L290 TraceCheckUtils]: 26: Hoare triple {3102#(<= |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; {3103#(<= |ULTIMATE.start_main_~i~0#1| 25)} is VALID [2022-02-20 14:05:24,551 INFO L290 TraceCheckUtils]: 27: Hoare triple {3103#(<= |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; {3104#(<= |ULTIMATE.start_main_~i~0#1| 26)} is VALID [2022-02-20 14:05:24,551 INFO L290 TraceCheckUtils]: 28: Hoare triple {3104#(<= |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; {3105#(<= |ULTIMATE.start_main_~i~0#1| 27)} is VALID [2022-02-20 14:05:24,552 INFO L290 TraceCheckUtils]: 29: Hoare triple {3105#(<= |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; {3106#(<= |ULTIMATE.start_main_~i~0#1| 28)} is VALID [2022-02-20 14:05:24,552 INFO L290 TraceCheckUtils]: 30: Hoare triple {3106#(<= |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; {3107#(<= |ULTIMATE.start_main_~i~0#1| 29)} is VALID [2022-02-20 14:05:24,553 INFO L290 TraceCheckUtils]: 31: Hoare triple {3107#(<= |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; {3108#(<= |ULTIMATE.start_main_~i~0#1| 30)} is VALID [2022-02-20 14:05:24,553 INFO L290 TraceCheckUtils]: 32: Hoare triple {3108#(<= |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; {3109#(<= |ULTIMATE.start_main_~i~0#1| 31)} is VALID [2022-02-20 14:05:24,554 INFO L290 TraceCheckUtils]: 33: Hoare triple {3109#(<= |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; {3110#(<= |ULTIMATE.start_main_~i~0#1| 32)} is VALID [2022-02-20 14:05:24,554 INFO L290 TraceCheckUtils]: 34: Hoare triple {3110#(<= |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; {3111#(<= |ULTIMATE.start_main_~i~0#1| 33)} is VALID [2022-02-20 14:05:24,554 INFO L290 TraceCheckUtils]: 35: Hoare triple {3111#(<= |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; {3112#(<= |ULTIMATE.start_main_~i~0#1| 34)} is VALID [2022-02-20 14:05:24,555 INFO L290 TraceCheckUtils]: 36: Hoare triple {3112#(<= |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; {3113#(<= |ULTIMATE.start_main_~i~0#1| 35)} is VALID [2022-02-20 14:05:24,555 INFO L290 TraceCheckUtils]: 37: Hoare triple {3113#(<= |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; {3114#(<= |ULTIMATE.start_main_~i~0#1| 36)} is VALID [2022-02-20 14:05:24,556 INFO L290 TraceCheckUtils]: 38: Hoare triple {3114#(<= |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; {3115#(<= |ULTIMATE.start_main_~i~0#1| 37)} is VALID [2022-02-20 14:05:24,556 INFO L290 TraceCheckUtils]: 39: Hoare triple {3115#(<= |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; {3116#(<= |ULTIMATE.start_main_~i~0#1| 38)} is VALID [2022-02-20 14:05:24,557 INFO L290 TraceCheckUtils]: 40: Hoare triple {3116#(<= |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; {3117#(<= |ULTIMATE.start_main_~i~0#1| 39)} is VALID [2022-02-20 14:05:24,557 INFO L290 TraceCheckUtils]: 41: Hoare triple {3117#(<= |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; {3118#(<= |ULTIMATE.start_main_~i~0#1| 40)} is VALID [2022-02-20 14:05:24,557 INFO L290 TraceCheckUtils]: 42: Hoare triple {3118#(<= |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; {3119#(<= |ULTIMATE.start_main_~i~0#1| 41)} is VALID [2022-02-20 14:05:24,558 INFO L290 TraceCheckUtils]: 43: Hoare triple {3119#(<= |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; {3120#(<= |ULTIMATE.start_main_~i~0#1| 42)} is VALID [2022-02-20 14:05:24,558 INFO L290 TraceCheckUtils]: 44: Hoare triple {3120#(<= |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; {3121#(<= |ULTIMATE.start_main_~i~0#1| 43)} is VALID [2022-02-20 14:05:24,559 INFO L290 TraceCheckUtils]: 45: Hoare triple {3121#(<= |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; {3122#(<= |ULTIMATE.start_main_~i~0#1| 44)} is VALID [2022-02-20 14:05:24,559 INFO L290 TraceCheckUtils]: 46: Hoare triple {3122#(<= |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; {3123#(<= |ULTIMATE.start_main_~i~0#1| 45)} is VALID [2022-02-20 14:05:24,559 INFO L290 TraceCheckUtils]: 47: Hoare triple {3123#(<= |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; {3124#(<= |ULTIMATE.start_main_~i~0#1| 46)} is VALID [2022-02-20 14:05:24,560 INFO L290 TraceCheckUtils]: 48: Hoare triple {3124#(<= |ULTIMATE.start_main_~i~0#1| 46)} assume !(main_~i~0#1 < 100000); {3077#false} is VALID [2022-02-20 14:05:24,560 INFO L290 TraceCheckUtils]: 49: Hoare triple {3077#false} main_~i~0#1 := 0; {3077#false} is VALID [2022-02-20 14:05:24,560 INFO L290 TraceCheckUtils]: 50: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,560 INFO L290 TraceCheckUtils]: 51: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,560 INFO L290 TraceCheckUtils]: 52: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,560 INFO L290 TraceCheckUtils]: 53: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,560 INFO L290 TraceCheckUtils]: 54: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,560 INFO L290 TraceCheckUtils]: 55: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,560 INFO L290 TraceCheckUtils]: 56: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,560 INFO L290 TraceCheckUtils]: 57: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,560 INFO L290 TraceCheckUtils]: 58: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,560 INFO L290 TraceCheckUtils]: 59: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,561 INFO L290 TraceCheckUtils]: 60: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,561 INFO L290 TraceCheckUtils]: 61: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,561 INFO L290 TraceCheckUtils]: 62: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,561 INFO L290 TraceCheckUtils]: 63: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,561 INFO L290 TraceCheckUtils]: 64: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,561 INFO L290 TraceCheckUtils]: 65: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,561 INFO L290 TraceCheckUtils]: 66: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,561 INFO L290 TraceCheckUtils]: 67: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,561 INFO L290 TraceCheckUtils]: 68: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,561 INFO L290 TraceCheckUtils]: 69: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,562 INFO L290 TraceCheckUtils]: 70: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,562 INFO L290 TraceCheckUtils]: 71: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,562 INFO L290 TraceCheckUtils]: 72: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,562 INFO L290 TraceCheckUtils]: 73: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,562 INFO L290 TraceCheckUtils]: 74: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,562 INFO L290 TraceCheckUtils]: 75: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,562 INFO L290 TraceCheckUtils]: 76: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,562 INFO L290 TraceCheckUtils]: 77: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,562 INFO L290 TraceCheckUtils]: 78: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,562 INFO L290 TraceCheckUtils]: 79: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,563 INFO L290 TraceCheckUtils]: 80: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,563 INFO L290 TraceCheckUtils]: 81: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,563 INFO L290 TraceCheckUtils]: 82: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,563 INFO L290 TraceCheckUtils]: 83: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,563 INFO L290 TraceCheckUtils]: 84: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,563 INFO L290 TraceCheckUtils]: 85: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,563 INFO L290 TraceCheckUtils]: 86: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,563 INFO L290 TraceCheckUtils]: 87: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,563 INFO L290 TraceCheckUtils]: 88: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,563 INFO L290 TraceCheckUtils]: 89: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,563 INFO L290 TraceCheckUtils]: 90: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,563 INFO L290 TraceCheckUtils]: 91: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,563 INFO L290 TraceCheckUtils]: 92: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,564 INFO L290 TraceCheckUtils]: 93: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,564 INFO L290 TraceCheckUtils]: 94: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,564 INFO L290 TraceCheckUtils]: 95: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,564 INFO L290 TraceCheckUtils]: 96: Hoare triple {3077#false} assume !(main_~i~0#1 < 100000); {3077#false} is VALID [2022-02-20 14:05:24,564 INFO L290 TraceCheckUtils]: 97: Hoare triple {3077#false} main_~i~0#1 := 0; {3077#false} is VALID [2022-02-20 14:05:24,564 INFO L290 TraceCheckUtils]: 98: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,564 INFO L290 TraceCheckUtils]: 99: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,564 INFO L290 TraceCheckUtils]: 100: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,564 INFO L290 TraceCheckUtils]: 101: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,564 INFO L290 TraceCheckUtils]: 102: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,564 INFO L290 TraceCheckUtils]: 103: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,564 INFO L290 TraceCheckUtils]: 104: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,564 INFO L290 TraceCheckUtils]: 105: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,564 INFO L290 TraceCheckUtils]: 106: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,564 INFO L290 TraceCheckUtils]: 107: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,564 INFO L290 TraceCheckUtils]: 108: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,564 INFO L290 TraceCheckUtils]: 109: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,564 INFO L290 TraceCheckUtils]: 110: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,564 INFO L290 TraceCheckUtils]: 111: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,564 INFO L290 TraceCheckUtils]: 112: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,564 INFO L290 TraceCheckUtils]: 113: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,564 INFO L290 TraceCheckUtils]: 114: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,565 INFO L290 TraceCheckUtils]: 115: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,565 INFO L290 TraceCheckUtils]: 116: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,565 INFO L290 TraceCheckUtils]: 117: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,565 INFO L290 TraceCheckUtils]: 118: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,565 INFO L290 TraceCheckUtils]: 119: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,565 INFO L290 TraceCheckUtils]: 120: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,565 INFO L290 TraceCheckUtils]: 121: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,565 INFO L290 TraceCheckUtils]: 122: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,565 INFO L290 TraceCheckUtils]: 123: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,565 INFO L290 TraceCheckUtils]: 124: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,565 INFO L290 TraceCheckUtils]: 125: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,565 INFO L290 TraceCheckUtils]: 126: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,565 INFO L290 TraceCheckUtils]: 127: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,565 INFO L290 TraceCheckUtils]: 128: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,565 INFO L290 TraceCheckUtils]: 129: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,565 INFO L290 TraceCheckUtils]: 130: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,565 INFO L290 TraceCheckUtils]: 131: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,565 INFO L290 TraceCheckUtils]: 132: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,565 INFO L290 TraceCheckUtils]: 133: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,565 INFO L290 TraceCheckUtils]: 134: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,565 INFO L290 TraceCheckUtils]: 135: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,565 INFO L290 TraceCheckUtils]: 136: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,565 INFO L290 TraceCheckUtils]: 137: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,566 INFO L290 TraceCheckUtils]: 138: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,566 INFO L290 TraceCheckUtils]: 139: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,566 INFO L290 TraceCheckUtils]: 140: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,566 INFO L290 TraceCheckUtils]: 141: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,566 INFO L290 TraceCheckUtils]: 142: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,566 INFO L290 TraceCheckUtils]: 143: Hoare triple {3077#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3077#false} is VALID [2022-02-20 14:05:24,566 INFO L290 TraceCheckUtils]: 144: Hoare triple {3077#false} assume !(main_~i~0#1 < 100000); {3077#false} is VALID [2022-02-20 14:05:24,566 INFO L290 TraceCheckUtils]: 145: Hoare triple {3077#false} havoc main_~x~0#1;main_~x~0#1 := 0; {3077#false} is VALID [2022-02-20 14:05:24,566 INFO L290 TraceCheckUtils]: 146: Hoare triple {3077#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 43 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3077#false} is VALID [2022-02-20 14:05:24,566 INFO L290 TraceCheckUtils]: 147: Hoare triple {3077#false} assume 0 == __VERIFIER_assert_~cond#1; {3077#false} is VALID [2022-02-20 14:05:24,566 INFO L290 TraceCheckUtils]: 148: Hoare triple {3077#false} assume !false; {3077#false} is VALID [2022-02-20 14:05:24,568 INFO L134 CoverageAnalysis]: Checked inductivity of 3243 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 2162 trivial. 0 not checked. [2022-02-20 14:05:24,568 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:05:24,568 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297892676] [2022-02-20 14:05:24,568 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297892676] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:05:24,568 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1962752216] [2022-02-20 14:05:24,568 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-20 14:05:24,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:05:24,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:05:24,569 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:05:24,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process