/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 16:48:15,241 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 16:48:15,244 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 16:48:15,297 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 16:48:15,298 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 16:48:15,301 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 16:48:15,304 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 16:48:15,315 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 16:48:15,317 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 16:48:15,318 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 16:48:15,319 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 16:48:15,327 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 16:48:15,328 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 16:48:15,331 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 16:48:15,332 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 16:48:15,335 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 16:48:15,336 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 16:48:15,342 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 16:48:15,347 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 16:48:15,350 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 16:48:15,357 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 16:48:15,358 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 16:48:15,360 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 16:48:15,361 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 16:48:15,369 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 16:48:15,373 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 16:48:15,373 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 16:48:15,375 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 16:48:15,375 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 16:48:15,376 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 16:48:15,376 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 16:48:15,377 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 16:48:15,381 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 16:48:15,382 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 16:48:15,383 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 16:48:15,384 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 16:48:15,384 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 16:48:15,385 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 16:48:15,385 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 16:48:15,389 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 16:48:15,390 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 16:48:15,392 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 16:48:15,440 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 16:48:15,441 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 16:48:15,442 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 16:48:15,442 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 16:48:15,443 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 16:48:15,443 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 16:48:15,444 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 16:48:15,444 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 16:48:15,444 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 16:48:15,445 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 16:48:15,446 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 16:48:15,446 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 16:48:15,446 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 16:48:15,446 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 16:48:15,447 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 16:48:15,447 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 16:48:15,447 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 16:48:15,447 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 16:48:15,447 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 16:48:15,448 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 16:48:15,448 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 16:48:15,448 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 16:48:15,448 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 16:48:15,448 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 16:48:15,449 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 16:48:15,449 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/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 [2021-01-06 16:48:15,818 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 16:48:15,845 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 16:48:15,848 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 16:48:15,850 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 16:48:15,851 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 16:48:15,852 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c [2021-01-06 16:48:15,926 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/30390bb91/3daaada591fd42e4b2aa97687ff2ee33/FLAG23177980b [2021-01-06 16:48:16,502 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 16:48:16,503 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c [2021-01-06 16:48:16,519 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/30390bb91/3daaada591fd42e4b2aa97687ff2ee33/FLAG23177980b [2021-01-06 16:48:16,810 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/30390bb91/3daaada591fd42e4b2aa97687ff2ee33 [2021-01-06 16:48:16,813 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 16:48:16,815 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 16:48:16,817 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 16:48:16,818 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 16:48:16,829 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 16:48:16,829 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 04:48:16" (1/1) ... [2021-01-06 16:48:16,831 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@300de086 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:48:16, skipping insertion in model container [2021-01-06 16:48:16,832 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 04:48:16" (1/1) ... [2021-01-06 16:48:16,841 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 16:48:16,900 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: lhs: VariableLHS[~main__tagbuf_len~0,] left hand side expression in assignment: lhs: VariableLHS[~main__t~0,] left hand side expression in assignment: lhs: VariableLHS[~main__tagbuf_len~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_1~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~0,] [2021-01-06 16:48:17,060 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[919,932] left hand side expression in assignment: lhs: VariableLHS[~__tmp_2~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~1,] [2021-01-06 16:48:17,071 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[1134,1147] left hand side expression in assignment: lhs: VariableLHS[~__return_2598~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_3~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~2,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_4~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~3,] left hand side expression in assignment: lhs: VariableLHS[~main__t~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_2624_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_2624_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_2~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_5~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~4,] [2021-01-06 16:48:17,087 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[2208,2221] left hand side expression in assignment: lhs: VariableLHS[~__tmp_6~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~5,] [2021-01-06 16:48:17,093 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[2423,2436] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_3~0,] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_4~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_7~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~6,] [2021-01-06 16:48:17,105 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[2918,2931] left hand side expression in assignment: lhs: VariableLHS[~__tmp_8~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~7,] [2021-01-06 16:48:17,110 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3133,3146] left hand side expression in assignment: lhs: VariableLHS[~main__t~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_9~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~8,] [2021-01-06 16:48:17,114 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3435,3448] left hand side expression in assignment: lhs: VariableLHS[~__tmp_10~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~9,] [2021-01-06 16:48:17,118 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3653,3666] left hand side expression in assignment: lhs: VariableLHS[~__tmp_11~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~10,] [2021-01-06 16:48:17,122 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3929,3942] left hand side expression in assignment: lhs: VariableLHS[~__tmp_12~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~11,] [2021-01-06 16:48:17,124 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[4147,4160] left hand side expression in assignment: lhs: VariableLHS[~main__t~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_2624_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_2624_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_6~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_13~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~12,] [2021-01-06 16:48:17,132 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[4717,4730] left hand side expression in assignment: lhs: VariableLHS[~__tmp_14~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~13,] [2021-01-06 16:48:17,137 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[4935,4948] left hand side expression in assignment: lhs: VariableLHS[~__tmp_15~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~14,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_16~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~15,] left hand side expression in assignment: lhs: VariableLHS[~main__t~0,] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_17~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~16,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_18~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~17,] left hand side expression in assignment: lhs: VariableLHS[~main__t~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_2624_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_2624_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_19~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~18,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_20~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~19,] left hand side expression in assignment: lhs: VariableLHS[~main__t~0,] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_0~2,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_21~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~20,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_22~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~21,] left hand side expression in assignment: lhs: VariableLHS[~main__t~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_2624_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_2624_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_23~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~22,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_24~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~23,] left hand side expression in assignment: lhs: VariableLHS[~main__t~0,] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_0~3,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_25~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~24,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_26~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~25,] left hand side expression in assignment: lhs: VariableLHS[~main__t~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_2624_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_2624_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_27~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~26,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_28~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~27,] left hand side expression in assignment: lhs: VariableLHS[~main__t~0,] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_0~4,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_29~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~28,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_30~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~29,] left hand side expression in assignment: lhs: VariableLHS[~main__t~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_2624_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_2624_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_31~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~30,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_32~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~31,] left hand side expression in assignment: lhs: VariableLHS[~main__t~0,] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_0~5,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_33~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~32,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_34~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~33,] left hand side expression in assignment: lhs: VariableLHS[~main__t~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_2624_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_2624_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_35~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~34,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_36~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~35,] left hand side expression in assignment: lhs: VariableLHS[~main__t~0,] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_0~6,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_37~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~36,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_38~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~37,] left hand side expression in assignment: lhs: VariableLHS[~main__t~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_2624_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_2624_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_39~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~38,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_40~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~39,] left hand side expression in assignment: lhs: VariableLHS[~main__t~0,] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_0~7,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_41~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~40,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_42~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~41,] left hand side expression in assignment: lhs: VariableLHS[~main__t~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_2624_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_2624_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_43~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~42,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_44~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~43,] left hand side expression in assignment: lhs: VariableLHS[~main__t~0,] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_0~8,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_45~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~44,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_46~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~45,] left hand side expression in assignment: lhs: VariableLHS[~main__t~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_2624_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_2624_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_47~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~46,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_48~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~47,] left hand side expression in assignment: lhs: VariableLHS[~main__t~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_3137_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_3137_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_1~8,] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_0~8,] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_0~9,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_49~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~48,] [2021-01-06 16:48:17,214 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[15828,15841] left hand side expression in assignment: lhs: VariableLHS[~__tmp_50~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~49,] [2021-01-06 16:48:17,217 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[16046,16059] left hand side expression in assignment: lhs: VariableLHS[~main__t~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_2624_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_2624_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_51~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~50,] [2021-01-06 16:48:17,221 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[16441,16454] left hand side expression in assignment: lhs: VariableLHS[~__tmp_52~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~51,] [2021-01-06 16:48:17,224 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[16659,16672] left hand side expression in assignment: lhs: VariableLHS[~main__t~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_3137_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_3137_1~0,GLOBAL] [2021-01-06 16:48:17,231 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 16:48:17,252 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: lhs: VariableLHS[~main__tagbuf_len~0,] left hand side expression in assignment: lhs: VariableLHS[~main__t~0,] left hand side expression in assignment: lhs: VariableLHS[~main__tagbuf_len~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_1~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~0,] [2021-01-06 16:48:17,284 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[919,932] left hand side expression in assignment: lhs: VariableLHS[~__tmp_2~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~1,] [2021-01-06 16:48:17,289 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[1134,1147] left hand side expression in assignment: lhs: VariableLHS[~__return_2598~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_3~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~2,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_4~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~3,] left hand side expression in assignment: lhs: VariableLHS[~main__t~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_2624_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_2624_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_2~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_5~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~4,] [2021-01-06 16:48:17,302 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[2208,2221] left hand side expression in assignment: lhs: VariableLHS[~__tmp_6~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~5,] [2021-01-06 16:48:17,312 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[2423,2436] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_3~0,] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_4~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_7~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~6,] [2021-01-06 16:48:17,317 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[2918,2931] left hand side expression in assignment: lhs: VariableLHS[~__tmp_8~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~7,] [2021-01-06 16:48:17,322 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3133,3146] left hand side expression in assignment: lhs: VariableLHS[~main__t~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_9~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~8,] [2021-01-06 16:48:17,329 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3435,3448] left hand side expression in assignment: lhs: VariableLHS[~__tmp_10~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~9,] [2021-01-06 16:48:17,334 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3653,3666] left hand side expression in assignment: lhs: VariableLHS[~__tmp_11~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~10,] [2021-01-06 16:48:17,336 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3929,3942] left hand side expression in assignment: lhs: VariableLHS[~__tmp_12~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~11,] [2021-01-06 16:48:17,343 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[4147,4160] left hand side expression in assignment: lhs: VariableLHS[~main__t~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_2624_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_2624_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_6~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_13~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~12,] [2021-01-06 16:48:17,353 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[4717,4730] left hand side expression in assignment: lhs: VariableLHS[~__tmp_14~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~13,] [2021-01-06 16:48:17,354 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[4935,4948] left hand side expression in assignment: lhs: VariableLHS[~__tmp_15~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~14,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_16~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~15,] left hand side expression in assignment: lhs: VariableLHS[~main__t~0,] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_17~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~16,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_18~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~17,] left hand side expression in assignment: lhs: VariableLHS[~main__t~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_2624_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_2624_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_19~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~18,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_20~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~19,] left hand side expression in assignment: lhs: VariableLHS[~main__t~0,] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_0~2,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_21~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~20,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_22~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~21,] left hand side expression in assignment: lhs: VariableLHS[~main__t~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_2624_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_2624_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_23~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~22,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_24~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~23,] left hand side expression in assignment: lhs: VariableLHS[~main__t~0,] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_0~3,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_25~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~24,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_26~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~25,] left hand side expression in assignment: lhs: VariableLHS[~main__t~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_2624_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_2624_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_27~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~26,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_28~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~27,] left hand side expression in assignment: lhs: VariableLHS[~main__t~0,] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_0~4,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_29~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~28,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_30~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~29,] left hand side expression in assignment: lhs: VariableLHS[~main__t~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_2624_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_2624_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_31~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~30,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_32~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~31,] left hand side expression in assignment: lhs: VariableLHS[~main__t~0,] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_0~5,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_33~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~32,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_34~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~33,] left hand side expression in assignment: lhs: VariableLHS[~main__t~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_2624_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_2624_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_35~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~34,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_36~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~35,] left hand side expression in assignment: lhs: VariableLHS[~main__t~0,] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_0~6,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_37~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~36,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_38~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~37,] left hand side expression in assignment: lhs: VariableLHS[~main__t~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_2624_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_2624_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_39~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~38,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_40~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~39,] left hand side expression in assignment: lhs: VariableLHS[~main__t~0,] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_0~7,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_41~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~40,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_42~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~41,] left hand side expression in assignment: lhs: VariableLHS[~main__t~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_2624_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_2624_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_43~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~42,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_44~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~43,] left hand side expression in assignment: lhs: VariableLHS[~main__t~0,] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_0~8,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_45~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~44,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_46~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~45,] left hand side expression in assignment: lhs: VariableLHS[~main__t~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_2624_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_2624_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_47~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~46,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_48~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~47,] left hand side expression in assignment: lhs: VariableLHS[~main__t~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_3137_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_3137_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_1~8,] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_0~8,] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_0~9,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_49~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~48,] [2021-01-06 16:48:17,414 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[15828,15841] left hand side expression in assignment: lhs: VariableLHS[~__tmp_50~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~49,] [2021-01-06 16:48:17,416 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[16046,16059] left hand side expression in assignment: lhs: VariableLHS[~main__t~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_2624_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_2624_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_51~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~50,] [2021-01-06 16:48:17,420 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[16441,16454] left hand side expression in assignment: lhs: VariableLHS[~__tmp_52~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~51,] [2021-01-06 16:48:17,423 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[16659,16672] left hand side expression in assignment: lhs: VariableLHS[~main__t~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_3137_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_3137_1~0,GLOBAL] [2021-01-06 16:48:17,428 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 16:48:17,445 INFO L208 MainTranslator]: Completed translation [2021-01-06 16:48:17,446 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:48:17 WrapperNode [2021-01-06 16:48:17,446 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 16:48:17,448 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 16:48:17,448 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 16:48:17,448 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 16:48:17,460 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:48:17" (1/1) ... [2021-01-06 16:48:17,479 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:48:17" (1/1) ... [2021-01-06 16:48:17,523 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 16:48:17,524 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 16:48:17,525 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 16:48:17,525 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 16:48:17,537 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:48:17" (1/1) ... [2021-01-06 16:48:17,538 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:48:17" (1/1) ... [2021-01-06 16:48:17,542 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:48:17" (1/1) ... [2021-01-06 16:48:17,543 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:48:17" (1/1) ... [2021-01-06 16:48:17,554 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:48:17" (1/1) ... [2021-01-06 16:48:17,560 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:48:17" (1/1) ... [2021-01-06 16:48:17,564 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:48:17" (1/1) ... [2021-01-06 16:48:17,570 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 16:48:17,571 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 16:48:17,571 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 16:48:17,571 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 16:48:17,572 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:48:17" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 16:48:17,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 16:48:17,757 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 16:48:17,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 16:48:17,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 16:48:18,662 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 16:48:18,663 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-01-06 16:48:18,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 04:48:18 BoogieIcfgContainer [2021-01-06 16:48:18,666 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 16:48:18,669 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 16:48:18,669 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 16:48:18,672 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 16:48:18,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 04:48:16" (1/3) ... [2021-01-06 16:48:18,675 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22e6ed9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 04:48:18, skipping insertion in model container [2021-01-06 16:48:18,675 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:48:17" (2/3) ... [2021-01-06 16:48:18,676 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22e6ed9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 04:48:18, skipping insertion in model container [2021-01-06 16:48:18,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 04:48:18" (3/3) ... [2021-01-06 16:48:18,678 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.p+lhb-reducer.c [2021-01-06 16:48:18,691 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 16:48:18,696 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2021-01-06 16:48:18,715 INFO L253 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2021-01-06 16:48:18,745 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 16:48:18,746 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 16:48:18,746 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 16:48:18,746 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 16:48:18,746 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 16:48:18,746 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 16:48:18,747 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 16:48:18,747 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 16:48:18,767 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states. [2021-01-06 16:48:18,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-01-06 16:48:18,773 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:48:18,773 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:48:18,774 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:48:18,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:48:18,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1804934597, now seen corresponding path program 1 times [2021-01-06 16:48:18,790 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:48:18,791 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354204260] [2021-01-06 16:48:18,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:48:18,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:48:18,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:48:18,999 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354204260] [2021-01-06 16:48:19,000 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:48:19,000 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 16:48:19,001 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660153140] [2021-01-06 16:48:19,006 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 16:48:19,007 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:48:19,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 16:48:19,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 16:48:19,029 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 4 states. [2021-01-06 16:48:19,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:48:19,426 INFO L93 Difference]: Finished difference Result 131 states and 205 transitions. [2021-01-06 16:48:19,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 16:48:19,432 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2021-01-06 16:48:19,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:48:19,468 INFO L225 Difference]: With dead ends: 131 [2021-01-06 16:48:19,471 INFO L226 Difference]: Without dead ends: 114 [2021-01-06 16:48:19,507 INFO L677 BasicCegarLoop]: 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 [2021-01-06 16:48:19,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-01-06 16:48:19,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2021-01-06 16:48:19,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2021-01-06 16:48:19,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 135 transitions. [2021-01-06 16:48:19,574 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 135 transitions. Word has length 7 [2021-01-06 16:48:19,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:48:19,575 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 135 transitions. [2021-01-06 16:48:19,575 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 16:48:19,575 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 135 transitions. [2021-01-06 16:48:19,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-01-06 16:48:19,576 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:48:19,576 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:48:19,577 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 16:48:19,577 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:48:19,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:48:19,578 INFO L82 PathProgramCache]: Analyzing trace with hash 118401710, now seen corresponding path program 1 times [2021-01-06 16:48:19,578 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:48:19,579 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130827343] [2021-01-06 16:48:19,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:48:19,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:48:19,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:48:19,726 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130827343] [2021-01-06 16:48:19,726 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:48:19,726 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 16:48:19,727 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216808002] [2021-01-06 16:48:19,729 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 16:48:19,731 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:48:19,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 16:48:19,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 16:48:19,733 INFO L87 Difference]: Start difference. First operand 114 states and 135 transitions. Second operand 5 states. [2021-01-06 16:48:19,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:48:19,973 INFO L93 Difference]: Finished difference Result 114 states and 135 transitions. [2021-01-06 16:48:19,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 16:48:19,974 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2021-01-06 16:48:19,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:48:19,980 INFO L225 Difference]: With dead ends: 114 [2021-01-06 16:48:19,980 INFO L226 Difference]: Without dead ends: 109 [2021-01-06 16:48:19,982 INFO L677 BasicCegarLoop]: 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 [2021-01-06 16:48:19,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-01-06 16:48:20,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2021-01-06 16:48:20,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2021-01-06 16:48:20,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 121 transitions. [2021-01-06 16:48:20,010 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 121 transitions. Word has length 8 [2021-01-06 16:48:20,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:48:20,010 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 121 transitions. [2021-01-06 16:48:20,010 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 16:48:20,010 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 121 transitions. [2021-01-06 16:48:20,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-01-06 16:48:20,011 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:48:20,012 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:48:20,012 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 16:48:20,013 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:48:20,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:48:20,014 INFO L82 PathProgramCache]: Analyzing trace with hash -639549266, now seen corresponding path program 1 times [2021-01-06 16:48:20,014 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:48:20,016 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002741673] [2021-01-06 16:48:20,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:48:20,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:48:20,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:48:20,133 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002741673] [2021-01-06 16:48:20,133 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:48:20,133 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 16:48:20,133 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852197685] [2021-01-06 16:48:20,134 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 16:48:20,134 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:48:20,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 16:48:20,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 16:48:20,145 INFO L87 Difference]: Start difference. First operand 109 states and 121 transitions. Second operand 5 states. [2021-01-06 16:48:20,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:48:20,416 INFO L93 Difference]: Finished difference Result 109 states and 121 transitions. [2021-01-06 16:48:20,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 16:48:20,416 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2021-01-06 16:48:20,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:48:20,420 INFO L225 Difference]: With dead ends: 109 [2021-01-06 16:48:20,420 INFO L226 Difference]: Without dead ends: 107 [2021-01-06 16:48:20,421 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 16:48:20,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-01-06 16:48:20,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2021-01-06 16:48:20,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2021-01-06 16:48:20,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 119 transitions. [2021-01-06 16:48:20,451 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 119 transitions. Word has length 11 [2021-01-06 16:48:20,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:48:20,452 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 119 transitions. [2021-01-06 16:48:20,452 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 16:48:20,452 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 119 transitions. [2021-01-06 16:48:20,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-01-06 16:48:20,453 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:48:20,453 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:48:20,454 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 16:48:20,454 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:48:20,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:48:20,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1648813321, now seen corresponding path program 1 times [2021-01-06 16:48:20,455 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:48:20,455 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669129231] [2021-01-06 16:48:20,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:48:20,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:48:20,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:48:20,547 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669129231] [2021-01-06 16:48:20,547 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:48:20,547 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 16:48:20,548 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990630646] [2021-01-06 16:48:20,548 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 16:48:20,548 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:48:20,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 16:48:20,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 16:48:20,549 INFO L87 Difference]: Start difference. First operand 107 states and 119 transitions. Second operand 4 states. [2021-01-06 16:48:20,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:48:20,705 INFO L93 Difference]: Finished difference Result 107 states and 119 transitions. [2021-01-06 16:48:20,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 16:48:20,705 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2021-01-06 16:48:20,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:48:20,706 INFO L225 Difference]: With dead ends: 107 [2021-01-06 16:48:20,706 INFO L226 Difference]: Without dead ends: 103 [2021-01-06 16:48:20,707 INFO L677 BasicCegarLoop]: 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 [2021-01-06 16:48:20,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2021-01-06 16:48:20,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2021-01-06 16:48:20,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2021-01-06 16:48:20,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 115 transitions. [2021-01-06 16:48:20,714 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 115 transitions. Word has length 12 [2021-01-06 16:48:20,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:48:20,715 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 115 transitions. [2021-01-06 16:48:20,715 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 16:48:20,715 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2021-01-06 16:48:20,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-01-06 16:48:20,716 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:48:20,716 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:48:20,716 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 16:48:20,716 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:48:20,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:48:20,717 INFO L82 PathProgramCache]: Analyzing trace with hash -411248735, now seen corresponding path program 1 times [2021-01-06 16:48:20,717 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:48:20,718 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348553483] [2021-01-06 16:48:20,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:48:20,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:48:20,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:48:20,772 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348553483] [2021-01-06 16:48:20,772 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:48:20,772 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 16:48:20,772 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014676924] [2021-01-06 16:48:20,773 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 16:48:20,773 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:48:20,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 16:48:20,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 16:48:20,774 INFO L87 Difference]: Start difference. First operand 103 states and 115 transitions. Second operand 5 states. [2021-01-06 16:48:21,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:48:21,041 INFO L93 Difference]: Finished difference Result 121 states and 135 transitions. [2021-01-06 16:48:21,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 16:48:21,042 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2021-01-06 16:48:21,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:48:21,043 INFO L225 Difference]: With dead ends: 121 [2021-01-06 16:48:21,043 INFO L226 Difference]: Without dead ends: 119 [2021-01-06 16:48:21,044 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 16:48:21,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-01-06 16:48:21,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 101. [2021-01-06 16:48:21,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2021-01-06 16:48:21,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 113 transitions. [2021-01-06 16:48:21,062 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 113 transitions. Word has length 13 [2021-01-06 16:48:21,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:48:21,062 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 113 transitions. [2021-01-06 16:48:21,062 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 16:48:21,063 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 113 transitions. [2021-01-06 16:48:21,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-01-06 16:48:21,063 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:48:21,064 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:48:21,064 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 16:48:21,064 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:48:21,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:48:21,065 INFO L82 PathProgramCache]: Analyzing trace with hash -409524831, now seen corresponding path program 1 times [2021-01-06 16:48:21,065 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:48:21,065 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163028005] [2021-01-06 16:48:21,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:48:21,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:48:21,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:48:21,111 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163028005] [2021-01-06 16:48:21,111 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:48:21,111 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 16:48:21,111 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241834761] [2021-01-06 16:48:21,112 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 16:48:21,112 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:48:21,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 16:48:21,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 16:48:21,113 INFO L87 Difference]: Start difference. First operand 101 states and 113 transitions. Second operand 5 states. [2021-01-06 16:48:21,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:48:21,326 INFO L93 Difference]: Finished difference Result 101 states and 113 transitions. [2021-01-06 16:48:21,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 16:48:21,327 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2021-01-06 16:48:21,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:48:21,328 INFO L225 Difference]: With dead ends: 101 [2021-01-06 16:48:21,328 INFO L226 Difference]: Without dead ends: 99 [2021-01-06 16:48:21,329 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 16:48:21,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-01-06 16:48:21,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2021-01-06 16:48:21,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2021-01-06 16:48:21,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2021-01-06 16:48:21,343 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 13 [2021-01-06 16:48:21,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:48:21,344 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2021-01-06 16:48:21,344 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 16:48:21,344 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2021-01-06 16:48:21,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-01-06 16:48:21,345 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:48:21,346 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:48:21,346 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 16:48:21,346 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:48:21,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:48:21,347 INFO L82 PathProgramCache]: Analyzing trace with hash 136195212, now seen corresponding path program 1 times [2021-01-06 16:48:21,348 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:48:21,354 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535217078] [2021-01-06 16:48:21,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:48:21,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:48:21,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:48:21,526 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535217078] [2021-01-06 16:48:21,526 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:48:21,526 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 16:48:21,526 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216790069] [2021-01-06 16:48:21,527 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 16:48:21,527 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:48:21,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 16:48:21,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 16:48:21,528 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand 6 states. [2021-01-06 16:48:21,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:48:21,743 INFO L93 Difference]: Finished difference Result 136 states and 152 transitions. [2021-01-06 16:48:21,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 16:48:21,744 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2021-01-06 16:48:21,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:48:21,745 INFO L225 Difference]: With dead ends: 136 [2021-01-06 16:48:21,745 INFO L226 Difference]: Without dead ends: 134 [2021-01-06 16:48:21,746 INFO L677 BasicCegarLoop]: 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 [2021-01-06 16:48:21,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2021-01-06 16:48:21,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 105. [2021-01-06 16:48:21,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2021-01-06 16:48:21,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2021-01-06 16:48:21,751 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 14 [2021-01-06 16:48:21,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:48:21,752 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2021-01-06 16:48:21,752 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 16:48:21,752 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2021-01-06 16:48:21,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-01-06 16:48:21,753 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:48:21,753 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:48:21,753 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 16:48:21,754 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:48:21,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:48:21,754 INFO L82 PathProgramCache]: Analyzing trace with hash 137742357, now seen corresponding path program 1 times [2021-01-06 16:48:21,754 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:48:21,755 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344821871] [2021-01-06 16:48:21,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:48:21,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:48:21,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:48:21,795 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344821871] [2021-01-06 16:48:21,795 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:48:21,795 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 16:48:21,795 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477668153] [2021-01-06 16:48:21,796 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 16:48:21,796 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:48:21,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 16:48:21,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 16:48:21,797 INFO L87 Difference]: Start difference. First operand 105 states and 119 transitions. Second operand 5 states. [2021-01-06 16:48:22,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:48:22,041 INFO L93 Difference]: Finished difference Result 126 states and 142 transitions. [2021-01-06 16:48:22,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 16:48:22,042 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2021-01-06 16:48:22,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:48:22,043 INFO L225 Difference]: With dead ends: 126 [2021-01-06 16:48:22,043 INFO L226 Difference]: Without dead ends: 124 [2021-01-06 16:48:22,044 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 16:48:22,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2021-01-06 16:48:22,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 103. [2021-01-06 16:48:22,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2021-01-06 16:48:22,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 117 transitions. [2021-01-06 16:48:22,052 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 117 transitions. Word has length 14 [2021-01-06 16:48:22,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:48:22,052 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 117 transitions. [2021-01-06 16:48:22,052 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 16:48:22,052 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 117 transitions. [2021-01-06 16:48:22,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-01-06 16:48:22,058 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:48:22,058 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:48:22,058 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 16:48:22,059 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:48:22,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:48:22,059 INFO L82 PathProgramCache]: Analyzing trace with hash 189636292, now seen corresponding path program 1 times [2021-01-06 16:48:22,060 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:48:22,060 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284641659] [2021-01-06 16:48:22,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:48:22,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:48:22,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:48:22,186 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284641659] [2021-01-06 16:48:22,186 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:48:22,186 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 16:48:22,186 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86230912] [2021-01-06 16:48:22,187 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 16:48:22,187 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:48:22,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 16:48:22,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 16:48:22,188 INFO L87 Difference]: Start difference. First operand 103 states and 117 transitions. Second operand 6 states. [2021-01-06 16:48:22,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:48:22,380 INFO L93 Difference]: Finished difference Result 113 states and 127 transitions. [2021-01-06 16:48:22,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 16:48:22,381 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2021-01-06 16:48:22,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:48:22,381 INFO L225 Difference]: With dead ends: 113 [2021-01-06 16:48:22,382 INFO L226 Difference]: Without dead ends: 109 [2021-01-06 16:48:22,382 INFO L677 BasicCegarLoop]: 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 [2021-01-06 16:48:22,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-01-06 16:48:22,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 104. [2021-01-06 16:48:22,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2021-01-06 16:48:22,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 118 transitions. [2021-01-06 16:48:22,387 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 118 transitions. Word has length 14 [2021-01-06 16:48:22,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:48:22,388 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 118 transitions. [2021-01-06 16:48:22,388 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 16:48:22,388 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 118 transitions. [2021-01-06 16:48:22,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-01-06 16:48:22,388 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:48:22,389 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:48:22,389 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 16:48:22,389 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:48:22,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:48:22,390 INFO L82 PathProgramCache]: Analyzing trace with hash -24950085, now seen corresponding path program 1 times [2021-01-06 16:48:22,390 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:48:22,390 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898812246] [2021-01-06 16:48:22,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:48:22,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:48:22,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:48:22,484 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898812246] [2021-01-06 16:48:22,484 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:48:22,484 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 16:48:22,484 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695887466] [2021-01-06 16:48:22,484 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 16:48:22,485 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:48:22,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 16:48:22,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 16:48:22,485 INFO L87 Difference]: Start difference. First operand 104 states and 118 transitions. Second operand 6 states. [2021-01-06 16:48:22,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:48:22,726 INFO L93 Difference]: Finished difference Result 131 states and 147 transitions. [2021-01-06 16:48:22,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 16:48:22,727 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2021-01-06 16:48:22,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:48:22,728 INFO L225 Difference]: With dead ends: 131 [2021-01-06 16:48:22,728 INFO L226 Difference]: Without dead ends: 129 [2021-01-06 16:48:22,728 INFO L677 BasicCegarLoop]: 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 [2021-01-06 16:48:22,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2021-01-06 16:48:22,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 107. [2021-01-06 16:48:22,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2021-01-06 16:48:22,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 121 transitions. [2021-01-06 16:48:22,733 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 121 transitions. Word has length 15 [2021-01-06 16:48:22,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:48:22,734 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 121 transitions. [2021-01-06 16:48:22,734 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 16:48:22,734 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 121 transitions. [2021-01-06 16:48:22,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-01-06 16:48:22,735 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:48:22,735 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:48:22,735 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 16:48:22,735 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:48:22,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:48:22,736 INFO L82 PathProgramCache]: Analyzing trace with hash 2034707599, now seen corresponding path program 1 times [2021-01-06 16:48:22,736 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:48:22,736 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729115229] [2021-01-06 16:48:22,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:48:22,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:48:22,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:48:22,775 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729115229] [2021-01-06 16:48:22,775 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:48:22,776 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 16:48:22,776 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722372426] [2021-01-06 16:48:22,776 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 16:48:22,776 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:48:22,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 16:48:22,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 16:48:22,783 INFO L87 Difference]: Start difference. First operand 107 states and 121 transitions. Second operand 4 states. [2021-01-06 16:48:22,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:48:22,860 INFO L93 Difference]: Finished difference Result 107 states and 121 transitions. [2021-01-06 16:48:22,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 16:48:22,861 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2021-01-06 16:48:22,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:48:22,862 INFO L225 Difference]: With dead ends: 107 [2021-01-06 16:48:22,862 INFO L226 Difference]: Without dead ends: 105 [2021-01-06 16:48:22,862 INFO L677 BasicCegarLoop]: 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 [2021-01-06 16:48:22,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-01-06 16:48:22,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2021-01-06 16:48:22,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2021-01-06 16:48:22,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2021-01-06 16:48:22,867 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 16 [2021-01-06 16:48:22,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:48:22,868 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2021-01-06 16:48:22,868 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 16:48:22,868 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2021-01-06 16:48:22,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-01-06 16:48:22,868 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:48:22,869 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:48:22,869 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 16:48:22,869 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:48:22,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:48:22,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1348569745, now seen corresponding path program 1 times [2021-01-06 16:48:22,870 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:48:22,870 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620823359] [2021-01-06 16:48:22,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:48:22,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:48:22,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:48:22,900 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620823359] [2021-01-06 16:48:22,901 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:48:22,901 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 16:48:22,901 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113938661] [2021-01-06 16:48:22,901 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 16:48:22,901 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:48:22,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 16:48:22,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 16:48:22,902 INFO L87 Difference]: Start difference. First operand 105 states and 119 transitions. Second operand 4 states. [2021-01-06 16:48:23,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:48:23,014 INFO L93 Difference]: Finished difference Result 105 states and 119 transitions. [2021-01-06 16:48:23,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 16:48:23,015 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2021-01-06 16:48:23,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:48:23,016 INFO L225 Difference]: With dead ends: 105 [2021-01-06 16:48:23,016 INFO L226 Difference]: Without dead ends: 101 [2021-01-06 16:48:23,016 INFO L677 BasicCegarLoop]: 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 [2021-01-06 16:48:23,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-01-06 16:48:23,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2021-01-06 16:48:23,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2021-01-06 16:48:23,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 115 transitions. [2021-01-06 16:48:23,020 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 115 transitions. Word has length 17 [2021-01-06 16:48:23,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:48:23,021 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 115 transitions. [2021-01-06 16:48:23,021 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 16:48:23,021 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 115 transitions. [2021-01-06 16:48:23,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-01-06 16:48:23,021 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:48:23,022 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:48:23,022 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 16:48:23,022 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:48:23,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:48:23,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1418456853, now seen corresponding path program 1 times [2021-01-06 16:48:23,023 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:48:23,023 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127445645] [2021-01-06 16:48:23,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:48:23,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:48:23,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:48:23,078 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127445645] [2021-01-06 16:48:23,078 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:48:23,078 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 16:48:23,079 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776768651] [2021-01-06 16:48:23,079 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 16:48:23,079 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:48:23,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 16:48:23,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-06 16:48:23,080 INFO L87 Difference]: Start difference. First operand 101 states and 115 transitions. Second operand 6 states. [2021-01-06 16:48:23,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:48:23,312 INFO L93 Difference]: Finished difference Result 116 states and 132 transitions. [2021-01-06 16:48:23,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 16:48:23,312 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2021-01-06 16:48:23,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:48:23,314 INFO L225 Difference]: With dead ends: 116 [2021-01-06 16:48:23,314 INFO L226 Difference]: Without dead ends: 114 [2021-01-06 16:48:23,314 INFO L677 BasicCegarLoop]: 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 [2021-01-06 16:48:23,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-01-06 16:48:23,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 97. [2021-01-06 16:48:23,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2021-01-06 16:48:23,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 111 transitions. [2021-01-06 16:48:23,319 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 111 transitions. Word has length 18 [2021-01-06 16:48:23,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:48:23,319 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 111 transitions. [2021-01-06 16:48:23,319 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 16:48:23,319 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 111 transitions. [2021-01-06 16:48:23,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-01-06 16:48:23,320 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:48:23,320 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:48:23,320 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 16:48:23,320 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:48:23,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:48:23,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1471897933, now seen corresponding path program 1 times [2021-01-06 16:48:23,321 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:48:23,321 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647800621] [2021-01-06 16:48:23,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:48:23,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:48:23,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:48:23,372 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647800621] [2021-01-06 16:48:23,372 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:48:23,373 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 16:48:23,373 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049271007] [2021-01-06 16:48:23,373 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 16:48:23,373 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:48:23,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 16:48:23,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-06 16:48:23,374 INFO L87 Difference]: Start difference. First operand 97 states and 111 transitions. Second operand 6 states. [2021-01-06 16:48:23,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:48:23,624 INFO L93 Difference]: Finished difference Result 97 states and 111 transitions. [2021-01-06 16:48:23,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 16:48:23,624 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2021-01-06 16:48:23,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:48:23,625 INFO L225 Difference]: With dead ends: 97 [2021-01-06 16:48:23,625 INFO L226 Difference]: Without dead ends: 93 [2021-01-06 16:48:23,626 INFO L677 BasicCegarLoop]: 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 [2021-01-06 16:48:23,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-01-06 16:48:23,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2021-01-06 16:48:23,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2021-01-06 16:48:23,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 107 transitions. [2021-01-06 16:48:23,631 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 107 transitions. Word has length 18 [2021-01-06 16:48:23,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:48:23,631 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 107 transitions. [2021-01-06 16:48:23,631 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 16:48:23,631 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 107 transitions. [2021-01-06 16:48:23,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-01-06 16:48:23,632 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:48:23,632 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:48:23,632 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 16:48:23,632 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:48:23,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:48:23,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1159129958, now seen corresponding path program 1 times [2021-01-06 16:48:23,633 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:48:23,633 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252113342] [2021-01-06 16:48:23,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:48:23,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:48:23,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:48:23,689 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252113342] [2021-01-06 16:48:23,689 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:48:23,689 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 16:48:23,689 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049473656] [2021-01-06 16:48:23,690 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 16:48:23,690 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:48:23,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 16:48:23,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-06 16:48:23,691 INFO L87 Difference]: Start difference. First operand 93 states and 107 transitions. Second operand 6 states. [2021-01-06 16:48:23,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:48:23,909 INFO L93 Difference]: Finished difference Result 103 states and 119 transitions. [2021-01-06 16:48:23,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 16:48:23,910 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2021-01-06 16:48:23,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:48:23,910 INFO L225 Difference]: With dead ends: 103 [2021-01-06 16:48:23,910 INFO L226 Difference]: Without dead ends: 54 [2021-01-06 16:48:23,911 INFO L677 BasicCegarLoop]: 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 [2021-01-06 16:48:23,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2021-01-06 16:48:23,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2021-01-06 16:48:23,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2021-01-06 16:48:23,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2021-01-06 16:48:23,913 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 18 [2021-01-06 16:48:23,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:48:23,913 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2021-01-06 16:48:23,913 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 16:48:23,914 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2021-01-06 16:48:23,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-01-06 16:48:23,914 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:48:23,915 INFO L422 BasicCegarLoop]: 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] [2021-01-06 16:48:23,915 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 16:48:23,915 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:48:23,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:48:23,916 INFO L82 PathProgramCache]: Analyzing trace with hash 892497877, now seen corresponding path program 1 times [2021-01-06 16:48:23,916 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:48:23,916 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711980966] [2021-01-06 16:48:23,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:48:23,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:48:24,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:48:24,051 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711980966] [2021-01-06 16:48:24,054 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:48:24,054 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-01-06 16:48:24,055 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006806514] [2021-01-06 16:48:24,055 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-01-06 16:48:24,056 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:48:24,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-01-06 16:48:24,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2021-01-06 16:48:24,058 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 13 states. [2021-01-06 16:48:24,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:48:24,190 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2021-01-06 16:48:24,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-01-06 16:48:24,191 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 44 [2021-01-06 16:48:24,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:48:24,192 INFO L225 Difference]: With dead ends: 54 [2021-01-06 16:48:24,192 INFO L226 Difference]: Without dead ends: 52 [2021-01-06 16:48:24,193 INFO L677 BasicCegarLoop]: 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 [2021-01-06 16:48:24,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2021-01-06 16:48:24,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2021-01-06 16:48:24,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2021-01-06 16:48:24,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2021-01-06 16:48:24,196 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 44 [2021-01-06 16:48:24,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:48:24,196 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2021-01-06 16:48:24,196 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2021-01-06 16:48:24,196 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2021-01-06 16:48:24,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-01-06 16:48:24,197 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:48:24,197 INFO L422 BasicCegarLoop]: 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] [2021-01-06 16:48:24,197 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 16:48:24,197 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:48:24,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:48:24,198 INFO L82 PathProgramCache]: Analyzing trace with hash 892513765, now seen corresponding path program 1 times [2021-01-06 16:48:24,198 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:48:24,198 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661952108] [2021-01-06 16:48:24,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:48:24,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:48:24,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:48:24,346 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661952108] [2021-01-06 16:48:24,346 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:48:24,346 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-01-06 16:48:24,347 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210829820] [2021-01-06 16:48:24,347 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-01-06 16:48:24,347 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:48:24,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-01-06 16:48:24,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2021-01-06 16:48:24,348 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 13 states. [2021-01-06 16:48:24,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:48:24,496 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2021-01-06 16:48:24,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-01-06 16:48:24,496 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 44 [2021-01-06 16:48:24,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:48:24,497 INFO L225 Difference]: With dead ends: 59 [2021-01-06 16:48:24,497 INFO L226 Difference]: Without dead ends: 57 [2021-01-06 16:48:24,498 INFO L677 BasicCegarLoop]: 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 [2021-01-06 16:48:24,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2021-01-06 16:48:24,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 50. [2021-01-06 16:48:24,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2021-01-06 16:48:24,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2021-01-06 16:48:24,500 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 44 [2021-01-06 16:48:24,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:48:24,500 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2021-01-06 16:48:24,501 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2021-01-06 16:48:24,501 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2021-01-06 16:48:24,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-01-06 16:48:24,501 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:48:24,501 INFO L422 BasicCegarLoop]: 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] [2021-01-06 16:48:24,502 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 16:48:24,502 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:48:24,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:48:24,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1897634854, now seen corresponding path program 1 times [2021-01-06 16:48:24,502 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:48:24,503 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92924266] [2021-01-06 16:48:24,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:48:24,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:48:24,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:48:24,645 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92924266] [2021-01-06 16:48:24,645 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:48:24,645 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 16:48:24,646 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442770283] [2021-01-06 16:48:24,648 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 16:48:24,648 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:48:24,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 16:48:24,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-01-06 16:48:24,649 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 7 states. [2021-01-06 16:48:24,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:48:24,753 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2021-01-06 16:48:24,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 16:48:24,754 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2021-01-06 16:48:24,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:48:24,754 INFO L225 Difference]: With dead ends: 50 [2021-01-06 16:48:24,754 INFO L226 Difference]: Without dead ends: 46 [2021-01-06 16:48:24,758 INFO L677 BasicCegarLoop]: 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 [2021-01-06 16:48:24,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2021-01-06 16:48:24,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2021-01-06 16:48:24,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2021-01-06 16:48:24,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2021-01-06 16:48:24,760 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 45 [2021-01-06 16:48:24,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:48:24,760 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2021-01-06 16:48:24,760 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 16:48:24,760 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2021-01-06 16:48:24,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-01-06 16:48:24,761 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:48:24,761 INFO L422 BasicCegarLoop]: 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] [2021-01-06 16:48:24,762 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 16:48:24,762 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:48:24,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:48:24,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1898127398, now seen corresponding path program 1 times [2021-01-06 16:48:24,763 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:48:24,763 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788455408] [2021-01-06 16:48:24,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:48:24,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:48:24,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:48:24,917 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788455408] [2021-01-06 16:48:24,917 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:48:24,918 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 16:48:24,918 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065923225] [2021-01-06 16:48:24,919 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 16:48:24,920 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:48:24,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 16:48:24,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-01-06 16:48:24,921 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 7 states. [2021-01-06 16:48:25,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:48:25,032 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2021-01-06 16:48:25,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 16:48:25,033 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2021-01-06 16:48:25,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:48:25,033 INFO L225 Difference]: With dead ends: 50 [2021-01-06 16:48:25,033 INFO L226 Difference]: Without dead ends: 0 [2021-01-06 16:48:25,037 INFO L677 BasicCegarLoop]: 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 [2021-01-06 16:48:25,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-01-06 16:48:25,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-01-06 16:48:25,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-01-06 16:48:25,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-01-06 16:48:25,038 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2021-01-06 16:48:25,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:48:25,038 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-01-06 16:48:25,038 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 16:48:25,039 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-01-06 16:48:25,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-01-06 16:48:25,039 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 16:48:25,041 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-01-06 16:48:25,211 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 48) no Hoare annotation was computed. [2021-01-06 16:48:25,211 INFO L189 CegarLoopUtils]: For program point L217(lines 217 229) no Hoare annotation was computed. [2021-01-06 16:48:25,211 INFO L189 CegarLoopUtils]: For program point L597(lines 597 969) no Hoare annotation was computed. [2021-01-06 16:48:25,211 INFO L189 CegarLoopUtils]: For program point L366(lines 366 991) no Hoare annotation was computed. [2021-01-06 16:48:25,211 INFO L189 CegarLoopUtils]: For program point L267(lines 267 275) no Hoare annotation was computed. [2021-01-06 16:48:25,211 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 883) no Hoare annotation was computed. [2021-01-06 16:48:25,211 INFO L189 CegarLoopUtils]: For program point L581(lines 581 971) no Hoare annotation was computed. [2021-01-06 16:48:25,212 INFO L189 CegarLoopUtils]: For program point L36(line 36) no Hoare annotation was computed. [2021-01-06 16:48:25,212 INFO L189 CegarLoopUtils]: For program point L895(line 895) no Hoare annotation was computed. [2021-01-06 16:48:25,212 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-01-06 16:48:25,212 INFO L189 CegarLoopUtils]: For program point L317(lines 317 994) no Hoare annotation was computed. [2021-01-06 16:48:25,212 INFO L189 CegarLoopUtils]: For program point L185(line 185) no Hoare annotation was computed. [2021-01-06 16:48:25,212 INFO L189 CegarLoopUtils]: For program point L400(lines 400 424) no Hoare annotation was computed. [2021-01-06 16:48:25,213 INFO L189 CegarLoopUtils]: For program point L136(lines 136 242) no Hoare annotation was computed. [2021-01-06 16:48:25,213 INFO L189 CegarLoopUtils]: For program point L103(lines 103 125) no Hoare annotation was computed. [2021-01-06 16:48:25,213 INFO L189 CegarLoopUtils]: For program point L615(lines 615 626) no Hoare annotation was computed. [2021-01-06 16:48:25,213 INFO L189 CegarLoopUtils]: For program point L929(lines 929 941) no Hoare annotation was computed. [2021-01-06 16:48:25,213 INFO L189 CegarLoopUtils]: For program point L219(line 219) no Hoare annotation was computed. [2021-01-06 16:48:25,213 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 269) no Hoare annotation was computed. [2021-01-06 16:48:25,214 INFO L189 CegarLoopUtils]: For program point L665(lines 665 963) no Hoare annotation was computed. [2021-01-06 16:48:25,214 INFO L189 CegarLoopUtils]: For program point L434(lines 434 985) no Hoare annotation was computed. [2021-01-06 16:48:25,214 INFO L189 CegarLoopUtils]: For program point L269(line 269) no Hoare annotation was computed. [2021-01-06 16:48:25,214 INFO L189 CegarLoopUtils]: For program point L649(lines 649 965) no Hoare annotation was computed. [2021-01-06 16:48:25,214 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 173) no Hoare annotation was computed. [2021-01-06 16:48:25,214 INFO L189 CegarLoopUtils]: For program point L385(lines 385 988) no Hoare annotation was computed. [2021-01-06 16:48:25,214 INFO L189 CegarLoopUtils]: For program point L22(lines 22 1005) no Hoare annotation was computed. [2021-01-06 16:48:25,215 INFO L189 CegarLoopUtils]: For program point L468(lines 468 492) no Hoare annotation was computed. [2021-01-06 16:48:25,215 INFO L189 CegarLoopUtils]: For program point L881(lines 881 907) no Hoare annotation was computed. [2021-01-06 16:48:25,216 INFO L189 CegarLoopUtils]: For program point L171(lines 171 193) no Hoare annotation was computed. [2021-01-06 16:48:25,216 INFO L189 CegarLoopUtils]: For program point L683(lines 683 694) no Hoare annotation was computed. [2021-01-06 16:48:25,216 INFO L189 CegarLoopUtils]: For program point L105(line 105) no Hoare annotation was computed. [2021-01-06 16:48:25,216 INFO L189 CegarLoopUtils]: For program point L72(lines 72 288) no Hoare annotation was computed. [2021-01-06 16:48:25,216 INFO L189 CegarLoopUtils]: For program point L931(line 931) no Hoare annotation was computed. [2021-01-06 16:48:25,216 INFO L189 CegarLoopUtils]: For program point L733(lines 733 957) no Hoare annotation was computed. [2021-01-06 16:48:25,216 INFO L189 CegarLoopUtils]: For program point L155(lines 155 234) no Hoare annotation was computed. [2021-01-06 16:48:25,217 INFO L189 CegarLoopUtils]: For program point L502(lines 502 979) no Hoare annotation was computed. [2021-01-06 16:48:25,217 INFO L189 CegarLoopUtils]: For program point L205(lines 205 231) no Hoare annotation was computed. [2021-01-06 16:48:25,217 INFO L189 CegarLoopUtils]: For program point L717(lines 717 959) no Hoare annotation was computed. [2021-01-06 16:48:25,217 INFO L189 CegarLoopUtils]: For program point L453(lines 453 982) no Hoare annotation was computed. [2021-01-06 16:48:25,219 INFO L192 CegarLoopUtils]: At program point L932(lines 17 1006) the Hoare annotation is: true [2021-01-06 16:48:25,219 INFO L189 CegarLoopUtils]: For program point L866(lines 866 946) no Hoare annotation was computed. [2021-01-06 16:48:25,219 INFO L189 CegarLoopUtils]: For program point L255(lines 255 277) no Hoare annotation was computed. [2021-01-06 16:48:25,219 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 207) no Hoare annotation was computed. [2021-01-06 16:48:25,219 INFO L189 CegarLoopUtils]: For program point L536(lines 536 560) no Hoare annotation was computed. [2021-01-06 16:48:25,219 INFO L189 CegarLoopUtils]: For program point L883(line 883) no Hoare annotation was computed. [2021-01-06 16:48:25,219 INFO L189 CegarLoopUtils]: For program point L751(lines 751 762) no Hoare annotation was computed. [2021-01-06 16:48:25,219 INFO L189 CegarLoopUtils]: For program point L173(line 173) no Hoare annotation was computed. [2021-01-06 16:48:25,219 INFO L189 CegarLoopUtils]: For program point L801(lines 801 951) no Hoare annotation was computed. [2021-01-06 16:48:25,220 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-01-06 16:48:25,220 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 185) no Hoare annotation was computed. [2021-01-06 16:48:25,220 INFO L189 CegarLoopUtils]: For program point L157(line 157) no Hoare annotation was computed. [2021-01-06 16:48:25,220 INFO L189 CegarLoopUtils]: For program point L570(lines 570 973) no Hoare annotation was computed. [2021-01-06 16:48:25,220 INFO L189 CegarLoopUtils]: For program point L917(lines 917 943) no Hoare annotation was computed. [2021-01-06 16:48:25,220 INFO L189 CegarLoopUtils]: For program point L785(lines 785 953) no Hoare annotation was computed. [2021-01-06 16:48:25,220 INFO L189 CegarLoopUtils]: For program point L207(line 207) no Hoare annotation was computed. [2021-01-06 16:48:25,220 INFO L189 CegarLoopUtils]: For program point L521(lines 521 976) no Hoare annotation was computed. [2021-01-06 16:48:25,220 INFO L185 CegarLoopUtils]: At program point L868(lines 26 1000) the Hoare annotation is: (and (<= 0 ULTIMATE.start_main_~main__t~0) (<= ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0)) [2021-01-06 16:48:25,221 INFO L189 CegarLoopUtils]: For program point L257(line 257) no Hoare annotation was computed. [2021-01-06 16:48:25,221 INFO L189 CegarLoopUtils]: For program point L604(lines 604 628) no Hoare annotation was computed. [2021-01-06 16:48:25,221 INFO L189 CegarLoopUtils]: For program point L26(lines 26 1000) no Hoare annotation was computed. [2021-01-06 16:48:25,221 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 105) no Hoare annotation was computed. [2021-01-06 16:48:25,221 INFO L189 CegarLoopUtils]: For program point L819(lines 819 830) no Hoare annotation was computed. [2021-01-06 16:48:25,221 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 895) no Hoare annotation was computed. [2021-01-06 16:48:25,221 INFO L189 CegarLoopUtils]: For program point L638(lines 638 967) no Hoare annotation was computed. [2021-01-06 16:48:25,221 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 219) no Hoare annotation was computed. [2021-01-06 16:48:25,221 INFO L189 CegarLoopUtils]: For program point L919(line 919) no Hoare annotation was computed. [2021-01-06 16:48:25,221 INFO L189 CegarLoopUtils]: For program point L853(lines 853 947) no Hoare annotation was computed. [2021-01-06 16:48:25,222 INFO L189 CegarLoopUtils]: For program point L143(lines 143 236) no Hoare annotation was computed. [2021-01-06 16:48:25,222 INFO L189 CegarLoopUtils]: For program point L589(lines 589 970) no Hoare annotation was computed. [2021-01-06 16:48:25,222 INFO L189 CegarLoopUtils]: For program point L325(lines 325 993) no Hoare annotation was computed. [2021-01-06 16:48:25,223 INFO L189 CegarLoopUtils]: For program point L672(lines 672 696) no Hoare annotation was computed. [2021-01-06 16:48:25,223 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 145) no Hoare annotation was computed. [2021-01-06 16:48:25,223 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-01-06 16:48:25,223 INFO L189 CegarLoopUtils]: For program point L309(lines 309 995) no Hoare annotation was computed. [2021-01-06 16:48:25,223 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 931) no Hoare annotation was computed. [2021-01-06 16:48:25,223 INFO L185 CegarLoopUtils]: At program point L904(lines 65 999) the Hoare annotation is: (and (<= 1 ULTIMATE.start_main_~main__t~0) (<= ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0)) [2021-01-06 16:48:25,223 INFO L189 CegarLoopUtils]: For program point L706(lines 706 961) no Hoare annotation was computed. [2021-01-06 16:48:25,223 INFO L189 CegarLoopUtils]: For program point L343(lines 343 354) no Hoare annotation was computed. [2021-01-06 16:48:25,223 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 117) no Hoare annotation was computed. [2021-01-06 16:48:25,224 INFO L189 CegarLoopUtils]: For program point L145(line 145) no Hoare annotation was computed. [2021-01-06 16:48:25,224 INFO L189 CegarLoopUtils]: For program point L657(lines 657 964) no Hoare annotation was computed. [2021-01-06 16:48:25,224 INFO L189 CegarLoopUtils]: For program point L46(lines 46 56) no Hoare annotation was computed. [2021-01-06 16:48:25,224 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 919) no Hoare annotation was computed. [2021-01-06 16:48:25,224 INFO L192 CegarLoopUtils]: At program point L1004(lines 22 1005) the Hoare annotation is: true [2021-01-06 16:48:25,224 INFO L189 CegarLoopUtils]: For program point L393(lines 393 987) no Hoare annotation was computed. [2021-01-06 16:48:25,224 INFO L189 CegarLoopUtils]: For program point L740(lines 740 764) no Hoare annotation was computed. [2021-01-06 16:48:25,224 INFO L189 CegarLoopUtils]: For program point L96(lines 96 285) no Hoare annotation was computed. [2021-01-06 16:48:25,224 INFO L189 CegarLoopUtils]: For program point L377(lines 377 989) no Hoare annotation was computed. [2021-01-06 16:48:25,224 INFO L189 CegarLoopUtils]: For program point L774(lines 774 955) no Hoare annotation was computed. [2021-01-06 16:48:25,225 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 157) no Hoare annotation was computed. [2021-01-06 16:48:25,225 INFO L189 CegarLoopUtils]: For program point L411(lines 411 422) no Hoare annotation was computed. [2021-01-06 16:48:25,225 INFO L189 CegarLoopUtils]: For program point L725(lines 725 958) no Hoare annotation was computed. [2021-01-06 16:48:25,225 INFO L189 CegarLoopUtils]: For program point L48(line 48) no Hoare annotation was computed. [2021-01-06 16:48:25,225 INFO L189 CegarLoopUtils]: For program point L461(lines 461 981) no Hoare annotation was computed. [2021-01-06 16:48:25,225 INFO L185 CegarLoopUtils]: At program point L940(lines 858 947) the Hoare annotation is: (and (<= 9 ULTIMATE.start_main_~main__t~0) (<= ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0)) [2021-01-06 16:48:25,225 INFO L189 CegarLoopUtils]: For program point L874(lines 874 945) no Hoare annotation was computed. [2021-01-06 16:48:25,225 INFO L189 CegarLoopUtils]: For program point L808(lines 808 832) no Hoare annotation was computed. [2021-01-06 16:48:25,225 INFO L189 CegarLoopUtils]: For program point L164(lines 164 233) no Hoare annotation was computed. [2021-01-06 16:48:25,225 INFO L189 CegarLoopUtils]: For program point L65(lines 65 999) no Hoare annotation was computed. [2021-01-06 16:48:25,226 INFO L189 CegarLoopUtils]: For program point L-1(line -1) no Hoare annotation was computed. [2021-01-06 16:48:25,226 INFO L189 CegarLoopUtils]: For program point L445(lines 445 983) no Hoare annotation was computed. [2021-01-06 16:48:25,226 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 36) no Hoare annotation was computed. [2021-01-06 16:48:25,226 INFO L189 CegarLoopUtils]: For program point L115(lines 115 123) no Hoare annotation was computed. [2021-01-06 16:48:25,226 INFO L189 CegarLoopUtils]: For program point L842(lines 842 949) no Hoare annotation was computed. [2021-01-06 16:48:25,226 INFO L189 CegarLoopUtils]: For program point L132(lines 132 284) no Hoare annotation was computed. [2021-01-06 16:48:25,226 INFO L189 CegarLoopUtils]: For program point L479(lines 479 490) no Hoare annotation was computed. [2021-01-06 16:48:25,227 INFO L189 CegarLoopUtils]: For program point L793(lines 793 952) no Hoare annotation was computed. [2021-01-06 16:48:25,227 INFO L189 CegarLoopUtils]: For program point L248(lines 248 283) no Hoare annotation was computed. [2021-01-06 16:48:25,227 INFO L189 CegarLoopUtils]: For program point L83(lines 83 286) no Hoare annotation was computed. [2021-01-06 16:48:25,227 INFO L189 CegarLoopUtils]: For program point L529(lines 529 975) no Hoare annotation was computed. [2021-01-06 16:48:25,227 INFO L189 CegarLoopUtils]: For program point L298(lines 298 997) no Hoare annotation was computed. [2021-01-06 16:48:25,227 INFO L189 CegarLoopUtils]: For program point L34(lines 34 58) no Hoare annotation was computed. [2021-01-06 16:48:25,228 INFO L189 CegarLoopUtils]: For program point L513(lines 513 977) no Hoare annotation was computed. [2021-01-06 16:48:25,228 INFO L189 CegarLoopUtils]: For program point L893(lines 893 905) no Hoare annotation was computed. [2021-01-06 16:48:25,228 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 257) no Hoare annotation was computed. [2021-01-06 16:48:25,228 INFO L185 CegarLoopUtils]: At program point L282(lines 132 284) the Hoare annotation is: (and (< ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) (<= 1 ULTIMATE.start_main_~main__t~0)) [2021-01-06 16:48:25,228 INFO L189 CegarLoopUtils]: For program point L183(lines 183 191) no Hoare annotation was computed. [2021-01-06 16:48:25,228 INFO L189 CegarLoopUtils]: For program point L117(line 117) no Hoare annotation was computed. [2021-01-06 16:48:25,228 INFO L189 CegarLoopUtils]: For program point L332(lines 332 356) no Hoare annotation was computed. [2021-01-06 16:48:25,228 INFO L189 CegarLoopUtils]: For program point L547(lines 547 558) no Hoare annotation was computed. [2021-01-06 16:48:25,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.01 04:48:25 BoogieIcfgContainer [2021-01-06 16:48:25,251 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-01-06 16:48:25,252 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-01-06 16:48:25,252 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-01-06 16:48:25,252 INFO L275 PluginConnector]: Witness Printer initialized [2021-01-06 16:48:25,253 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 04:48:18" (3/4) ... [2021-01-06 16:48:25,256 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-01-06 16:48:25,284 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-01-06 16:48:25,285 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-01-06 16:48:25,286 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-01-06 16:48:25,287 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-01-06 16:48:25,434 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c-witness.graphml [2021-01-06 16:48:25,435 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-01-06 16:48:25,436 INFO L168 Benchmark]: Toolchain (without parser) took 8621.23 ms. Allocated memory was 172.0 MB in the beginning and 248.5 MB in the end (delta: 76.5 MB). Free memory was 146.7 MB in the beginning and 227.0 MB in the end (delta: -80.3 MB). Peak memory consumption was 138.1 MB. Max. memory is 8.0 GB. [2021-01-06 16:48:25,437 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 172.0 MB. Free memory is still 143.1 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 16:48:25,437 INFO L168 Benchmark]: CACSL2BoogieTranslator took 629.51 ms. Allocated memory is still 172.0 MB. Free memory was 146.5 MB in the beginning and 123.7 MB in the end (delta: 22.8 MB). Peak memory consumption was 23.1 MB. Max. memory is 8.0 GB. [2021-01-06 16:48:25,438 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.84 ms. Allocated memory is still 172.0 MB. Free memory was 123.7 MB in the beginning and 120.5 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-01-06 16:48:25,438 INFO L168 Benchmark]: Boogie Preprocessor took 45.46 ms. Allocated memory is still 172.0 MB. Free memory was 120.5 MB in the beginning and 118.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-01-06 16:48:25,438 INFO L168 Benchmark]: RCFGBuilder took 1096.14 ms. Allocated memory is still 172.0 MB. Free memory was 118.3 MB in the beginning and 104.9 MB in the end (delta: 13.3 MB). Peak memory consumption was 12.7 MB. Max. memory is 8.0 GB. [2021-01-06 16:48:25,439 INFO L168 Benchmark]: TraceAbstraction took 6582.99 ms. Allocated memory was 172.0 MB in the beginning and 248.5 MB in the end (delta: 76.5 MB). Free memory was 104.4 MB in the beginning and 97.5 MB in the end (delta: 6.9 MB). Peak memory consumption was 84.5 MB. Max. memory is 8.0 GB. [2021-01-06 16:48:25,439 INFO L168 Benchmark]: Witness Printer took 182.69 ms. Allocated memory is still 248.5 MB. Free memory was 97.5 MB in the beginning and 227.0 MB in the end (delta: -129.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 8.0 GB. [2021-01-06 16:48:25,441 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.19 ms. Allocated memory is still 172.0 MB. Free memory is still 143.1 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 629.51 ms. Allocated memory is still 172.0 MB. Free memory was 146.5 MB in the beginning and 123.7 MB in the end (delta: 22.8 MB). Peak memory consumption was 23.1 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 75.84 ms. Allocated memory is still 172.0 MB. Free memory was 123.7 MB in the beginning and 120.5 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 45.46 ms. Allocated memory is still 172.0 MB. Free memory was 120.5 MB in the beginning and 118.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1096.14 ms. Allocated memory is still 172.0 MB. Free memory was 118.3 MB in the beginning and 104.9 MB in the end (delta: 13.3 MB). Peak memory consumption was 12.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 6582.99 ms. Allocated memory was 172.0 MB in the beginning and 248.5 MB in the end (delta: 76.5 MB). Free memory was 104.4 MB in the beginning and 97.5 MB in the end (delta: 6.9 MB). Peak memory consumption was 84.5 MB. Max. memory is 8.0 GB. * Witness Printer took 182.69 ms. Allocated memory is still 248.5 MB. Free memory was 97.5 MB in the beginning and 227.0 MB in the end (delta: -129.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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: 207]: 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: 931]: 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: 36]: 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: 883]: 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: 257]: 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: 895]: 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: 219]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: 0 <= main__t && main__t <= main__tagbuf_len - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: main__t < main__tagbuf_len && 1 <= main__t - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: 1 <= main__t && main__t <= main__tagbuf_len - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 858]: Loop Invariant Derived loop invariant: 9 <= main__t && main__t <= main__tagbuf_len - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 120 locations, 16 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 6.2s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1038 SDtfs, 1861 SDslu, 1369 SDs, 0 SdLazy, 3328 SolverSat, 407 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 175 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=0, 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, 30 HoareAnnotationTreeSize, 6 FomulaSimplifications, 4032 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 325 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 386 NumberOfCodeBlocks, 386 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 367 ConstructedInterpolants, 0 QuantifiedInterpolants, 31849 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 RESULT: Ultimate proved your program to be correct! Received shutdown request...