./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 26d01a9c 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.p+lhb-reducer.c -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 39feee77bf576ea852c42114836a4ed3182237f56346991038306ebcfd74e257 --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-18 00:16:14,449 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 00:16:14,450 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 00:16:14,482 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 00:16:14,483 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 00:16:14,484 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 00:16:14,485 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 00:16:14,486 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 00:16:14,487 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 00:16:14,488 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 00:16:14,488 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 00:16:14,489 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 00:16:14,490 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 00:16:14,490 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 00:16:14,491 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 00:16:14,492 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 00:16:14,493 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 00:16:14,493 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 00:16:14,495 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 00:16:14,496 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 00:16:14,497 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 00:16:14,498 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 00:16:14,498 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 00:16:14,499 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 00:16:14,502 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 00:16:14,502 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 00:16:14,502 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 00:16:14,503 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 00:16:14,503 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 00:16:14,504 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 00:16:14,504 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 00:16:14,505 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 00:16:14,505 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 00:16:14,506 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 00:16:14,507 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 00:16:14,507 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 00:16:14,508 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 00:16:14,508 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 00:16:14,508 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 00:16:14,509 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 00:16:14,509 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 00:16:14,510 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-18 00:16:14,528 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 00:16:14,529 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 00:16:14,529 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 00:16:14,529 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 00:16:14,530 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-18 00:16:14,530 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-18 00:16:14,531 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 00:16:14,531 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 00:16:14,531 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 00:16:14,531 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 00:16:14,531 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-18 00:16:14,532 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-18 00:16:14,532 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-18 00:16:14,532 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 00:16:14,532 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-18 00:16:14,533 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-18 00:16:14,533 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-18 00:16:14,533 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-18 00:16:14,533 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-18 00:16:14,534 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 00:16:14,534 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-18 00:16:14,534 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 00:16:14,534 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 00:16:14,534 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-18 00:16:14,534 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 00:16:14,535 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 00:16:14,535 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-18 00:16:14,535 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-18 00:16:14,535 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-18 00:16:14,535 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-18 00:16:14,536 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-18 00:16:14,536 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-18 00:16:14,536 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-18 00:16:14,536 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-18 00:16:14,536 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-18 00:16:14,536 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 -> 39feee77bf576ea852c42114836a4ed3182237f56346991038306ebcfd74e257 [2023-02-18 00:16:14,779 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 00:16:14,804 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 00:16:14,806 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 00:16:14,807 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 00:16:14,807 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 00:16:14,808 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.p+lhb-reducer.c [2023-02-18 00:16:15,957 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 00:16:16,145 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 00:16:16,146 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c [2023-02-18 00:16:16,153 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b2290ad3/cae65499fd414af4a34f9f0f116974ce/FLAG32cb5ec2d [2023-02-18 00:16:16,165 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b2290ad3/cae65499fd414af4a34f9f0f116974ce [2023-02-18 00:16:16,167 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 00:16:16,168 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 00:16:16,169 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 00:16:16,169 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 00:16:16,174 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 00:16:16,175 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 12:16:16" (1/1) ... [2023-02-18 00:16:16,176 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9c7019f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:16:16, skipping insertion in model container [2023-02-18 00:16:16,177 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 12:16:16" (1/1) ... [2023-02-18 00:16:16,183 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 00:16:16,226 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 00:16:16,381 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.p+lhb-reducer.c[919,932] [2023-02-18 00:16:16,388 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.p+lhb-reducer.c[1134,1147] [2023-02-18 00:16:16,403 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.p+lhb-reducer.c[2208,2221] [2023-02-18 00:16:16,406 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.p+lhb-reducer.c[2423,2436] [2023-02-18 00:16:16,409 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.p+lhb-reducer.c[2918,2931] [2023-02-18 00:16:16,410 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.p+lhb-reducer.c[3133,3146] [2023-02-18 00:16:16,414 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.p+lhb-reducer.c[3435,3448] [2023-02-18 00:16:16,416 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.p+lhb-reducer.c[3653,3666] [2023-02-18 00:16:16,417 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.p+lhb-reducer.c[3929,3942] [2023-02-18 00:16:16,418 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.p+lhb-reducer.c[4147,4160] [2023-02-18 00:16:16,421 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.p+lhb-reducer.c[4717,4730] [2023-02-18 00:16:16,422 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.p+lhb-reducer.c[4935,4948] [2023-02-18 00:16:16,462 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.p+lhb-reducer.c[15828,15841] [2023-02-18 00:16:16,465 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.p+lhb-reducer.c[16046,16059] [2023-02-18 00:16:16,474 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.p+lhb-reducer.c[16441,16454] [2023-02-18 00:16:16,475 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.p+lhb-reducer.c[16659,16672] [2023-02-18 00:16:16,487 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 00:16:16,496 INFO L203 MainTranslator]: Completed pre-run [2023-02-18 00:16:16,506 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.p+lhb-reducer.c[919,932] [2023-02-18 00:16:16,507 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.p+lhb-reducer.c[1134,1147] [2023-02-18 00:16:16,513 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.p+lhb-reducer.c[2208,2221] [2023-02-18 00:16:16,513 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.p+lhb-reducer.c[2423,2436] [2023-02-18 00:16:16,521 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.p+lhb-reducer.c[2918,2931] [2023-02-18 00:16:16,522 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.p+lhb-reducer.c[3133,3146] [2023-02-18 00:16:16,523 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.p+lhb-reducer.c[3435,3448] [2023-02-18 00:16:16,524 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.p+lhb-reducer.c[3653,3666] [2023-02-18 00:16:16,525 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.p+lhb-reducer.c[3929,3942] [2023-02-18 00:16:16,526 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.p+lhb-reducer.c[4147,4160] [2023-02-18 00:16:16,528 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.p+lhb-reducer.c[4717,4730] [2023-02-18 00:16:16,541 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.p+lhb-reducer.c[4935,4948] [2023-02-18 00:16:16,563 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.p+lhb-reducer.c[15828,15841] [2023-02-18 00:16:16,564 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.p+lhb-reducer.c[16046,16059] [2023-02-18 00:16:16,566 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.p+lhb-reducer.c[16441,16454] [2023-02-18 00:16:16,567 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.p+lhb-reducer.c[16659,16672] [2023-02-18 00:16:16,570 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 00:16:16,580 INFO L208 MainTranslator]: Completed translation [2023-02-18 00:16:16,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:16:16 WrapperNode [2023-02-18 00:16:16,581 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 00:16:16,582 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-18 00:16:16,582 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-18 00:16:16,582 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-18 00:16:16,588 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:16:16" (1/1) ... [2023-02-18 00:16:16,597 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:16:16" (1/1) ... [2023-02-18 00:16:16,628 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 590 [2023-02-18 00:16:16,629 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-18 00:16:16,629 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-18 00:16:16,629 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-18 00:16:16,630 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-18 00:16:16,637 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:16:16" (1/1) ... [2023-02-18 00:16:16,637 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:16:16" (1/1) ... [2023-02-18 00:16:16,641 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:16:16" (1/1) ... [2023-02-18 00:16:16,641 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:16:16" (1/1) ... [2023-02-18 00:16:16,648 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:16:16" (1/1) ... [2023-02-18 00:16:16,652 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:16:16" (1/1) ... [2023-02-18 00:16:16,653 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:16:16" (1/1) ... [2023-02-18 00:16:16,655 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:16:16" (1/1) ... [2023-02-18 00:16:16,658 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-18 00:16:16,659 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-18 00:16:16,659 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-18 00:16:16,659 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-18 00:16:16,660 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:16:16" (1/1) ... [2023-02-18 00:16:16,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 00:16:16,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 00:16:16,715 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-18 00:16:16,717 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-18 00:16:16,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-18 00:16:16,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-18 00:16:16,741 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-18 00:16:16,741 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-18 00:16:16,818 INFO L235 CfgBuilder]: Building ICFG [2023-02-18 00:16:16,825 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-18 00:16:17,224 INFO L276 CfgBuilder]: Performing block encoding [2023-02-18 00:16:17,234 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-18 00:16:17,234 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2023-02-18 00:16:17,236 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 12:16:17 BoogieIcfgContainer [2023-02-18 00:16:17,236 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-18 00:16:17,237 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-18 00:16:17,238 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-18 00:16:17,240 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-18 00:16:17,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 12:16:16" (1/3) ... [2023-02-18 00:16:17,241 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e4e9660 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 12:16:17, skipping insertion in model container [2023-02-18 00:16:17,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:16:16" (2/3) ... [2023-02-18 00:16:17,241 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e4e9660 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 12:16:17, skipping insertion in model container [2023-02-18 00:16:17,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 12:16:17" (3/3) ... [2023-02-18 00:16:17,242 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.p+lhb-reducer.c [2023-02-18 00:16:17,261 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-18 00:16:17,261 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2023-02-18 00:16:17,309 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-18 00:16:17,314 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;@1b9c3cb5, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-18 00:16:17,314 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-02-18 00:16:17,317 INFO L276 IsEmpty]: Start isEmpty. Operand has 120 states, 103 states have (on average 1.912621359223301) internal successors, (197), 119 states have internal predecessors, (197), 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-18 00:16:17,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-18 00:16:17,322 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:16:17,322 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-18 00:16:17,324 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-02-18 00:16:17,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:16:17,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1804934597, now seen corresponding path program 1 times [2023-02-18 00:16:17,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:16:17,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509663511] [2023-02-18 00:16:17,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:16:17,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:16:17,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:16:17,522 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-18 00:16:17,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:16:17,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509663511] [2023-02-18 00:16:17,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509663511] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 00:16:17,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 00:16:17,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 00:16:17,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777872861] [2023-02-18 00:16:17,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 00:16:17,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 00:16:17,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:16:17,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 00:16:17,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 00:16:17,564 INFO L87 Difference]: Start difference. First operand has 120 states, 103 states have (on average 1.912621359223301) internal successors, (197), 119 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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-18 00:16:17,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:16:17,840 INFO L93 Difference]: Finished difference Result 131 states and 205 transitions. [2023-02-18 00:16:17,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 00:16:17,842 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-02-18 00:16:17,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:16:17,856 INFO L225 Difference]: With dead ends: 131 [2023-02-18 00:16:17,856 INFO L226 Difference]: Without dead ends: 114 [2023-02-18 00:16:17,858 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-18 00:16:17,862 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 160 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 00:16:17,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 175 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 00:16:17,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-02-18 00:16:17,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2023-02-18 00:16:17,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 99 states have (on average 1.3636363636363635) internal successors, (135), 113 states have internal predecessors, (135), 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-18 00:16:17,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 135 transitions. [2023-02-18 00:16:17,911 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 135 transitions. Word has length 7 [2023-02-18 00:16:17,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:16:17,912 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 135 transitions. [2023-02-18 00:16:17,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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-18 00:16:17,913 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 135 transitions. [2023-02-18 00:16:17,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-18 00:16:17,913 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:16:17,913 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 00:16:17,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-18 00:16:17,914 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-02-18 00:16:17,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:16:17,915 INFO L85 PathProgramCache]: Analyzing trace with hash 118401710, now seen corresponding path program 1 times [2023-02-18 00:16:17,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:16:17,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26694433] [2023-02-18 00:16:17,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:16:17,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:16:17,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:16:18,086 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-18 00:16:18,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:16:18,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26694433] [2023-02-18 00:16:18,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26694433] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 00:16:18,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 00:16:18,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 00:16:18,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750389771] [2023-02-18 00:16:18,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 00:16:18,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 00:16:18,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:16:18,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 00:16:18,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-18 00:16:18,095 INFO L87 Difference]: Start difference. First operand 114 states and 135 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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-18 00:16:18,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:16:18,237 INFO L93 Difference]: Finished difference Result 114 states and 135 transitions. [2023-02-18 00:16:18,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 00:16:18,238 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-02-18 00:16:18,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:16:18,241 INFO L225 Difference]: With dead ends: 114 [2023-02-18 00:16:18,241 INFO L226 Difference]: Without dead ends: 109 [2023-02-18 00:16:18,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-02-18 00:16:18,243 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 32 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 00:16:18,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 268 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 00:16:18,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-02-18 00:16:18,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2023-02-18 00:16:18,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 95 states have (on average 1.2736842105263158) internal successors, (121), 108 states have internal predecessors, (121), 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-18 00:16:18,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 121 transitions. [2023-02-18 00:16:18,264 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 121 transitions. Word has length 8 [2023-02-18 00:16:18,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:16:18,264 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 121 transitions. [2023-02-18 00:16:18,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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-18 00:16:18,264 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 121 transitions. [2023-02-18 00:16:18,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-18 00:16:18,265 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:16:18,265 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 00:16:18,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-18 00:16:18,265 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-02-18 00:16:18,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:16:18,266 INFO L85 PathProgramCache]: Analyzing trace with hash -639549266, now seen corresponding path program 1 times [2023-02-18 00:16:18,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:16:18,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242168026] [2023-02-18 00:16:18,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:16:18,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:16:18,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:16:18,330 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-18 00:16:18,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:16:18,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242168026] [2023-02-18 00:16:18,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242168026] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 00:16:18,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 00:16:18,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 00:16:18,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510313372] [2023-02-18 00:16:18,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 00:16:18,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 00:16:18,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:16:18,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 00:16:18,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 00:16:18,333 INFO L87 Difference]: Start difference. First operand 109 states and 121 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 00:16:18,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:16:18,500 INFO L93 Difference]: Finished difference Result 109 states and 121 transitions. [2023-02-18 00:16:18,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 00:16:18,500 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-02-18 00:16:18,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:16:18,503 INFO L225 Difference]: With dead ends: 109 [2023-02-18 00:16:18,503 INFO L226 Difference]: Without dead ends: 107 [2023-02-18 00:16:18,503 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-18 00:16:18,506 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 93 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 00:16:18,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 101 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 00:16:18,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-02-18 00:16:18,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2023-02-18 00:16:18,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 94 states have (on average 1.2659574468085106) internal successors, (119), 106 states have internal predecessors, (119), 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-18 00:16:18,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 119 transitions. [2023-02-18 00:16:18,521 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 119 transitions. Word has length 11 [2023-02-18 00:16:18,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:16:18,522 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 119 transitions. [2023-02-18 00:16:18,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 00:16:18,522 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 119 transitions. [2023-02-18 00:16:18,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-18 00:16:18,522 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:16:18,522 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 00:16:18,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-18 00:16:18,522 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-02-18 00:16:18,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:16:18,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1648813321, now seen corresponding path program 1 times [2023-02-18 00:16:18,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:16:18,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277429394] [2023-02-18 00:16:18,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:16:18,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:16:18,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:16:18,569 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-18 00:16:18,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:16:18,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277429394] [2023-02-18 00:16:18,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277429394] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 00:16:18,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 00:16:18,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 00:16:18,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419322178] [2023-02-18 00:16:18,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 00:16:18,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 00:16:18,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:16:18,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 00:16:18,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 00:16:18,571 INFO L87 Difference]: Start difference. First operand 107 states and 119 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-18 00:16:18,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:16:18,661 INFO L93 Difference]: Finished difference Result 107 states and 119 transitions. [2023-02-18 00:16:18,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 00:16:18,662 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-02-18 00:16:18,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:16:18,663 INFO L225 Difference]: With dead ends: 107 [2023-02-18 00:16:18,663 INFO L226 Difference]: Without dead ends: 103 [2023-02-18 00:16:18,663 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-18 00:16:18,666 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 11 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 00:16:18,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 242 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 00:16:18,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-02-18 00:16:18,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2023-02-18 00:16:18,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 91 states have (on average 1.2637362637362637) internal successors, (115), 102 states have internal predecessors, (115), 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-18 00:16:18,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 115 transitions. [2023-02-18 00:16:18,679 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 115 transitions. Word has length 12 [2023-02-18 00:16:18,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:16:18,679 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 115 transitions. [2023-02-18 00:16:18,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-18 00:16:18,680 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2023-02-18 00:16:18,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-18 00:16:18,680 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:16:18,680 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 00:16:18,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-18 00:16:18,680 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-02-18 00:16:18,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:16:18,681 INFO L85 PathProgramCache]: Analyzing trace with hash -411248735, now seen corresponding path program 1 times [2023-02-18 00:16:18,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:16:18,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810735578] [2023-02-18 00:16:18,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:16:18,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:16:18,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:16:18,775 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-18 00:16:18,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:16:18,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810735578] [2023-02-18 00:16:18,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810735578] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 00:16:18,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 00:16:18,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 00:16:18,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818953406] [2023-02-18 00:16:18,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 00:16:18,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 00:16:18,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:16:18,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 00:16:18,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 00:16:18,778 INFO L87 Difference]: Start difference. First operand 103 states and 115 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-18 00:16:18,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:16:18,945 INFO L93 Difference]: Finished difference Result 121 states and 135 transitions. [2023-02-18 00:16:18,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 00:16:18,945 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-02-18 00:16:18,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:16:18,946 INFO L225 Difference]: With dead ends: 121 [2023-02-18 00:16:18,946 INFO L226 Difference]: Without dead ends: 119 [2023-02-18 00:16:18,947 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-18 00:16:18,947 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 112 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 00:16:18,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 111 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 00:16:18,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-02-18 00:16:18,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 101. [2023-02-18 00:16:18,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 90 states have (on average 1.2555555555555555) internal successors, (113), 100 states have internal predecessors, (113), 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-18 00:16:18,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 113 transitions. [2023-02-18 00:16:18,953 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 113 transitions. Word has length 13 [2023-02-18 00:16:18,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:16:18,953 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 113 transitions. [2023-02-18 00:16:18,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-18 00:16:18,954 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 113 transitions. [2023-02-18 00:16:18,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-18 00:16:18,955 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:16:18,955 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 00:16:18,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-18 00:16:18,956 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-02-18 00:16:18,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:16:18,956 INFO L85 PathProgramCache]: Analyzing trace with hash -409524831, now seen corresponding path program 1 times [2023-02-18 00:16:18,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:16:18,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453929647] [2023-02-18 00:16:18,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:16:18,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:16:18,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:16:19,008 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-18 00:16:19,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:16:19,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453929647] [2023-02-18 00:16:19,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453929647] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 00:16:19,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 00:16:19,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 00:16:19,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438962849] [2023-02-18 00:16:19,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 00:16:19,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 00:16:19,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:16:19,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 00:16:19,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 00:16:19,010 INFO L87 Difference]: Start difference. First operand 101 states and 113 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-18 00:16:19,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:16:19,171 INFO L93 Difference]: Finished difference Result 101 states and 113 transitions. [2023-02-18 00:16:19,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 00:16:19,172 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-02-18 00:16:19,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:16:19,173 INFO L225 Difference]: With dead ends: 101 [2023-02-18 00:16:19,173 INFO L226 Difference]: Without dead ends: 99 [2023-02-18 00:16:19,173 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-18 00:16:19,174 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 83 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 00:16:19,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 83 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 00:16:19,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-02-18 00:16:19,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2023-02-18 00:16:19,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 89 states have (on average 1.247191011235955) internal successors, (111), 98 states have internal predecessors, (111), 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-18 00:16:19,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2023-02-18 00:16:19,177 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 13 [2023-02-18 00:16:19,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:16:19,177 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2023-02-18 00:16:19,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-18 00:16:19,178 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2023-02-18 00:16:19,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-18 00:16:19,178 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:16:19,178 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 00:16:19,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-18 00:16:19,179 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-02-18 00:16:19,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:16:19,179 INFO L85 PathProgramCache]: Analyzing trace with hash 136195212, now seen corresponding path program 1 times [2023-02-18 00:16:19,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:16:19,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719144168] [2023-02-18 00:16:19,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:16:19,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:16:19,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:16:19,262 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-18 00:16:19,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:16:19,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719144168] [2023-02-18 00:16:19,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719144168] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 00:16:19,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 00:16:19,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-18 00:16:19,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789777879] [2023-02-18 00:16:19,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 00:16:19,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 00:16:19,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:16:19,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 00:16:19,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-18 00:16:19,264 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 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-18 00:16:19,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:16:19,476 INFO L93 Difference]: Finished difference Result 136 states and 152 transitions. [2023-02-18 00:16:19,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-18 00:16:19,477 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-02-18 00:16:19,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:16:19,478 INFO L225 Difference]: With dead ends: 136 [2023-02-18 00:16:19,478 INFO L226 Difference]: Without dead ends: 134 [2023-02-18 00:16:19,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-18 00:16:19,478 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 47 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 00:16:19,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 296 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 00:16:19,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-02-18 00:16:19,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 105. [2023-02-18 00:16:19,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 95 states have (on average 1.2526315789473683) internal successors, (119), 104 states have internal predecessors, (119), 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-18 00:16:19,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2023-02-18 00:16:19,482 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 14 [2023-02-18 00:16:19,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:16:19,483 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2023-02-18 00:16:19,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 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-18 00:16:19,483 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2023-02-18 00:16:19,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-18 00:16:19,483 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:16:19,483 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 00:16:19,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-18 00:16:19,484 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-02-18 00:16:19,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:16:19,484 INFO L85 PathProgramCache]: Analyzing trace with hash 137742357, now seen corresponding path program 1 times [2023-02-18 00:16:19,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:16:19,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708339562] [2023-02-18 00:16:19,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:16:19,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:16:19,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:16:19,521 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-18 00:16:19,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:16:19,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708339562] [2023-02-18 00:16:19,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708339562] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 00:16:19,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 00:16:19,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 00:16:19,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792439109] [2023-02-18 00:16:19,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 00:16:19,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 00:16:19,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:16:19,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 00:16:19,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 00:16:19,522 INFO L87 Difference]: Start difference. First operand 105 states and 119 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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-18 00:16:19,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:16:19,684 INFO L93 Difference]: Finished difference Result 126 states and 142 transitions. [2023-02-18 00:16:19,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 00:16:19,687 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-02-18 00:16:19,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:16:19,687 INFO L225 Difference]: With dead ends: 126 [2023-02-18 00:16:19,687 INFO L226 Difference]: Without dead ends: 124 [2023-02-18 00:16:19,688 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-18 00:16:19,688 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 103 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 00:16:19,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 103 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 00:16:19,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-02-18 00:16:19,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 103. [2023-02-18 00:16:19,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 94 states have (on average 1.2446808510638299) internal successors, (117), 102 states have internal predecessors, (117), 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-18 00:16:19,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 117 transitions. [2023-02-18 00:16:19,692 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 117 transitions. Word has length 14 [2023-02-18 00:16:19,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:16:19,692 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 117 transitions. [2023-02-18 00:16:19,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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-18 00:16:19,692 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 117 transitions. [2023-02-18 00:16:19,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-18 00:16:19,692 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:16:19,692 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 00:16:19,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-18 00:16:19,693 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-02-18 00:16:19,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:16:19,693 INFO L85 PathProgramCache]: Analyzing trace with hash 189636292, now seen corresponding path program 1 times [2023-02-18 00:16:19,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:16:19,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816336278] [2023-02-18 00:16:19,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:16:19,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:16:19,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:16:19,825 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-18 00:16:19,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:16:19,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816336278] [2023-02-18 00:16:19,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816336278] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 00:16:19,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 00:16:19,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-18 00:16:19,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708803857] [2023-02-18 00:16:19,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 00:16:19,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 00:16:19,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:16:19,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 00:16:19,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-18 00:16:19,827 INFO L87 Difference]: Start difference. First operand 103 states and 117 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 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-18 00:16:20,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:16:20,013 INFO L93 Difference]: Finished difference Result 113 states and 127 transitions. [2023-02-18 00:16:20,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 00:16:20,013 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-02-18 00:16:20,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:16:20,014 INFO L225 Difference]: With dead ends: 113 [2023-02-18 00:16:20,014 INFO L226 Difference]: Without dead ends: 109 [2023-02-18 00:16:20,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-18 00:16:20,015 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 17 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 00:16:20,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 245 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 00:16:20,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-02-18 00:16:20,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 104. [2023-02-18 00:16:20,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 95 states have (on average 1.2421052631578948) internal successors, (118), 103 states have internal predecessors, (118), 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-18 00:16:20,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 118 transitions. [2023-02-18 00:16:20,018 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 118 transitions. Word has length 14 [2023-02-18 00:16:20,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:16:20,018 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 118 transitions. [2023-02-18 00:16:20,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 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-18 00:16:20,018 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 118 transitions. [2023-02-18 00:16:20,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-18 00:16:20,019 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:16:20,019 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 00:16:20,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-18 00:16:20,019 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-02-18 00:16:20,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:16:20,020 INFO L85 PathProgramCache]: Analyzing trace with hash -24950085, now seen corresponding path program 1 times [2023-02-18 00:16:20,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:16:20,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528761591] [2023-02-18 00:16:20,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:16:20,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:16:20,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:16:20,082 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-18 00:16:20,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:16:20,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528761591] [2023-02-18 00:16:20,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528761591] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 00:16:20,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 00:16:20,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-18 00:16:20,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804129676] [2023-02-18 00:16:20,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 00:16:20,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 00:16:20,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:16:20,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 00:16:20,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-18 00:16:20,083 INFO L87 Difference]: Start difference. First operand 104 states and 118 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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-18 00:16:20,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:16:20,244 INFO L93 Difference]: Finished difference Result 131 states and 147 transitions. [2023-02-18 00:16:20,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-18 00:16:20,244 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-02-18 00:16:20,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:16:20,245 INFO L225 Difference]: With dead ends: 131 [2023-02-18 00:16:20,245 INFO L226 Difference]: Without dead ends: 129 [2023-02-18 00:16:20,245 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-18 00:16:20,246 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 38 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 00:16:20,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 274 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 00:16:20,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-02-18 00:16:20,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 107. [2023-02-18 00:16:20,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 98 states have (on average 1.2346938775510203) internal successors, (121), 106 states have internal predecessors, (121), 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-18 00:16:20,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 121 transitions. [2023-02-18 00:16:20,250 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 121 transitions. Word has length 15 [2023-02-18 00:16:20,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:16:20,250 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 121 transitions. [2023-02-18 00:16:20,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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-18 00:16:20,250 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 121 transitions. [2023-02-18 00:16:20,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-18 00:16:20,251 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:16:20,251 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 00:16:20,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-18 00:16:20,251 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-02-18 00:16:20,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:16:20,252 INFO L85 PathProgramCache]: Analyzing trace with hash 2034707599, now seen corresponding path program 1 times [2023-02-18 00:16:20,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:16:20,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241877693] [2023-02-18 00:16:20,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:16:20,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:16:20,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:16:20,282 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-18 00:16:20,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:16:20,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241877693] [2023-02-18 00:16:20,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241877693] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 00:16:20,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 00:16:20,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 00:16:20,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003778755] [2023-02-18 00:16:20,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 00:16:20,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 00:16:20,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:16:20,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 00:16:20,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 00:16:20,284 INFO L87 Difference]: Start difference. First operand 107 states and 121 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 00:16:20,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:16:20,326 INFO L93 Difference]: Finished difference Result 107 states and 121 transitions. [2023-02-18 00:16:20,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 00:16:20,327 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-02-18 00:16:20,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:16:20,327 INFO L225 Difference]: With dead ends: 107 [2023-02-18 00:16:20,327 INFO L226 Difference]: Without dead ends: 105 [2023-02-18 00:16:20,328 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-18 00:16:20,328 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 97 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 00:16:20,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 138 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 00:16:20,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-02-18 00:16:20,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2023-02-18 00:16:20,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 97 states have (on average 1.2268041237113403) internal successors, (119), 104 states have internal predecessors, (119), 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-18 00:16:20,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2023-02-18 00:16:20,332 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 16 [2023-02-18 00:16:20,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:16:20,333 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2023-02-18 00:16:20,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 00:16:20,333 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2023-02-18 00:16:20,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-18 00:16:20,334 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:16:20,334 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 00:16:20,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-18 00:16:20,334 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-02-18 00:16:20,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:16:20,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1348569745, now seen corresponding path program 1 times [2023-02-18 00:16:20,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:16:20,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835220462] [2023-02-18 00:16:20,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:16:20,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:16:20,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:16:20,377 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-18 00:16:20,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:16:20,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835220462] [2023-02-18 00:16:20,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835220462] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 00:16:20,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 00:16:20,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 00:16:20,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760363802] [2023-02-18 00:16:20,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 00:16:20,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 00:16:20,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:16:20,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 00:16:20,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 00:16:20,379 INFO L87 Difference]: Start difference. First operand 105 states and 119 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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-18 00:16:20,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:16:20,454 INFO L93 Difference]: Finished difference Result 105 states and 119 transitions. [2023-02-18 00:16:20,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 00:16:20,455 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-02-18 00:16:20,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:16:20,455 INFO L225 Difference]: With dead ends: 105 [2023-02-18 00:16:20,455 INFO L226 Difference]: Without dead ends: 101 [2023-02-18 00:16:20,456 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-18 00:16:20,456 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 6 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 00:16:20,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 214 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 00:16:20,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-02-18 00:16:20,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2023-02-18 00:16:20,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 94 states have (on average 1.2234042553191489) internal successors, (115), 100 states have internal predecessors, (115), 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-18 00:16:20,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 115 transitions. [2023-02-18 00:16:20,460 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 115 transitions. Word has length 17 [2023-02-18 00:16:20,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:16:20,461 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 115 transitions. [2023-02-18 00:16:20,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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-18 00:16:20,461 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 115 transitions. [2023-02-18 00:16:20,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-18 00:16:20,461 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:16:20,461 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 00:16:20,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-18 00:16:20,462 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-02-18 00:16:20,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:16:20,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1418456853, now seen corresponding path program 1 times [2023-02-18 00:16:20,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:16:20,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631632312] [2023-02-18 00:16:20,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:16:20,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:16:20,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:16:20,523 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-18 00:16:20,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:16:20,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631632312] [2023-02-18 00:16:20,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631632312] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 00:16:20,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 00:16:20,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-18 00:16:20,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727392892] [2023-02-18 00:16:20,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 00:16:20,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 00:16:20,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:16:20,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 00:16:20,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-18 00:16:20,525 INFO L87 Difference]: Start difference. First operand 101 states and 115 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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-18 00:16:20,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:16:20,682 INFO L93 Difference]: Finished difference Result 116 states and 132 transitions. [2023-02-18 00:16:20,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 00:16:20,682 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-02-18 00:16:20,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:16:20,683 INFO L225 Difference]: With dead ends: 116 [2023-02-18 00:16:20,683 INFO L226 Difference]: Without dead ends: 114 [2023-02-18 00:16:20,683 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-02-18 00:16:20,684 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 155 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 00:16:20,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 57 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 00:16:20,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-02-18 00:16:20,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 97. [2023-02-18 00:16:20,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 91 states have (on average 1.2197802197802199) internal successors, (111), 96 states have internal predecessors, (111), 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-18 00:16:20,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 111 transitions. [2023-02-18 00:16:20,688 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 111 transitions. Word has length 18 [2023-02-18 00:16:20,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:16:20,688 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 111 transitions. [2023-02-18 00:16:20,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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-18 00:16:20,688 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 111 transitions. [2023-02-18 00:16:20,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-18 00:16:20,688 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:16:20,689 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 00:16:20,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-18 00:16:20,689 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-02-18 00:16:20,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:16:20,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1471897933, now seen corresponding path program 1 times [2023-02-18 00:16:20,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:16:20,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733026360] [2023-02-18 00:16:20,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:16:20,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:16:20,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:16:20,743 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-18 00:16:20,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:16:20,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733026360] [2023-02-18 00:16:20,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733026360] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 00:16:20,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 00:16:20,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-18 00:16:20,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216433726] [2023-02-18 00:16:20,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 00:16:20,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 00:16:20,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:16:20,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 00:16:20,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-18 00:16:20,745 INFO L87 Difference]: Start difference. First operand 97 states and 111 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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-18 00:16:20,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:16:20,876 INFO L93 Difference]: Finished difference Result 97 states and 111 transitions. [2023-02-18 00:16:20,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 00:16:20,877 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-02-18 00:16:20,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:16:20,877 INFO L225 Difference]: With dead ends: 97 [2023-02-18 00:16:20,877 INFO L226 Difference]: Without dead ends: 93 [2023-02-18 00:16:20,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-02-18 00:16:20,878 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 129 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 00:16:20,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 44 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 00:16:20,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-02-18 00:16:20,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2023-02-18 00:16:20,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 88 states have (on average 1.2159090909090908) internal successors, (107), 92 states have internal predecessors, (107), 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-18 00:16:20,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 107 transitions. [2023-02-18 00:16:20,882 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 107 transitions. Word has length 18 [2023-02-18 00:16:20,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:16:20,882 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 107 transitions. [2023-02-18 00:16:20,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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-18 00:16:20,882 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 107 transitions. [2023-02-18 00:16:20,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-18 00:16:20,882 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:16:20,882 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 00:16:20,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-18 00:16:20,883 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-02-18 00:16:20,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:16:20,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1159129958, now seen corresponding path program 1 times [2023-02-18 00:16:20,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:16:20,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572724749] [2023-02-18 00:16:20,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:16:20,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:16:20,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:16:20,944 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-18 00:16:20,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:16:20,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572724749] [2023-02-18 00:16:20,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572724749] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 00:16:20,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 00:16:20,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-18 00:16:20,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40097834] [2023-02-18 00:16:20,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 00:16:20,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 00:16:20,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:16:20,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 00:16:20,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-18 00:16:20,946 INFO L87 Difference]: Start difference. First operand 93 states and 107 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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-18 00:16:21,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:16:21,088 INFO L93 Difference]: Finished difference Result 103 states and 119 transitions. [2023-02-18 00:16:21,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 00:16:21,089 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-02-18 00:16:21,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:16:21,089 INFO L225 Difference]: With dead ends: 103 [2023-02-18 00:16:21,089 INFO L226 Difference]: Without dead ends: 54 [2023-02-18 00:16:21,091 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-02-18 00:16:21,092 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 135 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 00:16:21,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 47 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 00:16:21,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-02-18 00:16:21,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2023-02-18 00:16:21,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 50 states have (on average 1.08) internal successors, (54), 53 states have internal predecessors, (54), 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-18 00:16:21,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2023-02-18 00:16:21,095 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 18 [2023-02-18 00:16:21,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:16:21,095 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2023-02-18 00:16:21,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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-18 00:16:21,095 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2023-02-18 00:16:21,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-18 00:16:21,098 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:16:21,098 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 00:16:21,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-02-18 00:16:21,098 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-02-18 00:16:21,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:16:21,099 INFO L85 PathProgramCache]: Analyzing trace with hash 892497877, now seen corresponding path program 1 times [2023-02-18 00:16:21,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:16:21,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498364923] [2023-02-18 00:16:21,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:16:21,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:16:21,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:16:21,274 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-18 00:16:21,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:16:21,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498364923] [2023-02-18 00:16:21,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498364923] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 00:16:21,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 00:16:21,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-02-18 00:16:21,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293431294] [2023-02-18 00:16:21,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 00:16:21,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-18 00:16:21,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:16:21,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-18 00:16:21,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2023-02-18 00:16:21,278 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 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-18 00:16:21,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:16:21,384 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2023-02-18 00:16:21,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-18 00:16:21,384 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2023-02-18 00:16:21,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:16:21,386 INFO L225 Difference]: With dead ends: 54 [2023-02-18 00:16:21,386 INFO L226 Difference]: Without dead ends: 52 [2023-02-18 00:16:21,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2023-02-18 00:16:21,387 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 23 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 00:16:21,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 29 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 00:16:21,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-02-18 00:16:21,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2023-02-18 00:16:21,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 51 states have internal predecessors, (52), 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-18 00:16:21,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2023-02-18 00:16:21,390 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 44 [2023-02-18 00:16:21,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:16:21,390 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2023-02-18 00:16:21,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 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-18 00:16:21,390 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2023-02-18 00:16:21,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-18 00:16:21,391 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:16:21,391 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 00:16:21,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-02-18 00:16:21,391 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-02-18 00:16:21,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:16:21,391 INFO L85 PathProgramCache]: Analyzing trace with hash 892513765, now seen corresponding path program 1 times [2023-02-18 00:16:21,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:16:21,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842942066] [2023-02-18 00:16:21,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:16:21,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:16:21,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:16:21,565 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-18 00:16:21,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:16:21,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842942066] [2023-02-18 00:16:21,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842942066] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 00:16:21,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 00:16:21,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-02-18 00:16:21,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830534326] [2023-02-18 00:16:21,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 00:16:21,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-18 00:16:21,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:16:21,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-18 00:16:21,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2023-02-18 00:16:21,567 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 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-18 00:16:21,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:16:21,671 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2023-02-18 00:16:21,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-18 00:16:21,672 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2023-02-18 00:16:21,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:16:21,672 INFO L225 Difference]: With dead ends: 59 [2023-02-18 00:16:21,672 INFO L226 Difference]: Without dead ends: 57 [2023-02-18 00:16:21,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2023-02-18 00:16:21,673 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 42 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 00:16:21,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 27 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 00:16:21,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-02-18 00:16:21,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 50. [2023-02-18 00:16:21,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 49 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 00:16:21,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2023-02-18 00:16:21,676 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 44 [2023-02-18 00:16:21,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:16:21,676 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2023-02-18 00:16:21,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 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-18 00:16:21,676 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2023-02-18 00:16:21,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-18 00:16:21,677 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:16:21,677 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 00:16:21,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-02-18 00:16:21,677 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-02-18 00:16:21,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:16:21,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1897634854, now seen corresponding path program 1 times [2023-02-18 00:16:21,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:16:21,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422185660] [2023-02-18 00:16:21,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:16:21,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:16:21,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:16:21,961 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-18 00:16:21,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:16:21,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422185660] [2023-02-18 00:16:21,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422185660] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 00:16:21,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 00:16:21,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-18 00:16:21,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696517897] [2023-02-18 00:16:21,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 00:16:21,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-18 00:16:21,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:16:21,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-18 00:16:21,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-18 00:16:21,964 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 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-18 00:16:22,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:16:22,027 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2023-02-18 00:16:22,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 00:16:22,028 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2023-02-18 00:16:22,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:16:22,028 INFO L225 Difference]: With dead ends: 50 [2023-02-18 00:16:22,029 INFO L226 Difference]: Without dead ends: 46 [2023-02-18 00:16:22,030 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-02-18 00:16:22,030 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 38 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 00:16:22,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 14 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 00:16:22,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-02-18 00:16:22,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2023-02-18 00:16:22,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 45 states have internal predecessors, (46), 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-18 00:16:22,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2023-02-18 00:16:22,033 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 45 [2023-02-18 00:16:22,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:16:22,033 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2023-02-18 00:16:22,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 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-18 00:16:22,033 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2023-02-18 00:16:22,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-18 00:16:22,034 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:16:22,034 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 00:16:22,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-02-18 00:16:22,035 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-02-18 00:16:22,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:16:22,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1898127398, now seen corresponding path program 1 times [2023-02-18 00:16:22,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:16:22,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021862194] [2023-02-18 00:16:22,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:16:22,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:16:22,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:16:22,326 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-18 00:16:22,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:16:22,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021862194] [2023-02-18 00:16:22,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021862194] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 00:16:22,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 00:16:22,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-18 00:16:22,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760381734] [2023-02-18 00:16:22,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 00:16:22,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-18 00:16:22,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:16:22,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-18 00:16:22,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-18 00:16:22,330 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 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-18 00:16:22,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:16:22,411 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2023-02-18 00:16:22,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 00:16:22,412 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2023-02-18 00:16:22,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:16:22,412 INFO L225 Difference]: With dead ends: 50 [2023-02-18 00:16:22,412 INFO L226 Difference]: Without dead ends: 0 [2023-02-18 00:16:22,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-02-18 00:16:22,413 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 10 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 00:16:22,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 15 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 00:16:22,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-18 00:16:22,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-18 00:16:22,414 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-18 00:16:22,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-18 00:16:22,414 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2023-02-18 00:16:22,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:16:22,414 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-18 00:16:22,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 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-18 00:16:22,415 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-18 00:16:22,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-18 00:16:22,418 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (15 of 16 remaining) [2023-02-18 00:16:22,418 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (14 of 16 remaining) [2023-02-18 00:16:22,418 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (13 of 16 remaining) [2023-02-18 00:16:22,419 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (12 of 16 remaining) [2023-02-18 00:16:22,419 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (11 of 16 remaining) [2023-02-18 00:16:22,419 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (10 of 16 remaining) [2023-02-18 00:16:22,419 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (9 of 16 remaining) [2023-02-18 00:16:22,419 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (8 of 16 remaining) [2023-02-18 00:16:22,419 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (7 of 16 remaining) [2023-02-18 00:16:22,420 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (6 of 16 remaining) [2023-02-18 00:16:22,420 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (5 of 16 remaining) [2023-02-18 00:16:22,420 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (4 of 16 remaining) [2023-02-18 00:16:22,420 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (3 of 16 remaining) [2023-02-18 00:16:22,420 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (2 of 16 remaining) [2023-02-18 00:16:22,420 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION (1 of 16 remaining) [2023-02-18 00:16:22,422 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION (0 of 16 remaining) [2023-02-18 00:16:22,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-02-18 00:16:22,424 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-18 00:16:22,430 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 48) no Hoare annotation was computed. [2023-02-18 00:16:22,430 INFO L899 garLoopResultBuilder]: For program point L217(lines 217 229) no Hoare annotation was computed. [2023-02-18 00:16:22,431 INFO L899 garLoopResultBuilder]: For program point L597(lines 597 969) no Hoare annotation was computed. [2023-02-18 00:16:22,431 INFO L899 garLoopResultBuilder]: For program point L366(lines 366 991) no Hoare annotation was computed. [2023-02-18 00:16:22,431 INFO L899 garLoopResultBuilder]: For program point L267(lines 267 275) no Hoare annotation was computed. [2023-02-18 00:16:22,432 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 883) no Hoare annotation was computed. [2023-02-18 00:16:22,432 INFO L899 garLoopResultBuilder]: For program point L581(lines 581 971) no Hoare annotation was computed. [2023-02-18 00:16:22,432 INFO L899 garLoopResultBuilder]: For program point L36(line 36) no Hoare annotation was computed. [2023-02-18 00:16:22,432 INFO L899 garLoopResultBuilder]: For program point L895(line 895) no Hoare annotation was computed. [2023-02-18 00:16:22,432 INFO L899 garLoopResultBuilder]: For program point L317(lines 317 994) no Hoare annotation was computed. [2023-02-18 00:16:22,433 INFO L899 garLoopResultBuilder]: For program point L185(line 185) no Hoare annotation was computed. [2023-02-18 00:16:22,433 INFO L902 garLoopResultBuilder]: At program point L53(lines 22 1005) the Hoare annotation is: true [2023-02-18 00:16:22,433 INFO L899 garLoopResultBuilder]: For program point L400(lines 400 424) no Hoare annotation was computed. [2023-02-18 00:16:22,433 INFO L899 garLoopResultBuilder]: For program point L136(lines 136 242) no Hoare annotation was computed. [2023-02-18 00:16:22,433 INFO L899 garLoopResultBuilder]: For program point L103(lines 103 125) no Hoare annotation was computed. [2023-02-18 00:16:22,433 INFO L899 garLoopResultBuilder]: For program point L615(lines 615 626) no Hoare annotation was computed. [2023-02-18 00:16:22,433 INFO L899 garLoopResultBuilder]: For program point L929(lines 929 941) no Hoare annotation was computed. [2023-02-18 00:16:22,437 INFO L895 garLoopResultBuilder]: At program point L863(lines 858 947) the Hoare annotation is: (let ((.cse3 (<= |ULTIMATE.start_main_~main__t~0#1| |ULTIMATE.start_main_~main__tagbuf_len~0#1|)) (.cse2 (* (- 1) |ULTIMATE.start_main_~main__t~0#1|))) (let ((.cse0 (let ((.cse4 (<= 0 (+ (- 1) |ULTIMATE.start_main_~main__t~0#1|))) (.cse5 (<= 0 |ULTIMATE.start_main_~main__tagbuf_len~0#1|)) (.cse6 (<= 0 (+ (- 9) |ULTIMATE.start_main_~main__t~0#1|))) (.cse7 (let ((.cse8 (<= .cse2 0))) (or (and (= |ULTIMATE.start_main_~main__t~0#1| 0) (not .cse8)) .cse8)))) (or (and .cse4 .cse5 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~50#1| 0)) .cse3 .cse6 .cse7) (and .cse4 .cse5 .cse3 .cse6 .cse7)))) (.cse1 (or (not (<= (+ .cse2 |ULTIMATE.start_main_~main__tagbuf_len~0#1|) 0)) (not (<= (+ .cse2 |ULTIMATE.start_main_~main__tagbuf_len~0#1| 1) 0)) .cse3))) (or (and .cse0 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~51#1| 0)) .cse1) (and .cse0 .cse1)))) [2023-02-18 00:16:22,437 INFO L899 garLoopResultBuilder]: For program point L219(line 219) no Hoare annotation was computed. [2023-02-18 00:16:22,437 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 269) no Hoare annotation was computed. [2023-02-18 00:16:22,438 INFO L899 garLoopResultBuilder]: For program point L665(lines 665 963) no Hoare annotation was computed. [2023-02-18 00:16:22,438 INFO L899 garLoopResultBuilder]: For program point L434(lines 434 985) no Hoare annotation was computed. [2023-02-18 00:16:22,439 INFO L899 garLoopResultBuilder]: For program point L269(line 269) no Hoare annotation was computed. [2023-02-18 00:16:22,439 INFO L899 garLoopResultBuilder]: For program point L649(lines 649 965) no Hoare annotation was computed. [2023-02-18 00:16:22,440 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 173) no Hoare annotation was computed. [2023-02-18 00:16:22,440 INFO L899 garLoopResultBuilder]: For program point L385(lines 385 988) no Hoare annotation was computed. [2023-02-18 00:16:22,440 INFO L899 garLoopResultBuilder]: For program point L22(lines 22 1005) no Hoare annotation was computed. [2023-02-18 00:16:22,440 INFO L899 garLoopResultBuilder]: For program point L468(lines 468 492) no Hoare annotation was computed. [2023-02-18 00:16:22,441 INFO L899 garLoopResultBuilder]: For program point L881(lines 881 907) no Hoare annotation was computed. [2023-02-18 00:16:22,441 INFO L899 garLoopResultBuilder]: For program point L171(lines 171 193) no Hoare annotation was computed. [2023-02-18 00:16:22,441 INFO L899 garLoopResultBuilder]: For program point L683(lines 683 694) no Hoare annotation was computed. [2023-02-18 00:16:22,441 INFO L899 garLoopResultBuilder]: For program point L105(line 105) no Hoare annotation was computed. [2023-02-18 00:16:22,441 INFO L899 garLoopResultBuilder]: For program point L72(lines 72 288) no Hoare annotation was computed. [2023-02-18 00:16:22,441 INFO L899 garLoopResultBuilder]: For program point L931(line 931) no Hoare annotation was computed. [2023-02-18 00:16:22,442 INFO L899 garLoopResultBuilder]: For program point L733(lines 733 957) no Hoare annotation was computed. [2023-02-18 00:16:22,442 INFO L899 garLoopResultBuilder]: For program point L155(lines 155 234) no Hoare annotation was computed. [2023-02-18 00:16:22,442 INFO L899 garLoopResultBuilder]: For program point L502(lines 502 979) no Hoare annotation was computed. [2023-02-18 00:16:22,442 INFO L899 garLoopResultBuilder]: For program point L205(lines 205 231) no Hoare annotation was computed. [2023-02-18 00:16:22,443 INFO L899 garLoopResultBuilder]: For program point L717(lines 717 959) no Hoare annotation was computed. [2023-02-18 00:16:22,443 INFO L899 garLoopResultBuilder]: For program point L453(lines 453 982) no Hoare annotation was computed. [2023-02-18 00:16:22,443 INFO L899 garLoopResultBuilder]: For program point L866(lines 866 946) no Hoare annotation was computed. [2023-02-18 00:16:22,443 INFO L899 garLoopResultBuilder]: For program point L255(lines 255 277) no Hoare annotation was computed. [2023-02-18 00:16:22,443 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 207) no Hoare annotation was computed. [2023-02-18 00:16:22,443 INFO L899 garLoopResultBuilder]: For program point L536(lines 536 560) no Hoare annotation was computed. [2023-02-18 00:16:22,444 INFO L899 garLoopResultBuilder]: For program point L883(line 883) no Hoare annotation was computed. [2023-02-18 00:16:22,444 INFO L899 garLoopResultBuilder]: For program point L751(lines 751 762) no Hoare annotation was computed. [2023-02-18 00:16:22,444 INFO L899 garLoopResultBuilder]: For program point L173(line 173) no Hoare annotation was computed. [2023-02-18 00:16:22,444 INFO L899 garLoopResultBuilder]: For program point L801(lines 801 951) no Hoare annotation was computed. [2023-02-18 00:16:22,444 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-18 00:16:22,444 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 185) no Hoare annotation was computed. [2023-02-18 00:16:22,444 INFO L899 garLoopResultBuilder]: For program point L157(line 157) no Hoare annotation was computed. [2023-02-18 00:16:22,444 INFO L899 garLoopResultBuilder]: For program point L570(lines 570 973) no Hoare annotation was computed. [2023-02-18 00:16:22,445 INFO L899 garLoopResultBuilder]: For program point L917(lines 917 943) no Hoare annotation was computed. [2023-02-18 00:16:22,445 INFO L899 garLoopResultBuilder]: For program point L785(lines 785 953) no Hoare annotation was computed. [2023-02-18 00:16:22,445 INFO L899 garLoopResultBuilder]: For program point L207(line 207) no Hoare annotation was computed. [2023-02-18 00:16:22,445 INFO L899 garLoopResultBuilder]: For program point L521(lines 521 976) no Hoare annotation was computed. [2023-02-18 00:16:22,445 INFO L899 garLoopResultBuilder]: For program point L257(line 257) no Hoare annotation was computed. [2023-02-18 00:16:22,445 INFO L899 garLoopResultBuilder]: For program point L604(lines 604 628) no Hoare annotation was computed. [2023-02-18 00:16:22,445 INFO L899 garLoopResultBuilder]: For program point L26(lines 26 1000) no Hoare annotation was computed. [2023-02-18 00:16:22,445 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 105) no Hoare annotation was computed. [2023-02-18 00:16:22,445 INFO L899 garLoopResultBuilder]: For program point L819(lines 819 830) no Hoare annotation was computed. [2023-02-18 00:16:22,446 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 895) no Hoare annotation was computed. [2023-02-18 00:16:22,446 INFO L899 garLoopResultBuilder]: For program point L638(lines 638 967) no Hoare annotation was computed. [2023-02-18 00:16:22,447 INFO L895 garLoopResultBuilder]: At program point L93(lines 65 999) the Hoare annotation is: (let ((.cse5 (<= 0 (+ (- 1) |ULTIMATE.start_main_~main__t~0#1|)))) (let ((.cse4 (<= 0 |ULTIMATE.start_main_~main__tagbuf_len~0#1|)) (.cse1 (<= |ULTIMATE.start_main_~main__t~0#1| |ULTIMATE.start_main_~main__tagbuf_len~0#1|)) (.cse2 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~11#1| 0))) (.cse6 (let ((.cse12 (let ((.cse13 (<= (* (- 1) |ULTIMATE.start_main_~main__t~0#1|) 0))) (or (and (= |ULTIMATE.start_main_~main__t~0#1| 0) (not .cse13)) .cse13)))) (or (and .cse5 .cse12) (and (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~6#1| 0)) .cse5 .cse12))))) (let ((.cse0 (let ((.cse8 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~7#1| 0)))) (let ((.cse7 (let ((.cse11 (or (and .cse5 .cse6) (and .cse5 .cse6 .cse8)))) (let ((.cse9 (and .cse11 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~10#1| 0)) .cse5)) (.cse10 (and .cse11 .cse5))) (or (and (or .cse9 .cse10) .cse2) .cse9 .cse10))))) (or (and .cse4 .cse1 .cse7) (and .cse4 .cse1 .cse8 .cse7)))))) (or (and .cse0 .cse1) (and .cse0 .cse2 .cse1) (let ((.cse3 (<= |ULTIMATE.start_main_~main__tagbuf_len~0#1| 0))) (and (or (not .cse3) (and (not (= |ULTIMATE.start_main_~main__tagbuf_len~0#1| 0)) (or (not (<= (+ |ULTIMATE.start_main_~main__tagbuf_len~0#1| 1) 0)) .cse4))) .cse5 (or .cse3 (<= |ULTIMATE.start_main_~main__t~0#1| 1)) .cse4 .cse1 .cse6)))))) [2023-02-18 00:16:22,447 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 219) no Hoare annotation was computed. [2023-02-18 00:16:22,447 INFO L899 garLoopResultBuilder]: For program point L919(line 919) no Hoare annotation was computed. [2023-02-18 00:16:22,447 INFO L899 garLoopResultBuilder]: For program point L853(lines 853 947) no Hoare annotation was computed. [2023-02-18 00:16:22,447 INFO L899 garLoopResultBuilder]: For program point L143(lines 143 236) no Hoare annotation was computed. [2023-02-18 00:16:22,448 INFO L899 garLoopResultBuilder]: For program point L589(lines 589 970) no Hoare annotation was computed. [2023-02-18 00:16:22,448 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 17 1006) the Hoare annotation is: true [2023-02-18 00:16:22,448 INFO L899 garLoopResultBuilder]: For program point L325(lines 325 993) no Hoare annotation was computed. [2023-02-18 00:16:22,448 INFO L899 garLoopResultBuilder]: For program point L672(lines 672 696) no Hoare annotation was computed. [2023-02-18 00:16:22,449 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 145) no Hoare annotation was computed. [2023-02-18 00:16:22,449 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-18 00:16:22,449 INFO L895 garLoopResultBuilder]: At program point L28(lines 26 1000) the Hoare annotation is: (let ((.cse1 (= |ULTIMATE.start_main_~main__t~0#1| 0))) (and (let ((.cse0 (<= (+ |ULTIMATE.start_main_~main__t~0#1| (* (- 1) |ULTIMATE.start_main_~main__tagbuf_len~0#1|)) 0))) (or .cse0 (and (not .cse0) .cse1 (= |ULTIMATE.start_main_~main__tagbuf_len~0#1| 0)))) (let ((.cse2 (<= (* (- 1) |ULTIMATE.start_main_~main__t~0#1|) 0))) (or (and .cse1 (not .cse2)) .cse2)))) [2023-02-18 00:16:22,449 INFO L899 garLoopResultBuilder]: For program point L309(lines 309 995) no Hoare annotation was computed. [2023-02-18 00:16:22,449 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 931) no Hoare annotation was computed. [2023-02-18 00:16:22,449 INFO L899 garLoopResultBuilder]: For program point L706(lines 706 961) no Hoare annotation was computed. [2023-02-18 00:16:22,449 INFO L899 garLoopResultBuilder]: For program point L343(lines 343 354) no Hoare annotation was computed. [2023-02-18 00:16:22,450 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 117) no Hoare annotation was computed. [2023-02-18 00:16:22,450 INFO L899 garLoopResultBuilder]: For program point L145(line 145) no Hoare annotation was computed. [2023-02-18 00:16:22,450 INFO L899 garLoopResultBuilder]: For program point L657(lines 657 964) no Hoare annotation was computed. [2023-02-18 00:16:22,450 INFO L899 garLoopResultBuilder]: For program point L46(lines 46 56) no Hoare annotation was computed. [2023-02-18 00:16:22,450 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 919) no Hoare annotation was computed. [2023-02-18 00:16:22,450 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-18 00:16:22,450 INFO L899 garLoopResultBuilder]: For program point L393(lines 393 987) no Hoare annotation was computed. [2023-02-18 00:16:22,450 INFO L899 garLoopResultBuilder]: For program point L740(lines 740 764) no Hoare annotation was computed. [2023-02-18 00:16:22,451 INFO L899 garLoopResultBuilder]: For program point L96(lines 96 285) no Hoare annotation was computed. [2023-02-18 00:16:22,451 INFO L899 garLoopResultBuilder]: For program point L377(lines 377 989) no Hoare annotation was computed. [2023-02-18 00:16:22,451 INFO L899 garLoopResultBuilder]: For program point L774(lines 774 955) no Hoare annotation was computed. [2023-02-18 00:16:22,451 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 157) no Hoare annotation was computed. [2023-02-18 00:16:22,451 INFO L899 garLoopResultBuilder]: For program point L411(lines 411 422) no Hoare annotation was computed. [2023-02-18 00:16:22,451 INFO L899 garLoopResultBuilder]: For program point L725(lines 725 958) no Hoare annotation was computed. [2023-02-18 00:16:22,451 INFO L899 garLoopResultBuilder]: For program point L48(line 48) no Hoare annotation was computed. [2023-02-18 00:16:22,451 INFO L899 garLoopResultBuilder]: For program point L461(lines 461 981) no Hoare annotation was computed. [2023-02-18 00:16:22,452 INFO L899 garLoopResultBuilder]: For program point L874(lines 874 945) no Hoare annotation was computed. [2023-02-18 00:16:22,452 INFO L899 garLoopResultBuilder]: For program point L808(lines 808 832) no Hoare annotation was computed. [2023-02-18 00:16:22,452 INFO L899 garLoopResultBuilder]: For program point L164(lines 164 233) no Hoare annotation was computed. [2023-02-18 00:16:22,452 INFO L899 garLoopResultBuilder]: For program point L65(lines 65 999) no Hoare annotation was computed. [2023-02-18 00:16:22,452 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-18 00:16:22,452 INFO L899 garLoopResultBuilder]: For program point L445(lines 445 983) no Hoare annotation was computed. [2023-02-18 00:16:22,452 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 36) no Hoare annotation was computed. [2023-02-18 00:16:22,452 INFO L899 garLoopResultBuilder]: For program point L115(lines 115 123) no Hoare annotation was computed. [2023-02-18 00:16:22,452 INFO L899 garLoopResultBuilder]: For program point L842(lines 842 949) no Hoare annotation was computed. [2023-02-18 00:16:22,453 INFO L895 garLoopResultBuilder]: At program point L198(lines 132 284) the Hoare annotation is: (let ((.cse12 (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~7#1| 0)) (.cse25 (<= |ULTIMATE.start_main_~main__tagbuf_len~0#1| 0)) (.cse8 (<= 0 |ULTIMATE.start_main_~main__tagbuf_len~0#1|))) (let ((.cse5 (or (not .cse25) (and (not (= |ULTIMATE.start_main_~main__tagbuf_len~0#1| 0)) (or (not (<= (+ |ULTIMATE.start_main_~main__tagbuf_len~0#1| 1) 0)) .cse8)))) (.cse7 (or .cse25 (<= |ULTIMATE.start_main_~main__t~0#1| 1))) (.cse14 (not .cse12)) (.cse21 (<= 0 (+ (- 1) |ULTIMATE.start_main_~main__t~0#1|))) (.cse19 (* (- 1) |ULTIMATE.start_main_~main__t~0#1|))) (let ((.cse20 (let ((.cse22 (let ((.cse23 (let ((.cse24 (<= .cse19 0))) (or (and (= |ULTIMATE.start_main_~main__t~0#1| 0) (not .cse24)) .cse24)))) (or (and .cse21 .cse23) (and (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~6#1| 0)) .cse21 .cse23))))) (or (and .cse5 .cse21 .cse7 .cse22) (and .cse21 .cse22) (and .cse21 .cse22 .cse14))))) (let ((.cse18 (<= (+ |ULTIMATE.start_main_~main__t~0#1| (* (- 1) |ULTIMATE.start_main_~main__tagbuf_len~0#1|)) 0)) (.cse16 (and (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~10#1| 0)) .cse20 .cse21)) (.cse17 (and .cse20 .cse21))) (let ((.cse15 (and .cse5 (or .cse16 .cse17) .cse7)) (.cse11 (not .cse18)) (.cse10 (not (<= (+ .cse19 |ULTIMATE.start_main_~main__tagbuf_len~0#1|) 0)))) (let ((.cse0 (or .cse11 .cse10)) (.cse1 (or (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~17#1| 0) .cse18)) (.cse4 (<= |ULTIMATE.start_main_~main__t~0#1| |ULTIMATE.start_main_~main__tagbuf_len~0#1|)) (.cse9 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~11#1| 0))) (.cse6 (or .cse15 .cse16 .cse17))) (let ((.cse2 (let ((.cse13 (or .cse15 .cse16 .cse17 (and .cse9 .cse6)))) (or (and .cse0 .cse13 .cse1 .cse8 .cse4 .cse14) (and .cse0 .cse13 .cse1 .cse8 .cse4)))) (.cse3 (or .cse10 (and .cse11 .cse12)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse1 .cse6 .cse7 .cse8 .cse3 .cse4) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse4))))))))) [2023-02-18 00:16:22,453 INFO L899 garLoopResultBuilder]: For program point L132(lines 132 284) no Hoare annotation was computed. [2023-02-18 00:16:22,454 INFO L899 garLoopResultBuilder]: For program point L479(lines 479 490) no Hoare annotation was computed. [2023-02-18 00:16:22,454 INFO L899 garLoopResultBuilder]: For program point L793(lines 793 952) no Hoare annotation was computed. [2023-02-18 00:16:22,454 INFO L899 garLoopResultBuilder]: For program point L248(lines 248 283) no Hoare annotation was computed. [2023-02-18 00:16:22,454 INFO L899 garLoopResultBuilder]: For program point L83(lines 83 286) no Hoare annotation was computed. [2023-02-18 00:16:22,454 INFO L899 garLoopResultBuilder]: For program point L529(lines 529 975) no Hoare annotation was computed. [2023-02-18 00:16:22,454 INFO L899 garLoopResultBuilder]: For program point L298(lines 298 997) no Hoare annotation was computed. [2023-02-18 00:16:22,454 INFO L899 garLoopResultBuilder]: For program point L34(lines 34 58) no Hoare annotation was computed. [2023-02-18 00:16:22,454 INFO L899 garLoopResultBuilder]: For program point L513(lines 513 977) no Hoare annotation was computed. [2023-02-18 00:16:22,455 INFO L899 garLoopResultBuilder]: For program point L893(lines 893 905) no Hoare annotation was computed. [2023-02-18 00:16:22,455 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 257) no Hoare annotation was computed. [2023-02-18 00:16:22,455 INFO L899 garLoopResultBuilder]: For program point L183(lines 183 191) no Hoare annotation was computed. [2023-02-18 00:16:22,455 INFO L899 garLoopResultBuilder]: For program point L117(line 117) no Hoare annotation was computed. [2023-02-18 00:16:22,455 INFO L899 garLoopResultBuilder]: For program point L332(lines 332 356) no Hoare annotation was computed. [2023-02-18 00:16:22,455 INFO L899 garLoopResultBuilder]: For program point L547(lines 547 558) no Hoare annotation was computed. [2023-02-18 00:16:22,458 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 00:16:22,461 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-18 00:16:22,525 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.02 12:16:22 BoogieIcfgContainer [2023-02-18 00:16:22,525 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-18 00:16:22,525 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-18 00:16:22,526 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-18 00:16:22,526 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-18 00:16:22,526 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 12:16:17" (3/4) ... [2023-02-18 00:16:22,529 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-18 00:16:22,548 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2023-02-18 00:16:22,549 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-02-18 00:16:22,550 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-18 00:16:22,550 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-18 00:16:22,644 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-18 00:16:22,644 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-18 00:16:22,645 INFO L158 Benchmark]: Toolchain (without parser) took 6476.56ms. Allocated memory was 140.5MB in the beginning and 224.4MB in the end (delta: 83.9MB). Free memory was 100.0MB in the beginning and 159.7MB in the end (delta: -59.8MB). Peak memory consumption was 26.1MB. Max. memory is 16.1GB. [2023-02-18 00:16:22,645 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 111.1MB. Free memory was 86.5MB in the beginning and 86.4MB in the end (delta: 69.8kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 00:16:22,645 INFO L158 Benchmark]: CACSL2BoogieTranslator took 412.19ms. Allocated memory is still 140.5MB. Free memory was 99.8MB in the beginning and 77.0MB in the end (delta: 22.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-02-18 00:16:22,645 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.92ms. Allocated memory is still 140.5MB. Free memory was 77.0MB in the beginning and 73.8MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-18 00:16:22,646 INFO L158 Benchmark]: Boogie Preprocessor took 28.94ms. Allocated memory is still 140.5MB. Free memory was 73.8MB in the beginning and 71.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 00:16:22,646 INFO L158 Benchmark]: RCFGBuilder took 577.22ms. Allocated memory is still 140.5MB. Free memory was 71.4MB in the beginning and 85.9MB in the end (delta: -14.5MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. [2023-02-18 00:16:22,646 INFO L158 Benchmark]: TraceAbstraction took 5287.48ms. Allocated memory was 140.5MB in the beginning and 224.4MB in the end (delta: 83.9MB). Free memory was 84.9MB in the beginning and 169.1MB in the end (delta: -84.3MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 00:16:22,646 INFO L158 Benchmark]: Witness Printer took 118.73ms. Allocated memory is still 224.4MB. Free memory was 169.1MB in the beginning and 159.7MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-18 00:16:22,648 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.16ms. Allocated memory is still 111.1MB. Free memory was 86.5MB in the beginning and 86.4MB in the end (delta: 69.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 412.19ms. Allocated memory is still 140.5MB. Free memory was 99.8MB in the beginning and 77.0MB in the end (delta: 22.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.92ms. Allocated memory is still 140.5MB. Free memory was 77.0MB in the beginning and 73.8MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.94ms. Allocated memory is still 140.5MB. Free memory was 73.8MB in the beginning and 71.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 577.22ms. Allocated memory is still 140.5MB. Free memory was 71.4MB in the beginning and 85.9MB in the end (delta: -14.5MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. * TraceAbstraction took 5287.48ms. Allocated memory was 140.5MB in the beginning and 224.4MB in the end (delta: 83.9MB). Free memory was 84.9MB in the beginning and 169.1MB in the end (delta: -84.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 118.73ms. Allocated memory is still 224.4MB. Free memory was 169.1MB in the beginning and 159.7MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. 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: 36]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 48]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 105]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 117]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 145]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 157]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 173]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 185]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 207]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 219]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 257]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 269]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 883]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 895]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 919]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 931]: 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 1 procedures, 120 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 5.2s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1331 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1331 mSDsluCounter, 2483 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1445 mSDsCounter, 262 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3638 IncrementalHoareTripleChecker+Invalid, 3900 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 262 mSolverCounterUnsat, 1038 mSDtfsCounter, 3638 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 175 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=0, InterpolantAutomatonStates: 114, 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, 19 MinimizatonAttempts, 119 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 16 NumberOfFragments, 10382 HoareAnnotationTreeSize, 6 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 386 NumberOfCodeBlocks, 386 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 367 ConstructedInterpolants, 0 QuantifiedInterpolants, 3435 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 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 16 specifications checked. All of them hold - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: (((((0 <= main__tagbuf_len && main__t <= main__tagbuf_len) && ((((((((0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) || ((0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) && !(__VERIFIER_assert__cond == 0))) && !(__VERIFIER_assert__cond == 0)) && 0 <= -1 + main__t) || (((0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) || ((0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) && !(__VERIFIER_assert__cond == 0))) && 0 <= -1 + main__t)) && !(__VERIFIER_assert__cond == 0)) || ((((0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) || ((0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) && !(__VERIFIER_assert__cond == 0))) && !(__VERIFIER_assert__cond == 0)) && 0 <= -1 + main__t)) || (((0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) || ((0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) && !(__VERIFIER_assert__cond == 0))) && 0 <= -1 + main__t))) || (((0 <= main__tagbuf_len && main__t <= main__tagbuf_len) && !(__VERIFIER_assert__cond == 0)) && ((((((((0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) || ((0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) && !(__VERIFIER_assert__cond == 0))) && !(__VERIFIER_assert__cond == 0)) && 0 <= -1 + main__t) || (((0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) || ((0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) && !(__VERIFIER_assert__cond == 0))) && 0 <= -1 + main__t)) && !(__VERIFIER_assert__cond == 0)) || ((((0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) || ((0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) && !(__VERIFIER_assert__cond == 0))) && !(__VERIFIER_assert__cond == 0)) && 0 <= -1 + main__t)) || (((0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) || ((0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) && !(__VERIFIER_assert__cond == 0))) && 0 <= -1 + main__t)))) && main__t <= main__tagbuf_len) || (((((0 <= main__tagbuf_len && main__t <= main__tagbuf_len) && ((((((((0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) || ((0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) && !(__VERIFIER_assert__cond == 0))) && !(__VERIFIER_assert__cond == 0)) && 0 <= -1 + main__t) || (((0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) || ((0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) && !(__VERIFIER_assert__cond == 0))) && 0 <= -1 + main__t)) && !(__VERIFIER_assert__cond == 0)) || ((((0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) || ((0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) && !(__VERIFIER_assert__cond == 0))) && !(__VERIFIER_assert__cond == 0)) && 0 <= -1 + main__t)) || (((0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) || ((0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) && !(__VERIFIER_assert__cond == 0))) && 0 <= -1 + main__t))) || (((0 <= main__tagbuf_len && main__t <= main__tagbuf_len) && !(__VERIFIER_assert__cond == 0)) && ((((((((0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) || ((0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) && !(__VERIFIER_assert__cond == 0))) && !(__VERIFIER_assert__cond == 0)) && 0 <= -1 + main__t) || (((0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) || ((0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) && !(__VERIFIER_assert__cond == 0))) && 0 <= -1 + main__t)) && !(__VERIFIER_assert__cond == 0)) || ((((0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) || ((0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) && !(__VERIFIER_assert__cond == 0))) && !(__VERIFIER_assert__cond == 0)) && 0 <= -1 + main__t)) || (((0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) || ((0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) && !(__VERIFIER_assert__cond == 0))) && 0 <= -1 + main__t)))) && !(__VERIFIER_assert__cond == 0)) && main__t <= main__tagbuf_len)) || ((((((!(main__tagbuf_len <= 0) || (!(main__tagbuf_len == 0) && (!(main__tagbuf_len + 1 <= 0) || 0 <= main__tagbuf_len))) && 0 <= -1 + main__t) && (main__tagbuf_len <= 0 || main__t <= 1)) && 0 <= main__tagbuf_len) && main__t <= main__tagbuf_len) && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: ((((((!(main__t + -1 * main__tagbuf_len <= 0) || !(-1 * main__t + main__tagbuf_len <= 0)) && (__VERIFIER_assert__cond == 0 || main__t + -1 * main__tagbuf_len <= 0)) && (((((((!(main__t + -1 * main__tagbuf_len <= 0) || !(-1 * main__t + main__tagbuf_len <= 0)) && ((((((!(main__tagbuf_len <= 0) || (!(main__tagbuf_len == 0) && (!(main__tagbuf_len + 1 <= 0) || 0 <= main__tagbuf_len))) && (((!(__VERIFIER_assert__cond == 0) && ((((((!(main__tagbuf_len <= 0) || (!(main__tagbuf_len == 0) && (!(main__tagbuf_len + 1 <= 0) || 0 <= main__tagbuf_len))) && 0 <= -1 + main__t) && (main__tagbuf_len <= 0 || main__t <= 1)) && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) || (0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0))))) || ((0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) && !(__VERIFIER_assert__cond == 0)))) && 0 <= -1 + main__t) || (((((((!(main__tagbuf_len <= 0) || (!(main__tagbuf_len == 0) && (!(main__tagbuf_len + 1 <= 0) || 0 <= main__tagbuf_len))) && 0 <= -1 + main__t) && (main__tagbuf_len <= 0 || main__t <= 1)) && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) || (0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0))))) || ((0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) && !(__VERIFIER_assert__cond == 0))) && 0 <= -1 + main__t))) && (main__tagbuf_len <= 0 || main__t <= 1)) || ((!(__VERIFIER_assert__cond == 0) && ((((((!(main__tagbuf_len <= 0) || (!(main__tagbuf_len == 0) && (!(main__tagbuf_len + 1 <= 0) || 0 <= main__tagbuf_len))) && 0 <= -1 + main__t) && (main__tagbuf_len <= 0 || main__t <= 1)) && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) || (0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0))))) || ((0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) && !(__VERIFIER_assert__cond == 0)))) && 0 <= -1 + main__t)) || (((((((!(main__tagbuf_len <= 0) || (!(main__tagbuf_len == 0) && (!(main__tagbuf_len + 1 <= 0) || 0 <= main__tagbuf_len))) && 0 <= -1 + main__t) && (main__tagbuf_len <= 0 || main__t <= 1)) && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) || (0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0))))) || ((0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) && !(__VERIFIER_assert__cond == 0))) && 0 <= -1 + main__t)) || (!(__VERIFIER_assert__cond == 0) && (((((!(main__tagbuf_len <= 0) || (!(main__tagbuf_len == 0) && (!(main__tagbuf_len + 1 <= 0) || 0 <= main__tagbuf_len))) && (((!(__VERIFIER_assert__cond == 0) && ((((((!(main__tagbuf_len <= 0) || (!(main__tagbuf_len == 0) && (!(main__tagbuf_len + 1 <= 0) || 0 <= main__tagbuf_len))) && 0 <= -1 + main__t) && (main__tagbuf_len <= 0 || main__t <= 1)) && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) || (0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0))))) || ((0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) && !(__VERIFIER_assert__cond == 0)))) && 0 <= -1 + main__t) || (((((((!(main__tagbuf_len <= 0) || (!(main__tagbuf_len == 0) && (!(main__tagbuf_len + 1 <= 0) || 0 <= main__tagbuf_len))) && 0 <= -1 + main__t) && (main__tagbuf_len <= 0 || main__t <= 1)) && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) || (0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0))))) || ((0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) && !(__VERIFIER_assert__cond == 0))) && 0 <= -1 + main__t))) && (main__tagbuf_len <= 0 || main__t <= 1)) || ((!(__VERIFIER_assert__cond == 0) && ((((((!(main__tagbuf_len <= 0) || (!(main__tagbuf_len == 0) && (!(main__tagbuf_len + 1 <= 0) || 0 <= main__tagbuf_len))) && 0 <= -1 + main__t) && (main__tagbuf_len <= 0 || main__t <= 1)) && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) || (0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0))))) || ((0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) && !(__VERIFIER_assert__cond == 0)))) && 0 <= -1 + main__t)) || (((((((!(main__tagbuf_len <= 0) || (!(main__tagbuf_len == 0) && (!(main__tagbuf_len + 1 <= 0) || 0 <= main__tagbuf_len))) && 0 <= -1 + main__t) && (main__tagbuf_len <= 0 || main__t <= 1)) && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) || (0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0))))) || ((0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) && !(__VERIFIER_assert__cond == 0))) && 0 <= -1 + main__t))))) && (__VERIFIER_assert__cond == 0 || main__t + -1 * main__tagbuf_len <= 0)) && 0 <= main__tagbuf_len) && main__t <= main__tagbuf_len) && !(__VERIFIER_assert__cond == 0)) || (((((!(main__t + -1 * main__tagbuf_len <= 0) || !(-1 * main__t + main__tagbuf_len <= 0)) && ((((((!(main__tagbuf_len <= 0) || (!(main__tagbuf_len == 0) && (!(main__tagbuf_len + 1 <= 0) || 0 <= main__tagbuf_len))) && (((!(__VERIFIER_assert__cond == 0) && ((((((!(main__tagbuf_len <= 0) || (!(main__tagbuf_len == 0) && (!(main__tagbuf_len + 1 <= 0) || 0 <= main__tagbuf_len))) && 0 <= -1 + main__t) && (main__tagbuf_len <= 0 || main__t <= 1)) && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) || (0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0))))) || ((0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) && !(__VERIFIER_assert__cond == 0)))) && 0 <= -1 + main__t) || (((((((!(main__tagbuf_len <= 0) || (!(main__tagbuf_len == 0) && (!(main__tagbuf_len + 1 <= 0) || 0 <= main__tagbuf_len))) && 0 <= -1 + main__t) && (main__tagbuf_len <= 0 || main__t <= 1)) && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) || (0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0))))) || ((0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) && !(__VERIFIER_assert__cond == 0))) && 0 <= -1 + main__t))) && (main__tagbuf_len <= 0 || main__t <= 1)) || ((!(__VERIFIER_assert__cond == 0) && ((((((!(main__tagbuf_len <= 0) || (!(main__tagbuf_len == 0) && (!(main__tagbuf_len + 1 <= 0) || 0 <= main__tagbuf_len))) && 0 <= -1 + main__t) && (main__tagbuf_len <= 0 || main__t <= 1)) && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) || (0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0))))) || ((0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) && !(__VERIFIER_assert__cond == 0)))) && 0 <= -1 + main__t)) || (((((((!(main__tagbuf_len <= 0) || (!(main__tagbuf_len == 0) && (!(main__tagbuf_len + 1 <= 0) || 0 <= main__tagbuf_len))) && 0 <= -1 + main__t) && (main__tagbuf_len <= 0 || main__t <= 1)) && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) || (0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0))))) || ((0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) && !(__VERIFIER_assert__cond == 0))) && 0 <= -1 + main__t)) || (!(__VERIFIER_assert__cond == 0) && (((((!(main__tagbuf_len <= 0) || (!(main__tagbuf_len == 0) && (!(main__tagbuf_len + 1 <= 0) || 0 <= main__tagbuf_len))) && (((!(__VERIFIER_assert__cond == 0) && ((((((!(main__tagbuf_len <= 0) || (!(main__tagbuf_len == 0) && (!(main__tagbuf_len + 1 <= 0) || 0 <= main__tagbuf_len))) && 0 <= -1 + main__t) && (main__tagbuf_len <= 0 || main__t <= 1)) && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) || (0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0))))) || ((0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) && !(__VERIFIER_assert__cond == 0)))) && 0 <= -1 + main__t) || (((((((!(main__tagbuf_len <= 0) || (!(main__tagbuf_len == 0) && (!(main__tagbuf_len + 1 <= 0) || 0 <= main__tagbuf_len))) && 0 <= -1 + main__t) && (main__tagbuf_len <= 0 || main__t <= 1)) && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) || (0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0))))) || ((0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) && !(__VERIFIER_assert__cond == 0))) && 0 <= -1 + main__t))) && (main__tagbuf_len <= 0 || main__t <= 1)) || ((!(__VERIFIER_assert__cond == 0) && ((((((!(main__tagbuf_len <= 0) || (!(main__tagbuf_len == 0) && (!(main__tagbuf_len + 1 <= 0) || 0 <= main__tagbuf_len))) && 0 <= -1 + main__t) && (main__tagbuf_len <= 0 || main__t <= 1)) && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) || (0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0))))) || ((0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) && !(__VERIFIER_assert__cond == 0)))) && 0 <= -1 + main__t)) || (((((((!(main__tagbuf_len <= 0) || (!(main__tagbuf_len == 0) && (!(main__tagbuf_len + 1 <= 0) || 0 <= main__tagbuf_len))) && 0 <= -1 + main__t) && (main__tagbuf_len <= 0 || main__t <= 1)) && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) || (0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0))))) || ((0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) && !(__VERIFIER_assert__cond == 0))) && 0 <= -1 + main__t))))) && (__VERIFIER_assert__cond == 0 || main__t + -1 * main__tagbuf_len <= 0)) && 0 <= main__tagbuf_len) && main__t <= main__tagbuf_len))) && (!(-1 * main__t + main__tagbuf_len <= 0) || (!(main__t + -1 * main__tagbuf_len <= 0) && __VERIFIER_assert__cond == 0))) && main__t <= main__tagbuf_len) || ((((((((!(main__tagbuf_len <= 0) || (!(main__tagbuf_len == 0) && (!(main__tagbuf_len + 1 <= 0) || 0 <= main__tagbuf_len))) && (!(main__t + -1 * main__tagbuf_len <= 0) || !(-1 * main__t + main__tagbuf_len <= 0))) && (__VERIFIER_assert__cond == 0 || main__t + -1 * main__tagbuf_len <= 0)) && (((((!(main__tagbuf_len <= 0) || (!(main__tagbuf_len == 0) && (!(main__tagbuf_len + 1 <= 0) || 0 <= main__tagbuf_len))) && (((!(__VERIFIER_assert__cond == 0) && ((((((!(main__tagbuf_len <= 0) || (!(main__tagbuf_len == 0) && (!(main__tagbuf_len + 1 <= 0) || 0 <= main__tagbuf_len))) && 0 <= -1 + main__t) && (main__tagbuf_len <= 0 || main__t <= 1)) && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) || (0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0))))) || ((0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) && !(__VERIFIER_assert__cond == 0)))) && 0 <= -1 + main__t) || (((((((!(main__tagbuf_len <= 0) || (!(main__tagbuf_len == 0) && (!(main__tagbuf_len + 1 <= 0) || 0 <= main__tagbuf_len))) && 0 <= -1 + main__t) && (main__tagbuf_len <= 0 || main__t <= 1)) && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) || (0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0))))) || ((0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) && !(__VERIFIER_assert__cond == 0))) && 0 <= -1 + main__t))) && (main__tagbuf_len <= 0 || main__t <= 1)) || ((!(__VERIFIER_assert__cond == 0) && ((((((!(main__tagbuf_len <= 0) || (!(main__tagbuf_len == 0) && (!(main__tagbuf_len + 1 <= 0) || 0 <= main__tagbuf_len))) && 0 <= -1 + main__t) && (main__tagbuf_len <= 0 || main__t <= 1)) && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) || (0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0))))) || ((0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) && !(__VERIFIER_assert__cond == 0)))) && 0 <= -1 + main__t)) || (((((((!(main__tagbuf_len <= 0) || (!(main__tagbuf_len == 0) && (!(main__tagbuf_len + 1 <= 0) || 0 <= main__tagbuf_len))) && 0 <= -1 + main__t) && (main__tagbuf_len <= 0 || main__t <= 1)) && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) || (0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0))))) || ((0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) && !(__VERIFIER_assert__cond == 0))) && 0 <= -1 + main__t))) && (main__tagbuf_len <= 0 || main__t <= 1)) && 0 <= main__tagbuf_len) && (!(-1 * main__t + main__tagbuf_len <= 0) || (!(main__t + -1 * main__tagbuf_len <= 0) && __VERIFIER_assert__cond == 0))) && main__t <= main__tagbuf_len)) || ((((((!(main__t + -1 * main__tagbuf_len <= 0) || !(-1 * main__t + main__tagbuf_len <= 0)) && !(__VERIFIER_assert__cond == 0)) && (__VERIFIER_assert__cond == 0 || main__t + -1 * main__tagbuf_len <= 0)) && (((((((!(main__t + -1 * main__tagbuf_len <= 0) || !(-1 * main__t + main__tagbuf_len <= 0)) && ((((((!(main__tagbuf_len <= 0) || (!(main__tagbuf_len == 0) && (!(main__tagbuf_len + 1 <= 0) || 0 <= main__tagbuf_len))) && (((!(__VERIFIER_assert__cond == 0) && ((((((!(main__tagbuf_len <= 0) || (!(main__tagbuf_len == 0) && (!(main__tagbuf_len + 1 <= 0) || 0 <= main__tagbuf_len))) && 0 <= -1 + main__t) && (main__tagbuf_len <= 0 || main__t <= 1)) && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) || (0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0))))) || ((0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) && !(__VERIFIER_assert__cond == 0)))) && 0 <= -1 + main__t) || (((((((!(main__tagbuf_len <= 0) || (!(main__tagbuf_len == 0) && (!(main__tagbuf_len + 1 <= 0) || 0 <= main__tagbuf_len))) && 0 <= -1 + main__t) && (main__tagbuf_len <= 0 || main__t <= 1)) && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) || (0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0))))) || ((0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) && !(__VERIFIER_assert__cond == 0))) && 0 <= -1 + main__t))) && (main__tagbuf_len <= 0 || main__t <= 1)) || ((!(__VERIFIER_assert__cond == 0) && ((((((!(main__tagbuf_len <= 0) || (!(main__tagbuf_len == 0) && (!(main__tagbuf_len + 1 <= 0) || 0 <= main__tagbuf_len))) && 0 <= -1 + main__t) && (main__tagbuf_len <= 0 || main__t <= 1)) && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) || (0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0))))) || ((0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) && !(__VERIFIER_assert__cond == 0)))) && 0 <= -1 + main__t)) || (((((((!(main__tagbuf_len <= 0) || (!(main__tagbuf_len == 0) && (!(main__tagbuf_len + 1 <= 0) || 0 <= main__tagbuf_len))) && 0 <= -1 + main__t) && (main__tagbuf_len <= 0 || main__t <= 1)) && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) || (0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0))))) || ((0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) && !(__VERIFIER_assert__cond == 0))) && 0 <= -1 + main__t)) || (!(__VERIFIER_assert__cond == 0) && (((((!(main__tagbuf_len <= 0) || (!(main__tagbuf_len == 0) && (!(main__tagbuf_len + 1 <= 0) || 0 <= main__tagbuf_len))) && (((!(__VERIFIER_assert__cond == 0) && ((((((!(main__tagbuf_len <= 0) || (!(main__tagbuf_len == 0) && (!(main__tagbuf_len + 1 <= 0) || 0 <= main__tagbuf_len))) && 0 <= -1 + main__t) && (main__tagbuf_len <= 0 || main__t <= 1)) && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) || (0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0))))) || ((0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) && !(__VERIFIER_assert__cond == 0)))) && 0 <= -1 + main__t) || (((((((!(main__tagbuf_len <= 0) || (!(main__tagbuf_len == 0) && (!(main__tagbuf_len + 1 <= 0) || 0 <= main__tagbuf_len))) && 0 <= -1 + main__t) && (main__tagbuf_len <= 0 || main__t <= 1)) && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) || (0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0))))) || ((0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) && !(__VERIFIER_assert__cond == 0))) && 0 <= -1 + main__t))) && (main__tagbuf_len <= 0 || main__t <= 1)) || ((!(__VERIFIER_assert__cond == 0) && ((((((!(main__tagbuf_len <= 0) || (!(main__tagbuf_len == 0) && (!(main__tagbuf_len + 1 <= 0) || 0 <= main__tagbuf_len))) && 0 <= -1 + main__t) && (main__tagbuf_len <= 0 || main__t <= 1)) && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) || (0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0))))) || ((0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) && !(__VERIFIER_assert__cond == 0)))) && 0 <= -1 + main__t)) || (((((((!(main__tagbuf_len <= 0) || (!(main__tagbuf_len == 0) && (!(main__tagbuf_len + 1 <= 0) || 0 <= main__tagbuf_len))) && 0 <= -1 + main__t) && (main__tagbuf_len <= 0 || main__t <= 1)) && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) || (0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0))))) || ((0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) && !(__VERIFIER_assert__cond == 0))) && 0 <= -1 + main__t))))) && (__VERIFIER_assert__cond == 0 || main__t + -1 * main__tagbuf_len <= 0)) && 0 <= main__tagbuf_len) && main__t <= main__tagbuf_len) && !(__VERIFIER_assert__cond == 0)) || (((((!(main__t + -1 * main__tagbuf_len <= 0) || !(-1 * main__t + main__tagbuf_len <= 0)) && ((((((!(main__tagbuf_len <= 0) || (!(main__tagbuf_len == 0) && (!(main__tagbuf_len + 1 <= 0) || 0 <= main__tagbuf_len))) && (((!(__VERIFIER_assert__cond == 0) && ((((((!(main__tagbuf_len <= 0) || (!(main__tagbuf_len == 0) && (!(main__tagbuf_len + 1 <= 0) || 0 <= main__tagbuf_len))) && 0 <= -1 + main__t) && (main__tagbuf_len <= 0 || main__t <= 1)) && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) || (0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0))))) || ((0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) && !(__VERIFIER_assert__cond == 0)))) && 0 <= -1 + main__t) || (((((((!(main__tagbuf_len <= 0) || (!(main__tagbuf_len == 0) && (!(main__tagbuf_len + 1 <= 0) || 0 <= main__tagbuf_len))) && 0 <= -1 + main__t) && (main__tagbuf_len <= 0 || main__t <= 1)) && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) || (0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0))))) || ((0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) && !(__VERIFIER_assert__cond == 0))) && 0 <= -1 + main__t))) && (main__tagbuf_len <= 0 || main__t <= 1)) || ((!(__VERIFIER_assert__cond == 0) && ((((((!(main__tagbuf_len <= 0) || (!(main__tagbuf_len == 0) && (!(main__tagbuf_len + 1 <= 0) || 0 <= main__tagbuf_len))) && 0 <= -1 + main__t) && (main__tagbuf_len <= 0 || main__t <= 1)) && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) || (0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0))))) || ((0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) && !(__VERIFIER_assert__cond == 0)))) && 0 <= -1 + main__t)) || (((((((!(main__tagbuf_len <= 0) || (!(main__tagbuf_len == 0) && (!(main__tagbuf_len + 1 <= 0) || 0 <= main__tagbuf_len))) && 0 <= -1 + main__t) && (main__tagbuf_len <= 0 || main__t <= 1)) && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) || (0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0))))) || ((0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) && !(__VERIFIER_assert__cond == 0))) && 0 <= -1 + main__t)) || (!(__VERIFIER_assert__cond == 0) && (((((!(main__tagbuf_len <= 0) || (!(main__tagbuf_len == 0) && (!(main__tagbuf_len + 1 <= 0) || 0 <= main__tagbuf_len))) && (((!(__VERIFIER_assert__cond == 0) && ((((((!(main__tagbuf_len <= 0) || (!(main__tagbuf_len == 0) && (!(main__tagbuf_len + 1 <= 0) || 0 <= main__tagbuf_len))) && 0 <= -1 + main__t) && (main__tagbuf_len <= 0 || main__t <= 1)) && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) || (0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0))))) || ((0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) && !(__VERIFIER_assert__cond == 0)))) && 0 <= -1 + main__t) || (((((((!(main__tagbuf_len <= 0) || (!(main__tagbuf_len == 0) && (!(main__tagbuf_len + 1 <= 0) || 0 <= main__tagbuf_len))) && 0 <= -1 + main__t) && (main__tagbuf_len <= 0 || main__t <= 1)) && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) || (0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0))))) || ((0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) && !(__VERIFIER_assert__cond == 0))) && 0 <= -1 + main__t))) && (main__tagbuf_len <= 0 || main__t <= 1)) || ((!(__VERIFIER_assert__cond == 0) && ((((((!(main__tagbuf_len <= 0) || (!(main__tagbuf_len == 0) && (!(main__tagbuf_len + 1 <= 0) || 0 <= main__tagbuf_len))) && 0 <= -1 + main__t) && (main__tagbuf_len <= 0 || main__t <= 1)) && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) || (0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0))))) || ((0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) && !(__VERIFIER_assert__cond == 0)))) && 0 <= -1 + main__t)) || (((((((!(main__tagbuf_len <= 0) || (!(main__tagbuf_len == 0) && (!(main__tagbuf_len + 1 <= 0) || 0 <= main__tagbuf_len))) && 0 <= -1 + main__t) && (main__tagbuf_len <= 0 || main__t <= 1)) && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) || (0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0))))) || ((0 <= -1 + main__t && ((0 <= -1 + main__t && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((!(__VERIFIER_assert__cond == 0) && 0 <= -1 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)))) && !(__VERIFIER_assert__cond == 0))) && 0 <= -1 + main__t))))) && (__VERIFIER_assert__cond == 0 || main__t + -1 * main__tagbuf_len <= 0)) && 0 <= main__tagbuf_len) && main__t <= main__tagbuf_len))) && (!(-1 * main__t + main__tagbuf_len <= 0) || (!(main__t + -1 * main__tagbuf_len <= 0) && __VERIFIER_assert__cond == 0))) && main__t <= main__tagbuf_len) - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: (main__t + -1 * main__tagbuf_len <= 0 || ((!(main__t + -1 * main__tagbuf_len <= 0) && main__t == 0) && main__tagbuf_len == 0)) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0) - InvariantResult [Line: 858]: Loop Invariant Derived loop invariant: ((((((((0 <= -1 + main__t && 0 <= main__tagbuf_len) && !(__VERIFIER_assert__cond == 0)) && main__t <= main__tagbuf_len) && 0 <= -9 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((((0 <= -1 + main__t && 0 <= main__tagbuf_len) && main__t <= main__tagbuf_len) && 0 <= -9 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0))) && !(__VERIFIER_assert__cond == 0)) && ((!(-1 * main__t + main__tagbuf_len <= 0) || !(-1 * main__t + main__tagbuf_len + 1 <= 0)) || main__t <= main__tagbuf_len)) || (((((((0 <= -1 + main__t && 0 <= main__tagbuf_len) && !(__VERIFIER_assert__cond == 0)) && main__t <= main__tagbuf_len) && 0 <= -9 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0)) || ((((0 <= -1 + main__t && 0 <= main__tagbuf_len) && main__t <= main__tagbuf_len) && 0 <= -9 + main__t) && ((main__t == 0 && !(-1 * main__t <= 0)) || -1 * main__t <= 0))) && ((!(-1 * main__t + main__tagbuf_len <= 0) || !(-1 * main__t + main__tagbuf_len + 1 <= 0)) || main__t <= main__tagbuf_len)) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2023-02-18 00:16:22,696 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