./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/MADWiFi-encode_ie_ok.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/loop-invgen/MADWiFi-encode_ie_ok.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 0816346248b67d4ea9c17aaea510056f7cd51786d8081f1e3a68c606118ae1c9 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:02:22,525 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:02:22,528 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:02:22,571 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:02:22,577 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:02:22,581 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:02:22,583 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:02:22,586 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:02:22,588 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:02:22,594 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:02:22,594 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:02:22,595 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:02:22,596 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:02:22,598 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:02:22,599 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:02:22,601 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:02:22,602 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:02:22,603 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:02:22,607 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:02:22,609 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:02:22,613 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:02:22,614 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:02:22,614 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:02:22,616 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:02:22,619 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:02:22,620 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:02:22,620 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:02:22,621 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:02:22,622 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:02:22,622 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:02:22,623 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:02:22,624 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:02:22,625 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:02:22,626 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:02:22,627 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:02:22,627 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:02:22,628 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:02:22,628 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:02:22,628 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:02:22,629 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:02:22,630 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:02:22,630 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 17:02:22,664 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:02:22,664 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:02:22,664 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:02:22,665 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:02:22,665 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:02:22,666 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:02:22,666 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:02:22,666 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:02:22,667 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:02:22,667 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:02:22,668 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:02:22,668 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:02:22,668 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:02:22,669 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:02:22,669 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:02:22,669 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:02:22,669 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:02:22,669 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:02:22,670 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:02:22,670 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:02:22,670 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:02:22,670 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:02:22,670 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:02:22,671 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:02:22,671 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:02:22,671 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:02:22,671 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:02:22,672 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:02:22,673 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:02:22,673 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:02:22,673 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:02:22,673 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:02:22,674 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:02:22,674 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 -> 0816346248b67d4ea9c17aaea510056f7cd51786d8081f1e3a68c606118ae1c9 [2022-02-20 17:02:22,888 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:02:22,913 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:02:22,916 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:02:22,917 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:02:22,917 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:02:22,918 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/MADWiFi-encode_ie_ok.i [2022-02-20 17:02:22,990 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/346ff6efd/858925a2e7344440ae2a0ca421d10866/FLAG26f916a7b [2022-02-20 17:02:23,394 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:02:23,395 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/MADWiFi-encode_ie_ok.i [2022-02-20 17:02:23,404 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/346ff6efd/858925a2e7344440ae2a0ca421d10866/FLAG26f916a7b [2022-02-20 17:02:23,811 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/346ff6efd/858925a2e7344440ae2a0ca421d10866 [2022-02-20 17:02:23,818 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:02:23,821 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:02:23,823 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:02:23,823 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:02:23,826 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:02:23,827 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:02:23" (1/1) ... [2022-02-20 17:02:23,829 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@646ebb47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:02:23, skipping insertion in model container [2022-02-20 17:02:23,829 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:02:23" (1/1) ... [2022-02-20 17:02:23,835 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:02:23,850 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:02:24,015 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/loop-invgen/MADWiFi-encode_ie_ok.i[893,906] [2022-02-20 17:02:24,053 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:02:24,060 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:02:24,071 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/loop-invgen/MADWiFi-encode_ie_ok.i[893,906] [2022-02-20 17:02:24,076 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:02:24,088 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:02:24,089 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:02:24 WrapperNode [2022-02-20 17:02:24,089 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:02:24,090 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:02:24,090 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:02:24,090 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:02:24,096 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:02:24" (1/1) ... [2022-02-20 17:02:24,102 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:02:24" (1/1) ... [2022-02-20 17:02:24,120 INFO L137 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 59 [2022-02-20 17:02:24,120 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:02:24,121 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:02:24,121 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:02:24,121 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:02:24,129 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:02:24" (1/1) ... [2022-02-20 17:02:24,129 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:02:24" (1/1) ... [2022-02-20 17:02:24,130 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:02:24" (1/1) ... [2022-02-20 17:02:24,131 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:02:24" (1/1) ... [2022-02-20 17:02:24,134 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:02:24" (1/1) ... [2022-02-20 17:02:24,137 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:02:24" (1/1) ... [2022-02-20 17:02:24,139 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:02:24" (1/1) ... [2022-02-20 17:02:24,140 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:02:24,141 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:02:24,141 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:02:24,141 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:02:24,142 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:02:24" (1/1) ... [2022-02-20 17:02:24,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:02:24,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:02:24,171 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 17:02:24,173 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 17:02:24,199 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:02:24,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:02:24,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:02:24,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:02:24,200 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:02:24,200 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:02:24,251 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:02:24,253 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:02:24,497 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:02:24,503 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:02:24,519 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 17:02:24,521 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:02:24 BoogieIcfgContainer [2022-02-20 17:02:24,521 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:02:24,522 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:02:24,523 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:02:24,532 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:02:24,532 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:02:23" (1/3) ... [2022-02-20 17:02:24,533 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69bc4c0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:02:24, skipping insertion in model container [2022-02-20 17:02:24,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:02:24" (2/3) ... [2022-02-20 17:02:24,533 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69bc4c0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:02:24, skipping insertion in model container [2022-02-20 17:02:24,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:02:24" (3/3) ... [2022-02-20 17:02:24,534 INFO L111 eAbstractionObserver]: Analyzing ICFG MADWiFi-encode_ie_ok.i [2022-02-20 17:02:24,539 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:02:24,539 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:02:24,587 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:02:24,593 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 17:02:24,593 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:02:24,616 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 19 states have (on average 1.631578947368421) internal successors, (31), 20 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:02:24,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 17:02:24,620 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:02:24,620 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:02:24,621 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:02:24,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:02:24,625 INFO L85 PathProgramCache]: Analyzing trace with hash 520960662, now seen corresponding path program 1 times [2022-02-20 17:02:24,632 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:02:24,632 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649872333] [2022-02-20 17:02:24,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:02:24,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:02:24,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:24,911 INFO L290 TraceCheckUtils]: 0: Hoare triple {27#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(9, 2); {27#true} is VALID [2022-02-20 17:02:24,911 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_~p~0#1, main_~i~0#1, main_~leader_len~0#1, main_~bufsize~0#1, main_~bufsize_0~0#1, main_~ielen~0#1;havoc main_~p~0#1;havoc main_~i~0#1;havoc main_~leader_len~0#1;havoc main_~bufsize~0#1;havoc main_~bufsize_0~0#1;havoc main_~ielen~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~leader_len~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~bufsize~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~ielen~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {27#true} is VALID [2022-02-20 17:02:24,912 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#true} assume !!(main_~leader_len~0#1 < 1000000); {27#true} is VALID [2022-02-20 17:02:24,912 INFO L290 TraceCheckUtils]: 3: Hoare triple {27#true} assume !!(main_~bufsize~0#1 < 1000000); {27#true} is VALID [2022-02-20 17:02:24,913 INFO L290 TraceCheckUtils]: 4: Hoare triple {27#true} assume !!(main_~ielen~0#1 < 1000000); {27#true} is VALID [2022-02-20 17:02:24,914 INFO L290 TraceCheckUtils]: 5: Hoare triple {27#true} assume main_~leader_len~0#1 > 0; {29#(<= 1 |ULTIMATE.start_main_~leader_len~0#1|)} is VALID [2022-02-20 17:02:24,914 INFO L290 TraceCheckUtils]: 6: Hoare triple {29#(<= 1 |ULTIMATE.start_main_~leader_len~0#1|)} assume main_~bufsize~0#1 > 0; {29#(<= 1 |ULTIMATE.start_main_~leader_len~0#1|)} is VALID [2022-02-20 17:02:24,915 INFO L290 TraceCheckUtils]: 7: Hoare triple {29#(<= 1 |ULTIMATE.start_main_~leader_len~0#1|)} assume main_~ielen~0#1 > 0; {29#(<= 1 |ULTIMATE.start_main_~leader_len~0#1|)} is VALID [2022-02-20 17:02:24,917 INFO L290 TraceCheckUtils]: 8: Hoare triple {29#(<= 1 |ULTIMATE.start_main_~leader_len~0#1|)} assume !(main_~bufsize~0#1 < main_~leader_len~0#1);main_~p~0#1 := 0;main_~bufsize_0~0#1 := main_~bufsize~0#1;main_~bufsize~0#1 := main_~bufsize~0#1 - main_~leader_len~0#1;main_~p~0#1 := main_~p~0#1 + main_~leader_len~0#1; {30#(<= 1 |ULTIMATE.start_main_~p~0#1|)} is VALID [2022-02-20 17:02:24,918 INFO L290 TraceCheckUtils]: 9: Hoare triple {30#(<= 1 |ULTIMATE.start_main_~p~0#1|)} assume !(main_~bufsize~0#1 < 2 * main_~ielen~0#1);main_~i~0#1 := 0; {30#(<= 1 |ULTIMATE.start_main_~p~0#1|)} is VALID [2022-02-20 17:02:24,919 INFO L290 TraceCheckUtils]: 10: Hoare triple {30#(<= 1 |ULTIMATE.start_main_~p~0#1|)} assume !!(main_~i~0#1 < main_~ielen~0#1 && main_~bufsize~0#1 > 2); {30#(<= 1 |ULTIMATE.start_main_~p~0#1|)} is VALID [2022-02-20 17:02:24,921 INFO L272 TraceCheckUtils]: 11: Hoare triple {30#(<= 1 |ULTIMATE.start_main_~p~0#1|)} call __VERIFIER_assert((if 0 <= main_~p~0#1 then 1 else 0)); {31#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:02:24,921 INFO L290 TraceCheckUtils]: 12: Hoare triple {31#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {32#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:02:24,922 INFO L290 TraceCheckUtils]: 13: Hoare triple {32#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {28#false} is VALID [2022-02-20 17:02:24,922 INFO L290 TraceCheckUtils]: 14: Hoare triple {28#false} assume !false; {28#false} is VALID [2022-02-20 17:02:24,923 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 17:02:24,924 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:02:24,925 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649872333] [2022-02-20 17:02:24,926 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649872333] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:02:24,927 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:02:24,927 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 17:02:24,930 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419999101] [2022-02-20 17:02:24,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:02:24,936 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 17:02:24,937 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:02:24,940 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:02:24,965 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:24,966 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 17:02:24,966 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:02:24,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 17:02:24,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:02:24,992 INFO L87 Difference]: Start difference. First operand has 24 states, 19 states have (on average 1.631578947368421) internal successors, (31), 20 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:02:25,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:25,222 INFO L93 Difference]: Finished difference Result 48 states and 62 transitions. [2022-02-20 17:02:25,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 17:02:25,223 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 17:02:25,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:02:25,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:02:25,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2022-02-20 17:02:25,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:02:25,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2022-02-20 17:02:25,248 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 62 transitions. [2022-02-20 17:02:25,311 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:25,320 INFO L225 Difference]: With dead ends: 48 [2022-02-20 17:02:25,320 INFO L226 Difference]: Without dead ends: 25 [2022-02-20 17:02:25,322 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-20 17:02:25,328 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 22 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:02:25,329 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 116 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:02:25,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-02-20 17:02:25,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-02-20 17:02:25,360 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:02:25,361 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:02:25,362 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:02:25,363 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:02:25,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:25,366 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-02-20 17:02:25,367 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-02-20 17:02:25,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:25,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:25,368 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 25 states. [2022-02-20 17:02:25,368 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 25 states. [2022-02-20 17:02:25,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:25,370 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-02-20 17:02:25,370 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-02-20 17:02:25,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:25,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:25,371 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:02:25,371 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:02:25,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:02:25,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2022-02-20 17:02:25,374 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 15 [2022-02-20 17:02:25,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:02:25,375 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2022-02-20 17:02:25,375 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:02:25,375 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-02-20 17:02:25,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 17:02:25,376 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:02:25,383 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:02:25,385 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:02:25,386 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:02:25,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:02:25,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1333283339, now seen corresponding path program 1 times [2022-02-20 17:02:25,389 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:02:25,390 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704250945] [2022-02-20 17:02:25,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:02:25,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:02:25,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:25,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 17:02:25,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:25,534 INFO L290 TraceCheckUtils]: 0: Hoare triple {180#true} ~cond := #in~cond; {180#true} is VALID [2022-02-20 17:02:25,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {180#true} assume !(0 == ~cond); {180#true} is VALID [2022-02-20 17:02:25,535 INFO L290 TraceCheckUtils]: 2: Hoare triple {180#true} assume true; {180#true} is VALID [2022-02-20 17:02:25,536 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {180#true} {183#(<= (+ 3 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|)} #76#return; {183#(<= (+ 3 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|)} is VALID [2022-02-20 17:02:25,536 INFO L290 TraceCheckUtils]: 0: Hoare triple {180#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(9, 2); {180#true} is VALID [2022-02-20 17:02:25,536 INFO L290 TraceCheckUtils]: 1: Hoare triple {180#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_~p~0#1, main_~i~0#1, main_~leader_len~0#1, main_~bufsize~0#1, main_~bufsize_0~0#1, main_~ielen~0#1;havoc main_~p~0#1;havoc main_~i~0#1;havoc main_~leader_len~0#1;havoc main_~bufsize~0#1;havoc main_~bufsize_0~0#1;havoc main_~ielen~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~leader_len~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~bufsize~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~ielen~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {180#true} is VALID [2022-02-20 17:02:25,536 INFO L290 TraceCheckUtils]: 2: Hoare triple {180#true} assume !!(main_~leader_len~0#1 < 1000000); {180#true} is VALID [2022-02-20 17:02:25,537 INFO L290 TraceCheckUtils]: 3: Hoare triple {180#true} assume !!(main_~bufsize~0#1 < 1000000); {180#true} is VALID [2022-02-20 17:02:25,537 INFO L290 TraceCheckUtils]: 4: Hoare triple {180#true} assume !!(main_~ielen~0#1 < 1000000); {180#true} is VALID [2022-02-20 17:02:25,537 INFO L290 TraceCheckUtils]: 5: Hoare triple {180#true} assume main_~leader_len~0#1 > 0; {180#true} is VALID [2022-02-20 17:02:25,537 INFO L290 TraceCheckUtils]: 6: Hoare triple {180#true} assume main_~bufsize~0#1 > 0; {180#true} is VALID [2022-02-20 17:02:25,537 INFO L290 TraceCheckUtils]: 7: Hoare triple {180#true} assume main_~ielen~0#1 > 0; {180#true} is VALID [2022-02-20 17:02:25,538 INFO L290 TraceCheckUtils]: 8: Hoare triple {180#true} assume !(main_~bufsize~0#1 < main_~leader_len~0#1);main_~p~0#1 := 0;main_~bufsize_0~0#1 := main_~bufsize~0#1;main_~bufsize~0#1 := main_~bufsize~0#1 - main_~leader_len~0#1;main_~p~0#1 := main_~p~0#1 + main_~leader_len~0#1; {182#(<= (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~bufsize~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|)} is VALID [2022-02-20 17:02:25,538 INFO L290 TraceCheckUtils]: 9: Hoare triple {182#(<= (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~bufsize~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|)} assume !(main_~bufsize~0#1 < 2 * main_~ielen~0#1);main_~i~0#1 := 0; {182#(<= (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~bufsize~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|)} is VALID [2022-02-20 17:02:25,539 INFO L290 TraceCheckUtils]: 10: Hoare triple {182#(<= (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~bufsize~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|)} assume !!(main_~i~0#1 < main_~ielen~0#1 && main_~bufsize~0#1 > 2); {183#(<= (+ 3 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|)} is VALID [2022-02-20 17:02:25,539 INFO L272 TraceCheckUtils]: 11: Hoare triple {183#(<= (+ 3 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|)} call __VERIFIER_assert((if 0 <= main_~p~0#1 then 1 else 0)); {180#true} is VALID [2022-02-20 17:02:25,540 INFO L290 TraceCheckUtils]: 12: Hoare triple {180#true} ~cond := #in~cond; {180#true} is VALID [2022-02-20 17:02:25,540 INFO L290 TraceCheckUtils]: 13: Hoare triple {180#true} assume !(0 == ~cond); {180#true} is VALID [2022-02-20 17:02:25,540 INFO L290 TraceCheckUtils]: 14: Hoare triple {180#true} assume true; {180#true} is VALID [2022-02-20 17:02:25,541 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {180#true} {183#(<= (+ 3 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|)} #76#return; {183#(<= (+ 3 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|)} is VALID [2022-02-20 17:02:25,542 INFO L272 TraceCheckUtils]: 16: Hoare triple {183#(<= (+ 3 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|)} call __VERIFIER_assert((if 1 + main_~p~0#1 < main_~bufsize_0~0#1 then 1 else 0)); {188#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:02:25,542 INFO L290 TraceCheckUtils]: 17: Hoare triple {188#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {189#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:02:25,543 INFO L290 TraceCheckUtils]: 18: Hoare triple {189#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {181#false} is VALID [2022-02-20 17:02:25,543 INFO L290 TraceCheckUtils]: 19: Hoare triple {181#false} assume !false; {181#false} is VALID [2022-02-20 17:02:25,543 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:02:25,543 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:02:25,544 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704250945] [2022-02-20 17:02:25,544 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704250945] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:02:25,544 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:02:25,544 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 17:02:25,544 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835234433] [2022-02-20 17:02:25,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:02:25,546 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-02-20 17:02:25,546 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:02:25,546 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:02:25,564 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:25,564 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 17:02:25,564 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:02:25,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 17:02:25,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:02:25,566 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:02:25,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:25,728 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2022-02-20 17:02:25,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 17:02:25,728 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-02-20 17:02:25,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:02:25,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:02:25,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 33 transitions. [2022-02-20 17:02:25,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:02:25,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 33 transitions. [2022-02-20 17:02:25,732 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 33 transitions. [2022-02-20 17:02:25,766 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:25,768 INFO L225 Difference]: With dead ends: 35 [2022-02-20 17:02:25,768 INFO L226 Difference]: Without dead ends: 33 [2022-02-20 17:02:25,768 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-20 17:02:25,769 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 5 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:02:25,770 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 89 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:02:25,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-02-20 17:02:25,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2022-02-20 17:02:25,785 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:02:25,785 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 32 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 25 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:02:25,786 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 32 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 25 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:02:25,786 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 32 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 25 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:02:25,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:25,794 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2022-02-20 17:02:25,794 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2022-02-20 17:02:25,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:25,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:25,795 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 25 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 33 states. [2022-02-20 17:02:25,796 INFO L87 Difference]: Start difference. First operand has 32 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 25 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 33 states. [2022-02-20 17:02:25,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:25,799 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2022-02-20 17:02:25,799 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2022-02-20 17:02:25,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:25,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:25,800 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:02:25,800 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:02:25,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 25 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:02:25,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2022-02-20 17:02:25,804 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 20 [2022-02-20 17:02:25,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:02:25,805 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2022-02-20 17:02:25,805 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:02:25,806 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2022-02-20 17:02:25,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-20 17:02:25,807 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:02:25,807 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:02:25,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 17:02:25,808 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:02:25,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:02:25,808 INFO L85 PathProgramCache]: Analyzing trace with hash 74755898, now seen corresponding path program 1 times [2022-02-20 17:02:25,809 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:02:25,809 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446363565] [2022-02-20 17:02:25,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:02:25,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:02:25,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:25,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 17:02:25,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:25,960 INFO L290 TraceCheckUtils]: 0: Hoare triple {347#true} ~cond := #in~cond; {347#true} is VALID [2022-02-20 17:02:25,960 INFO L290 TraceCheckUtils]: 1: Hoare triple {347#true} assume !(0 == ~cond); {347#true} is VALID [2022-02-20 17:02:25,961 INFO L290 TraceCheckUtils]: 2: Hoare triple {347#true} assume true; {347#true} is VALID [2022-02-20 17:02:25,962 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {347#true} {350#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) |ULTIMATE.start_main_~bufsize_0~0#1|))} #76#return; {350#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) |ULTIMATE.start_main_~bufsize_0~0#1|))} is VALID [2022-02-20 17:02:25,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 17:02:25,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:25,978 INFO L290 TraceCheckUtils]: 0: Hoare triple {347#true} ~cond := #in~cond; {347#true} is VALID [2022-02-20 17:02:25,978 INFO L290 TraceCheckUtils]: 1: Hoare triple {347#true} assume !(0 == ~cond); {347#true} is VALID [2022-02-20 17:02:25,978 INFO L290 TraceCheckUtils]: 2: Hoare triple {347#true} assume true; {347#true} is VALID [2022-02-20 17:02:25,979 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {347#true} {350#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) |ULTIMATE.start_main_~bufsize_0~0#1|))} #78#return; {350#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) |ULTIMATE.start_main_~bufsize_0~0#1|))} is VALID [2022-02-20 17:02:25,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-02-20 17:02:25,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:25,990 INFO L290 TraceCheckUtils]: 0: Hoare triple {347#true} ~cond := #in~cond; {347#true} is VALID [2022-02-20 17:02:25,991 INFO L290 TraceCheckUtils]: 1: Hoare triple {347#true} assume !(0 == ~cond); {347#true} is VALID [2022-02-20 17:02:25,991 INFO L290 TraceCheckUtils]: 2: Hoare triple {347#true} assume true; {347#true} is VALID [2022-02-20 17:02:25,992 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {347#true} {361#(<= (+ 2 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|)} #76#return; {361#(<= (+ 2 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|)} is VALID [2022-02-20 17:02:25,993 INFO L290 TraceCheckUtils]: 0: Hoare triple {347#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(9, 2); {347#true} is VALID [2022-02-20 17:02:25,993 INFO L290 TraceCheckUtils]: 1: Hoare triple {347#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_~p~0#1, main_~i~0#1, main_~leader_len~0#1, main_~bufsize~0#1, main_~bufsize_0~0#1, main_~ielen~0#1;havoc main_~p~0#1;havoc main_~i~0#1;havoc main_~leader_len~0#1;havoc main_~bufsize~0#1;havoc main_~bufsize_0~0#1;havoc main_~ielen~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~leader_len~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~bufsize~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~ielen~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {347#true} is VALID [2022-02-20 17:02:25,995 INFO L290 TraceCheckUtils]: 2: Hoare triple {347#true} assume !!(main_~leader_len~0#1 < 1000000); {347#true} is VALID [2022-02-20 17:02:25,995 INFO L290 TraceCheckUtils]: 3: Hoare triple {347#true} assume !!(main_~bufsize~0#1 < 1000000); {347#true} is VALID [2022-02-20 17:02:25,995 INFO L290 TraceCheckUtils]: 4: Hoare triple {347#true} assume !!(main_~ielen~0#1 < 1000000); {347#true} is VALID [2022-02-20 17:02:25,996 INFO L290 TraceCheckUtils]: 5: Hoare triple {347#true} assume main_~leader_len~0#1 > 0; {347#true} is VALID [2022-02-20 17:02:25,996 INFO L290 TraceCheckUtils]: 6: Hoare triple {347#true} assume main_~bufsize~0#1 > 0; {347#true} is VALID [2022-02-20 17:02:25,996 INFO L290 TraceCheckUtils]: 7: Hoare triple {347#true} assume main_~ielen~0#1 > 0; {347#true} is VALID [2022-02-20 17:02:25,999 INFO L290 TraceCheckUtils]: 8: Hoare triple {347#true} assume !(main_~bufsize~0#1 < main_~leader_len~0#1);main_~p~0#1 := 0;main_~bufsize_0~0#1 := main_~bufsize~0#1;main_~bufsize~0#1 := main_~bufsize~0#1 - main_~leader_len~0#1;main_~p~0#1 := main_~p~0#1 + main_~leader_len~0#1; {349#(<= (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~bufsize~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|)} is VALID [2022-02-20 17:02:26,000 INFO L290 TraceCheckUtils]: 9: Hoare triple {349#(<= (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~bufsize~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|)} assume !(main_~bufsize~0#1 < 2 * main_~ielen~0#1);main_~i~0#1 := 0; {350#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) |ULTIMATE.start_main_~bufsize_0~0#1|))} is VALID [2022-02-20 17:02:26,001 INFO L290 TraceCheckUtils]: 10: Hoare triple {350#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) |ULTIMATE.start_main_~bufsize_0~0#1|))} assume !!(main_~i~0#1 < main_~ielen~0#1 && main_~bufsize~0#1 > 2); {350#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) |ULTIMATE.start_main_~bufsize_0~0#1|))} is VALID [2022-02-20 17:02:26,001 INFO L272 TraceCheckUtils]: 11: Hoare triple {350#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) |ULTIMATE.start_main_~bufsize_0~0#1|))} call __VERIFIER_assert((if 0 <= main_~p~0#1 then 1 else 0)); {347#true} is VALID [2022-02-20 17:02:26,002 INFO L290 TraceCheckUtils]: 12: Hoare triple {347#true} ~cond := #in~cond; {347#true} is VALID [2022-02-20 17:02:26,002 INFO L290 TraceCheckUtils]: 13: Hoare triple {347#true} assume !(0 == ~cond); {347#true} is VALID [2022-02-20 17:02:26,002 INFO L290 TraceCheckUtils]: 14: Hoare triple {347#true} assume true; {347#true} is VALID [2022-02-20 17:02:26,003 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {347#true} {350#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) |ULTIMATE.start_main_~bufsize_0~0#1|))} #76#return; {350#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) |ULTIMATE.start_main_~bufsize_0~0#1|))} is VALID [2022-02-20 17:02:26,004 INFO L272 TraceCheckUtils]: 16: Hoare triple {350#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) |ULTIMATE.start_main_~bufsize_0~0#1|))} call __VERIFIER_assert((if 1 + main_~p~0#1 < main_~bufsize_0~0#1 then 1 else 0)); {347#true} is VALID [2022-02-20 17:02:26,004 INFO L290 TraceCheckUtils]: 17: Hoare triple {347#true} ~cond := #in~cond; {347#true} is VALID [2022-02-20 17:02:26,004 INFO L290 TraceCheckUtils]: 18: Hoare triple {347#true} assume !(0 == ~cond); {347#true} is VALID [2022-02-20 17:02:26,004 INFO L290 TraceCheckUtils]: 19: Hoare triple {347#true} assume true; {347#true} is VALID [2022-02-20 17:02:26,006 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {347#true} {350#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) |ULTIMATE.start_main_~bufsize_0~0#1|))} #78#return; {350#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) |ULTIMATE.start_main_~bufsize_0~0#1|))} is VALID [2022-02-20 17:02:26,008 INFO L290 TraceCheckUtils]: 21: Hoare triple {350#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) |ULTIMATE.start_main_~bufsize_0~0#1|))} main_~p~0#1 := 2 + main_~p~0#1; {359#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) (+ 2 |ULTIMATE.start_main_~bufsize_0~0#1|)))} is VALID [2022-02-20 17:02:26,010 INFO L290 TraceCheckUtils]: 22: Hoare triple {359#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) (+ 2 |ULTIMATE.start_main_~bufsize_0~0#1|)))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {360#(<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) (+ (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|))} is VALID [2022-02-20 17:02:26,010 INFO L290 TraceCheckUtils]: 23: Hoare triple {360#(<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) (+ (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|))} assume !!(main_~i~0#1 < main_~ielen~0#1 && main_~bufsize~0#1 > 2); {361#(<= (+ 2 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|)} is VALID [2022-02-20 17:02:26,011 INFO L272 TraceCheckUtils]: 24: Hoare triple {361#(<= (+ 2 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|)} call __VERIFIER_assert((if 0 <= main_~p~0#1 then 1 else 0)); {347#true} is VALID [2022-02-20 17:02:26,011 INFO L290 TraceCheckUtils]: 25: Hoare triple {347#true} ~cond := #in~cond; {347#true} is VALID [2022-02-20 17:02:26,012 INFO L290 TraceCheckUtils]: 26: Hoare triple {347#true} assume !(0 == ~cond); {347#true} is VALID [2022-02-20 17:02:26,012 INFO L290 TraceCheckUtils]: 27: Hoare triple {347#true} assume true; {347#true} is VALID [2022-02-20 17:02:26,013 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {347#true} {361#(<= (+ 2 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|)} #76#return; {361#(<= (+ 2 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|)} is VALID [2022-02-20 17:02:26,014 INFO L272 TraceCheckUtils]: 29: Hoare triple {361#(<= (+ 2 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|)} call __VERIFIER_assert((if 1 + main_~p~0#1 < main_~bufsize_0~0#1 then 1 else 0)); {366#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:02:26,015 INFO L290 TraceCheckUtils]: 30: Hoare triple {366#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {367#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:02:26,015 INFO L290 TraceCheckUtils]: 31: Hoare triple {367#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {348#false} is VALID [2022-02-20 17:02:26,015 INFO L290 TraceCheckUtils]: 32: Hoare triple {348#false} assume !false; {348#false} is VALID [2022-02-20 17:02:26,016 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 17:02:26,016 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:02:26,016 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446363565] [2022-02-20 17:02:26,016 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446363565] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:02:26,017 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910785884] [2022-02-20 17:02:26,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:02:26,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:02:26,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:02:26,019 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 17:02:26,055 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 17:02:26,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:26,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 17:02:26,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:26,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:02:26,511 INFO L290 TraceCheckUtils]: 0: Hoare triple {347#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(9, 2); {347#true} is VALID [2022-02-20 17:02:26,511 INFO L290 TraceCheckUtils]: 1: Hoare triple {347#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_~p~0#1, main_~i~0#1, main_~leader_len~0#1, main_~bufsize~0#1, main_~bufsize_0~0#1, main_~ielen~0#1;havoc main_~p~0#1;havoc main_~i~0#1;havoc main_~leader_len~0#1;havoc main_~bufsize~0#1;havoc main_~bufsize_0~0#1;havoc main_~ielen~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~leader_len~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~bufsize~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~ielen~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {347#true} is VALID [2022-02-20 17:02:26,512 INFO L290 TraceCheckUtils]: 2: Hoare triple {347#true} assume !!(main_~leader_len~0#1 < 1000000); {347#true} is VALID [2022-02-20 17:02:26,512 INFO L290 TraceCheckUtils]: 3: Hoare triple {347#true} assume !!(main_~bufsize~0#1 < 1000000); {347#true} is VALID [2022-02-20 17:02:26,512 INFO L290 TraceCheckUtils]: 4: Hoare triple {347#true} assume !!(main_~ielen~0#1 < 1000000); {347#true} is VALID [2022-02-20 17:02:26,512 INFO L290 TraceCheckUtils]: 5: Hoare triple {347#true} assume main_~leader_len~0#1 > 0; {347#true} is VALID [2022-02-20 17:02:26,512 INFO L290 TraceCheckUtils]: 6: Hoare triple {347#true} assume main_~bufsize~0#1 > 0; {347#true} is VALID [2022-02-20 17:02:26,513 INFO L290 TraceCheckUtils]: 7: Hoare triple {347#true} assume main_~ielen~0#1 > 0; {347#true} is VALID [2022-02-20 17:02:26,513 INFO L290 TraceCheckUtils]: 8: Hoare triple {347#true} assume !(main_~bufsize~0#1 < main_~leader_len~0#1);main_~p~0#1 := 0;main_~bufsize_0~0#1 := main_~bufsize~0#1;main_~bufsize~0#1 := main_~bufsize~0#1 - main_~leader_len~0#1;main_~p~0#1 := main_~p~0#1 + main_~leader_len~0#1; {349#(<= (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~bufsize~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|)} is VALID [2022-02-20 17:02:26,514 INFO L290 TraceCheckUtils]: 9: Hoare triple {349#(<= (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~bufsize~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|)} assume !(main_~bufsize~0#1 < 2 * main_~ielen~0#1);main_~i~0#1 := 0; {398#(and (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) |ULTIMATE.start_main_~bufsize_0~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 17:02:26,515 INFO L290 TraceCheckUtils]: 10: Hoare triple {398#(and (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) |ULTIMATE.start_main_~bufsize_0~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~ielen~0#1 && main_~bufsize~0#1 > 2); {398#(and (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) |ULTIMATE.start_main_~bufsize_0~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 17:02:26,515 INFO L272 TraceCheckUtils]: 11: Hoare triple {398#(and (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) |ULTIMATE.start_main_~bufsize_0~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|))} call __VERIFIER_assert((if 0 <= main_~p~0#1 then 1 else 0)); {347#true} is VALID [2022-02-20 17:02:26,515 INFO L290 TraceCheckUtils]: 12: Hoare triple {347#true} ~cond := #in~cond; {347#true} is VALID [2022-02-20 17:02:26,516 INFO L290 TraceCheckUtils]: 13: Hoare triple {347#true} assume !(0 == ~cond); {347#true} is VALID [2022-02-20 17:02:26,516 INFO L290 TraceCheckUtils]: 14: Hoare triple {347#true} assume true; {347#true} is VALID [2022-02-20 17:02:26,517 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {347#true} {398#(and (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) |ULTIMATE.start_main_~bufsize_0~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|))} #76#return; {398#(and (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) |ULTIMATE.start_main_~bufsize_0~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 17:02:26,517 INFO L272 TraceCheckUtils]: 16: Hoare triple {398#(and (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) |ULTIMATE.start_main_~bufsize_0~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|))} call __VERIFIER_assert((if 1 + main_~p~0#1 < main_~bufsize_0~0#1 then 1 else 0)); {347#true} is VALID [2022-02-20 17:02:26,517 INFO L290 TraceCheckUtils]: 17: Hoare triple {347#true} ~cond := #in~cond; {347#true} is VALID [2022-02-20 17:02:26,517 INFO L290 TraceCheckUtils]: 18: Hoare triple {347#true} assume !(0 == ~cond); {347#true} is VALID [2022-02-20 17:02:26,517 INFO L290 TraceCheckUtils]: 19: Hoare triple {347#true} assume true; {347#true} is VALID [2022-02-20 17:02:26,518 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {347#true} {398#(and (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) |ULTIMATE.start_main_~bufsize_0~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|))} #78#return; {398#(and (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) |ULTIMATE.start_main_~bufsize_0~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 17:02:26,519 INFO L290 TraceCheckUtils]: 21: Hoare triple {398#(and (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) |ULTIMATE.start_main_~bufsize_0~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|))} main_~p~0#1 := 2 + main_~p~0#1; {435#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) (+ 2 |ULTIMATE.start_main_~bufsize_0~0#1|)))} is VALID [2022-02-20 17:02:26,520 INFO L290 TraceCheckUtils]: 22: Hoare triple {435#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) (+ 2 |ULTIMATE.start_main_~bufsize_0~0#1|)))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {439#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) (+ 2 |ULTIMATE.start_main_~bufsize_0~0#1|)))} is VALID [2022-02-20 17:02:26,521 INFO L290 TraceCheckUtils]: 23: Hoare triple {439#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) (+ 2 |ULTIMATE.start_main_~bufsize_0~0#1|)))} assume !!(main_~i~0#1 < main_~ielen~0#1 && main_~bufsize~0#1 > 2); {361#(<= (+ 2 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|)} is VALID [2022-02-20 17:02:26,521 INFO L272 TraceCheckUtils]: 24: Hoare triple {361#(<= (+ 2 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|)} call __VERIFIER_assert((if 0 <= main_~p~0#1 then 1 else 0)); {347#true} is VALID [2022-02-20 17:02:26,521 INFO L290 TraceCheckUtils]: 25: Hoare triple {347#true} ~cond := #in~cond; {347#true} is VALID [2022-02-20 17:02:26,521 INFO L290 TraceCheckUtils]: 26: Hoare triple {347#true} assume !(0 == ~cond); {347#true} is VALID [2022-02-20 17:02:26,521 INFO L290 TraceCheckUtils]: 27: Hoare triple {347#true} assume true; {347#true} is VALID [2022-02-20 17:02:26,522 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {347#true} {361#(<= (+ 2 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|)} #76#return; {361#(<= (+ 2 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|)} is VALID [2022-02-20 17:02:26,523 INFO L272 TraceCheckUtils]: 29: Hoare triple {361#(<= (+ 2 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|)} call __VERIFIER_assert((if 1 + main_~p~0#1 < main_~bufsize_0~0#1 then 1 else 0)); {461#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:02:26,523 INFO L290 TraceCheckUtils]: 30: Hoare triple {461#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {465#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:02:26,524 INFO L290 TraceCheckUtils]: 31: Hoare triple {465#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {348#false} is VALID [2022-02-20 17:02:26,524 INFO L290 TraceCheckUtils]: 32: Hoare triple {348#false} assume !false; {348#false} is VALID [2022-02-20 17:02:26,524 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 17:02:26,525 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:02:27,038 INFO L290 TraceCheckUtils]: 32: Hoare triple {348#false} assume !false; {348#false} is VALID [2022-02-20 17:02:27,039 INFO L290 TraceCheckUtils]: 31: Hoare triple {465#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {348#false} is VALID [2022-02-20 17:02:27,039 INFO L290 TraceCheckUtils]: 30: Hoare triple {461#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {465#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:02:27,041 INFO L272 TraceCheckUtils]: 29: Hoare triple {361#(<= (+ 2 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|)} call __VERIFIER_assert((if 1 + main_~p~0#1 < main_~bufsize_0~0#1 then 1 else 0)); {461#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:02:27,043 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {347#true} {361#(<= (+ 2 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|)} #76#return; {361#(<= (+ 2 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|)} is VALID [2022-02-20 17:02:27,055 INFO L290 TraceCheckUtils]: 27: Hoare triple {347#true} assume true; {347#true} is VALID [2022-02-20 17:02:27,056 INFO L290 TraceCheckUtils]: 26: Hoare triple {347#true} assume !(0 == ~cond); {347#true} is VALID [2022-02-20 17:02:27,056 INFO L290 TraceCheckUtils]: 25: Hoare triple {347#true} ~cond := #in~cond; {347#true} is VALID [2022-02-20 17:02:27,056 INFO L272 TraceCheckUtils]: 24: Hoare triple {361#(<= (+ 2 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|)} call __VERIFIER_assert((if 0 <= main_~p~0#1 then 1 else 0)); {347#true} is VALID [2022-02-20 17:02:27,057 INFO L290 TraceCheckUtils]: 23: Hoare triple {499#(or (<= (+ 2 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|) (not (< |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~ielen~0#1|)))} assume !!(main_~i~0#1 < main_~ielen~0#1 && main_~bufsize~0#1 > 2); {361#(<= (+ 2 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|)} is VALID [2022-02-20 17:02:27,058 INFO L290 TraceCheckUtils]: 22: Hoare triple {503#(or (<= (+ 2 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|) (<= |ULTIMATE.start_main_~ielen~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {499#(or (<= (+ 2 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|) (not (< |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~ielen~0#1|)))} is VALID [2022-02-20 17:02:27,059 INFO L290 TraceCheckUtils]: 21: Hoare triple {507#(or (<= (+ |ULTIMATE.start_main_~p~0#1| 4) |ULTIMATE.start_main_~bufsize_0~0#1|) (<= |ULTIMATE.start_main_~ielen~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)))} main_~p~0#1 := 2 + main_~p~0#1; {503#(or (<= (+ 2 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|) (<= |ULTIMATE.start_main_~ielen~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)))} is VALID [2022-02-20 17:02:27,059 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {347#true} {507#(or (<= (+ |ULTIMATE.start_main_~p~0#1| 4) |ULTIMATE.start_main_~bufsize_0~0#1|) (<= |ULTIMATE.start_main_~ielen~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)))} #78#return; {507#(or (<= (+ |ULTIMATE.start_main_~p~0#1| 4) |ULTIMATE.start_main_~bufsize_0~0#1|) (<= |ULTIMATE.start_main_~ielen~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)))} is VALID [2022-02-20 17:02:27,060 INFO L290 TraceCheckUtils]: 19: Hoare triple {347#true} assume true; {347#true} is VALID [2022-02-20 17:02:27,060 INFO L290 TraceCheckUtils]: 18: Hoare triple {347#true} assume !(0 == ~cond); {347#true} is VALID [2022-02-20 17:02:27,060 INFO L290 TraceCheckUtils]: 17: Hoare triple {347#true} ~cond := #in~cond; {347#true} is VALID [2022-02-20 17:02:27,060 INFO L272 TraceCheckUtils]: 16: Hoare triple {507#(or (<= (+ |ULTIMATE.start_main_~p~0#1| 4) |ULTIMATE.start_main_~bufsize_0~0#1|) (<= |ULTIMATE.start_main_~ielen~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)))} call __VERIFIER_assert((if 1 + main_~p~0#1 < main_~bufsize_0~0#1 then 1 else 0)); {347#true} is VALID [2022-02-20 17:02:27,061 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {347#true} {507#(or (<= (+ |ULTIMATE.start_main_~p~0#1| 4) |ULTIMATE.start_main_~bufsize_0~0#1|) (<= |ULTIMATE.start_main_~ielen~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)))} #76#return; {507#(or (<= (+ |ULTIMATE.start_main_~p~0#1| 4) |ULTIMATE.start_main_~bufsize_0~0#1|) (<= |ULTIMATE.start_main_~ielen~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)))} is VALID [2022-02-20 17:02:27,061 INFO L290 TraceCheckUtils]: 14: Hoare triple {347#true} assume true; {347#true} is VALID [2022-02-20 17:02:27,062 INFO L290 TraceCheckUtils]: 13: Hoare triple {347#true} assume !(0 == ~cond); {347#true} is VALID [2022-02-20 17:02:27,062 INFO L290 TraceCheckUtils]: 12: Hoare triple {347#true} ~cond := #in~cond; {347#true} is VALID [2022-02-20 17:02:27,062 INFO L272 TraceCheckUtils]: 11: Hoare triple {507#(or (<= (+ |ULTIMATE.start_main_~p~0#1| 4) |ULTIMATE.start_main_~bufsize_0~0#1|) (<= |ULTIMATE.start_main_~ielen~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)))} call __VERIFIER_assert((if 0 <= main_~p~0#1 then 1 else 0)); {347#true} is VALID [2022-02-20 17:02:27,063 INFO L290 TraceCheckUtils]: 10: Hoare triple {507#(or (<= (+ |ULTIMATE.start_main_~p~0#1| 4) |ULTIMATE.start_main_~bufsize_0~0#1|) (<= |ULTIMATE.start_main_~ielen~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)))} assume !!(main_~i~0#1 < main_~ielen~0#1 && main_~bufsize~0#1 > 2); {507#(or (<= (+ |ULTIMATE.start_main_~p~0#1| 4) |ULTIMATE.start_main_~bufsize_0~0#1|) (<= |ULTIMATE.start_main_~ielen~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)))} is VALID [2022-02-20 17:02:27,064 INFO L290 TraceCheckUtils]: 9: Hoare triple {544#(or (<= (div (+ (- 1) (* (- 1) |ULTIMATE.start_main_~bufsize~0#1|)) (- 2)) 2) (<= (+ |ULTIMATE.start_main_~p~0#1| 4) |ULTIMATE.start_main_~bufsize_0~0#1|))} assume !(main_~bufsize~0#1 < 2 * main_~ielen~0#1);main_~i~0#1 := 0; {507#(or (<= (+ |ULTIMATE.start_main_~p~0#1| 4) |ULTIMATE.start_main_~bufsize_0~0#1|) (<= |ULTIMATE.start_main_~ielen~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)))} is VALID [2022-02-20 17:02:27,065 INFO L290 TraceCheckUtils]: 8: Hoare triple {347#true} assume !(main_~bufsize~0#1 < main_~leader_len~0#1);main_~p~0#1 := 0;main_~bufsize_0~0#1 := main_~bufsize~0#1;main_~bufsize~0#1 := main_~bufsize~0#1 - main_~leader_len~0#1;main_~p~0#1 := main_~p~0#1 + main_~leader_len~0#1; {544#(or (<= (div (+ (- 1) (* (- 1) |ULTIMATE.start_main_~bufsize~0#1|)) (- 2)) 2) (<= (+ |ULTIMATE.start_main_~p~0#1| 4) |ULTIMATE.start_main_~bufsize_0~0#1|))} is VALID [2022-02-20 17:02:27,065 INFO L290 TraceCheckUtils]: 7: Hoare triple {347#true} assume main_~ielen~0#1 > 0; {347#true} is VALID [2022-02-20 17:02:27,065 INFO L290 TraceCheckUtils]: 6: Hoare triple {347#true} assume main_~bufsize~0#1 > 0; {347#true} is VALID [2022-02-20 17:02:27,065 INFO L290 TraceCheckUtils]: 5: Hoare triple {347#true} assume main_~leader_len~0#1 > 0; {347#true} is VALID [2022-02-20 17:02:27,066 INFO L290 TraceCheckUtils]: 4: Hoare triple {347#true} assume !!(main_~ielen~0#1 < 1000000); {347#true} is VALID [2022-02-20 17:02:27,066 INFO L290 TraceCheckUtils]: 3: Hoare triple {347#true} assume !!(main_~bufsize~0#1 < 1000000); {347#true} is VALID [2022-02-20 17:02:27,066 INFO L290 TraceCheckUtils]: 2: Hoare triple {347#true} assume !!(main_~leader_len~0#1 < 1000000); {347#true} is VALID [2022-02-20 17:02:27,066 INFO L290 TraceCheckUtils]: 1: Hoare triple {347#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_~p~0#1, main_~i~0#1, main_~leader_len~0#1, main_~bufsize~0#1, main_~bufsize_0~0#1, main_~ielen~0#1;havoc main_~p~0#1;havoc main_~i~0#1;havoc main_~leader_len~0#1;havoc main_~bufsize~0#1;havoc main_~bufsize_0~0#1;havoc main_~ielen~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~leader_len~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~bufsize~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~ielen~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {347#true} is VALID [2022-02-20 17:02:27,066 INFO L290 TraceCheckUtils]: 0: Hoare triple {347#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(9, 2); {347#true} is VALID [2022-02-20 17:02:27,067 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 17:02:27,067 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1910785884] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:02:27,068 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 17:02:27,068 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-02-20 17:02:27,068 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865518099] [2022-02-20 17:02:27,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 17:02:27,069 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 16 states have internal predecessors, (33), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 33 [2022-02-20 17:02:27,070 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:02:27,070 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 18 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 16 states have internal predecessors, (33), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 17:02:27,112 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:27,113 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-02-20 17:02:27,113 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:02:27,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-02-20 17:02:27,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2022-02-20 17:02:27,114 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 18 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 16 states have internal predecessors, (33), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 17:02:27,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:27,721 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2022-02-20 17:02:27,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 17:02:27,721 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 16 states have internal predecessors, (33), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 33 [2022-02-20 17:02:27,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:02:27,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 16 states have internal predecessors, (33), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 17:02:27,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 47 transitions. [2022-02-20 17:02:27,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 16 states have internal predecessors, (33), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 17:02:27,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 47 transitions. [2022-02-20 17:02:27,727 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 47 transitions. [2022-02-20 17:02:27,764 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:27,766 INFO L225 Difference]: With dead ends: 49 [2022-02-20 17:02:27,766 INFO L226 Difference]: Without dead ends: 47 [2022-02-20 17:02:27,768 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=358, Unknown=0, NotChecked=0, Total=462 [2022-02-20 17:02:27,768 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 19 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 17:02:27,769 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 220 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 17:02:27,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-02-20 17:02:27,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2022-02-20 17:02:27,798 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:02:27,799 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 46 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 34 states have internal predecessors, (34), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:02:27,799 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 46 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 34 states have internal predecessors, (34), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:02:27,799 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 46 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 34 states have internal predecessors, (34), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:02:27,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:27,802 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2022-02-20 17:02:27,802 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-02-20 17:02:27,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:27,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:27,803 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 34 states have internal predecessors, (34), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 47 states. [2022-02-20 17:02:27,803 INFO L87 Difference]: Start difference. First operand has 46 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 34 states have internal predecessors, (34), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 47 states. [2022-02-20 17:02:27,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:27,806 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2022-02-20 17:02:27,806 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-02-20 17:02:27,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:27,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:27,807 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:02:27,807 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:02:27,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 34 states have internal predecessors, (34), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:02:27,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2022-02-20 17:02:27,814 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 33 [2022-02-20 17:02:27,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:02:27,814 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2022-02-20 17:02:27,814 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 16 states have internal predecessors, (33), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 17:02:27,815 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2022-02-20 17:02:27,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 17:02:27,816 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:02:27,816 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 7, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:02:27,846 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 17:02:28,043 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:02:28,044 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:02:28,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:02:28,044 INFO L85 PathProgramCache]: Analyzing trace with hash -189356326, now seen corresponding path program 2 times [2022-02-20 17:02:28,044 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:02:28,044 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048807241] [2022-02-20 17:02:28,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:02:28,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:02:28,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:28,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 17:02:28,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:28,229 INFO L290 TraceCheckUtils]: 0: Hoare triple {800#true} ~cond := #in~cond; {800#true} is VALID [2022-02-20 17:02:28,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {800#true} assume !(0 == ~cond); {800#true} is VALID [2022-02-20 17:02:28,230 INFO L290 TraceCheckUtils]: 2: Hoare triple {800#true} assume true; {800#true} is VALID [2022-02-20 17:02:28,231 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {800#true} {803#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) |ULTIMATE.start_main_~bufsize_0~0#1|))} #76#return; {803#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) |ULTIMATE.start_main_~bufsize_0~0#1|))} is VALID [2022-02-20 17:02:28,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 17:02:28,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:28,236 INFO L290 TraceCheckUtils]: 0: Hoare triple {800#true} ~cond := #in~cond; {800#true} is VALID [2022-02-20 17:02:28,236 INFO L290 TraceCheckUtils]: 1: Hoare triple {800#true} assume !(0 == ~cond); {800#true} is VALID [2022-02-20 17:02:28,237 INFO L290 TraceCheckUtils]: 2: Hoare triple {800#true} assume true; {800#true} is VALID [2022-02-20 17:02:28,237 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {800#true} {803#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) |ULTIMATE.start_main_~bufsize_0~0#1|))} #78#return; {803#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) |ULTIMATE.start_main_~bufsize_0~0#1|))} is VALID [2022-02-20 17:02:28,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-02-20 17:02:28,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:28,242 INFO L290 TraceCheckUtils]: 0: Hoare triple {800#true} ~cond := #in~cond; {800#true} is VALID [2022-02-20 17:02:28,242 INFO L290 TraceCheckUtils]: 1: Hoare triple {800#true} assume !(0 == ~cond); {800#true} is VALID [2022-02-20 17:02:28,242 INFO L290 TraceCheckUtils]: 2: Hoare triple {800#true} assume true; {800#true} is VALID [2022-02-20 17:02:28,243 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {800#true} {813#(<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) (+ (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|))} #76#return; {813#(<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) (+ (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|))} is VALID [2022-02-20 17:02:28,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-02-20 17:02:28,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:28,248 INFO L290 TraceCheckUtils]: 0: Hoare triple {800#true} ~cond := #in~cond; {800#true} is VALID [2022-02-20 17:02:28,248 INFO L290 TraceCheckUtils]: 1: Hoare triple {800#true} assume !(0 == ~cond); {800#true} is VALID [2022-02-20 17:02:28,248 INFO L290 TraceCheckUtils]: 2: Hoare triple {800#true} assume true; {800#true} is VALID [2022-02-20 17:02:28,249 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {800#true} {813#(<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) (+ (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|))} #78#return; {813#(<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) (+ (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|))} is VALID [2022-02-20 17:02:28,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-02-20 17:02:28,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:28,253 INFO L290 TraceCheckUtils]: 0: Hoare triple {800#true} ~cond := #in~cond; {800#true} is VALID [2022-02-20 17:02:28,254 INFO L290 TraceCheckUtils]: 1: Hoare triple {800#true} assume !(0 == ~cond); {800#true} is VALID [2022-02-20 17:02:28,254 INFO L290 TraceCheckUtils]: 2: Hoare triple {800#true} assume true; {800#true} is VALID [2022-02-20 17:02:28,255 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {800#true} {813#(<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) (+ (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|))} #76#return; {813#(<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) (+ (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|))} is VALID [2022-02-20 17:02:28,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-02-20 17:02:28,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:28,259 INFO L290 TraceCheckUtils]: 0: Hoare triple {800#true} ~cond := #in~cond; {800#true} is VALID [2022-02-20 17:02:28,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {800#true} assume !(0 == ~cond); {800#true} is VALID [2022-02-20 17:02:28,260 INFO L290 TraceCheckUtils]: 2: Hoare triple {800#true} assume true; {800#true} is VALID [2022-02-20 17:02:28,260 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {800#true} {813#(<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) (+ (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|))} #78#return; {813#(<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) (+ (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|))} is VALID [2022-02-20 17:02:28,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-02-20 17:02:28,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:28,265 INFO L290 TraceCheckUtils]: 0: Hoare triple {800#true} ~cond := #in~cond; {800#true} is VALID [2022-02-20 17:02:28,265 INFO L290 TraceCheckUtils]: 1: Hoare triple {800#true} assume !(0 == ~cond); {800#true} is VALID [2022-02-20 17:02:28,265 INFO L290 TraceCheckUtils]: 2: Hoare triple {800#true} assume true; {800#true} is VALID [2022-02-20 17:02:28,266 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {800#true} {831#(<= (+ 2 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|)} #76#return; {831#(<= (+ 2 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|)} is VALID [2022-02-20 17:02:28,266 INFO L290 TraceCheckUtils]: 0: Hoare triple {800#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(9, 2); {800#true} is VALID [2022-02-20 17:02:28,266 INFO L290 TraceCheckUtils]: 1: Hoare triple {800#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_~p~0#1, main_~i~0#1, main_~leader_len~0#1, main_~bufsize~0#1, main_~bufsize_0~0#1, main_~ielen~0#1;havoc main_~p~0#1;havoc main_~i~0#1;havoc main_~leader_len~0#1;havoc main_~bufsize~0#1;havoc main_~bufsize_0~0#1;havoc main_~ielen~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~leader_len~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~bufsize~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~ielen~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {800#true} is VALID [2022-02-20 17:02:28,267 INFO L290 TraceCheckUtils]: 2: Hoare triple {800#true} assume !!(main_~leader_len~0#1 < 1000000); {800#true} is VALID [2022-02-20 17:02:28,267 INFO L290 TraceCheckUtils]: 3: Hoare triple {800#true} assume !!(main_~bufsize~0#1 < 1000000); {800#true} is VALID [2022-02-20 17:02:28,267 INFO L290 TraceCheckUtils]: 4: Hoare triple {800#true} assume !!(main_~ielen~0#1 < 1000000); {800#true} is VALID [2022-02-20 17:02:28,267 INFO L290 TraceCheckUtils]: 5: Hoare triple {800#true} assume main_~leader_len~0#1 > 0; {800#true} is VALID [2022-02-20 17:02:28,267 INFO L290 TraceCheckUtils]: 6: Hoare triple {800#true} assume main_~bufsize~0#1 > 0; {800#true} is VALID [2022-02-20 17:02:28,268 INFO L290 TraceCheckUtils]: 7: Hoare triple {800#true} assume main_~ielen~0#1 > 0; {800#true} is VALID [2022-02-20 17:02:28,268 INFO L290 TraceCheckUtils]: 8: Hoare triple {800#true} assume !(main_~bufsize~0#1 < main_~leader_len~0#1);main_~p~0#1 := 0;main_~bufsize_0~0#1 := main_~bufsize~0#1;main_~bufsize~0#1 := main_~bufsize~0#1 - main_~leader_len~0#1;main_~p~0#1 := main_~p~0#1 + main_~leader_len~0#1; {802#(<= (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~bufsize~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|)} is VALID [2022-02-20 17:02:28,269 INFO L290 TraceCheckUtils]: 9: Hoare triple {802#(<= (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~bufsize~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|)} assume !(main_~bufsize~0#1 < 2 * main_~ielen~0#1);main_~i~0#1 := 0; {803#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) |ULTIMATE.start_main_~bufsize_0~0#1|))} is VALID [2022-02-20 17:02:28,270 INFO L290 TraceCheckUtils]: 10: Hoare triple {803#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) |ULTIMATE.start_main_~bufsize_0~0#1|))} assume !!(main_~i~0#1 < main_~ielen~0#1 && main_~bufsize~0#1 > 2); {803#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) |ULTIMATE.start_main_~bufsize_0~0#1|))} is VALID [2022-02-20 17:02:28,270 INFO L272 TraceCheckUtils]: 11: Hoare triple {803#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) |ULTIMATE.start_main_~bufsize_0~0#1|))} call __VERIFIER_assert((if 0 <= main_~p~0#1 then 1 else 0)); {800#true} is VALID [2022-02-20 17:02:28,270 INFO L290 TraceCheckUtils]: 12: Hoare triple {800#true} ~cond := #in~cond; {800#true} is VALID [2022-02-20 17:02:28,270 INFO L290 TraceCheckUtils]: 13: Hoare triple {800#true} assume !(0 == ~cond); {800#true} is VALID [2022-02-20 17:02:28,270 INFO L290 TraceCheckUtils]: 14: Hoare triple {800#true} assume true; {800#true} is VALID [2022-02-20 17:02:28,271 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {800#true} {803#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) |ULTIMATE.start_main_~bufsize_0~0#1|))} #76#return; {803#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) |ULTIMATE.start_main_~bufsize_0~0#1|))} is VALID [2022-02-20 17:02:28,271 INFO L272 TraceCheckUtils]: 16: Hoare triple {803#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) |ULTIMATE.start_main_~bufsize_0~0#1|))} call __VERIFIER_assert((if 1 + main_~p~0#1 < main_~bufsize_0~0#1 then 1 else 0)); {800#true} is VALID [2022-02-20 17:02:28,271 INFO L290 TraceCheckUtils]: 17: Hoare triple {800#true} ~cond := #in~cond; {800#true} is VALID [2022-02-20 17:02:28,272 INFO L290 TraceCheckUtils]: 18: Hoare triple {800#true} assume !(0 == ~cond); {800#true} is VALID [2022-02-20 17:02:28,272 INFO L290 TraceCheckUtils]: 19: Hoare triple {800#true} assume true; {800#true} is VALID [2022-02-20 17:02:28,272 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {800#true} {803#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) |ULTIMATE.start_main_~bufsize_0~0#1|))} #78#return; {803#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) |ULTIMATE.start_main_~bufsize_0~0#1|))} is VALID [2022-02-20 17:02:28,273 INFO L290 TraceCheckUtils]: 21: Hoare triple {803#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) |ULTIMATE.start_main_~bufsize_0~0#1|))} main_~p~0#1 := 2 + main_~p~0#1; {812#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) (+ 2 |ULTIMATE.start_main_~bufsize_0~0#1|)))} is VALID [2022-02-20 17:02:28,274 INFO L290 TraceCheckUtils]: 22: Hoare triple {812#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) (+ 2 |ULTIMATE.start_main_~bufsize_0~0#1|)))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {813#(<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) (+ (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|))} is VALID [2022-02-20 17:02:28,274 INFO L290 TraceCheckUtils]: 23: Hoare triple {813#(<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) (+ (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|))} assume !!(main_~i~0#1 < main_~ielen~0#1 && main_~bufsize~0#1 > 2); {813#(<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) (+ (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|))} is VALID [2022-02-20 17:02:28,274 INFO L272 TraceCheckUtils]: 24: Hoare triple {813#(<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) (+ (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|))} call __VERIFIER_assert((if 0 <= main_~p~0#1 then 1 else 0)); {800#true} is VALID [2022-02-20 17:02:28,275 INFO L290 TraceCheckUtils]: 25: Hoare triple {800#true} ~cond := #in~cond; {800#true} is VALID [2022-02-20 17:02:28,275 INFO L290 TraceCheckUtils]: 26: Hoare triple {800#true} assume !(0 == ~cond); {800#true} is VALID [2022-02-20 17:02:28,275 INFO L290 TraceCheckUtils]: 27: Hoare triple {800#true} assume true; {800#true} is VALID [2022-02-20 17:02:28,276 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {800#true} {813#(<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) (+ (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|))} #76#return; {813#(<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) (+ (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|))} is VALID [2022-02-20 17:02:28,276 INFO L272 TraceCheckUtils]: 29: Hoare triple {813#(<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) (+ (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|))} call __VERIFIER_assert((if 1 + main_~p~0#1 < main_~bufsize_0~0#1 then 1 else 0)); {800#true} is VALID [2022-02-20 17:02:28,276 INFO L290 TraceCheckUtils]: 30: Hoare triple {800#true} ~cond := #in~cond; {800#true} is VALID [2022-02-20 17:02:28,276 INFO L290 TraceCheckUtils]: 31: Hoare triple {800#true} assume !(0 == ~cond); {800#true} is VALID [2022-02-20 17:02:28,276 INFO L290 TraceCheckUtils]: 32: Hoare triple {800#true} assume true; {800#true} is VALID [2022-02-20 17:02:28,277 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {800#true} {813#(<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) (+ (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|))} #78#return; {813#(<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) (+ (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|))} is VALID [2022-02-20 17:02:28,278 INFO L290 TraceCheckUtils]: 34: Hoare triple {813#(<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) (+ (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|))} main_~p~0#1 := 2 + main_~p~0#1; {822#(<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) (+ 2 (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|))} is VALID [2022-02-20 17:02:28,278 INFO L290 TraceCheckUtils]: 35: Hoare triple {822#(<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) (+ 2 (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {813#(<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) (+ (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|))} is VALID [2022-02-20 17:02:28,279 INFO L290 TraceCheckUtils]: 36: Hoare triple {813#(<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) (+ (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|))} assume !!(main_~i~0#1 < main_~ielen~0#1 && main_~bufsize~0#1 > 2); {813#(<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) (+ (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|))} is VALID [2022-02-20 17:02:28,279 INFO L272 TraceCheckUtils]: 37: Hoare triple {813#(<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) (+ (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|))} call __VERIFIER_assert((if 0 <= main_~p~0#1 then 1 else 0)); {800#true} is VALID [2022-02-20 17:02:28,279 INFO L290 TraceCheckUtils]: 38: Hoare triple {800#true} ~cond := #in~cond; {800#true} is VALID [2022-02-20 17:02:28,280 INFO L290 TraceCheckUtils]: 39: Hoare triple {800#true} assume !(0 == ~cond); {800#true} is VALID [2022-02-20 17:02:28,280 INFO L290 TraceCheckUtils]: 40: Hoare triple {800#true} assume true; {800#true} is VALID [2022-02-20 17:02:28,280 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {800#true} {813#(<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) (+ (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|))} #76#return; {813#(<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) (+ (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|))} is VALID [2022-02-20 17:02:28,281 INFO L272 TraceCheckUtils]: 42: Hoare triple {813#(<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) (+ (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|))} call __VERIFIER_assert((if 1 + main_~p~0#1 < main_~bufsize_0~0#1 then 1 else 0)); {800#true} is VALID [2022-02-20 17:02:28,281 INFO L290 TraceCheckUtils]: 43: Hoare triple {800#true} ~cond := #in~cond; {800#true} is VALID [2022-02-20 17:02:28,281 INFO L290 TraceCheckUtils]: 44: Hoare triple {800#true} assume !(0 == ~cond); {800#true} is VALID [2022-02-20 17:02:28,281 INFO L290 TraceCheckUtils]: 45: Hoare triple {800#true} assume true; {800#true} is VALID [2022-02-20 17:02:28,282 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {800#true} {813#(<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) (+ (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|))} #78#return; {813#(<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) (+ (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|))} is VALID [2022-02-20 17:02:28,283 INFO L290 TraceCheckUtils]: 47: Hoare triple {813#(<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) (+ (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|))} main_~p~0#1 := 2 + main_~p~0#1; {822#(<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) (+ 2 (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|))} is VALID [2022-02-20 17:02:28,283 INFO L290 TraceCheckUtils]: 48: Hoare triple {822#(<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) (+ 2 (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {813#(<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) (+ (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|))} is VALID [2022-02-20 17:02:28,284 INFO L290 TraceCheckUtils]: 49: Hoare triple {813#(<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) (+ (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|))} assume !!(main_~i~0#1 < main_~ielen~0#1 && main_~bufsize~0#1 > 2); {831#(<= (+ 2 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|)} is VALID [2022-02-20 17:02:28,284 INFO L272 TraceCheckUtils]: 50: Hoare triple {831#(<= (+ 2 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|)} call __VERIFIER_assert((if 0 <= main_~p~0#1 then 1 else 0)); {800#true} is VALID [2022-02-20 17:02:28,284 INFO L290 TraceCheckUtils]: 51: Hoare triple {800#true} ~cond := #in~cond; {800#true} is VALID [2022-02-20 17:02:28,284 INFO L290 TraceCheckUtils]: 52: Hoare triple {800#true} assume !(0 == ~cond); {800#true} is VALID [2022-02-20 17:02:28,285 INFO L290 TraceCheckUtils]: 53: Hoare triple {800#true} assume true; {800#true} is VALID [2022-02-20 17:02:28,285 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {800#true} {831#(<= (+ 2 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|)} #76#return; {831#(<= (+ 2 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|)} is VALID [2022-02-20 17:02:28,286 INFO L272 TraceCheckUtils]: 55: Hoare triple {831#(<= (+ 2 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|)} call __VERIFIER_assert((if 1 + main_~p~0#1 < main_~bufsize_0~0#1 then 1 else 0)); {836#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:02:28,286 INFO L290 TraceCheckUtils]: 56: Hoare triple {836#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {837#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:02:28,287 INFO L290 TraceCheckUtils]: 57: Hoare triple {837#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {801#false} is VALID [2022-02-20 17:02:28,287 INFO L290 TraceCheckUtils]: 58: Hoare triple {801#false} assume !false; {801#false} is VALID [2022-02-20 17:02:28,287 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 14 proven. 17 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-02-20 17:02:28,288 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:02:28,288 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048807241] [2022-02-20 17:02:28,288 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048807241] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:02:28,288 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129635356] [2022-02-20 17:02:28,288 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 17:02:28,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:02:28,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:02:28,290 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 17:02:28,299 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 17:02:28,378 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 17:02:28,378 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:02:28,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 15 conjunts are in the unsatisfiable core [2022-02-20 17:02:28,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:28,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:02:29,036 INFO L290 TraceCheckUtils]: 0: Hoare triple {800#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(9, 2); {800#true} is VALID [2022-02-20 17:02:29,037 INFO L290 TraceCheckUtils]: 1: Hoare triple {800#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_~p~0#1, main_~i~0#1, main_~leader_len~0#1, main_~bufsize~0#1, main_~bufsize_0~0#1, main_~ielen~0#1;havoc main_~p~0#1;havoc main_~i~0#1;havoc main_~leader_len~0#1;havoc main_~bufsize~0#1;havoc main_~bufsize_0~0#1;havoc main_~ielen~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~leader_len~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~bufsize~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~ielen~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {800#true} is VALID [2022-02-20 17:02:29,037 INFO L290 TraceCheckUtils]: 2: Hoare triple {800#true} assume !!(main_~leader_len~0#1 < 1000000); {800#true} is VALID [2022-02-20 17:02:29,037 INFO L290 TraceCheckUtils]: 3: Hoare triple {800#true} assume !!(main_~bufsize~0#1 < 1000000); {800#true} is VALID [2022-02-20 17:02:29,037 INFO L290 TraceCheckUtils]: 4: Hoare triple {800#true} assume !!(main_~ielen~0#1 < 1000000); {800#true} is VALID [2022-02-20 17:02:29,037 INFO L290 TraceCheckUtils]: 5: Hoare triple {800#true} assume main_~leader_len~0#1 > 0; {800#true} is VALID [2022-02-20 17:02:29,037 INFO L290 TraceCheckUtils]: 6: Hoare triple {800#true} assume main_~bufsize~0#1 > 0; {800#true} is VALID [2022-02-20 17:02:29,037 INFO L290 TraceCheckUtils]: 7: Hoare triple {800#true} assume main_~ielen~0#1 > 0; {800#true} is VALID [2022-02-20 17:02:29,038 INFO L290 TraceCheckUtils]: 8: Hoare triple {800#true} assume !(main_~bufsize~0#1 < main_~leader_len~0#1);main_~p~0#1 := 0;main_~bufsize_0~0#1 := main_~bufsize~0#1;main_~bufsize~0#1 := main_~bufsize~0#1 - main_~leader_len~0#1;main_~p~0#1 := main_~p~0#1 + main_~leader_len~0#1; {802#(<= (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~bufsize~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|)} is VALID [2022-02-20 17:02:29,039 INFO L290 TraceCheckUtils]: 9: Hoare triple {802#(<= (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~bufsize~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|)} assume !(main_~bufsize~0#1 < 2 * main_~ielen~0#1);main_~i~0#1 := 0; {868#(and (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) |ULTIMATE.start_main_~bufsize_0~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 17:02:29,039 INFO L290 TraceCheckUtils]: 10: Hoare triple {868#(and (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) |ULTIMATE.start_main_~bufsize_0~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~ielen~0#1 && main_~bufsize~0#1 > 2); {868#(and (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) |ULTIMATE.start_main_~bufsize_0~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 17:02:29,039 INFO L272 TraceCheckUtils]: 11: Hoare triple {868#(and (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) |ULTIMATE.start_main_~bufsize_0~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|))} call __VERIFIER_assert((if 0 <= main_~p~0#1 then 1 else 0)); {800#true} is VALID [2022-02-20 17:02:29,040 INFO L290 TraceCheckUtils]: 12: Hoare triple {800#true} ~cond := #in~cond; {800#true} is VALID [2022-02-20 17:02:29,040 INFO L290 TraceCheckUtils]: 13: Hoare triple {800#true} assume !(0 == ~cond); {800#true} is VALID [2022-02-20 17:02:29,040 INFO L290 TraceCheckUtils]: 14: Hoare triple {800#true} assume true; {800#true} is VALID [2022-02-20 17:02:29,041 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {800#true} {868#(and (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) |ULTIMATE.start_main_~bufsize_0~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|))} #76#return; {868#(and (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) |ULTIMATE.start_main_~bufsize_0~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 17:02:29,041 INFO L272 TraceCheckUtils]: 16: Hoare triple {868#(and (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) |ULTIMATE.start_main_~bufsize_0~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|))} call __VERIFIER_assert((if 1 + main_~p~0#1 < main_~bufsize_0~0#1 then 1 else 0)); {800#true} is VALID [2022-02-20 17:02:29,042 INFO L290 TraceCheckUtils]: 17: Hoare triple {800#true} ~cond := #in~cond; {800#true} is VALID [2022-02-20 17:02:29,042 INFO L290 TraceCheckUtils]: 18: Hoare triple {800#true} assume !(0 == ~cond); {800#true} is VALID [2022-02-20 17:02:29,042 INFO L290 TraceCheckUtils]: 19: Hoare triple {800#true} assume true; {800#true} is VALID [2022-02-20 17:02:29,043 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {800#true} {868#(and (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) |ULTIMATE.start_main_~bufsize_0~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|))} #78#return; {868#(and (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) |ULTIMATE.start_main_~bufsize_0~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 17:02:29,044 INFO L290 TraceCheckUtils]: 21: Hoare triple {868#(and (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) |ULTIMATE.start_main_~bufsize_0~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|))} main_~p~0#1 := 2 + main_~p~0#1; {905#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) (+ 2 |ULTIMATE.start_main_~bufsize_0~0#1|)))} is VALID [2022-02-20 17:02:29,044 INFO L290 TraceCheckUtils]: 22: Hoare triple {905#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) (+ 2 |ULTIMATE.start_main_~bufsize_0~0#1|)))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {909#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) (+ 2 |ULTIMATE.start_main_~bufsize_0~0#1|)))} is VALID [2022-02-20 17:02:29,045 INFO L290 TraceCheckUtils]: 23: Hoare triple {909#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) (+ 2 |ULTIMATE.start_main_~bufsize_0~0#1|)))} assume !!(main_~i~0#1 < main_~ielen~0#1 && main_~bufsize~0#1 > 2); {909#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) (+ 2 |ULTIMATE.start_main_~bufsize_0~0#1|)))} is VALID [2022-02-20 17:02:29,045 INFO L272 TraceCheckUtils]: 24: Hoare triple {909#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) (+ 2 |ULTIMATE.start_main_~bufsize_0~0#1|)))} call __VERIFIER_assert((if 0 <= main_~p~0#1 then 1 else 0)); {800#true} is VALID [2022-02-20 17:02:29,045 INFO L290 TraceCheckUtils]: 25: Hoare triple {800#true} ~cond := #in~cond; {800#true} is VALID [2022-02-20 17:02:29,045 INFO L290 TraceCheckUtils]: 26: Hoare triple {800#true} assume !(0 == ~cond); {800#true} is VALID [2022-02-20 17:02:29,045 INFO L290 TraceCheckUtils]: 27: Hoare triple {800#true} assume true; {800#true} is VALID [2022-02-20 17:02:29,048 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {800#true} {909#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) (+ 2 |ULTIMATE.start_main_~bufsize_0~0#1|)))} #76#return; {909#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) (+ 2 |ULTIMATE.start_main_~bufsize_0~0#1|)))} is VALID [2022-02-20 17:02:29,048 INFO L272 TraceCheckUtils]: 29: Hoare triple {909#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) (+ 2 |ULTIMATE.start_main_~bufsize_0~0#1|)))} call __VERIFIER_assert((if 1 + main_~p~0#1 < main_~bufsize_0~0#1 then 1 else 0)); {800#true} is VALID [2022-02-20 17:02:29,048 INFO L290 TraceCheckUtils]: 30: Hoare triple {800#true} ~cond := #in~cond; {800#true} is VALID [2022-02-20 17:02:29,048 INFO L290 TraceCheckUtils]: 31: Hoare triple {800#true} assume !(0 == ~cond); {800#true} is VALID [2022-02-20 17:02:29,048 INFO L290 TraceCheckUtils]: 32: Hoare triple {800#true} assume true; {800#true} is VALID [2022-02-20 17:02:29,049 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {800#true} {909#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) (+ 2 |ULTIMATE.start_main_~bufsize_0~0#1|)))} #78#return; {909#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) (+ 2 |ULTIMATE.start_main_~bufsize_0~0#1|)))} is VALID [2022-02-20 17:02:29,050 INFO L290 TraceCheckUtils]: 34: Hoare triple {909#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) (+ 2 |ULTIMATE.start_main_~bufsize_0~0#1|)))} main_~p~0#1 := 2 + main_~p~0#1; {946#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) (+ 4 |ULTIMATE.start_main_~bufsize_0~0#1|)))} is VALID [2022-02-20 17:02:29,050 INFO L290 TraceCheckUtils]: 35: Hoare triple {946#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) (+ 4 |ULTIMATE.start_main_~bufsize_0~0#1|)))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {950#(and (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) (+ 4 |ULTIMATE.start_main_~bufsize_0~0#1|)))} is VALID [2022-02-20 17:02:29,051 INFO L290 TraceCheckUtils]: 36: Hoare triple {950#(and (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) (+ 4 |ULTIMATE.start_main_~bufsize_0~0#1|)))} assume !!(main_~i~0#1 < main_~ielen~0#1 && main_~bufsize~0#1 > 2); {950#(and (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) (+ 4 |ULTIMATE.start_main_~bufsize_0~0#1|)))} is VALID [2022-02-20 17:02:29,051 INFO L272 TraceCheckUtils]: 37: Hoare triple {950#(and (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) (+ 4 |ULTIMATE.start_main_~bufsize_0~0#1|)))} call __VERIFIER_assert((if 0 <= main_~p~0#1 then 1 else 0)); {800#true} is VALID [2022-02-20 17:02:29,051 INFO L290 TraceCheckUtils]: 38: Hoare triple {800#true} ~cond := #in~cond; {800#true} is VALID [2022-02-20 17:02:29,052 INFO L290 TraceCheckUtils]: 39: Hoare triple {800#true} assume !(0 == ~cond); {800#true} is VALID [2022-02-20 17:02:29,052 INFO L290 TraceCheckUtils]: 40: Hoare triple {800#true} assume true; {800#true} is VALID [2022-02-20 17:02:29,052 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {800#true} {950#(and (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) (+ 4 |ULTIMATE.start_main_~bufsize_0~0#1|)))} #76#return; {950#(and (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) (+ 4 |ULTIMATE.start_main_~bufsize_0~0#1|)))} is VALID [2022-02-20 17:02:29,053 INFO L272 TraceCheckUtils]: 42: Hoare triple {950#(and (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) (+ 4 |ULTIMATE.start_main_~bufsize_0~0#1|)))} call __VERIFIER_assert((if 1 + main_~p~0#1 < main_~bufsize_0~0#1 then 1 else 0)); {800#true} is VALID [2022-02-20 17:02:29,053 INFO L290 TraceCheckUtils]: 43: Hoare triple {800#true} ~cond := #in~cond; {800#true} is VALID [2022-02-20 17:02:29,053 INFO L290 TraceCheckUtils]: 44: Hoare triple {800#true} assume !(0 == ~cond); {800#true} is VALID [2022-02-20 17:02:29,053 INFO L290 TraceCheckUtils]: 45: Hoare triple {800#true} assume true; {800#true} is VALID [2022-02-20 17:02:29,054 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {800#true} {950#(and (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) (+ 4 |ULTIMATE.start_main_~bufsize_0~0#1|)))} #78#return; {950#(and (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) (+ 4 |ULTIMATE.start_main_~bufsize_0~0#1|)))} is VALID [2022-02-20 17:02:29,054 INFO L290 TraceCheckUtils]: 47: Hoare triple {950#(and (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) (+ 4 |ULTIMATE.start_main_~bufsize_0~0#1|)))} main_~p~0#1 := 2 + main_~p~0#1; {987#(and (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) (+ 6 |ULTIMATE.start_main_~bufsize_0~0#1|)) (<= 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 17:02:29,055 INFO L290 TraceCheckUtils]: 48: Hoare triple {987#(and (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) (+ 6 |ULTIMATE.start_main_~bufsize_0~0#1|)) (<= 2 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {991#(and (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) (+ 6 |ULTIMATE.start_main_~bufsize_0~0#1|)) (<= 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 17:02:29,056 INFO L290 TraceCheckUtils]: 49: Hoare triple {991#(and (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) (+ 6 |ULTIMATE.start_main_~bufsize_0~0#1|)) (<= 3 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~ielen~0#1 && main_~bufsize~0#1 > 2); {831#(<= (+ 2 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|)} is VALID [2022-02-20 17:02:29,056 INFO L272 TraceCheckUtils]: 50: Hoare triple {831#(<= (+ 2 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|)} call __VERIFIER_assert((if 0 <= main_~p~0#1 then 1 else 0)); {800#true} is VALID [2022-02-20 17:02:29,056 INFO L290 TraceCheckUtils]: 51: Hoare triple {800#true} ~cond := #in~cond; {800#true} is VALID [2022-02-20 17:02:29,056 INFO L290 TraceCheckUtils]: 52: Hoare triple {800#true} assume !(0 == ~cond); {800#true} is VALID [2022-02-20 17:02:29,056 INFO L290 TraceCheckUtils]: 53: Hoare triple {800#true} assume true; {800#true} is VALID [2022-02-20 17:02:29,057 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {800#true} {831#(<= (+ 2 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|)} #76#return; {831#(<= (+ 2 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|)} is VALID [2022-02-20 17:02:29,058 INFO L272 TraceCheckUtils]: 55: Hoare triple {831#(<= (+ 2 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|)} call __VERIFIER_assert((if 1 + main_~p~0#1 < main_~bufsize_0~0#1 then 1 else 0)); {1013#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:02:29,059 INFO L290 TraceCheckUtils]: 56: Hoare triple {1013#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1017#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:02:29,059 INFO L290 TraceCheckUtils]: 57: Hoare triple {1017#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {801#false} is VALID [2022-02-20 17:02:29,059 INFO L290 TraceCheckUtils]: 58: Hoare triple {801#false} assume !false; {801#false} is VALID [2022-02-20 17:02:29,060 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 14 proven. 24 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-02-20 17:02:29,060 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:02:29,778 INFO L290 TraceCheckUtils]: 58: Hoare triple {801#false} assume !false; {801#false} is VALID [2022-02-20 17:02:29,778 INFO L290 TraceCheckUtils]: 57: Hoare triple {1017#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {801#false} is VALID [2022-02-20 17:02:29,779 INFO L290 TraceCheckUtils]: 56: Hoare triple {1013#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1017#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:02:29,787 INFO L272 TraceCheckUtils]: 55: Hoare triple {831#(<= (+ 2 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|)} call __VERIFIER_assert((if 1 + main_~p~0#1 < main_~bufsize_0~0#1 then 1 else 0)); {1013#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:02:29,788 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {800#true} {831#(<= (+ 2 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|)} #76#return; {831#(<= (+ 2 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|)} is VALID [2022-02-20 17:02:29,788 INFO L290 TraceCheckUtils]: 53: Hoare triple {800#true} assume true; {800#true} is VALID [2022-02-20 17:02:29,788 INFO L290 TraceCheckUtils]: 52: Hoare triple {800#true} assume !(0 == ~cond); {800#true} is VALID [2022-02-20 17:02:29,789 INFO L290 TraceCheckUtils]: 51: Hoare triple {800#true} ~cond := #in~cond; {800#true} is VALID [2022-02-20 17:02:29,789 INFO L272 TraceCheckUtils]: 50: Hoare triple {831#(<= (+ 2 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|)} call __VERIFIER_assert((if 0 <= main_~p~0#1 then 1 else 0)); {800#true} is VALID [2022-02-20 17:02:29,789 INFO L290 TraceCheckUtils]: 49: Hoare triple {1051#(or (<= (+ 2 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|) (not (< |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~ielen~0#1|)))} assume !!(main_~i~0#1 < main_~ielen~0#1 && main_~bufsize~0#1 > 2); {831#(<= (+ 2 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|)} is VALID [2022-02-20 17:02:29,790 INFO L290 TraceCheckUtils]: 48: Hoare triple {1055#(or (<= (+ 2 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|) (<= |ULTIMATE.start_main_~ielen~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1051#(or (<= (+ 2 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|) (not (< |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~ielen~0#1|)))} is VALID [2022-02-20 17:02:29,791 INFO L290 TraceCheckUtils]: 47: Hoare triple {1059#(or (<= (+ |ULTIMATE.start_main_~p~0#1| 4) |ULTIMATE.start_main_~bufsize_0~0#1|) (<= |ULTIMATE.start_main_~ielen~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)))} main_~p~0#1 := 2 + main_~p~0#1; {1055#(or (<= (+ 2 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|) (<= |ULTIMATE.start_main_~ielen~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)))} is VALID [2022-02-20 17:02:29,792 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {800#true} {1059#(or (<= (+ |ULTIMATE.start_main_~p~0#1| 4) |ULTIMATE.start_main_~bufsize_0~0#1|) (<= |ULTIMATE.start_main_~ielen~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)))} #78#return; {1059#(or (<= (+ |ULTIMATE.start_main_~p~0#1| 4) |ULTIMATE.start_main_~bufsize_0~0#1|) (<= |ULTIMATE.start_main_~ielen~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)))} is VALID [2022-02-20 17:02:29,792 INFO L290 TraceCheckUtils]: 45: Hoare triple {800#true} assume true; {800#true} is VALID [2022-02-20 17:02:29,792 INFO L290 TraceCheckUtils]: 44: Hoare triple {800#true} assume !(0 == ~cond); {800#true} is VALID [2022-02-20 17:02:29,792 INFO L290 TraceCheckUtils]: 43: Hoare triple {800#true} ~cond := #in~cond; {800#true} is VALID [2022-02-20 17:02:29,792 INFO L272 TraceCheckUtils]: 42: Hoare triple {1059#(or (<= (+ |ULTIMATE.start_main_~p~0#1| 4) |ULTIMATE.start_main_~bufsize_0~0#1|) (<= |ULTIMATE.start_main_~ielen~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)))} call __VERIFIER_assert((if 1 + main_~p~0#1 < main_~bufsize_0~0#1 then 1 else 0)); {800#true} is VALID [2022-02-20 17:02:29,793 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {800#true} {1059#(or (<= (+ |ULTIMATE.start_main_~p~0#1| 4) |ULTIMATE.start_main_~bufsize_0~0#1|) (<= |ULTIMATE.start_main_~ielen~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)))} #76#return; {1059#(or (<= (+ |ULTIMATE.start_main_~p~0#1| 4) |ULTIMATE.start_main_~bufsize_0~0#1|) (<= |ULTIMATE.start_main_~ielen~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)))} is VALID [2022-02-20 17:02:29,793 INFO L290 TraceCheckUtils]: 40: Hoare triple {800#true} assume true; {800#true} is VALID [2022-02-20 17:02:29,794 INFO L290 TraceCheckUtils]: 39: Hoare triple {800#true} assume !(0 == ~cond); {800#true} is VALID [2022-02-20 17:02:29,794 INFO L290 TraceCheckUtils]: 38: Hoare triple {800#true} ~cond := #in~cond; {800#true} is VALID [2022-02-20 17:02:29,794 INFO L272 TraceCheckUtils]: 37: Hoare triple {1059#(or (<= (+ |ULTIMATE.start_main_~p~0#1| 4) |ULTIMATE.start_main_~bufsize_0~0#1|) (<= |ULTIMATE.start_main_~ielen~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)))} call __VERIFIER_assert((if 0 <= main_~p~0#1 then 1 else 0)); {800#true} is VALID [2022-02-20 17:02:29,794 INFO L290 TraceCheckUtils]: 36: Hoare triple {1059#(or (<= (+ |ULTIMATE.start_main_~p~0#1| 4) |ULTIMATE.start_main_~bufsize_0~0#1|) (<= |ULTIMATE.start_main_~ielen~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)))} assume !!(main_~i~0#1 < main_~ielen~0#1 && main_~bufsize~0#1 > 2); {1059#(or (<= (+ |ULTIMATE.start_main_~p~0#1| 4) |ULTIMATE.start_main_~bufsize_0~0#1|) (<= |ULTIMATE.start_main_~ielen~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)))} is VALID [2022-02-20 17:02:29,795 INFO L290 TraceCheckUtils]: 35: Hoare triple {1096#(or (<= |ULTIMATE.start_main_~ielen~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (<= (+ |ULTIMATE.start_main_~p~0#1| 4) |ULTIMATE.start_main_~bufsize_0~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1059#(or (<= (+ |ULTIMATE.start_main_~p~0#1| 4) |ULTIMATE.start_main_~bufsize_0~0#1|) (<= |ULTIMATE.start_main_~ielen~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)))} is VALID [2022-02-20 17:02:29,795 INFO L290 TraceCheckUtils]: 34: Hoare triple {1100#(or (<= |ULTIMATE.start_main_~ielen~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (<= (+ 6 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|))} main_~p~0#1 := 2 + main_~p~0#1; {1096#(or (<= |ULTIMATE.start_main_~ielen~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (<= (+ |ULTIMATE.start_main_~p~0#1| 4) |ULTIMATE.start_main_~bufsize_0~0#1|))} is VALID [2022-02-20 17:02:29,796 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {800#true} {1100#(or (<= |ULTIMATE.start_main_~ielen~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (<= (+ 6 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|))} #78#return; {1100#(or (<= |ULTIMATE.start_main_~ielen~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (<= (+ 6 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|))} is VALID [2022-02-20 17:02:29,796 INFO L290 TraceCheckUtils]: 32: Hoare triple {800#true} assume true; {800#true} is VALID [2022-02-20 17:02:29,796 INFO L290 TraceCheckUtils]: 31: Hoare triple {800#true} assume !(0 == ~cond); {800#true} is VALID [2022-02-20 17:02:29,796 INFO L290 TraceCheckUtils]: 30: Hoare triple {800#true} ~cond := #in~cond; {800#true} is VALID [2022-02-20 17:02:29,796 INFO L272 TraceCheckUtils]: 29: Hoare triple {1100#(or (<= |ULTIMATE.start_main_~ielen~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (<= (+ 6 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|))} call __VERIFIER_assert((if 1 + main_~p~0#1 < main_~bufsize_0~0#1 then 1 else 0)); {800#true} is VALID [2022-02-20 17:02:29,797 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {800#true} {1100#(or (<= |ULTIMATE.start_main_~ielen~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (<= (+ 6 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|))} #76#return; {1100#(or (<= |ULTIMATE.start_main_~ielen~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (<= (+ 6 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|))} is VALID [2022-02-20 17:02:29,797 INFO L290 TraceCheckUtils]: 27: Hoare triple {800#true} assume true; {800#true} is VALID [2022-02-20 17:02:29,797 INFO L290 TraceCheckUtils]: 26: Hoare triple {800#true} assume !(0 == ~cond); {800#true} is VALID [2022-02-20 17:02:29,797 INFO L290 TraceCheckUtils]: 25: Hoare triple {800#true} ~cond := #in~cond; {800#true} is VALID [2022-02-20 17:02:29,797 INFO L272 TraceCheckUtils]: 24: Hoare triple {1100#(or (<= |ULTIMATE.start_main_~ielen~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (<= (+ 6 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|))} call __VERIFIER_assert((if 0 <= main_~p~0#1 then 1 else 0)); {800#true} is VALID [2022-02-20 17:02:29,798 INFO L290 TraceCheckUtils]: 23: Hoare triple {1100#(or (<= |ULTIMATE.start_main_~ielen~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (<= (+ 6 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|))} assume !!(main_~i~0#1 < main_~ielen~0#1 && main_~bufsize~0#1 > 2); {1100#(or (<= |ULTIMATE.start_main_~ielen~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (<= (+ 6 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|))} is VALID [2022-02-20 17:02:29,798 INFO L290 TraceCheckUtils]: 22: Hoare triple {1137#(or (<= (+ 6 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|) (<= |ULTIMATE.start_main_~ielen~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|)))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1100#(or (<= |ULTIMATE.start_main_~ielen~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (<= (+ 6 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|))} is VALID [2022-02-20 17:02:29,802 INFO L290 TraceCheckUtils]: 21: Hoare triple {1141#(or (<= (+ |ULTIMATE.start_main_~p~0#1| 8) |ULTIMATE.start_main_~bufsize_0~0#1|) (<= |ULTIMATE.start_main_~ielen~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|)))} main_~p~0#1 := 2 + main_~p~0#1; {1137#(or (<= (+ 6 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|) (<= |ULTIMATE.start_main_~ielen~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-20 17:02:29,802 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {800#true} {1141#(or (<= (+ |ULTIMATE.start_main_~p~0#1| 8) |ULTIMATE.start_main_~bufsize_0~0#1|) (<= |ULTIMATE.start_main_~ielen~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|)))} #78#return; {1141#(or (<= (+ |ULTIMATE.start_main_~p~0#1| 8) |ULTIMATE.start_main_~bufsize_0~0#1|) (<= |ULTIMATE.start_main_~ielen~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-20 17:02:29,802 INFO L290 TraceCheckUtils]: 19: Hoare triple {800#true} assume true; {800#true} is VALID [2022-02-20 17:02:29,802 INFO L290 TraceCheckUtils]: 18: Hoare triple {800#true} assume !(0 == ~cond); {800#true} is VALID [2022-02-20 17:02:29,802 INFO L290 TraceCheckUtils]: 17: Hoare triple {800#true} ~cond := #in~cond; {800#true} is VALID [2022-02-20 17:02:29,803 INFO L272 TraceCheckUtils]: 16: Hoare triple {1141#(or (<= (+ |ULTIMATE.start_main_~p~0#1| 8) |ULTIMATE.start_main_~bufsize_0~0#1|) (<= |ULTIMATE.start_main_~ielen~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|)))} call __VERIFIER_assert((if 1 + main_~p~0#1 < main_~bufsize_0~0#1 then 1 else 0)); {800#true} is VALID [2022-02-20 17:02:29,804 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {800#true} {1141#(or (<= (+ |ULTIMATE.start_main_~p~0#1| 8) |ULTIMATE.start_main_~bufsize_0~0#1|) (<= |ULTIMATE.start_main_~ielen~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|)))} #76#return; {1141#(or (<= (+ |ULTIMATE.start_main_~p~0#1| 8) |ULTIMATE.start_main_~bufsize_0~0#1|) (<= |ULTIMATE.start_main_~ielen~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-20 17:02:29,804 INFO L290 TraceCheckUtils]: 14: Hoare triple {800#true} assume true; {800#true} is VALID [2022-02-20 17:02:29,804 INFO L290 TraceCheckUtils]: 13: Hoare triple {800#true} assume !(0 == ~cond); {800#true} is VALID [2022-02-20 17:02:29,804 INFO L290 TraceCheckUtils]: 12: Hoare triple {800#true} ~cond := #in~cond; {800#true} is VALID [2022-02-20 17:02:29,804 INFO L272 TraceCheckUtils]: 11: Hoare triple {1141#(or (<= (+ |ULTIMATE.start_main_~p~0#1| 8) |ULTIMATE.start_main_~bufsize_0~0#1|) (<= |ULTIMATE.start_main_~ielen~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|)))} call __VERIFIER_assert((if 0 <= main_~p~0#1 then 1 else 0)); {800#true} is VALID [2022-02-20 17:02:29,804 INFO L290 TraceCheckUtils]: 10: Hoare triple {1141#(or (<= (+ |ULTIMATE.start_main_~p~0#1| 8) |ULTIMATE.start_main_~bufsize_0~0#1|) (<= |ULTIMATE.start_main_~ielen~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|)))} assume !!(main_~i~0#1 < main_~ielen~0#1 && main_~bufsize~0#1 > 2); {1141#(or (<= (+ |ULTIMATE.start_main_~p~0#1| 8) |ULTIMATE.start_main_~bufsize_0~0#1|) (<= |ULTIMATE.start_main_~ielen~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-20 17:02:29,805 INFO L290 TraceCheckUtils]: 9: Hoare triple {1178#(or (<= (div (+ (- 1) (* (- 1) |ULTIMATE.start_main_~bufsize~0#1|)) (- 2)) 4) (<= (+ |ULTIMATE.start_main_~p~0#1| 8) |ULTIMATE.start_main_~bufsize_0~0#1|))} assume !(main_~bufsize~0#1 < 2 * main_~ielen~0#1);main_~i~0#1 := 0; {1141#(or (<= (+ |ULTIMATE.start_main_~p~0#1| 8) |ULTIMATE.start_main_~bufsize_0~0#1|) (<= |ULTIMATE.start_main_~ielen~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-20 17:02:29,806 INFO L290 TraceCheckUtils]: 8: Hoare triple {800#true} assume !(main_~bufsize~0#1 < main_~leader_len~0#1);main_~p~0#1 := 0;main_~bufsize_0~0#1 := main_~bufsize~0#1;main_~bufsize~0#1 := main_~bufsize~0#1 - main_~leader_len~0#1;main_~p~0#1 := main_~p~0#1 + main_~leader_len~0#1; {1178#(or (<= (div (+ (- 1) (* (- 1) |ULTIMATE.start_main_~bufsize~0#1|)) (- 2)) 4) (<= (+ |ULTIMATE.start_main_~p~0#1| 8) |ULTIMATE.start_main_~bufsize_0~0#1|))} is VALID [2022-02-20 17:02:29,806 INFO L290 TraceCheckUtils]: 7: Hoare triple {800#true} assume main_~ielen~0#1 > 0; {800#true} is VALID [2022-02-20 17:02:29,806 INFO L290 TraceCheckUtils]: 6: Hoare triple {800#true} assume main_~bufsize~0#1 > 0; {800#true} is VALID [2022-02-20 17:02:29,806 INFO L290 TraceCheckUtils]: 5: Hoare triple {800#true} assume main_~leader_len~0#1 > 0; {800#true} is VALID [2022-02-20 17:02:29,806 INFO L290 TraceCheckUtils]: 4: Hoare triple {800#true} assume !!(main_~ielen~0#1 < 1000000); {800#true} is VALID [2022-02-20 17:02:29,806 INFO L290 TraceCheckUtils]: 3: Hoare triple {800#true} assume !!(main_~bufsize~0#1 < 1000000); {800#true} is VALID [2022-02-20 17:02:29,806 INFO L290 TraceCheckUtils]: 2: Hoare triple {800#true} assume !!(main_~leader_len~0#1 < 1000000); {800#true} is VALID [2022-02-20 17:02:29,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {800#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_~p~0#1, main_~i~0#1, main_~leader_len~0#1, main_~bufsize~0#1, main_~bufsize_0~0#1, main_~ielen~0#1;havoc main_~p~0#1;havoc main_~i~0#1;havoc main_~leader_len~0#1;havoc main_~bufsize~0#1;havoc main_~bufsize_0~0#1;havoc main_~ielen~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~leader_len~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~bufsize~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~ielen~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {800#true} is VALID [2022-02-20 17:02:29,807 INFO L290 TraceCheckUtils]: 0: Hoare triple {800#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(9, 2); {800#true} is VALID [2022-02-20 17:02:29,807 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 14 proven. 24 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-02-20 17:02:29,807 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2129635356] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:02:29,808 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 17:02:29,808 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 27 [2022-02-20 17:02:29,808 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942030699] [2022-02-20 17:02:29,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 17:02:29,809 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 25 states have internal predecessors, (48), 9 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (17), 9 states have call predecessors, (17), 9 states have call successors, (17) Word has length 59 [2022-02-20 17:02:29,810 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:02:29,810 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 27 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 25 states have internal predecessors, (48), 9 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (17), 9 states have call predecessors, (17), 9 states have call successors, (17) [2022-02-20 17:02:29,890 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:29,890 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-02-20 17:02:29,890 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:02:29,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-02-20 17:02:29,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=558, Unknown=0, NotChecked=0, Total=702 [2022-02-20 17:02:29,891 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand has 27 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 25 states have internal predecessors, (48), 9 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (17), 9 states have call predecessors, (17), 9 states have call successors, (17) [2022-02-20 17:02:30,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:30,724 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2022-02-20 17:02:30,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-02-20 17:02:30,725 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 25 states have internal predecessors, (48), 9 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (17), 9 states have call predecessors, (17), 9 states have call successors, (17) Word has length 59 [2022-02-20 17:02:30,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:02:30,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 25 states have internal predecessors, (48), 9 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (17), 9 states have call predecessors, (17), 9 states have call successors, (17) [2022-02-20 17:02:30,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 52 transitions. [2022-02-20 17:02:30,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 25 states have internal predecessors, (48), 9 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (17), 9 states have call predecessors, (17), 9 states have call successors, (17) [2022-02-20 17:02:30,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 52 transitions. [2022-02-20 17:02:30,731 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 52 transitions. [2022-02-20 17:02:30,775 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:30,775 INFO L225 Difference]: With dead ends: 52 [2022-02-20 17:02:30,775 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 17:02:30,776 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 115 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=246, Invalid=876, Unknown=0, NotChecked=0, Total=1122 [2022-02-20 17:02:30,777 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 31 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 17:02:30,777 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 219 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 17:02:30,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 17:02:30,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 17:02:30,778 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:02:30,778 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:02:30,778 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:02:30,778 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:02:30,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:30,779 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 17:02:30,779 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:02:30,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:30,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:30,779 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 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 0 states. [2022-02-20 17:02:30,779 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 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 0 states. [2022-02-20 17:02:30,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:30,780 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 17:02:30,780 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:02:30,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:30,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:30,780 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:02:30,780 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:02:30,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:02:30,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 17:02:30,780 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 59 [2022-02-20 17:02:30,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:02:30,781 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 17:02:30,781 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 25 states have internal predecessors, (48), 9 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (17), 9 states have call predecessors, (17), 9 states have call successors, (17) [2022-02-20 17:02:30,781 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:02:30,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:30,783 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 17:02:30,809 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 17:02:30,999 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,SelfDestructingSolverStorable3 [2022-02-20 17:02:31,001 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 17:02:31,125 INFO L858 garLoopResultBuilder]: For program point L40(lines 25 56) no Hoare annotation was computed. [2022-02-20 17:02:31,125 INFO L858 garLoopResultBuilder]: For program point L36(line 36) no Hoare annotation was computed. [2022-02-20 17:02:31,126 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 17:02:31,126 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 17:02:31,126 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 17:02:31,126 INFO L858 garLoopResultBuilder]: For program point L49-2(lines 49 53) no Hoare annotation was computed. [2022-02-20 17:02:31,126 INFO L854 garLoopResultBuilder]: At program point L49-3(lines 49 53) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~p~0#1|) (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) (+ (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|)) (<= 1 |ULTIMATE.start_main_~leader_len~0#1|)) [2022-02-20 17:02:31,126 INFO L858 garLoopResultBuilder]: For program point L37(line 37) no Hoare annotation was computed. [2022-02-20 17:02:31,126 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 17:02:31,127 INFO L861 garLoopResultBuilder]: At program point L54(lines 25 56) the Hoare annotation is: true [2022-02-20 17:02:31,127 INFO L854 garLoopResultBuilder]: At program point L50(line 50) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~p~0#1|) (<= (+ 2 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|) (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) (+ (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|)) (<= 1 |ULTIMATE.start_main_~leader_len~0#1|)) [2022-02-20 17:02:31,127 INFO L854 garLoopResultBuilder]: At program point L50-1(line 50) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~p~0#1|) (<= (+ 2 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|) (<= (+ |ULTIMATE.start_main_~p~0#1| (* 2 |ULTIMATE.start_main_~ielen~0#1|)) (+ (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~bufsize_0~0#1|)) (<= 1 |ULTIMATE.start_main_~leader_len~0#1|)) [2022-02-20 17:02:31,127 INFO L858 garLoopResultBuilder]: For program point L38(line 38) no Hoare annotation was computed. [2022-02-20 17:02:31,127 INFO L858 garLoopResultBuilder]: For program point L38-1(lines 25 56) no Hoare annotation was computed. [2022-02-20 17:02:31,127 INFO L858 garLoopResultBuilder]: For program point L51(line 51) no Hoare annotation was computed. [2022-02-20 17:02:31,127 INFO L858 garLoopResultBuilder]: For program point L47(lines 47 48) no Hoare annotation was computed. [2022-02-20 17:02:31,128 INFO L858 garLoopResultBuilder]: For program point L39(lines 25 56) no Hoare annotation was computed. [2022-02-20 17:02:31,128 INFO L858 garLoopResultBuilder]: For program point L35(line 35) no Hoare annotation was computed. [2022-02-20 17:02:31,128 INFO L858 garLoopResultBuilder]: For program point L18-2(lines 17 22) no Hoare annotation was computed. [2022-02-20 17:02:31,128 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-02-20 17:02:31,128 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 17 22) no Hoare annotation was computed. [2022-02-20 17:02:31,128 INFO L858 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2022-02-20 17:02:31,128 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-02-20 17:02:31,129 INFO L858 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2022-02-20 17:02:31,131 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2022-02-20 17:02:31,132 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 17:02:31,135 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 17:02:31,135 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-02-20 17:02:31,136 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 17:02:31,136 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-02-20 17:02:31,136 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-02-20 17:02:31,136 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-02-20 17:02:31,136 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-02-20 17:02:31,136 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-02-20 17:02:31,136 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-02-20 17:02:31,136 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2022-02-20 17:02:31,136 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 17:02:31,137 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-02-20 17:02:31,137 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-02-20 17:02:31,137 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:02:31,137 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:02:31,137 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 17:02:31,137 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-02-20 17:02:31,137 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-02-20 17:02:31,137 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2022-02-20 17:02:31,138 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2022-02-20 17:02:31,138 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-02-20 17:02:31,138 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-02-20 17:02:31,138 WARN L170 areAnnotationChecker]: L49-2 has no Hoare annotation [2022-02-20 17:02:31,138 WARN L170 areAnnotationChecker]: L38-1 has no Hoare annotation [2022-02-20 17:02:31,138 WARN L170 areAnnotationChecker]: L38-1 has no Hoare annotation [2022-02-20 17:02:31,140 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-02-20 17:02:31,140 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-02-20 17:02:31,140 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-20 17:02:31,140 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-20 17:02:31,140 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-02-20 17:02:31,140 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-02-20 17:02:31,140 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 17:02:31,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 05:02:31 BoogieIcfgContainer [2022-02-20 17:02:31,148 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 17:02:31,149 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 17:02:31,149 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 17:02:31,149 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 17:02:31,149 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:02:24" (3/4) ... [2022-02-20 17:02:31,152 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 17:02:31,156 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-02-20 17:02:31,159 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2022-02-20 17:02:31,160 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-02-20 17:02:31,160 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 17:02:31,160 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 17:02:31,189 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 17:02:31,189 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 17:02:31,190 INFO L158 Benchmark]: Toolchain (without parser) took 7369.03ms. Allocated memory was 90.2MB in the beginning and 132.1MB in the end (delta: 41.9MB). Free memory was 58.3MB in the beginning and 46.9MB in the end (delta: 11.5MB). Peak memory consumption was 53.0MB. Max. memory is 16.1GB. [2022-02-20 17:02:31,190 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 90.2MB. Free memory was 44.1MB in the beginning and 44.0MB in the end (delta: 70.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:02:31,191 INFO L158 Benchmark]: CACSL2BoogieTranslator took 266.74ms. Allocated memory is still 90.2MB. Free memory was 58.2MB in the beginning and 65.6MB in the end (delta: -7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 17:02:31,191 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.59ms. Allocated memory is still 90.2MB. Free memory was 65.6MB in the beginning and 64.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:02:31,191 INFO L158 Benchmark]: Boogie Preprocessor took 19.17ms. Allocated memory is still 90.2MB. Free memory was 64.1MB in the beginning and 62.9MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:02:31,192 INFO L158 Benchmark]: RCFGBuilder took 380.28ms. Allocated memory is still 90.2MB. Free memory was 62.9MB in the beginning and 50.4MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 17:02:31,192 INFO L158 Benchmark]: TraceAbstraction took 6625.70ms. Allocated memory was 90.2MB in the beginning and 132.1MB in the end (delta: 41.9MB). Free memory was 50.1MB in the beginning and 49.0MB in the end (delta: 1.1MB). Peak memory consumption was 45.5MB. Max. memory is 16.1GB. [2022-02-20 17:02:31,192 INFO L158 Benchmark]: Witness Printer took 40.40ms. Allocated memory is still 132.1MB. Free memory was 49.0MB in the beginning and 46.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:02:31,194 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 90.2MB. Free memory was 44.1MB in the beginning and 44.0MB in the end (delta: 70.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 266.74ms. Allocated memory is still 90.2MB. Free memory was 58.2MB in the beginning and 65.6MB in the end (delta: -7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.59ms. Allocated memory is still 90.2MB. Free memory was 65.6MB in the beginning and 64.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 19.17ms. Allocated memory is still 90.2MB. Free memory was 64.1MB in the beginning and 62.9MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 380.28ms. Allocated memory is still 90.2MB. Free memory was 62.9MB in the beginning and 50.4MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 6625.70ms. Allocated memory was 90.2MB in the beginning and 132.1MB in the end (delta: 41.9MB). Free memory was 50.1MB in the beginning and 49.0MB in the end (delta: 1.1MB). Peak memory consumption was 45.5MB. Max. memory is 16.1GB. * Witness Printer took 40.40ms. Allocated memory is still 132.1MB. Free memory was 49.0MB in the beginning and 46.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.5s, OverallIterations: 4, TraceHistogramMax: 8, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 78 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 77 mSDsluCounter, 644 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 544 mSDsCounter, 102 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 444 IncrementalHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 102 mSolverCounterUnsat, 100 mSDtfsCounter, 444 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 251 GetRequests, 181 SyntacticMatches, 6 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=3, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 16 PreInvPairs, 34 NumberOfFragments, 66 HoareAnnotationTreeSize, 16 FomulaSimplifications, 15 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 290 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 219 NumberOfCodeBlocks, 219 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 303 ConstructedInterpolants, 0 QuantifiedInterpolants, 1155 SizeOfPredicates, 16 NumberOfNonLiveVariables, 222 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 357/431 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: (1 <= p && p + 2 * ielen <= 2 * i + bufsize_0) && 1 <= leader_len RESULT: Ultimate proved your program to be correct! [2022-02-20 17:02:31,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE