./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 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+lhb-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 39feee77bf576ea852c42114836a4ed3182237f56346991038306ebcfd74e257 --- Real Ultimate output --- This is Ultimate 0.2.2-?-574ddb4 [2023-02-17 06:31:00,447 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 06:31:00,449 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 06:31:00,471 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 06:31:00,471 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 06:31:00,472 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 06:31:00,476 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 06:31:00,478 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 06:31:00,480 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 06:31:00,484 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 06:31:00,485 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 06:31:00,487 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 06:31:00,487 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 06:31:00,488 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 06:31:00,489 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 06:31:00,489 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 06:31:00,490 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 06:31:00,490 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 06:31:00,491 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 06:31:00,499 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 06:31:00,500 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 06:31:00,500 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 06:31:00,501 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 06:31:00,501 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 06:31:00,503 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 06:31:00,504 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 06:31:00,504 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 06:31:00,504 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 06:31:00,504 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 06:31:00,505 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 06:31:00,505 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 06:31:00,506 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 06:31:00,506 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 06:31:00,506 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 06:31:00,507 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 06:31:00,507 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 06:31:00,507 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 06:31:00,508 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 06:31:00,521 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 06:31:00,523 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 06:31:00,524 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 06:31:00,535 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-17 06:31:00,565 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 06:31:00,567 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 06:31:00,568 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 06:31:00,568 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 06:31:00,569 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 06:31:00,569 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 06:31:00,569 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 06:31:00,569 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 06:31:00,569 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 06:31:00,570 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 06:31:00,570 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 06:31:00,570 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 06:31:00,570 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 06:31:00,571 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 06:31:00,571 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-17 06:31:00,571 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 06:31:00,571 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-17 06:31:00,571 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 06:31:00,571 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-17 06:31:00,571 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 06:31:00,572 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-17 06:31:00,572 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 06:31:00,572 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 06:31:00,572 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 06:31:00,572 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 06:31:00,572 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 06:31:00,572 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 06:31:00,573 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-17 06:31:00,573 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 06:31:00,573 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 06:31:00,573 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 06:31:00,573 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-17 06:31:00,574 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 06:31:00,574 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 06:31:00,574 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 06:31:00,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 -> 39feee77bf576ea852c42114836a4ed3182237f56346991038306ebcfd74e257 [2023-02-17 06:31:00,791 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 06:31:00,805 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 06:31:00,807 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 06:31:00,807 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 06:31:00,808 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 06:31:00,808 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c [2023-02-17 06:31:01,780 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 06:31:01,998 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 06:31:02,000 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c [2023-02-17 06:31:02,010 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfde8a7e1/6935ad724d204ce694e2fe11b193f172/FLAG3aa67c287 [2023-02-17 06:31:02,023 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfde8a7e1/6935ad724d204ce694e2fe11b193f172 [2023-02-17 06:31:02,025 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 06:31:02,026 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 06:31:02,027 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 06:31:02,027 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 06:31:02,030 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 06:31:02,030 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 06:31:02" (1/1) ... [2023-02-17 06:31:02,031 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a10ed3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:31:02, skipping insertion in model container [2023-02-17 06:31:02,031 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 06:31:02" (1/1) ... [2023-02-17 06:31:02,036 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 06:31:02,076 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 06:31:02,179 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[919,932] [2023-02-17 06:31:02,184 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[1134,1147] [2023-02-17 06:31:02,190 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[2208,2221] [2023-02-17 06:31:02,191 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[2423,2436] [2023-02-17 06:31:02,192 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[2918,2931] [2023-02-17 06:31:02,193 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3133,3146] [2023-02-17 06:31:02,196 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3435,3448] [2023-02-17 06:31:02,197 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3653,3666] [2023-02-17 06:31:02,199 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3929,3942] [2023-02-17 06:31:02,200 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[4147,4160] [2023-02-17 06:31:02,203 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[4717,4730] [2023-02-17 06:31:02,204 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[4935,4948] [2023-02-17 06:31:02,234 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[15828,15841] [2023-02-17 06:31:02,235 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[16046,16059] [2023-02-17 06:31:02,237 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[16441,16454] [2023-02-17 06:31:02,238 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[16659,16672] [2023-02-17 06:31:02,241 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 06:31:02,247 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 06:31:02,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+lhb-reducer.c[919,932] [2023-02-17 06:31:02,256 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[1134,1147] [2023-02-17 06:31:02,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+lhb-reducer.c[2208,2221] [2023-02-17 06:31:02,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+lhb-reducer.c[2423,2436] [2023-02-17 06:31:02,259 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[2918,2931] [2023-02-17 06:31:02,260 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3133,3146] [2023-02-17 06:31:02,261 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3435,3448] [2023-02-17 06:31:02,263 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3653,3666] [2023-02-17 06:31:02,263 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3929,3942] [2023-02-17 06:31:02,264 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[4147,4160] [2023-02-17 06:31:02,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+lhb-reducer.c[4717,4730] [2023-02-17 06:31:02,266 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[4935,4948] [2023-02-17 06:31:02,284 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[15828,15841] [2023-02-17 06:31:02,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+lhb-reducer.c[16046,16059] [2023-02-17 06:31:02,291 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[16441,16454] [2023-02-17 06:31:02,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+lhb-reducer.c[16659,16672] [2023-02-17 06:31:02,294 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 06:31:02,303 INFO L208 MainTranslator]: Completed translation [2023-02-17 06:31:02,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:31:02 WrapperNode [2023-02-17 06:31:02,303 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 06:31:02,304 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 06:31:02,304 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 06:31:02,304 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 06:31:02,348 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:31:02" (1/1) ... [2023-02-17 06:31:02,356 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:31:02" (1/1) ... [2023-02-17 06:31:02,386 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 590 [2023-02-17 06:31:02,386 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 06:31:02,387 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 06:31:02,387 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 06:31:02,387 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 06:31:02,396 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:31:02" (1/1) ... [2023-02-17 06:31:02,396 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:31:02" (1/1) ... [2023-02-17 06:31:02,413 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:31:02" (1/1) ... [2023-02-17 06:31:02,413 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:31:02" (1/1) ... [2023-02-17 06:31:02,419 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:31:02" (1/1) ... [2023-02-17 06:31:02,421 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:31:02" (1/1) ... [2023-02-17 06:31:02,434 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:31:02" (1/1) ... [2023-02-17 06:31:02,435 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:31:02" (1/1) ... [2023-02-17 06:31:02,437 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 06:31:02,438 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 06:31:02,438 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 06:31:02,438 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 06:31:02,439 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:31:02" (1/1) ... [2023-02-17 06:31:02,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 06:31:02,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 06:31:02,465 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-17 06:31:02,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-17 06:31:02,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 06:31:02,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-17 06:31:02,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 06:31:02,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 06:31:02,607 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 06:31:02,608 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 06:31:02,962 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 06:31:02,968 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 06:31:02,969 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2023-02-17 06:31:02,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 06:31:02 BoogieIcfgContainer [2023-02-17 06:31:02,970 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 06:31:02,972 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 06:31:02,972 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 06:31:02,974 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 06:31:02,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 06:31:02" (1/3) ... [2023-02-17 06:31:02,975 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1047d6ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 06:31:02, skipping insertion in model container [2023-02-17 06:31:02,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:31:02" (2/3) ... [2023-02-17 06:31:02,975 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1047d6ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 06:31:02, skipping insertion in model container [2023-02-17 06:31:02,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 06:31:02" (3/3) ... [2023-02-17 06:31:02,977 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.p+lhb-reducer.c [2023-02-17 06:31:02,989 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 06:31:02,989 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2023-02-17 06:31:03,031 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 06:31:03,036 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;@1dbf503d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 06:31:03,036 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-02-17 06:31:03,039 INFO L276 IsEmpty]: Start isEmpty. Operand has 120 states, 103 states have (on average 1.912621359223301) internal successors, (197), 119 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 06:31:03,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-17 06:31:03,043 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 06:31:03,043 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-17 06:31:03,043 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-17 06:31:03,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 06:31:03,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1804934597, now seen corresponding path program 1 times [2023-02-17 06:31:03,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 06:31:03,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421203103] [2023-02-17 06:31:03,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:31:03,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 06:31:03,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 06:31:03,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 06:31:03,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 06:31:03,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421203103] [2023-02-17 06:31:03,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421203103] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 06:31:03,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 06:31:03,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 06:31:03,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598351962] [2023-02-17 06:31:03,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 06:31:03,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 06:31:03,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 06:31:03,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 06:31:03,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 06:31:03,285 INFO L87 Difference]: Start difference. First operand has 120 states, 103 states have (on average 1.912621359223301) internal successors, (197), 119 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 06:31:03,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 06:31:03,529 INFO L93 Difference]: Finished difference Result 131 states and 205 transitions. [2023-02-17 06:31:03,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 06:31:03,531 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-17 06:31:03,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 06:31:03,542 INFO L225 Difference]: With dead ends: 131 [2023-02-17 06:31:03,542 INFO L226 Difference]: Without dead ends: 114 [2023-02-17 06:31:03,544 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-17 06:31:03,548 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 160 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 06:31:03,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 175 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 06:31:03,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-02-17 06:31:03,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2023-02-17 06:31:03,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 99 states have (on average 1.3636363636363635) internal successors, (135), 113 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 06:31:03,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 135 transitions. [2023-02-17 06:31:03,575 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 135 transitions. Word has length 7 [2023-02-17 06:31:03,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 06:31:03,575 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 135 transitions. [2023-02-17 06:31:03,576 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-17 06:31:03,576 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 135 transitions. [2023-02-17 06:31:03,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-17 06:31:03,576 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 06:31:03,576 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 06:31:03,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-17 06:31:03,577 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-17 06:31:03,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 06:31:03,577 INFO L85 PathProgramCache]: Analyzing trace with hash 118401710, now seen corresponding path program 1 times [2023-02-17 06:31:03,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 06:31:03,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305994796] [2023-02-17 06:31:03,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:31:03,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 06:31:03,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 06:31:03,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 06:31:03,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 06:31:03,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305994796] [2023-02-17 06:31:03,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305994796] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 06:31:03,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 06:31:03,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 06:31:03,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083763853] [2023-02-17 06:31:03,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 06:31:03,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 06:31:03,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 06:31:03,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 06:31:03,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-17 06:31:03,638 INFO L87 Difference]: Start difference. First operand 114 states and 135 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 06:31:03,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 06:31:03,745 INFO L93 Difference]: Finished difference Result 114 states and 135 transitions. [2023-02-17 06:31:03,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 06:31:03,745 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-17 06:31:03,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 06:31:03,746 INFO L225 Difference]: With dead ends: 114 [2023-02-17 06:31:03,746 INFO L226 Difference]: Without dead ends: 109 [2023-02-17 06:31:03,747 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-17 06:31:03,748 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 32 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 06:31:03,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 268 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 06:31:03,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-02-17 06:31:03,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2023-02-17 06:31:03,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 95 states have (on average 1.2736842105263158) internal successors, (121), 108 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 06:31:03,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 121 transitions. [2023-02-17 06:31:03,754 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 121 transitions. Word has length 8 [2023-02-17 06:31:03,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 06:31:03,754 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 121 transitions. [2023-02-17 06:31:03,754 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-17 06:31:03,754 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 121 transitions. [2023-02-17 06:31:03,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-17 06:31:03,755 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 06:31:03,755 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 06:31:03,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-17 06:31:03,755 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-17 06:31:03,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 06:31:03,756 INFO L85 PathProgramCache]: Analyzing trace with hash -639549266, now seen corresponding path program 1 times [2023-02-17 06:31:03,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 06:31:03,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830540007] [2023-02-17 06:31:03,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:31:03,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 06:31:03,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 06:31:03,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 06:31:03,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 06:31:03,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830540007] [2023-02-17 06:31:03,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830540007] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 06:31:03,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 06:31:03,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 06:31:03,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146021523] [2023-02-17 06:31:03,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 06:31:03,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 06:31:03,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 06:31:03,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 06:31:03,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 06:31:03,806 INFO L87 Difference]: Start difference. First operand 109 states and 121 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 06:31:03,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 06:31:03,951 INFO L93 Difference]: Finished difference Result 109 states and 121 transitions. [2023-02-17 06:31:03,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 06:31:03,952 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-02-17 06:31:03,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 06:31:03,952 INFO L225 Difference]: With dead ends: 109 [2023-02-17 06:31:03,952 INFO L226 Difference]: Without dead ends: 107 [2023-02-17 06:31:03,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-17 06:31:03,954 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 93 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 06:31:03,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 101 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 06:31:03,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-02-17 06:31:03,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2023-02-17 06:31:03,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 94 states have (on average 1.2659574468085106) internal successors, (119), 106 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 06:31:03,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 119 transitions. [2023-02-17 06:31:03,959 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 119 transitions. Word has length 11 [2023-02-17 06:31:03,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 06:31:03,959 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 119 transitions. [2023-02-17 06:31:03,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 06:31:03,960 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 119 transitions. [2023-02-17 06:31:03,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-17 06:31:03,960 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 06:31:03,960 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 06:31:03,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-17 06:31:03,961 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-17 06:31:03,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 06:31:03,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1648813321, now seen corresponding path program 1 times [2023-02-17 06:31:03,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 06:31:03,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286203363] [2023-02-17 06:31:03,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:31:03,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 06:31:03,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 06:31:04,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 06:31:04,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 06:31:04,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286203363] [2023-02-17 06:31:04,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286203363] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 06:31:04,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 06:31:04,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 06:31:04,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806997640] [2023-02-17 06:31:04,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 06:31:04,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 06:31:04,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 06:31:04,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 06:31:04,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 06:31:04,023 INFO L87 Difference]: Start difference. First operand 107 states and 119 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 06:31:04,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 06:31:04,102 INFO L93 Difference]: Finished difference Result 107 states and 119 transitions. [2023-02-17 06:31:04,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 06:31:04,102 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-02-17 06:31:04,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 06:31:04,103 INFO L225 Difference]: With dead ends: 107 [2023-02-17 06:31:04,103 INFO L226 Difference]: Without dead ends: 103 [2023-02-17 06:31:04,103 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-17 06:31:04,104 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 11 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 06:31:04,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 242 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 06:31:04,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-02-17 06:31:04,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2023-02-17 06:31:04,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 91 states have (on average 1.2637362637362637) internal successors, (115), 102 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 06:31:04,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 115 transitions. [2023-02-17 06:31:04,109 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 115 transitions. Word has length 12 [2023-02-17 06:31:04,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 06:31:04,109 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 115 transitions. [2023-02-17 06:31:04,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 06:31:04,109 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2023-02-17 06:31:04,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-17 06:31:04,110 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 06:31:04,110 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 06:31:04,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-17 06:31:04,110 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-17 06:31:04,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 06:31:04,111 INFO L85 PathProgramCache]: Analyzing trace with hash -411248735, now seen corresponding path program 1 times [2023-02-17 06:31:04,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 06:31:04,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566599230] [2023-02-17 06:31:04,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:31:04,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 06:31:04,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 06:31:04,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 06:31:04,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 06:31:04,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566599230] [2023-02-17 06:31:04,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566599230] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 06:31:04,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 06:31:04,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 06:31:04,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266487797] [2023-02-17 06:31:04,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 06:31:04,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 06:31:04,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 06:31:04,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 06:31:04,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 06:31:04,163 INFO L87 Difference]: Start difference. First operand 103 states and 115 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 06:31:04,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 06:31:04,296 INFO L93 Difference]: Finished difference Result 121 states and 135 transitions. [2023-02-17 06:31:04,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 06:31:04,297 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-02-17 06:31:04,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 06:31:04,297 INFO L225 Difference]: With dead ends: 121 [2023-02-17 06:31:04,297 INFO L226 Difference]: Without dead ends: 119 [2023-02-17 06:31:04,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-17 06:31:04,298 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 112 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 06:31:04,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 111 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 06:31:04,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-02-17 06:31:04,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 101. [2023-02-17 06:31:04,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 90 states have (on average 1.2555555555555555) internal successors, (113), 100 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 06:31:04,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 113 transitions. [2023-02-17 06:31:04,303 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 113 transitions. Word has length 13 [2023-02-17 06:31:04,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 06:31:04,303 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 113 transitions. [2023-02-17 06:31:04,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 06:31:04,304 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 113 transitions. [2023-02-17 06:31:04,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-17 06:31:04,304 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 06:31:04,304 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 06:31:04,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-17 06:31:04,304 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-02-17 06:31:04,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 06:31:04,305 INFO L85 PathProgramCache]: Analyzing trace with hash -409524831, now seen corresponding path program 1 times [2023-02-17 06:31:04,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 06:31:04,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725228880] [2023-02-17 06:31:04,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:31:04,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 06:31:04,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 06:31:04,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 06:31:04,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 06:31:04,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725228880] [2023-02-17 06:31:04,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725228880] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 06:31:04,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 06:31:04,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 06:31:04,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740906679] [2023-02-17 06:31:04,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 06:31:04,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 06:31:04,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 06:31:04,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 06:31:04,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 06:31:04,338 INFO L87 Difference]: Start difference. First operand 101 states and 113 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 06:31:04,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 06:31:04,452 INFO L93 Difference]: Finished difference Result 101 states and 113 transitions. [2023-02-17 06:31:04,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 06:31:04,452 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-02-17 06:31:04,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 06:31:04,453 INFO L225 Difference]: With dead ends: 101 [2023-02-17 06:31:04,453 INFO L226 Difference]: Without dead ends: 99 [2023-02-17 06:31:04,453 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-17 06:31:04,454 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 83 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 06:31:04,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 83 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 06:31:04,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-02-17 06:31:04,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2023-02-17 06:31:04,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 89 states have (on average 1.247191011235955) internal successors, (111), 98 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 06:31:04,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2023-02-17 06:31:04,457 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 13 [2023-02-17 06:31:04,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 06:31:04,458 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2023-02-17 06:31:04,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 06:31:04,458 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2023-02-17 06:31:04,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-17 06:31:04,458 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 06:31:04,458 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 06:31:04,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-17 06:31:04,459 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-02-17 06:31:04,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 06:31:04,459 INFO L85 PathProgramCache]: Analyzing trace with hash 136195212, now seen corresponding path program 1 times [2023-02-17 06:31:04,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 06:31:04,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937417240] [2023-02-17 06:31:04,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:31:04,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 06:31:04,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 06:31:04,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 06:31:04,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 06:31:04,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937417240] [2023-02-17 06:31:04,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937417240] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 06:31:04,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 06:31:04,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-17 06:31:04,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186025385] [2023-02-17 06:31:04,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 06:31:04,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 06:31:04,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 06:31:04,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 06:31:04,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-17 06:31:04,517 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 06:31:04,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 06:31:04,687 INFO L93 Difference]: Finished difference Result 136 states and 152 transitions. [2023-02-17 06:31:04,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 06:31:04,687 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-02-17 06:31:04,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 06:31:04,688 INFO L225 Difference]: With dead ends: 136 [2023-02-17 06:31:04,688 INFO L226 Difference]: Without dead ends: 134 [2023-02-17 06:31:04,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-17 06:31:04,688 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 47 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 06:31:04,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 296 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 06:31:04,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-02-17 06:31:04,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 105. [2023-02-17 06:31:04,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 95 states have (on average 1.2526315789473683) internal successors, (119), 104 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 06:31:04,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2023-02-17 06:31:04,692 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 14 [2023-02-17 06:31:04,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 06:31:04,692 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2023-02-17 06:31:04,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 06:31:04,693 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2023-02-17 06:31:04,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-17 06:31:04,693 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 06:31:04,693 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 06:31:04,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-17 06:31:04,693 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-02-17 06:31:04,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 06:31:04,694 INFO L85 PathProgramCache]: Analyzing trace with hash 137742357, now seen corresponding path program 1 times [2023-02-17 06:31:04,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 06:31:04,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217437200] [2023-02-17 06:31:04,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:31:04,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 06:31:04,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 06:31:04,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 06:31:04,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 06:31:04,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217437200] [2023-02-17 06:31:04,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217437200] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 06:31:04,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 06:31:04,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 06:31:04,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584254795] [2023-02-17 06:31:04,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 06:31:04,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 06:31:04,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 06:31:04,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 06:31:04,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 06:31:04,724 INFO L87 Difference]: Start difference. First operand 105 states and 119 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 06:31:04,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 06:31:04,865 INFO L93 Difference]: Finished difference Result 126 states and 142 transitions. [2023-02-17 06:31:04,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 06:31:04,866 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-02-17 06:31:04,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 06:31:04,866 INFO L225 Difference]: With dead ends: 126 [2023-02-17 06:31:04,866 INFO L226 Difference]: Without dead ends: 124 [2023-02-17 06:31:04,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-17 06:31:04,867 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 103 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 06:31:04,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 103 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 06:31:04,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-02-17 06:31:04,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 103. [2023-02-17 06:31:04,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 94 states have (on average 1.2446808510638299) internal successors, (117), 102 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 06:31:04,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 117 transitions. [2023-02-17 06:31:04,870 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 117 transitions. Word has length 14 [2023-02-17 06:31:04,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 06:31:04,871 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 117 transitions. [2023-02-17 06:31:04,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 06:31:04,871 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 117 transitions. [2023-02-17 06:31:04,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-17 06:31:04,871 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 06:31:04,871 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 06:31:04,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-17 06:31:04,872 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-02-17 06:31:04,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 06:31:04,872 INFO L85 PathProgramCache]: Analyzing trace with hash 189636292, now seen corresponding path program 1 times [2023-02-17 06:31:04,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 06:31:04,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348233938] [2023-02-17 06:31:04,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:31:04,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 06:31:04,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 06:31:04,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 06:31:04,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 06:31:04,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348233938] [2023-02-17 06:31:04,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348233938] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 06:31:04,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 06:31:04,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-17 06:31:04,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503759561] [2023-02-17 06:31:04,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 06:31:04,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 06:31:04,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 06:31:04,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 06:31:04,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-17 06:31:04,920 INFO L87 Difference]: Start difference. First operand 103 states and 117 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 06:31:05,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 06:31:05,074 INFO L93 Difference]: Finished difference Result 113 states and 127 transitions. [2023-02-17 06:31:05,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 06:31:05,074 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-02-17 06:31:05,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 06:31:05,075 INFO L225 Difference]: With dead ends: 113 [2023-02-17 06:31:05,075 INFO L226 Difference]: Without dead ends: 109 [2023-02-17 06:31:05,075 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-17 06:31:05,075 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 17 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 06:31:05,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 245 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 06:31:05,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-02-17 06:31:05,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 104. [2023-02-17 06:31:05,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 95 states have (on average 1.2421052631578948) internal successors, (118), 103 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 06:31:05,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 118 transitions. [2023-02-17 06:31:05,078 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 118 transitions. Word has length 14 [2023-02-17 06:31:05,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 06:31:05,078 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 118 transitions. [2023-02-17 06:31:05,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 06:31:05,079 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 118 transitions. [2023-02-17 06:31:05,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-17 06:31:05,079 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 06:31:05,079 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 06:31:05,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-17 06:31:05,080 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-02-17 06:31:05,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 06:31:05,080 INFO L85 PathProgramCache]: Analyzing trace with hash -24950085, now seen corresponding path program 1 times [2023-02-17 06:31:05,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 06:31:05,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711663747] [2023-02-17 06:31:05,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:31:05,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 06:31:05,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 06:31:05,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 06:31:05,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 06:31:05,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711663747] [2023-02-17 06:31:05,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711663747] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 06:31:05,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 06:31:05,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-17 06:31:05,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404027919] [2023-02-17 06:31:05,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 06:31:05,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 06:31:05,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 06:31:05,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 06:31:05,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-17 06:31:05,125 INFO L87 Difference]: Start difference. First operand 104 states and 118 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 06:31:05,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 06:31:05,258 INFO L93 Difference]: Finished difference Result 131 states and 147 transitions. [2023-02-17 06:31:05,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 06:31:05,258 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-02-17 06:31:05,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 06:31:05,259 INFO L225 Difference]: With dead ends: 131 [2023-02-17 06:31:05,259 INFO L226 Difference]: Without dead ends: 129 [2023-02-17 06:31:05,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-17 06:31:05,259 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 38 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 06:31:05,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 274 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 06:31:05,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-02-17 06:31:05,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 107. [2023-02-17 06:31:05,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 98 states have (on average 1.2346938775510203) internal successors, (121), 106 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 06:31:05,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 121 transitions. [2023-02-17 06:31:05,262 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 121 transitions. Word has length 15 [2023-02-17 06:31:05,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 06:31:05,262 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 121 transitions. [2023-02-17 06:31:05,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 06:31:05,262 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 121 transitions. [2023-02-17 06:31:05,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-17 06:31:05,263 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 06:31:05,263 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 06:31:05,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-17 06:31:05,263 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-02-17 06:31:05,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 06:31:05,263 INFO L85 PathProgramCache]: Analyzing trace with hash 2034707599, now seen corresponding path program 1 times [2023-02-17 06:31:05,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 06:31:05,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581009976] [2023-02-17 06:31:05,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:31:05,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 06:31:05,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 06:31:05,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 06:31:05,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 06:31:05,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581009976] [2023-02-17 06:31:05,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581009976] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 06:31:05,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 06:31:05,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 06:31:05,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750688893] [2023-02-17 06:31:05,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 06:31:05,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 06:31:05,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 06:31:05,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 06:31:05,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 06:31:05,295 INFO L87 Difference]: Start difference. First operand 107 states and 121 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 06:31:05,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 06:31:05,331 INFO L93 Difference]: Finished difference Result 107 states and 121 transitions. [2023-02-17 06:31:05,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 06:31:05,332 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-02-17 06:31:05,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 06:31:05,332 INFO L225 Difference]: With dead ends: 107 [2023-02-17 06:31:05,332 INFO L226 Difference]: Without dead ends: 105 [2023-02-17 06:31:05,333 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-17 06:31:05,333 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 97 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 06:31:05,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 138 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 06:31:05,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-02-17 06:31:05,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2023-02-17 06:31:05,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 97 states have (on average 1.2268041237113403) internal successors, (119), 104 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 06:31:05,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2023-02-17 06:31:05,336 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 16 [2023-02-17 06:31:05,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 06:31:05,336 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2023-02-17 06:31:05,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 06:31:05,337 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2023-02-17 06:31:05,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-17 06:31:05,337 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 06:31:05,337 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 06:31:05,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-17 06:31:05,337 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-02-17 06:31:05,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 06:31:05,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1348569745, now seen corresponding path program 1 times [2023-02-17 06:31:05,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 06:31:05,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588045746] [2023-02-17 06:31:05,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:31:05,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 06:31:05,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 06:31:05,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 06:31:05,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 06:31:05,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588045746] [2023-02-17 06:31:05,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588045746] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 06:31:05,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 06:31:05,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 06:31:05,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870273540] [2023-02-17 06:31:05,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 06:31:05,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 06:31:05,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 06:31:05,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 06:31:05,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 06:31:05,376 INFO L87 Difference]: Start difference. First operand 105 states and 119 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 06:31:05,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 06:31:05,443 INFO L93 Difference]: Finished difference Result 105 states and 119 transitions. [2023-02-17 06:31:05,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 06:31:05,444 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-02-17 06:31:05,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 06:31:05,444 INFO L225 Difference]: With dead ends: 105 [2023-02-17 06:31:05,444 INFO L226 Difference]: Without dead ends: 101 [2023-02-17 06:31:05,444 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-17 06:31:05,445 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 6 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 06:31:05,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 214 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 06:31:05,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-02-17 06:31:05,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2023-02-17 06:31:05,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 94 states have (on average 1.2234042553191489) internal successors, (115), 100 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 06:31:05,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 115 transitions. [2023-02-17 06:31:05,448 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 115 transitions. Word has length 17 [2023-02-17 06:31:05,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 06:31:05,448 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 115 transitions. [2023-02-17 06:31:05,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 06:31:05,448 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 115 transitions. [2023-02-17 06:31:05,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-17 06:31:05,449 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 06:31:05,449 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 06:31:05,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-17 06:31:05,449 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-02-17 06:31:05,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 06:31:05,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1418456853, now seen corresponding path program 1 times [2023-02-17 06:31:05,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 06:31:05,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463886201] [2023-02-17 06:31:05,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:31:05,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 06:31:05,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 06:31:05,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 06:31:05,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 06:31:05,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463886201] [2023-02-17 06:31:05,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463886201] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 06:31:05,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 06:31:05,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-17 06:31:05,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659464734] [2023-02-17 06:31:05,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 06:31:05,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 06:31:05,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 06:31:05,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 06:31:05,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-17 06:31:05,492 INFO L87 Difference]: Start difference. First operand 101 states and 115 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 06:31:05,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 06:31:05,618 INFO L93 Difference]: Finished difference Result 116 states and 132 transitions. [2023-02-17 06:31:05,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 06:31:05,618 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-02-17 06:31:05,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 06:31:05,619 INFO L225 Difference]: With dead ends: 116 [2023-02-17 06:31:05,619 INFO L226 Difference]: Without dead ends: 114 [2023-02-17 06:31:05,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-02-17 06:31:05,619 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 155 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 06:31:05,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 57 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 06:31:05,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-02-17 06:31:05,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 97. [2023-02-17 06:31:05,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 91 states have (on average 1.2197802197802199) internal successors, (111), 96 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 06:31:05,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 111 transitions. [2023-02-17 06:31:05,622 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 111 transitions. Word has length 18 [2023-02-17 06:31:05,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 06:31:05,623 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 111 transitions. [2023-02-17 06:31:05,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 06:31:05,623 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 111 transitions. [2023-02-17 06:31:05,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-17 06:31:05,623 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 06:31:05,623 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 06:31:05,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-17 06:31:05,624 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-02-17 06:31:05,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 06:31:05,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1471897933, now seen corresponding path program 1 times [2023-02-17 06:31:05,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 06:31:05,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089176059] [2023-02-17 06:31:05,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:31:05,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 06:31:05,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 06:31:05,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 06:31:05,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 06:31:05,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089176059] [2023-02-17 06:31:05,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089176059] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 06:31:05,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 06:31:05,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-17 06:31:05,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697806084] [2023-02-17 06:31:05,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 06:31:05,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 06:31:05,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 06:31:05,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 06:31:05,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-17 06:31:05,678 INFO L87 Difference]: Start difference. First operand 97 states and 111 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 06:31:05,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 06:31:05,797 INFO L93 Difference]: Finished difference Result 97 states and 111 transitions. [2023-02-17 06:31:05,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 06:31:05,797 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-02-17 06:31:05,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 06:31:05,799 INFO L225 Difference]: With dead ends: 97 [2023-02-17 06:31:05,799 INFO L226 Difference]: Without dead ends: 93 [2023-02-17 06:31:05,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-02-17 06:31:05,801 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 129 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 06:31:05,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 44 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 06:31:05,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-02-17 06:31:05,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2023-02-17 06:31:05,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 88 states have (on average 1.2159090909090908) internal successors, (107), 92 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 06:31:05,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 107 transitions. [2023-02-17 06:31:05,808 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 107 transitions. Word has length 18 [2023-02-17 06:31:05,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 06:31:05,808 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 107 transitions. [2023-02-17 06:31:05,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 06:31:05,808 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 107 transitions. [2023-02-17 06:31:05,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-17 06:31:05,808 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 06:31:05,809 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 06:31:05,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-17 06:31:05,809 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-02-17 06:31:05,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 06:31:05,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1159129958, now seen corresponding path program 1 times [2023-02-17 06:31:05,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 06:31:05,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632792161] [2023-02-17 06:31:05,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:31:05,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 06:31:05,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 06:31:05,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 06:31:05,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 06:31:05,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632792161] [2023-02-17 06:31:05,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632792161] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 06:31:05,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 06:31:05,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-17 06:31:05,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970409890] [2023-02-17 06:31:05,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 06:31:05,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 06:31:05,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 06:31:05,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 06:31:05,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-17 06:31:05,852 INFO L87 Difference]: Start difference. First operand 93 states and 107 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 06:31:05,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 06:31:05,979 INFO L93 Difference]: Finished difference Result 103 states and 119 transitions. [2023-02-17 06:31:05,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 06:31:05,979 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-02-17 06:31:05,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 06:31:05,980 INFO L225 Difference]: With dead ends: 103 [2023-02-17 06:31:05,980 INFO L226 Difference]: Without dead ends: 54 [2023-02-17 06:31:05,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-02-17 06:31:05,981 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 135 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 06:31:05,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 47 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 06:31:05,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-02-17 06:31:05,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2023-02-17 06:31:05,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 50 states have (on average 1.08) internal successors, (54), 53 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 06:31:05,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2023-02-17 06:31:05,982 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 18 [2023-02-17 06:31:05,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 06:31:05,983 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2023-02-17 06:31:05,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 06:31:05,983 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2023-02-17 06:31:05,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-17 06:31:05,983 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 06:31:05,983 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 06:31:05,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-02-17 06:31:05,984 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-02-17 06:31:05,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 06:31:05,984 INFO L85 PathProgramCache]: Analyzing trace with hash 892497877, now seen corresponding path program 1 times [2023-02-17 06:31:05,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 06:31:05,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110682083] [2023-02-17 06:31:05,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:31:05,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 06:31:05,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 06:31:06,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 06:31:06,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 06:31:06,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110682083] [2023-02-17 06:31:06,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110682083] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 06:31:06,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 06:31:06,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-02-17 06:31:06,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614483127] [2023-02-17 06:31:06,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 06:31:06,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-17 06:31:06,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 06:31:06,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-17 06:31:06,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2023-02-17 06:31:06,101 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 06:31:06,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 06:31:06,190 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2023-02-17 06:31:06,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-17 06:31:06,191 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2023-02-17 06:31:06,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 06:31:06,191 INFO L225 Difference]: With dead ends: 54 [2023-02-17 06:31:06,191 INFO L226 Difference]: Without dead ends: 52 [2023-02-17 06:31:06,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2023-02-17 06:31:06,192 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 23 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 06:31:06,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 29 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 06:31:06,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-02-17 06:31:06,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2023-02-17 06:31:06,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 51 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 06:31:06,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2023-02-17 06:31:06,194 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 44 [2023-02-17 06:31:06,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 06:31:06,194 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2023-02-17 06:31:06,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 06:31:06,194 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2023-02-17 06:31:06,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-17 06:31:06,195 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 06:31:06,195 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 06:31:06,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-02-17 06:31:06,195 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-02-17 06:31:06,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 06:31:06,195 INFO L85 PathProgramCache]: Analyzing trace with hash 892513765, now seen corresponding path program 1 times [2023-02-17 06:31:06,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 06:31:06,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652040998] [2023-02-17 06:31:06,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:31:06,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 06:31:06,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 06:31:06,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 06:31:06,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 06:31:06,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652040998] [2023-02-17 06:31:06,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652040998] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 06:31:06,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 06:31:06,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-02-17 06:31:06,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842214608] [2023-02-17 06:31:06,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 06:31:06,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-17 06:31:06,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 06:31:06,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-17 06:31:06,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2023-02-17 06:31:06,311 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 06:31:06,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 06:31:06,391 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2023-02-17 06:31:06,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-17 06:31:06,391 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2023-02-17 06:31:06,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 06:31:06,391 INFO L225 Difference]: With dead ends: 59 [2023-02-17 06:31:06,392 INFO L226 Difference]: Without dead ends: 57 [2023-02-17 06:31:06,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2023-02-17 06:31:06,392 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 42 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 06:31:06,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 27 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 06:31:06,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-02-17 06:31:06,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 50. [2023-02-17 06:31:06,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 49 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 06:31:06,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2023-02-17 06:31:06,394 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 44 [2023-02-17 06:31:06,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 06:31:06,394 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2023-02-17 06:31:06,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 06:31:06,394 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2023-02-17 06:31:06,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-17 06:31:06,395 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 06:31:06,395 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 06:31:06,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-02-17 06:31:06,395 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-02-17 06:31:06,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 06:31:06,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1897634854, now seen corresponding path program 1 times [2023-02-17 06:31:06,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 06:31:06,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127278351] [2023-02-17 06:31:06,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:31:06,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 06:31:06,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 06:31:06,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 06:31:06,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 06:31:06,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127278351] [2023-02-17 06:31:06,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127278351] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 06:31:06,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 06:31:06,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-17 06:31:06,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274737271] [2023-02-17 06:31:06,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 06:31:06,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-17 06:31:06,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 06:31:06,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-17 06:31:06,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-17 06:31:06,592 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 06:31:06,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 06:31:06,647 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2023-02-17 06:31:06,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 06:31:06,647 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2023-02-17 06:31:06,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 06:31:06,648 INFO L225 Difference]: With dead ends: 50 [2023-02-17 06:31:06,648 INFO L226 Difference]: Without dead ends: 46 [2023-02-17 06:31:06,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-02-17 06:31:06,648 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 38 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 06:31:06,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 14 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 06:31:06,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-02-17 06:31:06,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2023-02-17 06:31:06,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 45 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 06:31:06,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2023-02-17 06:31:06,650 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 45 [2023-02-17 06:31:06,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 06:31:06,650 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2023-02-17 06:31:06,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 06:31:06,650 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2023-02-17 06:31:06,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-17 06:31:06,650 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 06:31:06,651 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 06:31:06,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-02-17 06:31:06,651 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-02-17 06:31:06,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 06:31:06,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1898127398, now seen corresponding path program 1 times [2023-02-17 06:31:06,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 06:31:06,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275191938] [2023-02-17 06:31:06,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:31:06,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 06:31:06,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 06:31:06,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 06:31:06,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 06:31:06,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275191938] [2023-02-17 06:31:06,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275191938] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 06:31:06,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 06:31:06,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-17 06:31:06,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787878906] [2023-02-17 06:31:06,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 06:31:06,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-17 06:31:06,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 06:31:06,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-17 06:31:06,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-17 06:31:06,834 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 06:31:06,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 06:31:06,894 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2023-02-17 06:31:06,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 06:31:06,895 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2023-02-17 06:31:06,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 06:31:06,895 INFO L225 Difference]: With dead ends: 50 [2023-02-17 06:31:06,895 INFO L226 Difference]: Without dead ends: 0 [2023-02-17 06:31:06,896 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-02-17 06:31:06,897 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 10 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 06:31:06,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 15 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 06:31:06,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-17 06:31:06,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-17 06:31:06,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 06:31:06,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-17 06:31:06,898 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2023-02-17 06:31:06,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 06:31:06,898 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-17 06:31:06,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 06:31:06,898 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-17 06:31:06,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-17 06:31:06,900 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (15 of 16 remaining) [2023-02-17 06:31:06,900 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (14 of 16 remaining) [2023-02-17 06:31:06,900 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (13 of 16 remaining) [2023-02-17 06:31:06,901 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (12 of 16 remaining) [2023-02-17 06:31:06,901 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (11 of 16 remaining) [2023-02-17 06:31:06,901 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (10 of 16 remaining) [2023-02-17 06:31:06,901 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (9 of 16 remaining) [2023-02-17 06:31:06,901 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (8 of 16 remaining) [2023-02-17 06:31:06,901 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (7 of 16 remaining) [2023-02-17 06:31:06,901 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (6 of 16 remaining) [2023-02-17 06:31:06,901 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (5 of 16 remaining) [2023-02-17 06:31:06,902 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (4 of 16 remaining) [2023-02-17 06:31:06,902 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (3 of 16 remaining) [2023-02-17 06:31:06,902 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (2 of 16 remaining) [2023-02-17 06:31:06,902 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION (1 of 16 remaining) [2023-02-17 06:31:06,903 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION (0 of 16 remaining) [2023-02-17 06:31:06,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-02-17 06:31:06,904 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-17 06:31:06,909 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 48) no Hoare annotation was computed. [2023-02-17 06:31:06,909 INFO L899 garLoopResultBuilder]: For program point L217(lines 217 229) no Hoare annotation was computed. [2023-02-17 06:31:06,910 INFO L899 garLoopResultBuilder]: For program point L597(lines 597 969) no Hoare annotation was computed. [2023-02-17 06:31:06,910 INFO L899 garLoopResultBuilder]: For program point L366(lines 366 991) no Hoare annotation was computed. [2023-02-17 06:31:06,910 INFO L899 garLoopResultBuilder]: For program point L267(lines 267 275) no Hoare annotation was computed. [2023-02-17 06:31:06,910 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 883) no Hoare annotation was computed. [2023-02-17 06:31:06,911 INFO L899 garLoopResultBuilder]: For program point L581(lines 581 971) no Hoare annotation was computed. [2023-02-17 06:31:06,911 INFO L899 garLoopResultBuilder]: For program point L36(line 36) no Hoare annotation was computed. [2023-02-17 06:31:06,911 INFO L899 garLoopResultBuilder]: For program point L895(line 895) no Hoare annotation was computed. [2023-02-17 06:31:06,911 INFO L899 garLoopResultBuilder]: For program point L317(lines 317 994) no Hoare annotation was computed. [2023-02-17 06:31:06,911 INFO L899 garLoopResultBuilder]: For program point L185(line 185) no Hoare annotation was computed. [2023-02-17 06:31:06,911 INFO L902 garLoopResultBuilder]: At program point L53(lines 22 1005) the Hoare annotation is: true [2023-02-17 06:31:06,911 INFO L899 garLoopResultBuilder]: For program point L400(lines 400 424) no Hoare annotation was computed. [2023-02-17 06:31:06,911 INFO L899 garLoopResultBuilder]: For program point L136(lines 136 242) no Hoare annotation was computed. [2023-02-17 06:31:06,912 INFO L899 garLoopResultBuilder]: For program point L103(lines 103 125) no Hoare annotation was computed. [2023-02-17 06:31:06,912 INFO L899 garLoopResultBuilder]: For program point L615(lines 615 626) no Hoare annotation was computed. [2023-02-17 06:31:06,912 INFO L899 garLoopResultBuilder]: For program point L929(lines 929 941) no Hoare annotation was computed. [2023-02-17 06:31:06,913 INFO L895 garLoopResultBuilder]: At program point L863(lines 858 947) the Hoare annotation is: (let ((.cse3 (<= |ULTIMATE.start_main_~main__t~0#1| |ULTIMATE.start_main_~main__tagbuf_len~0#1|)) (.cse8 (* (- 1) |ULTIMATE.start_main_~main__t~0#1|))) (let ((.cse0 (or (not (<= (+ |ULTIMATE.start_main_~main__tagbuf_len~0#1| .cse8 1) 0)) .cse3 (not (<= (+ |ULTIMATE.start_main_~main__tagbuf_len~0#1| .cse8) 0)))) (.cse1 (let ((.cse2 (<= 0 |ULTIMATE.start_main_~main__tagbuf_len~0#1|)) (.cse4 (let ((.cse7 (<= .cse8 0))) (or (and (not .cse7) (= |ULTIMATE.start_main_~main__t~0#1| 0)) .cse7))) (.cse5 (<= 0 (+ |ULTIMATE.start_main_~main__t~0#1| (- 1)))) (.cse6 (<= 0 (+ |ULTIMATE.start_main_~main__t~0#1| (- 9))))) (or (and .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse3 (not (= 0 |ULTIMATE.start_main_~__VERIFIER_assert__cond~50#1|)) .cse4 .cse5 .cse6))))) (or (and .cse0 .cse1 (not (= 0 |ULTIMATE.start_main_~__VERIFIER_assert__cond~51#1|))) (and .cse0 .cse1)))) [2023-02-17 06:31:06,913 INFO L899 garLoopResultBuilder]: For program point L219(line 219) no Hoare annotation was computed. [2023-02-17 06:31:06,913 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 269) no Hoare annotation was computed. [2023-02-17 06:31:06,913 INFO L899 garLoopResultBuilder]: For program point L665(lines 665 963) no Hoare annotation was computed. [2023-02-17 06:31:06,913 INFO L899 garLoopResultBuilder]: For program point L434(lines 434 985) no Hoare annotation was computed. [2023-02-17 06:31:06,915 INFO L899 garLoopResultBuilder]: For program point L269(line 269) no Hoare annotation was computed. [2023-02-17 06:31:06,915 INFO L899 garLoopResultBuilder]: For program point L649(lines 649 965) no Hoare annotation was computed. [2023-02-17 06:31:06,915 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 173) no Hoare annotation was computed. [2023-02-17 06:31:06,915 INFO L899 garLoopResultBuilder]: For program point L385(lines 385 988) no Hoare annotation was computed. [2023-02-17 06:31:06,915 INFO L899 garLoopResultBuilder]: For program point L22(lines 22 1005) no Hoare annotation was computed. [2023-02-17 06:31:06,916 INFO L899 garLoopResultBuilder]: For program point L468(lines 468 492) no Hoare annotation was computed. [2023-02-17 06:31:06,916 INFO L899 garLoopResultBuilder]: For program point L881(lines 881 907) no Hoare annotation was computed. [2023-02-17 06:31:06,916 INFO L899 garLoopResultBuilder]: For program point L171(lines 171 193) no Hoare annotation was computed. [2023-02-17 06:31:06,916 INFO L899 garLoopResultBuilder]: For program point L683(lines 683 694) no Hoare annotation was computed. [2023-02-17 06:31:06,916 INFO L899 garLoopResultBuilder]: For program point L105(line 105) no Hoare annotation was computed. [2023-02-17 06:31:06,916 INFO L899 garLoopResultBuilder]: For program point L72(lines 72 288) no Hoare annotation was computed. [2023-02-17 06:31:06,916 INFO L899 garLoopResultBuilder]: For program point L931(line 931) no Hoare annotation was computed. [2023-02-17 06:31:06,917 INFO L899 garLoopResultBuilder]: For program point L733(lines 733 957) no Hoare annotation was computed. [2023-02-17 06:31:06,917 INFO L899 garLoopResultBuilder]: For program point L155(lines 155 234) no Hoare annotation was computed. [2023-02-17 06:31:06,917 INFO L899 garLoopResultBuilder]: For program point L502(lines 502 979) no Hoare annotation was computed. [2023-02-17 06:31:06,917 INFO L899 garLoopResultBuilder]: For program point L205(lines 205 231) no Hoare annotation was computed. [2023-02-17 06:31:06,918 INFO L899 garLoopResultBuilder]: For program point L717(lines 717 959) no Hoare annotation was computed. [2023-02-17 06:31:06,918 INFO L899 garLoopResultBuilder]: For program point L453(lines 453 982) no Hoare annotation was computed. [2023-02-17 06:31:06,918 INFO L899 garLoopResultBuilder]: For program point L866(lines 866 946) no Hoare annotation was computed. [2023-02-17 06:31:06,918 INFO L899 garLoopResultBuilder]: For program point L255(lines 255 277) no Hoare annotation was computed. [2023-02-17 06:31:06,918 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 207) no Hoare annotation was computed. [2023-02-17 06:31:06,918 INFO L899 garLoopResultBuilder]: For program point L536(lines 536 560) no Hoare annotation was computed. [2023-02-17 06:31:06,918 INFO L899 garLoopResultBuilder]: For program point L883(line 883) no Hoare annotation was computed. [2023-02-17 06:31:06,918 INFO L899 garLoopResultBuilder]: For program point L751(lines 751 762) no Hoare annotation was computed. [2023-02-17 06:31:06,918 INFO L899 garLoopResultBuilder]: For program point L173(line 173) no Hoare annotation was computed. [2023-02-17 06:31:06,918 INFO L899 garLoopResultBuilder]: For program point L801(lines 801 951) no Hoare annotation was computed. [2023-02-17 06:31:06,919 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-17 06:31:06,919 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 185) no Hoare annotation was computed. [2023-02-17 06:31:06,919 INFO L899 garLoopResultBuilder]: For program point L157(line 157) no Hoare annotation was computed. [2023-02-17 06:31:06,919 INFO L899 garLoopResultBuilder]: For program point L570(lines 570 973) no Hoare annotation was computed. [2023-02-17 06:31:06,919 INFO L899 garLoopResultBuilder]: For program point L917(lines 917 943) no Hoare annotation was computed. [2023-02-17 06:31:06,919 INFO L899 garLoopResultBuilder]: For program point L785(lines 785 953) no Hoare annotation was computed. [2023-02-17 06:31:06,919 INFO L899 garLoopResultBuilder]: For program point L207(line 207) no Hoare annotation was computed. [2023-02-17 06:31:06,919 INFO L899 garLoopResultBuilder]: For program point L521(lines 521 976) no Hoare annotation was computed. [2023-02-17 06:31:06,919 INFO L899 garLoopResultBuilder]: For program point L257(line 257) no Hoare annotation was computed. [2023-02-17 06:31:06,919 INFO L899 garLoopResultBuilder]: For program point L604(lines 604 628) no Hoare annotation was computed. [2023-02-17 06:31:06,919 INFO L899 garLoopResultBuilder]: For program point L26(lines 26 1000) no Hoare annotation was computed. [2023-02-17 06:31:06,920 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 105) no Hoare annotation was computed. [2023-02-17 06:31:06,920 INFO L899 garLoopResultBuilder]: For program point L819(lines 819 830) no Hoare annotation was computed. [2023-02-17 06:31:06,920 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 895) no Hoare annotation was computed. [2023-02-17 06:31:06,920 INFO L899 garLoopResultBuilder]: For program point L638(lines 638 967) no Hoare annotation was computed. [2023-02-17 06:31:06,921 INFO L895 garLoopResultBuilder]: At program point L93(lines 65 999) the Hoare annotation is: (let ((.cse4 (<= 0 (+ |ULTIMATE.start_main_~main__t~0#1| (- 1))))) (let ((.cse0 (<= 0 |ULTIMATE.start_main_~main__tagbuf_len~0#1|)) (.cse1 (<= |ULTIMATE.start_main_~main__t~0#1| |ULTIMATE.start_main_~main__tagbuf_len~0#1|)) (.cse6 (not (= 0 |ULTIMATE.start_main_~__VERIFIER_assert__cond~11#1|))) (.cse3 (let ((.cse12 (let ((.cse13 (<= (* (- 1) |ULTIMATE.start_main_~main__t~0#1|) 0))) (or (and (not .cse13) (= |ULTIMATE.start_main_~main__t~0#1| 0)) .cse13)))) (or (and (not (= 0 |ULTIMATE.start_main_~__VERIFIER_assert__cond~6#1|)) .cse12 .cse4) (and .cse12 .cse4))))) (let ((.cse5 (let ((.cse8 (not (= 0 |ULTIMATE.start_main_~__VERIFIER_assert__cond~7#1|)))) (let ((.cse7 (let ((.cse11 (or (and .cse3 .cse8 .cse4) (and .cse3 .cse4)))) (let ((.cse9 (and .cse11 .cse4)) (.cse10 (and .cse11 (not (= 0 |ULTIMATE.start_main_~__VERIFIER_assert__cond~10#1|)) .cse4))) (or (and .cse6 (or .cse9 .cse10)) .cse9 .cse10))))) (or (and .cse0 .cse1 .cse7) (and .cse0 .cse1 .cse7 .cse8)))))) (or (let ((.cse2 (<= |ULTIMATE.start_main_~main__tagbuf_len~0#1| 0))) (and .cse0 .cse1 (or (and (not (= |ULTIMATE.start_main_~main__tagbuf_len~0#1| 0)) (or .cse0 (not (<= (+ |ULTIMATE.start_main_~main__tagbuf_len~0#1| 1) 0)))) (not .cse2)) .cse3 (or .cse2 (<= |ULTIMATE.start_main_~main__t~0#1| 1)) .cse4)) (and .cse1 .cse5) (and .cse6 .cse1 .cse5))))) [2023-02-17 06:31:06,921 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 219) no Hoare annotation was computed. [2023-02-17 06:31:06,921 INFO L899 garLoopResultBuilder]: For program point L919(line 919) no Hoare annotation was computed. [2023-02-17 06:31:06,922 INFO L899 garLoopResultBuilder]: For program point L853(lines 853 947) no Hoare annotation was computed. [2023-02-17 06:31:06,922 INFO L899 garLoopResultBuilder]: For program point L143(lines 143 236) no Hoare annotation was computed. [2023-02-17 06:31:06,922 INFO L899 garLoopResultBuilder]: For program point L589(lines 589 970) no Hoare annotation was computed. [2023-02-17 06:31:06,922 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 17 1006) the Hoare annotation is: true [2023-02-17 06:31:06,922 INFO L899 garLoopResultBuilder]: For program point L325(lines 325 993) no Hoare annotation was computed. [2023-02-17 06:31:06,922 INFO L899 garLoopResultBuilder]: For program point L672(lines 672 696) no Hoare annotation was computed. [2023-02-17 06:31:06,922 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 145) no Hoare annotation was computed. [2023-02-17 06:31:06,923 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-17 06:31:06,923 INFO L895 garLoopResultBuilder]: At program point L28(lines 26 1000) 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-17 06:31:06,923 INFO L899 garLoopResultBuilder]: For program point L309(lines 309 995) no Hoare annotation was computed. [2023-02-17 06:31:06,923 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 931) no Hoare annotation was computed. [2023-02-17 06:31:06,923 INFO L899 garLoopResultBuilder]: For program point L706(lines 706 961) no Hoare annotation was computed. [2023-02-17 06:31:06,923 INFO L899 garLoopResultBuilder]: For program point L343(lines 343 354) no Hoare annotation was computed. [2023-02-17 06:31:06,923 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 117) no Hoare annotation was computed. [2023-02-17 06:31:06,923 INFO L899 garLoopResultBuilder]: For program point L145(line 145) no Hoare annotation was computed. [2023-02-17 06:31:06,924 INFO L899 garLoopResultBuilder]: For program point L657(lines 657 964) no Hoare annotation was computed. [2023-02-17 06:31:06,924 INFO L899 garLoopResultBuilder]: For program point L46(lines 46 56) no Hoare annotation was computed. [2023-02-17 06:31:06,924 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 919) no Hoare annotation was computed. [2023-02-17 06:31:06,924 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-17 06:31:06,924 INFO L899 garLoopResultBuilder]: For program point L393(lines 393 987) no Hoare annotation was computed. [2023-02-17 06:31:06,924 INFO L899 garLoopResultBuilder]: For program point L740(lines 740 764) no Hoare annotation was computed. [2023-02-17 06:31:06,924 INFO L899 garLoopResultBuilder]: For program point L96(lines 96 285) no Hoare annotation was computed. [2023-02-17 06:31:06,924 INFO L899 garLoopResultBuilder]: For program point L377(lines 377 989) no Hoare annotation was computed. [2023-02-17 06:31:06,924 INFO L899 garLoopResultBuilder]: For program point L774(lines 774 955) no Hoare annotation was computed. [2023-02-17 06:31:06,924 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 157) no Hoare annotation was computed. [2023-02-17 06:31:06,924 INFO L899 garLoopResultBuilder]: For program point L411(lines 411 422) no Hoare annotation was computed. [2023-02-17 06:31:06,925 INFO L899 garLoopResultBuilder]: For program point L725(lines 725 958) no Hoare annotation was computed. [2023-02-17 06:31:06,925 INFO L899 garLoopResultBuilder]: For program point L48(line 48) no Hoare annotation was computed. [2023-02-17 06:31:06,925 INFO L899 garLoopResultBuilder]: For program point L461(lines 461 981) no Hoare annotation was computed. [2023-02-17 06:31:06,925 INFO L899 garLoopResultBuilder]: For program point L874(lines 874 945) no Hoare annotation was computed. [2023-02-17 06:31:06,925 INFO L899 garLoopResultBuilder]: For program point L808(lines 808 832) no Hoare annotation was computed. [2023-02-17 06:31:06,925 INFO L899 garLoopResultBuilder]: For program point L164(lines 164 233) no Hoare annotation was computed. [2023-02-17 06:31:06,925 INFO L899 garLoopResultBuilder]: For program point L65(lines 65 999) no Hoare annotation was computed. [2023-02-17 06:31:06,925 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-17 06:31:06,925 INFO L899 garLoopResultBuilder]: For program point L445(lines 445 983) no Hoare annotation was computed. [2023-02-17 06:31:06,925 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 36) no Hoare annotation was computed. [2023-02-17 06:31:06,925 INFO L899 garLoopResultBuilder]: For program point L115(lines 115 123) no Hoare annotation was computed. [2023-02-17 06:31:06,926 INFO L899 garLoopResultBuilder]: For program point L842(lines 842 949) no Hoare annotation was computed. [2023-02-17 06:31:06,926 INFO L895 garLoopResultBuilder]: At program point L198(lines 132 284) the Hoare annotation is: (let ((.cse6 (<= 0 |ULTIMATE.start_main_~main__tagbuf_len~0#1|)) (.cse26 (<= |ULTIMATE.start_main_~main__tagbuf_len~0#1| 0))) (let ((.cse16 (not (= 0 |ULTIMATE.start_main_~__VERIFIER_assert__cond~7#1|))) (.cse8 (or (and (not (= |ULTIMATE.start_main_~main__tagbuf_len~0#1| 0)) (or .cse6 (not (<= (+ |ULTIMATE.start_main_~main__tagbuf_len~0#1| 1) 0)))) (not .cse26))) (.cse9 (or .cse26 (<= |ULTIMATE.start_main_~main__t~0#1| 1))) (.cse22 (<= 0 (+ |ULTIMATE.start_main_~main__t~0#1| (- 1)))) (.cse20 (* (- 1) |ULTIMATE.start_main_~main__t~0#1|))) (let ((.cse21 (let ((.cse23 (let ((.cse24 (let ((.cse25 (<= .cse20 0))) (or (and (not .cse25) (= |ULTIMATE.start_main_~main__t~0#1| 0)) .cse25)))) (or (and (not (= 0 |ULTIMATE.start_main_~__VERIFIER_assert__cond~6#1|)) .cse24 .cse22) (and .cse24 .cse22))))) (or (and .cse23 .cse16 .cse22) (and .cse23 .cse22) (and .cse8 .cse23 .cse9 .cse22))))) (let ((.cse14 (<= (+ |ULTIMATE.start_main_~main__t~0#1| (* (- 1) |ULTIMATE.start_main_~main__tagbuf_len~0#1|)) 0)) (.cse17 (and .cse21 .cse22)) (.cse19 (and (not (= 0 |ULTIMATE.start_main_~__VERIFIER_assert__cond~10#1|)) .cse21 .cse22))) (let ((.cse18 (and .cse8 .cse9 (or .cse17 .cse19))) (.cse11 (not (<= (+ |ULTIMATE.start_main_~main__tagbuf_len~0#1| .cse20) 0))) (.cse13 (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~17#1| 0)) (.cse12 (not .cse14))) (let ((.cse1 (<= |ULTIMATE.start_main_~main__t~0#1| |ULTIMATE.start_main_~main__tagbuf_len~0#1|)) (.cse10 (or .cse11 (and .cse13 .cse12))) (.cse0 (not (= 0 |ULTIMATE.start_main_~__VERIFIER_assert__cond~11#1|))) (.cse7 (or .cse17 .cse18 .cse19))) (let ((.cse5 (let ((.cse15 (or .cse17 .cse18 .cse19 (and .cse0 .cse7)))) (or (and .cse6 .cse1 .cse15 .cse16 .cse10) (and .cse6 .cse1 .cse15 .cse10)))) (.cse2 (or .cse13 .cse14)) (.cse3 (or .cse11 .cse12)) (.cse4 (or .cse11 (and (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~7#1| 0) .cse12)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse1 .cse2 .cse8 .cse9 .cse3 .cse4 .cse10))))))))) [2023-02-17 06:31:06,926 INFO L899 garLoopResultBuilder]: For program point L132(lines 132 284) no Hoare annotation was computed. [2023-02-17 06:31:06,926 INFO L899 garLoopResultBuilder]: For program point L479(lines 479 490) no Hoare annotation was computed. [2023-02-17 06:31:06,926 INFO L899 garLoopResultBuilder]: For program point L793(lines 793 952) no Hoare annotation was computed. [2023-02-17 06:31:06,926 INFO L899 garLoopResultBuilder]: For program point L248(lines 248 283) no Hoare annotation was computed. [2023-02-17 06:31:06,927 INFO L899 garLoopResultBuilder]: For program point L83(lines 83 286) no Hoare annotation was computed. [2023-02-17 06:31:06,927 INFO L899 garLoopResultBuilder]: For program point L529(lines 529 975) no Hoare annotation was computed. [2023-02-17 06:31:06,927 INFO L899 garLoopResultBuilder]: For program point L298(lines 298 997) no Hoare annotation was computed. [2023-02-17 06:31:06,927 INFO L899 garLoopResultBuilder]: For program point L34(lines 34 58) no Hoare annotation was computed. [2023-02-17 06:31:06,927 INFO L899 garLoopResultBuilder]: For program point L513(lines 513 977) no Hoare annotation was computed. [2023-02-17 06:31:06,927 INFO L899 garLoopResultBuilder]: For program point L893(lines 893 905) no Hoare annotation was computed. [2023-02-17 06:31:06,927 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 257) no Hoare annotation was computed. [2023-02-17 06:31:06,927 INFO L899 garLoopResultBuilder]: For program point L183(lines 183 191) no Hoare annotation was computed. [2023-02-17 06:31:06,927 INFO L899 garLoopResultBuilder]: For program point L117(line 117) no Hoare annotation was computed. [2023-02-17 06:31:06,927 INFO L899 garLoopResultBuilder]: For program point L332(lines 332 356) no Hoare annotation was computed. [2023-02-17 06:31:06,928 INFO L899 garLoopResultBuilder]: For program point L547(lines 547 558) no Hoare annotation was computed. [2023-02-17 06:31:06,929 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 06:31:06,932 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-17 06:31:06,971 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.02 06:31:06 BoogieIcfgContainer [2023-02-17 06:31:06,971 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-17 06:31:06,972 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-17 06:31:06,972 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-17 06:31:06,972 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-17 06:31:06,972 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 06:31:02" (3/4) ... [2023-02-17 06:31:06,974 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-17 06:31:06,984 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2023-02-17 06:31:06,985 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-02-17 06:31:06,985 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-17 06:31:06,986 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-17 06:31:07,036 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-17 06:31:07,036 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-17 06:31:07,036 INFO L158 Benchmark]: Toolchain (without parser) took 5010.26ms. Allocated memory was 151.0MB in the beginning and 203.4MB in the end (delta: 52.4MB). Free memory was 112.9MB in the beginning and 95.2MB in the end (delta: 17.8MB). Peak memory consumption was 69.0MB. Max. memory is 16.1GB. [2023-02-17 06:31:07,037 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 125.8MB. Free memory is still 98.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 06:31:07,037 INFO L158 Benchmark]: CACSL2BoogieTranslator took 276.37ms. Allocated memory is still 151.0MB. Free memory was 112.9MB in the beginning and 89.9MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-02-17 06:31:07,037 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.38ms. Allocated memory is still 151.0MB. Free memory was 89.9MB in the beginning and 119.3MB in the end (delta: -29.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-17 06:31:07,037 INFO L158 Benchmark]: Boogie Preprocessor took 50.32ms. Allocated memory is still 151.0MB. Free memory was 119.3MB in the beginning and 117.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 06:31:07,037 INFO L158 Benchmark]: RCFGBuilder took 532.53ms. Allocated memory is still 151.0MB. Free memory was 116.6MB in the beginning and 88.5MB in the end (delta: 28.1MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2023-02-17 06:31:07,038 INFO L158 Benchmark]: TraceAbstraction took 3999.79ms. Allocated memory was 151.0MB in the beginning and 203.4MB in the end (delta: 52.4MB). Free memory was 87.9MB in the beginning and 104.6MB in the end (delta: -16.7MB). Peak memory consumption was 38.0MB. Max. memory is 16.1GB. [2023-02-17 06:31:07,038 INFO L158 Benchmark]: Witness Printer took 64.14ms. Allocated memory is still 203.4MB. Free memory was 104.6MB in the beginning and 95.2MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-17 06:31:07,039 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 125.8MB. Free memory is still 98.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 276.37ms. Allocated memory is still 151.0MB. Free memory was 112.9MB in the beginning and 89.9MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.38ms. Allocated memory is still 151.0MB. Free memory was 89.9MB in the beginning and 119.3MB in the end (delta: -29.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.32ms. Allocated memory is still 151.0MB. Free memory was 119.3MB in the beginning and 117.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 532.53ms. Allocated memory is still 151.0MB. Free memory was 116.6MB in the beginning and 88.5MB in the end (delta: 28.1MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 3999.79ms. Allocated memory was 151.0MB in the beginning and 203.4MB in the end (delta: 52.4MB). Free memory was 87.9MB in the beginning and 104.6MB in the end (delta: -16.7MB). Peak memory consumption was 38.0MB. Max. memory is 16.1GB. * Witness Printer took 64.14ms. Allocated memory is still 203.4MB. Free memory was 104.6MB in the beginning and 95.2MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 36]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 48]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 105]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 117]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 145]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 157]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 173]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 185]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 207]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 219]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 257]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 269]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 883]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 895]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 919]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 931]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 120 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 3.9s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1331 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1331 mSDsluCounter, 2483 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1445 mSDsCounter, 262 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3638 IncrementalHoareTripleChecker+Invalid, 3900 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 262 mSolverCounterUnsat, 1038 mSDtfsCounter, 3638 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 175 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=0, InterpolantAutomatonStates: 114, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 119 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 16 NumberOfFragments, 10375 HoareAnnotationTreeSize, 6 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 386 NumberOfCodeBlocks, 386 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 367 ConstructedInterpolants, 0 QuantifiedInterpolants, 3420 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: ((((((0 <= main__tagbuf_len && main__t <= main__tagbuf_len) && ((!(main__tagbuf_len == 0) && (0 <= main__tagbuf_len || !(main__tagbuf_len + 1 <= 0))) || !(main__tagbuf_len <= 0))) && (((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1))) && (main__tagbuf_len <= 0 || main__t <= 1)) && 0 <= main__t + -1) || (main__t <= main__tagbuf_len && (((0 <= main__tagbuf_len && main__t <= main__tagbuf_len) && (((!(0 == __VERIFIER_assert__cond) && ((((((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -1) || ((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && 0 <= main__t + -1)) && 0 <= main__t + -1) || ((((((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -1) || ((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && 0 <= main__t + -1)) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -1))) || (((((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -1) || ((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && 0 <= main__t + -1)) && 0 <= main__t + -1)) || ((((((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -1) || ((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && 0 <= main__t + -1)) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -1))) || (((0 <= main__tagbuf_len && main__t <= main__tagbuf_len) && (((!(0 == __VERIFIER_assert__cond) && ((((((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -1) || ((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && 0 <= main__t + -1)) && 0 <= main__t + -1) || ((((((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -1) || ((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && 0 <= main__t + -1)) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -1))) || (((((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -1) || ((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && 0 <= main__t + -1)) && 0 <= main__t + -1)) || ((((((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -1) || ((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && 0 <= main__t + -1)) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -1))) && !(0 == __VERIFIER_assert__cond))))) || ((!(0 == __VERIFIER_assert__cond) && main__t <= main__tagbuf_len) && (((0 <= main__tagbuf_len && main__t <= main__tagbuf_len) && (((!(0 == __VERIFIER_assert__cond) && ((((((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -1) || ((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && 0 <= main__t + -1)) && 0 <= main__t + -1) || ((((((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -1) || ((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && 0 <= main__t + -1)) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -1))) || (((((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -1) || ((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && 0 <= main__t + -1)) && 0 <= main__t + -1)) || ((((((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -1) || ((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && 0 <= main__t + -1)) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -1))) || (((0 <= main__tagbuf_len && main__t <= main__tagbuf_len) && (((!(0 == __VERIFIER_assert__cond) && ((((((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -1) || ((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && 0 <= main__t + -1)) && 0 <= main__t + -1) || ((((((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -1) || ((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && 0 <= main__t + -1)) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -1))) || (((((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -1) || ((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && 0 <= main__t + -1)) && 0 <= main__t + -1)) || ((((((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -1) || ((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && 0 <= main__t + -1)) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -1))) && !(0 == __VERIFIER_assert__cond)))) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: ((((((!(0 == __VERIFIER_assert__cond) && main__t <= main__tagbuf_len) && (__VERIFIER_assert__cond == 0 || main__t + -1 * main__tagbuf_len <= 0)) && (!(main__tagbuf_len + -1 * main__t <= 0) || !(main__t + -1 * main__tagbuf_len <= 0))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (__VERIFIER_assert__cond == 0 && !(main__t + -1 * main__tagbuf_len <= 0)))) && (((((0 <= main__tagbuf_len && main__t <= main__tagbuf_len) && (((((((((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -1) || ((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && 0 <= main__t + -1)) || (((((!(main__tagbuf_len == 0) && (0 <= main__tagbuf_len || !(main__tagbuf_len + 1 <= 0))) || !(main__tagbuf_len <= 0)) && (((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1))) && (main__tagbuf_len <= 0 || main__t <= 1)) && 0 <= main__t + -1)) && 0 <= main__t + -1) || ((((!(main__tagbuf_len == 0) && (0 <= main__tagbuf_len || !(main__tagbuf_len + 1 <= 0))) || !(main__tagbuf_len <= 0)) && (main__tagbuf_len <= 0 || main__t <= 1)) && (((((((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -1) || ((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && 0 <= main__t + -1)) || (((((!(main__tagbuf_len == 0) && (0 <= main__tagbuf_len || !(main__tagbuf_len + 1 <= 0))) || !(main__tagbuf_len <= 0)) && (((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1))) && (main__tagbuf_len <= 0 || main__t <= 1)) && 0 <= main__t + -1)) && 0 <= main__t + -1) || ((!(0 == __VERIFIER_assert__cond) && (((((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -1) || ((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && 0 <= main__t + -1)) || (((((!(main__tagbuf_len == 0) && (0 <= main__tagbuf_len || !(main__tagbuf_len + 1 <= 0))) || !(main__tagbuf_len <= 0)) && (((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1))) && (main__tagbuf_len <= 0 || main__t <= 1)) && 0 <= main__t + -1))) && 0 <= main__t + -1)))) || ((!(0 == __VERIFIER_assert__cond) && (((((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -1) || ((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && 0 <= main__t + -1)) || (((((!(main__tagbuf_len == 0) && (0 <= main__tagbuf_len || !(main__tagbuf_len + 1 <= 0))) || !(main__tagbuf_len <= 0)) && (((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1))) && (main__tagbuf_len <= 0 || main__t <= 1)) && 0 <= main__t + -1))) && 0 <= main__t + -1)) || (!(0 == __VERIFIER_assert__cond) && ((((((((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -1) || ((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && 0 <= main__t + -1)) || (((((!(main__tagbuf_len == 0) && (0 <= main__tagbuf_len || !(main__tagbuf_len + 1 <= 0))) || !(main__tagbuf_len <= 0)) && (((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1))) && (main__tagbuf_len <= 0 || main__t <= 1)) && 0 <= main__t + -1)) && 0 <= main__t + -1) || ((((!(main__tagbuf_len == 0) && (0 <= main__tagbuf_len || !(main__tagbuf_len + 1 <= 0))) || !(main__tagbuf_len <= 0)) && (main__tagbuf_len <= 0 || main__t <= 1)) && (((((((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -1) || ((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && 0 <= main__t + -1)) || (((((!(main__tagbuf_len == 0) && (0 <= main__tagbuf_len || !(main__tagbuf_len + 1 <= 0))) || !(main__tagbuf_len <= 0)) && (((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1))) && (main__tagbuf_len <= 0 || main__t <= 1)) && 0 <= main__t + -1)) && 0 <= main__t + -1) || ((!(0 == __VERIFIER_assert__cond) && (((((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -1) || ((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && 0 <= main__t + -1)) || (((((!(main__tagbuf_len == 0) && (0 <= main__tagbuf_len || !(main__tagbuf_len + 1 <= 0))) || !(main__tagbuf_len <= 0)) && (((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1))) && (main__tagbuf_len <= 0 || main__t <= 1)) && 0 <= main__t + -1))) && 0 <= main__t + -1)))) || ((!(0 == __VERIFIER_assert__cond) && (((((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -1) || ((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && 0 <= main__t + -1)) || (((((!(main__tagbuf_len == 0) && (0 <= main__tagbuf_len || !(main__tagbuf_len + 1 <= 0))) || !(main__tagbuf_len <= 0)) && (((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1))) && (main__tagbuf_len <= 0 || main__t <= 1)) && 0 <= main__t + -1))) && 0 <= main__t + -1))))) && !(0 == __VERIFIER_assert__cond)) && (!(main__tagbuf_len + -1 * main__t <= 0) || (__VERIFIER_assert__cond == 0 && !(main__t + -1 * main__tagbuf_len <= 0)))) || (((0 <= main__tagbuf_len && main__t <= main__tagbuf_len) && (((((((((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -1) || ((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && 0 <= main__t + -1)) || (((((!(main__tagbuf_len == 0) && (0 <= main__tagbuf_len || !(main__tagbuf_len + 1 <= 0))) || !(main__tagbuf_len <= 0)) && (((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1))) && (main__tagbuf_len <= 0 || main__t <= 1)) && 0 <= main__t + -1)) && 0 <= main__t + -1) || ((((!(main__tagbuf_len == 0) && (0 <= main__tagbuf_len || !(main__tagbuf_len + 1 <= 0))) || !(main__tagbuf_len <= 0)) && (main__tagbuf_len <= 0 || main__t <= 1)) && (((((((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -1) || ((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && 0 <= main__t + -1)) || (((((!(main__tagbuf_len == 0) && (0 <= main__tagbuf_len || !(main__tagbuf_len + 1 <= 0))) || !(main__tagbuf_len <= 0)) && (((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1))) && (main__tagbuf_len <= 0 || main__t <= 1)) && 0 <= main__t + -1)) && 0 <= main__t + -1) || ((!(0 == __VERIFIER_assert__cond) && (((((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -1) || ((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && 0 <= main__t + -1)) || (((((!(main__tagbuf_len == 0) && (0 <= main__tagbuf_len || !(main__tagbuf_len + 1 <= 0))) || !(main__tagbuf_len <= 0)) && (((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1))) && (main__tagbuf_len <= 0 || main__t <= 1)) && 0 <= main__t + -1))) && 0 <= main__t + -1)))) || ((!(0 == __VERIFIER_assert__cond) && (((((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -1) || ((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && 0 <= main__t + -1)) || (((((!(main__tagbuf_len == 0) && (0 <= main__tagbuf_len || !(main__tagbuf_len + 1 <= 0))) || !(main__tagbuf_len <= 0)) && (((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1))) && (main__tagbuf_len <= 0 || main__t <= 1)) && 0 <= main__t + -1))) && 0 <= main__t + -1)) || (!(0 == __VERIFIER_assert__cond) && ((((((((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -1) || ((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && 0 <= main__t + -1)) || (((((!(main__tagbuf_len == 0) && (0 <= main__tagbuf_len || !(main__tagbuf_len + 1 <= 0))) || !(main__tagbuf_len <= 0)) && (((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1))) && (main__tagbuf_len <= 0 || main__t <= 1)) && 0 <= main__t + -1)) && 0 <= main__t + -1) || ((((!(main__tagbuf_len == 0) && (0 <= main__tagbuf_len || !(main__tagbuf_len + 1 <= 0))) || !(main__tagbuf_len <= 0)) && (main__tagbuf_len <= 0 || main__t <= 1)) && (((((((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -1) || ((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && 0 <= main__t + -1)) || (((((!(main__tagbuf_len == 0) && (0 <= main__tagbuf_len || !(main__tagbuf_len + 1 <= 0))) || !(main__tagbuf_len <= 0)) && (((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1))) && (main__tagbuf_len <= 0 || main__t <= 1)) && 0 <= main__t + -1)) && 0 <= main__t + -1) || ((!(0 == __VERIFIER_assert__cond) && (((((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -1) || ((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && 0 <= main__t + -1)) || (((((!(main__tagbuf_len == 0) && (0 <= main__tagbuf_len || !(main__tagbuf_len + 1 <= 0))) || !(main__tagbuf_len <= 0)) && (((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1))) && (main__tagbuf_len <= 0 || main__t <= 1)) && 0 <= main__t + -1))) && 0 <= main__t + -1)))) || ((!(0 == __VERIFIER_assert__cond) && (((((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -1) || ((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && 0 <= main__t + -1)) || (((((!(main__tagbuf_len == 0) && (0 <= main__tagbuf_len || !(main__tagbuf_len + 1 <= 0))) || !(main__tagbuf_len <= 0)) && (((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1))) && (main__tagbuf_len <= 0 || main__t <= 1)) && 0 <= main__t + -1))) && 0 <= main__t + -1))))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (__VERIFIER_assert__cond == 0 && !(main__t + -1 * main__tagbuf_len <= 0)))))) || ((((main__t <= main__tagbuf_len && (__VERIFIER_assert__cond == 0 || main__t + -1 * main__tagbuf_len <= 0)) && (!(main__tagbuf_len + -1 * main__t <= 0) || !(main__t + -1 * main__tagbuf_len <= 0))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (__VERIFIER_assert__cond == 0 && !(main__t + -1 * main__tagbuf_len <= 0)))) && (((((0 <= main__tagbuf_len && main__t <= main__tagbuf_len) && (((((((((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -1) || ((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && 0 <= main__t + -1)) || (((((!(main__tagbuf_len == 0) && (0 <= main__tagbuf_len || !(main__tagbuf_len + 1 <= 0))) || !(main__tagbuf_len <= 0)) && (((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1))) && (main__tagbuf_len <= 0 || main__t <= 1)) && 0 <= main__t + -1)) && 0 <= main__t + -1) || ((((!(main__tagbuf_len == 0) && (0 <= main__tagbuf_len || !(main__tagbuf_len + 1 <= 0))) || !(main__tagbuf_len <= 0)) && (main__tagbuf_len <= 0 || main__t <= 1)) && (((((((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -1) || ((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && 0 <= main__t + -1)) || (((((!(main__tagbuf_len == 0) && (0 <= main__tagbuf_len || !(main__tagbuf_len + 1 <= 0))) || !(main__tagbuf_len <= 0)) && (((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1))) && (main__tagbuf_len <= 0 || main__t <= 1)) && 0 <= main__t + -1)) && 0 <= main__t + -1) || ((!(0 == __VERIFIER_assert__cond) && (((((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -1) || ((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && 0 <= main__t + -1)) || (((((!(main__tagbuf_len == 0) && (0 <= main__tagbuf_len || !(main__tagbuf_len + 1 <= 0))) || !(main__tagbuf_len <= 0)) && (((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1))) && (main__tagbuf_len <= 0 || main__t <= 1)) && 0 <= main__t + -1))) && 0 <= main__t + -1)))) || ((!(0 == __VERIFIER_assert__cond) && (((((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -1) || ((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && 0 <= main__t + -1)) || (((((!(main__tagbuf_len == 0) && (0 <= main__tagbuf_len || !(main__tagbuf_len + 1 <= 0))) || !(main__tagbuf_len <= 0)) && (((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1))) && (main__tagbuf_len <= 0 || main__t <= 1)) && 0 <= main__t + -1))) && 0 <= main__t + -1)) || (!(0 == __VERIFIER_assert__cond) && ((((((((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -1) || ((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && 0 <= main__t + -1)) || (((((!(main__tagbuf_len == 0) && (0 <= main__tagbuf_len || !(main__tagbuf_len + 1 <= 0))) || !(main__tagbuf_len <= 0)) && (((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1))) && (main__tagbuf_len <= 0 || main__t <= 1)) && 0 <= main__t + -1)) && 0 <= main__t + -1) || ((((!(main__tagbuf_len == 0) && (0 <= main__tagbuf_len || !(main__tagbuf_len + 1 <= 0))) || !(main__tagbuf_len <= 0)) && (main__tagbuf_len <= 0 || main__t <= 1)) && (((((((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -1) || ((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && 0 <= main__t + -1)) || (((((!(main__tagbuf_len == 0) && (0 <= main__tagbuf_len || !(main__tagbuf_len + 1 <= 0))) || !(main__tagbuf_len <= 0)) && (((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1))) && (main__tagbuf_len <= 0 || main__t <= 1)) && 0 <= main__t + -1)) && 0 <= main__t + -1) || ((!(0 == __VERIFIER_assert__cond) && (((((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -1) || ((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && 0 <= main__t + -1)) || (((((!(main__tagbuf_len == 0) && (0 <= main__tagbuf_len || !(main__tagbuf_len + 1 <= 0))) || !(main__tagbuf_len <= 0)) && (((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1))) && (main__tagbuf_len <= 0 || main__t <= 1)) && 0 <= main__t + -1))) && 0 <= main__t + -1)))) || ((!(0 == __VERIFIER_assert__cond) && (((((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -1) || ((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && 0 <= main__t + -1)) || (((((!(main__tagbuf_len == 0) && (0 <= main__tagbuf_len || !(main__tagbuf_len + 1 <= 0))) || !(main__tagbuf_len <= 0)) && (((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1))) && (main__tagbuf_len <= 0 || main__t <= 1)) && 0 <= main__t + -1))) && 0 <= main__t + -1))))) && !(0 == __VERIFIER_assert__cond)) && (!(main__tagbuf_len + -1 * main__t <= 0) || (__VERIFIER_assert__cond == 0 && !(main__t + -1 * main__tagbuf_len <= 0)))) || (((0 <= main__tagbuf_len && main__t <= main__tagbuf_len) && (((((((((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -1) || ((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && 0 <= main__t + -1)) || (((((!(main__tagbuf_len == 0) && (0 <= main__tagbuf_len || !(main__tagbuf_len + 1 <= 0))) || !(main__tagbuf_len <= 0)) && (((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1))) && (main__tagbuf_len <= 0 || main__t <= 1)) && 0 <= main__t + -1)) && 0 <= main__t + -1) || ((((!(main__tagbuf_len == 0) && (0 <= main__tagbuf_len || !(main__tagbuf_len + 1 <= 0))) || !(main__tagbuf_len <= 0)) && (main__tagbuf_len <= 0 || main__t <= 1)) && (((((((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -1) || ((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && 0 <= main__t + -1)) || (((((!(main__tagbuf_len == 0) && (0 <= main__tagbuf_len || !(main__tagbuf_len + 1 <= 0))) || !(main__tagbuf_len <= 0)) && (((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1))) && (main__tagbuf_len <= 0 || main__t <= 1)) && 0 <= main__t + -1)) && 0 <= main__t + -1) || ((!(0 == __VERIFIER_assert__cond) && (((((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -1) || ((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && 0 <= main__t + -1)) || (((((!(main__tagbuf_len == 0) && (0 <= main__tagbuf_len || !(main__tagbuf_len + 1 <= 0))) || !(main__tagbuf_len <= 0)) && (((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1))) && (main__tagbuf_len <= 0 || main__t <= 1)) && 0 <= main__t + -1))) && 0 <= main__t + -1)))) || ((!(0 == __VERIFIER_assert__cond) && (((((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -1) || ((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && 0 <= main__t + -1)) || (((((!(main__tagbuf_len == 0) && (0 <= main__tagbuf_len || !(main__tagbuf_len + 1 <= 0))) || !(main__tagbuf_len <= 0)) && (((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1))) && (main__tagbuf_len <= 0 || main__t <= 1)) && 0 <= main__t + -1))) && 0 <= main__t + -1)) || (!(0 == __VERIFIER_assert__cond) && ((((((((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -1) || ((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && 0 <= main__t + -1)) || (((((!(main__tagbuf_len == 0) && (0 <= main__tagbuf_len || !(main__tagbuf_len + 1 <= 0))) || !(main__tagbuf_len <= 0)) && (((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1))) && (main__tagbuf_len <= 0 || main__t <= 1)) && 0 <= main__t + -1)) && 0 <= main__t + -1) || ((((!(main__tagbuf_len == 0) && (0 <= main__tagbuf_len || !(main__tagbuf_len + 1 <= 0))) || !(main__tagbuf_len <= 0)) && (main__tagbuf_len <= 0 || main__t <= 1)) && (((((((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -1) || ((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && 0 <= main__t + -1)) || (((((!(main__tagbuf_len == 0) && (0 <= main__tagbuf_len || !(main__tagbuf_len + 1 <= 0))) || !(main__tagbuf_len <= 0)) && (((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1))) && (main__tagbuf_len <= 0 || main__t <= 1)) && 0 <= main__t + -1)) && 0 <= main__t + -1) || ((!(0 == __VERIFIER_assert__cond) && (((((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -1) || ((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && 0 <= main__t + -1)) || (((((!(main__tagbuf_len == 0) && (0 <= main__tagbuf_len || !(main__tagbuf_len + 1 <= 0))) || !(main__tagbuf_len <= 0)) && (((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1))) && (main__tagbuf_len <= 0 || main__t <= 1)) && 0 <= main__t + -1))) && 0 <= main__t + -1)))) || ((!(0 == __VERIFIER_assert__cond) && (((((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -1) || ((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && 0 <= main__t + -1)) || (((((!(main__tagbuf_len == 0) && (0 <= main__tagbuf_len || !(main__tagbuf_len + 1 <= 0))) || !(main__tagbuf_len <= 0)) && (((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1))) && (main__tagbuf_len <= 0 || main__t <= 1)) && 0 <= main__t + -1))) && 0 <= main__t + -1))))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (__VERIFIER_assert__cond == 0 && !(main__t + -1 * main__tagbuf_len <= 0))))))) || ((((((((0 <= main__tagbuf_len && ((((((((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -1) || ((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && 0 <= main__t + -1)) || (((((!(main__tagbuf_len == 0) && (0 <= main__tagbuf_len || !(main__tagbuf_len + 1 <= 0))) || !(main__tagbuf_len <= 0)) && (((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1))) && (main__tagbuf_len <= 0 || main__t <= 1)) && 0 <= main__t + -1)) && 0 <= main__t + -1) || ((((!(main__tagbuf_len == 0) && (0 <= main__tagbuf_len || !(main__tagbuf_len + 1 <= 0))) || !(main__tagbuf_len <= 0)) && (main__tagbuf_len <= 0 || main__t <= 1)) && (((((((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -1) || ((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && 0 <= main__t + -1)) || (((((!(main__tagbuf_len == 0) && (0 <= main__tagbuf_len || !(main__tagbuf_len + 1 <= 0))) || !(main__tagbuf_len <= 0)) && (((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1))) && (main__tagbuf_len <= 0 || main__t <= 1)) && 0 <= main__t + -1)) && 0 <= main__t + -1) || ((!(0 == __VERIFIER_assert__cond) && (((((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -1) || ((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && 0 <= main__t + -1)) || (((((!(main__tagbuf_len == 0) && (0 <= main__tagbuf_len || !(main__tagbuf_len + 1 <= 0))) || !(main__tagbuf_len <= 0)) && (((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1))) && (main__tagbuf_len <= 0 || main__t <= 1)) && 0 <= main__t + -1))) && 0 <= main__t + -1)))) || ((!(0 == __VERIFIER_assert__cond) && (((((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && !(0 == __VERIFIER_assert__cond)) && 0 <= main__t + -1) || ((((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1)) && 0 <= main__t + -1)) || (((((!(main__tagbuf_len == 0) && (0 <= main__tagbuf_len || !(main__tagbuf_len + 1 <= 0))) || !(main__tagbuf_len <= 0)) && (((!(0 == __VERIFIER_assert__cond) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) || (((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0) && 0 <= main__t + -1))) && (main__tagbuf_len <= 0 || main__t <= 1)) && 0 <= main__t + -1))) && 0 <= main__t + -1))) && main__t <= main__tagbuf_len) && (__VERIFIER_assert__cond == 0 || main__t + -1 * main__tagbuf_len <= 0)) && ((!(main__tagbuf_len == 0) && (0 <= main__tagbuf_len || !(main__tagbuf_len + 1 <= 0))) || !(main__tagbuf_len <= 0))) && (main__tagbuf_len <= 0 || main__t <= 1)) && (!(main__tagbuf_len + -1 * main__t <= 0) || !(main__t + -1 * main__tagbuf_len <= 0))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (__VERIFIER_assert__cond == 0 && !(main__t + -1 * main__tagbuf_len <= 0)))) && (!(main__tagbuf_len + -1 * main__t <= 0) || (__VERIFIER_assert__cond == 0 && !(main__t + -1 * main__tagbuf_len <= 0)))) - InvariantResult [Line: 26]: 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: 858]: Loop Invariant Derived loop invariant: ((((!(main__tagbuf_len + -1 * main__t + 1 <= 0) || main__t <= main__tagbuf_len) || !(main__tagbuf_len + -1 * main__t <= 0)) && (((((0 <= main__tagbuf_len && main__t <= main__tagbuf_len) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) && 0 <= main__t + -9) || (((((0 <= main__tagbuf_len && main__t <= main__tagbuf_len) && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) && 0 <= main__t + -9))) && !(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__tagbuf_len && main__t <= main__tagbuf_len) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) && 0 <= main__t + -9) || (((((0 <= main__tagbuf_len && main__t <= main__tagbuf_len) && !(0 == __VERIFIER_assert__cond)) && ((!(-1 * main__t <= 0) && main__t == 0) || -1 * main__t <= 0)) && 0 <= main__t + -1) && 0 <= main__t + -9))) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2023-02-17 06:31:07,084 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