./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 574ddb4e Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-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 5b8ad5d8740269626905d9d5a2468afdc53741ffbc53080bd6ac9ee1933c3998 --- Real Ultimate output --- This is Ultimate 0.2.2-?-574ddb4 [2023-02-18 15:33:52,471 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 15:33:52,473 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 15:33:52,497 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 15:33:52,498 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 15:33:52,499 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 15:33:52,500 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 15:33:52,501 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 15:33:52,502 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 15:33:52,503 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 15:33:52,504 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 15:33:52,505 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 15:33:52,505 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 15:33:52,506 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 15:33:52,507 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 15:33:52,508 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 15:33:52,508 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 15:33:52,509 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 15:33:52,511 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 15:33:52,512 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 15:33:52,513 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 15:33:52,514 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 15:33:52,515 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 15:33:52,516 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 15:33:52,522 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 15:33:52,522 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 15:33:52,522 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 15:33:52,523 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 15:33:52,524 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 15:33:52,525 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 15:33:52,526 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 15:33:52,526 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 15:33:52,527 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 15:33:52,528 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 15:33:52,528 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 15:33:52,529 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 15:33:52,529 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 15:33:52,530 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 15:33:52,530 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 15:33:52,531 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 15:33:52,531 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 15:33:52,532 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-18 15:33:52,559 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 15:33:52,560 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 15:33:52,560 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 15:33:52,560 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 15:33:52,566 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-18 15:33:52,567 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-18 15:33:52,568 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 15:33:52,568 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 15:33:52,568 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 15:33:52,569 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 15:33:52,569 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-18 15:33:52,569 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-18 15:33:52,570 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-18 15:33:52,570 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 15:33:52,570 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-18 15:33:52,570 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-18 15:33:52,570 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-18 15:33:52,571 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-18 15:33:52,571 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-18 15:33:52,571 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 15:33:52,571 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-18 15:33:52,571 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 15:33:52,572 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 15:33:52,572 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-18 15:33:52,572 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 15:33:52,572 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 15:33:52,572 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-18 15:33:52,573 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-18 15:33:52,573 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-18 15:33:52,573 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-18 15:33:52,573 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-18 15:33:52,574 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-18 15:33:52,574 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-18 15:33:52,574 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-18 15:33:52,574 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-18 15:33:52,574 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 -> 5b8ad5d8740269626905d9d5a2468afdc53741ffbc53080bd6ac9ee1933c3998 [2023-02-18 15:33:52,829 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 15:33:52,859 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 15:33:52,862 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 15:33:52,863 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 15:33:52,864 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 15:33:52,865 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+sep-reducer.c [2023-02-18 15:33:54,006 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 15:33:54,300 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 15:33:54,300 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c [2023-02-18 15:33:54,326 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c731bec2/536390e729f644b4b5ff9c11a34b760f/FLAGad61f1d8b [2023-02-18 15:33:54,337 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c731bec2/536390e729f644b4b5ff9c11a34b760f [2023-02-18 15:33:54,340 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 15:33:54,341 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 15:33:54,342 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 15:33:54,342 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 15:33:54,345 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 15:33:54,346 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 03:33:54" (1/1) ... [2023-02-18 15:33:54,347 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c6b0883 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:33:54, skipping insertion in model container [2023-02-18 15:33:54,347 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 03:33:54" (1/1) ... [2023-02-18 15:33:54,353 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 15:33:54,423 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 15:33:54,559 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+sep-reducer.c[1000,1013] [2023-02-18 15:33:54,565 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+sep-reducer.c[1215,1228] [2023-02-18 15:33:54,902 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+sep-reducer.c[83573,83586] [2023-02-18 15:33:54,905 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+sep-reducer.c[83794,83807] [2023-02-18 15:33:54,910 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+sep-reducer.c[84257,84270] [2023-02-18 15:33:54,914 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+sep-reducer.c[84478,84491] [2023-02-18 15:33:54,918 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+sep-reducer.c[84801,84814] [2023-02-18 15:33:54,922 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+sep-reducer.c[85022,85035] [2023-02-18 15:33:54,925 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+sep-reducer.c[85521,85534] [2023-02-18 15:33:54,928 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+sep-reducer.c[85742,85755] [2023-02-18 15:33:54,932 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+sep-reducer.c[86050,86063] [2023-02-18 15:33:54,975 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+sep-reducer.c[86271,86284] [2023-02-18 15:33:54,978 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+sep-reducer.c[86594,86607] [2023-02-18 15:33:55,003 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+sep-reducer.c[86815,86828] [2023-02-18 15:33:55,007 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+sep-reducer.c[87258,87271] [2023-02-18 15:33:55,011 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+sep-reducer.c[87479,87492] [2023-02-18 15:33:55,032 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 15:33:55,040 INFO L203 MainTranslator]: Completed pre-run [2023-02-18 15:33:55,050 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+sep-reducer.c[1000,1013] [2023-02-18 15:33:55,053 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+sep-reducer.c[1215,1228] [2023-02-18 15:33:55,248 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+sep-reducer.c[83573,83586] [2023-02-18 15:33:55,251 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+sep-reducer.c[83794,83807] [2023-02-18 15:33:55,255 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+sep-reducer.c[84257,84270] [2023-02-18 15:33:55,258 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+sep-reducer.c[84478,84491] [2023-02-18 15:33:55,262 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+sep-reducer.c[84801,84814] [2023-02-18 15:33:55,265 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+sep-reducer.c[85022,85035] [2023-02-18 15:33:55,269 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+sep-reducer.c[85521,85534] [2023-02-18 15:33:55,272 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+sep-reducer.c[85742,85755] [2023-02-18 15:33:55,275 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+sep-reducer.c[86050,86063] [2023-02-18 15:33:55,281 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+sep-reducer.c[86271,86284] [2023-02-18 15:33:55,285 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+sep-reducer.c[86594,86607] [2023-02-18 15:33:55,288 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+sep-reducer.c[86815,86828] [2023-02-18 15:33:55,292 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+sep-reducer.c[87258,87271] [2023-02-18 15:33:55,295 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+sep-reducer.c[87479,87492] [2023-02-18 15:33:55,303 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 15:33:55,315 INFO L208 MainTranslator]: Completed translation [2023-02-18 15:33:55,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:33:55 WrapperNode [2023-02-18 15:33:55,316 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 15:33:55,317 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-18 15:33:55,317 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-18 15:33:55,317 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-18 15:33:55,323 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:33:55" (1/1) ... [2023-02-18 15:33:55,349 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:33:55" (1/1) ... [2023-02-18 15:33:55,435 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 3028 [2023-02-18 15:33:55,435 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-18 15:33:55,436 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-18 15:33:55,436 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-18 15:33:55,436 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-18 15:33:55,443 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:33:55" (1/1) ... [2023-02-18 15:33:55,444 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:33:55" (1/1) ... [2023-02-18 15:33:55,454 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:33:55" (1/1) ... [2023-02-18 15:33:55,454 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:33:55" (1/1) ... [2023-02-18 15:33:55,498 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:33:55" (1/1) ... [2023-02-18 15:33:55,516 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:33:55" (1/1) ... [2023-02-18 15:33:55,535 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:33:55" (1/1) ... [2023-02-18 15:33:55,548 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:33:55" (1/1) ... [2023-02-18 15:33:55,569 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-18 15:33:55,576 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-18 15:33:55,576 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-18 15:33:55,576 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-18 15:33:55,577 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:33:55" (1/1) ... [2023-02-18 15:33:55,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 15:33:55,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 15:33:55,607 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 15:33:55,627 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 15:33:55,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-18 15:33:55,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-18 15:33:55,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-18 15:33:55,647 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-18 15:33:55,975 INFO L235 CfgBuilder]: Building ICFG [2023-02-18 15:33:55,977 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-18 15:33:57,088 INFO L276 CfgBuilder]: Performing block encoding [2023-02-18 15:33:57,104 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-18 15:33:57,104 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2023-02-18 15:33:57,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 03:33:57 BoogieIcfgContainer [2023-02-18 15:33:57,113 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-18 15:33:57,114 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-18 15:33:57,115 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-18 15:33:57,117 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-18 15:33:57,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 03:33:54" (1/3) ... [2023-02-18 15:33:57,118 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6192c031 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 03:33:57, skipping insertion in model container [2023-02-18 15:33:57,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:33:55" (2/3) ... [2023-02-18 15:33:57,119 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6192c031 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 03:33:57, skipping insertion in model container [2023-02-18 15:33:57,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 03:33:57" (3/3) ... [2023-02-18 15:33:57,120 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.p+sep-reducer.c [2023-02-18 15:33:57,134 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-18 15:33:57,135 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2023-02-18 15:33:57,194 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-18 15:33:57,199 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;@472bf882, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-18 15:33:57,199 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-02-18 15:33:57,209 INFO L276 IsEmpty]: Start isEmpty. Operand has 475 states, 458 states have (on average 1.9672489082969433) internal successors, (901), 474 states have internal predecessors, (901), 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 15:33:57,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-18 15:33:57,218 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 15:33:57,218 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-18 15:33:57,220 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 15:33:57,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 15:33:57,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1804934597, now seen corresponding path program 1 times [2023-02-18 15:33:57,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 15:33:57,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258299563] [2023-02-18 15:33:57,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 15:33:57,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 15:33:57,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 15:33:57,503 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 15:33:57,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 15:33:57,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258299563] [2023-02-18 15:33:57,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258299563] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 15:33:57,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 15:33:57,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 15:33:57,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004127413] [2023-02-18 15:33:57,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 15:33:57,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 15:33:57,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 15:33:57,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 15:33:57,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 15:33:57,534 INFO L87 Difference]: Start difference. First operand has 475 states, 458 states have (on average 1.9672489082969433) internal successors, (901), 474 states have internal predecessors, (901), 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 15:33:58,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 15:33:58,483 INFO L93 Difference]: Finished difference Result 486 states and 909 transitions. [2023-02-18 15:33:58,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 15:33:58,486 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 15:33:58,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 15:33:58,498 INFO L225 Difference]: With dead ends: 486 [2023-02-18 15:33:58,499 INFO L226 Difference]: Without dead ends: 297 [2023-02-18 15:33:58,503 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 15:33:58,511 INFO L413 NwaCegarLoop]: 345 mSDtfsCounter, 757 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 1086 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 757 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 1215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 1086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-18 15:33:58,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [757 Valid, 689 Invalid, 1215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 1086 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-02-18 15:33:58,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2023-02-18 15:33:58,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2023-02-18 15:33:58,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 282 states have (on average 1.2765957446808511) internal successors, (360), 296 states have internal predecessors, (360), 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 15:33:58,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 360 transitions. [2023-02-18 15:33:58,583 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 360 transitions. Word has length 7 [2023-02-18 15:33:58,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 15:33:58,583 INFO L495 AbstractCegarLoop]: Abstraction has 297 states and 360 transitions. [2023-02-18 15:33:58,584 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 15:33:58,584 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 360 transitions. [2023-02-18 15:33:58,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-18 15:33:58,585 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 15:33:58,585 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 15:33:58,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-18 15:33:58,586 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 15:33:58,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 15:33:58,587 INFO L85 PathProgramCache]: Analyzing trace with hash 118401710, now seen corresponding path program 1 times [2023-02-18 15:33:58,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 15:33:58,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325201155] [2023-02-18 15:33:58,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 15:33:58,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 15:33:58,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 15:33:58,672 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 15:33:58,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 15:33:58,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325201155] [2023-02-18 15:33:58,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325201155] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 15:33:58,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 15:33:58,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 15:33:58,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241606983] [2023-02-18 15:33:58,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 15:33:58,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 15:33:58,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 15:33:58,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 15:33:58,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-18 15:33:58,675 INFO L87 Difference]: Start difference. First operand 297 states and 360 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 15:33:59,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 15:33:59,048 INFO L93 Difference]: Finished difference Result 297 states and 360 transitions. [2023-02-18 15:33:59,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 15:33:59,049 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 15:33:59,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 15:33:59,050 INFO L225 Difference]: With dead ends: 297 [2023-02-18 15:33:59,050 INFO L226 Difference]: Without dead ends: 292 [2023-02-18 15:33:59,051 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 15:33:59,052 INFO L413 NwaCegarLoop]: 349 mSDtfsCounter, 28 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-18 15:33:59,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 724 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-18 15:33:59,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2023-02-18 15:33:59,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2023-02-18 15:33:59,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 278 states have (on average 1.0611510791366907) internal successors, (295), 291 states have internal predecessors, (295), 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 15:33:59,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 295 transitions. [2023-02-18 15:33:59,064 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 295 transitions. Word has length 8 [2023-02-18 15:33:59,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 15:33:59,064 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 295 transitions. [2023-02-18 15:33:59,064 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 15:33:59,065 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 295 transitions. [2023-02-18 15:33:59,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2023-02-18 15:33:59,078 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 15:33:59,078 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 15:33:59,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-18 15:33:59,079 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 15:33:59,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 15:33:59,083 INFO L85 PathProgramCache]: Analyzing trace with hash 943449897, now seen corresponding path program 1 times [2023-02-18 15:33:59,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 15:33:59,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981744005] [2023-02-18 15:33:59,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 15:33:59,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 15:33:59,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 15:34:03,394 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 15:34:03,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 15:34:03,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981744005] [2023-02-18 15:34:03,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981744005] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 15:34:03,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 15:34:03,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [63] imperfect sequences [] total 63 [2023-02-18 15:34:03,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115523179] [2023-02-18 15:34:03,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 15:34:03,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2023-02-18 15:34:03,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 15:34:03,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2023-02-18 15:34:03,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1834, Invalid=2072, Unknown=0, NotChecked=0, Total=3906 [2023-02-18 15:34:03,399 INFO L87 Difference]: Start difference. First operand 292 states and 295 transitions. Second operand has 63 states, 63 states have (on average 3.873015873015873) internal successors, (244), 63 states have internal predecessors, (244), 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 15:34:04,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 15:34:04,107 INFO L93 Difference]: Finished difference Result 293 states and 296 transitions. [2023-02-18 15:34:04,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2023-02-18 15:34:04,108 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 3.873015873015873) internal successors, (244), 63 states have internal predecessors, (244), 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 244 [2023-02-18 15:34:04,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 15:34:04,114 INFO L225 Difference]: With dead ends: 293 [2023-02-18 15:34:04,114 INFO L226 Difference]: Without dead ends: 291 [2023-02-18 15:34:04,116 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1896, Invalid=2136, Unknown=0, NotChecked=0, Total=4032 [2023-02-18 15:34:04,117 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 339 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1522 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 1546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-18 15:34:04,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 75 Invalid, 1546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1522 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-18 15:34:04,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2023-02-18 15:34:04,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 290. [2023-02-18 15:34:04,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 277 states have (on average 1.0577617328519855) internal successors, (293), 289 states have internal predecessors, (293), 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 15:34:04,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 293 transitions. [2023-02-18 15:34:04,124 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 293 transitions. Word has length 244 [2023-02-18 15:34:04,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 15:34:04,124 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 293 transitions. [2023-02-18 15:34:04,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 3.873015873015873) internal successors, (244), 63 states have internal predecessors, (244), 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 15:34:04,125 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 293 transitions. [2023-02-18 15:34:04,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2023-02-18 15:34:04,127 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 15:34:04,127 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 15:34:04,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-18 15:34:04,127 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 15:34:04,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 15:34:04,128 INFO L85 PathProgramCache]: Analyzing trace with hash -817818172, now seen corresponding path program 1 times [2023-02-18 15:34:04,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 15:34:04,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652693265] [2023-02-18 15:34:04,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 15:34:04,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 15:34:04,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 15:34:10,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 15:34:10,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 15:34:10,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652693265] [2023-02-18 15:34:10,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652693265] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 15:34:10,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 15:34:10,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-18 15:34:10,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942500702] [2023-02-18 15:34:10,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 15:34:10,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-18 15:34:10,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 15:34:10,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-18 15:34:10,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-18 15:34:10,530 INFO L87 Difference]: Start difference. First operand 290 states and 293 transitions. Second operand has 7 states, 7 states have (on average 35.0) internal successors, (245), 7 states have internal predecessors, (245), 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 15:34:10,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 15:34:10,901 INFO L93 Difference]: Finished difference Result 292 states and 295 transitions. [2023-02-18 15:34:10,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 15:34:10,902 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 35.0) internal successors, (245), 7 states have internal predecessors, (245), 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 245 [2023-02-18 15:34:10,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 15:34:10,903 INFO L225 Difference]: With dead ends: 292 [2023-02-18 15:34:10,903 INFO L226 Difference]: Without dead ends: 290 [2023-02-18 15:34:10,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 114 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 15:34:10,905 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 205 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-18 15:34:10,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 46 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-18 15:34:10,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2023-02-18 15:34:10,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 288. [2023-02-18 15:34:10,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 276 states have (on average 1.0543478260869565) internal successors, (291), 287 states have internal predecessors, (291), 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 15:34:10,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 291 transitions. [2023-02-18 15:34:10,911 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 291 transitions. Word has length 245 [2023-02-18 15:34:10,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 15:34:10,911 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 291 transitions. [2023-02-18 15:34:10,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 35.0) internal successors, (245), 7 states have internal predecessors, (245), 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 15:34:10,912 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 291 transitions. [2023-02-18 15:34:10,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2023-02-18 15:34:10,914 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 15:34:10,914 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, 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, 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, 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, 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, 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 15:34:10,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-18 15:34:10,915 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 15:34:10,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 15:34:10,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1734300147, now seen corresponding path program 1 times [2023-02-18 15:34:10,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 15:34:10,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063816635] [2023-02-18 15:34:10,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 15:34:10,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 15:34:10,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 15:34:13,893 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 15:34:13,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 15:34:13,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063816635] [2023-02-18 15:34:13,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063816635] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 15:34:13,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 15:34:13,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [64] imperfect sequences [] total 64 [2023-02-18 15:34:13,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725473678] [2023-02-18 15:34:13,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 15:34:13,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2023-02-18 15:34:13,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 15:34:13,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2023-02-18 15:34:13,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1895, Invalid=2137, Unknown=0, NotChecked=0, Total=4032 [2023-02-18 15:34:13,898 INFO L87 Difference]: Start difference. First operand 288 states and 291 transitions. Second operand has 64 states, 64 states have (on average 3.875) internal successors, (248), 64 states have internal predecessors, (248), 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 15:34:14,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 15:34:14,662 INFO L93 Difference]: Finished difference Result 291 states and 294 transitions. [2023-02-18 15:34:14,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2023-02-18 15:34:14,663 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 3.875) internal successors, (248), 64 states have internal predecessors, (248), 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 248 [2023-02-18 15:34:14,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 15:34:14,664 INFO L225 Difference]: With dead ends: 291 [2023-02-18 15:34:14,664 INFO L226 Difference]: Without dead ends: 289 [2023-02-18 15:34:14,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1958, Invalid=2202, Unknown=0, NotChecked=0, Total=4160 [2023-02-18 15:34:14,667 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 208 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1773 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 1785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-18 15:34:14,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 69 Invalid, 1785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1773 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-18 15:34:14,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2023-02-18 15:34:14,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 286. [2023-02-18 15:34:14,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 275 states have (on average 1.050909090909091) internal successors, (289), 285 states have internal predecessors, (289), 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 15:34:14,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 289 transitions. [2023-02-18 15:34:14,673 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 289 transitions. Word has length 248 [2023-02-18 15:34:14,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 15:34:14,674 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 289 transitions. [2023-02-18 15:34:14,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 3.875) internal successors, (248), 64 states have internal predecessors, (248), 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 15:34:14,674 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 289 transitions. [2023-02-18 15:34:14,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2023-02-18 15:34:14,676 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 15:34:14,676 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, 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, 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, 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, 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, 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 15:34:14,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-18 15:34:14,677 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-02-18 15:34:14,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 15:34:14,677 INFO L85 PathProgramCache]: Analyzing trace with hash -2071264176, now seen corresponding path program 1 times [2023-02-18 15:34:14,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 15:34:14,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135262854] [2023-02-18 15:34:14,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 15:34:14,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 15:34:14,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 15:34:19,525 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 15:34:19,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 15:34:19,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135262854] [2023-02-18 15:34:19,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135262854] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 15:34:19,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 15:34:19,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-18 15:34:19,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096275603] [2023-02-18 15:34:19,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 15:34:19,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-18 15:34:19,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 15:34:19,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-18 15:34:19,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-18 15:34:19,531 INFO L87 Difference]: Start difference. First operand 286 states and 289 transitions. Second operand has 7 states, 7 states have (on average 35.57142857142857) internal successors, (249), 7 states have internal predecessors, (249), 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 15:34:19,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 15:34:19,943 INFO L93 Difference]: Finished difference Result 286 states and 289 transitions. [2023-02-18 15:34:19,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 15:34:19,944 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 35.57142857142857) internal successors, (249), 7 states have internal predecessors, (249), 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 249 [2023-02-18 15:34:19,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 15:34:19,946 INFO L225 Difference]: With dead ends: 286 [2023-02-18 15:34:19,946 INFO L226 Difference]: Without dead ends: 284 [2023-02-18 15:34:19,948 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 116 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 15:34:19,950 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 112 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-18 15:34:19,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 51 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-18 15:34:19,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2023-02-18 15:34:19,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 284. [2023-02-18 15:34:19,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 274 states have (on average 1.0474452554744527) internal successors, (287), 283 states have internal predecessors, (287), 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 15:34:19,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 287 transitions. [2023-02-18 15:34:19,962 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 287 transitions. Word has length 249 [2023-02-18 15:34:19,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 15:34:19,962 INFO L495 AbstractCegarLoop]: Abstraction has 284 states and 287 transitions. [2023-02-18 15:34:19,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 35.57142857142857) internal successors, (249), 7 states have internal predecessors, (249), 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 15:34:19,963 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 287 transitions. [2023-02-18 15:34:19,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2023-02-18 15:34:19,965 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 15:34:19,966 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, 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, 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, 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, 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, 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 15:34:19,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-18 15:34:19,966 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-02-18 15:34:19,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 15:34:19,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1914822156, now seen corresponding path program 1 times [2023-02-18 15:34:19,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 15:34:19,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87522074] [2023-02-18 15:34:19,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 15:34:19,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 15:34:20,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 15:34:20,218 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 15:34:20,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 15:34:20,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87522074] [2023-02-18 15:34:20,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87522074] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 15:34:20,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 15:34:20,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 15:34:20,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923640033] [2023-02-18 15:34:20,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 15:34:20,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 15:34:20,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 15:34:20,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 15:34:20,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 15:34:20,221 INFO L87 Difference]: Start difference. First operand 284 states and 287 transitions. Second operand has 4 states, 4 states have (on average 62.75) internal successors, (251), 4 states have internal predecessors, (251), 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 15:34:20,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 15:34:20,411 INFO L93 Difference]: Finished difference Result 284 states and 287 transitions. [2023-02-18 15:34:20,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 15:34:20,412 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 62.75) internal successors, (251), 4 states have internal predecessors, (251), 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 251 [2023-02-18 15:34:20,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 15:34:20,413 INFO L225 Difference]: With dead ends: 284 [2023-02-18 15:34:20,413 INFO L226 Difference]: Without dead ends: 282 [2023-02-18 15:34:20,414 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 15:34:20,414 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 40 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 15:34:20,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 306 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 15:34:20,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2023-02-18 15:34:20,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2023-02-18 15:34:20,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 273 states have (on average 1.043956043956044) internal successors, (285), 281 states have internal predecessors, (285), 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 15:34:20,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 285 transitions. [2023-02-18 15:34:20,420 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 285 transitions. Word has length 251 [2023-02-18 15:34:20,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 15:34:20,421 INFO L495 AbstractCegarLoop]: Abstraction has 282 states and 285 transitions. [2023-02-18 15:34:20,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.75) internal successors, (251), 4 states have internal predecessors, (251), 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 15:34:20,421 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 285 transitions. [2023-02-18 15:34:20,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2023-02-18 15:34:20,423 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 15:34:20,423 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, 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, 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, 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, 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, 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 15:34:20,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-18 15:34:20,424 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-02-18 15:34:20,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 15:34:20,425 INFO L85 PathProgramCache]: Analyzing trace with hash 770061441, now seen corresponding path program 1 times [2023-02-18 15:34:20,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 15:34:20,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318674176] [2023-02-18 15:34:20,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 15:34:20,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 15:34:20,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 15:34:20,682 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 15:34:20,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 15:34:20,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318674176] [2023-02-18 15:34:20,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318674176] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 15:34:20,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 15:34:20,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 15:34:20,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858055281] [2023-02-18 15:34:20,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 15:34:20,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 15:34:20,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 15:34:20,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 15:34:20,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 15:34:20,691 INFO L87 Difference]: Start difference. First operand 282 states and 285 transitions. Second operand has 4 states, 4 states have (on average 63.0) internal successors, (252), 4 states have internal predecessors, (252), 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 15:34:20,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 15:34:20,929 INFO L93 Difference]: Finished difference Result 282 states and 285 transitions. [2023-02-18 15:34:20,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 15:34:20,929 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 63.0) internal successors, (252), 4 states have internal predecessors, (252), 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 252 [2023-02-18 15:34:20,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 15:34:20,931 INFO L225 Difference]: With dead ends: 282 [2023-02-18 15:34:20,931 INFO L226 Difference]: Without dead ends: 278 [2023-02-18 15:34:20,931 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 15:34:20,931 INFO L413 NwaCegarLoop]: 277 mSDtfsCounter, 9 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 15:34:20,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 572 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 15:34:20,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2023-02-18 15:34:20,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2023-02-18 15:34:20,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 270 states have (on average 1.0407407407407407) internal successors, (281), 277 states have internal predecessors, (281), 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 15:34:20,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 281 transitions. [2023-02-18 15:34:20,937 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 281 transitions. Word has length 252 [2023-02-18 15:34:20,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 15:34:20,938 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 281 transitions. [2023-02-18 15:34:20,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.0) internal successors, (252), 4 states have internal predecessors, (252), 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 15:34:20,938 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 281 transitions. [2023-02-18 15:34:20,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2023-02-18 15:34:20,940 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 15:34:20,941 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, 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, 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, 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, 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, 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 15:34:20,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-18 15:34:20,941 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-02-18 15:34:20,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 15:34:20,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1881027289, now seen corresponding path program 1 times [2023-02-18 15:34:20,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 15:34:20,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162045955] [2023-02-18 15:34:20,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 15:34:20,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 15:34:20,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 15:34:23,491 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 15:34:23,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 15:34:23,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162045955] [2023-02-18 15:34:23,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162045955] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 15:34:23,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 15:34:23,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2023-02-18 15:34:23,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908572033] [2023-02-18 15:34:23,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 15:34:23,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2023-02-18 15:34:23,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 15:34:23,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2023-02-18 15:34:23,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1957, Invalid=2203, Unknown=0, NotChecked=0, Total=4160 [2023-02-18 15:34:23,496 INFO L87 Difference]: Start difference. First operand 278 states and 281 transitions. Second operand has 65 states, 65 states have (on average 3.8923076923076922) internal successors, (253), 65 states have internal predecessors, (253), 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 15:34:24,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 15:34:24,137 INFO L93 Difference]: Finished difference Result 288 states and 292 transitions. [2023-02-18 15:34:24,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2023-02-18 15:34:24,138 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 3.8923076923076922) internal successors, (253), 65 states have internal predecessors, (253), 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 253 [2023-02-18 15:34:24,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 15:34:24,140 INFO L225 Difference]: With dead ends: 288 [2023-02-18 15:34:24,140 INFO L226 Difference]: Without dead ends: 286 [2023-02-18 15:34:24,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2021, Invalid=2269, Unknown=0, NotChecked=0, Total=4290 [2023-02-18 15:34:24,143 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 254 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 1461 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 1480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-18 15:34:24,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 74 Invalid, 1480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1461 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-18 15:34:24,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2023-02-18 15:34:24,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 276. [2023-02-18 15:34:24,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 269 states have (on average 1.037174721189591) internal successors, (279), 275 states have internal predecessors, (279), 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 15:34:24,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 279 transitions. [2023-02-18 15:34:24,149 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 279 transitions. Word has length 253 [2023-02-18 15:34:24,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 15:34:24,149 INFO L495 AbstractCegarLoop]: Abstraction has 276 states and 279 transitions. [2023-02-18 15:34:24,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 3.8923076923076922) internal successors, (253), 65 states have internal predecessors, (253), 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 15:34:24,150 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 279 transitions. [2023-02-18 15:34:24,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2023-02-18 15:34:24,152 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 15:34:24,152 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, 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, 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, 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, 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, 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 15:34:24,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-18 15:34:24,153 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-02-18 15:34:24,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 15:34:24,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1882751193, now seen corresponding path program 1 times [2023-02-18 15:34:24,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 15:34:24,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713030743] [2023-02-18 15:34:24,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 15:34:24,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 15:34:24,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 15:34:26,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 15:34:26,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 15:34:26,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713030743] [2023-02-18 15:34:26,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713030743] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 15:34:26,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 15:34:26,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2023-02-18 15:34:26,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699837011] [2023-02-18 15:34:26,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 15:34:26,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2023-02-18 15:34:26,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 15:34:26,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2023-02-18 15:34:26,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1957, Invalid=2203, Unknown=0, NotChecked=0, Total=4160 [2023-02-18 15:34:26,383 INFO L87 Difference]: Start difference. First operand 276 states and 279 transitions. Second operand has 65 states, 65 states have (on average 3.8923076923076922) internal successors, (253), 65 states have internal predecessors, (253), 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 15:34:27,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 15:34:27,110 INFO L93 Difference]: Finished difference Result 301 states and 307 transitions. [2023-02-18 15:34:27,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2023-02-18 15:34:27,111 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 3.8923076923076922) internal successors, (253), 65 states have internal predecessors, (253), 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 253 [2023-02-18 15:34:27,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 15:34:27,112 INFO L225 Difference]: With dead ends: 301 [2023-02-18 15:34:27,112 INFO L226 Difference]: Without dead ends: 299 [2023-02-18 15:34:27,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2021, Invalid=2269, Unknown=0, NotChecked=0, Total=4290 [2023-02-18 15:34:27,114 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 109 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 1908 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 1915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-18 15:34:27,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 84 Invalid, 1915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1908 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-18 15:34:27,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-02-18 15:34:27,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 274. [2023-02-18 15:34:27,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 268 states have (on average 1.0335820895522387) internal successors, (277), 273 states have internal predecessors, (277), 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 15:34:27,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 277 transitions. [2023-02-18 15:34:27,120 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 277 transitions. Word has length 253 [2023-02-18 15:34:27,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 15:34:27,120 INFO L495 AbstractCegarLoop]: Abstraction has 274 states and 277 transitions. [2023-02-18 15:34:27,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 3.8923076923076922) internal successors, (253), 65 states have internal predecessors, (253), 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 15:34:27,121 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 277 transitions. [2023-02-18 15:34:27,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2023-02-18 15:34:27,122 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 15:34:27,122 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, 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, 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, 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, 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, 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 15:34:27,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-18 15:34:27,122 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-02-18 15:34:27,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 15:34:27,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1817702396, now seen corresponding path program 1 times [2023-02-18 15:34:27,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 15:34:27,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291590253] [2023-02-18 15:34:27,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 15:34:27,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 15:34:27,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 15:34:31,547 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 15:34:31,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 15:34:31,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291590253] [2023-02-18 15:34:31,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291590253] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 15:34:31,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 15:34:31,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-18 15:34:31,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338203477] [2023-02-18 15:34:31,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 15:34:31,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-18 15:34:31,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 15:34:31,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-18 15:34:31,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-18 15:34:31,550 INFO L87 Difference]: Start difference. First operand 274 states and 277 transitions. Second operand has 7 states, 7 states have (on average 36.285714285714285) internal successors, (254), 7 states have internal predecessors, (254), 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 15:34:31,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 15:34:31,917 INFO L93 Difference]: Finished difference Result 274 states and 277 transitions. [2023-02-18 15:34:31,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 15:34:31,918 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 36.285714285714285) internal successors, (254), 7 states have internal predecessors, (254), 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 254 [2023-02-18 15:34:31,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 15:34:31,919 INFO L225 Difference]: With dead ends: 274 [2023-02-18 15:34:31,919 INFO L226 Difference]: Without dead ends: 270 [2023-02-18 15:34:31,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 118 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 15:34:31,920 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 27 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 647 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-18 15:34:31,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 48 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 647 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-18 15:34:31,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2023-02-18 15:34:31,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2023-02-18 15:34:31,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 265 states have (on average 1.030188679245283) internal successors, (273), 269 states have internal predecessors, (273), 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 15:34:31,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 273 transitions. [2023-02-18 15:34:31,925 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 273 transitions. Word has length 254 [2023-02-18 15:34:31,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 15:34:31,926 INFO L495 AbstractCegarLoop]: Abstraction has 270 states and 273 transitions. [2023-02-18 15:34:31,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.285714285714285) internal successors, (254), 7 states have internal predecessors, (254), 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 15:34:31,926 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 273 transitions. [2023-02-18 15:34:31,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2023-02-18 15:34:31,927 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 15:34:31,928 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, 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, 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, 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, 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, 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 15:34:31,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-18 15:34:31,928 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-02-18 15:34:31,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 15:34:31,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1818153234, now seen corresponding path program 1 times [2023-02-18 15:34:31,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 15:34:31,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13659354] [2023-02-18 15:34:31,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 15:34:31,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 15:34:31,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 15:34:34,173 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 15:34:34,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 15:34:34,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13659354] [2023-02-18 15:34:34,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13659354] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 15:34:34,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 15:34:34,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2023-02-18 15:34:34,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749147869] [2023-02-18 15:34:34,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 15:34:34,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2023-02-18 15:34:34,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 15:34:34,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2023-02-18 15:34:34,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1957, Invalid=2203, Unknown=0, NotChecked=0, Total=4160 [2023-02-18 15:34:34,177 INFO L87 Difference]: Start difference. First operand 270 states and 273 transitions. Second operand has 65 states, 65 states have (on average 3.9076923076923076) internal successors, (254), 65 states have internal predecessors, (254), 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 15:34:34,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 15:34:34,778 INFO L93 Difference]: Finished difference Result 296 states and 302 transitions. [2023-02-18 15:34:34,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2023-02-18 15:34:34,781 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 3.9076923076923076) internal successors, (254), 65 states have internal predecessors, (254), 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 254 [2023-02-18 15:34:34,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 15:34:34,783 INFO L225 Difference]: With dead ends: 296 [2023-02-18 15:34:34,783 INFO L226 Difference]: Without dead ends: 294 [2023-02-18 15:34:34,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2021, Invalid=2269, Unknown=0, NotChecked=0, Total=4290 [2023-02-18 15:34:34,785 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 190 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 1502 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 1521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-18 15:34:34,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 75 Invalid, 1521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1502 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-18 15:34:34,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2023-02-18 15:34:34,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 268. [2023-02-18 15:34:34,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 264 states have (on average 1.0265151515151516) internal successors, (271), 267 states have internal predecessors, (271), 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 15:34:34,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 271 transitions. [2023-02-18 15:34:34,790 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 271 transitions. Word has length 254 [2023-02-18 15:34:34,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 15:34:34,791 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 271 transitions. [2023-02-18 15:34:34,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 3.9076923076923076) internal successors, (254), 65 states have internal predecessors, (254), 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 15:34:34,791 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 271 transitions. [2023-02-18 15:34:34,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2023-02-18 15:34:34,792 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 15:34:34,793 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, 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, 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, 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, 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, 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 15:34:34,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-18 15:34:34,793 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-02-18 15:34:34,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 15:34:34,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1764261316, now seen corresponding path program 1 times [2023-02-18 15:34:34,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 15:34:34,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487466286] [2023-02-18 15:34:34,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 15:34:34,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 15:34:34,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 15:34:38,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 15:34:38,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 15:34:38,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487466286] [2023-02-18 15:34:38,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487466286] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 15:34:38,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 15:34:38,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-18 15:34:38,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012193376] [2023-02-18 15:34:38,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 15:34:38,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-18 15:34:38,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 15:34:38,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-18 15:34:38,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-18 15:34:38,964 INFO L87 Difference]: Start difference. First operand 268 states and 271 transitions. Second operand has 7 states, 7 states have (on average 36.285714285714285) internal successors, (254), 7 states have internal predecessors, (254), 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 15:34:39,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 15:34:39,315 INFO L93 Difference]: Finished difference Result 278 states and 283 transitions. [2023-02-18 15:34:39,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 15:34:39,315 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 36.285714285714285) internal successors, (254), 7 states have internal predecessors, (254), 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 254 [2023-02-18 15:34:39,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 15:34:39,316 INFO L225 Difference]: With dead ends: 278 [2023-02-18 15:34:39,317 INFO L226 Difference]: Without dead ends: 276 [2023-02-18 15:34:39,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 118 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 15:34:39,318 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 56 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-18 15:34:39,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 41 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-18 15:34:39,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2023-02-18 15:34:39,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 266. [2023-02-18 15:34:39,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 263 states have (on average 1.0228136882129277) internal successors, (269), 265 states have internal predecessors, (269), 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 15:34:39,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 269 transitions. [2023-02-18 15:34:39,323 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 269 transitions. Word has length 254 [2023-02-18 15:34:39,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 15:34:39,323 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 269 transitions. [2023-02-18 15:34:39,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.285714285714285) internal successors, (254), 7 states have internal predecessors, (254), 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 15:34:39,324 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 269 transitions. [2023-02-18 15:34:39,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2023-02-18 15:34:39,325 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 15:34:39,325 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, 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, 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, 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, 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, 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 15:34:39,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-18 15:34:39,325 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-02-18 15:34:39,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 15:34:39,326 INFO L85 PathProgramCache]: Analyzing trace with hash 528181598, now seen corresponding path program 1 times [2023-02-18 15:34:39,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 15:34:39,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71279226] [2023-02-18 15:34:39,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 15:34:39,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 15:34:39,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 15:34:43,513 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 15:34:43,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 15:34:43,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71279226] [2023-02-18 15:34:43,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71279226] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 15:34:43,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 15:34:43,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-18 15:34:43,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629625138] [2023-02-18 15:34:43,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 15:34:43,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-18 15:34:43,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 15:34:43,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-18 15:34:43,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-18 15:34:43,516 INFO L87 Difference]: Start difference. First operand 266 states and 269 transitions. Second operand has 7 states, 7 states have (on average 36.42857142857143) internal successors, (255), 7 states have internal predecessors, (255), 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 15:34:43,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 15:34:43,860 INFO L93 Difference]: Finished difference Result 281 states and 286 transitions. [2023-02-18 15:34:43,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 15:34:43,862 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 36.42857142857143) internal successors, (255), 7 states have internal predecessors, (255), 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 255 [2023-02-18 15:34:43,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 15:34:43,863 INFO L225 Difference]: With dead ends: 281 [2023-02-18 15:34:43,863 INFO L226 Difference]: Without dead ends: 279 [2023-02-18 15:34:43,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 118 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 15:34:43,864 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 61 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-18 15:34:43,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 52 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 657 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-18 15:34:43,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2023-02-18 15:34:43,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 264. [2023-02-18 15:34:43,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 262 states have (on average 1.0190839694656488) internal successors, (267), 263 states have internal predecessors, (267), 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 15:34:43,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 267 transitions. [2023-02-18 15:34:43,869 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 267 transitions. Word has length 255 [2023-02-18 15:34:43,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 15:34:43,870 INFO L495 AbstractCegarLoop]: Abstraction has 264 states and 267 transitions. [2023-02-18 15:34:43,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.42857142857143) internal successors, (255), 7 states have internal predecessors, (255), 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 15:34:43,870 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 267 transitions. [2023-02-18 15:34:43,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2023-02-18 15:34:43,871 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 15:34:43,872 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, 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, 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, 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, 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, 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 15:34:43,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-18 15:34:43,872 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-02-18 15:34:43,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 15:34:43,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1056764025, now seen corresponding path program 1 times [2023-02-18 15:34:43,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 15:34:43,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495585100] [2023-02-18 15:34:43,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 15:34:43,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 15:34:43,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 15:34:44,089 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 15:34:44,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 15:34:44,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495585100] [2023-02-18 15:34:44,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495585100] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 15:34:44,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 15:34:44,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 15:34:44,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865930849] [2023-02-18 15:34:44,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 15:34:44,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 15:34:44,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 15:34:44,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 15:34:44,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 15:34:44,092 INFO L87 Difference]: Start difference. First operand 264 states and 267 transitions. Second operand has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 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 15:34:44,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 15:34:44,235 INFO L93 Difference]: Finished difference Result 264 states and 267 transitions. [2023-02-18 15:34:44,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 15:34:44,236 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 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 256 [2023-02-18 15:34:44,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 15:34:44,237 INFO L225 Difference]: With dead ends: 264 [2023-02-18 15:34:44,237 INFO L226 Difference]: Without dead ends: 262 [2023-02-18 15:34:44,237 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 15:34:44,238 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 15 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 15:34:44,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 272 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 15:34:44,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2023-02-18 15:34:44,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 262. [2023-02-18 15:34:44,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 261 states have (on average 1.0153256704980842) internal successors, (265), 261 states have internal predecessors, (265), 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 15:34:44,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 265 transitions. [2023-02-18 15:34:44,243 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 265 transitions. Word has length 256 [2023-02-18 15:34:44,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 15:34:44,244 INFO L495 AbstractCegarLoop]: Abstraction has 262 states and 265 transitions. [2023-02-18 15:34:44,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 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 15:34:44,244 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 265 transitions. [2023-02-18 15:34:44,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2023-02-18 15:34:44,245 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 15:34:44,245 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, 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, 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, 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, 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, 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 15:34:44,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-02-18 15:34:44,246 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-02-18 15:34:44,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 15:34:44,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1600059765, now seen corresponding path program 1 times [2023-02-18 15:34:44,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 15:34:44,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874831425] [2023-02-18 15:34:44,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 15:34:44,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 15:34:44,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 15:34:44,405 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 15:34:44,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 15:34:44,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874831425] [2023-02-18 15:34:44,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874831425] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 15:34:44,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 15:34:44,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 15:34:44,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363428071] [2023-02-18 15:34:44,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 15:34:44,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 15:34:44,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 15:34:44,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 15:34:44,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 15:34:44,407 INFO L87 Difference]: Start difference. First operand 262 states and 265 transitions. Second operand has 4 states, 4 states have (on average 64.25) internal successors, (257), 4 states have internal predecessors, (257), 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 15:34:44,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 15:34:44,603 INFO L93 Difference]: Finished difference Result 262 states and 265 transitions. [2023-02-18 15:34:44,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 15:34:44,603 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 64.25) internal successors, (257), 4 states have internal predecessors, (257), 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 257 [2023-02-18 15:34:44,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 15:34:44,603 INFO L225 Difference]: With dead ends: 262 [2023-02-18 15:34:44,603 INFO L226 Difference]: Without dead ends: 0 [2023-02-18 15:34:44,604 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 15:34:44,604 INFO L413 NwaCegarLoop]: 258 mSDtfsCounter, 4 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 15:34:44,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 522 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 15:34:44,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-18 15:34:44,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-18 15:34:44,605 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 15:34:44,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-18 15:34:44,606 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 257 [2023-02-18 15:34:44,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 15:34:44,606 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-18 15:34:44,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 64.25) internal successors, (257), 4 states have internal predecessors, (257), 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 15:34:44,606 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-18 15:34:44,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-18 15:34:44,609 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (15 of 16 remaining) [2023-02-18 15:34:44,609 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (14 of 16 remaining) [2023-02-18 15:34:44,609 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (13 of 16 remaining) [2023-02-18 15:34:44,610 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (12 of 16 remaining) [2023-02-18 15:34:44,610 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (11 of 16 remaining) [2023-02-18 15:34:44,610 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (10 of 16 remaining) [2023-02-18 15:34:44,610 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (9 of 16 remaining) [2023-02-18 15:34:44,610 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (8 of 16 remaining) [2023-02-18 15:34:44,610 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (7 of 16 remaining) [2023-02-18 15:34:44,611 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (6 of 16 remaining) [2023-02-18 15:34:44,611 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (5 of 16 remaining) [2023-02-18 15:34:44,611 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (4 of 16 remaining) [2023-02-18 15:34:44,611 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (3 of 16 remaining) [2023-02-18 15:34:44,611 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (2 of 16 remaining) [2023-02-18 15:34:44,611 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION (1 of 16 remaining) [2023-02-18 15:34:44,612 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION (0 of 16 remaining) [2023-02-18 15:34:44,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-02-18 15:34:44,614 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-18 15:34:44,619 INFO L899 garLoopResultBuilder]: For program point L1951(lines 1951 5176) no Hoare annotation was computed. [2023-02-18 15:34:44,620 INFO L899 garLoopResultBuilder]: For program point L2744(lines 2744 2755) no Hoare annotation was computed. [2023-02-18 15:34:44,620 INFO L899 garLoopResultBuilder]: For program point L4726(line 4726) no Hoare annotation was computed. [2023-02-18 15:34:44,620 INFO L895 garLoopResultBuilder]: At program point L366(lines 360 554) the Hoare annotation is: (let ((.cse0 (<= (* (- 1) |ULTIMATE.start_main_~main__t~0#1|) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_~main__t~0#1| 0)) .cse0)) [2023-02-18 15:34:44,620 INFO L899 garLoopResultBuilder]: For program point L3141(lines 3141 3165) no Hoare annotation was computed. [2023-02-18 15:34:44,620 INFO L899 garLoopResultBuilder]: For program point L3934(lines 3934 5000) no Hoare annotation was computed. [2023-02-18 15:34:44,620 INFO L899 garLoopResultBuilder]: For program point L3670(lines 3670 5023) no Hoare annotation was computed. [2023-02-18 15:34:44,621 INFO L899 garLoopResultBuilder]: For program point L3406(lines 3406 5046) no Hoare annotation was computed. [2023-02-18 15:34:44,621 INFO L899 garLoopResultBuilder]: For program point L4331(lines 4331 4966) no Hoare annotation was computed. [2023-02-18 15:34:44,621 INFO L899 garLoopResultBuilder]: For program point L897(lines 897 921) no Hoare annotation was computed. [2023-02-18 15:34:44,621 INFO L899 garLoopResultBuilder]: For program point L1690(lines 1690 5198) no Hoare annotation was computed. [2023-02-18 15:34:44,621 INFO L899 garLoopResultBuilder]: For program point L1426(lines 1426 5221) no Hoare annotation was computed. [2023-02-18 15:34:44,621 INFO L899 garLoopResultBuilder]: For program point L237(lines 237 257) no Hoare annotation was computed. [2023-02-18 15:34:44,621 INFO L899 garLoopResultBuilder]: For program point L1162(lines 1162 5244) no Hoare annotation was computed. [2023-02-18 15:34:44,621 INFO L899 garLoopResultBuilder]: For program point L2087(lines 2087 5164) no Hoare annotation was computed. [2023-02-18 15:34:44,622 INFO L899 garLoopResultBuilder]: For program point L2880(lines 2880 2891) no Hoare annotation was computed. [2023-02-18 15:34:44,622 INFO L899 garLoopResultBuilder]: For program point L370(lines 370 553) no Hoare annotation was computed. [2023-02-18 15:34:44,622 INFO L899 garLoopResultBuilder]: For program point L3277(lines 3277 3301) no Hoare annotation was computed. [2023-02-18 15:34:44,622 INFO L899 garLoopResultBuilder]: For program point L4070(lines 4070 4988) no Hoare annotation was computed. [2023-02-18 15:34:44,622 INFO L899 garLoopResultBuilder]: For program point L3806(lines 3806 5011) no Hoare annotation was computed. [2023-02-18 15:34:44,622 INFO L899 garLoopResultBuilder]: For program point L3542(lines 3542 5034) no Hoare annotation was computed. [2023-02-18 15:34:44,622 INFO L899 garLoopResultBuilder]: For program point L4467(lines 4467 4954) no Hoare annotation was computed. [2023-02-18 15:34:44,622 INFO L899 garLoopResultBuilder]: For program point L4864(lines 4864 4874) no Hoare annotation was computed. [2023-02-18 15:34:44,623 INFO L899 garLoopResultBuilder]: For program point L1033(lines 1033 1057) no Hoare annotation was computed. [2023-02-18 15:34:44,623 INFO L899 garLoopResultBuilder]: For program point L1826(lines 1826 5186) no Hoare annotation was computed. [2023-02-18 15:34:44,623 INFO L899 garLoopResultBuilder]: For program point L1562(lines 1562 5209) no Hoare annotation was computed. [2023-02-18 15:34:44,623 INFO L899 garLoopResultBuilder]: For program point L1298(lines 1298 5232) no Hoare annotation was computed. [2023-02-18 15:34:44,623 INFO L899 garLoopResultBuilder]: For program point L2223(lines 2223 5152) no Hoare annotation was computed. [2023-02-18 15:34:44,623 INFO L899 garLoopResultBuilder]: For program point L3016(lines 3016 3027) no Hoare annotation was computed. [2023-02-18 15:34:44,623 INFO L899 garLoopResultBuilder]: For program point L4866(line 4866) no Hoare annotation was computed. [2023-02-18 15:34:44,623 INFO L899 garLoopResultBuilder]: For program point L3413(lines 3413 3437) no Hoare annotation was computed. [2023-02-18 15:34:44,624 INFO L899 garLoopResultBuilder]: For program point L4206(lines 4206 4976) no Hoare annotation was computed. [2023-02-18 15:34:44,624 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 22 5301) the Hoare annotation is: true [2023-02-18 15:34:44,624 INFO L899 garLoopResultBuilder]: For program point L3942(lines 3942 4999) no Hoare annotation was computed. [2023-02-18 15:34:44,624 INFO L899 garLoopResultBuilder]: For program point L3678(lines 3678 5022) no Hoare annotation was computed. [2023-02-18 15:34:44,624 INFO L899 garLoopResultBuilder]: For program point L4603(lines 4603 4942) no Hoare annotation was computed. [2023-02-18 15:34:44,624 INFO L899 garLoopResultBuilder]: For program point L772(lines 772 783) no Hoare annotation was computed. [2023-02-18 15:34:44,624 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 4690) no Hoare annotation was computed. [2023-02-18 15:34:44,625 INFO L899 garLoopResultBuilder]: For program point L1169(lines 1169 1193) no Hoare annotation was computed. [2023-02-18 15:34:44,625 INFO L899 garLoopResultBuilder]: For program point L112(lines 112 119) no Hoare annotation was computed. [2023-02-18 15:34:44,625 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 4893) no Hoare annotation was computed. [2023-02-18 15:34:44,625 INFO L899 garLoopResultBuilder]: For program point L1962(lines 1962 5174) no Hoare annotation was computed. [2023-02-18 15:34:44,625 INFO L899 garLoopResultBuilder]: For program point L1698(lines 1698 5197) no Hoare annotation was computed. [2023-02-18 15:34:44,625 INFO L899 garLoopResultBuilder]: For program point L1434(lines 1434 5220) no Hoare annotation was computed. [2023-02-18 15:34:44,625 INFO L899 garLoopResultBuilder]: For program point L377(lines 377 397) no Hoare annotation was computed. [2023-02-18 15:34:44,626 INFO L899 garLoopResultBuilder]: For program point L2359(lines 2359 5140) no Hoare annotation was computed. [2023-02-18 15:34:44,626 INFO L899 garLoopResultBuilder]: For program point L3152(lines 3152 3163) no Hoare annotation was computed. [2023-02-18 15:34:44,626 INFO L899 garLoopResultBuilder]: For program point L3549(lines 3549 3573) no Hoare annotation was computed. [2023-02-18 15:34:44,626 INFO L899 garLoopResultBuilder]: For program point L4342(lines 4342 4964) no Hoare annotation was computed. [2023-02-18 15:34:44,626 INFO L899 garLoopResultBuilder]: For program point L4078(lines 4078 4987) no Hoare annotation was computed. [2023-02-18 15:34:44,626 INFO L899 garLoopResultBuilder]: For program point L3814(lines 3814 5010) no Hoare annotation was computed. [2023-02-18 15:34:44,626 INFO L899 garLoopResultBuilder]: For program point L908(lines 908 919) no Hoare annotation was computed. [2023-02-18 15:34:44,626 INFO L899 garLoopResultBuilder]: For program point L1305(lines 1305 1329) no Hoare annotation was computed. [2023-02-18 15:34:44,627 INFO L899 garLoopResultBuilder]: For program point L248(lines 248 255) no Hoare annotation was computed. [2023-02-18 15:34:44,627 INFO L899 garLoopResultBuilder]: For program point L2098(lines 2098 5162) no Hoare annotation was computed. [2023-02-18 15:34:44,627 INFO L899 garLoopResultBuilder]: For program point L1834(lines 1834 5185) no Hoare annotation was computed. [2023-02-18 15:34:44,627 INFO L899 garLoopResultBuilder]: For program point L4741(lines 4741 4763) no Hoare annotation was computed. [2023-02-18 15:34:44,627 INFO L899 garLoopResultBuilder]: For program point L1570(lines 1570 5208) no Hoare annotation was computed. [2023-02-18 15:34:44,627 INFO L899 garLoopResultBuilder]: For program point L2495(lines 2495 5128) no Hoare annotation was computed. [2023-02-18 15:34:44,627 INFO L899 garLoopResultBuilder]: For program point L3288(lines 3288 3299) no Hoare annotation was computed. [2023-02-18 15:34:44,627 INFO L899 garLoopResultBuilder]: For program point L3685(lines 3685 3709) no Hoare annotation was computed. [2023-02-18 15:34:44,628 INFO L899 garLoopResultBuilder]: For program point L4478(lines 4478 4952) no Hoare annotation was computed. [2023-02-18 15:34:44,628 INFO L899 garLoopResultBuilder]: For program point L4214(lines 4214 4975) no Hoare annotation was computed. [2023-02-18 15:34:44,628 INFO L899 garLoopResultBuilder]: For program point L3950(lines 3950 4998) no Hoare annotation was computed. [2023-02-18 15:34:44,628 INFO L899 garLoopResultBuilder]: For program point L4743(line 4743) no Hoare annotation was computed. [2023-02-18 15:34:44,628 INFO L899 garLoopResultBuilder]: For program point L1044(lines 1044 1055) no Hoare annotation was computed. [2023-02-18 15:34:44,628 INFO L899 garLoopResultBuilder]: For program point L1441(lines 1441 1465) no Hoare annotation was computed. [2023-02-18 15:34:44,628 INFO L899 garLoopResultBuilder]: For program point L2234(lines 2234 5150) no Hoare annotation was computed. [2023-02-18 15:34:44,628 INFO L899 garLoopResultBuilder]: For program point L1970(lines 1970 5173) no Hoare annotation was computed. [2023-02-18 15:34:44,629 INFO L899 garLoopResultBuilder]: For program point L1706(lines 1706 5196) no Hoare annotation was computed. [2023-02-18 15:34:44,629 INFO L899 garLoopResultBuilder]: For program point L2631(lines 2631 5116) no Hoare annotation was computed. [2023-02-18 15:34:44,629 INFO L899 garLoopResultBuilder]: For program point L517(lines 517 551) no Hoare annotation was computed. [2023-02-18 15:34:44,629 INFO L899 garLoopResultBuilder]: For program point L3424(lines 3424 3435) no Hoare annotation was computed. [2023-02-18 15:34:44,629 INFO L899 garLoopResultBuilder]: For program point L3821(lines 3821 3845) no Hoare annotation was computed. [2023-02-18 15:34:44,629 INFO L899 garLoopResultBuilder]: For program point L4614(lines 4614 4940) no Hoare annotation was computed. [2023-02-18 15:34:44,629 INFO L899 garLoopResultBuilder]: For program point L4350(lines 4350 4963) no Hoare annotation was computed. [2023-02-18 15:34:44,630 INFO L899 garLoopResultBuilder]: For program point L4086(lines 4086 4986) no Hoare annotation was computed. [2023-02-18 15:34:44,630 INFO L899 garLoopResultBuilder]: For program point L1180(lines 1180 1191) no Hoare annotation was computed. [2023-02-18 15:34:44,630 INFO L899 garLoopResultBuilder]: For program point L1577(lines 1577 1601) no Hoare annotation was computed. [2023-02-18 15:34:44,630 INFO L899 garLoopResultBuilder]: For program point L388(lines 388 395) no Hoare annotation was computed. [2023-02-18 15:34:44,630 INFO L899 garLoopResultBuilder]: For program point L2370(lines 2370 5138) no Hoare annotation was computed. [2023-02-18 15:34:44,630 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 4755) no Hoare annotation was computed. [2023-02-18 15:34:44,630 INFO L899 garLoopResultBuilder]: For program point L2106(lines 2106 5161) no Hoare annotation was computed. [2023-02-18 15:34:44,630 INFO L899 garLoopResultBuilder]: For program point L1842(lines 1842 5184) no Hoare annotation was computed. [2023-02-18 15:34:44,631 INFO L899 garLoopResultBuilder]: For program point L2767(lines 2767 5104) no Hoare annotation was computed. [2023-02-18 15:34:44,631 INFO L899 garLoopResultBuilder]: For program point L3560(lines 3560 3571) no Hoare annotation was computed. [2023-02-18 15:34:44,631 INFO L899 garLoopResultBuilder]: For program point L3957(lines 3957 3981) no Hoare annotation was computed. [2023-02-18 15:34:44,631 INFO L899 garLoopResultBuilder]: For program point L4486(lines 4486 4951) no Hoare annotation was computed. [2023-02-18 15:34:44,631 INFO L899 garLoopResultBuilder]: For program point L4222(lines 4222 4974) no Hoare annotation was computed. [2023-02-18 15:34:44,631 INFO L899 garLoopResultBuilder]: For program point L1316(lines 1316 1327) no Hoare annotation was computed. [2023-02-18 15:34:44,631 INFO L899 garLoopResultBuilder]: For program point L4884(lines 4884 4919) no Hoare annotation was computed. [2023-02-18 15:34:44,631 INFO L899 garLoopResultBuilder]: For program point L1713(lines 1713 1737) no Hoare annotation was computed. [2023-02-18 15:34:44,632 INFO L899 garLoopResultBuilder]: For program point L524(lines 524 544) no Hoare annotation was computed. [2023-02-18 15:34:44,632 INFO L899 garLoopResultBuilder]: For program point L2506(lines 2506 5126) no Hoare annotation was computed. [2023-02-18 15:34:44,632 INFO L899 garLoopResultBuilder]: For program point L2242(lines 2242 5149) no Hoare annotation was computed. [2023-02-18 15:34:44,632 INFO L899 garLoopResultBuilder]: For program point L128(lines 128 645) no Hoare annotation was computed. [2023-02-18 15:34:44,632 INFO L899 garLoopResultBuilder]: For program point L1978(lines 1978 5172) no Hoare annotation was computed. [2023-02-18 15:34:44,632 INFO L899 garLoopResultBuilder]: For program point L2903(lines 2903 5092) no Hoare annotation was computed. [2023-02-18 15:34:44,632 INFO L899 garLoopResultBuilder]: For program point L3696(lines 3696 3707) no Hoare annotation was computed. [2023-02-18 15:34:44,632 INFO L899 garLoopResultBuilder]: For program point L4753(lines 4753 4761) no Hoare annotation was computed. [2023-02-18 15:34:44,633 INFO L899 garLoopResultBuilder]: For program point L4093(lines 4093 4117) no Hoare annotation was computed. [2023-02-18 15:34:44,633 INFO L899 garLoopResultBuilder]: For program point L4622(lines 4622 4939) no Hoare annotation was computed. [2023-02-18 15:34:44,633 INFO L899 garLoopResultBuilder]: For program point L4358(lines 4358 4962) no Hoare annotation was computed. [2023-02-18 15:34:44,633 INFO L899 garLoopResultBuilder]: For program point L4755(line 4755) no Hoare annotation was computed. [2023-02-18 15:34:44,633 INFO L899 garLoopResultBuilder]: For program point L659(lines 659 5290) no Hoare annotation was computed. [2023-02-18 15:34:44,633 INFO L899 garLoopResultBuilder]: For program point L1452(lines 1452 1463) no Hoare annotation was computed. [2023-02-18 15:34:44,633 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-18 15:34:44,633 INFO L899 garLoopResultBuilder]: For program point L1849(lines 1849 1873) no Hoare annotation was computed. [2023-02-18 15:34:44,634 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 41) no Hoare annotation was computed. [2023-02-18 15:34:44,634 INFO L899 garLoopResultBuilder]: For program point L2642(lines 2642 5114) no Hoare annotation was computed. [2023-02-18 15:34:44,634 INFO L899 garLoopResultBuilder]: For program point L2378(lines 2378 5137) no Hoare annotation was computed. [2023-02-18 15:34:44,634 INFO L899 garLoopResultBuilder]: For program point L264(lines 264 599) no Hoare annotation was computed. [2023-02-18 15:34:44,634 INFO L899 garLoopResultBuilder]: For program point L132(lines 132 605) no Hoare annotation was computed. [2023-02-18 15:34:44,634 INFO L899 garLoopResultBuilder]: For program point L2114(lines 2114 5160) no Hoare annotation was computed. [2023-02-18 15:34:44,634 INFO L899 garLoopResultBuilder]: For program point L3039(lines 3039 5080) no Hoare annotation was computed. [2023-02-18 15:34:44,635 INFO L899 garLoopResultBuilder]: For program point L3832(lines 3832 3843) no Hoare annotation was computed. [2023-02-18 15:34:44,635 INFO L899 garLoopResultBuilder]: For program point L4229(lines 4229 4253) no Hoare annotation was computed. [2023-02-18 15:34:44,635 INFO L899 garLoopResultBuilder]: For program point L4494(lines 4494 4950) no Hoare annotation was computed. [2023-02-18 15:34:44,635 INFO L899 garLoopResultBuilder]: For program point L4891(lines 4891 4913) no Hoare annotation was computed. [2023-02-18 15:34:44,635 INFO L899 garLoopResultBuilder]: For program point L795(lines 795 5278) no Hoare annotation was computed. [2023-02-18 15:34:44,635 INFO L899 garLoopResultBuilder]: For program point L1588(lines 1588 1599) no Hoare annotation was computed. [2023-02-18 15:34:44,635 INFO L899 garLoopResultBuilder]: For program point L1985(lines 1985 2009) no Hoare annotation was computed. [2023-02-18 15:34:44,635 INFO L899 garLoopResultBuilder]: For program point L2778(lines 2778 5102) no Hoare annotation was computed. [2023-02-18 15:34:44,636 INFO L899 garLoopResultBuilder]: For program point L2514(lines 2514 5125) no Hoare annotation was computed. [2023-02-18 15:34:44,636 INFO L899 garLoopResultBuilder]: For program point L268(lines 268 558) no Hoare annotation was computed. [2023-02-18 15:34:44,636 INFO L899 garLoopResultBuilder]: For program point L2250(lines 2250 5148) no Hoare annotation was computed. [2023-02-18 15:34:44,636 INFO L899 garLoopResultBuilder]: For program point L3175(lines 3175 5068) no Hoare annotation was computed. [2023-02-18 15:34:44,636 INFO L899 garLoopResultBuilder]: For program point L3968(lines 3968 3979) no Hoare annotation was computed. [2023-02-18 15:34:44,636 INFO L899 garLoopResultBuilder]: For program point L4893(line 4893) no Hoare annotation was computed. [2023-02-18 15:34:44,636 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 4823) no Hoare annotation was computed. [2023-02-18 15:34:44,636 INFO L899 garLoopResultBuilder]: For program point L4365(lines 4365 4389) no Hoare annotation was computed. [2023-02-18 15:34:44,637 INFO L899 garLoopResultBuilder]: For program point L4630(lines 4630 4938) no Hoare annotation was computed. [2023-02-18 15:34:44,637 INFO L899 garLoopResultBuilder]: For program point L931(lines 931 5266) no Hoare annotation was computed. [2023-02-18 15:34:44,637 INFO L899 garLoopResultBuilder]: For program point L1724(lines 1724 1735) no Hoare annotation was computed. [2023-02-18 15:34:44,637 INFO L899 garLoopResultBuilder]: For program point L535(lines 535 542) no Hoare annotation was computed. [2023-02-18 15:34:44,637 INFO L899 garLoopResultBuilder]: For program point L139(lines 139 194) no Hoare annotation was computed. [2023-02-18 15:34:44,637 INFO L899 garLoopResultBuilder]: For program point L2121(lines 2121 2145) no Hoare annotation was computed. [2023-02-18 15:34:44,637 INFO L899 garLoopResultBuilder]: For program point L2914(lines 2914 5090) no Hoare annotation was computed. [2023-02-18 15:34:44,637 INFO L899 garLoopResultBuilder]: For program point L2650(lines 2650 5113) no Hoare annotation was computed. [2023-02-18 15:34:44,638 INFO L899 garLoopResultBuilder]: For program point L404(lines 404 552) no Hoare annotation was computed. [2023-02-18 15:34:44,638 INFO L899 garLoopResultBuilder]: For program point L2386(lines 2386 5136) no Hoare annotation was computed. [2023-02-18 15:34:44,638 INFO L899 garLoopResultBuilder]: For program point L3311(lines 3311 5056) no Hoare annotation was computed. [2023-02-18 15:34:44,638 INFO L899 garLoopResultBuilder]: For program point L4104(lines 4104 4115) no Hoare annotation was computed. [2023-02-18 15:34:44,638 INFO L899 garLoopResultBuilder]: For program point L4501(lines 4501 4525) no Hoare annotation was computed. [2023-02-18 15:34:44,638 INFO L899 garLoopResultBuilder]: For program point L670(lines 670 5288) no Hoare annotation was computed. [2023-02-18 15:34:44,638 INFO L899 garLoopResultBuilder]: For program point L1067(lines 1067 5254) no Hoare annotation was computed. [2023-02-18 15:34:44,639 INFO L899 garLoopResultBuilder]: For program point L1860(lines 1860 1871) no Hoare annotation was computed. [2023-02-18 15:34:44,639 INFO L899 garLoopResultBuilder]: For program point L275(lines 275 330) no Hoare annotation was computed. [2023-02-18 15:34:44,639 INFO L899 garLoopResultBuilder]: For program point L2257(lines 2257 2281) no Hoare annotation was computed. [2023-02-18 15:34:44,639 INFO L899 garLoopResultBuilder]: For program point L3050(lines 3050 5078) no Hoare annotation was computed. [2023-02-18 15:34:44,639 INFO L899 garLoopResultBuilder]: For program point L2786(lines 2786 5101) no Hoare annotation was computed. [2023-02-18 15:34:44,639 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 4714) no Hoare annotation was computed. [2023-02-18 15:34:44,639 INFO L899 garLoopResultBuilder]: For program point L2522(lines 2522 5124) no Hoare annotation was computed. [2023-02-18 15:34:44,639 INFO L899 garLoopResultBuilder]: For program point L408(lines 408 511) no Hoare annotation was computed. [2023-02-18 15:34:44,640 INFO L899 garLoopResultBuilder]: For program point L3447(lines 3447 5044) no Hoare annotation was computed. [2023-02-18 15:34:44,640 INFO L902 garLoopResultBuilder]: At program point L5297(lines 27 5300) the Hoare annotation is: true [2023-02-18 15:34:44,640 INFO L899 garLoopResultBuilder]: For program point L4240(lines 4240 4251) no Hoare annotation was computed. [2023-02-18 15:34:44,640 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 4905) no Hoare annotation was computed. [2023-02-18 15:34:44,640 INFO L899 garLoopResultBuilder]: For program point L4637(lines 4637 4661) no Hoare annotation was computed. [2023-02-18 15:34:44,640 INFO L899 garLoopResultBuilder]: For program point L806(lines 806 5276) no Hoare annotation was computed. [2023-02-18 15:34:44,640 INFO L899 garLoopResultBuilder]: For program point L4770(lines 4770 4920) no Hoare annotation was computed. [2023-02-18 15:34:44,640 INFO L899 garLoopResultBuilder]: For program point L1203(lines 1203 5242) no Hoare annotation was computed. [2023-02-18 15:34:44,641 INFO L899 garLoopResultBuilder]: For program point L1996(lines 1996 2007) no Hoare annotation was computed. [2023-02-18 15:34:44,641 INFO L899 garLoopResultBuilder]: For program point L4903(lines 4903 4911) no Hoare annotation was computed. [2023-02-18 15:34:44,641 INFO L899 garLoopResultBuilder]: For program point L2393(lines 2393 2417) no Hoare annotation was computed. [2023-02-18 15:34:44,641 INFO L899 garLoopResultBuilder]: For program point L3186(lines 3186 5066) no Hoare annotation was computed. [2023-02-18 15:34:44,641 INFO L899 garLoopResultBuilder]: For program point L2922(lines 2922 5089) no Hoare annotation was computed. [2023-02-18 15:34:44,641 INFO L899 garLoopResultBuilder]: For program point L2658(lines 2658 5112) no Hoare annotation was computed. [2023-02-18 15:34:44,641 INFO L899 garLoopResultBuilder]: For program point L3583(lines 3583 5032) no Hoare annotation was computed. [2023-02-18 15:34:44,641 INFO L899 garLoopResultBuilder]: For program point L4376(lines 4376 4387) no Hoare annotation was computed. [2023-02-18 15:34:44,642 INFO L899 garLoopResultBuilder]: For program point L4905(line 4905) no Hoare annotation was computed. [2023-02-18 15:34:44,642 INFO L899 garLoopResultBuilder]: For program point L942(lines 942 5264) no Hoare annotation was computed. [2023-02-18 15:34:44,642 INFO L899 garLoopResultBuilder]: For program point L4774(lines 4774 4878) no Hoare annotation was computed. [2023-02-18 15:34:44,642 INFO L899 garLoopResultBuilder]: For program point L678(lines 678 5287) no Hoare annotation was computed. [2023-02-18 15:34:44,642 INFO L899 garLoopResultBuilder]: For program point L1339(lines 1339 5230) no Hoare annotation was computed. [2023-02-18 15:34:44,642 INFO L899 garLoopResultBuilder]: For program point L150(lines 150 192) no Hoare annotation was computed. [2023-02-18 15:34:44,642 INFO L899 garLoopResultBuilder]: For program point L2132(lines 2132 2143) no Hoare annotation was computed. [2023-02-18 15:34:44,642 INFO L899 garLoopResultBuilder]: For program point L2529(lines 2529 2553) no Hoare annotation was computed. [2023-02-18 15:34:44,643 INFO L899 garLoopResultBuilder]: For program point L415(lines 415 470) no Hoare annotation was computed. [2023-02-18 15:34:44,643 INFO L899 garLoopResultBuilder]: For program point L3322(lines 3322 5054) no Hoare annotation was computed. [2023-02-18 15:34:44,643 INFO L899 garLoopResultBuilder]: For program point L3058(lines 3058 5077) no Hoare annotation was computed. [2023-02-18 15:34:44,643 INFO L899 garLoopResultBuilder]: For program point L2794(lines 2794 5100) no Hoare annotation was computed. [2023-02-18 15:34:44,643 INFO L899 garLoopResultBuilder]: For program point L3719(lines 3719 5020) no Hoare annotation was computed. [2023-02-18 15:34:44,643 INFO L899 garLoopResultBuilder]: For program point L4512(lines 4512 4523) no Hoare annotation was computed. [2023-02-18 15:34:44,643 INFO L899 garLoopResultBuilder]: For program point L1078(lines 1078 5252) no Hoare annotation was computed. [2023-02-18 15:34:44,643 INFO L899 garLoopResultBuilder]: For program point L814(lines 814 5275) no Hoare annotation was computed. [2023-02-18 15:34:44,644 INFO L899 garLoopResultBuilder]: For program point L1475(lines 1475 5218) no Hoare annotation was computed. [2023-02-18 15:34:44,644 INFO L899 garLoopResultBuilder]: For program point L286(lines 286 328) no Hoare annotation was computed. [2023-02-18 15:34:44,644 INFO L899 garLoopResultBuilder]: For program point L2268(lines 2268 2279) no Hoare annotation was computed. [2023-02-18 15:34:44,644 INFO L899 garLoopResultBuilder]: For program point L2665(lines 2665 2689) no Hoare annotation was computed. [2023-02-18 15:34:44,644 INFO L899 garLoopResultBuilder]: For program point L3458(lines 3458 5042) no Hoare annotation was computed. [2023-02-18 15:34:44,644 INFO L899 garLoopResultBuilder]: For program point L3194(lines 3194 5065) no Hoare annotation was computed. [2023-02-18 15:34:44,644 INFO L899 garLoopResultBuilder]: For program point L2930(lines 2930 5088) no Hoare annotation was computed. [2023-02-18 15:34:44,644 INFO L899 garLoopResultBuilder]: For program point L3855(lines 3855 5008) no Hoare annotation was computed. [2023-02-18 15:34:44,645 INFO L899 garLoopResultBuilder]: For program point L4648(lines 4648 4659) no Hoare annotation was computed. [2023-02-18 15:34:44,645 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 4783) no Hoare annotation was computed. [2023-02-18 15:34:44,645 INFO L899 garLoopResultBuilder]: For program point L4781(lines 4781 4840) no Hoare annotation was computed. [2023-02-18 15:34:44,645 INFO L899 garLoopResultBuilder]: For program point L1214(lines 1214 5240) no Hoare annotation was computed. [2023-02-18 15:34:44,645 INFO L899 garLoopResultBuilder]: For program point L950(lines 950 5263) no Hoare annotation was computed. [2023-02-18 15:34:44,645 INFO L899 garLoopResultBuilder]: For program point L686(lines 686 5286) no Hoare annotation was computed. [2023-02-18 15:34:44,645 INFO L899 garLoopResultBuilder]: For program point L1611(lines 1611 5206) no Hoare annotation was computed. [2023-02-18 15:34:44,645 INFO L899 garLoopResultBuilder]: For program point L2404(lines 2404 2415) no Hoare annotation was computed. [2023-02-18 15:34:44,646 INFO L899 garLoopResultBuilder]: For program point L158(lines 158 191) no Hoare annotation was computed. [2023-02-18 15:34:44,646 INFO L899 garLoopResultBuilder]: For program point L4783(line 4783) no Hoare annotation was computed. [2023-02-18 15:34:44,646 INFO L899 garLoopResultBuilder]: For program point L2801(lines 2801 2825) no Hoare annotation was computed. [2023-02-18 15:34:44,646 INFO L899 garLoopResultBuilder]: For program point L3594(lines 3594 5030) no Hoare annotation was computed. [2023-02-18 15:34:44,646 INFO L899 garLoopResultBuilder]: For program point L3330(lines 3330 5053) no Hoare annotation was computed. [2023-02-18 15:34:44,646 INFO L899 garLoopResultBuilder]: For program point L27(lines 27 5300) no Hoare annotation was computed. [2023-02-18 15:34:44,646 INFO L899 garLoopResultBuilder]: For program point L3066(lines 3066 5076) no Hoare annotation was computed. [2023-02-18 15:34:44,646 INFO L899 garLoopResultBuilder]: For program point L3991(lines 3991 4996) no Hoare annotation was computed. [2023-02-18 15:34:44,647 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-18 15:34:44,647 INFO L899 garLoopResultBuilder]: For program point L1350(lines 1350 5228) no Hoare annotation was computed. [2023-02-18 15:34:44,647 INFO L899 garLoopResultBuilder]: For program point L1086(lines 1086 5251) no Hoare annotation was computed. [2023-02-18 15:34:44,647 INFO L899 garLoopResultBuilder]: For program point L822(lines 822 5274) no Hoare annotation was computed. [2023-02-18 15:34:44,647 INFO L899 garLoopResultBuilder]: For program point L1747(lines 1747 5194) no Hoare annotation was computed. [2023-02-18 15:34:44,647 INFO L899 garLoopResultBuilder]: For program point L2540(lines 2540 2551) no Hoare annotation was computed. [2023-02-18 15:34:44,647 INFO L899 garLoopResultBuilder]: For program point L426(lines 426 468) no Hoare annotation was computed. [2023-02-18 15:34:44,647 INFO L899 garLoopResultBuilder]: For program point L294(lines 294 327) no Hoare annotation was computed. [2023-02-18 15:34:44,648 INFO L899 garLoopResultBuilder]: For program point L2937(lines 2937 2961) no Hoare annotation was computed. [2023-02-18 15:34:44,648 INFO L899 garLoopResultBuilder]: For program point L3730(lines 3730 5018) no Hoare annotation was computed. [2023-02-18 15:34:44,648 INFO L899 garLoopResultBuilder]: For program point L3466(lines 3466 5041) no Hoare annotation was computed. [2023-02-18 15:34:44,648 INFO L899 garLoopResultBuilder]: For program point L3202(lines 3202 5064) no Hoare annotation was computed. [2023-02-18 15:34:44,648 INFO L899 garLoopResultBuilder]: For program point L31(lines 31 5293) no Hoare annotation was computed. [2023-02-18 15:34:44,648 INFO L899 garLoopResultBuilder]: For program point L4127(lines 4127 4984) no Hoare annotation was computed. [2023-02-18 15:34:44,648 INFO L899 garLoopResultBuilder]: For program point L693(lines 693 717) no Hoare annotation was computed. [2023-02-18 15:34:44,648 INFO L899 garLoopResultBuilder]: For program point L1486(lines 1486 5216) no Hoare annotation was computed. [2023-02-18 15:34:44,649 INFO L899 garLoopResultBuilder]: For program point L1222(lines 1222 5239) no Hoare annotation was computed. [2023-02-18 15:34:44,649 INFO L899 garLoopResultBuilder]: For program point L165(lines 165 185) no Hoare annotation was computed. [2023-02-18 15:34:44,649 INFO L895 garLoopResultBuilder]: At program point L33(lines 31 5293) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~main__t~0#1| 0))) (and (let ((.cse1 (<= (+ |ULTIMATE.start_main_~main__t~0#1| (* (- 1) |ULTIMATE.start_main_~main__tagbuf_len~0#1|)) 0))) (or (and (= |ULTIMATE.start_main_~main__tagbuf_len~0#1| 0) .cse0 (not .cse1)) .cse1)) (let ((.cse2 (<= (* (- 1) |ULTIMATE.start_main_~main__t~0#1|) 0))) (or (and (not .cse2) .cse0) .cse2)))) [2023-02-18 15:34:44,649 INFO L899 garLoopResultBuilder]: For program point L958(lines 958 5262) no Hoare annotation was computed. [2023-02-18 15:34:44,649 INFO L899 garLoopResultBuilder]: For program point L1883(lines 1883 5182) no Hoare annotation was computed. [2023-02-18 15:34:44,649 INFO L899 garLoopResultBuilder]: For program point L2676(lines 2676 2687) no Hoare annotation was computed. [2023-02-18 15:34:44,650 INFO L899 garLoopResultBuilder]: For program point L3073(lines 3073 3097) no Hoare annotation was computed. [2023-02-18 15:34:44,650 INFO L899 garLoopResultBuilder]: For program point L3866(lines 3866 5006) no Hoare annotation was computed. [2023-02-18 15:34:44,650 INFO L899 garLoopResultBuilder]: For program point L3602(lines 3602 5029) no Hoare annotation was computed. [2023-02-18 15:34:44,650 INFO L899 garLoopResultBuilder]: For program point L3338(lines 3338 5052) no Hoare annotation was computed. [2023-02-18 15:34:44,650 INFO L899 garLoopResultBuilder]: For program point L4263(lines 4263 4972) no Hoare annotation was computed. [2023-02-18 15:34:44,650 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 53) no Hoare annotation was computed. [2023-02-18 15:34:44,650 INFO L899 garLoopResultBuilder]: For program point L564(lines 564 598) no Hoare annotation was computed. [2023-02-18 15:34:44,650 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 4854) no Hoare annotation was computed. [2023-02-18 15:34:44,651 INFO L899 garLoopResultBuilder]: For program point L829(lines 829 853) no Hoare annotation was computed. [2023-02-18 15:34:44,651 INFO L899 garLoopResultBuilder]: For program point L4793(lines 4793 4838) no Hoare annotation was computed. [2023-02-18 15:34:44,651 INFO L899 garLoopResultBuilder]: For program point L1622(lines 1622 5204) no Hoare annotation was computed. [2023-02-18 15:34:44,651 INFO L899 garLoopResultBuilder]: For program point L1358(lines 1358 5227) no Hoare annotation was computed. [2023-02-18 15:34:44,651 INFO L899 garLoopResultBuilder]: For program point L301(lines 301 321) no Hoare annotation was computed. [2023-02-18 15:34:44,651 INFO L899 garLoopResultBuilder]: For program point L1094(lines 1094 5250) no Hoare annotation was computed. [2023-02-18 15:34:44,651 INFO L899 garLoopResultBuilder]: For program point L2019(lines 2019 5170) no Hoare annotation was computed. [2023-02-18 15:34:44,651 INFO L899 garLoopResultBuilder]: For program point L2812(lines 2812 2823) no Hoare annotation was computed. [2023-02-18 15:34:44,652 INFO L899 garLoopResultBuilder]: For program point L434(lines 434 467) no Hoare annotation was computed. [2023-02-18 15:34:44,652 INFO L899 garLoopResultBuilder]: For program point L3209(lines 3209 3233) no Hoare annotation was computed. [2023-02-18 15:34:44,652 INFO L899 garLoopResultBuilder]: For program point L4002(lines 4002 4994) no Hoare annotation was computed. [2023-02-18 15:34:44,652 INFO L899 garLoopResultBuilder]: For program point L4795(line 4795) no Hoare annotation was computed. [2023-02-18 15:34:44,652 INFO L899 garLoopResultBuilder]: For program point L3738(lines 3738 5017) no Hoare annotation was computed. [2023-02-18 15:34:44,652 INFO L899 garLoopResultBuilder]: For program point L3474(lines 3474 5040) no Hoare annotation was computed. [2023-02-18 15:34:44,652 INFO L899 garLoopResultBuilder]: For program point L4399(lines 4399 4960) no Hoare annotation was computed. [2023-02-18 15:34:44,652 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 61) no Hoare annotation was computed. [2023-02-18 15:34:44,653 INFO L899 garLoopResultBuilder]: For program point L965(lines 965 989) no Hoare annotation was computed. [2023-02-18 15:34:44,653 INFO L899 garLoopResultBuilder]: For program point L1758(lines 1758 5192) no Hoare annotation was computed. [2023-02-18 15:34:44,653 INFO L899 garLoopResultBuilder]: For program point L1494(lines 1494 5215) no Hoare annotation was computed. [2023-02-18 15:34:44,653 INFO L899 garLoopResultBuilder]: For program point L1230(lines 1230 5238) no Hoare annotation was computed. [2023-02-18 15:34:44,653 INFO L899 garLoopResultBuilder]: For program point L2155(lines 2155 5158) no Hoare annotation was computed. [2023-02-18 15:34:44,653 INFO L899 garLoopResultBuilder]: For program point L41(line 41) no Hoare annotation was computed. [2023-02-18 15:34:44,653 INFO L899 garLoopResultBuilder]: For program point L2948(lines 2948 2959) no Hoare annotation was computed. [2023-02-18 15:34:44,654 INFO L899 garLoopResultBuilder]: For program point L3345(lines 3345 3369) no Hoare annotation was computed. [2023-02-18 15:34:44,654 INFO L899 garLoopResultBuilder]: For program point L4138(lines 4138 4982) no Hoare annotation was computed. [2023-02-18 15:34:44,654 INFO L899 garLoopResultBuilder]: For program point L3874(lines 3874 5005) no Hoare annotation was computed. [2023-02-18 15:34:44,654 INFO L899 garLoopResultBuilder]: For program point L571(lines 571 591) no Hoare annotation was computed. [2023-02-18 15:34:44,654 INFO L899 garLoopResultBuilder]: For program point L3610(lines 3610 5028) no Hoare annotation was computed. [2023-02-18 15:34:44,654 INFO L899 garLoopResultBuilder]: For program point L4535(lines 4535 4948) no Hoare annotation was computed. [2023-02-18 15:34:44,654 INFO L899 garLoopResultBuilder]: For program point L704(lines 704 715) no Hoare annotation was computed. [2023-02-18 15:34:44,655 INFO L895 garLoopResultBuilder]: At program point L4668(lines 4665 4938) the Hoare annotation is: (let ((.cse12 (* (- 1) |ULTIMATE.start_main_~main__t~0#1|))) (let ((.cse0 (<= 0 |ULTIMATE.start_main_~main__tagbuf_len~0#1|)) (.cse3 (or (not (<= (+ |ULTIMATE.start_main_~main__tagbuf_len~0#1| .cse12) 0)) (and (<= (+ |ULTIMATE.start_main_~main__tagbuf_len~0#1| .cse12 1) 0) (<= |ULTIMATE.start_main_~main__t~0#1| |ULTIMATE.start_main_~main__tagbuf_len~0#1|))))) (and .cse0 (let ((.cse4 (<= 0 (+ |ULTIMATE.start_main_~main__t~0#1| (- 61)))) (.cse2 (<= 0 (+ |ULTIMATE.start_main_~main__t~0#1| (- 60)))) (.cse5 (<= 0 (+ |ULTIMATE.start_main_~main__t~0#1| (- 59))))) (let ((.cse1 (let ((.cse6 (let ((.cse7 (let ((.cse8 (let ((.cse9 (let ((.cse10 (let ((.cse11 (<= .cse12 0))) (or (and (not .cse11) (= |ULTIMATE.start_main_~main__t~0#1| 0)) .cse11)))) (or (and .cse5 (not (= 0 |ULTIMATE.start_main_~__VERIFIER_assert__cond~270#1|)) .cse10) (and .cse5 .cse10))))) (or (and .cse9 (not (= 0 |ULTIMATE.start_main_~__VERIFIER_assert__cond~271#1|)) .cse3) (and .cse9 .cse3))))) (or (and .cse8 .cse2) (and .cse5 .cse8))))) (or (and .cse0 .cse5 .cse7 .cse3) (and .cse0 .cse4 .cse7 .cse3) (and .cse0 .cse7 .cse2 .cse3))))) (or (and .cse4 .cse6) (and .cse6 .cse2) (and .cse5 .cse6))))) (or (and .cse1 .cse2 .cse3) (and .cse4 .cse1 .cse3) (and .cse5 .cse1 .cse3)))) .cse3))) [2023-02-18 15:34:44,655 INFO L899 garLoopResultBuilder]: For program point L176(lines 176 183) no Hoare annotation was computed. [2023-02-18 15:34:44,655 INFO L899 garLoopResultBuilder]: For program point L1101(lines 1101 1125) no Hoare annotation was computed. [2023-02-18 15:34:44,655 INFO L899 garLoopResultBuilder]: For program point L1894(lines 1894 5180) no Hoare annotation was computed. [2023-02-18 15:34:44,655 INFO L899 garLoopResultBuilder]: For program point L1630(lines 1630 5203) no Hoare annotation was computed. [2023-02-18 15:34:44,655 INFO L899 garLoopResultBuilder]: For program point L441(lines 441 461) no Hoare annotation was computed. [2023-02-18 15:34:44,656 INFO L899 garLoopResultBuilder]: For program point L1366(lines 1366 5226) no Hoare annotation was computed. [2023-02-18 15:34:44,656 INFO L899 garLoopResultBuilder]: For program point L2291(lines 2291 5146) no Hoare annotation was computed. [2023-02-18 15:34:44,656 INFO L899 garLoopResultBuilder]: For program point L3084(lines 3084 3095) no Hoare annotation was computed. [2023-02-18 15:34:44,656 INFO L899 garLoopResultBuilder]: For program point L4802(lines 4802 4837) no Hoare annotation was computed. [2023-02-18 15:34:44,656 INFO L895 garLoopResultBuilder]: At program point $Ultimate##826(lines 4734 4921) the Hoare annotation is: (let ((.cse0 (<= 0 |ULTIMATE.start_main_~main__tagbuf_len~0#1|))) (and .cse0 (let ((.cse14 (* (- 1) |ULTIMATE.start_main_~main__t~0#1|))) (let ((.cse2 (or (not (<= (+ |ULTIMATE.start_main_~main__tagbuf_len~0#1| .cse14 1) 0)) (<= |ULTIMATE.start_main_~main__t~0#1| |ULTIMATE.start_main_~main__tagbuf_len~0#1|) (not (<= (+ |ULTIMATE.start_main_~main__tagbuf_len~0#1| .cse14) 0))))) (let ((.cse1 (let ((.cse3 (let ((.cse4 (<= 0 (+ |ULTIMATE.start_main_~main__t~0#1| (- 61))))) (let ((.cse5 (let ((.cse6 (<= 0 (+ |ULTIMATE.start_main_~main__t~0#1| (- 59)))) (.cse7 (not (= 0 |ULTIMATE.start_main_~__VERIFIER_assert__cond~270#1|))) (.cse8 (not (= 0 |ULTIMATE.start_main_~__VERIFIER_assert__cond~272#1|))) (.cse9 (<= 0 (+ |ULTIMATE.start_main_~main__t~0#1| (- 60)))) (.cse10 (not (= 0 |ULTIMATE.start_main_~__VERIFIER_assert__cond~271#1|))) (.cse11 (not (= 0 |ULTIMATE.start_main_~__VERIFIER_assert__cond~273#1|))) (.cse12 (let ((.cse13 (<= .cse14 0))) (or (and (not .cse13) (= |ULTIMATE.start_main_~main__t~0#1| 0)) .cse13)))) (or (and .cse0 .cse4 .cse6 .cse7 .cse2 .cse8 (not (= 0 |ULTIMATE.start_main_~__VERIFIER_assert__cond~276#1|)) .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse4 .cse6 .cse7 .cse2 .cse8 .cse9 .cse10 .cse11 .cse12))))) (or (and .cse4 .cse2 .cse5) (and .cse4 .cse2 .cse5 (not (= 0 |ULTIMATE.start_main_~__VERIFIER_assert__cond~280#1|)))))))) (or (and .cse2 .cse3) (and .cse2 .cse3 (not (= 0 |ULTIMATE.start_main_~__VERIFIER_assert__cond~277#1|))))))) (or (and .cse1 .cse2) (and .cse1 .cse2 (not (= 0 |ULTIMATE.start_main_~__VERIFIER_assert__cond~281#1|))))))))) [2023-02-18 15:34:44,656 INFO L899 garLoopResultBuilder]: For program point L3481(lines 3481 3505) no Hoare annotation was computed. [2023-02-18 15:34:44,657 INFO L899 garLoopResultBuilder]: For program point L4274(lines 4274 4970) no Hoare annotation was computed. [2023-02-18 15:34:44,657 INFO L899 garLoopResultBuilder]: For program point L4010(lines 4010 4993) no Hoare annotation was computed. [2023-02-18 15:34:44,657 INFO L899 garLoopResultBuilder]: For program point L3746(lines 3746 5016) no Hoare annotation was computed. [2023-02-18 15:34:44,657 INFO L899 garLoopResultBuilder]: For program point L840(lines 840 851) no Hoare annotation was computed. [2023-02-18 15:34:44,657 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 4726) no Hoare annotation was computed. [2023-02-18 15:34:44,657 INFO L899 garLoopResultBuilder]: For program point L312(lines 312 319) no Hoare annotation was computed. [2023-02-18 15:34:44,657 INFO L899 garLoopResultBuilder]: For program point L1237(lines 1237 1261) no Hoare annotation was computed. [2023-02-18 15:34:44,657 INFO L899 garLoopResultBuilder]: For program point L2030(lines 2030 5168) no Hoare annotation was computed. [2023-02-18 15:34:44,658 INFO L899 garLoopResultBuilder]: For program point L1766(lines 1766 5191) no Hoare annotation was computed. [2023-02-18 15:34:44,658 INFO L899 garLoopResultBuilder]: For program point L1502(lines 1502 5214) no Hoare annotation was computed. [2023-02-18 15:34:44,658 INFO L899 garLoopResultBuilder]: For program point L2427(lines 2427 5134) no Hoare annotation was computed. [2023-02-18 15:34:44,658 INFO L899 garLoopResultBuilder]: For program point L3220(lines 3220 3231) no Hoare annotation was computed. [2023-02-18 15:34:44,658 INFO L899 garLoopResultBuilder]: For program point L3617(lines 3617 3641) no Hoare annotation was computed. [2023-02-18 15:34:44,658 INFO L899 garLoopResultBuilder]: For program point L4410(lines 4410 4958) no Hoare annotation was computed. [2023-02-18 15:34:44,658 INFO L899 garLoopResultBuilder]: For program point L4146(lines 4146 4981) no Hoare annotation was computed. [2023-02-18 15:34:44,658 INFO L899 garLoopResultBuilder]: For program point L3882(lines 3882 5004) no Hoare annotation was computed. [2023-02-18 15:34:44,658 INFO L899 garLoopResultBuilder]: For program point L51(lines 51 59) no Hoare annotation was computed. [2023-02-18 15:34:44,659 INFO L899 garLoopResultBuilder]: For program point L976(lines 976 987) no Hoare annotation was computed. [2023-02-18 15:34:44,659 INFO L899 garLoopResultBuilder]: For program point L4676(lines 4676 4936) no Hoare annotation was computed. [2023-02-18 15:34:44,659 INFO L899 garLoopResultBuilder]: For program point L1373(lines 1373 1397) no Hoare annotation was computed. [2023-02-18 15:34:44,659 INFO L899 garLoopResultBuilder]: For program point L2166(lines 2166 5156) no Hoare annotation was computed. [2023-02-18 15:34:44,659 INFO L899 garLoopResultBuilder]: For program point L1902(lines 1902 5179) no Hoare annotation was computed. [2023-02-18 15:34:44,659 INFO L899 garLoopResultBuilder]: For program point L4809(lines 4809 4831) no Hoare annotation was computed. [2023-02-18 15:34:44,659 INFO L899 garLoopResultBuilder]: For program point L1638(lines 1638 5202) no Hoare annotation was computed. [2023-02-18 15:34:44,659 INFO L899 garLoopResultBuilder]: For program point L2563(lines 2563 5122) no Hoare annotation was computed. [2023-02-18 15:34:44,660 INFO L899 garLoopResultBuilder]: For program point L3356(lines 3356 3367) no Hoare annotation was computed. [2023-02-18 15:34:44,660 INFO L899 garLoopResultBuilder]: For program point L53(line 53) no Hoare annotation was computed. [2023-02-18 15:34:44,660 INFO L899 garLoopResultBuilder]: For program point L3753(lines 3753 3777) no Hoare annotation was computed. [2023-02-18 15:34:44,660 INFO L899 garLoopResultBuilder]: For program point L4678(line 4678) no Hoare annotation was computed. [2023-02-18 15:34:44,660 INFO L899 garLoopResultBuilder]: For program point L582(lines 582 589) no Hoare annotation was computed. [2023-02-18 15:34:44,660 INFO L899 garLoopResultBuilder]: For program point L4546(lines 4546 4946) no Hoare annotation was computed. [2023-02-18 15:34:44,660 INFO L899 garLoopResultBuilder]: For program point L4282(lines 4282 4969) no Hoare annotation was computed. [2023-02-18 15:34:44,660 INFO L899 garLoopResultBuilder]: For program point L4018(lines 4018 4992) no Hoare annotation was computed. [2023-02-18 15:34:44,661 INFO L899 garLoopResultBuilder]: For program point L4811(line 4811) no Hoare annotation was computed. [2023-02-18 15:34:44,661 INFO L899 garLoopResultBuilder]: For program point L1112(lines 1112 1123) no Hoare annotation was computed. [2023-02-18 15:34:44,661 INFO L899 garLoopResultBuilder]: For program point L1509(lines 1509 1533) no Hoare annotation was computed. [2023-02-18 15:34:44,661 INFO L899 garLoopResultBuilder]: For program point L452(lines 452 459) no Hoare annotation was computed. [2023-02-18 15:34:44,661 INFO L899 garLoopResultBuilder]: For program point L2302(lines 2302 5144) no Hoare annotation was computed. [2023-02-18 15:34:44,661 INFO L899 garLoopResultBuilder]: For program point L2038(lines 2038 5167) no Hoare annotation was computed. [2023-02-18 15:34:44,661 INFO L899 garLoopResultBuilder]: For program point L1774(lines 1774 5190) no Hoare annotation was computed. [2023-02-18 15:34:44,661 INFO L899 garLoopResultBuilder]: For program point L2699(lines 2699 5110) no Hoare annotation was computed. [2023-02-18 15:34:44,662 INFO L899 garLoopResultBuilder]: For program point L3492(lines 3492 3503) no Hoare annotation was computed. [2023-02-18 15:34:44,662 INFO L899 garLoopResultBuilder]: For program point L3889(lines 3889 3913) no Hoare annotation was computed. [2023-02-18 15:34:44,662 INFO L899 garLoopResultBuilder]: For program point L4418(lines 4418 4957) no Hoare annotation was computed. [2023-02-18 15:34:44,662 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-18 15:34:44,662 INFO L899 garLoopResultBuilder]: For program point L4154(lines 4154 4980) no Hoare annotation was computed. [2023-02-18 15:34:44,662 INFO L899 garLoopResultBuilder]: For program point L1248(lines 1248 1259) no Hoare annotation was computed. [2023-02-18 15:34:44,662 INFO L899 garLoopResultBuilder]: For program point L1645(lines 1645 1669) no Hoare annotation was computed. [2023-02-18 15:34:44,662 INFO L899 garLoopResultBuilder]: For program point L2438(lines 2438 5132) no Hoare annotation was computed. [2023-02-18 15:34:44,662 INFO L899 garLoopResultBuilder]: For program point L2174(lines 2174 5155) no Hoare annotation was computed. [2023-02-18 15:34:44,663 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 4795) no Hoare annotation was computed. [2023-02-18 15:34:44,663 INFO L899 garLoopResultBuilder]: For program point L1910(lines 1910 5178) no Hoare annotation was computed. [2023-02-18 15:34:44,663 INFO L899 garLoopResultBuilder]: For program point L2835(lines 2835 5098) no Hoare annotation was computed. [2023-02-18 15:34:44,663 INFO L899 garLoopResultBuilder]: For program point L3628(lines 3628 3639) no Hoare annotation was computed. [2023-02-18 15:34:44,663 INFO L899 garLoopResultBuilder]: For program point L4025(lines 4025 4049) no Hoare annotation was computed. [2023-02-18 15:34:44,663 INFO L899 garLoopResultBuilder]: For program point L4554(lines 4554 4945) no Hoare annotation was computed. [2023-02-18 15:34:44,663 INFO L899 garLoopResultBuilder]: For program point L4290(lines 4290 4968) no Hoare annotation was computed. [2023-02-18 15:34:44,663 INFO L899 garLoopResultBuilder]: For program point L1384(lines 1384 1395) no Hoare annotation was computed. [2023-02-18 15:34:44,664 INFO L899 garLoopResultBuilder]: For program point L1781(lines 1781 1805) no Hoare annotation was computed. [2023-02-18 15:34:44,664 INFO L899 garLoopResultBuilder]: For program point L2574(lines 2574 5120) no Hoare annotation was computed. [2023-02-18 15:34:44,664 INFO L899 garLoopResultBuilder]: For program point L4688(lines 4688 4934) no Hoare annotation was computed. [2023-02-18 15:34:44,664 INFO L899 garLoopResultBuilder]: For program point L2310(lines 2310 5143) no Hoare annotation was computed. [2023-02-18 15:34:44,664 INFO L899 garLoopResultBuilder]: For program point L2046(lines 2046 5166) no Hoare annotation was computed. [2023-02-18 15:34:44,664 INFO L899 garLoopResultBuilder]: For program point L2971(lines 2971 5086) no Hoare annotation was computed. [2023-02-18 15:34:44,664 INFO L899 garLoopResultBuilder]: For program point L3764(lines 3764 3775) no Hoare annotation was computed. [2023-02-18 15:34:44,664 INFO L899 garLoopResultBuilder]: For program point L4821(lines 4821 4829) no Hoare annotation was computed. [2023-02-18 15:34:44,665 INFO L899 garLoopResultBuilder]: For program point L4161(lines 4161 4185) no Hoare annotation was computed. [2023-02-18 15:34:44,665 INFO L899 garLoopResultBuilder]: For program point L4690(line 4690) no Hoare annotation was computed. [2023-02-18 15:34:44,665 INFO L899 garLoopResultBuilder]: For program point L4426(lines 4426 4956) no Hoare annotation was computed. [2023-02-18 15:34:44,665 INFO L899 garLoopResultBuilder]: For program point L4823(line 4823) no Hoare annotation was computed. [2023-02-18 15:34:44,665 INFO L899 garLoopResultBuilder]: For program point L727(lines 727 5284) no Hoare annotation was computed. [2023-02-18 15:34:44,665 INFO L899 garLoopResultBuilder]: For program point L1520(lines 1520 1531) no Hoare annotation was computed. [2023-02-18 15:34:44,665 INFO L895 garLoopResultBuilder]: At program point L199(lines 128 645) the Hoare annotation is: (let ((.cse0 (<= (* (- 1) |ULTIMATE.start_main_~main__t~0#1|) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_~main__t~0#1| 0)) .cse0)) [2023-02-18 15:34:44,665 INFO L899 garLoopResultBuilder]: For program point L1917(lines 1917 1941) no Hoare annotation was computed. [2023-02-18 15:34:44,666 INFO L899 garLoopResultBuilder]: For program point L2710(lines 2710 5108) no Hoare annotation was computed. [2023-02-18 15:34:44,666 INFO L899 garLoopResultBuilder]: For program point L2446(lines 2446 5131) no Hoare annotation was computed. [2023-02-18 15:34:44,666 INFO L899 garLoopResultBuilder]: For program point L2182(lines 2182 5154) no Hoare annotation was computed. [2023-02-18 15:34:44,666 INFO L899 garLoopResultBuilder]: For program point L68(lines 68 5292) no Hoare annotation was computed. [2023-02-18 15:34:44,666 INFO L899 garLoopResultBuilder]: For program point L3107(lines 3107 5074) no Hoare annotation was computed. [2023-02-18 15:34:44,666 INFO L899 garLoopResultBuilder]: For program point L3900(lines 3900 3911) no Hoare annotation was computed. [2023-02-18 15:34:44,666 INFO L899 garLoopResultBuilder]: For program point L4297(lines 4297 4321) no Hoare annotation was computed. [2023-02-18 15:34:44,666 INFO L899 garLoopResultBuilder]: For program point L4562(lines 4562 4944) no Hoare annotation was computed. [2023-02-18 15:34:44,667 INFO L899 garLoopResultBuilder]: For program point L863(lines 863 5272) no Hoare annotation was computed. [2023-02-18 15:34:44,667 INFO L899 garLoopResultBuilder]: For program point L1656(lines 1656 1667) no Hoare annotation was computed. [2023-02-18 15:34:44,667 INFO L895 garLoopResultBuilder]: At program point L335(lines 268 558) the Hoare annotation is: (let ((.cse0 (<= (* (- 1) |ULTIMATE.start_main_~main__t~0#1|) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_~main__t~0#1| 0)) .cse0)) [2023-02-18 15:34:44,667 INFO L899 garLoopResultBuilder]: For program point L2053(lines 2053 2077) no Hoare annotation was computed. [2023-02-18 15:34:44,667 INFO L899 garLoopResultBuilder]: For program point L2846(lines 2846 5096) no Hoare annotation was computed. [2023-02-18 15:34:44,667 INFO L899 garLoopResultBuilder]: For program point L2582(lines 2582 5119) no Hoare annotation was computed. [2023-02-18 15:34:44,667 INFO L899 garLoopResultBuilder]: For program point L2318(lines 2318 5142) no Hoare annotation was computed. [2023-02-18 15:34:44,667 INFO L899 garLoopResultBuilder]: For program point L3243(lines 3243 5062) no Hoare annotation was computed. [2023-02-18 15:34:44,668 INFO L899 garLoopResultBuilder]: For program point L4036(lines 4036 4047) no Hoare annotation was computed. [2023-02-18 15:34:44,668 INFO L899 garLoopResultBuilder]: For program point L4697(lines 4697 4933) no Hoare annotation was computed. [2023-02-18 15:34:44,668 INFO L895 garLoopResultBuilder]: At program point L337(lines 264 599) the Hoare annotation is: (let ((.cse0 (<= (* (- 1) |ULTIMATE.start_main_~main__t~0#1|) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_~main__t~0#1| 0)) .cse0)) [2023-02-18 15:34:44,668 INFO L899 garLoopResultBuilder]: For program point L4433(lines 4433 4457) no Hoare annotation was computed. [2023-02-18 15:34:44,668 INFO L899 garLoopResultBuilder]: For program point L206(lines 206 603) no Hoare annotation was computed. [2023-02-18 15:34:44,668 INFO L899 garLoopResultBuilder]: For program point L999(lines 999 5260) no Hoare annotation was computed. [2023-02-18 15:34:44,668 INFO L899 garLoopResultBuilder]: For program point L1792(lines 1792 1803) no Hoare annotation was computed. [2023-02-18 15:34:44,668 INFO L899 garLoopResultBuilder]: For program point L2189(lines 2189 2213) no Hoare annotation was computed. [2023-02-18 15:34:44,669 INFO L899 garLoopResultBuilder]: For program point L75(lines 75 649) no Hoare annotation was computed. [2023-02-18 15:34:44,669 INFO L899 garLoopResultBuilder]: For program point L2982(lines 2982 5084) no Hoare annotation was computed. [2023-02-18 15:34:44,669 INFO L899 garLoopResultBuilder]: For program point L2718(lines 2718 5107) no Hoare annotation was computed. [2023-02-18 15:34:44,669 INFO L899 garLoopResultBuilder]: For program point L2454(lines 2454 5130) no Hoare annotation was computed. [2023-02-18 15:34:44,669 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 4678) no Hoare annotation was computed. [2023-02-18 15:34:44,669 INFO L899 garLoopResultBuilder]: For program point L3379(lines 3379 5050) no Hoare annotation was computed. [2023-02-18 15:34:44,669 INFO L899 garLoopResultBuilder]: For program point L4172(lines 4172 4183) no Hoare annotation was computed. [2023-02-18 15:34:44,669 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 4866) no Hoare annotation was computed. [2023-02-18 15:34:44,670 INFO L899 garLoopResultBuilder]: For program point L4569(lines 4569 4593) no Hoare annotation was computed. [2023-02-18 15:34:44,670 INFO L899 garLoopResultBuilder]: For program point L738(lines 738 5282) no Hoare annotation was computed. [2023-02-18 15:34:44,670 INFO L899 garLoopResultBuilder]: For program point L1135(lines 1135 5248) no Hoare annotation was computed. [2023-02-18 15:34:44,670 INFO L899 garLoopResultBuilder]: For program point L1928(lines 1928 1939) no Hoare annotation was computed. [2023-02-18 15:34:44,670 INFO L895 garLoopResultBuilder]: At program point L475(lines 408 511) the Hoare annotation is: (let ((.cse0 (<= (* (- 1) |ULTIMATE.start_main_~main__t~0#1|) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_~main__t~0#1| 0)) .cse0)) [2023-02-18 15:34:44,670 INFO L899 garLoopResultBuilder]: For program point L2325(lines 2325 2349) no Hoare annotation was computed. [2023-02-18 15:34:44,670 INFO L899 garLoopResultBuilder]: For program point L3118(lines 3118 5072) no Hoare annotation was computed. [2023-02-18 15:34:44,670 INFO L899 garLoopResultBuilder]: For program point L2854(lines 2854 5095) no Hoare annotation was computed. [2023-02-18 15:34:44,671 INFO L899 garLoopResultBuilder]: For program point L2590(lines 2590 5118) no Hoare annotation was computed. [2023-02-18 15:34:44,671 INFO L899 garLoopResultBuilder]: For program point L3515(lines 3515 5038) no Hoare annotation was computed. [2023-02-18 15:34:44,671 INFO L899 garLoopResultBuilder]: For program point L344(lines 344 556) no Hoare annotation was computed. [2023-02-18 15:34:44,671 INFO L899 garLoopResultBuilder]: For program point L4308(lines 4308 4319) no Hoare annotation was computed. [2023-02-18 15:34:44,671 INFO L899 garLoopResultBuilder]: For program point L4705(lines 4705 4932) no Hoare annotation was computed. [2023-02-18 15:34:44,671 INFO L895 garLoopResultBuilder]: At program point L477(lines 404 552) the Hoare annotation is: (let ((.cse0 (<= (* (- 1) |ULTIMATE.start_main_~main__t~0#1|) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_~main__t~0#1| 0)) .cse0)) [2023-02-18 15:34:44,671 INFO L899 garLoopResultBuilder]: For program point L874(lines 874 5270) no Hoare annotation was computed. [2023-02-18 15:34:44,671 INFO L899 garLoopResultBuilder]: For program point L1271(lines 1271 5236) no Hoare annotation was computed. [2023-02-18 15:34:44,672 INFO L899 garLoopResultBuilder]: For program point L2064(lines 2064 2075) no Hoare annotation was computed. [2023-02-18 15:34:44,672 INFO L899 garLoopResultBuilder]: For program point L611(lines 611 644) no Hoare annotation was computed. [2023-02-18 15:34:44,672 INFO L899 garLoopResultBuilder]: For program point L2461(lines 2461 2485) no Hoare annotation was computed. [2023-02-18 15:34:44,672 INFO L899 garLoopResultBuilder]: For program point L3254(lines 3254 5060) no Hoare annotation was computed. [2023-02-18 15:34:44,672 INFO L899 garLoopResultBuilder]: For program point L2990(lines 2990 5083) no Hoare annotation was computed. [2023-02-18 15:34:44,672 INFO L899 garLoopResultBuilder]: For program point L2726(lines 2726 5106) no Hoare annotation was computed. [2023-02-18 15:34:44,672 INFO L899 garLoopResultBuilder]: For program point L3651(lines 3651 5026) no Hoare annotation was computed. [2023-02-18 15:34:44,672 INFO L899 garLoopResultBuilder]: For program point L4444(lines 4444 4455) no Hoare annotation was computed. [2023-02-18 15:34:44,673 INFO L899 garLoopResultBuilder]: For program point L217(lines 217 601) no Hoare annotation was computed. [2023-02-18 15:34:44,673 INFO L899 garLoopResultBuilder]: For program point L1010(lines 1010 5258) no Hoare annotation was computed. [2023-02-18 15:34:44,673 INFO L899 garLoopResultBuilder]: For program point L746(lines 746 5281) no Hoare annotation was computed. [2023-02-18 15:34:44,673 INFO L899 garLoopResultBuilder]: For program point L1407(lines 1407 5224) no Hoare annotation was computed. [2023-02-18 15:34:44,673 INFO L899 garLoopResultBuilder]: For program point L2200(lines 2200 2211) no Hoare annotation was computed. [2023-02-18 15:34:44,673 INFO L899 garLoopResultBuilder]: For program point L86(lines 86 647) no Hoare annotation was computed. [2023-02-18 15:34:44,673 INFO L899 garLoopResultBuilder]: For program point L2597(lines 2597 2621) no Hoare annotation was computed. [2023-02-18 15:34:44,673 INFO L899 garLoopResultBuilder]: For program point L3390(lines 3390 5048) no Hoare annotation was computed. [2023-02-18 15:34:44,674 INFO L899 garLoopResultBuilder]: For program point L3126(lines 3126 5071) no Hoare annotation was computed. [2023-02-18 15:34:44,674 INFO L899 garLoopResultBuilder]: For program point L2862(lines 2862 5094) no Hoare annotation was computed. [2023-02-18 15:34:44,674 INFO L899 garLoopResultBuilder]: For program point L3787(lines 3787 5014) no Hoare annotation was computed. [2023-02-18 15:34:44,674 INFO L899 garLoopResultBuilder]: For program point L4712(lines 4712 4924) no Hoare annotation was computed. [2023-02-18 15:34:44,674 INFO L899 garLoopResultBuilder]: For program point L484(lines 484 509) no Hoare annotation was computed. [2023-02-18 15:34:44,674 INFO L899 garLoopResultBuilder]: For program point L4580(lines 4580 4591) no Hoare annotation was computed. [2023-02-18 15:34:44,674 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 4743) no Hoare annotation was computed. [2023-02-18 15:34:44,675 INFO L895 garLoopResultBuilder]: At program point L4845(lines 4770 4920) the Hoare annotation is: (let ((.cse0 (<= 0 |ULTIMATE.start_main_~main__tagbuf_len~0#1|))) (and .cse0 (let ((.cse14 (* (- 1) |ULTIMATE.start_main_~main__t~0#1|))) (let ((.cse2 (or (not (<= (+ |ULTIMATE.start_main_~main__tagbuf_len~0#1| .cse14) 0)) (and (<= (+ |ULTIMATE.start_main_~main__tagbuf_len~0#1| .cse14 1) 0) (<= |ULTIMATE.start_main_~main__t~0#1| |ULTIMATE.start_main_~main__tagbuf_len~0#1|))))) (let ((.cse1 (let ((.cse3 (let ((.cse4 (<= 0 (+ |ULTIMATE.start_main_~main__t~0#1| (- 61))))) (let ((.cse5 (let ((.cse6 (<= 0 (+ |ULTIMATE.start_main_~main__t~0#1| (- 59)))) (.cse7 (not (= 0 |ULTIMATE.start_main_~__VERIFIER_assert__cond~270#1|))) (.cse8 (not (= 0 |ULTIMATE.start_main_~__VERIFIER_assert__cond~272#1|))) (.cse9 (<= 0 (+ |ULTIMATE.start_main_~main__t~0#1| (- 60)))) (.cse10 (not (= 0 |ULTIMATE.start_main_~__VERIFIER_assert__cond~271#1|))) (.cse11 (not (= 0 |ULTIMATE.start_main_~__VERIFIER_assert__cond~273#1|))) (.cse12 (let ((.cse13 (<= .cse14 0))) (or (and (not .cse13) (= |ULTIMATE.start_main_~main__t~0#1| 0)) .cse13)))) (or (and .cse0 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse2) (and .cse0 .cse4 .cse6 .cse7 .cse8 (not (= 0 |ULTIMATE.start_main_~__VERIFIER_assert__cond~276#1|)) .cse9 .cse10 .cse11 .cse12 .cse2))))) (or (and .cse4 .cse5 .cse2) (and .cse4 .cse5 .cse2 (not (= 0 |ULTIMATE.start_main_~__VERIFIER_assert__cond~280#1|)))))))) (or (and .cse3 .cse2 (not (= 0 |ULTIMATE.start_main_~__VERIFIER_assert__cond~277#1|))) (and .cse3 .cse2))))) (or (and .cse1 .cse2) (and .cse1 (not (= 0 |ULTIMATE.start_main_~__VERIFIER_assert__cond~281#1|)) .cse2))))))) [2023-02-18 15:34:44,675 INFO L899 garLoopResultBuilder]: For program point L1146(lines 1146 5246) no Hoare annotation was computed. [2023-02-18 15:34:44,675 INFO L899 garLoopResultBuilder]: For program point L882(lines 882 5269) no Hoare annotation was computed. [2023-02-18 15:34:44,675 INFO L899 garLoopResultBuilder]: For program point L4714(line 4714) no Hoare annotation was computed. [2023-02-18 15:34:44,675 INFO L899 garLoopResultBuilder]: For program point L618(lines 618 638) no Hoare annotation was computed. [2023-02-18 15:34:44,675 INFO L899 garLoopResultBuilder]: For program point L1543(lines 1543 5212) no Hoare annotation was computed. [2023-02-18 15:34:44,675 INFO L899 garLoopResultBuilder]: For program point L2336(lines 2336 2347) no Hoare annotation was computed. [2023-02-18 15:34:44,675 INFO L899 garLoopResultBuilder]: For program point L2733(lines 2733 2757) no Hoare annotation was computed. [2023-02-18 15:34:44,676 INFO L899 garLoopResultBuilder]: For program point L3526(lines 3526 5036) no Hoare annotation was computed. [2023-02-18 15:34:44,676 INFO L899 garLoopResultBuilder]: For program point L355(lines 355 554) no Hoare annotation was computed. [2023-02-18 15:34:44,676 INFO L899 garLoopResultBuilder]: For program point L3262(lines 3262 5059) no Hoare annotation was computed. [2023-02-18 15:34:44,676 INFO L899 garLoopResultBuilder]: For program point L2998(lines 2998 5082) no Hoare annotation was computed. [2023-02-18 15:34:44,676 INFO L899 garLoopResultBuilder]: For program point L3923(lines 3923 5002) no Hoare annotation was computed. [2023-02-18 15:34:44,676 INFO L899 garLoopResultBuilder]: For program point L1282(lines 1282 5234) no Hoare annotation was computed. [2023-02-18 15:34:44,676 INFO L899 garLoopResultBuilder]: For program point L1018(lines 1018 5257) no Hoare annotation was computed. [2023-02-18 15:34:44,676 INFO L899 garLoopResultBuilder]: For program point L754(lines 754 5280) no Hoare annotation was computed. [2023-02-18 15:34:44,677 INFO L899 garLoopResultBuilder]: For program point L1679(lines 1679 5200) no Hoare annotation was computed. [2023-02-18 15:34:44,677 INFO L899 garLoopResultBuilder]: For program point L2472(lines 2472 2483) no Hoare annotation was computed. [2023-02-18 15:34:44,677 INFO L899 garLoopResultBuilder]: For program point L94(lines 94 646) no Hoare annotation was computed. [2023-02-18 15:34:44,677 INFO L899 garLoopResultBuilder]: For program point L2869(lines 2869 2893) no Hoare annotation was computed. [2023-02-18 15:34:44,677 INFO L899 garLoopResultBuilder]: For program point L3662(lines 3662 5024) no Hoare annotation was computed. [2023-02-18 15:34:44,677 INFO L899 garLoopResultBuilder]: For program point L3398(lines 3398 5047) no Hoare annotation was computed. [2023-02-18 15:34:44,677 INFO L895 garLoopResultBuilder]: At program point L227(lines 68 5292) the Hoare annotation is: (let ((.cse0 (<= (* (- 1) |ULTIMATE.start_main_~main__t~0#1|) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_~main__t~0#1| 0)) .cse0)) [2023-02-18 15:34:44,677 INFO L899 garLoopResultBuilder]: For program point L3134(lines 3134 5070) no Hoare annotation was computed. [2023-02-18 15:34:44,678 INFO L899 garLoopResultBuilder]: For program point L4059(lines 4059 4990) no Hoare annotation was computed. [2023-02-18 15:34:44,678 INFO L899 garLoopResultBuilder]: For program point L4852(lines 4852 4876) no Hoare annotation was computed. [2023-02-18 15:34:44,678 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-18 15:34:44,678 INFO L899 garLoopResultBuilder]: For program point L1418(lines 1418 5222) no Hoare annotation was computed. [2023-02-18 15:34:44,678 INFO L899 garLoopResultBuilder]: For program point L1154(lines 1154 5245) no Hoare annotation was computed. [2023-02-18 15:34:44,678 INFO L899 garLoopResultBuilder]: For program point L890(lines 890 5268) no Hoare annotation was computed. [2023-02-18 15:34:44,678 INFO L899 garLoopResultBuilder]: For program point L4854(line 4854) no Hoare annotation was computed. [2023-02-18 15:34:44,679 INFO L899 garLoopResultBuilder]: For program point L1815(lines 1815 5188) no Hoare annotation was computed. [2023-02-18 15:34:44,679 INFO L899 garLoopResultBuilder]: For program point L2608(lines 2608 2619) no Hoare annotation was computed. [2023-02-18 15:34:44,679 INFO L899 garLoopResultBuilder]: For program point L230(lines 230 600) no Hoare annotation was computed. [2023-02-18 15:34:44,679 INFO L899 garLoopResultBuilder]: For program point L3005(lines 3005 3029) no Hoare annotation was computed. [2023-02-18 15:34:44,679 INFO L899 garLoopResultBuilder]: For program point L3798(lines 3798 5012) no Hoare annotation was computed. [2023-02-18 15:34:44,679 INFO L899 garLoopResultBuilder]: For program point L495(lines 495 507) no Hoare annotation was computed. [2023-02-18 15:34:44,679 INFO L899 garLoopResultBuilder]: For program point L3534(lines 3534 5035) no Hoare annotation was computed. [2023-02-18 15:34:44,679 INFO L899 garLoopResultBuilder]: For program point L3270(lines 3270 5058) no Hoare annotation was computed. [2023-02-18 15:34:44,680 INFO L899 garLoopResultBuilder]: For program point L4195(lines 4195 4978) no Hoare annotation was computed. [2023-02-18 15:34:44,680 INFO L899 garLoopResultBuilder]: For program point L4724(lines 4724 4922) no Hoare annotation was computed. [2023-02-18 15:34:44,680 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 4811) no Hoare annotation was computed. [2023-02-18 15:34:44,680 INFO L899 garLoopResultBuilder]: For program point L761(lines 761 785) no Hoare annotation was computed. [2023-02-18 15:34:44,680 INFO L899 garLoopResultBuilder]: For program point L629(lines 629 636) no Hoare annotation was computed. [2023-02-18 15:34:44,680 INFO L899 garLoopResultBuilder]: For program point L1554(lines 1554 5210) no Hoare annotation was computed. [2023-02-18 15:34:44,680 INFO L899 garLoopResultBuilder]: For program point L1290(lines 1290 5233) no Hoare annotation was computed. [2023-02-18 15:34:44,680 INFO L899 garLoopResultBuilder]: For program point L101(lines 101 121) no Hoare annotation was computed. [2023-02-18 15:34:44,681 INFO L899 garLoopResultBuilder]: For program point L1026(lines 1026 5256) no Hoare annotation was computed. [2023-02-18 15:34:44,683 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 15:34:44,685 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-18 15:34:44,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.02 03:34:44 BoogieIcfgContainer [2023-02-18 15:34:44,734 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-18 15:34:44,735 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-18 15:34:44,735 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-18 15:34:44,735 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-18 15:34:44,735 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 03:33:57" (3/4) ... [2023-02-18 15:34:44,738 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-18 15:34:44,764 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2023-02-18 15:34:44,767 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-02-18 15:34:44,771 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-18 15:34:44,774 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-18 15:34:44,993 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-18 15:34:44,994 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-18 15:34:44,995 INFO L158 Benchmark]: Toolchain (without parser) took 50653.22ms. Allocated memory was 140.5MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 95.3MB in the beginning and 1.0GB in the end (delta: -946.4MB). Peak memory consumption was 540.1MB. Max. memory is 16.1GB. [2023-02-18 15:34:44,995 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 140.5MB. Free memory was 108.7MB in the beginning and 108.5MB in the end (delta: 159.6kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 15:34:44,995 INFO L158 Benchmark]: CACSL2BoogieTranslator took 973.93ms. Allocated memory was 140.5MB in the beginning and 184.5MB in the end (delta: 44.0MB). Free memory was 95.3MB in the beginning and 105.7MB in the end (delta: -10.3MB). Peak memory consumption was 60.3MB. Max. memory is 16.1GB. [2023-02-18 15:34:44,996 INFO L158 Benchmark]: Boogie Procedure Inliner took 118.38ms. Allocated memory is still 184.5MB. Free memory was 105.7MB in the beginning and 94.1MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-18 15:34:44,996 INFO L158 Benchmark]: Boogie Preprocessor took 138.55ms. Allocated memory is still 184.5MB. Free memory was 94.1MB in the beginning and 86.8MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-02-18 15:34:44,996 INFO L158 Benchmark]: RCFGBuilder took 1537.34ms. Allocated memory is still 184.5MB. Free memory was 86.8MB in the beginning and 115.2MB in the end (delta: -28.5MB). Peak memory consumption was 38.0MB. Max. memory is 16.1GB. [2023-02-18 15:34:44,997 INFO L158 Benchmark]: TraceAbstraction took 47619.79ms. Allocated memory was 184.5MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 115.2MB in the beginning and 1.1GB in the end (delta: -966.0MB). Peak memory consumption was 475.8MB. Max. memory is 16.1GB. [2023-02-18 15:34:44,997 INFO L158 Benchmark]: Witness Printer took 259.10ms. Allocated memory is still 1.6GB. Free memory was 1.1GB in the beginning and 1.0GB in the end (delta: 39.5MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2023-02-18 15:34:45,002 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.20ms. Allocated memory is still 140.5MB. Free memory was 108.7MB in the beginning and 108.5MB in the end (delta: 159.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 973.93ms. Allocated memory was 140.5MB in the beginning and 184.5MB in the end (delta: 44.0MB). Free memory was 95.3MB in the beginning and 105.7MB in the end (delta: -10.3MB). Peak memory consumption was 60.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 118.38ms. Allocated memory is still 184.5MB. Free memory was 105.7MB in the beginning and 94.1MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 138.55ms. Allocated memory is still 184.5MB. Free memory was 94.1MB in the beginning and 86.8MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1537.34ms. Allocated memory is still 184.5MB. Free memory was 86.8MB in the beginning and 115.2MB in the end (delta: -28.5MB). Peak memory consumption was 38.0MB. Max. memory is 16.1GB. * TraceAbstraction took 47619.79ms. Allocated memory was 184.5MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 115.2MB in the beginning and 1.1GB in the end (delta: -966.0MB). Peak memory consumption was 475.8MB. Max. memory is 16.1GB. * Witness Printer took 259.10ms. Allocated memory is still 1.6GB. Free memory was 1.1GB in the beginning and 1.0GB in the end (delta: 39.5MB). Peak memory consumption was 37.7MB. 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: 41]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 53]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 4678]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 4690]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 4714]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 4726]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 4743]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 4755]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 4783]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 4795]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 4811]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 4823]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 4854]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 4866]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 4893]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 4905]: 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, 475 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 47.5s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 7.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2414 SdHoareTripleChecker+Valid, 6.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2414 mSDsluCounter, 3700 SdHoareTripleChecker+Invalid, 5.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1907 mSDsCounter, 399 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13722 IncrementalHoareTripleChecker+Invalid, 14121 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 399 mSolverCounterUnsat, 1793 mSDtfsCounter, 13722 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 985 GetRequests, 610 SyntacticMatches, 5 SemanticMatches, 370 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 6.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=475occurred in iteration=0, InterpolantAutomatonStates: 375, 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, 16 MinimizatonAttempts, 92 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 13 PreInvPairs, 18 NumberOfFragments, 12584 HoareAnnotationTreeSize, 13 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 13 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 37.9s InterpolantComputationTime, 3540 NumberOfCodeBlocks, 3540 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 3524 ConstructedInterpolants, 0 QuantifiedInterpolants, 33793 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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: 128]: Loop Invariant Derived loop invariant: (!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0 - InvariantResult [Line: 4734]: Loop Invariant Derived loop invariant: 0 <= main__tagbuf_len && ((((((!(main__tagbuf_len + -1 * main__t + 1 <= 0) || main__t <= main__tagbuf_len) || !(main__tagbuf_len + -1 * main__t <= 0)) && (((0 <= main__t + -61 && ((!(main__tagbuf_len + -1 * main__t + 1 <= 0) || main__t <= main__tagbuf_len) || !(main__tagbuf_len + -1 * main__t <= 0))) && (((((((((((0 <= main__tagbuf_len && 0 <= main__t + -61) && 0 <= main__t + -59) && !(0 == __VERIFIER_assert__cond)) && ((!(main__tagbuf_len + -1 * main__t + 1 <= 0) || main__t <= main__tagbuf_len) || !(main__tagbuf_len + -1 * main__t <= 0))) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -60) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (((((((((0 <= main__tagbuf_len && 0 <= main__t + -61) && 0 <= main__t + -59) && !(0 == __VERIFIER_assert__cond)) && ((!(main__tagbuf_len + -1 * main__t + 1 <= 0) || main__t <= main__tagbuf_len) || !(main__tagbuf_len + -1 * main__t <= 0))) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -60) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)))) || (((0 <= main__t + -61 && ((!(main__tagbuf_len + -1 * main__t + 1 <= 0) || main__t <= main__tagbuf_len) || !(main__tagbuf_len + -1 * main__t <= 0))) && (((((((((((0 <= main__tagbuf_len && 0 <= main__t + -61) && 0 <= main__t + -59) && !(0 == __VERIFIER_assert__cond)) && ((!(main__tagbuf_len + -1 * main__t + 1 <= 0) || main__t <= main__tagbuf_len) || !(main__tagbuf_len + -1 * main__t <= 0))) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -60) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (((((((((0 <= main__tagbuf_len && 0 <= main__t + -61) && 0 <= main__t + -59) && !(0 == __VERIFIER_assert__cond)) && ((!(main__tagbuf_len + -1 * main__t + 1 <= 0) || main__t <= main__tagbuf_len) || !(main__tagbuf_len + -1 * main__t <= 0))) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -60) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)))) && !(0 == __VERIFIER_assert__cond)))) || ((((!(main__tagbuf_len + -1 * main__t + 1 <= 0) || main__t <= main__tagbuf_len) || !(main__tagbuf_len + -1 * main__t <= 0)) && (((0 <= main__t + -61 && ((!(main__tagbuf_len + -1 * main__t + 1 <= 0) || main__t <= main__tagbuf_len) || !(main__tagbuf_len + -1 * main__t <= 0))) && (((((((((((0 <= main__tagbuf_len && 0 <= main__t + -61) && 0 <= main__t + -59) && !(0 == __VERIFIER_assert__cond)) && ((!(main__tagbuf_len + -1 * main__t + 1 <= 0) || main__t <= main__tagbuf_len) || !(main__tagbuf_len + -1 * main__t <= 0))) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -60) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (((((((((0 <= main__tagbuf_len && 0 <= main__t + -61) && 0 <= main__t + -59) && !(0 == __VERIFIER_assert__cond)) && ((!(main__tagbuf_len + -1 * main__t + 1 <= 0) || main__t <= main__tagbuf_len) || !(main__tagbuf_len + -1 * main__t <= 0))) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -60) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)))) || (((0 <= main__t + -61 && ((!(main__tagbuf_len + -1 * main__t + 1 <= 0) || main__t <= main__tagbuf_len) || !(main__tagbuf_len + -1 * main__t <= 0))) && (((((((((((0 <= main__tagbuf_len && 0 <= main__t + -61) && 0 <= main__t + -59) && !(0 == __VERIFIER_assert__cond)) && ((!(main__tagbuf_len + -1 * main__t + 1 <= 0) || main__t <= main__tagbuf_len) || !(main__tagbuf_len + -1 * main__t <= 0))) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -60) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (((((((((0 <= main__tagbuf_len && 0 <= main__t + -61) && 0 <= main__t + -59) && !(0 == __VERIFIER_assert__cond)) && ((!(main__tagbuf_len + -1 * main__t + 1 <= 0) || main__t <= main__tagbuf_len) || !(main__tagbuf_len + -1 * main__t <= 0))) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -60) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)))) && !(0 == __VERIFIER_assert__cond)))) && !(0 == __VERIFIER_assert__cond))) && ((!(main__tagbuf_len + -1 * main__t + 1 <= 0) || main__t <= main__tagbuf_len) || !(main__tagbuf_len + -1 * main__t <= 0))) || ((((((!(main__tagbuf_len + -1 * main__t + 1 <= 0) || main__t <= main__tagbuf_len) || !(main__tagbuf_len + -1 * main__t <= 0)) && (((0 <= main__t + -61 && ((!(main__tagbuf_len + -1 * main__t + 1 <= 0) || main__t <= main__tagbuf_len) || !(main__tagbuf_len + -1 * main__t <= 0))) && (((((((((((0 <= main__tagbuf_len && 0 <= main__t + -61) && 0 <= main__t + -59) && !(0 == __VERIFIER_assert__cond)) && ((!(main__tagbuf_len + -1 * main__t + 1 <= 0) || main__t <= main__tagbuf_len) || !(main__tagbuf_len + -1 * main__t <= 0))) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -60) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (((((((((0 <= main__tagbuf_len && 0 <= main__t + -61) && 0 <= main__t + -59) && !(0 == __VERIFIER_assert__cond)) && ((!(main__tagbuf_len + -1 * main__t + 1 <= 0) || main__t <= main__tagbuf_len) || !(main__tagbuf_len + -1 * main__t <= 0))) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -60) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)))) || (((0 <= main__t + -61 && ((!(main__tagbuf_len + -1 * main__t + 1 <= 0) || main__t <= main__tagbuf_len) || !(main__tagbuf_len + -1 * main__t <= 0))) && (((((((((((0 <= main__tagbuf_len && 0 <= main__t + -61) && 0 <= main__t + -59) && !(0 == __VERIFIER_assert__cond)) && ((!(main__tagbuf_len + -1 * main__t + 1 <= 0) || main__t <= main__tagbuf_len) || !(main__tagbuf_len + -1 * main__t <= 0))) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -60) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (((((((((0 <= main__tagbuf_len && 0 <= main__t + -61) && 0 <= main__t + -59) && !(0 == __VERIFIER_assert__cond)) && ((!(main__tagbuf_len + -1 * main__t + 1 <= 0) || main__t <= main__tagbuf_len) || !(main__tagbuf_len + -1 * main__t <= 0))) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -60) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)))) && !(0 == __VERIFIER_assert__cond)))) || ((((!(main__tagbuf_len + -1 * main__t + 1 <= 0) || main__t <= main__tagbuf_len) || !(main__tagbuf_len + -1 * main__t <= 0)) && (((0 <= main__t + -61 && ((!(main__tagbuf_len + -1 * main__t + 1 <= 0) || main__t <= main__tagbuf_len) || !(main__tagbuf_len + -1 * main__t <= 0))) && (((((((((((0 <= main__tagbuf_len && 0 <= main__t + -61) && 0 <= main__t + -59) && !(0 == __VERIFIER_assert__cond)) && ((!(main__tagbuf_len + -1 * main__t + 1 <= 0) || main__t <= main__tagbuf_len) || !(main__tagbuf_len + -1 * main__t <= 0))) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -60) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (((((((((0 <= main__tagbuf_len && 0 <= main__t + -61) && 0 <= main__t + -59) && !(0 == __VERIFIER_assert__cond)) && ((!(main__tagbuf_len + -1 * main__t + 1 <= 0) || main__t <= main__tagbuf_len) || !(main__tagbuf_len + -1 * main__t <= 0))) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -60) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)))) || (((0 <= main__t + -61 && ((!(main__tagbuf_len + -1 * main__t + 1 <= 0) || main__t <= main__tagbuf_len) || !(main__tagbuf_len + -1 * main__t <= 0))) && (((((((((((0 <= main__tagbuf_len && 0 <= main__t + -61) && 0 <= main__t + -59) && !(0 == __VERIFIER_assert__cond)) && ((!(main__tagbuf_len + -1 * main__t + 1 <= 0) || main__t <= main__tagbuf_len) || !(main__tagbuf_len + -1 * main__t <= 0))) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -60) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (((((((((0 <= main__tagbuf_len && 0 <= main__t + -61) && 0 <= main__t + -59) && !(0 == __VERIFIER_assert__cond)) && ((!(main__tagbuf_len + -1 * main__t + 1 <= 0) || main__t <= main__tagbuf_len) || !(main__tagbuf_len + -1 * main__t <= 0))) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -60) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)))) && !(0 == __VERIFIER_assert__cond)))) && !(0 == __VERIFIER_assert__cond))) && ((!(main__tagbuf_len + -1 * main__t + 1 <= 0) || main__t <= main__tagbuf_len) || !(main__tagbuf_len + -1 * main__t <= 0))) && !(0 == __VERIFIER_assert__cond))) - InvariantResult [Line: 408]: Loop Invariant Derived loop invariant: (!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0 - InvariantResult [Line: 4665]: Loop Invariant Derived loop invariant: (0 <= main__tagbuf_len && (((((((0 <= main__t + -61 && (((((0 <= main__tagbuf_len && 0 <= main__t + -59) && ((((((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && !(0 == __VERIFIER_assert__cond)) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))) || ((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len)))) && 0 <= main__t + -60) || (0 <= main__t + -59 && ((((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && !(0 == __VERIFIER_assert__cond)) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))) || ((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))))))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))) || (((0 <= main__tagbuf_len && 0 <= main__t + -61) && ((((((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && !(0 == __VERIFIER_assert__cond)) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))) || ((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len)))) && 0 <= main__t + -60) || (0 <= main__t + -59 && ((((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && !(0 == __VERIFIER_assert__cond)) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))) || ((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))))))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len)))) || (((0 <= main__tagbuf_len && ((((((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && !(0 == __VERIFIER_assert__cond)) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))) || ((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len)))) && 0 <= main__t + -60) || (0 <= main__t + -59 && ((((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && !(0 == __VERIFIER_assert__cond)) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))) || ((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))))))) && 0 <= main__t + -60) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))))) || ((((((0 <= main__tagbuf_len && 0 <= main__t + -59) && ((((((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && !(0 == __VERIFIER_assert__cond)) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))) || ((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len)))) && 0 <= main__t + -60) || (0 <= main__t + -59 && ((((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && !(0 == __VERIFIER_assert__cond)) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))) || ((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))))))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))) || (((0 <= main__tagbuf_len && 0 <= main__t + -61) && ((((((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && !(0 == __VERIFIER_assert__cond)) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))) || ((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len)))) && 0 <= main__t + -60) || (0 <= main__t + -59 && ((((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && !(0 == __VERIFIER_assert__cond)) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))) || ((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))))))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len)))) || (((0 <= main__tagbuf_len && ((((((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && !(0 == __VERIFIER_assert__cond)) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))) || ((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len)))) && 0 <= main__t + -60) || (0 <= main__t + -59 && ((((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && !(0 == __VERIFIER_assert__cond)) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))) || ((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))))))) && 0 <= main__t + -60) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len)))) && 0 <= main__t + -60)) || (0 <= main__t + -59 && (((((0 <= main__tagbuf_len && 0 <= main__t + -59) && ((((((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && !(0 == __VERIFIER_assert__cond)) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))) || ((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len)))) && 0 <= main__t + -60) || (0 <= main__t + -59 && ((((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && !(0 == __VERIFIER_assert__cond)) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))) || ((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))))))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))) || (((0 <= main__tagbuf_len && 0 <= main__t + -61) && ((((((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && !(0 == __VERIFIER_assert__cond)) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))) || ((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len)))) && 0 <= main__t + -60) || (0 <= main__t + -59 && ((((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && !(0 == __VERIFIER_assert__cond)) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))) || ((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))))))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len)))) || (((0 <= main__tagbuf_len && ((((((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && !(0 == __VERIFIER_assert__cond)) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))) || ((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len)))) && 0 <= main__t + -60) || (0 <= main__t + -59 && ((((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && !(0 == __VERIFIER_assert__cond)) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))) || ((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))))))) && 0 <= main__t + -60) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len)))))) && 0 <= main__t + -60) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))) || ((0 <= main__t + -61 && (((0 <= main__t + -61 && (((((0 <= main__tagbuf_len && 0 <= main__t + -59) && ((((((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && !(0 == __VERIFIER_assert__cond)) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))) || ((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len)))) && 0 <= main__t + -60) || (0 <= main__t + -59 && ((((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && !(0 == __VERIFIER_assert__cond)) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))) || ((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))))))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))) || (((0 <= main__tagbuf_len && 0 <= main__t + -61) && ((((((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && !(0 == __VERIFIER_assert__cond)) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))) || ((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len)))) && 0 <= main__t + -60) || (0 <= main__t + -59 && ((((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && !(0 == __VERIFIER_assert__cond)) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))) || ((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))))))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len)))) || (((0 <= main__tagbuf_len && ((((((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && !(0 == __VERIFIER_assert__cond)) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))) || ((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len)))) && 0 <= main__t + -60) || (0 <= main__t + -59 && ((((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && !(0 == __VERIFIER_assert__cond)) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))) || ((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))))))) && 0 <= main__t + -60) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))))) || ((((((0 <= main__tagbuf_len && 0 <= main__t + -59) && ((((((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && !(0 == __VERIFIER_assert__cond)) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))) || ((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len)))) && 0 <= main__t + -60) || (0 <= main__t + -59 && ((((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && !(0 == __VERIFIER_assert__cond)) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))) || ((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))))))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))) || (((0 <= main__tagbuf_len && 0 <= main__t + -61) && ((((((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && !(0 == __VERIFIER_assert__cond)) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))) || ((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len)))) && 0 <= main__t + -60) || (0 <= main__t + -59 && ((((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && !(0 == __VERIFIER_assert__cond)) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))) || ((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))))))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len)))) || (((0 <= main__tagbuf_len && ((((((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && !(0 == __VERIFIER_assert__cond)) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))) || ((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len)))) && 0 <= main__t + -60) || (0 <= main__t + -59 && ((((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && !(0 == __VERIFIER_assert__cond)) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))) || ((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))))))) && 0 <= main__t + -60) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len)))) && 0 <= main__t + -60)) || (0 <= main__t + -59 && (((((0 <= main__tagbuf_len && 0 <= main__t + -59) && ((((((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && !(0 == __VERIFIER_assert__cond)) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))) || ((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len)))) && 0 <= main__t + -60) || (0 <= main__t + -59 && ((((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && !(0 == __VERIFIER_assert__cond)) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))) || ((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))))))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))) || (((0 <= main__tagbuf_len && 0 <= main__t + -61) && ((((((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && !(0 == __VERIFIER_assert__cond)) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))) || ((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len)))) && 0 <= main__t + -60) || (0 <= main__t + -59 && ((((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && !(0 == __VERIFIER_assert__cond)) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))) || ((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))))))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len)))) || (((0 <= main__tagbuf_len && ((((((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && !(0 == __VERIFIER_assert__cond)) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))) || ((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len)))) && 0 <= main__t + -60) || (0 <= main__t + -59 && ((((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && !(0 == __VERIFIER_assert__cond)) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))) || ((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))))))) && 0 <= main__t + -60) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))))))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len)))) || ((0 <= main__t + -59 && (((0 <= main__t + -61 && (((((0 <= main__tagbuf_len && 0 <= main__t + -59) && ((((((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && !(0 == __VERIFIER_assert__cond)) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))) || ((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len)))) && 0 <= main__t + -60) || (0 <= main__t + -59 && ((((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && !(0 == __VERIFIER_assert__cond)) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))) || ((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))))))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))) || (((0 <= main__tagbuf_len && 0 <= main__t + -61) && ((((((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && !(0 == __VERIFIER_assert__cond)) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))) || ((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len)))) && 0 <= main__t + -60) || (0 <= main__t + -59 && ((((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && !(0 == __VERIFIER_assert__cond)) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))) || ((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))))))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len)))) || (((0 <= main__tagbuf_len && ((((((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && !(0 == __VERIFIER_assert__cond)) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))) || ((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len)))) && 0 <= main__t + -60) || (0 <= main__t + -59 && ((((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && !(0 == __VERIFIER_assert__cond)) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))) || ((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))))))) && 0 <= main__t + -60) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))))) || ((((((0 <= main__tagbuf_len && 0 <= main__t + -59) && ((((((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && !(0 == __VERIFIER_assert__cond)) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))) || ((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len)))) && 0 <= main__t + -60) || (0 <= main__t + -59 && ((((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && !(0 == __VERIFIER_assert__cond)) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))) || ((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))))))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))) || (((0 <= main__tagbuf_len && 0 <= main__t + -61) && ((((((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && !(0 == __VERIFIER_assert__cond)) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))) || ((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len)))) && 0 <= main__t + -60) || (0 <= main__t + -59 && ((((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && !(0 == __VERIFIER_assert__cond)) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))) || ((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))))))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len)))) || (((0 <= main__tagbuf_len && ((((((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && !(0 == __VERIFIER_assert__cond)) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))) || ((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len)))) && 0 <= main__t + -60) || (0 <= main__t + -59 && ((((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && !(0 == __VERIFIER_assert__cond)) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))) || ((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))))))) && 0 <= main__t + -60) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len)))) && 0 <= main__t + -60)) || (0 <= main__t + -59 && (((((0 <= main__tagbuf_len && 0 <= main__t + -59) && ((((((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && !(0 == __VERIFIER_assert__cond)) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))) || ((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len)))) && 0 <= main__t + -60) || (0 <= main__t + -59 && ((((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && !(0 == __VERIFIER_assert__cond)) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))) || ((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))))))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))) || (((0 <= main__tagbuf_len && 0 <= main__t + -61) && ((((((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && !(0 == __VERIFIER_assert__cond)) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))) || ((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len)))) && 0 <= main__t + -60) || (0 <= main__t + -59 && ((((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && !(0 == __VERIFIER_assert__cond)) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))) || ((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))))))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len)))) || (((0 <= main__tagbuf_len && ((((((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && !(0 == __VERIFIER_assert__cond)) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))) || ((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len)))) && 0 <= main__t + -60) || (0 <= main__t + -59 && ((((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && !(0 == __VERIFIER_assert__cond)) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))) || ((((0 <= main__t + -59 && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) || (0 <= main__t + -59 && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))))))) && 0 <= main__t + -60) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))))))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len)) - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: (((main__tagbuf_len == 0 && main__t == 0) && !(main__t + -1 * main__tagbuf_len <= 0)) || main__t + -1 * main__tagbuf_len <= 0) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) - InvariantResult [Line: 268]: Loop Invariant Derived loop invariant: (!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0 - InvariantResult [Line: 264]: Loop Invariant Derived loop invariant: (!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0 - InvariantResult [Line: 360]: Loop Invariant Derived loop invariant: (!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0 - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 404]: Loop Invariant Derived loop invariant: (!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0 - InvariantResult [Line: 68]: Loop Invariant Derived loop invariant: (!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0 - InvariantResult [Line: 4770]: Loop Invariant Derived loop invariant: 0 <= main__tagbuf_len && ((((((((0 <= main__t + -61 && ((((((((((0 <= main__tagbuf_len && 0 <= main__t + -61) && 0 <= main__t + -59) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -60) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))) || ((((((((((0 <= main__tagbuf_len && 0 <= main__t + -61) && 0 <= main__t + -59) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -60) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))) || (((0 <= main__t + -61 && ((((((((((0 <= main__tagbuf_len && 0 <= main__t + -61) && 0 <= main__t + -59) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -60) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))) || ((((((((((0 <= main__tagbuf_len && 0 <= main__t + -61) && 0 <= main__t + -59) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -60) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))) && !(0 == __VERIFIER_assert__cond))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))) && !(0 == __VERIFIER_assert__cond)) || ((((0 <= main__t + -61 && ((((((((((0 <= main__tagbuf_len && 0 <= main__t + -61) && 0 <= main__t + -59) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -60) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))) || ((((((((((0 <= main__tagbuf_len && 0 <= main__t + -61) && 0 <= main__t + -59) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -60) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))) || (((0 <= main__t + -61 && ((((((((((0 <= main__tagbuf_len && 0 <= main__t + -61) && 0 <= main__t + -59) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -60) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))) || ((((((((((0 <= main__tagbuf_len && 0 <= main__t + -61) && 0 <= main__t + -59) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -60) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))) && !(0 == __VERIFIER_assert__cond))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len)))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))) || ((((((((0 <= main__t + -61 && ((((((((((0 <= main__tagbuf_len && 0 <= main__t + -61) && 0 <= main__t + -59) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -60) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))) || ((((((((((0 <= main__tagbuf_len && 0 <= main__t + -61) && 0 <= main__t + -59) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -60) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))) || (((0 <= main__t + -61 && ((((((((((0 <= main__tagbuf_len && 0 <= main__t + -61) && 0 <= main__t + -59) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -60) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))) || ((((((((((0 <= main__tagbuf_len && 0 <= main__t + -61) && 0 <= main__t + -59) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -60) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))) && !(0 == __VERIFIER_assert__cond))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))) && !(0 == __VERIFIER_assert__cond)) || ((((0 <= main__t + -61 && ((((((((((0 <= main__tagbuf_len && 0 <= main__t + -61) && 0 <= main__t + -59) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -60) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))) || ((((((((((0 <= main__tagbuf_len && 0 <= main__t + -61) && 0 <= main__t + -59) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -60) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))) || (((0 <= main__t + -61 && ((((((((((0 <= main__tagbuf_len && 0 <= main__t + -61) && 0 <= main__t + -59) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -60) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))) || ((((((((((0 <= main__tagbuf_len && 0 <= main__t + -61) && 0 <= main__t + -59) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -60) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len))) && !(0 == __VERIFIER_assert__cond))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len)))) && !(0 == __VERIFIER_assert__cond)) && (!(main__tagbuf_len + -1 * main__t <= 0) || (main__tagbuf_len + -1 * main__t + 1 <= 0 && main__t <= main__tagbuf_len)))) RESULT: Ultimate proved your program to be correct! [2023-02-18 15:34:45,063 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