./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/apache-get-tag.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/apache-get-tag.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 ad8e21886f5f45a7c58400298498a881b4f628bf6fff913be81ab14cf250dd19 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:03:15,073 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:03:15,074 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:03:15,121 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:03:15,122 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:03:15,122 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:03:15,123 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:03:15,124 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:03:15,129 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:03:15,134 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:03:15,135 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:03:15,152 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:03:15,152 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:03:15,153 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:03:15,153 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:03:15,154 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:03:15,154 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:03:15,155 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:03:15,156 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:03:15,157 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:03:15,158 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:03:15,163 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:03:15,165 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:03:15,166 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:03:15,172 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:03:15,172 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:03:15,172 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:03:15,173 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:03:15,173 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:03:15,174 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:03:15,174 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:03:15,175 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:03:15,176 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:03:15,177 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:03:15,178 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:03:15,178 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:03:15,178 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:03:15,178 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:03:15,178 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:03:15,180 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:03:15,181 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:03:15,181 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:03:15,203 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:03:15,203 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:03:15,203 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:03:15,204 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:03:15,204 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:03:15,204 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:03:15,204 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:03:15,204 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:03:15,205 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:03:15,205 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:03:15,205 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:03:15,205 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:03:15,205 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:03:15,205 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:03:15,205 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:03:15,205 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:03:15,205 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:03:15,205 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:03:15,205 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:03:15,205 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:03:15,206 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:03:15,206 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:03:15,206 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:03:15,206 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:03:15,206 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:03:15,206 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:03:15,206 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:03:15,206 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:03:15,206 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:03:15,206 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:03:15,206 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:03:15,207 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:03:15,207 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:03:15,207 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 -> ad8e21886f5f45a7c58400298498a881b4f628bf6fff913be81ab14cf250dd19 [2022-02-20 17:03:15,441 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:03:15,456 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:03:15,458 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:03:15,459 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:03:15,460 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:03:15,461 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/apache-get-tag.i [2022-02-20 17:03:15,524 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/095dd23a0/8c578827817f4d87a62d0b54ad7d9277/FLAGb992a9eaf [2022-02-20 17:03:15,888 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:03:15,888 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i [2022-02-20 17:03:15,892 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/095dd23a0/8c578827817f4d87a62d0b54ad7d9277/FLAGb992a9eaf [2022-02-20 17:03:15,911 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/095dd23a0/8c578827817f4d87a62d0b54ad7d9277 [2022-02-20 17:03:15,913 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:03:15,916 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:03:15,918 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:03:15,918 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:03:15,920 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:03:15,921 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:03:15" (1/1) ... [2022-02-20 17:03:15,922 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2747f984 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:03:15, skipping insertion in model container [2022-02-20 17:03:15,922 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:03:15" (1/1) ... [2022-02-20 17:03:15,926 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:03:15,939 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:03:16,092 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/apache-get-tag.i[893,906] [2022-02-20 17:03:16,118 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:03:16,126 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:03:16,138 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/apache-get-tag.i[893,906] [2022-02-20 17:03:16,155 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:03:16,165 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:03:16,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:03:16 WrapperNode [2022-02-20 17:03:16,165 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:03:16,166 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:03:16,166 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:03:16,167 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:03:16,171 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:03:16" (1/1) ... [2022-02-20 17:03:16,176 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:03:16" (1/1) ... [2022-02-20 17:03:16,198 INFO L137 Inliner]: procedures = 16, calls = 22, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 83 [2022-02-20 17:03:16,199 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:03:16,199 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:03:16,200 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:03:16,200 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:03:16,205 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:03:16" (1/1) ... [2022-02-20 17:03:16,205 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:03:16" (1/1) ... [2022-02-20 17:03:16,212 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:03:16" (1/1) ... [2022-02-20 17:03:16,212 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:03:16" (1/1) ... [2022-02-20 17:03:16,220 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:03:16" (1/1) ... [2022-02-20 17:03:16,225 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:03:16" (1/1) ... [2022-02-20 17:03:16,228 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:03:16" (1/1) ... [2022-02-20 17:03:16,229 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:03:16,231 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:03:16,231 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:03:16,232 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:03:16,232 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:03:16" (1/1) ... [2022-02-20 17:03:16,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:03:16,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:03:16,254 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:03:16,289 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:03:16,309 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:03:16,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:03:16,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:03:16,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:03:16,310 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:03:16,310 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:03:16,350 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:03:16,352 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:03:16,514 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:03:16,519 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:03:16,519 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 17:03:16,520 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:03:16 BoogieIcfgContainer [2022-02-20 17:03:16,520 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:03:16,522 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:03:16,522 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:03:16,524 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:03:16,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:03:15" (1/3) ... [2022-02-20 17:03:16,525 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e5fb35c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:03:16, skipping insertion in model container [2022-02-20 17:03:16,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:03:16" (2/3) ... [2022-02-20 17:03:16,525 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e5fb35c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:03:16, skipping insertion in model container [2022-02-20 17:03:16,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:03:16" (3/3) ... [2022-02-20 17:03:16,526 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i [2022-02-20 17:03:16,529 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:03:16,530 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:03:16,558 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:03:16,563 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:03:16,563 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:03:16,577 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 29 states have internal predecessors, (38), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 17:03:16,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 17:03:16,580 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:03:16,581 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:03:16,581 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:03:16,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:03:16,585 INFO L85 PathProgramCache]: Analyzing trace with hash -587348936, now seen corresponding path program 1 times [2022-02-20 17:03:16,591 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:03:16,591 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827526417] [2022-02-20 17:03:16,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:03:16,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:03:16,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:03:16,689 INFO L290 TraceCheckUtils]: 0: Hoare triple {46#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); {46#true} is VALID [2022-02-20 17:03:16,689 INFO L290 TraceCheckUtils]: 1: Hoare triple {46#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~pre2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~post8#1, main_#t~nondet9#1, main_#t~post10#1, main_~tagbuf_len~0#1, main_~t~0#1;havoc main_~tagbuf_len~0#1;havoc main_~t~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~tagbuf_len~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {46#true} is VALID [2022-02-20 17:03:16,690 INFO L290 TraceCheckUtils]: 2: Hoare triple {46#true} assume main_~tagbuf_len~0#1 >= 1; {46#true} is VALID [2022-02-20 17:03:16,690 INFO L290 TraceCheckUtils]: 3: Hoare triple {46#true} main_~t~0#1 := 0;main_#t~pre2#1 := main_~tagbuf_len~0#1 - 1;main_~tagbuf_len~0#1 := main_~tagbuf_len~0#1 - 1;havoc main_#t~pre2#1; {46#true} is VALID [2022-02-20 17:03:16,691 INFO L290 TraceCheckUtils]: 4: Hoare triple {46#true} assume false; {47#false} is VALID [2022-02-20 17:03:16,691 INFO L272 TraceCheckUtils]: 5: Hoare triple {47#false} call __VERIFIER_assert((if 0 <= main_~t~0#1 then 1 else 0)); {47#false} is VALID [2022-02-20 17:03:16,691 INFO L290 TraceCheckUtils]: 6: Hoare triple {47#false} ~cond := #in~cond; {47#false} is VALID [2022-02-20 17:03:16,691 INFO L290 TraceCheckUtils]: 7: Hoare triple {47#false} assume 0 == ~cond; {47#false} is VALID [2022-02-20 17:03:16,692 INFO L290 TraceCheckUtils]: 8: Hoare triple {47#false} assume !false; {47#false} is VALID [2022-02-20 17:03:16,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:03:16,693 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:03:16,693 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827526417] [2022-02-20 17:03:16,693 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827526417] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:03:16,693 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:03:16,694 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:03:16,695 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361603527] [2022-02-20 17:03:16,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:03:16,698 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 9 [2022-02-20 17:03:16,699 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:03:16,701 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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:03:16,726 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:03:16,727 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:03:16,728 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:03:16,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:03:16,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:03:16,758 INFO L87 Difference]: Start difference. First operand has 43 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 29 states have internal predecessors, (38), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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:03:16,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:03:16,888 INFO L93 Difference]: Finished difference Result 82 states and 151 transitions. [2022-02-20 17:03:16,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:03:16,889 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 9 [2022-02-20 17:03:16,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:03:16,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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:03:16,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 151 transitions. [2022-02-20 17:03:16,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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:03:16,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 151 transitions. [2022-02-20 17:03:16,906 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 151 transitions. [2022-02-20 17:03:17,079 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:03:17,096 INFO L225 Difference]: With dead ends: 82 [2022-02-20 17:03:17,096 INFO L226 Difference]: Without dead ends: 39 [2022-02-20 17:03:17,100 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:03:17,103 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:03:17,104 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:03:17,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-02-20 17:03:17,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-02-20 17:03:17,128 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:03:17,128 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 21 states have (on average 1.380952380952381) internal successors, (29), 25 states have internal predecessors, (29), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 17:03:17,129 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 21 states have (on average 1.380952380952381) internal successors, (29), 25 states have internal predecessors, (29), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 17:03:17,129 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 21 states have (on average 1.380952380952381) internal successors, (29), 25 states have internal predecessors, (29), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 17:03:17,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:03:17,133 INFO L93 Difference]: Finished difference Result 39 states and 57 transitions. [2022-02-20 17:03:17,134 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 57 transitions. [2022-02-20 17:03:17,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:03:17,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:03:17,135 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 21 states have (on average 1.380952380952381) internal successors, (29), 25 states have internal predecessors, (29), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 39 states. [2022-02-20 17:03:17,135 INFO L87 Difference]: Start difference. First operand has 39 states, 21 states have (on average 1.380952380952381) internal successors, (29), 25 states have internal predecessors, (29), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 39 states. [2022-02-20 17:03:17,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:03:17,139 INFO L93 Difference]: Finished difference Result 39 states and 57 transitions. [2022-02-20 17:03:17,139 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 57 transitions. [2022-02-20 17:03:17,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:03:17,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:03:17,140 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:03:17,140 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:03:17,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 21 states have (on average 1.380952380952381) internal successors, (29), 25 states have internal predecessors, (29), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 17:03:17,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 57 transitions. [2022-02-20 17:03:17,144 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 57 transitions. Word has length 9 [2022-02-20 17:03:17,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:03:17,144 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 57 transitions. [2022-02-20 17:03:17,144 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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:03:17,144 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 57 transitions. [2022-02-20 17:03:17,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 17:03:17,145 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:03:17,145 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:03:17,145 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:03:17,145 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:03:17,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:03:17,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1057175647, now seen corresponding path program 1 times [2022-02-20 17:03:17,146 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:03:17,146 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52448194] [2022-02-20 17:03:17,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:03:17,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:03:17,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:03:17,206 INFO L290 TraceCheckUtils]: 0: Hoare triple {310#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); {310#true} is VALID [2022-02-20 17:03:17,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {310#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~pre2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~post8#1, main_#t~nondet9#1, main_#t~post10#1, main_~tagbuf_len~0#1, main_~t~0#1;havoc main_~tagbuf_len~0#1;havoc main_~t~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~tagbuf_len~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {310#true} is VALID [2022-02-20 17:03:17,207 INFO L290 TraceCheckUtils]: 2: Hoare triple {310#true} assume main_~tagbuf_len~0#1 >= 1; {310#true} is VALID [2022-02-20 17:03:17,207 INFO L290 TraceCheckUtils]: 3: Hoare triple {310#true} main_~t~0#1 := 0;main_#t~pre2#1 := main_~tagbuf_len~0#1 - 1;main_~tagbuf_len~0#1 := main_~tagbuf_len~0#1 - 1;havoc main_#t~pre2#1; {312#(<= 0 |ULTIMATE.start_main_~t~0#1|)} is VALID [2022-02-20 17:03:17,208 INFO L290 TraceCheckUtils]: 4: Hoare triple {312#(<= 0 |ULTIMATE.start_main_~t~0#1|)} assume !false; {312#(<= 0 |ULTIMATE.start_main_~t~0#1|)} is VALID [2022-02-20 17:03:17,208 INFO L290 TraceCheckUtils]: 5: Hoare triple {312#(<= 0 |ULTIMATE.start_main_~t~0#1|)} assume main_~t~0#1 == main_~tagbuf_len~0#1; {312#(<= 0 |ULTIMATE.start_main_~t~0#1|)} is VALID [2022-02-20 17:03:17,209 INFO L272 TraceCheckUtils]: 6: Hoare triple {312#(<= 0 |ULTIMATE.start_main_~t~0#1|)} call __VERIFIER_assert((if 0 <= main_~t~0#1 then 1 else 0)); {313#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:03:17,209 INFO L290 TraceCheckUtils]: 7: Hoare triple {313#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {314#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:03:17,209 INFO L290 TraceCheckUtils]: 8: Hoare triple {314#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {311#false} is VALID [2022-02-20 17:03:17,210 INFO L290 TraceCheckUtils]: 9: Hoare triple {311#false} assume !false; {311#false} is VALID [2022-02-20 17:03:17,210 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:03:17,210 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:03:17,210 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52448194] [2022-02-20 17:03:17,210 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52448194] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:03:17,210 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:03:17,210 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:03:17,211 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272235485] [2022-02-20 17:03:17,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:03:17,212 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 10 [2022-02-20 17:03:17,212 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:03:17,212 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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:03:17,219 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:03:17,219 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:03:17,219 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:03:17,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:03:17,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:03:17,220 INFO L87 Difference]: Start difference. First operand 39 states and 57 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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:03:17,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:03:17,421 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2022-02-20 17:03:17,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:03:17,421 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 10 [2022-02-20 17:03:17,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:03:17,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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:03:17,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2022-02-20 17:03:17,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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:03:17,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2022-02-20 17:03:17,425 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 62 transitions. [2022-02-20 17:03:17,470 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:03:17,472 INFO L225 Difference]: With dead ends: 45 [2022-02-20 17:03:17,472 INFO L226 Difference]: Without dead ends: 43 [2022-02-20 17:03:17,472 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:03:17,473 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 20 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:03:17,473 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 115 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:03:17,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-02-20 17:03:17,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-02-20 17:03:17,488 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:03:17,489 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 43 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 28 states have internal predecessors, (32), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 17:03:17,489 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 43 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 28 states have internal predecessors, (32), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 17:03:17,489 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 43 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 28 states have internal predecessors, (32), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 17:03:17,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:03:17,492 INFO L93 Difference]: Finished difference Result 43 states and 60 transitions. [2022-02-20 17:03:17,492 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 60 transitions. [2022-02-20 17:03:17,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:03:17,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:03:17,493 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 28 states have internal predecessors, (32), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 43 states. [2022-02-20 17:03:17,493 INFO L87 Difference]: Start difference. First operand has 43 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 28 states have internal predecessors, (32), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 43 states. [2022-02-20 17:03:17,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:03:17,496 INFO L93 Difference]: Finished difference Result 43 states and 60 transitions. [2022-02-20 17:03:17,496 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 60 transitions. [2022-02-20 17:03:17,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:03:17,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:03:17,512 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:03:17,512 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:03:17,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 28 states have internal predecessors, (32), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 17:03:17,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 60 transitions. [2022-02-20 17:03:17,514 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 60 transitions. Word has length 10 [2022-02-20 17:03:17,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:03:17,515 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 60 transitions. [2022-02-20 17:03:17,515 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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:03:17,515 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 60 transitions. [2022-02-20 17:03:17,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 17:03:17,516 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:03:17,516 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:03:17,516 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 17:03:17,516 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:03:17,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:03:17,517 INFO L85 PathProgramCache]: Analyzing trace with hash 986719232, now seen corresponding path program 1 times [2022-02-20 17:03:17,517 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:03:17,517 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292289276] [2022-02-20 17:03:17,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:03:17,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:03:17,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:03:17,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 17:03:17,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:03:17,631 INFO L290 TraceCheckUtils]: 0: Hoare triple {533#true} ~cond := #in~cond; {533#true} is VALID [2022-02-20 17:03:17,632 INFO L290 TraceCheckUtils]: 1: Hoare triple {533#true} assume !(0 == ~cond); {533#true} is VALID [2022-02-20 17:03:17,632 INFO L290 TraceCheckUtils]: 2: Hoare triple {533#true} assume true; {533#true} is VALID [2022-02-20 17:03:17,648 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {533#true} {536#(<= |ULTIMATE.start_main_~t~0#1| |ULTIMATE.start_main_~tagbuf_len~0#1|)} #108#return; {536#(<= |ULTIMATE.start_main_~t~0#1| |ULTIMATE.start_main_~tagbuf_len~0#1|)} is VALID [2022-02-20 17:03:17,648 INFO L290 TraceCheckUtils]: 0: Hoare triple {533#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); {533#true} is VALID [2022-02-20 17:03:17,648 INFO L290 TraceCheckUtils]: 1: Hoare triple {533#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~pre2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~post8#1, main_#t~nondet9#1, main_#t~post10#1, main_~tagbuf_len~0#1, main_~t~0#1;havoc main_~tagbuf_len~0#1;havoc main_~t~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~tagbuf_len~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {533#true} is VALID [2022-02-20 17:03:17,648 INFO L290 TraceCheckUtils]: 2: Hoare triple {533#true} assume main_~tagbuf_len~0#1 >= 1; {533#true} is VALID [2022-02-20 17:03:17,649 INFO L290 TraceCheckUtils]: 3: Hoare triple {533#true} main_~t~0#1 := 0;main_#t~pre2#1 := main_~tagbuf_len~0#1 - 1;main_~tagbuf_len~0#1 := main_~tagbuf_len~0#1 - 1;havoc main_#t~pre2#1; {535#(or (<= |ULTIMATE.start_main_~t~0#1| |ULTIMATE.start_main_~tagbuf_len~0#1|) (= |ULTIMATE.start_main_~t~0#1| 0))} is VALID [2022-02-20 17:03:17,649 INFO L290 TraceCheckUtils]: 4: Hoare triple {535#(or (<= |ULTIMATE.start_main_~t~0#1| |ULTIMATE.start_main_~tagbuf_len~0#1|) (= |ULTIMATE.start_main_~t~0#1| 0))} assume !false; {535#(or (<= |ULTIMATE.start_main_~t~0#1| |ULTIMATE.start_main_~tagbuf_len~0#1|) (= |ULTIMATE.start_main_~t~0#1| 0))} is VALID [2022-02-20 17:03:17,650 INFO L290 TraceCheckUtils]: 5: Hoare triple {535#(or (<= |ULTIMATE.start_main_~t~0#1| |ULTIMATE.start_main_~tagbuf_len~0#1|) (= |ULTIMATE.start_main_~t~0#1| 0))} assume main_~t~0#1 == main_~tagbuf_len~0#1; {536#(<= |ULTIMATE.start_main_~t~0#1| |ULTIMATE.start_main_~tagbuf_len~0#1|)} is VALID [2022-02-20 17:03:17,650 INFO L272 TraceCheckUtils]: 6: Hoare triple {536#(<= |ULTIMATE.start_main_~t~0#1| |ULTIMATE.start_main_~tagbuf_len~0#1|)} call __VERIFIER_assert((if 0 <= main_~t~0#1 then 1 else 0)); {533#true} is VALID [2022-02-20 17:03:17,650 INFO L290 TraceCheckUtils]: 7: Hoare triple {533#true} ~cond := #in~cond; {533#true} is VALID [2022-02-20 17:03:17,650 INFO L290 TraceCheckUtils]: 8: Hoare triple {533#true} assume !(0 == ~cond); {533#true} is VALID [2022-02-20 17:03:17,650 INFO L290 TraceCheckUtils]: 9: Hoare triple {533#true} assume true; {533#true} is VALID [2022-02-20 17:03:17,651 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {533#true} {536#(<= |ULTIMATE.start_main_~t~0#1| |ULTIMATE.start_main_~tagbuf_len~0#1|)} #108#return; {536#(<= |ULTIMATE.start_main_~t~0#1| |ULTIMATE.start_main_~tagbuf_len~0#1|)} is VALID [2022-02-20 17:03:17,651 INFO L272 TraceCheckUtils]: 11: Hoare triple {536#(<= |ULTIMATE.start_main_~t~0#1| |ULTIMATE.start_main_~tagbuf_len~0#1|)} call __VERIFIER_assert((if main_~t~0#1 <= main_~tagbuf_len~0#1 then 1 else 0)); {541#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:03:17,652 INFO L290 TraceCheckUtils]: 12: Hoare triple {541#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {542#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:03:17,652 INFO L290 TraceCheckUtils]: 13: Hoare triple {542#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {534#false} is VALID [2022-02-20 17:03:17,652 INFO L290 TraceCheckUtils]: 14: Hoare triple {534#false} assume !false; {534#false} is VALID [2022-02-20 17:03:17,653 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:03:17,653 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:03:17,653 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292289276] [2022-02-20 17:03:17,653 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292289276] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:03:17,653 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:03:17,653 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 17:03:17,653 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636096289] [2022-02-20 17:03:17,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:03:17,654 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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 15 [2022-02-20 17:03:17,654 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:03:17,654 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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:03:17,664 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:03:17,665 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 17:03:17,665 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:03:17,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 17:03:17,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:03:17,665 INFO L87 Difference]: Start difference. First operand 43 states and 60 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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:03:17,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:03:17,910 INFO L93 Difference]: Finished difference Result 58 states and 80 transitions. [2022-02-20 17:03:17,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 17:03:17,910 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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 15 [2022-02-20 17:03:17,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:03:17,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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:03:17,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 77 transitions. [2022-02-20 17:03:17,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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:03:17,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 77 transitions. [2022-02-20 17:03:17,913 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 77 transitions. [2022-02-20 17:03:17,971 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:03:17,972 INFO L225 Difference]: With dead ends: 58 [2022-02-20 17:03:17,973 INFO L226 Difference]: Without dead ends: 46 [2022-02-20 17:03:17,973 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-02-20 17:03:17,974 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 8 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:03:17,974 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 235 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:03:17,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-02-20 17:03:17,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 37. [2022-02-20 17:03:17,985 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:03:17,986 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 37 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:03:17,986 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 37 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:03:17,986 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 37 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:03:17,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:03:17,988 INFO L93 Difference]: Finished difference Result 46 states and 62 transitions. [2022-02-20 17:03:17,988 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 62 transitions. [2022-02-20 17:03:17,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:03:17,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:03:17,989 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 46 states. [2022-02-20 17:03:17,989 INFO L87 Difference]: Start difference. First operand has 37 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 46 states. [2022-02-20 17:03:17,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:03:17,991 INFO L93 Difference]: Finished difference Result 46 states and 62 transitions. [2022-02-20 17:03:17,991 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 62 transitions. [2022-02-20 17:03:17,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:03:17,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:03:17,991 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:03:17,991 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:03:17,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:03:17,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2022-02-20 17:03:17,993 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 15 [2022-02-20 17:03:17,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:03:17,993 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2022-02-20 17:03:17,993 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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:03:17,993 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2022-02-20 17:03:17,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 17:03:17,993 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:03:17,993 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:03:17,994 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 17:03:17,994 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:03:17,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:03:17,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1700663812, now seen corresponding path program 1 times [2022-02-20 17:03:17,994 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:03:17,994 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420861126] [2022-02-20 17:03:17,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:03:17,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:03:18,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:03:18,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-20 17:03:18,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:03:18,046 INFO L290 TraceCheckUtils]: 0: Hoare triple {774#true} ~cond := #in~cond; {774#true} is VALID [2022-02-20 17:03:18,046 INFO L290 TraceCheckUtils]: 1: Hoare triple {774#true} assume !(0 == ~cond); {774#true} is VALID [2022-02-20 17:03:18,046 INFO L290 TraceCheckUtils]: 2: Hoare triple {774#true} assume true; {774#true} is VALID [2022-02-20 17:03:18,047 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {774#true} {777#(and (<= 0 |ULTIMATE.start_main_~tagbuf_len~0#1|) (= |ULTIMATE.start_main_~t~0#1| 0))} #116#return; {777#(and (<= 0 |ULTIMATE.start_main_~tagbuf_len~0#1|) (= |ULTIMATE.start_main_~t~0#1| 0))} is VALID [2022-02-20 17:03:18,047 INFO L290 TraceCheckUtils]: 0: Hoare triple {774#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); {774#true} is VALID [2022-02-20 17:03:18,047 INFO L290 TraceCheckUtils]: 1: Hoare triple {774#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~pre2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~post8#1, main_#t~nondet9#1, main_#t~post10#1, main_~tagbuf_len~0#1, main_~t~0#1;havoc main_~tagbuf_len~0#1;havoc main_~t~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~tagbuf_len~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {774#true} is VALID [2022-02-20 17:03:18,047 INFO L290 TraceCheckUtils]: 2: Hoare triple {774#true} assume main_~tagbuf_len~0#1 >= 1; {776#(<= 1 |ULTIMATE.start_main_~tagbuf_len~0#1|)} is VALID [2022-02-20 17:03:18,048 INFO L290 TraceCheckUtils]: 3: Hoare triple {776#(<= 1 |ULTIMATE.start_main_~tagbuf_len~0#1|)} main_~t~0#1 := 0;main_#t~pre2#1 := main_~tagbuf_len~0#1 - 1;main_~tagbuf_len~0#1 := main_~tagbuf_len~0#1 - 1;havoc main_#t~pre2#1; {777#(and (<= 0 |ULTIMATE.start_main_~tagbuf_len~0#1|) (= |ULTIMATE.start_main_~t~0#1| 0))} is VALID [2022-02-20 17:03:18,048 INFO L290 TraceCheckUtils]: 4: Hoare triple {777#(and (<= 0 |ULTIMATE.start_main_~tagbuf_len~0#1|) (= |ULTIMATE.start_main_~t~0#1| 0))} assume !false; {777#(and (<= 0 |ULTIMATE.start_main_~tagbuf_len~0#1|) (= |ULTIMATE.start_main_~t~0#1| 0))} is VALID [2022-02-20 17:03:18,049 INFO L290 TraceCheckUtils]: 5: Hoare triple {777#(and (<= 0 |ULTIMATE.start_main_~tagbuf_len~0#1|) (= |ULTIMATE.start_main_~t~0#1| 0))} assume !(main_~t~0#1 == main_~tagbuf_len~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {777#(and (<= 0 |ULTIMATE.start_main_~tagbuf_len~0#1|) (= |ULTIMATE.start_main_~t~0#1| 0))} is VALID [2022-02-20 17:03:18,049 INFO L290 TraceCheckUtils]: 6: Hoare triple {777#(and (<= 0 |ULTIMATE.start_main_~tagbuf_len~0#1|) (= |ULTIMATE.start_main_~t~0#1| 0))} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {777#(and (<= 0 |ULTIMATE.start_main_~tagbuf_len~0#1|) (= |ULTIMATE.start_main_~t~0#1| 0))} is VALID [2022-02-20 17:03:18,049 INFO L272 TraceCheckUtils]: 7: Hoare triple {777#(and (<= 0 |ULTIMATE.start_main_~tagbuf_len~0#1|) (= |ULTIMATE.start_main_~t~0#1| 0))} call __VERIFIER_assert((if 0 <= main_~t~0#1 then 1 else 0)); {774#true} is VALID [2022-02-20 17:03:18,050 INFO L290 TraceCheckUtils]: 8: Hoare triple {774#true} ~cond := #in~cond; {774#true} is VALID [2022-02-20 17:03:18,050 INFO L290 TraceCheckUtils]: 9: Hoare triple {774#true} assume !(0 == ~cond); {774#true} is VALID [2022-02-20 17:03:18,050 INFO L290 TraceCheckUtils]: 10: Hoare triple {774#true} assume true; {774#true} is VALID [2022-02-20 17:03:18,050 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {774#true} {777#(and (<= 0 |ULTIMATE.start_main_~tagbuf_len~0#1|) (= |ULTIMATE.start_main_~t~0#1| 0))} #116#return; {777#(and (<= 0 |ULTIMATE.start_main_~tagbuf_len~0#1|) (= |ULTIMATE.start_main_~t~0#1| 0))} is VALID [2022-02-20 17:03:18,051 INFO L272 TraceCheckUtils]: 12: Hoare triple {777#(and (<= 0 |ULTIMATE.start_main_~tagbuf_len~0#1|) (= |ULTIMATE.start_main_~t~0#1| 0))} call __VERIFIER_assert((if main_~t~0#1 <= main_~tagbuf_len~0#1 then 1 else 0)); {782#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:03:18,051 INFO L290 TraceCheckUtils]: 13: Hoare triple {782#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {783#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:03:18,051 INFO L290 TraceCheckUtils]: 14: Hoare triple {783#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {775#false} is VALID [2022-02-20 17:03:18,052 INFO L290 TraceCheckUtils]: 15: Hoare triple {775#false} assume !false; {775#false} is VALID [2022-02-20 17:03:18,052 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:03:18,052 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:03:18,052 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420861126] [2022-02-20 17:03:18,052 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420861126] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:03:18,052 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:03:18,052 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 17:03:18,052 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820578459] [2022-02-20 17:03:18,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:03:18,053 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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 16 [2022-02-20 17:03:18,053 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:03:18,053 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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:03:18,063 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:03:18,063 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 17:03:18,063 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:03:18,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 17:03:18,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:03:18,064 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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:03:18,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:03:18,310 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2022-02-20 17:03:18,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 17:03:18,311 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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 16 [2022-02-20 17:03:18,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:03:18,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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:03:18,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 64 transitions. [2022-02-20 17:03:18,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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:03:18,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 64 transitions. [2022-02-20 17:03:18,313 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 64 transitions. [2022-02-20 17:03:18,367 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:03:18,368 INFO L225 Difference]: With dead ends: 56 [2022-02-20 17:03:18,368 INFO L226 Difference]: Without dead ends: 54 [2022-02-20 17:03:18,369 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:03:18,369 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 26 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:03:18,370 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 142 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:03:18,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-02-20 17:03:18,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2022-02-20 17:03:18,392 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:03:18,393 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 52 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 36 states have internal predecessors, (39), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (13), 11 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 17:03:18,393 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 52 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 36 states have internal predecessors, (39), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (13), 11 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 17:03:18,393 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 52 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 36 states have internal predecessors, (39), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (13), 11 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 17:03:18,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:03:18,395 INFO L93 Difference]: Finished difference Result 54 states and 68 transitions. [2022-02-20 17:03:18,395 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 68 transitions. [2022-02-20 17:03:18,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:03:18,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:03:18,395 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 36 states have internal predecessors, (39), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (13), 11 states have call predecessors, (13), 13 states have call successors, (13) Second operand 54 states. [2022-02-20 17:03:18,396 INFO L87 Difference]: Start difference. First operand has 52 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 36 states have internal predecessors, (39), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (13), 11 states have call predecessors, (13), 13 states have call successors, (13) Second operand 54 states. [2022-02-20 17:03:18,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:03:18,398 INFO L93 Difference]: Finished difference Result 54 states and 68 transitions. [2022-02-20 17:03:18,398 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 68 transitions. [2022-02-20 17:03:18,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:03:18,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:03:18,398 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:03:18,398 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:03:18,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 36 states have internal predecessors, (39), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (13), 11 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 17:03:18,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 66 transitions. [2022-02-20 17:03:18,400 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 66 transitions. Word has length 16 [2022-02-20 17:03:18,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:03:18,400 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 66 transitions. [2022-02-20 17:03:18,400 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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:03:18,400 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-02-20 17:03:18,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 17:03:18,401 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:03:18,401 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:03:18,401 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 17:03:18,401 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:03:18,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:03:18,402 INFO L85 PathProgramCache]: Analyzing trace with hash 367468842, now seen corresponding path program 1 times [2022-02-20 17:03:18,402 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:03:18,402 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030650865] [2022-02-20 17:03:18,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:03:18,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:03:18,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:03:18,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-20 17:03:18,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:03:18,506 INFO L290 TraceCheckUtils]: 0: Hoare triple {1048#true} ~cond := #in~cond; {1048#true} is VALID [2022-02-20 17:03:18,506 INFO L290 TraceCheckUtils]: 1: Hoare triple {1048#true} assume !(0 == ~cond); {1048#true} is VALID [2022-02-20 17:03:18,506 INFO L290 TraceCheckUtils]: 2: Hoare triple {1048#true} assume true; {1048#true} is VALID [2022-02-20 17:03:18,520 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1048#true} {1052#(and (< 0 (+ |ULTIMATE.start_main_~tagbuf_len~0#1| 1)) (not (= |ULTIMATE.start_main_~tagbuf_len~0#1| 0)) (= |ULTIMATE.start_main_~t~0#1| 0))} #112#return; {1052#(and (< 0 (+ |ULTIMATE.start_main_~tagbuf_len~0#1| 1)) (not (= |ULTIMATE.start_main_~tagbuf_len~0#1| 0)) (= |ULTIMATE.start_main_~t~0#1| 0))} is VALID [2022-02-20 17:03:18,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 17:03:18,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:03:18,526 INFO L290 TraceCheckUtils]: 0: Hoare triple {1048#true} ~cond := #in~cond; {1048#true} is VALID [2022-02-20 17:03:18,527 INFO L290 TraceCheckUtils]: 1: Hoare triple {1048#true} assume !(0 == ~cond); {1048#true} is VALID [2022-02-20 17:03:18,527 INFO L290 TraceCheckUtils]: 2: Hoare triple {1048#true} assume true; {1048#true} is VALID [2022-02-20 17:03:18,527 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1048#true} {1052#(and (< 0 (+ |ULTIMATE.start_main_~tagbuf_len~0#1| 1)) (not (= |ULTIMATE.start_main_~tagbuf_len~0#1| 0)) (= |ULTIMATE.start_main_~t~0#1| 0))} #114#return; {1052#(and (< 0 (+ |ULTIMATE.start_main_~tagbuf_len~0#1| 1)) (not (= |ULTIMATE.start_main_~tagbuf_len~0#1| 0)) (= |ULTIMATE.start_main_~t~0#1| 0))} is VALID [2022-02-20 17:03:18,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-20 17:03:18,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:03:18,532 INFO L290 TraceCheckUtils]: 0: Hoare triple {1048#true} ~cond := #in~cond; {1048#true} is VALID [2022-02-20 17:03:18,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {1048#true} assume !(0 == ~cond); {1048#true} is VALID [2022-02-20 17:03:18,532 INFO L290 TraceCheckUtils]: 2: Hoare triple {1048#true} assume true; {1048#true} is VALID [2022-02-20 17:03:18,532 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1048#true} {1061#(and (< 0 (+ |ULTIMATE.start_main_~tagbuf_len~0#1| 1)) (<= |ULTIMATE.start_main_~t~0#1| 1) (not (= |ULTIMATE.start_main_~tagbuf_len~0#1| 0)))} #116#return; {1061#(and (< 0 (+ |ULTIMATE.start_main_~tagbuf_len~0#1| 1)) (<= |ULTIMATE.start_main_~t~0#1| 1) (not (= |ULTIMATE.start_main_~tagbuf_len~0#1| 0)))} is VALID [2022-02-20 17:03:18,533 INFO L290 TraceCheckUtils]: 0: Hoare triple {1048#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); {1048#true} is VALID [2022-02-20 17:03:18,533 INFO L290 TraceCheckUtils]: 1: Hoare triple {1048#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~pre2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~post8#1, main_#t~nondet9#1, main_#t~post10#1, main_~tagbuf_len~0#1, main_~t~0#1;havoc main_~tagbuf_len~0#1;havoc main_~t~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~tagbuf_len~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {1048#true} is VALID [2022-02-20 17:03:18,533 INFO L290 TraceCheckUtils]: 2: Hoare triple {1048#true} assume main_~tagbuf_len~0#1 >= 1; {1050#(<= 1 |ULTIMATE.start_main_~tagbuf_len~0#1|)} is VALID [2022-02-20 17:03:18,533 INFO L290 TraceCheckUtils]: 3: Hoare triple {1050#(<= 1 |ULTIMATE.start_main_~tagbuf_len~0#1|)} main_~t~0#1 := 0;main_#t~pre2#1 := main_~tagbuf_len~0#1 - 1;main_~tagbuf_len~0#1 := main_~tagbuf_len~0#1 - 1;havoc main_#t~pre2#1; {1051#(and (< 0 (+ |ULTIMATE.start_main_~tagbuf_len~0#1| 1)) (= |ULTIMATE.start_main_~t~0#1| 0))} is VALID [2022-02-20 17:03:18,534 INFO L290 TraceCheckUtils]: 4: Hoare triple {1051#(and (< 0 (+ |ULTIMATE.start_main_~tagbuf_len~0#1| 1)) (= |ULTIMATE.start_main_~t~0#1| 0))} assume !false; {1051#(and (< 0 (+ |ULTIMATE.start_main_~tagbuf_len~0#1| 1)) (= |ULTIMATE.start_main_~t~0#1| 0))} is VALID [2022-02-20 17:03:18,534 INFO L290 TraceCheckUtils]: 5: Hoare triple {1051#(and (< 0 (+ |ULTIMATE.start_main_~tagbuf_len~0#1| 1)) (= |ULTIMATE.start_main_~t~0#1| 0))} assume !(main_~t~0#1 == main_~tagbuf_len~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {1052#(and (< 0 (+ |ULTIMATE.start_main_~tagbuf_len~0#1| 1)) (not (= |ULTIMATE.start_main_~tagbuf_len~0#1| 0)) (= |ULTIMATE.start_main_~t~0#1| 0))} is VALID [2022-02-20 17:03:18,535 INFO L290 TraceCheckUtils]: 6: Hoare triple {1052#(and (< 0 (+ |ULTIMATE.start_main_~tagbuf_len~0#1| 1)) (not (= |ULTIMATE.start_main_~tagbuf_len~0#1| 0)) (= |ULTIMATE.start_main_~t~0#1| 0))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {1052#(and (< 0 (+ |ULTIMATE.start_main_~tagbuf_len~0#1| 1)) (not (= |ULTIMATE.start_main_~tagbuf_len~0#1| 0)) (= |ULTIMATE.start_main_~t~0#1| 0))} is VALID [2022-02-20 17:03:18,535 INFO L272 TraceCheckUtils]: 7: Hoare triple {1052#(and (< 0 (+ |ULTIMATE.start_main_~tagbuf_len~0#1| 1)) (not (= |ULTIMATE.start_main_~tagbuf_len~0#1| 0)) (= |ULTIMATE.start_main_~t~0#1| 0))} call __VERIFIER_assert((if 0 <= main_~t~0#1 then 1 else 0)); {1048#true} is VALID [2022-02-20 17:03:18,535 INFO L290 TraceCheckUtils]: 8: Hoare triple {1048#true} ~cond := #in~cond; {1048#true} is VALID [2022-02-20 17:03:18,535 INFO L290 TraceCheckUtils]: 9: Hoare triple {1048#true} assume !(0 == ~cond); {1048#true} is VALID [2022-02-20 17:03:18,535 INFO L290 TraceCheckUtils]: 10: Hoare triple {1048#true} assume true; {1048#true} is VALID [2022-02-20 17:03:18,536 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1048#true} {1052#(and (< 0 (+ |ULTIMATE.start_main_~tagbuf_len~0#1| 1)) (not (= |ULTIMATE.start_main_~tagbuf_len~0#1| 0)) (= |ULTIMATE.start_main_~t~0#1| 0))} #112#return; {1052#(and (< 0 (+ |ULTIMATE.start_main_~tagbuf_len~0#1| 1)) (not (= |ULTIMATE.start_main_~tagbuf_len~0#1| 0)) (= |ULTIMATE.start_main_~t~0#1| 0))} is VALID [2022-02-20 17:03:18,536 INFO L272 TraceCheckUtils]: 12: Hoare triple {1052#(and (< 0 (+ |ULTIMATE.start_main_~tagbuf_len~0#1| 1)) (not (= |ULTIMATE.start_main_~tagbuf_len~0#1| 0)) (= |ULTIMATE.start_main_~t~0#1| 0))} call __VERIFIER_assert((if main_~t~0#1 <= main_~tagbuf_len~0#1 then 1 else 0)); {1048#true} is VALID [2022-02-20 17:03:18,536 INFO L290 TraceCheckUtils]: 13: Hoare triple {1048#true} ~cond := #in~cond; {1048#true} is VALID [2022-02-20 17:03:18,536 INFO L290 TraceCheckUtils]: 14: Hoare triple {1048#true} assume !(0 == ~cond); {1048#true} is VALID [2022-02-20 17:03:18,536 INFO L290 TraceCheckUtils]: 15: Hoare triple {1048#true} assume true; {1048#true} is VALID [2022-02-20 17:03:18,536 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1048#true} {1052#(and (< 0 (+ |ULTIMATE.start_main_~tagbuf_len~0#1| 1)) (not (= |ULTIMATE.start_main_~tagbuf_len~0#1| 0)) (= |ULTIMATE.start_main_~t~0#1| 0))} #114#return; {1052#(and (< 0 (+ |ULTIMATE.start_main_~tagbuf_len~0#1| 1)) (not (= |ULTIMATE.start_main_~tagbuf_len~0#1| 0)) (= |ULTIMATE.start_main_~t~0#1| 0))} is VALID [2022-02-20 17:03:18,537 INFO L290 TraceCheckUtils]: 17: Hoare triple {1052#(and (< 0 (+ |ULTIMATE.start_main_~tagbuf_len~0#1| 1)) (not (= |ULTIMATE.start_main_~tagbuf_len~0#1| 0)) (= |ULTIMATE.start_main_~t~0#1| 0))} main_#t~post4#1 := main_~t~0#1;main_~t~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1061#(and (< 0 (+ |ULTIMATE.start_main_~tagbuf_len~0#1| 1)) (<= |ULTIMATE.start_main_~t~0#1| 1) (not (= |ULTIMATE.start_main_~tagbuf_len~0#1| 0)))} is VALID [2022-02-20 17:03:18,537 INFO L290 TraceCheckUtils]: 18: Hoare triple {1061#(and (< 0 (+ |ULTIMATE.start_main_~tagbuf_len~0#1| 1)) (<= |ULTIMATE.start_main_~t~0#1| 1) (not (= |ULTIMATE.start_main_~tagbuf_len~0#1| 0)))} assume !false; {1061#(and (< 0 (+ |ULTIMATE.start_main_~tagbuf_len~0#1| 1)) (<= |ULTIMATE.start_main_~t~0#1| 1) (not (= |ULTIMATE.start_main_~tagbuf_len~0#1| 0)))} is VALID [2022-02-20 17:03:18,538 INFO L290 TraceCheckUtils]: 19: Hoare triple {1061#(and (< 0 (+ |ULTIMATE.start_main_~tagbuf_len~0#1| 1)) (<= |ULTIMATE.start_main_~t~0#1| 1) (not (= |ULTIMATE.start_main_~tagbuf_len~0#1| 0)))} assume !(main_~t~0#1 == main_~tagbuf_len~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {1061#(and (< 0 (+ |ULTIMATE.start_main_~tagbuf_len~0#1| 1)) (<= |ULTIMATE.start_main_~t~0#1| 1) (not (= |ULTIMATE.start_main_~tagbuf_len~0#1| 0)))} is VALID [2022-02-20 17:03:18,538 INFO L290 TraceCheckUtils]: 20: Hoare triple {1061#(and (< 0 (+ |ULTIMATE.start_main_~tagbuf_len~0#1| 1)) (<= |ULTIMATE.start_main_~t~0#1| 1) (not (= |ULTIMATE.start_main_~tagbuf_len~0#1| 0)))} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {1061#(and (< 0 (+ |ULTIMATE.start_main_~tagbuf_len~0#1| 1)) (<= |ULTIMATE.start_main_~t~0#1| 1) (not (= |ULTIMATE.start_main_~tagbuf_len~0#1| 0)))} is VALID [2022-02-20 17:03:18,538 INFO L272 TraceCheckUtils]: 21: Hoare triple {1061#(and (< 0 (+ |ULTIMATE.start_main_~tagbuf_len~0#1| 1)) (<= |ULTIMATE.start_main_~t~0#1| 1) (not (= |ULTIMATE.start_main_~tagbuf_len~0#1| 0)))} call __VERIFIER_assert((if 0 <= main_~t~0#1 then 1 else 0)); {1048#true} is VALID [2022-02-20 17:03:18,538 INFO L290 TraceCheckUtils]: 22: Hoare triple {1048#true} ~cond := #in~cond; {1048#true} is VALID [2022-02-20 17:03:18,538 INFO L290 TraceCheckUtils]: 23: Hoare triple {1048#true} assume !(0 == ~cond); {1048#true} is VALID [2022-02-20 17:03:18,539 INFO L290 TraceCheckUtils]: 24: Hoare triple {1048#true} assume true; {1048#true} is VALID [2022-02-20 17:03:18,539 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {1048#true} {1061#(and (< 0 (+ |ULTIMATE.start_main_~tagbuf_len~0#1| 1)) (<= |ULTIMATE.start_main_~t~0#1| 1) (not (= |ULTIMATE.start_main_~tagbuf_len~0#1| 0)))} #116#return; {1061#(and (< 0 (+ |ULTIMATE.start_main_~tagbuf_len~0#1| 1)) (<= |ULTIMATE.start_main_~t~0#1| 1) (not (= |ULTIMATE.start_main_~tagbuf_len~0#1| 0)))} is VALID [2022-02-20 17:03:18,540 INFO L272 TraceCheckUtils]: 26: Hoare triple {1061#(and (< 0 (+ |ULTIMATE.start_main_~tagbuf_len~0#1| 1)) (<= |ULTIMATE.start_main_~t~0#1| 1) (not (= |ULTIMATE.start_main_~tagbuf_len~0#1| 0)))} call __VERIFIER_assert((if main_~t~0#1 <= main_~tagbuf_len~0#1 then 1 else 0)); {1066#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:03:18,540 INFO L290 TraceCheckUtils]: 27: Hoare triple {1066#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1067#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:03:18,540 INFO L290 TraceCheckUtils]: 28: Hoare triple {1067#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1049#false} is VALID [2022-02-20 17:03:18,540 INFO L290 TraceCheckUtils]: 29: Hoare triple {1049#false} assume !false; {1049#false} is VALID [2022-02-20 17:03:18,541 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:03:18,541 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:03:18,541 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030650865] [2022-02-20 17:03:18,541 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030650865] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:03:18,541 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [344985158] [2022-02-20 17:03:18,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:03:18,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:03:18,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:03:18,543 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:03:18,548 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:03:18,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:03:18,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 17:03:18,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:03:18,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:03:19,050 INFO L290 TraceCheckUtils]: 0: Hoare triple {1048#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); {1048#true} is VALID [2022-02-20 17:03:19,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {1048#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~pre2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~post8#1, main_#t~nondet9#1, main_#t~post10#1, main_~tagbuf_len~0#1, main_~t~0#1;havoc main_~tagbuf_len~0#1;havoc main_~t~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~tagbuf_len~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {1048#true} is VALID [2022-02-20 17:03:19,051 INFO L290 TraceCheckUtils]: 2: Hoare triple {1048#true} assume main_~tagbuf_len~0#1 >= 1; {1050#(<= 1 |ULTIMATE.start_main_~tagbuf_len~0#1|)} is VALID [2022-02-20 17:03:19,051 INFO L290 TraceCheckUtils]: 3: Hoare triple {1050#(<= 1 |ULTIMATE.start_main_~tagbuf_len~0#1|)} main_~t~0#1 := 0;main_#t~pre2#1 := main_~tagbuf_len~0#1 - 1;main_~tagbuf_len~0#1 := main_~tagbuf_len~0#1 - 1;havoc main_#t~pre2#1; {1080#(and (<= 0 |ULTIMATE.start_main_~tagbuf_len~0#1|) (<= |ULTIMATE.start_main_~t~0#1| 0))} is VALID [2022-02-20 17:03:19,052 INFO L290 TraceCheckUtils]: 4: Hoare triple {1080#(and (<= 0 |ULTIMATE.start_main_~tagbuf_len~0#1|) (<= |ULTIMATE.start_main_~t~0#1| 0))} assume !false; {1080#(and (<= 0 |ULTIMATE.start_main_~tagbuf_len~0#1|) (<= |ULTIMATE.start_main_~t~0#1| 0))} is VALID [2022-02-20 17:03:19,052 INFO L290 TraceCheckUtils]: 5: Hoare triple {1080#(and (<= 0 |ULTIMATE.start_main_~tagbuf_len~0#1|) (<= |ULTIMATE.start_main_~t~0#1| 0))} assume !(main_~t~0#1 == main_~tagbuf_len~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {1087#(and (<= 0 |ULTIMATE.start_main_~tagbuf_len~0#1|) (<= |ULTIMATE.start_main_~t~0#1| 0) (not (= |ULTIMATE.start_main_~t~0#1| |ULTIMATE.start_main_~tagbuf_len~0#1|)))} is VALID [2022-02-20 17:03:19,052 INFO L290 TraceCheckUtils]: 6: Hoare triple {1087#(and (<= 0 |ULTIMATE.start_main_~tagbuf_len~0#1|) (<= |ULTIMATE.start_main_~t~0#1| 0) (not (= |ULTIMATE.start_main_~t~0#1| |ULTIMATE.start_main_~tagbuf_len~0#1|)))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {1087#(and (<= 0 |ULTIMATE.start_main_~tagbuf_len~0#1|) (<= |ULTIMATE.start_main_~t~0#1| 0) (not (= |ULTIMATE.start_main_~t~0#1| |ULTIMATE.start_main_~tagbuf_len~0#1|)))} is VALID [2022-02-20 17:03:19,053 INFO L272 TraceCheckUtils]: 7: Hoare triple {1087#(and (<= 0 |ULTIMATE.start_main_~tagbuf_len~0#1|) (<= |ULTIMATE.start_main_~t~0#1| 0) (not (= |ULTIMATE.start_main_~t~0#1| |ULTIMATE.start_main_~tagbuf_len~0#1|)))} call __VERIFIER_assert((if 0 <= main_~t~0#1 then 1 else 0)); {1048#true} is VALID [2022-02-20 17:03:19,053 INFO L290 TraceCheckUtils]: 8: Hoare triple {1048#true} ~cond := #in~cond; {1048#true} is VALID [2022-02-20 17:03:19,053 INFO L290 TraceCheckUtils]: 9: Hoare triple {1048#true} assume !(0 == ~cond); {1048#true} is VALID [2022-02-20 17:03:19,053 INFO L290 TraceCheckUtils]: 10: Hoare triple {1048#true} assume true; {1048#true} is VALID [2022-02-20 17:03:19,053 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1048#true} {1087#(and (<= 0 |ULTIMATE.start_main_~tagbuf_len~0#1|) (<= |ULTIMATE.start_main_~t~0#1| 0) (not (= |ULTIMATE.start_main_~t~0#1| |ULTIMATE.start_main_~tagbuf_len~0#1|)))} #112#return; {1087#(and (<= 0 |ULTIMATE.start_main_~tagbuf_len~0#1|) (<= |ULTIMATE.start_main_~t~0#1| 0) (not (= |ULTIMATE.start_main_~t~0#1| |ULTIMATE.start_main_~tagbuf_len~0#1|)))} is VALID [2022-02-20 17:03:19,053 INFO L272 TraceCheckUtils]: 12: Hoare triple {1087#(and (<= 0 |ULTIMATE.start_main_~tagbuf_len~0#1|) (<= |ULTIMATE.start_main_~t~0#1| 0) (not (= |ULTIMATE.start_main_~t~0#1| |ULTIMATE.start_main_~tagbuf_len~0#1|)))} call __VERIFIER_assert((if main_~t~0#1 <= main_~tagbuf_len~0#1 then 1 else 0)); {1048#true} is VALID [2022-02-20 17:03:19,054 INFO L290 TraceCheckUtils]: 13: Hoare triple {1048#true} ~cond := #in~cond; {1048#true} is VALID [2022-02-20 17:03:19,054 INFO L290 TraceCheckUtils]: 14: Hoare triple {1048#true} assume !(0 == ~cond); {1048#true} is VALID [2022-02-20 17:03:19,054 INFO L290 TraceCheckUtils]: 15: Hoare triple {1048#true} assume true; {1048#true} is VALID [2022-02-20 17:03:19,054 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1048#true} {1087#(and (<= 0 |ULTIMATE.start_main_~tagbuf_len~0#1|) (<= |ULTIMATE.start_main_~t~0#1| 0) (not (= |ULTIMATE.start_main_~t~0#1| |ULTIMATE.start_main_~tagbuf_len~0#1|)))} #114#return; {1087#(and (<= 0 |ULTIMATE.start_main_~tagbuf_len~0#1|) (<= |ULTIMATE.start_main_~t~0#1| 0) (not (= |ULTIMATE.start_main_~t~0#1| |ULTIMATE.start_main_~tagbuf_len~0#1|)))} is VALID [2022-02-20 17:03:19,055 INFO L290 TraceCheckUtils]: 17: Hoare triple {1087#(and (<= 0 |ULTIMATE.start_main_~tagbuf_len~0#1|) (<= |ULTIMATE.start_main_~t~0#1| 0) (not (= |ULTIMATE.start_main_~t~0#1| |ULTIMATE.start_main_~tagbuf_len~0#1|)))} main_#t~post4#1 := main_~t~0#1;main_~t~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1124#(and (< |ULTIMATE.start_main_~t~0#1| (+ |ULTIMATE.start_main_~tagbuf_len~0#1| 1)) (<= 0 |ULTIMATE.start_main_~tagbuf_len~0#1|) (<= |ULTIMATE.start_main_~t~0#1| 1))} is VALID [2022-02-20 17:03:19,055 INFO L290 TraceCheckUtils]: 18: Hoare triple {1124#(and (< |ULTIMATE.start_main_~t~0#1| (+ |ULTIMATE.start_main_~tagbuf_len~0#1| 1)) (<= 0 |ULTIMATE.start_main_~tagbuf_len~0#1|) (<= |ULTIMATE.start_main_~t~0#1| 1))} assume !false; {1124#(and (< |ULTIMATE.start_main_~t~0#1| (+ |ULTIMATE.start_main_~tagbuf_len~0#1| 1)) (<= 0 |ULTIMATE.start_main_~tagbuf_len~0#1|) (<= |ULTIMATE.start_main_~t~0#1| 1))} is VALID [2022-02-20 17:03:19,056 INFO L290 TraceCheckUtils]: 19: Hoare triple {1124#(and (< |ULTIMATE.start_main_~t~0#1| (+ |ULTIMATE.start_main_~tagbuf_len~0#1| 1)) (<= 0 |ULTIMATE.start_main_~tagbuf_len~0#1|) (<= |ULTIMATE.start_main_~t~0#1| 1))} assume !(main_~t~0#1 == main_~tagbuf_len~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {1124#(and (< |ULTIMATE.start_main_~t~0#1| (+ |ULTIMATE.start_main_~tagbuf_len~0#1| 1)) (<= 0 |ULTIMATE.start_main_~tagbuf_len~0#1|) (<= |ULTIMATE.start_main_~t~0#1| 1))} is VALID [2022-02-20 17:03:19,056 INFO L290 TraceCheckUtils]: 20: Hoare triple {1124#(and (< |ULTIMATE.start_main_~t~0#1| (+ |ULTIMATE.start_main_~tagbuf_len~0#1| 1)) (<= 0 |ULTIMATE.start_main_~tagbuf_len~0#1|) (<= |ULTIMATE.start_main_~t~0#1| 1))} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {1124#(and (< |ULTIMATE.start_main_~t~0#1| (+ |ULTIMATE.start_main_~tagbuf_len~0#1| 1)) (<= 0 |ULTIMATE.start_main_~tagbuf_len~0#1|) (<= |ULTIMATE.start_main_~t~0#1| 1))} is VALID [2022-02-20 17:03:19,056 INFO L272 TraceCheckUtils]: 21: Hoare triple {1124#(and (< |ULTIMATE.start_main_~t~0#1| (+ |ULTIMATE.start_main_~tagbuf_len~0#1| 1)) (<= 0 |ULTIMATE.start_main_~tagbuf_len~0#1|) (<= |ULTIMATE.start_main_~t~0#1| 1))} call __VERIFIER_assert((if 0 <= main_~t~0#1 then 1 else 0)); {1048#true} is VALID [2022-02-20 17:03:19,056 INFO L290 TraceCheckUtils]: 22: Hoare triple {1048#true} ~cond := #in~cond; {1048#true} is VALID [2022-02-20 17:03:19,056 INFO L290 TraceCheckUtils]: 23: Hoare triple {1048#true} assume !(0 == ~cond); {1048#true} is VALID [2022-02-20 17:03:19,056 INFO L290 TraceCheckUtils]: 24: Hoare triple {1048#true} assume true; {1048#true} is VALID [2022-02-20 17:03:19,057 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {1048#true} {1124#(and (< |ULTIMATE.start_main_~t~0#1| (+ |ULTIMATE.start_main_~tagbuf_len~0#1| 1)) (<= 0 |ULTIMATE.start_main_~tagbuf_len~0#1|) (<= |ULTIMATE.start_main_~t~0#1| 1))} #116#return; {1124#(and (< |ULTIMATE.start_main_~t~0#1| (+ |ULTIMATE.start_main_~tagbuf_len~0#1| 1)) (<= 0 |ULTIMATE.start_main_~tagbuf_len~0#1|) (<= |ULTIMATE.start_main_~t~0#1| 1))} is VALID [2022-02-20 17:03:19,057 INFO L272 TraceCheckUtils]: 26: Hoare triple {1124#(and (< |ULTIMATE.start_main_~t~0#1| (+ |ULTIMATE.start_main_~tagbuf_len~0#1| 1)) (<= 0 |ULTIMATE.start_main_~tagbuf_len~0#1|) (<= |ULTIMATE.start_main_~t~0#1| 1))} call __VERIFIER_assert((if main_~t~0#1 <= main_~tagbuf_len~0#1 then 1 else 0)); {1152#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:03:19,058 INFO L290 TraceCheckUtils]: 27: Hoare triple {1152#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1156#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:03:19,058 INFO L290 TraceCheckUtils]: 28: Hoare triple {1156#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1049#false} is VALID [2022-02-20 17:03:19,058 INFO L290 TraceCheckUtils]: 29: Hoare triple {1049#false} assume !false; {1049#false} is VALID [2022-02-20 17:03:19,058 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:03:19,059 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:03:19,226 INFO L290 TraceCheckUtils]: 29: Hoare triple {1049#false} assume !false; {1049#false} is VALID [2022-02-20 17:03:19,227 INFO L290 TraceCheckUtils]: 28: Hoare triple {1156#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1049#false} is VALID [2022-02-20 17:03:19,227 INFO L290 TraceCheckUtils]: 27: Hoare triple {1152#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1156#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:03:19,228 INFO L272 TraceCheckUtils]: 26: Hoare triple {1172#(<= |ULTIMATE.start_main_~t~0#1| |ULTIMATE.start_main_~tagbuf_len~0#1|)} call __VERIFIER_assert((if main_~t~0#1 <= main_~tagbuf_len~0#1 then 1 else 0)); {1152#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:03:19,228 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {1048#true} {1172#(<= |ULTIMATE.start_main_~t~0#1| |ULTIMATE.start_main_~tagbuf_len~0#1|)} #116#return; {1172#(<= |ULTIMATE.start_main_~t~0#1| |ULTIMATE.start_main_~tagbuf_len~0#1|)} is VALID [2022-02-20 17:03:19,228 INFO L290 TraceCheckUtils]: 24: Hoare triple {1048#true} assume true; {1048#true} is VALID [2022-02-20 17:03:19,228 INFO L290 TraceCheckUtils]: 23: Hoare triple {1048#true} assume !(0 == ~cond); {1048#true} is VALID [2022-02-20 17:03:19,228 INFO L290 TraceCheckUtils]: 22: Hoare triple {1048#true} ~cond := #in~cond; {1048#true} is VALID [2022-02-20 17:03:19,228 INFO L272 TraceCheckUtils]: 21: Hoare triple {1172#(<= |ULTIMATE.start_main_~t~0#1| |ULTIMATE.start_main_~tagbuf_len~0#1|)} call __VERIFIER_assert((if 0 <= main_~t~0#1 then 1 else 0)); {1048#true} is VALID [2022-02-20 17:03:19,229 INFO L290 TraceCheckUtils]: 20: Hoare triple {1172#(<= |ULTIMATE.start_main_~t~0#1| |ULTIMATE.start_main_~tagbuf_len~0#1|)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {1172#(<= |ULTIMATE.start_main_~t~0#1| |ULTIMATE.start_main_~tagbuf_len~0#1|)} is VALID [2022-02-20 17:03:19,229 INFO L290 TraceCheckUtils]: 19: Hoare triple {1172#(<= |ULTIMATE.start_main_~t~0#1| |ULTIMATE.start_main_~tagbuf_len~0#1|)} assume !(main_~t~0#1 == main_~tagbuf_len~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {1172#(<= |ULTIMATE.start_main_~t~0#1| |ULTIMATE.start_main_~tagbuf_len~0#1|)} is VALID [2022-02-20 17:03:19,229 INFO L290 TraceCheckUtils]: 18: Hoare triple {1172#(<= |ULTIMATE.start_main_~t~0#1| |ULTIMATE.start_main_~tagbuf_len~0#1|)} assume !false; {1172#(<= |ULTIMATE.start_main_~t~0#1| |ULTIMATE.start_main_~tagbuf_len~0#1|)} is VALID [2022-02-20 17:03:19,230 INFO L290 TraceCheckUtils]: 17: Hoare triple {1200#(<= (+ |ULTIMATE.start_main_~t~0#1| 1) |ULTIMATE.start_main_~tagbuf_len~0#1|)} main_#t~post4#1 := main_~t~0#1;main_~t~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1172#(<= |ULTIMATE.start_main_~t~0#1| |ULTIMATE.start_main_~tagbuf_len~0#1|)} is VALID [2022-02-20 17:03:19,230 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1048#true} {1200#(<= (+ |ULTIMATE.start_main_~t~0#1| 1) |ULTIMATE.start_main_~tagbuf_len~0#1|)} #114#return; {1200#(<= (+ |ULTIMATE.start_main_~t~0#1| 1) |ULTIMATE.start_main_~tagbuf_len~0#1|)} is VALID [2022-02-20 17:03:19,230 INFO L290 TraceCheckUtils]: 15: Hoare triple {1048#true} assume true; {1048#true} is VALID [2022-02-20 17:03:19,230 INFO L290 TraceCheckUtils]: 14: Hoare triple {1048#true} assume !(0 == ~cond); {1048#true} is VALID [2022-02-20 17:03:19,231 INFO L290 TraceCheckUtils]: 13: Hoare triple {1048#true} ~cond := #in~cond; {1048#true} is VALID [2022-02-20 17:03:19,231 INFO L272 TraceCheckUtils]: 12: Hoare triple {1200#(<= (+ |ULTIMATE.start_main_~t~0#1| 1) |ULTIMATE.start_main_~tagbuf_len~0#1|)} call __VERIFIER_assert((if main_~t~0#1 <= main_~tagbuf_len~0#1 then 1 else 0)); {1048#true} is VALID [2022-02-20 17:03:19,233 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1048#true} {1200#(<= (+ |ULTIMATE.start_main_~t~0#1| 1) |ULTIMATE.start_main_~tagbuf_len~0#1|)} #112#return; {1200#(<= (+ |ULTIMATE.start_main_~t~0#1| 1) |ULTIMATE.start_main_~tagbuf_len~0#1|)} is VALID [2022-02-20 17:03:19,233 INFO L290 TraceCheckUtils]: 10: Hoare triple {1048#true} assume true; {1048#true} is VALID [2022-02-20 17:03:19,233 INFO L290 TraceCheckUtils]: 9: Hoare triple {1048#true} assume !(0 == ~cond); {1048#true} is VALID [2022-02-20 17:03:19,233 INFO L290 TraceCheckUtils]: 8: Hoare triple {1048#true} ~cond := #in~cond; {1048#true} is VALID [2022-02-20 17:03:19,233 INFO L272 TraceCheckUtils]: 7: Hoare triple {1200#(<= (+ |ULTIMATE.start_main_~t~0#1| 1) |ULTIMATE.start_main_~tagbuf_len~0#1|)} call __VERIFIER_assert((if 0 <= main_~t~0#1 then 1 else 0)); {1048#true} is VALID [2022-02-20 17:03:19,233 INFO L290 TraceCheckUtils]: 6: Hoare triple {1200#(<= (+ |ULTIMATE.start_main_~t~0#1| 1) |ULTIMATE.start_main_~tagbuf_len~0#1|)} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {1200#(<= (+ |ULTIMATE.start_main_~t~0#1| 1) |ULTIMATE.start_main_~tagbuf_len~0#1|)} is VALID [2022-02-20 17:03:19,234 INFO L290 TraceCheckUtils]: 5: Hoare triple {1172#(<= |ULTIMATE.start_main_~t~0#1| |ULTIMATE.start_main_~tagbuf_len~0#1|)} assume !(main_~t~0#1 == main_~tagbuf_len~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {1200#(<= (+ |ULTIMATE.start_main_~t~0#1| 1) |ULTIMATE.start_main_~tagbuf_len~0#1|)} is VALID [2022-02-20 17:03:19,234 INFO L290 TraceCheckUtils]: 4: Hoare triple {1172#(<= |ULTIMATE.start_main_~t~0#1| |ULTIMATE.start_main_~tagbuf_len~0#1|)} assume !false; {1172#(<= |ULTIMATE.start_main_~t~0#1| |ULTIMATE.start_main_~tagbuf_len~0#1|)} is VALID [2022-02-20 17:03:19,235 INFO L290 TraceCheckUtils]: 3: Hoare triple {1050#(<= 1 |ULTIMATE.start_main_~tagbuf_len~0#1|)} main_~t~0#1 := 0;main_#t~pre2#1 := main_~tagbuf_len~0#1 - 1;main_~tagbuf_len~0#1 := main_~tagbuf_len~0#1 - 1;havoc main_#t~pre2#1; {1172#(<= |ULTIMATE.start_main_~t~0#1| |ULTIMATE.start_main_~tagbuf_len~0#1|)} is VALID [2022-02-20 17:03:19,237 INFO L290 TraceCheckUtils]: 2: Hoare triple {1048#true} assume main_~tagbuf_len~0#1 >= 1; {1050#(<= 1 |ULTIMATE.start_main_~tagbuf_len~0#1|)} is VALID [2022-02-20 17:03:19,237 INFO L290 TraceCheckUtils]: 1: Hoare triple {1048#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~pre2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~post8#1, main_#t~nondet9#1, main_#t~post10#1, main_~tagbuf_len~0#1, main_~t~0#1;havoc main_~tagbuf_len~0#1;havoc main_~t~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~tagbuf_len~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {1048#true} is VALID [2022-02-20 17:03:19,237 INFO L290 TraceCheckUtils]: 0: Hoare triple {1048#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); {1048#true} is VALID [2022-02-20 17:03:19,237 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-02-20 17:03:19,238 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [344985158] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:03:19,238 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 17:03:19,238 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 15 [2022-02-20 17:03:19,238 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021799805] [2022-02-20 17:03:19,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 17:03:19,238 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 13 states have internal predecessors, (34), 6 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) Word has length 30 [2022-02-20 17:03:19,239 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:03:19,239 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 13 states have internal predecessors, (34), 6 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2022-02-20 17:03:19,273 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:03:19,274 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-20 17:03:19,274 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:03:19,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-20 17:03:19,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-02-20 17:03:19,274 INFO L87 Difference]: Start difference. First operand 52 states and 66 transitions. Second operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 13 states have internal predecessors, (34), 6 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2022-02-20 17:03:19,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:03:19,938 INFO L93 Difference]: Finished difference Result 76 states and 103 transitions. [2022-02-20 17:03:19,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 17:03:19,938 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 13 states have internal predecessors, (34), 6 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) Word has length 30 [2022-02-20 17:03:19,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:03:19,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 13 states have internal predecessors, (34), 6 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2022-02-20 17:03:19,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 97 transitions. [2022-02-20 17:03:19,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 13 states have internal predecessors, (34), 6 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2022-02-20 17:03:19,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 97 transitions. [2022-02-20 17:03:19,943 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 97 transitions. [2022-02-20 17:03:20,025 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:03:20,025 INFO L225 Difference]: With dead ends: 76 [2022-02-20 17:03:20,026 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 17:03:20,032 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2022-02-20 17:03:20,034 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 72 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 17:03:20,034 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 190 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 17:03:20,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 17:03:20,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 17:03:20,036 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:03:20,036 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:03:20,036 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:03:20,036 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:03:20,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:03:20,036 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 17:03:20,037 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:03:20,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:03:20,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:03:20,037 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:03:20,037 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:03:20,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:03:20,037 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 17:03:20,037 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:03:20,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:03:20,038 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:03:20,038 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:03:20,038 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:03:20,038 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:03:20,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 17:03:20,038 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2022-02-20 17:03:20,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:03:20,039 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 17:03:20,040 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 13 states have internal predecessors, (34), 6 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2022-02-20 17:03:20,040 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:03:20,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:03:20,042 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 17:03:20,071 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:03:20,259 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:03:20,260 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 17:03:20,620 INFO L854 garLoopResultBuilder]: At program point L60(line 60) the Hoare annotation is: (and (<= 0 |ULTIMATE.start_main_~t~0#1|) (<= |ULTIMATE.start_main_~t~0#1| |ULTIMATE.start_main_~tagbuf_len~0#1|)) [2022-02-20 17:03:20,620 INFO L854 garLoopResultBuilder]: At program point L60-1(line 60) the Hoare annotation is: (and (<= 0 |ULTIMATE.start_main_~t~0#1|) (<= |ULTIMATE.start_main_~t~0#1| |ULTIMATE.start_main_~tagbuf_len~0#1|)) [2022-02-20 17:03:20,620 INFO L854 garLoopResultBuilder]: At program point L56(line 56) the Hoare annotation is: (and (<= 0 |ULTIMATE.start_main_~t~0#1|) (<= (+ |ULTIMATE.start_main_~t~0#1| 1) |ULTIMATE.start_main_~tagbuf_len~0#1|)) [2022-02-20 17:03:20,620 INFO L854 garLoopResultBuilder]: At program point L56-1(line 56) the Hoare annotation is: (and (<= 0 |ULTIMATE.start_main_~t~0#1|) (<= (+ |ULTIMATE.start_main_~t~0#1| 1) |ULTIMATE.start_main_~tagbuf_len~0#1|)) [2022-02-20 17:03:20,621 INFO L854 garLoopResultBuilder]: At program point L48-2(lines 48 72) the Hoare annotation is: (and (<= 0 |ULTIMATE.start_main_~t~0#1|) (<= 1 |ULTIMATE.start_main_~tagbuf_len~0#1|) (<= |ULTIMATE.start_main_~t~0#1| |ULTIMATE.start_main_~tagbuf_len~0#1|)) [2022-02-20 17:03:20,621 INFO L854 garLoopResultBuilder]: At program point L48-3(lines 48 72) the Hoare annotation is: (and (<= 0 |ULTIMATE.start_main_~t~0#1|) (<= (+ |ULTIMATE.start_main_~t~0#1| 1) |ULTIMATE.start_main_~tagbuf_len~0#1|)) [2022-02-20 17:03:20,621 INFO L854 garLoopResultBuilder]: At program point L73(line 73) the Hoare annotation is: (and (<= 0 |ULTIMATE.start_main_~t~0#1|) (<= (+ |ULTIMATE.start_main_~t~0#1| 1) |ULTIMATE.start_main_~tagbuf_len~0#1|)) [2022-02-20 17:03:20,621 INFO L854 garLoopResultBuilder]: At program point L69(line 69) the Hoare annotation is: (and (<= 0 |ULTIMATE.start_main_~t~0#1|) (<= (+ |ULTIMATE.start_main_~t~0#1| 1) |ULTIMATE.start_main_~tagbuf_len~0#1|)) [2022-02-20 17:03:20,622 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 17:03:20,622 INFO L854 garLoopResultBuilder]: At program point L32-2(lines 32 44) the Hoare annotation is: (and (<= 0 |ULTIMATE.start_main_~t~0#1|) (<= |ULTIMATE.start_main_~t~0#1| |ULTIMATE.start_main_~tagbuf_len~0#1|)) [2022-02-20 17:03:20,622 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 17:03:20,622 INFO L854 garLoopResultBuilder]: At program point L32-3(lines 32 44) the Hoare annotation is: (and (<= 0 |ULTIMATE.start_main_~t~0#1|) (<= (+ |ULTIMATE.start_main_~t~0#1| 1) |ULTIMATE.start_main_~tagbuf_len~0#1|)) [2022-02-20 17:03:20,622 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 17:03:20,622 INFO L858 garLoopResultBuilder]: For program point L57(line 57) no Hoare annotation was computed. [2022-02-20 17:03:20,622 INFO L858 garLoopResultBuilder]: For program point L49(lines 49 53) no Hoare annotation was computed. [2022-02-20 17:03:20,622 INFO L854 garLoopResultBuilder]: At program point L45(line 45) the Hoare annotation is: (and (<= 0 |ULTIMATE.start_main_~t~0#1|) (<= (+ |ULTIMATE.start_main_~t~0#1| 1) |ULTIMATE.start_main_~tagbuf_len~0#1|)) [2022-02-20 17:03:20,622 INFO L861 garLoopResultBuilder]: At program point L74(lines 25 77) the Hoare annotation is: true [2022-02-20 17:03:20,623 INFO L854 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: (and (<= 0 |ULTIMATE.start_main_~t~0#1|) (<= (+ |ULTIMATE.start_main_~t~0#1| 1) |ULTIMATE.start_main_~tagbuf_len~0#1|)) [2022-02-20 17:03:20,624 INFO L854 garLoopResultBuilder]: At program point L41-1(line 41) the Hoare annotation is: (and (<= 0 |ULTIMATE.start_main_~t~0#1|) (<= (+ |ULTIMATE.start_main_~t~0#1| 1) |ULTIMATE.start_main_~tagbuf_len~0#1|)) [2022-02-20 17:03:20,624 INFO L858 garLoopResultBuilder]: For program point L70(line 70) no Hoare annotation was computed. [2022-02-20 17:03:20,624 INFO L858 garLoopResultBuilder]: For program point L66(lines 66 68) no Hoare annotation was computed. [2022-02-20 17:03:20,624 INFO L858 garLoopResultBuilder]: For program point L33(lines 33 37) no Hoare annotation was computed. [2022-02-20 17:03:20,624 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 17:03:20,624 INFO L858 garLoopResultBuilder]: For program point L29(line 29) no Hoare annotation was computed. [2022-02-20 17:03:20,624 INFO L858 garLoopResultBuilder]: For program point L29-1(line 29) no Hoare annotation was computed. [2022-02-20 17:03:20,624 INFO L858 garLoopResultBuilder]: For program point L54(lines 54 68) no Hoare annotation was computed. [2022-02-20 17:03:20,624 INFO L854 garLoopResultBuilder]: At program point L54-1(lines 54 68) the Hoare annotation is: (and (<= 0 |ULTIMATE.start_main_~t~0#1|) (<= (+ |ULTIMATE.start_main_~t~0#1| 1) |ULTIMATE.start_main_~tagbuf_len~0#1|)) [2022-02-20 17:03:20,624 INFO L854 garLoopResultBuilder]: At program point L50(line 50) the Hoare annotation is: (and (<= 0 |ULTIMATE.start_main_~t~0#1|) (<= |ULTIMATE.start_main_~t~0#1| |ULTIMATE.start_main_~tagbuf_len~0#1|)) [2022-02-20 17:03:20,624 INFO L854 garLoopResultBuilder]: At program point L50-1(line 50) the Hoare annotation is: (and (<= 0 |ULTIMATE.start_main_~t~0#1|) (<= |ULTIMATE.start_main_~t~0#1| |ULTIMATE.start_main_~tagbuf_len~0#1|)) [2022-02-20 17:03:20,624 INFO L858 garLoopResultBuilder]: For program point L46(line 46) no Hoare annotation was computed. [2022-02-20 17:03:20,625 INFO L858 garLoopResultBuilder]: For program point L42(line 42) no Hoare annotation was computed. [2022-02-20 17:03:20,625 INFO L858 garLoopResultBuilder]: For program point L38(lines 38 40) no Hoare annotation was computed. [2022-02-20 17:03:20,625 INFO L854 garLoopResultBuilder]: At program point L34(line 34) the Hoare annotation is: (and (<= 0 |ULTIMATE.start_main_~t~0#1|) (<= |ULTIMATE.start_main_~t~0#1| |ULTIMATE.start_main_~tagbuf_len~0#1|)) [2022-02-20 17:03:20,625 INFO L854 garLoopResultBuilder]: At program point L34-1(line 34) the Hoare annotation is: (and (<= 0 |ULTIMATE.start_main_~t~0#1|) (<= |ULTIMATE.start_main_~t~0#1| |ULTIMATE.start_main_~tagbuf_len~0#1|)) [2022-02-20 17:03:20,625 INFO L858 garLoopResultBuilder]: For program point L59(lines 59 63) no Hoare annotation was computed. [2022-02-20 17:03:20,625 INFO L858 garLoopResultBuilder]: For program point L55(lines 55 64) no Hoare annotation was computed. [2022-02-20 17:03:20,625 INFO L861 garLoopResultBuilder]: At program point L76(lines 24 77) the Hoare annotation is: true [2022-02-20 17:03:20,625 INFO L858 garLoopResultBuilder]: For program point L18-2(lines 17 22) no Hoare annotation was computed. [2022-02-20 17:03:20,625 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-02-20 17:03:20,625 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 17 22) no Hoare annotation was computed. [2022-02-20 17:03:20,625 INFO L858 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2022-02-20 17:03:20,625 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-02-20 17:03:20,625 INFO L858 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2022-02-20 17:03:20,628 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-02-20 17:03:20,629 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 17:03:20,631 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 17:03:20,631 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-02-20 17:03:20,631 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 17:03:20,631 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-02-20 17:03:20,631 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-02-20 17:03:20,631 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-02-20 17:03:20,631 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-02-20 17:03:20,631 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-02-20 17:03:20,631 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-02-20 17:03:20,631 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2022-02-20 17:03:20,631 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-02-20 17:03:20,631 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:03:20,632 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:03:20,632 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:03:20,632 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:03:20,632 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:03:20,632 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:03:20,632 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:03:20,632 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:03:20,632 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:03:20,632 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:03:20,632 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:03:20,632 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:03:20,632 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:03:20,632 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:03:20,632 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:03:20,632 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:03:20,635 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-02-20 17:03:20,635 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 17:03:20,635 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-02-20 17:03:20,635 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-02-20 17:03:20,635 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-02-20 17:03:20,635 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-02-20 17:03:20,635 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2022-02-20 17:03:20,635 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2022-02-20 17:03:20,635 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2022-02-20 17:03:20,635 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2022-02-20 17:03:20,635 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-02-20 17:03:20,636 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-02-20 17:03:20,636 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 17:03:20,638 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-02-20 17:03:20,638 WARN L170 areAnnotationChecker]: L59 has no Hoare annotation [2022-02-20 17:03:20,638 WARN L170 areAnnotationChecker]: L59 has no Hoare annotation [2022-02-20 17:03:20,638 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-02-20 17:03:20,638 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-02-20 17:03:20,638 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-02-20 17:03:20,638 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-02-20 17:03:20,638 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2022-02-20 17:03:20,638 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2022-02-20 17:03:20,638 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2022-02-20 17:03:20,638 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2022-02-20 17:03:20,638 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2022-02-20 17:03:20,638 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2022-02-20 17:03:20,639 INFO L163 areAnnotationChecker]: CFG has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 17:03:20,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 05:03:20 BoogieIcfgContainer [2022-02-20 17:03:20,645 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 17:03:20,646 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 17:03:20,646 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 17:03:20,646 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 17:03:20,646 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:03:16" (3/4) ... [2022-02-20 17:03:20,648 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 17:03:20,652 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-02-20 17:03:20,654 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2022-02-20 17:03:20,655 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-02-20 17:03:20,655 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 17:03:20,655 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 17:03:20,678 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 17:03:20,678 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 17:03:20,678 INFO L158 Benchmark]: Toolchain (without parser) took 4762.53ms. Allocated memory was 113.2MB in the beginning and 163.6MB in the end (delta: 50.3MB). Free memory was 82.9MB in the beginning and 92.8MB in the end (delta: -10.0MB). Peak memory consumption was 40.6MB. Max. memory is 16.1GB. [2022-02-20 17:03:20,679 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 83.9MB. Free memory was 42.7MB in the beginning and 42.6MB in the end (delta: 40.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:03:20,679 INFO L158 Benchmark]: CACSL2BoogieTranslator took 247.92ms. Allocated memory is still 113.2MB. Free memory was 82.9MB in the beginning and 88.1MB in the end (delta: -5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 17:03:20,679 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.67ms. Allocated memory is still 113.2MB. Free memory was 88.1MB in the beginning and 86.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:03:20,679 INFO L158 Benchmark]: Boogie Preprocessor took 30.84ms. Allocated memory is still 113.2MB. Free memory was 86.3MB in the beginning and 85.2MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:03:20,679 INFO L158 Benchmark]: RCFGBuilder took 289.73ms. Allocated memory is still 113.2MB. Free memory was 85.2MB in the beginning and 71.8MB in the end (delta: 13.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-02-20 17:03:20,680 INFO L158 Benchmark]: TraceAbstraction took 4123.73ms. Allocated memory was 113.2MB in the beginning and 163.6MB in the end (delta: 50.3MB). Free memory was 71.0MB in the beginning and 96.0MB in the end (delta: -25.0MB). Peak memory consumption was 27.0MB. Max. memory is 16.1GB. [2022-02-20 17:03:20,680 INFO L158 Benchmark]: Witness Printer took 31.92ms. Allocated memory is still 163.6MB. Free memory was 96.0MB in the beginning and 92.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 17:03:20,681 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.11ms. Allocated memory is still 83.9MB. Free memory was 42.7MB in the beginning and 42.6MB in the end (delta: 40.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 247.92ms. Allocated memory is still 113.2MB. Free memory was 82.9MB in the beginning and 88.1MB in the end (delta: -5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.67ms. Allocated memory is still 113.2MB. Free memory was 88.1MB in the beginning and 86.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.84ms. Allocated memory is still 113.2MB. Free memory was 86.3MB in the beginning and 85.2MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 289.73ms. Allocated memory is still 113.2MB. Free memory was 85.2MB in the beginning and 71.8MB in the end (delta: 13.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 4123.73ms. Allocated memory was 113.2MB in the beginning and 163.6MB in the end (delta: 50.3MB). Free memory was 71.0MB in the beginning and 96.0MB in the end (delta: -25.0MB). Peak memory consumption was 27.0MB. Max. memory is 16.1GB. * Witness Printer took 31.92ms. Allocated memory is still 163.6MB. Free memory was 96.0MB in the beginning and 92.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. 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, 43 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.1s, OverallIterations: 5, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 155 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 126 mSDsluCounter, 747 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 514 mSDsCounter, 139 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 355 IncrementalHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 139 mSolverCounterUnsat, 233 mSDtfsCounter, 355 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 103 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=4, InterpolantAutomatonStates: 35, 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, 5 MinimizatonAttempts, 11 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 66 PreInvPairs, 103 NumberOfFragments, 152 HoareAnnotationTreeSize, 66 FomulaSimplifications, 364 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 21 FomulaSimplificationsInter, 250 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 110 NumberOfCodeBlocks, 110 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 133 ConstructedInterpolants, 0 QuantifiedInterpolants, 486 SizeOfPredicates, 1 NumberOfNonLiveVariables, 77 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 60/67 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: 32]: Loop Invariant Derived loop invariant: 0 <= t && t <= tagbuf_len - InvariantResult [Line: 48]: Loop Invariant Derived loop invariant: (0 <= t && 1 <= tagbuf_len) && t <= tagbuf_len - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-02-20 17:03:20,705 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