/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-escape-absolute.i.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 16:48:03,151 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 16:48:03,153 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 16:48:03,186 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 16:48:03,187 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 16:48:03,188 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 16:48:03,190 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 16:48:03,192 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 16:48:03,194 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 16:48:03,196 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 16:48:03,197 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 16:48:03,198 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 16:48:03,199 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 16:48:03,200 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 16:48:03,202 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 16:48:03,203 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 16:48:03,204 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 16:48:03,205 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 16:48:03,207 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 16:48:03,210 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 16:48:03,212 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 16:48:03,227 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 16:48:03,229 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 16:48:03,230 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 16:48:03,239 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 16:48:03,239 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 16:48:03,239 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 16:48:03,244 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 16:48:03,244 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 16:48:03,245 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 16:48:03,246 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 16:48:03,247 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 16:48:03,248 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 16:48:03,252 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 16:48:03,254 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 16:48:03,254 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 16:48:03,256 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 16:48:03,256 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 16:48:03,256 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 16:48:03,261 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 16:48:03,262 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 16:48:03,262 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:03,308 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 16:48:03,308 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 16:48:03,312 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 16:48:03,313 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 16:48:03,313 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 16:48:03,314 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 16:48:03,314 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 16:48:03,314 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 16:48:03,314 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 16:48:03,314 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 16:48:03,316 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 16:48:03,316 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 16:48:03,316 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 16:48:03,316 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 16:48:03,317 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 16:48:03,317 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 16:48:03,317 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 16:48:03,317 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 16:48:03,318 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 16:48:03,318 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 16:48:03,318 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 16:48:03,318 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 16:48:03,319 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 16:48:03,319 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 16:48:03,319 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 16:48:03,319 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:03,740 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 16:48:03,772 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 16:48:03,776 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 16:48:03,777 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 16:48:03,778 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 16:48:03,779 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2021-01-06 16:48:03,861 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/75d6cde67/d7002603a43740518a546d17dfb010db/FLAGe1a2b854a [2021-01-06 16:48:04,446 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 16:48:04,446 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2021-01-06 16:48:04,461 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/75d6cde67/d7002603a43740518a546d17dfb010db/FLAGe1a2b854a [2021-01-06 16:48:04,823 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/75d6cde67/d7002603a43740518a546d17dfb010db [2021-01-06 16:48:04,826 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 16:48:04,829 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 16:48:04,833 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 16:48:04,833 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 16:48:04,838 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 16:48:04,839 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 04:48:04" (1/1) ... [2021-01-06 16:48:04,842 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37f78fe5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:48:04, skipping insertion in model container [2021-01-06 16:48:04,842 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 04:48:04" (1/1) ... [2021-01-06 16:48:04,850 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 16:48:04,910 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: lhs: VariableLHS[~main__urilen~0,] left hand side expression in assignment: lhs: VariableLHS[~main__tokenlen~0,] left hand side expression in assignment: lhs: VariableLHS[~main__scheme~0,] left hand side expression in assignment: lhs: VariableLHS[~main__cp~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:05,100 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-escape-absolute.i.v+cfa-reducer.c[1551,1564] 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:05,104 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-escape-absolute.i.v+cfa-reducer.c[1758,1771] 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,] [2021-01-06 16:48:05,107 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-escape-absolute.i.v+cfa-reducer.c[2095,2108] left hand side expression in assignment: lhs: VariableLHS[~__tmp_4~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~3,] [2021-01-06 16:48:05,109 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-escape-absolute.i.v+cfa-reducer.c[2296,2309] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_1~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:05,112 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-escape-absolute.i.v+cfa-reducer.c[2701,2714] 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:05,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-escape-absolute.i.v+cfa-reducer.c[2902,2915] left hand side expression in assignment: lhs: VariableLHS[~__return_375~0,GLOBAL] 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:05,117 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-escape-absolute.i.v+cfa-reducer.c[3228,3241] 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:05,120 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-escape-absolute.i.v+cfa-reducer.c[3435,3448] left hand side expression in assignment: lhs: VariableLHS[~main__cp~0,] left hand side expression in assignment: lhs: VariableLHS[~main__scheme~0,] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_2~0,] left hand side expression in assignment: lhs: VariableLHS[~main__c~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:05,123 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-escape-absolute.i.v+cfa-reducer.c[3914,3927] 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:05,126 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-escape-absolute.i.v+cfa-reducer.c[4118,4131] 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:05,128 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-escape-absolute.i.v+cfa-reducer.c[4426,4439] 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:05,130 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-escape-absolute.i.v+cfa-reducer.c[4630,4643] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_3~0,] left hand side expression in assignment: lhs: VariableLHS[~main__c~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:05,133 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-escape-absolute.i.v+cfa-reducer.c[4995,5008] 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:05,136 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-escape-absolute.i.v+cfa-reducer.c[5198,5211] left hand side expression in assignment: lhs: VariableLHS[~__tmp_15~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~14,] [2021-01-06 16:48:05,138 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-escape-absolute.i.v+cfa-reducer.c[5412,5425] left hand side expression in assignment: lhs: VariableLHS[~__tmp_16~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~15,] [2021-01-06 16:48:05,140 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-escape-absolute.i.v+cfa-reducer.c[5616,5629] left hand side expression in assignment: lhs: VariableLHS[~main__cp~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_17~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~16,] [2021-01-06 16:48:05,144 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-escape-absolute.i.v+cfa-reducer.c[6138,6151] left hand side expression in assignment: lhs: VariableLHS[~__tmp_18~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~17,] [2021-01-06 16:48:05,146 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-escape-absolute.i.v+cfa-reducer.c[6342,6355] left hand side expression in assignment: lhs: VariableLHS[~main__cp~0,] [2021-01-06 16:48:05,149 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 16:48:05,158 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: lhs: VariableLHS[~main__urilen~0,] left hand side expression in assignment: lhs: VariableLHS[~main__tokenlen~0,] left hand side expression in assignment: lhs: VariableLHS[~main__scheme~0,] left hand side expression in assignment: lhs: VariableLHS[~main__cp~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:05,178 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-escape-absolute.i.v+cfa-reducer.c[1551,1564] 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:05,180 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-escape-absolute.i.v+cfa-reducer.c[1758,1771] 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,] [2021-01-06 16:48:05,182 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-escape-absolute.i.v+cfa-reducer.c[2095,2108] left hand side expression in assignment: lhs: VariableLHS[~__tmp_4~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~3,] [2021-01-06 16:48:05,183 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-escape-absolute.i.v+cfa-reducer.c[2296,2309] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_1~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:05,186 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-escape-absolute.i.v+cfa-reducer.c[2701,2714] 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:05,187 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-escape-absolute.i.v+cfa-reducer.c[2902,2915] left hand side expression in assignment: lhs: VariableLHS[~__return_375~0,GLOBAL] 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:05,190 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-escape-absolute.i.v+cfa-reducer.c[3228,3241] 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:05,192 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-escape-absolute.i.v+cfa-reducer.c[3435,3448] left hand side expression in assignment: lhs: VariableLHS[~main__cp~0,] left hand side expression in assignment: lhs: VariableLHS[~main__scheme~0,] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_2~0,] left hand side expression in assignment: lhs: VariableLHS[~main__c~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:05,195 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-escape-absolute.i.v+cfa-reducer.c[3914,3927] 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:05,197 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-escape-absolute.i.v+cfa-reducer.c[4118,4131] 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:05,199 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-escape-absolute.i.v+cfa-reducer.c[4426,4439] 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:05,201 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-escape-absolute.i.v+cfa-reducer.c[4630,4643] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_3~0,] left hand side expression in assignment: lhs: VariableLHS[~main__c~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:05,204 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-escape-absolute.i.v+cfa-reducer.c[4995,5008] 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:05,206 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-escape-absolute.i.v+cfa-reducer.c[5198,5211] left hand side expression in assignment: lhs: VariableLHS[~__tmp_15~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~14,] [2021-01-06 16:48:05,211 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-escape-absolute.i.v+cfa-reducer.c[5412,5425] left hand side expression in assignment: lhs: VariableLHS[~__tmp_16~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~15,] [2021-01-06 16:48:05,213 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-escape-absolute.i.v+cfa-reducer.c[5616,5629] left hand side expression in assignment: lhs: VariableLHS[~main__cp~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_17~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~16,] [2021-01-06 16:48:05,220 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-escape-absolute.i.v+cfa-reducer.c[6138,6151] left hand side expression in assignment: lhs: VariableLHS[~__tmp_18~0,] left hand side expression in assignment: lhs: VariableLHS[~__VERIFIER_assert__cond~17,] [2021-01-06 16:48:05,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-escape-absolute.i.v+cfa-reducer.c[6342,6355] left hand side expression in assignment: lhs: VariableLHS[~main__cp~0,] [2021-01-06 16:48:05,230 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 16:48:05,259 INFO L208 MainTranslator]: Completed translation [2021-01-06 16:48:05,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:48:05 WrapperNode [2021-01-06 16:48:05,261 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 16:48:05,262 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 16:48:05,263 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 16:48:05,263 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 16:48:05,272 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:05" (1/1) ... [2021-01-06 16:48:05,281 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:05" (1/1) ... [2021-01-06 16:48:05,312 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 16:48:05,313 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 16:48:05,313 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 16:48:05,313 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 16:48:05,322 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:05" (1/1) ... [2021-01-06 16:48:05,322 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:05" (1/1) ... [2021-01-06 16:48:05,325 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:05" (1/1) ... [2021-01-06 16:48:05,326 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:05" (1/1) ... [2021-01-06 16:48:05,336 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:05" (1/1) ... [2021-01-06 16:48:05,344 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:05" (1/1) ... [2021-01-06 16:48:05,350 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:05" (1/1) ... [2021-01-06 16:48:05,357 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 16:48:05,359 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 16:48:05,360 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 16:48:05,360 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 16:48:05,361 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:48:05" (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:05,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 16:48:05,456 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 16:48:05,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 16:48:05,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 16:48:06,036 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 16:48:06,037 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-01-06 16:48:06,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 04:48:06 BoogieIcfgContainer [2021-01-06 16:48:06,039 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 16:48:06,041 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 16:48:06,042 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 16:48:06,046 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 16:48:06,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 04:48:04" (1/3) ... [2021-01-06 16:48:06,049 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56b05252 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 04:48:06, skipping insertion in model container [2021-01-06 16:48:06,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:48:05" (2/3) ... [2021-01-06 16:48:06,049 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56b05252 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 04:48:06, skipping insertion in model container [2021-01-06 16:48:06,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 04:48:06" (3/3) ... [2021-01-06 16:48:06,051 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i.v+cfa-reducer.c [2021-01-06 16:48:06,058 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 16:48:06,063 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2021-01-06 16:48:06,083 INFO L253 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2021-01-06 16:48:06,126 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 16:48:06,126 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 16:48:06,126 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 16:48:06,127 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 16:48:06,128 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 16:48:06,128 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 16:48:06,128 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 16:48:06,128 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 16:48:06,158 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2021-01-06 16:48:06,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-01-06 16:48:06,164 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:48:06,165 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:06,166 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_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:06,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:48:06,173 INFO L82 PathProgramCache]: Analyzing trace with hash -2034435078, now seen corresponding path program 1 times [2021-01-06 16:48:06,184 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:48:06,186 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67787417] [2021-01-06 16:48:06,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:48:06,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:48:06,411 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:06,411 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67787417] [2021-01-06 16:48:06,412 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:48:06,412 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 16:48:06,413 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276709088] [2021-01-06 16:48:06,417 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 16:48:06,418 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:48:06,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 16:48:06,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 16:48:06,435 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 3 states. [2021-01-06 16:48:06,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:48:06,465 INFO L93 Difference]: Finished difference Result 88 states and 123 transitions. [2021-01-06 16:48:06,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 16:48:06,467 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2021-01-06 16:48:06,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:48:06,477 INFO L225 Difference]: With dead ends: 88 [2021-01-06 16:48:06,477 INFO L226 Difference]: Without dead ends: 76 [2021-01-06 16:48:06,480 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 16:48:06,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-01-06 16:48:06,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2021-01-06 16:48:06,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2021-01-06 16:48:06,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2021-01-06 16:48:06,521 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 15 [2021-01-06 16:48:06,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:48:06,521 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2021-01-06 16:48:06,521 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 16:48:06,522 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2021-01-06 16:48:06,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-01-06 16:48:06,522 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:48:06,523 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:06,523 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 16:48:06,523 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_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:06,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:48:06,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1357026114, now seen corresponding path program 1 times [2021-01-06 16:48:06,524 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:48:06,525 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650411567] [2021-01-06 16:48:06,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:48:06,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:48:06,655 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:06,656 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650411567] [2021-01-06 16:48:06,656 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:48:06,660 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 16:48:06,660 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238809872] [2021-01-06 16:48:06,661 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 16:48:06,662 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:48:06,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 16:48:06,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-06 16:48:06,663 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand 6 states. [2021-01-06 16:48:06,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:48:06,805 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2021-01-06 16:48:06,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 16:48:06,806 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2021-01-06 16:48:06,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:48:06,810 INFO L225 Difference]: With dead ends: 76 [2021-01-06 16:48:06,810 INFO L226 Difference]: Without dead ends: 74 [2021-01-06 16:48:06,811 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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:06,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-01-06 16:48:06,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2021-01-06 16:48:06,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2021-01-06 16:48:06,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2021-01-06 16:48:06,829 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 16 [2021-01-06 16:48:06,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:48:06,831 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2021-01-06 16:48:06,831 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 16:48:06,831 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2021-01-06 16:48:06,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-01-06 16:48:06,833 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:48:06,833 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:06,834 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 16:48:06,834 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_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:06,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:48:06,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1567835227, now seen corresponding path program 1 times [2021-01-06 16:48:06,835 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:48:06,835 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539634957] [2021-01-06 16:48:06,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:48:06,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:48:06,927 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:06,928 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539634957] [2021-01-06 16:48:06,928 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:48:06,928 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 16:48:06,928 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036340419] [2021-01-06 16:48:06,929 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 16:48:06,929 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:48:06,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 16:48:06,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 16:48:06,930 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand 4 states. [2021-01-06 16:48:07,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:48:07,010 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2021-01-06 16:48:07,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 16:48:07,012 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2021-01-06 16:48:07,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:48:07,014 INFO L225 Difference]: With dead ends: 97 [2021-01-06 16:48:07,014 INFO L226 Difference]: Without dead ends: 95 [2021-01-06 16:48:07,014 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:07,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-01-06 16:48:07,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 72. [2021-01-06 16:48:07,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2021-01-06 16:48:07,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2021-01-06 16:48:07,031 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 18 [2021-01-06 16:48:07,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:48:07,032 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2021-01-06 16:48:07,032 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 16:48:07,033 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2021-01-06 16:48:07,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-01-06 16:48:07,034 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:48:07,034 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:48:07,034 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 16:48:07,034 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_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:07,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:48:07,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1358247672, now seen corresponding path program 1 times [2021-01-06 16:48:07,035 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:48:07,035 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414025106] [2021-01-06 16:48:07,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:48:07,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:48:07,151 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:07,152 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414025106] [2021-01-06 16:48:07,152 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:48:07,152 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 16:48:07,152 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467195406] [2021-01-06 16:48:07,153 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 16:48:07,153 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:48:07,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 16:48:07,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 16:48:07,154 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand 5 states. [2021-01-06 16:48:07,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:48:07,249 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2021-01-06 16:48:07,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 16:48:07,250 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2021-01-06 16:48:07,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:48:07,251 INFO L225 Difference]: With dead ends: 72 [2021-01-06 16:48:07,251 INFO L226 Difference]: Without dead ends: 70 [2021-01-06 16:48:07,252 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 16:48:07,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2021-01-06 16:48:07,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2021-01-06 16:48:07,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2021-01-06 16:48:07,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2021-01-06 16:48:07,260 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 19 [2021-01-06 16:48:07,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:48:07,261 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2021-01-06 16:48:07,261 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 16:48:07,261 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2021-01-06 16:48:07,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-06 16:48:07,262 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:48:07,262 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] [2021-01-06 16:48:07,262 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 16:48:07,263 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_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:07,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:48:07,263 INFO L82 PathProgramCache]: Analyzing trace with hash -665385716, now seen corresponding path program 1 times [2021-01-06 16:48:07,264 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:48:07,264 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825870282] [2021-01-06 16:48:07,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:48:07,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:48:07,381 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:07,382 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825870282] [2021-01-06 16:48:07,382 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:48:07,382 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 16:48:07,382 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555257799] [2021-01-06 16:48:07,383 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 16:48:07,383 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:48:07,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 16:48:07,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 16:48:07,385 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand 5 states. [2021-01-06 16:48:07,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:48:07,553 INFO L93 Difference]: Finished difference Result 137 states and 143 transitions. [2021-01-06 16:48:07,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 16:48:07,554 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2021-01-06 16:48:07,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:48:07,560 INFO L225 Difference]: With dead ends: 137 [2021-01-06 16:48:07,560 INFO L226 Difference]: Without dead ends: 135 [2021-01-06 16:48:07,561 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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:07,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2021-01-06 16:48:07,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 73. [2021-01-06 16:48:07,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2021-01-06 16:48:07,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2021-01-06 16:48:07,590 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 22 [2021-01-06 16:48:07,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:48:07,593 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2021-01-06 16:48:07,593 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 16:48:07,594 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2021-01-06 16:48:07,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-06 16:48:07,594 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:48:07,595 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] [2021-01-06 16:48:07,595 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 16:48:07,596 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_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:07,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:48:07,596 INFO L82 PathProgramCache]: Analyzing trace with hash -661217951, now seen corresponding path program 1 times [2021-01-06 16:48:07,597 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:48:07,597 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826504781] [2021-01-06 16:48:07,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:48:07,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:48:07,674 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:07,674 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826504781] [2021-01-06 16:48:07,674 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:48:07,675 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 16:48:07,675 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837009884] [2021-01-06 16:48:07,675 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 16:48:07,675 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:48:07,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 16:48:07,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 16:48:07,677 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand 5 states. [2021-01-06 16:48:07,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:48:07,799 INFO L93 Difference]: Finished difference Result 104 states and 110 transitions. [2021-01-06 16:48:07,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 16:48:07,800 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2021-01-06 16:48:07,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:48:07,801 INFO L225 Difference]: With dead ends: 104 [2021-01-06 16:48:07,801 INFO L226 Difference]: Without dead ends: 102 [2021-01-06 16:48:07,801 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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:07,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2021-01-06 16:48:07,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 75. [2021-01-06 16:48:07,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2021-01-06 16:48:07,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2021-01-06 16:48:07,809 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 22 [2021-01-06 16:48:07,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:48:07,809 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2021-01-06 16:48:07,809 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 16:48:07,809 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2021-01-06 16:48:07,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-01-06 16:48:07,810 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:48:07,810 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] [2021-01-06 16:48:07,811 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 16:48:07,811 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_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:07,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:48:07,812 INFO L82 PathProgramCache]: Analyzing trace with hash 847883539, now seen corresponding path program 1 times [2021-01-06 16:48:07,812 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:48:07,812 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455828099] [2021-01-06 16:48:07,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:48:07,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:48:07,860 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:07,860 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455828099] [2021-01-06 16:48:07,860 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:48:07,861 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 16:48:07,861 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438504195] [2021-01-06 16:48:07,861 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 16:48:07,862 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:48:07,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 16:48:07,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 16:48:07,863 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 5 states. [2021-01-06 16:48:07,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:48:07,962 INFO L93 Difference]: Finished difference Result 117 states and 123 transitions. [2021-01-06 16:48:07,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 16:48:07,963 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2021-01-06 16:48:07,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:48:07,964 INFO L225 Difference]: With dead ends: 117 [2021-01-06 16:48:07,964 INFO L226 Difference]: Without dead ends: 115 [2021-01-06 16:48:07,965 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 16:48:07,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-01-06 16:48:07,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 73. [2021-01-06 16:48:07,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2021-01-06 16:48:07,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2021-01-06 16:48:07,971 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 23 [2021-01-06 16:48:07,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:48:07,972 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2021-01-06 16:48:07,972 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 16:48:07,972 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2021-01-06 16:48:07,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-01-06 16:48:07,973 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:48:07,973 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] [2021-01-06 16:48:07,973 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 16:48:07,974 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_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:07,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:48:07,974 INFO L82 PathProgramCache]: Analyzing trace with hash 977084131, now seen corresponding path program 1 times [2021-01-06 16:48:07,974 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:48:07,975 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272538847] [2021-01-06 16:48:07,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:48:07,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:48:08,023 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:08,023 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272538847] [2021-01-06 16:48:08,023 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:48:08,024 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 16:48:08,024 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69922775] [2021-01-06 16:48:08,024 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 16:48:08,024 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:48:08,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 16:48:08,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 16:48:08,025 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand 5 states. [2021-01-06 16:48:08,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:48:08,128 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2021-01-06 16:48:08,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 16:48:08,129 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2021-01-06 16:48:08,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:48:08,130 INFO L225 Difference]: With dead ends: 73 [2021-01-06 16:48:08,130 INFO L226 Difference]: Without dead ends: 71 [2021-01-06 16:48:08,130 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 16:48:08,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-01-06 16:48:08,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2021-01-06 16:48:08,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2021-01-06 16:48:08,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2021-01-06 16:48:08,136 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 23 [2021-01-06 16:48:08,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:48:08,136 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2021-01-06 16:48:08,136 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 16:48:08,137 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2021-01-06 16:48:08,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-01-06 16:48:08,137 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:48:08,138 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] [2021-01-06 16:48:08,138 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 16:48:08,138 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_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:08,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:48:08,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1619855478, now seen corresponding path program 1 times [2021-01-06 16:48:08,139 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:48:08,139 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199476280] [2021-01-06 16:48:08,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:48:08,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:48:08,169 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:08,169 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199476280] [2021-01-06 16:48:08,170 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:48:08,171 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 16:48:08,171 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246810089] [2021-01-06 16:48:08,172 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 16:48:08,172 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:48:08,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 16:48:08,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 16:48:08,174 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand 3 states. [2021-01-06 16:48:08,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:48:08,235 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2021-01-06 16:48:08,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 16:48:08,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2021-01-06 16:48:08,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:48:08,240 INFO L225 Difference]: With dead ends: 111 [2021-01-06 16:48:08,240 INFO L226 Difference]: Without dead ends: 71 [2021-01-06 16:48:08,241 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 16:48:08,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-01-06 16:48:08,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2021-01-06 16:48:08,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2021-01-06 16:48:08,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2021-01-06 16:48:08,262 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 25 [2021-01-06 16:48:08,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:48:08,263 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2021-01-06 16:48:08,263 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 16:48:08,263 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2021-01-06 16:48:08,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-01-06 16:48:08,264 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:48:08,264 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 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:08,264 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 16:48:08,264 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_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:08,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:48:08,266 INFO L82 PathProgramCache]: Analyzing trace with hash 595608307, now seen corresponding path program 1 times [2021-01-06 16:48:08,267 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:48:08,267 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194718764] [2021-01-06 16:48:08,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:48:08,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:48:08,373 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-06 16:48:08,373 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194718764] [2021-01-06 16:48:08,374 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080963463] [2021-01-06 16:48:08,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:48:08,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:48:08,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2021-01-06 16:48:08,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:48:08,546 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-06 16:48:08,546 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 16:48:08,546 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2021-01-06 16:48:08,547 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888197706] [2021-01-06 16:48:08,547 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 16:48:08,547 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:48:08,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 16:48:08,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 16:48:08,550 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand 6 states. [2021-01-06 16:48:08,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:48:08,679 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2021-01-06 16:48:08,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 16:48:08,679 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2021-01-06 16:48:08,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:48:08,680 INFO L225 Difference]: With dead ends: 111 [2021-01-06 16:48:08,680 INFO L226 Difference]: Without dead ends: 109 [2021-01-06 16:48:08,681 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-01-06 16:48:08,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-01-06 16:48:08,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 68. [2021-01-06 16:48:08,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2021-01-06 16:48:08,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2021-01-06 16:48:08,693 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 26 [2021-01-06 16:48:08,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:48:08,695 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2021-01-06 16:48:08,695 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 16:48:08,695 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2021-01-06 16:48:08,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-01-06 16:48:08,696 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:48:08,696 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] [2021-01-06 16:48:08,911 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-01-06 16:48:08,913 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_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:08,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:48:08,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1780382557, now seen corresponding path program 1 times [2021-01-06 16:48:08,914 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:48:08,915 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196162712] [2021-01-06 16:48:08,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:48:08,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:48:08,966 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:08,966 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196162712] [2021-01-06 16:48:08,966 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:48:08,967 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 16:48:08,967 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990343179] [2021-01-06 16:48:08,967 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 16:48:08,967 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:48:08,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 16:48:08,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 16:48:08,968 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 5 states. [2021-01-06 16:48:09,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:48:09,034 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2021-01-06 16:48:09,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 16:48:09,035 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2021-01-06 16:48:09,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:48:09,035 INFO L225 Difference]: With dead ends: 69 [2021-01-06 16:48:09,035 INFO L226 Difference]: Without dead ends: 67 [2021-01-06 16:48:09,036 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-01-06 16:48:09,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-01-06 16:48:09,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2021-01-06 16:48:09,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2021-01-06 16:48:09,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2021-01-06 16:48:09,041 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 26 [2021-01-06 16:48:09,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:48:09,041 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2021-01-06 16:48:09,041 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 16:48:09,041 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2021-01-06 16:48:09,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-01-06 16:48:09,042 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:48:09,042 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 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:09,042 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 16:48:09,042 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_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:09,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:48:09,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1280139623, now seen corresponding path program 1 times [2021-01-06 16:48:09,043 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:48:09,043 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757917795] [2021-01-06 16:48:09,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:48:09,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:48:09,103 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-06 16:48:09,104 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757917795] [2021-01-06 16:48:09,104 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754096700] [2021-01-06 16:48:09,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:48:09,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:48:09,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 19 conjunts are in the unsatisfiable core [2021-01-06 16:48:09,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:48:09,383 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:48:09,384 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 16:48:09,384 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8] total 11 [2021-01-06 16:48:09,384 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708101637] [2021-01-06 16:48:09,388 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-06 16:48:09,388 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:48:09,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-06 16:48:09,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-01-06 16:48:09,389 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand 11 states. [2021-01-06 16:48:09,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:48:09,619 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2021-01-06 16:48:09,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 16:48:09,620 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2021-01-06 16:48:09,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:48:09,621 INFO L225 Difference]: With dead ends: 67 [2021-01-06 16:48:09,621 INFO L226 Difference]: Without dead ends: 65 [2021-01-06 16:48:09,621 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2021-01-06 16:48:09,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-01-06 16:48:09,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2021-01-06 16:48:09,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2021-01-06 16:48:09,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2021-01-06 16:48:09,625 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 27 [2021-01-06 16:48:09,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:48:09,626 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2021-01-06 16:48:09,626 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-06 16:48:09,626 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2021-01-06 16:48:09,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-01-06 16:48:09,627 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:48:09,627 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] [2021-01-06 16:48:09,842 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-01-06 16:48:09,843 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_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:09,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:48:09,845 INFO L82 PathProgramCache]: Analyzing trace with hash -642711428, now seen corresponding path program 1 times [2021-01-06 16:48:09,845 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:48:09,846 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844731228] [2021-01-06 16:48:09,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:48:09,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:48:09,884 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:09,884 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844731228] [2021-01-06 16:48:09,884 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:48:09,884 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 16:48:09,885 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637507344] [2021-01-06 16:48:09,885 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 16:48:09,885 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:48:09,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 16:48:09,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 16:48:09,886 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 5 states. [2021-01-06 16:48:09,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:48:09,950 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2021-01-06 16:48:09,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 16:48:09,950 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2021-01-06 16:48:09,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:48:09,951 INFO L225 Difference]: With dead ends: 60 [2021-01-06 16:48:09,951 INFO L226 Difference]: Without dead ends: 58 [2021-01-06 16:48:09,951 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 16:48:09,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2021-01-06 16:48:09,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2021-01-06 16:48:09,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2021-01-06 16:48:09,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2021-01-06 16:48:09,955 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 27 [2021-01-06 16:48:09,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:48:09,956 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2021-01-06 16:48:09,956 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 16:48:09,956 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2021-01-06 16:48:09,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-01-06 16:48:09,956 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:48:09,957 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] [2021-01-06 16:48:09,957 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 16:48:09,957 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_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:09,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:48:09,958 INFO L82 PathProgramCache]: Analyzing trace with hash -47880409, now seen corresponding path program 1 times [2021-01-06 16:48:09,958 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:48:09,958 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486160135] [2021-01-06 16:48:09,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:48:09,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:48:10,004 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:10,004 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486160135] [2021-01-06 16:48:10,004 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:48:10,005 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 16:48:10,005 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262768292] [2021-01-06 16:48:10,005 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 16:48:10,005 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:48:10,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 16:48:10,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 16:48:10,006 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 5 states. [2021-01-06 16:48:10,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:48:10,067 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2021-01-06 16:48:10,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 16:48:10,068 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2021-01-06 16:48:10,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:48:10,069 INFO L225 Difference]: With dead ends: 59 [2021-01-06 16:48:10,069 INFO L226 Difference]: Without dead ends: 57 [2021-01-06 16:48:10,069 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-01-06 16:48:10,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2021-01-06 16:48:10,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2021-01-06 16:48:10,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2021-01-06 16:48:10,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2021-01-06 16:48:10,073 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 30 [2021-01-06 16:48:10,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:48:10,073 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2021-01-06 16:48:10,073 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 16:48:10,074 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2021-01-06 16:48:10,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-01-06 16:48:10,074 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:48:10,074 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] [2021-01-06 16:48:10,074 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 16:48:10,075 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_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:10,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:48:10,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1484288504, now seen corresponding path program 1 times [2021-01-06 16:48:10,075 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:48:10,076 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105335021] [2021-01-06 16:48:10,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:48:10,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:48:10,119 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:10,119 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105335021] [2021-01-06 16:48:10,120 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:48:10,120 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 16:48:10,120 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640909551] [2021-01-06 16:48:10,120 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 16:48:10,120 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:48:10,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 16:48:10,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-06 16:48:10,121 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 6 states. [2021-01-06 16:48:10,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:48:10,220 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2021-01-06 16:48:10,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 16:48:10,221 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2021-01-06 16:48:10,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:48:10,221 INFO L225 Difference]: With dead ends: 67 [2021-01-06 16:48:10,221 INFO L226 Difference]: Without dead ends: 65 [2021-01-06 16:48:10,222 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-01-06 16:48:10,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-01-06 16:48:10,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 54. [2021-01-06 16:48:10,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2021-01-06 16:48:10,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2021-01-06 16:48:10,226 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 31 [2021-01-06 16:48:10,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:48:10,227 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2021-01-06 16:48:10,227 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 16:48:10,227 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2021-01-06 16:48:10,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-01-06 16:48:10,227 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:48:10,227 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] [2021-01-06 16:48:10,228 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 16:48:10,228 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_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:10,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:48:10,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1746453711, now seen corresponding path program 1 times [2021-01-06 16:48:10,229 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:48:10,229 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871596083] [2021-01-06 16:48:10,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:48:10,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:48:10,278 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:10,278 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871596083] [2021-01-06 16:48:10,278 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:48:10,278 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 16:48:10,279 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800280075] [2021-01-06 16:48:10,279 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 16:48:10,279 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:48:10,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 16:48:10,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 16:48:10,280 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand 5 states. [2021-01-06 16:48:10,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:48:10,403 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2021-01-06 16:48:10,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 16:48:10,404 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2021-01-06 16:48:10,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:48:10,405 INFO L225 Difference]: With dead ends: 87 [2021-01-06 16:48:10,405 INFO L226 Difference]: Without dead ends: 85 [2021-01-06 16:48:10,405 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 16:48:10,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-01-06 16:48:10,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 57. [2021-01-06 16:48:10,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2021-01-06 16:48:10,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2021-01-06 16:48:10,410 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 34 [2021-01-06 16:48:10,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:48:10,410 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2021-01-06 16:48:10,410 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 16:48:10,410 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2021-01-06 16:48:10,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-01-06 16:48:10,411 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:48:10,411 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] [2021-01-06 16:48:10,411 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 16:48:10,412 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_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:10,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:48:10,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1694514003, now seen corresponding path program 1 times [2021-01-06 16:48:10,412 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:48:10,412 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090219853] [2021-01-06 16:48:10,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:48:10,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:48:10,471 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:10,471 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090219853] [2021-01-06 16:48:10,471 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:48:10,471 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 16:48:10,472 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647224980] [2021-01-06 16:48:10,472 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 16:48:10,472 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:48:10,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 16:48:10,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 16:48:10,473 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 5 states. [2021-01-06 16:48:10,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:48:10,557 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2021-01-06 16:48:10,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 16:48:10,558 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2021-01-06 16:48:10,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:48:10,559 INFO L225 Difference]: With dead ends: 57 [2021-01-06 16:48:10,559 INFO L226 Difference]: Without dead ends: 55 [2021-01-06 16:48:10,559 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 16:48:10,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2021-01-06 16:48:10,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2021-01-06 16:48:10,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2021-01-06 16:48:10,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2021-01-06 16:48:10,564 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 35 [2021-01-06 16:48:10,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:48:10,564 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2021-01-06 16:48:10,564 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 16:48:10,564 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2021-01-06 16:48:10,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-01-06 16:48:10,565 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:48:10,565 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] [2021-01-06 16:48:10,565 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 16:48:10,565 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_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:10,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:48:10,566 INFO L82 PathProgramCache]: Analyzing trace with hash 635482230, now seen corresponding path program 1 times [2021-01-06 16:48:10,566 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:48:10,566 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594978001] [2021-01-06 16:48:10,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:48:10,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:48:10,600 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:10,601 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594978001] [2021-01-06 16:48:10,601 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:48:10,601 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 16:48:10,601 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654600560] [2021-01-06 16:48:10,602 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 16:48:10,602 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:48:10,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 16:48:10,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 16:48:10,603 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 4 states. [2021-01-06 16:48:10,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:48:10,631 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2021-01-06 16:48:10,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 16:48:10,631 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2021-01-06 16:48:10,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:48:10,632 INFO L225 Difference]: With dead ends: 66 [2021-01-06 16:48:10,632 INFO L226 Difference]: Without dead ends: 64 [2021-01-06 16:48:10,632 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:10,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-01-06 16:48:10,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 53. [2021-01-06 16:48:10,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2021-01-06 16:48:10,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2021-01-06 16:48:10,637 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 37 [2021-01-06 16:48:10,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:48:10,637 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2021-01-06 16:48:10,637 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 16:48:10,637 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2021-01-06 16:48:10,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-01-06 16:48:10,638 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:48:10,638 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] [2021-01-06 16:48:10,638 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 16:48:10,638 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_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:10,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:48:10,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1774883137, now seen corresponding path program 1 times [2021-01-06 16:48:10,639 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:48:10,639 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160999401] [2021-01-06 16:48:10,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:48:10,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:48:10,676 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:10,676 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160999401] [2021-01-06 16:48:10,677 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:48:10,677 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 16:48:10,677 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352575697] [2021-01-06 16:48:10,677 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 16:48:10,677 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:48:10,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 16:48:10,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 16:48:10,678 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 5 states. [2021-01-06 16:48:10,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:48:10,710 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2021-01-06 16:48:10,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 16:48:10,711 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2021-01-06 16:48:10,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:48:10,712 INFO L225 Difference]: With dead ends: 62 [2021-01-06 16:48:10,712 INFO L226 Difference]: Without dead ends: 60 [2021-01-06 16:48:10,712 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:10,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-01-06 16:48:10,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 51. [2021-01-06 16:48:10,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2021-01-06 16:48:10,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2021-01-06 16:48:10,717 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 38 [2021-01-06 16:48:10,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:48:10,717 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2021-01-06 16:48:10,717 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 16:48:10,718 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2021-01-06 16:48:10,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-01-06 16:48:10,718 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:48:10,718 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] [2021-01-06 16:48:10,718 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 16:48:10,718 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_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:10,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:48:10,719 INFO L82 PathProgramCache]: Analyzing trace with hash 813201821, now seen corresponding path program 1 times [2021-01-06 16:48:10,719 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:48:10,719 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313761104] [2021-01-06 16:48:10,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:48:10,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:48:10,769 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:10,769 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313761104] [2021-01-06 16:48:10,770 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:48:10,770 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 16:48:10,770 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850642509] [2021-01-06 16:48:10,770 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 16:48:10,770 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:48:10,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 16:48:10,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 16:48:10,771 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand 5 states. [2021-01-06 16:48:10,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:48:10,891 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2021-01-06 16:48:10,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 16:48:10,891 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2021-01-06 16:48:10,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:48:10,892 INFO L225 Difference]: With dead ends: 84 [2021-01-06 16:48:10,892 INFO L226 Difference]: Without dead ends: 82 [2021-01-06 16:48:10,893 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 16:48:10,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2021-01-06 16:48:10,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 56. [2021-01-06 16:48:10,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2021-01-06 16:48:10,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2021-01-06 16:48:10,898 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 39 [2021-01-06 16:48:10,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:48:10,898 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2021-01-06 16:48:10,898 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 16:48:10,898 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2021-01-06 16:48:10,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-01-06 16:48:10,899 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:48:10,899 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] [2021-01-06 16:48:10,899 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 16:48:10,899 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_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:10,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:48:10,900 INFO L82 PathProgramCache]: Analyzing trace with hash -560543098, now seen corresponding path program 1 times [2021-01-06 16:48:10,900 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:48:10,900 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096001406] [2021-01-06 16:48:10,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:48:10,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:48:10,946 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:10,947 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096001406] [2021-01-06 16:48:10,947 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:48:10,947 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 16:48:10,947 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938358693] [2021-01-06 16:48:10,947 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 16:48:10,947 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:48:10,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 16:48:10,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 16:48:10,948 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 5 states. [2021-01-06 16:48:11,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:48:11,034 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2021-01-06 16:48:11,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 16:48:11,035 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2021-01-06 16:48:11,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:48:11,036 INFO L225 Difference]: With dead ends: 69 [2021-01-06 16:48:11,036 INFO L226 Difference]: Without dead ends: 67 [2021-01-06 16:48:11,036 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 16:48:11,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-01-06 16:48:11,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 54. [2021-01-06 16:48:11,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2021-01-06 16:48:11,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2021-01-06 16:48:11,058 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 40 [2021-01-06 16:48:11,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:48:11,058 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2021-01-06 16:48:11,058 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 16:48:11,059 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2021-01-06 16:48:11,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-01-06 16:48:11,059 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:48:11,059 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11,059 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-06 16:48:11,060 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_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:11,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:48:11,060 INFO L82 PathProgramCache]: Analyzing trace with hash 375780089, now seen corresponding path program 1 times [2021-01-06 16:48:11,060 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:48:11,060 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580089483] [2021-01-06 16:48:11,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:48:11,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:48:11,149 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:48:11,150 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580089483] [2021-01-06 16:48:11,150 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458881113] [2021-01-06 16:48:11,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:48:11,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:48:11,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 11 conjunts are in the unsatisfiable core [2021-01-06 16:48:11,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:48:11,319 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:48:11,320 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 16:48:11,320 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 7 [2021-01-06 16:48:11,320 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572924994] [2021-01-06 16:48:11,320 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 16:48:11,320 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:48:11,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 16:48:11,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-01-06 16:48:11,321 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 7 states. [2021-01-06 16:48:11,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:48:11,444 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2021-01-06 16:48:11,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 16:48:11,445 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2021-01-06 16:48:11,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:48:11,446 INFO L225 Difference]: With dead ends: 56 [2021-01-06 16:48:11,446 INFO L226 Difference]: Without dead ends: 54 [2021-01-06 16:48:11,447 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-01-06 16:48:11,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2021-01-06 16:48:11,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2021-01-06 16:48:11,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2021-01-06 16:48:11,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2021-01-06 16:48:11,451 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 40 [2021-01-06 16:48:11,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:48:11,452 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2021-01-06 16:48:11,452 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 16:48:11,452 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2021-01-06 16:48:11,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-01-06 16:48:11,452 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:48:11,452 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11,666 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-01-06 16:48:11,667 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_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:11,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:48:11,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1394778411, now seen corresponding path program 1 times [2021-01-06 16:48:11,668 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:48:11,669 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675919] [2021-01-06 16:48:11,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:48:11,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:48:11,718 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-06 16:48:11,719 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675919] [2021-01-06 16:48:11,719 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:48:11,719 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 16:48:11,719 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758327306] [2021-01-06 16:48:11,720 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 16:48:11,720 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:48:11,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 16:48:11,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 16:48:11,721 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 5 states. [2021-01-06 16:48:11,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:48:11,841 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2021-01-06 16:48:11,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 16:48:11,841 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2021-01-06 16:48:11,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:48:11,842 INFO L225 Difference]: With dead ends: 71 [2021-01-06 16:48:11,842 INFO L226 Difference]: Without dead ends: 0 [2021-01-06 16:48:11,843 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 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:11,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-01-06 16:48:11,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-01-06 16:48:11,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-01-06 16:48:11,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-01-06 16:48:11,843 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2021-01-06 16:48:11,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:48:11,844 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-01-06 16:48:11,844 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 16:48:11,844 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-01-06 16:48:11,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-01-06 16:48:11,844 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-01-06 16:48:11,846 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-01-06 16:48:12,114 WARN L197 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 102 [2021-01-06 16:48:12,595 WARN L197 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 63 [2021-01-06 16:48:12,726 WARN L197 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 27 [2021-01-06 16:48:13,078 WARN L197 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 70 [2021-01-06 16:48:13,088 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 97) no Hoare annotation was computed. [2021-01-06 16:48:13,088 INFO L189 CegarLoopUtils]: For program point L85(line 85) no Hoare annotation was computed. [2021-01-06 16:48:13,088 INFO L189 CegarLoopUtils]: For program point L234(lines 234 338) no Hoare annotation was computed. [2021-01-06 16:48:13,088 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 272) no Hoare annotation was computed. [2021-01-06 16:48:13,088 INFO L189 CegarLoopUtils]: For program point L135(lines 135 397) no Hoare annotation was computed. [2021-01-06 16:48:13,088 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-01-06 16:48:13,088 INFO L189 CegarLoopUtils]: For program point L284(line 284) no Hoare annotation was computed. [2021-01-06 16:48:13,088 INFO L189 CegarLoopUtils]: For program point L53(lines 53 433) no Hoare annotation was computed. [2021-01-06 16:48:13,088 INFO L189 CegarLoopUtils]: For program point L384(lines 384 393) no Hoare annotation was computed. [2021-01-06 16:48:13,089 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 255) no Hoare annotation was computed. [2021-01-06 16:48:13,089 INFO L185 CegarLoopUtils]: At program point L401(lines 131 402) the Hoare annotation is: (and (< ULTIMATE.start_main_~main__cp~0 ULTIMATE.start_main_~main__urilen~0) (= ULTIMATE.start_main_~__VERIFIER_assert__cond~3 1) (let ((.cse0 (<= 1 ULTIMATE.start_main_~main__cp~0)) (.cse1 (< 0 ULTIMATE.start_main_~main__scheme~0)) (.cse2 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~0 0))) (.cse3 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~1 0)))) (or (and .cse0 (= ULTIMATE.start_main_~__VERIFIER_assert__cond~2 1) .cse1 .cse2 .cse3) (and .cse0 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~16 0)) .cse1 .cse2 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~2 0)) .cse3)))) [2021-01-06 16:48:13,089 INFO L189 CegarLoopUtils]: For program point L104(lines 104 411) no Hoare annotation was computed. [2021-01-06 16:48:13,089 INFO L189 CegarLoopUtils]: For program point L71(lines 71 416) no Hoare annotation was computed. [2021-01-06 16:48:13,089 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 177) no Hoare annotation was computed. [2021-01-06 16:48:13,089 INFO L189 CegarLoopUtils]: For program point L253(lines 253 329) no Hoare annotation was computed. [2021-01-06 16:48:13,090 INFO L189 CegarLoopUtils]: For program point L187(lines 187 355) no Hoare annotation was computed. [2021-01-06 16:48:13,090 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION(line 386) no Hoare annotation was computed. [2021-01-06 16:48:13,090 INFO L189 CegarLoopUtils]: For program point L270(lines 270 322) no Hoare annotation was computed. [2021-01-06 16:48:13,090 INFO L189 CegarLoopUtils]: For program point L204(lines 204 353) no Hoare annotation was computed. [2021-01-06 16:48:13,090 INFO L189 CegarLoopUtils]: For program point L386(line 386) no Hoare annotation was computed. [2021-01-06 16:48:13,090 INFO L189 CegarLoopUtils]: For program point L155(lines 155 360) no Hoare annotation was computed. [2021-01-06 16:48:13,090 INFO L189 CegarLoopUtils]: For program point L23(lines 23 438) no Hoare annotation was computed. [2021-01-06 16:48:13,090 INFO L189 CegarLoopUtils]: For program point L255(line 255) no Hoare annotation was computed. [2021-01-06 16:48:13,090 INFO L189 CegarLoopUtils]: For program point L189(line 189) no Hoare annotation was computed. [2021-01-06 16:48:13,090 INFO L189 CegarLoopUtils]: For program point L123(lines 123 403) no Hoare annotation was computed. [2021-01-06 16:48:13,091 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 214) no Hoare annotation was computed. [2021-01-06 16:48:13,091 INFO L189 CegarLoopUtils]: For program point L272(line 272) no Hoare annotation was computed. [2021-01-06 16:48:13,091 INFO L189 CegarLoopUtils]: For program point L41(lines 41 435) no Hoare annotation was computed. [2021-01-06 16:48:13,091 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-01-06 16:48:13,091 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 189) no Hoare annotation was computed. [2021-01-06 16:48:13,091 INFO L189 CegarLoopUtils]: For program point L157(line 157) no Hoare annotation was computed. [2021-01-06 16:48:13,091 INFO L189 CegarLoopUtils]: For program point L372(lines 372 395) no Hoare annotation was computed. [2021-01-06 16:48:13,091 INFO L189 CegarLoopUtils]: For program point L306(lines 306 316) no Hoare annotation was computed. [2021-01-06 16:48:13,091 INFO L189 CegarLoopUtils]: For program point L224(lines 224 344) no Hoare annotation was computed. [2021-01-06 16:48:13,091 INFO L189 CegarLoopUtils]: For program point L125(line 125) no Hoare annotation was computed. [2021-01-06 16:48:13,091 INFO L189 CegarLoopUtils]: For program point L59(lines 59 432) no Hoare annotation was computed. [2021-01-06 16:48:13,091 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 113) no Hoare annotation was computed. [2021-01-06 16:48:13,091 INFO L189 CegarLoopUtils]: For program point L241(lines 241 331) no Hoare annotation was computed. [2021-01-06 16:48:13,092 INFO L189 CegarLoopUtils]: For program point L175(lines 175 357) no Hoare annotation was computed. [2021-01-06 16:48:13,092 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 284) no Hoare annotation was computed. [2021-01-06 16:48:13,092 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 226) no Hoare annotation was computed. [2021-01-06 16:48:13,092 INFO L189 CegarLoopUtils]: For program point L374(line 374) no Hoare annotation was computed. [2021-01-06 16:48:13,092 INFO L189 CegarLoopUtils]: For program point L308(line 308) no Hoare annotation was computed. [2021-01-06 16:48:13,092 INFO L189 CegarLoopUtils]: For program point L143(lines 143 362) no Hoare annotation was computed. [2021-01-06 16:48:13,092 INFO L189 CegarLoopUtils]: For program point L226(line 226) no Hoare annotation was computed. [2021-01-06 16:48:13,092 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 145) no Hoare annotation was computed. [2021-01-06 16:48:13,092 INFO L189 CegarLoopUtils]: For program point L61(lines 61 427) no Hoare annotation was computed. [2021-01-06 16:48:13,093 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-01-06 16:48:13,093 INFO L189 CegarLoopUtils]: For program point L243(line 243) no Hoare annotation was computed. [2021-01-06 16:48:13,093 INFO L189 CegarLoopUtils]: For program point L177(line 177) no Hoare annotation was computed. [2021-01-06 16:48:13,093 INFO L189 CegarLoopUtils]: For program point L111(lines 111 405) no Hoare annotation was computed. [2021-01-06 16:48:13,093 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 308) no Hoare annotation was computed. [2021-01-06 16:48:13,093 INFO L185 CegarLoopUtils]: At program point L392(lines 129 403) the Hoare annotation is: (and (let ((.cse0 (<= 1 ULTIMATE.start_main_~main__cp~0)) (.cse1 (< 0 ULTIMATE.start_main_~main__scheme~0)) (.cse2 (= ULTIMATE.start_main_~__VERIFIER_assert__cond~3 1)) (.cse3 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~0 0))) (.cse4 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~1 0)))) (or (and .cse0 .cse1 .cse2 .cse3 (<= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~16) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~2 0)) .cse4 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~17 0))) (and .cse0 (= ULTIMATE.start_main_~__VERIFIER_assert__cond~2 1) .cse1 .cse2 .cse3 .cse4))) (< ULTIMATE.start_main_~main__cp~0 ULTIMATE.start_main_~main__urilen~0)) [2021-01-06 16:48:13,093 INFO L189 CegarLoopUtils]: For program point L194(lines 194 354) no Hoare annotation was computed. [2021-01-06 16:48:13,093 INFO L189 CegarLoopUtils]: For program point L95(lines 95 412) no Hoare annotation was computed. [2021-01-06 16:48:13,093 INFO L189 CegarLoopUtils]: For program point L29(lines 29 437) no Hoare annotation was computed. [2021-01-06 16:48:13,094 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 125) no Hoare annotation was computed. [2021-01-06 16:48:13,094 INFO L189 CegarLoopUtils]: For program point L145(line 145) no Hoare annotation was computed. [2021-01-06 16:48:13,094 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 296) no Hoare annotation was computed. [2021-01-06 16:48:13,094 INFO L185 CegarLoopUtils]: At program point L327(lines 262 328) the Hoare annotation is: (and (let ((.cse0 (let ((.cse1 (<= 1 ULTIMATE.start_main_~main__cp~0)) (.cse2 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~7 0))) (.cse3 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~6 0))) (.cse4 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~11 0))) (.cse5 (< 0 ULTIMATE.start_main_~main__scheme~0)) (.cse6 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~5 0))) (.cse7 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~2 0))) (.cse8 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~8 0))) (.cse9 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~0 0))) (.cse10 (= ULTIMATE.start_main_~__VERIFIER_assert__cond~3 1)) (.cse11 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~1 0))) (.cse12 (= ULTIMATE.start_main_~__VERIFIER_assert__cond~4 1))) (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= (+ ULTIMATE.start_main_~main__c~0 2) ULTIMATE.start_main_~main__tokenlen~0) .cse9 .cse10 .cse11 .cse12) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~12 0)) .cse9 .cse10 .cse11 .cse12))))) (or (and (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~13 0)) (<= 1 ULTIMATE.start_main_~main__c~0) .cse0) (and .cse0 (= ULTIMATE.start_main_~main__c~0 0)))) (= ULTIMATE.start_main_~__VERIFIER_assert__cond~9 1) (< (+ ULTIMATE.start_main_~main__cp~0 1) ULTIMATE.start_main_~main__urilen~0) (= ULTIMATE.start_main_~__VERIFIER_assert__cond~10 1)) [2021-01-06 16:48:13,094 INFO L189 CegarLoopUtils]: For program point L294(lines 294 318) no Hoare annotation was computed. [2021-01-06 16:48:13,094 INFO L189 CegarLoopUtils]: For program point L162(lines 162 359) no Hoare annotation was computed. [2021-01-06 16:48:13,094 INFO L189 CegarLoopUtils]: For program point L63(lines 63 422) no Hoare annotation was computed. [2021-01-06 16:48:13,094 INFO L185 CegarLoopUtils]: At program point L410(lines 104 411) the Hoare annotation is: (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~0 0)) [2021-01-06 16:48:13,094 INFO L189 CegarLoopUtils]: For program point L212(lines 212 346) no Hoare annotation was computed. [2021-01-06 16:48:13,095 INFO L189 CegarLoopUtils]: For program point L113(line 113) no Hoare annotation was computed. [2021-01-06 16:48:13,095 INFO L189 CegarLoopUtils]: For program point L47(lines 47 434) no Hoare annotation was computed. [2021-01-06 16:48:13,095 INFO L189 CegarLoopUtils]: For program point L262(lines 262 328) no Hoare annotation was computed. [2021-01-06 16:48:13,095 INFO L189 CegarLoopUtils]: For program point L97(line 97) no Hoare annotation was computed. [2021-01-06 16:48:13,095 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 157) no Hoare annotation was computed. [2021-01-06 16:48:13,095 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 374) no Hoare annotation was computed. [2021-01-06 16:48:13,095 INFO L189 CegarLoopUtils]: For program point L296(line 296) no Hoare annotation was computed. [2021-01-06 16:48:13,095 INFO L189 CegarLoopUtils]: For program point L65(lines 65 417) no Hoare annotation was computed. [2021-01-06 16:48:13,095 INFO L189 CegarLoopUtils]: For program point L-1(line -1) no Hoare annotation was computed. [2021-01-06 16:48:13,095 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 85) no Hoare annotation was computed. [2021-01-06 16:48:13,096 INFO L189 CegarLoopUtils]: For program point L214(line 214) no Hoare annotation was computed. [2021-01-06 16:48:13,096 INFO L189 CegarLoopUtils]: For program point L83(lines 83 414) no Hoare annotation was computed. [2021-01-06 16:48:13,096 INFO L185 CegarLoopUtils]: At program point L315(lines 230 344) the Hoare annotation is: (let ((.cse2 (<= 1 ULTIMATE.start_main_~main__cp~0)) (.cse3 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~7 0))) (.cse4 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~6 0))) (.cse6 (< 0 ULTIMATE.start_main_~main__scheme~0)) (.cse7 (< ULTIMATE.start_main_~main__cp~0 ULTIMATE.start_main_~main__urilen~0)) (.cse8 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~5 0))) (.cse9 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~2 0))) (.cse10 (= ULTIMATE.start_main_~__VERIFIER_assert__cond~9 1)) (.cse12 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~8 0))) (.cse13 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~0 0))) (.cse14 (= ULTIMATE.start_main_~__VERIFIER_assert__cond~3 1)) (.cse15 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~1 0))) (.cse16 (= ULTIMATE.start_main_~__VERIFIER_assert__cond~4 1)) (.cse1 (= ULTIMATE.start_main_~main__c~0 0))) (or (and (<= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~10) (let ((.cse0 (let ((.cse5 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~11 0))) (.cse11 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~10 0)))) (or (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~12 0)) .cse13 .cse14 .cse15 .cse16) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= (+ ULTIMATE.start_main_~main__c~0 2) ULTIMATE.start_main_~main__tokenlen~0) .cse13 .cse14 .cse15 .cse16))))) (or (and (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~13 0)) (<= 1 ULTIMATE.start_main_~main__c~0) .cse0) (and .cse0 .cse1)))) (and .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 (= ULTIMATE.start_main_~__VERIFIER_assert__cond~8 1) .cse12 (= ULTIMATE.start_main_~__VERIFIER_assert__cond~6 1) .cse13 .cse14 .cse15 (< (+ ULTIMATE.start_main_~main__cp~0 1) ULTIMATE.start_main_~main__urilen~0) .cse16 .cse1))) [2021-01-06 16:48:13,096 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 243) no Hoare annotation was computed. [2021-01-06 16:48:13,096 INFO L189 CegarLoopUtils]: For program point L282(lines 282 320) no Hoare annotation was computed. [2021-01-06 16:48:13,096 INFO L192 CegarLoopUtils]: At program point L431(lines 13 439) the Hoare annotation is: true [2021-01-06 16:48:13,096 INFO L189 CegarLoopUtils]: For program point L35(lines 35 436) no Hoare annotation was computed. [2021-01-06 16:48:13,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.01 04:48:13 BoogieIcfgContainer [2021-01-06 16:48:13,123 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-01-06 16:48:13,124 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-01-06 16:48:13,124 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-01-06 16:48:13,124 INFO L275 PluginConnector]: Witness Printer initialized [2021-01-06 16:48:13,125 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:06" (3/4) ... [2021-01-06 16:48:13,128 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-01-06 16:48:13,143 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-01-06 16:48:13,144 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-01-06 16:48:13,144 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-01-06 16:48:13,145 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-01-06 16:48:13,230 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c-witness.graphml [2021-01-06 16:48:13,230 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-01-06 16:48:13,231 INFO L168 Benchmark]: Toolchain (without parser) took 8402.61 ms. Allocated memory was 151.0 MB in the beginning and 241.2 MB in the end (delta: 90.2 MB). Free memory was 125.0 MB in the beginning and 192.3 MB in the end (delta: -67.3 MB). Peak memory consumption was 23.9 MB. Max. memory is 8.0 GB. [2021-01-06 16:48:13,231 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 151.0 MB. Free memory is still 124.3 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 16:48:13,232 INFO L168 Benchmark]: CACSL2BoogieTranslator took 428.42 ms. Allocated memory is still 151.0 MB. Free memory was 124.8 MB in the beginning and 105.5 MB in the end (delta: 19.2 MB). Peak memory consumption was 18.9 MB. Max. memory is 8.0 GB. [2021-01-06 16:48:13,232 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.13 ms. Allocated memory is still 151.0 MB. Free memory was 105.3 MB in the beginning and 103.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-01-06 16:48:13,232 INFO L168 Benchmark]: Boogie Preprocessor took 44.34 ms. Allocated memory is still 151.0 MB. Free memory was 103.3 MB in the beginning and 102.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-01-06 16:48:13,233 INFO L168 Benchmark]: RCFGBuilder took 679.42 ms. Allocated memory is still 151.0 MB. Free memory was 102.0 MB in the beginning and 120.1 MB in the end (delta: -18.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 8.0 GB. [2021-01-06 16:48:13,233 INFO L168 Benchmark]: TraceAbstraction took 7082.83 ms. Allocated memory was 151.0 MB in the beginning and 241.2 MB in the end (delta: 90.2 MB). Free memory was 119.6 MB in the beginning and 199.7 MB in the end (delta: -80.1 MB). Peak memory consumption was 126.5 MB. Max. memory is 8.0 GB. [2021-01-06 16:48:13,233 INFO L168 Benchmark]: Witness Printer took 106.03 ms. Allocated memory is still 241.2 MB. Free memory was 199.7 MB in the beginning and 192.3 MB in the end (delta: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 8.0 GB. [2021-01-06 16:48:13,236 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.18 ms. Allocated memory is still 151.0 MB. Free memory is still 124.3 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 428.42 ms. Allocated memory is still 151.0 MB. Free memory was 124.8 MB in the beginning and 105.5 MB in the end (delta: 19.2 MB). Peak memory consumption was 18.9 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 50.13 ms. Allocated memory is still 151.0 MB. Free memory was 105.3 MB in the beginning and 103.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 44.34 ms. Allocated memory is still 151.0 MB. Free memory was 103.3 MB in the beginning and 102.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 679.42 ms. Allocated memory is still 151.0 MB. Free memory was 102.0 MB in the beginning and 120.1 MB in the end (delta: -18.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 8.0 GB. * TraceAbstraction took 7082.83 ms. Allocated memory was 151.0 MB in the beginning and 241.2 MB in the end (delta: 90.2 MB). Free memory was 119.6 MB in the beginning and 199.7 MB in the end (delta: -80.1 MB). Peak memory consumption was 126.5 MB. Max. memory is 8.0 GB. * Witness Printer took 106.03 ms. Allocated memory is still 241.2 MB. Free memory was 199.7 MB in the beginning and 192.3 MB in the end (delta: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 97]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 214]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 189]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 374]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 308]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 386]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 125]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 85]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 113]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 272]: 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: 177]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 243]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 296]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 284]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 255]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 226]: 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 18 specifications checked. All of them hold - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: ((((((((1 <= main__cp && 0 < main__scheme) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) || (((((1 <= main__cp && __VERIFIER_assert__cond == 1) && 0 < main__scheme) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0))) && main__cp < main__urilen - InvariantResult [Line: 262]: Loop Invariant Derived loop invariant: (((((!(__VERIFIER_assert__cond == 0) && 1 <= main__c) && (((((((((((((1 <= main__cp && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__c + 2 <= main__tokenlen) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) || ((((((((((((1 <= main__cp && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1))) || ((((((((((((((1 <= main__cp && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__c + 2 <= main__tokenlen) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) || ((((((((((((1 <= main__cp && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1)) && main__c == 0)) && __VERIFIER_assert__cond == 1) && main__cp + 1 < main__urilen) && __VERIFIER_assert__cond == 1 - InvariantResult [Line: 131]: Loop Invariant Derived loop invariant: (main__cp < main__urilen && __VERIFIER_assert__cond == 1) && (((((1 <= main__cp && __VERIFIER_assert__cond == 1) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) || (((((1 <= main__cp && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0))) - InvariantResult [Line: 230]: Loop Invariant Derived loop invariant: (1 <= __VERIFIER_assert__cond && (((!(__VERIFIER_assert__cond == 0) && 1 <= main__c) && ((((((((((((((((1 <= main__cp && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && main__cp < main__urilen) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) || (((((((((((((((1 <= main__cp && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && main__cp < main__urilen) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__c + 2 <= main__tokenlen) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1))) || (((((((((((((((((1 <= main__cp && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && main__cp < main__urilen) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) || (((((((((((((((1 <= main__cp && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && main__cp < main__urilen) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__c + 2 <= main__tokenlen) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1)) && main__c == 0))) || ((((((((((((((((1 <= main__cp && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && main__cp < main__urilen) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 < main__urilen) && __VERIFIER_assert__cond == 1) && main__c == 0) - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: !(__VERIFIER_assert__cond == 0) - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 82 locations, 18 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 5.7s, OverallIterations: 23, TraceHistogramMax: 2, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1245 SDtfs, 2415 SDslu, 1444 SDs, 0 SdLazy, 1187 SolverSat, 130 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 258 GetRequests, 128 SyntacticMatches, 7 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred 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.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 302 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 15 NumberOfFragments, 653 HoareAnnotationTreeSize, 6 FomulaSimplifications, 421683 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 6 FomulaSimplificationsInter, 30537 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 751 NumberOfCodeBlocks, 751 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 725 ConstructedInterpolants, 0 QuantifiedInterpolants, 47843 SizeOfPredicates, 16 NumberOfNonLiveVariables, 398 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 26 InterpolantComputations, 20 PerfectInterpolantSequences, 8/21 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...