./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/apache-get-tag.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 574ddb4e Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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-?-574ddb4 [2023-02-17 06:31:31,235 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 06:31:31,245 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 06:31:31,263 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 06:31:31,266 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 06:31:31,267 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 06:31:31,268 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 06:31:31,270 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 06:31:31,271 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 06:31:31,271 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 06:31:31,272 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 06:31:31,273 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 06:31:31,275 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 06:31:31,276 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 06:31:31,277 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 06:31:31,277 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 06:31:31,278 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 06:31:31,279 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 06:31:31,280 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 06:31:31,283 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 06:31:31,283 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 06:31:31,288 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 06:31:31,289 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 06:31:31,289 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 06:31:31,291 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 06:31:31,296 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 06:31:31,296 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 06:31:31,296 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 06:31:31,298 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 06:31:31,298 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 06:31:31,298 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 06:31:31,299 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 06:31:31,300 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 06:31:31,300 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 06:31:31,301 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 06:31:31,301 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 06:31:31,302 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 06:31:31,302 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 06:31:31,302 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 06:31:31,303 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 06:31:31,304 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 06:31:31,305 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-17 06:31:31,317 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 06:31:31,318 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 06:31:31,318 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 06:31:31,318 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 06:31:31,318 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 06:31:31,319 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 06:31:31,319 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 06:31:31,319 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 06:31:31,319 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 06:31:31,319 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 06:31:31,320 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 06:31:31,320 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 06:31:31,320 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 06:31:31,320 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 06:31:31,320 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-17 06:31:31,320 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 06:31:31,320 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-17 06:31:31,321 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 06:31:31,321 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-17 06:31:31,321 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 06:31:31,321 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-17 06:31:31,321 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 06:31:31,321 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 06:31:31,322 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 06:31:31,322 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 06:31:31,322 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 06:31:31,322 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 06:31:31,322 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-17 06:31:31,323 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 06:31:31,323 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 06:31:31,323 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 06:31:31,323 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-17 06:31:31,323 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 06:31:31,323 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 06:31:31,323 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 06:31:31,324 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 [2023-02-17 06:31:31,491 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 06:31:31,510 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 06:31:31,512 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 06:31:31,513 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 06:31:31,513 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 06:31:31,514 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 [2023-02-17 06:31:32,474 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 06:31:32,623 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 06:31:32,624 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i [2023-02-17 06:31:32,628 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7070609f/faa54bc08b3143278611766b14964310/FLAGcd93940dd [2023-02-17 06:31:33,027 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7070609f/faa54bc08b3143278611766b14964310 [2023-02-17 06:31:33,029 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 06:31:33,030 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 06:31:33,031 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 06:31:33,031 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 06:31:33,033 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 06:31:33,034 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 06:31:33" (1/1) ... [2023-02-17 06:31:33,036 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@912c095 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:31:33, skipping insertion in model container [2023-02-17 06:31:33,036 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 06:31:33" (1/1) ... [2023-02-17 06:31:33,040 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 06:31:33,051 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 06:31:33,134 WARN L237 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] [2023-02-17 06:31:33,156 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 06:31:33,162 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 06:31:33,169 WARN L237 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] [2023-02-17 06:31:33,173 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 06:31:33,181 INFO L208 MainTranslator]: Completed translation [2023-02-17 06:31:33,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:31:33 WrapperNode [2023-02-17 06:31:33,182 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 06:31:33,182 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 06:31:33,183 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 06:31:33,183 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 06:31:33,187 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:31:33" (1/1) ... [2023-02-17 06:31:33,191 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:31:33" (1/1) ... [2023-02-17 06:31:33,207 INFO L138 Inliner]: procedures = 16, calls = 22, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 83 [2023-02-17 06:31:33,207 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 06:31:33,208 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 06:31:33,208 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 06:31:33,208 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 06:31:33,214 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:31:33" (1/1) ... [2023-02-17 06:31:33,214 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:31:33" (1/1) ... [2023-02-17 06:31:33,215 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:31:33" (1/1) ... [2023-02-17 06:31:33,215 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:31:33" (1/1) ... [2023-02-17 06:31:33,216 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:31:33" (1/1) ... [2023-02-17 06:31:33,218 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:31:33" (1/1) ... [2023-02-17 06:31:33,219 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:31:33" (1/1) ... [2023-02-17 06:31:33,220 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:31:33" (1/1) ... [2023-02-17 06:31:33,224 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 06:31:33,224 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 06:31:33,230 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 06:31:33,230 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 06:31:33,231 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:31:33" (1/1) ... [2023-02-17 06:31:33,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 06:31:33,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 06:31:33,253 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) [2023-02-17 06:31:33,262 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 [2023-02-17 06:31:33,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 06:31:33,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-17 06:31:33,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 06:31:33,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 06:31:33,285 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-17 06:31:33,285 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-17 06:31:33,323 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 06:31:33,324 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 06:31:33,444 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 06:31:33,448 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 06:31:33,448 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-17 06:31:33,449 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 06:31:33 BoogieIcfgContainer [2023-02-17 06:31:33,449 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 06:31:33,451 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 06:31:33,451 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 06:31:33,453 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 06:31:33,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 06:31:33" (1/3) ... [2023-02-17 06:31:33,453 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3361f9b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 06:31:33, skipping insertion in model container [2023-02-17 06:31:33,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:31:33" (2/3) ... [2023-02-17 06:31:33,454 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3361f9b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 06:31:33, skipping insertion in model container [2023-02-17 06:31:33,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 06:31:33" (3/3) ... [2023-02-17 06:31:33,455 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i [2023-02-17 06:31:33,465 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 06:31:33,465 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-17 06:31:33,506 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 06:31:33,513 INFO L357 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@299fdd8e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 06:31:33,513 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-17 06:31:33,518 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) [2023-02-17 06:31:33,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-17 06:31:33,523 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 06:31:33,523 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 06:31:33,523 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 06:31:33,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 06:31:33,527 INFO L85 PathProgramCache]: Analyzing trace with hash -587348936, now seen corresponding path program 1 times [2023-02-17 06:31:33,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 06:31:33,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444183479] [2023-02-17 06:31:33,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:31:33,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 06:31:33,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 06:31:33,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 06:31:33,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 06:31:33,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444183479] [2023-02-17 06:31:33,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444183479] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 06:31:33,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 06:31:33,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 06:31:33,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346904374] [2023-02-17 06:31:33,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 06:31:33,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-17 06:31:33,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 06:31:33,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-17 06:31:33,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-17 06:31:33,677 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) [2023-02-17 06:31:33,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 06:31:33,710 INFO L93 Difference]: Finished difference Result 82 states and 151 transitions. [2023-02-17 06:31:33,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-17 06:31:33,713 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 [2023-02-17 06:31:33,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 06:31:33,718 INFO L225 Difference]: With dead ends: 82 [2023-02-17 06:31:33,719 INFO L226 Difference]: Without dead ends: 39 [2023-02-17 06:31:33,724 INFO L412 NwaCegarLoop]: 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 [2023-02-17 06:31:33,727 INFO L413 NwaCegarLoop]: 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 [2023-02-17 06:31:33,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 06:31:33,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-02-17 06:31:33,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2023-02-17 06:31:33,760 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) [2023-02-17 06:31:33,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 57 transitions. [2023-02-17 06:31:33,764 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 57 transitions. Word has length 9 [2023-02-17 06:31:33,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 06:31:33,765 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 57 transitions. [2023-02-17 06:31:33,766 INFO L496 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) [2023-02-17 06:31:33,766 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 57 transitions. [2023-02-17 06:31:33,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-17 06:31:33,767 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 06:31:33,767 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 06:31:33,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-17 06:31:33,767 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 06:31:33,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 06:31:33,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1057175647, now seen corresponding path program 1 times [2023-02-17 06:31:33,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 06:31:33,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975066184] [2023-02-17 06:31:33,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:31:33,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 06:31:33,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 06:31:33,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 06:31:33,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 06:31:33,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975066184] [2023-02-17 06:31:33,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975066184] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 06:31:33,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 06:31:33,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 06:31:33,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326196407] [2023-02-17 06:31:33,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 06:31:33,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 06:31:33,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 06:31:33,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 06:31:33,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 06:31:33,936 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) [2023-02-17 06:31:34,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 06:31:34,068 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2023-02-17 06:31:34,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 06:31:34,068 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 [2023-02-17 06:31:34,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 06:31:34,069 INFO L225 Difference]: With dead ends: 45 [2023-02-17 06:31:34,069 INFO L226 Difference]: Without dead ends: 43 [2023-02-17 06:31:34,073 INFO L412 NwaCegarLoop]: 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 [2023-02-17 06:31:34,073 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 20 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 06:31:34,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 83 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 06:31:34,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-02-17 06:31:34,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2023-02-17 06:31:34,082 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) [2023-02-17 06:31:34,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 60 transitions. [2023-02-17 06:31:34,084 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 60 transitions. Word has length 10 [2023-02-17 06:31:34,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 06:31:34,084 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 60 transitions. [2023-02-17 06:31:34,085 INFO L496 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) [2023-02-17 06:31:34,085 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 60 transitions. [2023-02-17 06:31:34,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-17 06:31:34,086 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 06:31:34,087 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 06:31:34,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-17 06:31:34,087 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 06:31:34,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 06:31:34,089 INFO L85 PathProgramCache]: Analyzing trace with hash 986719232, now seen corresponding path program 1 times [2023-02-17 06:31:34,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 06:31:34,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778641732] [2023-02-17 06:31:34,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:31:34,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 06:31:34,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 06:31:34,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-17 06:31:34,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 06:31:34,221 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 06:31:34,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 06:31:34,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778641732] [2023-02-17 06:31:34,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778641732] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 06:31:34,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 06:31:34,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-17 06:31:34,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85499287] [2023-02-17 06:31:34,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 06:31:34,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 06:31:34,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 06:31:34,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 06:31:34,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-17 06:31:34,224 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) [2023-02-17 06:31:34,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 06:31:34,325 INFO L93 Difference]: Finished difference Result 58 states and 80 transitions. [2023-02-17 06:31:34,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 06:31:34,325 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 [2023-02-17 06:31:34,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 06:31:34,327 INFO L225 Difference]: With dead ends: 58 [2023-02-17 06:31:34,327 INFO L226 Difference]: Without dead ends: 46 [2023-02-17 06:31:34,330 INFO L412 NwaCegarLoop]: 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 [2023-02-17 06:31:34,332 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 7 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 06:31:34,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 193 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 06:31:34,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-02-17 06:31:34,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 37. [2023-02-17 06:31:34,342 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) [2023-02-17 06:31:34,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2023-02-17 06:31:34,344 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 15 [2023-02-17 06:31:34,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 06:31:34,344 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2023-02-17 06:31:34,344 INFO L496 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) [2023-02-17 06:31:34,344 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2023-02-17 06:31:34,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-17 06:31:34,345 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 06:31:34,345 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 06:31:34,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-17 06:31:34,346 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 06:31:34,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 06:31:34,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1700663812, now seen corresponding path program 1 times [2023-02-17 06:31:34,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 06:31:34,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800875502] [2023-02-17 06:31:34,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:31:34,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 06:31:34,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 06:31:34,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-17 06:31:34,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 06:31:34,395 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 06:31:34,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 06:31:34,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800875502] [2023-02-17 06:31:34,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800875502] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 06:31:34,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 06:31:34,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-17 06:31:34,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359784626] [2023-02-17 06:31:34,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 06:31:34,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 06:31:34,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 06:31:34,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 06:31:34,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-17 06:31:34,402 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) [2023-02-17 06:31:34,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 06:31:34,507 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2023-02-17 06:31:34,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-17 06:31:34,507 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 [2023-02-17 06:31:34,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 06:31:34,511 INFO L225 Difference]: With dead ends: 56 [2023-02-17 06:31:34,512 INFO L226 Difference]: Without dead ends: 54 [2023-02-17 06:31:34,512 INFO L412 NwaCegarLoop]: 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 [2023-02-17 06:31:34,521 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 28 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 06:31:34,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 118 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 06:31:34,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-02-17 06:31:34,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2023-02-17 06:31:34,534 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) [2023-02-17 06:31:34,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 66 transitions. [2023-02-17 06:31:34,538 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 66 transitions. Word has length 16 [2023-02-17 06:31:34,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 06:31:34,538 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 66 transitions. [2023-02-17 06:31:34,539 INFO L496 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) [2023-02-17 06:31:34,539 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2023-02-17 06:31:34,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-17 06:31:34,540 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 06:31:34,540 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 06:31:34,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-17 06:31:34,540 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 06:31:34,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 06:31:34,543 INFO L85 PathProgramCache]: Analyzing trace with hash 367468842, now seen corresponding path program 1 times [2023-02-17 06:31:34,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 06:31:34,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70892973] [2023-02-17 06:31:34,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:31:34,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 06:31:34,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 06:31:34,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-17 06:31:34,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 06:31:34,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-17 06:31:34,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 06:31:34,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-02-17 06:31:34,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 06:31:34,695 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-17 06:31:34,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 06:31:34,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70892973] [2023-02-17 06:31:34,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70892973] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 06:31:34,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562663640] [2023-02-17 06:31:34,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:31:34,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 06:31:34,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 06:31:34,698 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) [2023-02-17 06:31:34,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-17 06:31:34,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 06:31:34,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-17 06:31:34,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 06:31:34,883 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-17 06:31:34,883 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 06:31:34,977 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-17 06:31:34,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [562663640] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 06:31:34,979 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 06:31:34,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 16 [2023-02-17 06:31:34,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457445444] [2023-02-17 06:31:34,980 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 06:31:34,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-17 06:31:34,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 06:31:34,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-17 06:31:34,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2023-02-17 06:31:34,982 INFO L87 Difference]: Start difference. First operand 52 states and 66 transitions. Second operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 14 states have internal predecessors, (32), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 4 states have call predecessors, (7), 5 states have call successors, (7) [2023-02-17 06:31:35,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 06:31:35,209 INFO L93 Difference]: Finished difference Result 76 states and 103 transitions. [2023-02-17 06:31:35,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-17 06:31:35,209 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 14 states have internal predecessors, (32), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 4 states have call predecessors, (7), 5 states have call successors, (7) Word has length 30 [2023-02-17 06:31:35,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 06:31:35,210 INFO L225 Difference]: With dead ends: 76 [2023-02-17 06:31:35,210 INFO L226 Difference]: Without dead ends: 0 [2023-02-17 06:31:35,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 51 SyntacticMatches, 7 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2023-02-17 06:31:35,211 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 89 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 06:31:35,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 117 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 06:31:35,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-17 06:31:35,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-17 06:31:35,212 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) [2023-02-17 06:31:35,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-17 06:31:35,212 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2023-02-17 06:31:35,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 06:31:35,212 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-17 06:31:35,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 14 states have internal predecessors, (32), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 4 states have call predecessors, (7), 5 states have call successors, (7) [2023-02-17 06:31:35,213 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-17 06:31:35,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-17 06:31:35,214 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-17 06:31:35,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-17 06:31:35,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 06:31:35,420 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-17 06:31:35,438 INFO L895 garLoopResultBuilder]: At program point L60(line 60) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~t~0#1| 0))) (and (or (<= (+ |ULTIMATE.start_main_~t~0#1| (* (- 1) |ULTIMATE.start_main_~tagbuf_len~0#1|)) 0) (and (= |ULTIMATE.start_main_~tagbuf_len~0#1| 0) .cse0)) (or (<= (* (- 1) |ULTIMATE.start_main_~t~0#1|) 0) .cse0))) [2023-02-17 06:31:35,438 INFO L895 garLoopResultBuilder]: At program point L60-1(line 60) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~t~0#1| 0))) (and (or (<= (+ |ULTIMATE.start_main_~t~0#1| (* (- 1) |ULTIMATE.start_main_~tagbuf_len~0#1|)) 0) (and (= |ULTIMATE.start_main_~tagbuf_len~0#1| 0) .cse0)) (or (<= (* (- 1) |ULTIMATE.start_main_~t~0#1|) 0) .cse0))) [2023-02-17 06:31:35,440 INFO L895 garLoopResultBuilder]: At program point L56(line 56) the Hoare annotation is: (let ((.cse4 (+ |ULTIMATE.start_main_~tagbuf_len~0#1| 1))) (let ((.cse0 (< (+ |ULTIMATE.start_main_~t~0#1| 1) .cse4)) (.cse1 (or (<= (* (- 1) |ULTIMATE.start_main_~t~0#1|) 0) (= |ULTIMATE.start_main_~t~0#1| 0))) (.cse2 (<= 0 (+ |ULTIMATE.start_main_~tagbuf_len~0#1| (- 1))))) (or (and .cse0 .cse1 .cse2) (let ((.cse3 (<= .cse4 0))) (and .cse0 .cse1 .cse2 (or .cse3 (<= |ULTIMATE.start_main_~t~0#1| 1) (<= |ULTIMATE.start_main_~tagbuf_len~0#1| 0)) (not (= |ULTIMATE.start_main_~tagbuf_len~0#1| 0)) (or (not .cse3) (<= 0 |ULTIMATE.start_main_~tagbuf_len~0#1|))))))) [2023-02-17 06:31:35,440 INFO L895 garLoopResultBuilder]: At program point L56-1(line 56) the Hoare annotation is: (let ((.cse4 (+ |ULTIMATE.start_main_~tagbuf_len~0#1| 1))) (let ((.cse0 (< (+ |ULTIMATE.start_main_~t~0#1| 1) .cse4)) (.cse1 (or (<= (* (- 1) |ULTIMATE.start_main_~t~0#1|) 0) (= |ULTIMATE.start_main_~t~0#1| 0))) (.cse2 (<= 0 (+ |ULTIMATE.start_main_~tagbuf_len~0#1| (- 1))))) (or (and .cse0 .cse1 .cse2) (let ((.cse3 (<= .cse4 0))) (and .cse0 .cse1 .cse2 (or .cse3 (<= |ULTIMATE.start_main_~t~0#1| 1) (<= |ULTIMATE.start_main_~tagbuf_len~0#1| 0)) (not (= |ULTIMATE.start_main_~tagbuf_len~0#1| 0)) (or (not .cse3) (<= 0 |ULTIMATE.start_main_~tagbuf_len~0#1|))))))) [2023-02-17 06:31:35,441 INFO L895 garLoopResultBuilder]: At program point L48-2(lines 48 72) the Hoare annotation is: (let ((.cse0 (or (<= (* (- 1) |ULTIMATE.start_main_~t~0#1|) 0) (= |ULTIMATE.start_main_~t~0#1| 0))) (.cse1 (<= 0 (+ |ULTIMATE.start_main_~tagbuf_len~0#1| (- 1))))) (or (let ((.cse2 (<= (+ |ULTIMATE.start_main_~tagbuf_len~0#1| 1) 0))) (and .cse0 .cse1 (or .cse2 (<= |ULTIMATE.start_main_~t~0#1| 1) (<= |ULTIMATE.start_main_~tagbuf_len~0#1| 0)) (not (= |ULTIMATE.start_main_~tagbuf_len~0#1| 0)) (or (not .cse2) (<= 0 |ULTIMATE.start_main_~tagbuf_len~0#1|)))) (and .cse0 .cse1 (<= |ULTIMATE.start_main_~t~0#1| |ULTIMATE.start_main_~tagbuf_len~0#1|)))) [2023-02-17 06:31:35,441 INFO L895 garLoopResultBuilder]: At program point L48-3(lines 48 72) the Hoare annotation is: (let ((.cse4 (+ |ULTIMATE.start_main_~tagbuf_len~0#1| 1))) (let ((.cse0 (< (+ |ULTIMATE.start_main_~t~0#1| 1) .cse4)) (.cse1 (or (<= (* (- 1) |ULTIMATE.start_main_~t~0#1|) 0) (= |ULTIMATE.start_main_~t~0#1| 0))) (.cse2 (<= 0 (+ |ULTIMATE.start_main_~tagbuf_len~0#1| (- 1))))) (or (and .cse0 .cse1 .cse2) (let ((.cse3 (<= .cse4 0))) (and .cse0 .cse1 .cse2 (or .cse3 (<= |ULTIMATE.start_main_~t~0#1| 1) (<= |ULTIMATE.start_main_~tagbuf_len~0#1| 0)) (not (= |ULTIMATE.start_main_~tagbuf_len~0#1| 0)) (or (not .cse3) (<= 0 |ULTIMATE.start_main_~tagbuf_len~0#1|))))))) [2023-02-17 06:31:35,441 INFO L895 garLoopResultBuilder]: At program point L73(line 73) the Hoare annotation is: (let ((.cse4 (+ |ULTIMATE.start_main_~tagbuf_len~0#1| 1))) (let ((.cse0 (< (+ |ULTIMATE.start_main_~t~0#1| 1) .cse4)) (.cse1 (or (<= (* (- 1) |ULTIMATE.start_main_~t~0#1|) 0) (= |ULTIMATE.start_main_~t~0#1| 0))) (.cse2 (<= 0 (+ |ULTIMATE.start_main_~tagbuf_len~0#1| (- 1))))) (or (and .cse0 .cse1 .cse2) (let ((.cse3 (<= .cse4 0))) (and .cse0 .cse1 .cse2 (or .cse3 (<= |ULTIMATE.start_main_~t~0#1| 1) (<= |ULTIMATE.start_main_~tagbuf_len~0#1| 0)) (not (= |ULTIMATE.start_main_~tagbuf_len~0#1| 0)) (or (not .cse3) (<= 0 |ULTIMATE.start_main_~tagbuf_len~0#1|))))))) [2023-02-17 06:31:35,441 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 24 77) the Hoare annotation is: true [2023-02-17 06:31:35,441 INFO L895 garLoopResultBuilder]: At program point L69(line 69) the Hoare annotation is: (let ((.cse4 (+ |ULTIMATE.start_main_~tagbuf_len~0#1| 1))) (let ((.cse0 (< (+ |ULTIMATE.start_main_~t~0#1| 1) .cse4)) (.cse1 (or (<= (* (- 1) |ULTIMATE.start_main_~t~0#1|) 0) (= |ULTIMATE.start_main_~t~0#1| 0))) (.cse2 (<= 0 (+ |ULTIMATE.start_main_~tagbuf_len~0#1| (- 1))))) (or (and .cse0 .cse1 .cse2) (let ((.cse3 (<= .cse4 0))) (and .cse0 .cse1 .cse2 (or .cse3 (<= |ULTIMATE.start_main_~t~0#1| 1) (<= |ULTIMATE.start_main_~tagbuf_len~0#1| 0)) (not (= |ULTIMATE.start_main_~tagbuf_len~0#1| 0)) (or (not .cse3) (<= 0 |ULTIMATE.start_main_~tagbuf_len~0#1|))))))) [2023-02-17 06:31:35,442 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-17 06:31:35,442 INFO L895 garLoopResultBuilder]: At program point L32-2(lines 32 44) the Hoare annotation is: (let ((.cse1 (= 0 |ULTIMATE.start_main_~tagbuf_len~0#1|)) (.cse6 (= |ULTIMATE.start_main_~t~0#1| 0)) (.cse8 (<= (+ |ULTIMATE.start_main_~tagbuf_len~0#1| 1) 0)) (.cse4 (= |ULTIMATE.start_main_~tagbuf_len~0#1| 0))) (let ((.cse2 (not .cse4)) (.cse3 (not .cse8)) (.cse0 (<= 0 |ULTIMATE.start_main_~tagbuf_len~0#1|)) (.cse5 (let ((.cse9 (<= (* (- 1) |ULTIMATE.start_main_~t~0#1|) 0))) (or .cse9 (and (or .cse9 .cse6) (or (and (or .cse4 (and (not .cse1) (= 0 |ULTIMATE.start_main_~t~0#1|))) .cse6) (<= (+ |ULTIMATE.start_main_~t~0#1| (* (- 1) |ULTIMATE.start_main_~tagbuf_len~0#1|)) 0))) .cse6))) (.cse7 (<= 0 (+ |ULTIMATE.start_main_~tagbuf_len~0#1| (- 1))))) (or (and .cse0 (or (and .cse1 (= |ULTIMATE.start_main_~tagbuf_len~0#1| |ULTIMATE.start_main_~t~0#1|)) .cse2) (or .cse3 .cse0 .cse4) .cse5 .cse6) (and .cse5 .cse7 (or .cse8 (<= |ULTIMATE.start_main_~t~0#1| 1) (<= |ULTIMATE.start_main_~tagbuf_len~0#1| 0)) .cse2 (or .cse3 .cse0)) (and .cse5 .cse7 (<= |ULTIMATE.start_main_~t~0#1| |ULTIMATE.start_main_~tagbuf_len~0#1|))))) [2023-02-17 06:31:35,442 INFO L895 garLoopResultBuilder]: At program point L32-3(lines 32 44) the Hoare annotation is: (let ((.cse10 (+ |ULTIMATE.start_main_~tagbuf_len~0#1| 1))) (let ((.cse3 (<= .cse10 0)) (.cse6 (<= 0 |ULTIMATE.start_main_~tagbuf_len~0#1|)) (.cse8 (= |ULTIMATE.start_main_~tagbuf_len~0#1| 0)) (.cse7 (= |ULTIMATE.start_main_~t~0#1| 0))) (let ((.cse0 (< (+ |ULTIMATE.start_main_~t~0#1| 1) .cse10)) (.cse1 (let ((.cse9 (<= (* (- 1) |ULTIMATE.start_main_~t~0#1|) 0))) (or .cse9 (and (or .cse9 .cse7) (or (and (or .cse8 (and (not (= 0 |ULTIMATE.start_main_~tagbuf_len~0#1|)) (= 0 |ULTIMATE.start_main_~t~0#1|))) .cse7) (<= (+ |ULTIMATE.start_main_~t~0#1| (* (- 1) |ULTIMATE.start_main_~tagbuf_len~0#1|)) 0))) .cse7))) (.cse2 (<= 0 (+ |ULTIMATE.start_main_~tagbuf_len~0#1| (- 1)))) (.cse4 (not .cse8)) (.cse5 (or (not .cse3) .cse6))) (or (and .cse0 .cse1 .cse2 (or .cse3 (<= |ULTIMATE.start_main_~t~0#1| 1) (<= |ULTIMATE.start_main_~tagbuf_len~0#1| 0)) .cse4 .cse5) (and .cse0 .cse1 .cse2) (and .cse6 .cse1 .cse2 .cse4 .cse7 .cse5))))) [2023-02-17 06:31:35,442 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-17 06:31:35,442 INFO L899 garLoopResultBuilder]: For program point L57(line 57) no Hoare annotation was computed. [2023-02-17 06:31:35,442 INFO L899 garLoopResultBuilder]: For program point L49(lines 49 53) no Hoare annotation was computed. [2023-02-17 06:31:35,443 INFO L895 garLoopResultBuilder]: At program point L45(line 45) the Hoare annotation is: (let ((.cse10 (+ |ULTIMATE.start_main_~tagbuf_len~0#1| 1))) (let ((.cse7 (<= .cse10 0)) (.cse3 (<= 0 |ULTIMATE.start_main_~tagbuf_len~0#1|)) (.cse8 (= |ULTIMATE.start_main_~tagbuf_len~0#1| 0)) (.cse5 (= |ULTIMATE.start_main_~t~0#1| 0))) (let ((.cse0 (< (+ |ULTIMATE.start_main_~t~0#1| 1) .cse10)) (.cse1 (let ((.cse9 (<= (* (- 1) |ULTIMATE.start_main_~t~0#1|) 0))) (or (and (or .cse9 .cse5) (or (and (or .cse8 (and (not (= 0 |ULTIMATE.start_main_~tagbuf_len~0#1|)) (= 0 |ULTIMATE.start_main_~t~0#1|))) .cse5) (<= (+ |ULTIMATE.start_main_~t~0#1| (* (- 1) |ULTIMATE.start_main_~tagbuf_len~0#1|)) 0))) .cse9 .cse5))) (.cse2 (<= 0 (+ |ULTIMATE.start_main_~tagbuf_len~0#1| (- 1)))) (.cse4 (not .cse8)) (.cse6 (or (not .cse7) .cse3))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 (or .cse7 (<= |ULTIMATE.start_main_~t~0#1| 1) (<= |ULTIMATE.start_main_~tagbuf_len~0#1| 0)) .cse4 .cse6))))) [2023-02-17 06:31:35,443 INFO L902 garLoopResultBuilder]: At program point L74(lines 25 77) the Hoare annotation is: true [2023-02-17 06:31:35,443 INFO L895 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: (let ((.cse10 (+ |ULTIMATE.start_main_~tagbuf_len~0#1| 1))) (let ((.cse3 (<= .cse10 0)) (.cse6 (<= 0 |ULTIMATE.start_main_~tagbuf_len~0#1|)) (.cse8 (= |ULTIMATE.start_main_~tagbuf_len~0#1| 0)) (.cse7 (= |ULTIMATE.start_main_~t~0#1| 0))) (let ((.cse0 (< (+ |ULTIMATE.start_main_~t~0#1| 1) .cse10)) (.cse1 (let ((.cse9 (<= (* (- 1) |ULTIMATE.start_main_~t~0#1|) 0))) (or .cse9 (and (or .cse9 .cse7) (or (and (or .cse8 (and (not (= 0 |ULTIMATE.start_main_~tagbuf_len~0#1|)) (= 0 |ULTIMATE.start_main_~t~0#1|))) .cse7) (<= (+ |ULTIMATE.start_main_~t~0#1| (* (- 1) |ULTIMATE.start_main_~tagbuf_len~0#1|)) 0))) .cse7))) (.cse2 (<= 0 (+ |ULTIMATE.start_main_~tagbuf_len~0#1| (- 1)))) (.cse4 (not .cse8)) (.cse5 (or (not .cse3) .cse6))) (or (and .cse0 .cse1 .cse2 (or .cse3 (<= |ULTIMATE.start_main_~t~0#1| 1) (<= |ULTIMATE.start_main_~tagbuf_len~0#1| 0)) .cse4 .cse5) (and .cse0 .cse1 .cse2) (and .cse6 .cse1 .cse2 .cse4 .cse7 .cse5))))) [2023-02-17 06:31:35,443 INFO L895 garLoopResultBuilder]: At program point L41-1(line 41) the Hoare annotation is: (let ((.cse10 (+ |ULTIMATE.start_main_~tagbuf_len~0#1| 1))) (let ((.cse7 (<= .cse10 0)) (.cse3 (<= 0 |ULTIMATE.start_main_~tagbuf_len~0#1|)) (.cse8 (= |ULTIMATE.start_main_~tagbuf_len~0#1| 0)) (.cse5 (= |ULTIMATE.start_main_~t~0#1| 0))) (let ((.cse0 (< (+ |ULTIMATE.start_main_~t~0#1| 1) .cse10)) (.cse1 (let ((.cse9 (<= (* (- 1) |ULTIMATE.start_main_~t~0#1|) 0))) (or (and (or .cse9 .cse5) (or (and (or .cse8 (and (not (= 0 |ULTIMATE.start_main_~tagbuf_len~0#1|)) (= 0 |ULTIMATE.start_main_~t~0#1|))) .cse5) (<= (+ |ULTIMATE.start_main_~t~0#1| (* (- 1) |ULTIMATE.start_main_~tagbuf_len~0#1|)) 0))) .cse9 .cse5))) (.cse2 (<= 0 (+ |ULTIMATE.start_main_~tagbuf_len~0#1| (- 1)))) (.cse4 (not .cse8)) (.cse6 (or (not .cse7) .cse3))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 (or .cse7 (<= |ULTIMATE.start_main_~t~0#1| 1) (<= |ULTIMATE.start_main_~tagbuf_len~0#1| 0)) .cse4 .cse6))))) [2023-02-17 06:31:35,443 INFO L899 garLoopResultBuilder]: For program point L70(line 70) no Hoare annotation was computed. [2023-02-17 06:31:35,443 INFO L899 garLoopResultBuilder]: For program point L66(lines 66 68) no Hoare annotation was computed. [2023-02-17 06:31:35,444 INFO L899 garLoopResultBuilder]: For program point L33(lines 33 37) no Hoare annotation was computed. [2023-02-17 06:31:35,444 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-17 06:31:35,444 INFO L899 garLoopResultBuilder]: For program point L29(line 29) no Hoare annotation was computed. [2023-02-17 06:31:35,444 INFO L899 garLoopResultBuilder]: For program point L29-1(line 29) no Hoare annotation was computed. [2023-02-17 06:31:35,444 INFO L899 garLoopResultBuilder]: For program point L54(lines 54 68) no Hoare annotation was computed. [2023-02-17 06:31:35,444 INFO L895 garLoopResultBuilder]: At program point L54-1(lines 54 68) the Hoare annotation is: (let ((.cse4 (+ |ULTIMATE.start_main_~tagbuf_len~0#1| 1))) (let ((.cse0 (< (+ |ULTIMATE.start_main_~t~0#1| 1) .cse4)) (.cse1 (or (<= (* (- 1) |ULTIMATE.start_main_~t~0#1|) 0) (= |ULTIMATE.start_main_~t~0#1| 0))) (.cse2 (<= 0 (+ |ULTIMATE.start_main_~tagbuf_len~0#1| (- 1))))) (or (and .cse0 .cse1 .cse2) (let ((.cse3 (<= .cse4 0))) (and .cse0 .cse1 .cse2 (or .cse3 (<= |ULTIMATE.start_main_~t~0#1| 1) (<= |ULTIMATE.start_main_~tagbuf_len~0#1| 0)) (not (= |ULTIMATE.start_main_~tagbuf_len~0#1| 0)) (or (not .cse3) (<= 0 |ULTIMATE.start_main_~tagbuf_len~0#1|))))))) [2023-02-17 06:31:35,444 INFO L895 garLoopResultBuilder]: At program point L50(line 50) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~t~0#1| 0))) (and (or (<= (+ |ULTIMATE.start_main_~t~0#1| (* (- 1) |ULTIMATE.start_main_~tagbuf_len~0#1|)) 0) (and (= |ULTIMATE.start_main_~tagbuf_len~0#1| 0) .cse0)) (or (<= (* (- 1) |ULTIMATE.start_main_~t~0#1|) 0) .cse0))) [2023-02-17 06:31:35,445 INFO L895 garLoopResultBuilder]: At program point L50-1(line 50) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~t~0#1| 0))) (and (or (<= (+ |ULTIMATE.start_main_~t~0#1| (* (- 1) |ULTIMATE.start_main_~tagbuf_len~0#1|)) 0) (and (= |ULTIMATE.start_main_~tagbuf_len~0#1| 0) .cse0)) (or (<= (* (- 1) |ULTIMATE.start_main_~t~0#1|) 0) .cse0))) [2023-02-17 06:31:35,445 INFO L899 garLoopResultBuilder]: For program point L46(line 46) no Hoare annotation was computed. [2023-02-17 06:31:35,445 INFO L899 garLoopResultBuilder]: For program point L42(line 42) no Hoare annotation was computed. [2023-02-17 06:31:35,445 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-17 06:31:35,445 INFO L899 garLoopResultBuilder]: For program point L38(lines 38 40) no Hoare annotation was computed. [2023-02-17 06:31:35,445 INFO L895 garLoopResultBuilder]: At program point L34(line 34) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~t~0#1| 0))) (and (or (<= (+ |ULTIMATE.start_main_~t~0#1| (* (- 1) |ULTIMATE.start_main_~tagbuf_len~0#1|)) 0) (and (= |ULTIMATE.start_main_~tagbuf_len~0#1| 0) .cse0)) (or (<= (* (- 1) |ULTIMATE.start_main_~t~0#1|) 0) .cse0))) [2023-02-17 06:31:35,446 INFO L895 garLoopResultBuilder]: At program point L34-1(line 34) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~t~0#1| 0))) (and (or (<= (+ |ULTIMATE.start_main_~t~0#1| (* (- 1) |ULTIMATE.start_main_~tagbuf_len~0#1|)) 0) (and (= |ULTIMATE.start_main_~tagbuf_len~0#1| 0) .cse0)) (or (<= (* (- 1) |ULTIMATE.start_main_~t~0#1|) 0) .cse0))) [2023-02-17 06:31:35,446 INFO L899 garLoopResultBuilder]: For program point L59(lines 59 63) no Hoare annotation was computed. [2023-02-17 06:31:35,446 INFO L899 garLoopResultBuilder]: For program point L55(lines 55 64) no Hoare annotation was computed. [2023-02-17 06:31:35,446 INFO L899 garLoopResultBuilder]: For program point L18-2(lines 17 22) no Hoare annotation was computed. [2023-02-17 06:31:35,446 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 17 22) no Hoare annotation was computed. [2023-02-17 06:31:35,447 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 17 22) the Hoare annotation is: true [2023-02-17 06:31:35,447 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-02-17 06:31:35,447 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-02-17 06:31:35,447 INFO L899 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2023-02-17 06:31:35,450 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-02-17 06:31:35,452 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-17 06:31:35,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.02 06:31:35 BoogieIcfgContainer [2023-02-17 06:31:35,474 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-17 06:31:35,474 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-17 06:31:35,474 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-17 06:31:35,475 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-17 06:31:35,475 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 06:31:33" (3/4) ... [2023-02-17 06:31:35,477 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-17 06:31:35,481 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-02-17 06:31:35,485 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2023-02-17 06:31:35,485 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-02-17 06:31:35,485 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-17 06:31:35,485 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-17 06:31:35,516 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-17 06:31:35,517 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-17 06:31:35,517 INFO L158 Benchmark]: Toolchain (without parser) took 2487.35ms. Allocated memory was 142.6MB in the beginning and 178.3MB in the end (delta: 35.7MB). Free memory was 112.7MB in the beginning and 140.6MB in the end (delta: -28.0MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. [2023-02-17 06:31:35,517 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 117.4MB. Free memory is still 71.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 06:31:35,517 INFO L158 Benchmark]: CACSL2BoogieTranslator took 151.30ms. Allocated memory is still 142.6MB. Free memory was 112.3MB in the beginning and 101.7MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-17 06:31:35,518 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.01ms. Allocated memory is still 142.6MB. Free memory was 101.7MB in the beginning and 100.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 06:31:35,518 INFO L158 Benchmark]: Boogie Preprocessor took 16.01ms. Allocated memory is still 142.6MB. Free memory was 100.0MB in the beginning and 98.8MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 06:31:35,518 INFO L158 Benchmark]: RCFGBuilder took 225.05ms. Allocated memory is still 142.6MB. Free memory was 98.8MB in the beginning and 87.9MB in the end (delta: 10.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-17 06:31:35,518 INFO L158 Benchmark]: TraceAbstraction took 2023.25ms. Allocated memory was 142.6MB in the beginning and 178.3MB in the end (delta: 35.7MB). Free memory was 87.0MB in the beginning and 143.8MB in the end (delta: -56.8MB). Peak memory consumption was 39.0MB. Max. memory is 16.1GB. [2023-02-17 06:31:35,519 INFO L158 Benchmark]: Witness Printer took 42.36ms. Allocated memory is still 178.3MB. Free memory was 143.8MB in the beginning and 140.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 06:31:35,521 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 117.4MB. Free memory is still 71.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 151.30ms. Allocated memory is still 142.6MB. Free memory was 112.3MB in the beginning and 101.7MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.01ms. Allocated memory is still 142.6MB. Free memory was 101.7MB in the beginning and 100.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 16.01ms. Allocated memory is still 142.6MB. Free memory was 100.0MB in the beginning and 98.8MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 225.05ms. Allocated memory is still 142.6MB. Free memory was 98.8MB in the beginning and 87.9MB in the end (delta: 10.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2023.25ms. Allocated memory was 142.6MB in the beginning and 178.3MB in the end (delta: 35.7MB). Free memory was 87.0MB in the beginning and 143.8MB in the end (delta: -56.8MB). Peak memory consumption was 39.0MB. Max. memory is 16.1GB. * Witness Printer took 42.36ms. Allocated memory is still 178.3MB. Free memory was 143.8MB in the beginning and 140.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 43 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.0s, OverallIterations: 5, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 173 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 144 mSDsluCounter, 576 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 352 mSDsCounter, 124 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 596 IncrementalHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 124 mSolverCounterUnsat, 224 mSDtfsCounter, 596 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 104 GetRequests, 63 SyntacticMatches, 7 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=4, InterpolantAutomatonStates: 36, 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, 1674 HoareAnnotationTreeSize, 66 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 21 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 110 NumberOfCodeBlocks, 110 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 133 ConstructedInterpolants, 0 QuantifiedInterpolants, 912 SizeOfPredicates, 4 NumberOfNonLiveVariables, 77 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 46/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 <= tagbuf_len && ((0 == tagbuf_len && tagbuf_len == t) || !(tagbuf_len == 0))) && ((!(tagbuf_len + 1 <= 0) || 0 <= tagbuf_len) || tagbuf_len == 0)) && ((-1 * t <= 0 || ((-1 * t <= 0 || t == 0) && (((tagbuf_len == 0 || (!(0 == tagbuf_len) && 0 == t)) && t == 0) || t + -1 * tagbuf_len <= 0))) || t == 0)) && t == 0) || ((((((-1 * t <= 0 || ((-1 * t <= 0 || t == 0) && (((tagbuf_len == 0 || (!(0 == tagbuf_len) && 0 == t)) && t == 0) || t + -1 * tagbuf_len <= 0))) || t == 0) && 0 <= tagbuf_len + -1) && ((tagbuf_len + 1 <= 0 || t <= 1) || tagbuf_len <= 0)) && !(tagbuf_len == 0)) && (!(tagbuf_len + 1 <= 0) || 0 <= tagbuf_len))) || ((((-1 * t <= 0 || ((-1 * t <= 0 || t == 0) && (((tagbuf_len == 0 || (!(0 == tagbuf_len) && 0 == t)) && t == 0) || t + -1 * tagbuf_len <= 0))) || t == 0) && 0 <= tagbuf_len + -1) && t <= tagbuf_len) - InvariantResult [Line: 48]: Loop Invariant Derived loop invariant: (((((-1 * t <= 0 || t == 0) && 0 <= tagbuf_len + -1) && ((tagbuf_len + 1 <= 0 || t <= 1) || tagbuf_len <= 0)) && !(tagbuf_len == 0)) && (!(tagbuf_len + 1 <= 0) || 0 <= tagbuf_len)) || (((-1 * t <= 0 || t == 0) && 0 <= tagbuf_len + -1) && t <= tagbuf_len) - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2023-02-17 06:31:35,548 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