/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-dcfa08f [2020-12-23 06:53:40,439 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 06:53:40,443 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 06:53:40,495 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 06:53:40,496 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 06:53:40,500 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 06:53:40,504 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 06:53:40,509 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 06:53:40,512 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 06:53:40,518 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 06:53:40,521 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 06:53:40,523 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 06:53:40,523 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 06:53:40,526 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 06:53:40,528 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 06:53:40,530 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 06:53:40,531 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 06:53:40,534 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 06:53:40,540 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 06:53:40,548 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 06:53:40,550 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 06:53:40,551 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 06:53:40,553 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 06:53:40,555 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 06:53:40,563 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 06:53:40,564 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 06:53:40,564 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 06:53:40,566 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 06:53:40,566 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 06:53:40,567 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 06:53:40,568 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 06:53:40,569 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 06:53:40,571 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 06:53:40,571 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 06:53:40,572 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 06:53:40,573 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 06:53:40,573 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 06:53:40,580 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 06:53:40,580 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 06:53:40,581 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 06:53:40,582 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 06:53:40,587 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-23 06:53:40,631 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 06:53:40,632 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 06:53:40,637 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 06:53:40,637 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 06:53:40,637 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 06:53:40,637 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 06:53:40,638 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 06:53:40,638 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 06:53:40,638 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 06:53:40,638 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 06:53:40,639 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 06:53:40,640 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 06:53:40,640 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 06:53:40,640 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 06:53:40,641 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 06:53:40,641 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 06:53:40,641 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 06:53:40,641 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 06:53:40,641 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 06:53:40,642 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 06:53:40,642 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 06:53:40,642 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 06:53:40,642 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 06:53:40,642 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 06:53:40,643 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 06:53:40,643 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 [2020-12-23 06:53:41,050 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 06:53:41,076 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 06:53:41,079 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 06:53:41,080 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 06:53:41,081 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 06:53:41,082 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 [2020-12-23 06:53:41,169 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/745d8585b/d1309b6a73ef40b388080495a70e5f2e/FLAG41fe0d6aa [2020-12-23 06:53:41,787 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 06:53:41,788 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2020-12-23 06:53:41,797 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/745d8585b/d1309b6a73ef40b388080495a70e5f2e/FLAG41fe0d6aa [2020-12-23 06:53:42,156 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/745d8585b/d1309b6a73ef40b388080495a70e5f2e [2020-12-23 06:53:42,159 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 06:53:42,162 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 06:53:42,166 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 06:53:42,166 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 06:53:42,170 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 06:53:42,171 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 06:53:42" (1/1) ... [2020-12-23 06:53:42,172 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@163ce1c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:53:42, skipping insertion in model container [2020-12-23 06:53:42,173 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 06:53:42" (1/1) ... [2020-12-23 06:53:42,182 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 06:53:42,241 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,] [2020-12-23 06:53:42,419 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,] [2020-12-23 06:53:42,424 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,] [2020-12-23 06:53:42,427 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,] [2020-12-23 06:53:42,429 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,] [2020-12-23 06:53:42,433 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,] [2020-12-23 06:53:42,435 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,] [2020-12-23 06:53:42,438 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,] [2020-12-23 06:53:42,440 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,] [2020-12-23 06:53:42,444 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,] [2020-12-23 06:53:42,447 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,] [2020-12-23 06:53:42,450 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,] [2020-12-23 06:53:42,452 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,] [2020-12-23 06:53:42,456 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,] [2020-12-23 06:53:42,460 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,] [2020-12-23 06:53:42,463 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,] [2020-12-23 06:53:42,468 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,] [2020-12-23 06:53:42,478 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,] [2020-12-23 06:53:42,481 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,] [2020-12-23 06:53:42,485 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 06:53:42,495 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,] [2020-12-23 06:53:42,534 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,] [2020-12-23 06:53:42,537 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,] [2020-12-23 06:53:42,543 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,] [2020-12-23 06:53:42,545 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,] [2020-12-23 06:53:42,552 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,] [2020-12-23 06:53:42,556 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,] [2020-12-23 06:53:42,561 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,] [2020-12-23 06:53:42,568 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,] [2020-12-23 06:53:42,573 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,] [2020-12-23 06:53:42,576 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,] [2020-12-23 06:53:42,582 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,] [2020-12-23 06:53:42,585 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,] [2020-12-23 06:53:42,597 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,] [2020-12-23 06:53:42,600 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,] [2020-12-23 06:53:42,602 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,] [2020-12-23 06:53:42,605 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,] [2020-12-23 06:53:42,611 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,] [2020-12-23 06:53:42,615 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,] [2020-12-23 06:53:42,623 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 06:53:42,651 INFO L208 MainTranslator]: Completed translation [2020-12-23 06:53:42,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:53:42 WrapperNode [2020-12-23 06:53:42,654 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 06:53:42,658 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 06:53:42,658 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 06:53:42,659 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 06:53:42,672 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:53:42" (1/1) ... [2020-12-23 06:53:42,699 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:53:42" (1/1) ... [2020-12-23 06:53:42,771 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 06:53:42,772 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 06:53:42,772 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 06:53:42,772 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 06:53:42,782 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:53:42" (1/1) ... [2020-12-23 06:53:42,782 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:53:42" (1/1) ... [2020-12-23 06:53:42,818 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:53:42" (1/1) ... [2020-12-23 06:53:42,818 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:53:42" (1/1) ... [2020-12-23 06:53:42,830 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:53:42" (1/1) ... [2020-12-23 06:53:42,837 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:53:42" (1/1) ... [2020-12-23 06:53:42,842 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:53:42" (1/1) ... [2020-12-23 06:53:42,857 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 06:53:42,861 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 06:53:42,861 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 06:53:42,862 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 06:53:42,864 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:53:42" (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 [2020-12-23 06:53:42,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 06:53:42,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 06:53:42,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 06:53:42,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 06:53:43,594 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 06:53:43,595 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2020-12-23 06:53:43,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 06:53:43 BoogieIcfgContainer [2020-12-23 06:53:43,597 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 06:53:43,599 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 06:53:43,599 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 06:53:43,602 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 06:53:43,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 06:53:42" (1/3) ... [2020-12-23 06:53:43,604 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@601cf954 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 06:53:43, skipping insertion in model container [2020-12-23 06:53:43,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:53:42" (2/3) ... [2020-12-23 06:53:43,606 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@601cf954 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 06:53:43, skipping insertion in model container [2020-12-23 06:53:43,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 06:53:43" (3/3) ... [2020-12-23 06:53:43,608 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i.v+cfa-reducer.c [2020-12-23 06:53:43,613 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 06:53:43,619 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2020-12-23 06:53:43,635 INFO L253 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2020-12-23 06:53:43,662 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 06:53:43,662 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 06:53:43,663 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 06:53:43,663 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 06:53:43,663 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 06:53:43,663 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 06:53:43,663 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 06:53:43,663 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 06:53:43,682 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2020-12-23 06:53:43,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-23 06:53:43,688 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:53:43,689 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 06:53:43,689 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]=== [2020-12-23 06:53:43,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:53:43,695 INFO L82 PathProgramCache]: Analyzing trace with hash -2034435078, now seen corresponding path program 1 times [2020-12-23 06:53:43,705 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:53:43,706 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178795639] [2020-12-23 06:53:43,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:53:43,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:53:43,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 06:53:43,926 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178795639] [2020-12-23 06:53:43,927 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 06:53:43,927 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 06:53:43,928 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135660695] [2020-12-23 06:53:43,933 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 06:53:43,933 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:53:43,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 06:53:43,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 06:53:43,950 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 3 states. [2020-12-23 06:53:43,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:53:43,984 INFO L93 Difference]: Finished difference Result 88 states and 123 transitions. [2020-12-23 06:53:43,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 06:53:43,986 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2020-12-23 06:53:43,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:53:43,996 INFO L225 Difference]: With dead ends: 88 [2020-12-23 06:53:43,996 INFO L226 Difference]: Without dead ends: 76 [2020-12-23 06:53:43,999 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 [2020-12-23 06:53:44,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-12-23 06:53:44,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2020-12-23 06:53:44,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-12-23 06:53:44,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2020-12-23 06:53:44,046 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 15 [2020-12-23 06:53:44,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:53:44,046 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2020-12-23 06:53:44,046 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 06:53:44,047 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2020-12-23 06:53:44,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-23 06:53:44,047 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:53:44,048 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 06:53:44,048 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 06:53:44,048 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]=== [2020-12-23 06:53:44,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:53:44,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1357026114, now seen corresponding path program 1 times [2020-12-23 06:53:44,050 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:53:44,050 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85097343] [2020-12-23 06:53:44,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:53:44,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:53:44,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 06:53:44,182 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85097343] [2020-12-23 06:53:44,182 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 06:53:44,182 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-23 06:53:44,182 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667230762] [2020-12-23 06:53:44,184 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 06:53:44,184 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:53:44,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 06:53:44,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-23 06:53:44,188 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand 6 states. [2020-12-23 06:53:44,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:53:44,355 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2020-12-23 06:53:44,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 06:53:44,356 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-12-23 06:53:44,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:53:44,358 INFO L225 Difference]: With dead ends: 76 [2020-12-23 06:53:44,358 INFO L226 Difference]: Without dead ends: 74 [2020-12-23 06:53:44,359 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 [2020-12-23 06:53:44,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-12-23 06:53:44,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2020-12-23 06:53:44,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-12-23 06:53:44,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2020-12-23 06:53:44,369 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 16 [2020-12-23 06:53:44,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:53:44,369 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2020-12-23 06:53:44,369 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 06:53:44,369 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2020-12-23 06:53:44,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-23 06:53:44,370 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:53:44,370 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 06:53:44,370 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 06:53:44,371 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]=== [2020-12-23 06:53:44,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:53:44,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1567835227, now seen corresponding path program 1 times [2020-12-23 06:53:44,372 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:53:44,372 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796583297] [2020-12-23 06:53:44,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:53:44,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:53:44,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 06:53:44,474 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796583297] [2020-12-23 06:53:44,474 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 06:53:44,474 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 06:53:44,475 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751356118] [2020-12-23 06:53:44,475 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 06:53:44,475 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:53:44,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 06:53:44,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 06:53:44,477 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand 4 states. [2020-12-23 06:53:44,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:53:44,583 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2020-12-23 06:53:44,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 06:53:44,584 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2020-12-23 06:53:44,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:53:44,585 INFO L225 Difference]: With dead ends: 97 [2020-12-23 06:53:44,585 INFO L226 Difference]: Without dead ends: 95 [2020-12-23 06:53:44,586 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 [2020-12-23 06:53:44,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-12-23 06:53:44,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 72. [2020-12-23 06:53:44,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-12-23 06:53:44,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2020-12-23 06:53:44,600 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 18 [2020-12-23 06:53:44,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:53:44,600 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2020-12-23 06:53:44,600 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 06:53:44,601 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2020-12-23 06:53:44,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-23 06:53:44,602 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:53:44,603 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 06:53:44,603 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 06:53:44,603 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]=== [2020-12-23 06:53:44,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:53:44,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1358247672, now seen corresponding path program 1 times [2020-12-23 06:53:44,604 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:53:44,604 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326264414] [2020-12-23 06:53:44,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:53:44,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:53:44,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 06:53:44,669 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326264414] [2020-12-23 06:53:44,669 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 06:53:44,670 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 06:53:44,670 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595754626] [2020-12-23 06:53:44,670 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 06:53:44,670 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:53:44,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 06:53:44,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 06:53:44,672 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand 5 states. [2020-12-23 06:53:44,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:53:44,779 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2020-12-23 06:53:44,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 06:53:44,780 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-12-23 06:53:44,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:53:44,781 INFO L225 Difference]: With dead ends: 72 [2020-12-23 06:53:44,781 INFO L226 Difference]: Without dead ends: 70 [2020-12-23 06:53:44,782 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 [2020-12-23 06:53:44,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-12-23 06:53:44,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-12-23 06:53:44,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-12-23 06:53:44,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2020-12-23 06:53:44,809 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 19 [2020-12-23 06:53:44,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:53:44,810 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2020-12-23 06:53:44,810 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 06:53:44,810 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2020-12-23 06:53:44,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-23 06:53:44,811 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:53:44,811 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] [2020-12-23 06:53:44,811 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 06:53:44,812 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]=== [2020-12-23 06:53:44,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:53:44,812 INFO L82 PathProgramCache]: Analyzing trace with hash -665385716, now seen corresponding path program 1 times [2020-12-23 06:53:44,813 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:53:44,813 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725414950] [2020-12-23 06:53:44,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:53:44,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:53:44,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 06:53:44,898 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725414950] [2020-12-23 06:53:44,898 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 06:53:44,898 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 06:53:44,898 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813897058] [2020-12-23 06:53:44,899 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 06:53:44,899 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:53:44,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 06:53:44,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 06:53:44,901 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand 5 states. [2020-12-23 06:53:45,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:53:45,179 INFO L93 Difference]: Finished difference Result 137 states and 143 transitions. [2020-12-23 06:53:45,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 06:53:45,181 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2020-12-23 06:53:45,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:53:45,187 INFO L225 Difference]: With dead ends: 137 [2020-12-23 06:53:45,187 INFO L226 Difference]: Without dead ends: 135 [2020-12-23 06:53:45,189 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-23 06:53:45,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2020-12-23 06:53:45,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 73. [2020-12-23 06:53:45,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-12-23 06:53:45,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2020-12-23 06:53:45,214 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 22 [2020-12-23 06:53:45,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:53:45,214 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2020-12-23 06:53:45,214 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 06:53:45,215 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2020-12-23 06:53:45,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-23 06:53:45,221 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:53:45,221 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] [2020-12-23 06:53:45,221 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 06:53:45,221 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]=== [2020-12-23 06:53:45,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:53:45,222 INFO L82 PathProgramCache]: Analyzing trace with hash -661217951, now seen corresponding path program 1 times [2020-12-23 06:53:45,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:53:45,222 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048789629] [2020-12-23 06:53:45,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:53:45,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:53:45,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 06:53:45,325 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048789629] [2020-12-23 06:53:45,325 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 06:53:45,326 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 06:53:45,326 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942326138] [2020-12-23 06:53:45,326 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 06:53:45,327 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:53:45,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 06:53:45,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 06:53:45,328 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand 5 states. [2020-12-23 06:53:45,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:53:45,533 INFO L93 Difference]: Finished difference Result 104 states and 110 transitions. [2020-12-23 06:53:45,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 06:53:45,534 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2020-12-23 06:53:45,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:53:45,535 INFO L225 Difference]: With dead ends: 104 [2020-12-23 06:53:45,535 INFO L226 Difference]: Without dead ends: 102 [2020-12-23 06:53:45,536 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-23 06:53:45,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2020-12-23 06:53:45,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 75. [2020-12-23 06:53:45,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-12-23 06:53:45,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2020-12-23 06:53:45,543 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 22 [2020-12-23 06:53:45,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:53:45,543 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2020-12-23 06:53:45,543 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 06:53:45,543 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2020-12-23 06:53:45,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-23 06:53:45,544 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:53:45,544 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] [2020-12-23 06:53:45,544 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 06:53:45,545 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]=== [2020-12-23 06:53:45,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:53:45,545 INFO L82 PathProgramCache]: Analyzing trace with hash 847883539, now seen corresponding path program 1 times [2020-12-23 06:53:45,546 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:53:45,546 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634364316] [2020-12-23 06:53:45,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:53:45,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:53:45,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 06:53:45,619 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634364316] [2020-12-23 06:53:45,619 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 06:53:45,619 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 06:53:45,620 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582925270] [2020-12-23 06:53:45,620 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 06:53:45,620 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:53:45,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 06:53:45,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 06:53:45,621 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 5 states. [2020-12-23 06:53:45,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:53:45,801 INFO L93 Difference]: Finished difference Result 117 states and 123 transitions. [2020-12-23 06:53:45,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 06:53:45,802 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2020-12-23 06:53:45,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:53:45,803 INFO L225 Difference]: With dead ends: 117 [2020-12-23 06:53:45,803 INFO L226 Difference]: Without dead ends: 115 [2020-12-23 06:53:45,804 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 [2020-12-23 06:53:45,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2020-12-23 06:53:45,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 73. [2020-12-23 06:53:45,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-12-23 06:53:45,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2020-12-23 06:53:45,811 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 23 [2020-12-23 06:53:45,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:53:45,811 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2020-12-23 06:53:45,811 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 06:53:45,811 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2020-12-23 06:53:45,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-23 06:53:45,812 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:53:45,812 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] [2020-12-23 06:53:45,812 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 06:53:45,813 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]=== [2020-12-23 06:53:45,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:53:45,813 INFO L82 PathProgramCache]: Analyzing trace with hash 977084131, now seen corresponding path program 1 times [2020-12-23 06:53:45,814 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:53:45,814 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846752916] [2020-12-23 06:53:45,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:53:45,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:53:45,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 06:53:45,882 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846752916] [2020-12-23 06:53:45,883 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 06:53:45,883 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 06:53:45,883 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102728021] [2020-12-23 06:53:45,883 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 06:53:45,884 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:53:45,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 06:53:45,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 06:53:45,885 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand 5 states. [2020-12-23 06:53:46,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:53:46,025 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2020-12-23 06:53:46,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 06:53:46,026 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2020-12-23 06:53:46,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:53:46,028 INFO L225 Difference]: With dead ends: 73 [2020-12-23 06:53:46,028 INFO L226 Difference]: Without dead ends: 71 [2020-12-23 06:53:46,029 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 [2020-12-23 06:53:46,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-12-23 06:53:46,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2020-12-23 06:53:46,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-12-23 06:53:46,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2020-12-23 06:53:46,039 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 23 [2020-12-23 06:53:46,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:53:46,040 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2020-12-23 06:53:46,040 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 06:53:46,040 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2020-12-23 06:53:46,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-23 06:53:46,042 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:53:46,042 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] [2020-12-23 06:53:46,043 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 06:53:46,043 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]=== [2020-12-23 06:53:46,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:53:46,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1619855478, now seen corresponding path program 1 times [2020-12-23 06:53:46,044 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:53:46,044 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100910306] [2020-12-23 06:53:46,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:53:46,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:53:46,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 06:53:46,105 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100910306] [2020-12-23 06:53:46,105 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 06:53:46,105 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 06:53:46,105 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288759251] [2020-12-23 06:53:46,105 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 06:53:46,106 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:53:46,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 06:53:46,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 06:53:46,107 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand 3 states. [2020-12-23 06:53:46,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:53:46,172 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2020-12-23 06:53:46,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 06:53:46,173 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-12-23 06:53:46,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:53:46,174 INFO L225 Difference]: With dead ends: 111 [2020-12-23 06:53:46,174 INFO L226 Difference]: Without dead ends: 71 [2020-12-23 06:53:46,175 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 [2020-12-23 06:53:46,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-12-23 06:53:46,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2020-12-23 06:53:46,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-12-23 06:53:46,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2020-12-23 06:53:46,180 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 25 [2020-12-23 06:53:46,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:53:46,180 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2020-12-23 06:53:46,181 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 06:53:46,181 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2020-12-23 06:53:46,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-23 06:53:46,182 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:53:46,182 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] [2020-12-23 06:53:46,182 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 06:53:46,182 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]=== [2020-12-23 06:53:46,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:53:46,183 INFO L82 PathProgramCache]: Analyzing trace with hash 595608307, now seen corresponding path program 1 times [2020-12-23 06:53:46,183 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:53:46,183 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810817827] [2020-12-23 06:53:46,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:53:46,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:53:46,253 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-23 06:53:46,254 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810817827] [2020-12-23 06:53:46,254 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142951355] [2020-12-23 06:53:46,254 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 [2020-12-23 06:53:46,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:53:46,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-23 06:53:46,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 06:53:46,483 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-23 06:53:46,483 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 06:53:46,484 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-12-23 06:53:46,484 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617391157] [2020-12-23 06:53:46,484 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 06:53:46,485 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:53:46,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 06:53:46,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-23 06:53:46,486 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand 6 states. [2020-12-23 06:53:46,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:53:46,647 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2020-12-23 06:53:46,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 06:53:46,648 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-12-23 06:53:46,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:53:46,649 INFO L225 Difference]: With dead ends: 111 [2020-12-23 06:53:46,649 INFO L226 Difference]: Without dead ends: 109 [2020-12-23 06:53:46,650 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 [2020-12-23 06:53:46,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-12-23 06:53:46,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 68. [2020-12-23 06:53:46,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-12-23 06:53:46,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2020-12-23 06:53:46,657 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 26 [2020-12-23 06:53:46,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:53:46,658 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2020-12-23 06:53:46,658 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 06:53:46,658 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2020-12-23 06:53:46,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-23 06:53:46,659 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:53:46,659 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] [2020-12-23 06:53:46,872 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-12-23 06:53:46,872 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]=== [2020-12-23 06:53:46,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:53:46,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1780382557, now seen corresponding path program 1 times [2020-12-23 06:53:46,874 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:53:46,875 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761960884] [2020-12-23 06:53:46,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:53:46,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:53:46,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 06:53:46,940 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761960884] [2020-12-23 06:53:46,940 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 06:53:46,941 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 06:53:46,941 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372792194] [2020-12-23 06:53:46,942 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 06:53:46,942 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:53:46,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 06:53:46,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-23 06:53:46,943 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 5 states. [2020-12-23 06:53:47,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:53:47,052 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2020-12-23 06:53:47,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 06:53:47,052 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2020-12-23 06:53:47,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:53:47,053 INFO L225 Difference]: With dead ends: 69 [2020-12-23 06:53:47,053 INFO L226 Difference]: Without dead ends: 67 [2020-12-23 06:53:47,054 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 [2020-12-23 06:53:47,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-12-23 06:53:47,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2020-12-23 06:53:47,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-12-23 06:53:47,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2020-12-23 06:53:47,059 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 26 [2020-12-23 06:53:47,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:53:47,059 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2020-12-23 06:53:47,060 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 06:53:47,060 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2020-12-23 06:53:47,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-23 06:53:47,061 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:53:47,061 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] [2020-12-23 06:53:47,061 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 06:53:47,061 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]=== [2020-12-23 06:53:47,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:53:47,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1280139623, now seen corresponding path program 1 times [2020-12-23 06:53:47,062 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:53:47,062 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066368808] [2020-12-23 06:53:47,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:53:47,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:53:47,132 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-23 06:53:47,133 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066368808] [2020-12-23 06:53:47,133 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712223769] [2020-12-23 06:53:47,133 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 [2020-12-23 06:53:47,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:53:47,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 19 conjunts are in the unsatisfiable core [2020-12-23 06:53:47,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 06:53:47,467 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 06:53:47,467 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 06:53:47,467 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8] total 11 [2020-12-23 06:53:47,468 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993875401] [2020-12-23 06:53:47,468 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-23 06:53:47,468 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:53:47,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-23 06:53:47,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-12-23 06:53:47,469 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand 11 states. [2020-12-23 06:53:47,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:53:47,758 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2020-12-23 06:53:47,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 06:53:47,759 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2020-12-23 06:53:47,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:53:47,760 INFO L225 Difference]: With dead ends: 67 [2020-12-23 06:53:47,760 INFO L226 Difference]: Without dead ends: 65 [2020-12-23 06:53:47,760 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2020-12-23 06:53:47,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-12-23 06:53:47,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2020-12-23 06:53:47,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-12-23 06:53:47,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2020-12-23 06:53:47,764 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 27 [2020-12-23 06:53:47,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:53:47,765 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2020-12-23 06:53:47,765 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-23 06:53:47,765 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2020-12-23 06:53:47,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-23 06:53:47,766 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:53:47,766 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] [2020-12-23 06:53:47,979 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2020-12-23 06:53:47,980 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]=== [2020-12-23 06:53:47,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:53:47,982 INFO L82 PathProgramCache]: Analyzing trace with hash -642711428, now seen corresponding path program 1 times [2020-12-23 06:53:47,982 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:53:47,983 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984280111] [2020-12-23 06:53:47,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:53:47,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:53:48,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 06:53:48,041 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984280111] [2020-12-23 06:53:48,041 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 06:53:48,041 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 06:53:48,041 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915543646] [2020-12-23 06:53:48,042 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 06:53:48,042 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:53:48,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 06:53:48,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 06:53:48,043 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 5 states. [2020-12-23 06:53:48,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:53:48,139 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2020-12-23 06:53:48,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 06:53:48,140 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2020-12-23 06:53:48,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:53:48,140 INFO L225 Difference]: With dead ends: 60 [2020-12-23 06:53:48,140 INFO L226 Difference]: Without dead ends: 58 [2020-12-23 06:53:48,141 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 [2020-12-23 06:53:48,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-12-23 06:53:48,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2020-12-23 06:53:48,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-12-23 06:53:48,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2020-12-23 06:53:48,145 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 27 [2020-12-23 06:53:48,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:53:48,145 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2020-12-23 06:53:48,145 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 06:53:48,145 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2020-12-23 06:53:48,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-12-23 06:53:48,146 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:53:48,146 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] [2020-12-23 06:53:48,146 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-23 06:53:48,147 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]=== [2020-12-23 06:53:48,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:53:48,147 INFO L82 PathProgramCache]: Analyzing trace with hash -47880409, now seen corresponding path program 1 times [2020-12-23 06:53:48,147 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:53:48,148 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743191299] [2020-12-23 06:53:48,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:53:48,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:53:48,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 06:53:48,209 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743191299] [2020-12-23 06:53:48,209 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 06:53:48,209 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 06:53:48,209 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246991553] [2020-12-23 06:53:48,210 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 06:53:48,210 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:53:48,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 06:53:48,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-23 06:53:48,211 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 5 states. [2020-12-23 06:53:48,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:53:48,312 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2020-12-23 06:53:48,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 06:53:48,313 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2020-12-23 06:53:48,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:53:48,314 INFO L225 Difference]: With dead ends: 59 [2020-12-23 06:53:48,314 INFO L226 Difference]: Without dead ends: 57 [2020-12-23 06:53:48,314 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 [2020-12-23 06:53:48,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-12-23 06:53:48,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2020-12-23 06:53:48,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-12-23 06:53:48,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2020-12-23 06:53:48,318 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 30 [2020-12-23 06:53:48,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:53:48,319 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2020-12-23 06:53:48,319 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 06:53:48,319 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2020-12-23 06:53:48,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-12-23 06:53:48,320 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:53:48,320 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] [2020-12-23 06:53:48,320 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-23 06:53:48,320 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]=== [2020-12-23 06:53:48,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:53:48,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1484288504, now seen corresponding path program 1 times [2020-12-23 06:53:48,321 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:53:48,321 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788013403] [2020-12-23 06:53:48,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:53:48,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:53:48,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 06:53:48,384 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788013403] [2020-12-23 06:53:48,384 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 06:53:48,384 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-23 06:53:48,385 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178015068] [2020-12-23 06:53:48,385 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 06:53:48,385 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:53:48,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 06:53:48,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-23 06:53:48,386 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 6 states. [2020-12-23 06:53:48,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:53:48,621 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2020-12-23 06:53:48,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 06:53:48,622 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2020-12-23 06:53:48,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:53:48,622 INFO L225 Difference]: With dead ends: 67 [2020-12-23 06:53:48,622 INFO L226 Difference]: Without dead ends: 65 [2020-12-23 06:53:48,623 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 [2020-12-23 06:53:48,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-12-23 06:53:48,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 54. [2020-12-23 06:53:48,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-12-23 06:53:48,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2020-12-23 06:53:48,631 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 31 [2020-12-23 06:53:48,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:53:48,632 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2020-12-23 06:53:48,632 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 06:53:48,632 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2020-12-23 06:53:48,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-12-23 06:53:48,634 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:53:48,635 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] [2020-12-23 06:53:48,635 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-23 06:53:48,635 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]=== [2020-12-23 06:53:48,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:53:48,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1746453711, now seen corresponding path program 1 times [2020-12-23 06:53:48,636 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:53:48,636 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808431460] [2020-12-23 06:53:48,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:53:48,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:53:48,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 06:53:48,712 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808431460] [2020-12-23 06:53:48,712 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 06:53:48,712 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 06:53:48,712 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060844824] [2020-12-23 06:53:48,713 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 06:53:48,713 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:53:48,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 06:53:48,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 06:53:48,714 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand 5 states. [2020-12-23 06:53:48,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:53:48,906 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2020-12-23 06:53:48,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 06:53:48,907 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2020-12-23 06:53:48,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:53:48,908 INFO L225 Difference]: With dead ends: 87 [2020-12-23 06:53:48,908 INFO L226 Difference]: Without dead ends: 85 [2020-12-23 06:53:48,908 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 [2020-12-23 06:53:48,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-12-23 06:53:48,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 57. [2020-12-23 06:53:48,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-12-23 06:53:48,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2020-12-23 06:53:48,913 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 34 [2020-12-23 06:53:48,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:53:48,914 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2020-12-23 06:53:48,914 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 06:53:48,914 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2020-12-23 06:53:48,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-23 06:53:48,914 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:53:48,915 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 06:53:48,915 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-23 06:53:48,915 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]=== [2020-12-23 06:53:48,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:53:48,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1694514003, now seen corresponding path program 1 times [2020-12-23 06:53:48,916 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:53:48,916 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786827884] [2020-12-23 06:53:48,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:53:48,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:53:48,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 06:53:48,977 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786827884] [2020-12-23 06:53:48,978 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 06:53:48,978 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 06:53:48,978 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281210606] [2020-12-23 06:53:48,978 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 06:53:48,978 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:53:48,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 06:53:48,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 06:53:48,979 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 5 states. [2020-12-23 06:53:49,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:53:49,114 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2020-12-23 06:53:49,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 06:53:49,115 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2020-12-23 06:53:49,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:53:49,115 INFO L225 Difference]: With dead ends: 57 [2020-12-23 06:53:49,116 INFO L226 Difference]: Without dead ends: 55 [2020-12-23 06:53:49,116 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 [2020-12-23 06:53:49,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-12-23 06:53:49,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2020-12-23 06:53:49,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-12-23 06:53:49,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2020-12-23 06:53:49,120 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 35 [2020-12-23 06:53:49,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:53:49,121 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2020-12-23 06:53:49,121 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 06:53:49,121 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2020-12-23 06:53:49,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-12-23 06:53:49,121 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:53:49,122 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] [2020-12-23 06:53:49,122 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-23 06:53:49,122 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]=== [2020-12-23 06:53:49,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:53:49,122 INFO L82 PathProgramCache]: Analyzing trace with hash 635482230, now seen corresponding path program 1 times [2020-12-23 06:53:49,123 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:53:49,123 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997054807] [2020-12-23 06:53:49,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:53:49,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:53:49,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 06:53:49,174 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997054807] [2020-12-23 06:53:49,174 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 06:53:49,174 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 06:53:49,176 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287102785] [2020-12-23 06:53:49,176 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 06:53:49,177 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:53:49,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 06:53:49,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 06:53:49,181 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 4 states. [2020-12-23 06:53:49,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:53:49,226 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2020-12-23 06:53:49,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 06:53:49,227 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2020-12-23 06:53:49,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:53:49,228 INFO L225 Difference]: With dead ends: 66 [2020-12-23 06:53:49,228 INFO L226 Difference]: Without dead ends: 64 [2020-12-23 06:53:49,228 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 [2020-12-23 06:53:49,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-12-23 06:53:49,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 53. [2020-12-23 06:53:49,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-12-23 06:53:49,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2020-12-23 06:53:49,232 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 37 [2020-12-23 06:53:49,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:53:49,232 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2020-12-23 06:53:49,233 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 06:53:49,233 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2020-12-23 06:53:49,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-12-23 06:53:49,233 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:53:49,233 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] [2020-12-23 06:53:49,233 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-23 06:53:49,234 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]=== [2020-12-23 06:53:49,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:53:49,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1774883137, now seen corresponding path program 1 times [2020-12-23 06:53:49,234 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:53:49,235 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563849031] [2020-12-23 06:53:49,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:53:49,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:53:49,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 06:53:49,288 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563849031] [2020-12-23 06:53:49,288 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 06:53:49,288 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 06:53:49,290 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128683953] [2020-12-23 06:53:49,292 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 06:53:49,292 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:53:49,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 06:53:49,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 06:53:49,296 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 5 states. [2020-12-23 06:53:49,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:53:49,340 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2020-12-23 06:53:49,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 06:53:49,341 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2020-12-23 06:53:49,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:53:49,342 INFO L225 Difference]: With dead ends: 62 [2020-12-23 06:53:49,342 INFO L226 Difference]: Without dead ends: 60 [2020-12-23 06:53:49,344 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 [2020-12-23 06:53:49,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-12-23 06:53:49,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 51. [2020-12-23 06:53:49,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-12-23 06:53:49,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2020-12-23 06:53:49,348 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 38 [2020-12-23 06:53:49,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:53:49,349 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2020-12-23 06:53:49,349 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 06:53:49,349 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2020-12-23 06:53:49,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-12-23 06:53:49,349 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:53:49,350 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] [2020-12-23 06:53:49,350 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-23 06:53:49,350 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]=== [2020-12-23 06:53:49,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:53:49,351 INFO L82 PathProgramCache]: Analyzing trace with hash 813201821, now seen corresponding path program 1 times [2020-12-23 06:53:49,354 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:53:49,355 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377216625] [2020-12-23 06:53:49,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:53:49,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:53:49,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 06:53:49,457 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377216625] [2020-12-23 06:53:49,457 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 06:53:49,457 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 06:53:49,457 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795867971] [2020-12-23 06:53:49,457 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 06:53:49,458 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:53:49,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 06:53:49,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 06:53:49,458 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand 5 states. [2020-12-23 06:53:49,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:53:49,674 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2020-12-23 06:53:49,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 06:53:49,675 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2020-12-23 06:53:49,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:53:49,676 INFO L225 Difference]: With dead ends: 84 [2020-12-23 06:53:49,676 INFO L226 Difference]: Without dead ends: 82 [2020-12-23 06:53:49,676 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 [2020-12-23 06:53:49,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2020-12-23 06:53:49,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 56. [2020-12-23 06:53:49,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-12-23 06:53:49,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2020-12-23 06:53:49,681 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 39 [2020-12-23 06:53:49,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:53:49,681 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2020-12-23 06:53:49,681 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 06:53:49,682 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2020-12-23 06:53:49,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-12-23 06:53:49,682 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:53:49,682 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] [2020-12-23 06:53:49,682 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-23 06:53:49,683 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]=== [2020-12-23 06:53:49,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:53:49,683 INFO L82 PathProgramCache]: Analyzing trace with hash -560543098, now seen corresponding path program 1 times [2020-12-23 06:53:49,683 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:53:49,683 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591299639] [2020-12-23 06:53:49,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:53:49,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:53:49,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 06:53:49,760 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591299639] [2020-12-23 06:53:49,760 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 06:53:49,760 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 06:53:49,760 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699446773] [2020-12-23 06:53:49,760 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 06:53:49,761 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:53:49,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 06:53:49,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 06:53:49,761 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 5 states. [2020-12-23 06:53:49,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:53:49,911 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2020-12-23 06:53:49,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 06:53:49,912 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2020-12-23 06:53:49,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:53:49,912 INFO L225 Difference]: With dead ends: 69 [2020-12-23 06:53:49,912 INFO L226 Difference]: Without dead ends: 67 [2020-12-23 06:53:49,913 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 06:53:49,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-12-23 06:53:49,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 54. [2020-12-23 06:53:49,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-12-23 06:53:49,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2020-12-23 06:53:49,918 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 40 [2020-12-23 06:53:49,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:53:49,918 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2020-12-23 06:53:49,918 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 06:53:49,918 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2020-12-23 06:53:49,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-12-23 06:53:49,919 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:53:49,919 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] [2020-12-23 06:53:49,919 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-23 06:53:49,919 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]=== [2020-12-23 06:53:49,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:53:49,920 INFO L82 PathProgramCache]: Analyzing trace with hash 375780089, now seen corresponding path program 1 times [2020-12-23 06:53:49,920 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:53:49,920 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062785053] [2020-12-23 06:53:49,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:53:49,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:53:49,990 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 06:53:49,990 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062785053] [2020-12-23 06:53:49,990 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180451517] [2020-12-23 06:53:49,990 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 [2020-12-23 06:53:50,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:53:50,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 11 conjunts are in the unsatisfiable core [2020-12-23 06:53:50,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 06:53:50,238 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 06:53:50,238 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 06:53:50,238 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 7 [2020-12-23 06:53:50,238 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6526349] [2020-12-23 06:53:50,239 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 06:53:50,239 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:53:50,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 06:53:50,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-12-23 06:53:50,240 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 7 states. [2020-12-23 06:53:50,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:53:50,440 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2020-12-23 06:53:50,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 06:53:50,441 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2020-12-23 06:53:50,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:53:50,442 INFO L225 Difference]: With dead ends: 56 [2020-12-23 06:53:50,442 INFO L226 Difference]: Without dead ends: 54 [2020-12-23 06:53:50,442 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-12-23 06:53:50,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-12-23 06:53:50,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2020-12-23 06:53:50,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-12-23 06:53:50,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2020-12-23 06:53:50,447 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 40 [2020-12-23 06:53:50,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:53:50,447 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2020-12-23 06:53:50,447 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 06:53:50,447 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2020-12-23 06:53:50,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-12-23 06:53:50,448 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:53:50,448 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] [2020-12-23 06:53:50,662 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2020-12-23 06:53:50,663 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]=== [2020-12-23 06:53:50,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:53:50,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1394778411, now seen corresponding path program 1 times [2020-12-23 06:53:50,665 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:53:50,665 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812521782] [2020-12-23 06:53:50,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:53:50,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:53:50,728 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-23 06:53:50,728 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812521782] [2020-12-23 06:53:50,729 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 06:53:50,729 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 06:53:50,729 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322996457] [2020-12-23 06:53:50,729 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 06:53:50,729 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:53:50,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 06:53:50,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 06:53:50,730 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 5 states. [2020-12-23 06:53:50,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:53:50,944 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2020-12-23 06:53:50,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 06:53:50,945 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2020-12-23 06:53:50,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:53:50,945 INFO L225 Difference]: With dead ends: 71 [2020-12-23 06:53:50,946 INFO L226 Difference]: Without dead ends: 0 [2020-12-23 06:53:50,946 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-23 06:53:50,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-12-23 06:53:50,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-12-23 06:53:50,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-12-23 06:53:50,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-12-23 06:53:50,947 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2020-12-23 06:53:50,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:53:50,947 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-12-23 06:53:50,947 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 06:53:50,947 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-12-23 06:53:50,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-12-23 06:53:50,948 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-12-23 06:53:50,950 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-12-23 06:53:51,365 WARN L197 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 29 [2020-12-23 06:53:51,984 WARN L197 SmtUtils]: Spent 616.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 63 [2020-12-23 06:53:52,189 WARN L197 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 27 [2020-12-23 06:53:52,735 WARN L197 SmtUtils]: Spent 541.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 70 [2020-12-23 06:53:52,744 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 97) no Hoare annotation was computed. [2020-12-23 06:53:52,744 INFO L189 CegarLoopUtils]: For program point L85(line 85) no Hoare annotation was computed. [2020-12-23 06:53:52,744 INFO L189 CegarLoopUtils]: For program point L234(lines 234 338) no Hoare annotation was computed. [2020-12-23 06:53:52,744 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 272) no Hoare annotation was computed. [2020-12-23 06:53:52,745 INFO L189 CegarLoopUtils]: For program point L135(lines 135 397) no Hoare annotation was computed. [2020-12-23 06:53:52,745 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-12-23 06:53:52,745 INFO L189 CegarLoopUtils]: For program point L284(line 284) no Hoare annotation was computed. [2020-12-23 06:53:52,745 INFO L189 CegarLoopUtils]: For program point L53(lines 53 433) no Hoare annotation was computed. [2020-12-23 06:53:52,745 INFO L189 CegarLoopUtils]: For program point L384(lines 384 393) no Hoare annotation was computed. [2020-12-23 06:53:52,745 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 255) no Hoare annotation was computed. [2020-12-23 06:53:52,746 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)))) [2020-12-23 06:53:52,746 INFO L189 CegarLoopUtils]: For program point L104(lines 104 411) no Hoare annotation was computed. [2020-12-23 06:53:52,746 INFO L189 CegarLoopUtils]: For program point L71(lines 71 416) no Hoare annotation was computed. [2020-12-23 06:53:52,746 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 177) no Hoare annotation was computed. [2020-12-23 06:53:52,746 INFO L189 CegarLoopUtils]: For program point L253(lines 253 329) no Hoare annotation was computed. [2020-12-23 06:53:52,746 INFO L189 CegarLoopUtils]: For program point L187(lines 187 355) no Hoare annotation was computed. [2020-12-23 06:53:52,746 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION(line 386) no Hoare annotation was computed. [2020-12-23 06:53:52,746 INFO L189 CegarLoopUtils]: For program point L270(lines 270 322) no Hoare annotation was computed. [2020-12-23 06:53:52,746 INFO L189 CegarLoopUtils]: For program point L204(lines 204 353) no Hoare annotation was computed. [2020-12-23 06:53:52,746 INFO L189 CegarLoopUtils]: For program point L386(line 386) no Hoare annotation was computed. [2020-12-23 06:53:52,746 INFO L189 CegarLoopUtils]: For program point L155(lines 155 360) no Hoare annotation was computed. [2020-12-23 06:53:52,746 INFO L189 CegarLoopUtils]: For program point L23(lines 23 438) no Hoare annotation was computed. [2020-12-23 06:53:52,746 INFO L189 CegarLoopUtils]: For program point L255(line 255) no Hoare annotation was computed. [2020-12-23 06:53:52,747 INFO L189 CegarLoopUtils]: For program point L189(line 189) no Hoare annotation was computed. [2020-12-23 06:53:52,747 INFO L189 CegarLoopUtils]: For program point L123(lines 123 403) no Hoare annotation was computed. [2020-12-23 06:53:52,747 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 214) no Hoare annotation was computed. [2020-12-23 06:53:52,747 INFO L189 CegarLoopUtils]: For program point L272(line 272) no Hoare annotation was computed. [2020-12-23 06:53:52,747 INFO L189 CegarLoopUtils]: For program point L41(lines 41 435) no Hoare annotation was computed. [2020-12-23 06:53:52,747 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-12-23 06:53:52,747 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 189) no Hoare annotation was computed. [2020-12-23 06:53:52,747 INFO L189 CegarLoopUtils]: For program point L157(line 157) no Hoare annotation was computed. [2020-12-23 06:53:52,747 INFO L189 CegarLoopUtils]: For program point L372(lines 372 395) no Hoare annotation was computed. [2020-12-23 06:53:52,747 INFO L189 CegarLoopUtils]: For program point L306(lines 306 316) no Hoare annotation was computed. [2020-12-23 06:53:52,747 INFO L189 CegarLoopUtils]: For program point L224(lines 224 344) no Hoare annotation was computed. [2020-12-23 06:53:52,747 INFO L189 CegarLoopUtils]: For program point L125(line 125) no Hoare annotation was computed. [2020-12-23 06:53:52,747 INFO L189 CegarLoopUtils]: For program point L59(lines 59 432) no Hoare annotation was computed. [2020-12-23 06:53:52,748 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 113) no Hoare annotation was computed. [2020-12-23 06:53:52,748 INFO L189 CegarLoopUtils]: For program point L241(lines 241 331) no Hoare annotation was computed. [2020-12-23 06:53:52,748 INFO L189 CegarLoopUtils]: For program point L175(lines 175 357) no Hoare annotation was computed. [2020-12-23 06:53:52,748 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 284) no Hoare annotation was computed. [2020-12-23 06:53:52,748 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 226) no Hoare annotation was computed. [2020-12-23 06:53:52,748 INFO L189 CegarLoopUtils]: For program point L374(line 374) no Hoare annotation was computed. [2020-12-23 06:53:52,748 INFO L189 CegarLoopUtils]: For program point L308(line 308) no Hoare annotation was computed. [2020-12-23 06:53:52,748 INFO L189 CegarLoopUtils]: For program point L143(lines 143 362) no Hoare annotation was computed. [2020-12-23 06:53:52,748 INFO L189 CegarLoopUtils]: For program point L226(line 226) no Hoare annotation was computed. [2020-12-23 06:53:52,748 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 145) no Hoare annotation was computed. [2020-12-23 06:53:52,748 INFO L189 CegarLoopUtils]: For program point L61(lines 61 427) no Hoare annotation was computed. [2020-12-23 06:53:52,748 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-12-23 06:53:52,748 INFO L189 CegarLoopUtils]: For program point L243(line 243) no Hoare annotation was computed. [2020-12-23 06:53:52,748 INFO L189 CegarLoopUtils]: For program point L177(line 177) no Hoare annotation was computed. [2020-12-23 06:53:52,749 INFO L189 CegarLoopUtils]: For program point L111(lines 111 405) no Hoare annotation was computed. [2020-12-23 06:53:52,749 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 308) no Hoare annotation was computed. [2020-12-23 06:53:52,749 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)) [2020-12-23 06:53:52,749 INFO L189 CegarLoopUtils]: For program point L194(lines 194 354) no Hoare annotation was computed. [2020-12-23 06:53:52,749 INFO L189 CegarLoopUtils]: For program point L95(lines 95 412) no Hoare annotation was computed. [2020-12-23 06:53:52,749 INFO L189 CegarLoopUtils]: For program point L29(lines 29 437) no Hoare annotation was computed. [2020-12-23 06:53:52,749 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 125) no Hoare annotation was computed. [2020-12-23 06:53:52,749 INFO L189 CegarLoopUtils]: For program point L145(line 145) no Hoare annotation was computed. [2020-12-23 06:53:52,750 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 296) no Hoare annotation was computed. [2020-12-23 06:53:52,750 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)) [2020-12-23 06:53:52,750 INFO L189 CegarLoopUtils]: For program point L294(lines 294 318) no Hoare annotation was computed. [2020-12-23 06:53:52,750 INFO L189 CegarLoopUtils]: For program point L162(lines 162 359) no Hoare annotation was computed. [2020-12-23 06:53:52,750 INFO L189 CegarLoopUtils]: For program point L63(lines 63 422) no Hoare annotation was computed. [2020-12-23 06:53:52,750 INFO L185 CegarLoopUtils]: At program point L410(lines 104 411) the Hoare annotation is: (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~0 0)) [2020-12-23 06:53:52,751 INFO L189 CegarLoopUtils]: For program point L212(lines 212 346) no Hoare annotation was computed. [2020-12-23 06:53:52,751 INFO L189 CegarLoopUtils]: For program point L113(line 113) no Hoare annotation was computed. [2020-12-23 06:53:52,751 INFO L189 CegarLoopUtils]: For program point L47(lines 47 434) no Hoare annotation was computed. [2020-12-23 06:53:52,751 INFO L189 CegarLoopUtils]: For program point L262(lines 262 328) no Hoare annotation was computed. [2020-12-23 06:53:52,751 INFO L189 CegarLoopUtils]: For program point L97(line 97) no Hoare annotation was computed. [2020-12-23 06:53:52,751 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 157) no Hoare annotation was computed. [2020-12-23 06:53:52,751 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 374) no Hoare annotation was computed. [2020-12-23 06:53:52,751 INFO L189 CegarLoopUtils]: For program point L296(line 296) no Hoare annotation was computed. [2020-12-23 06:53:52,751 INFO L189 CegarLoopUtils]: For program point L65(lines 65 417) no Hoare annotation was computed. [2020-12-23 06:53:52,752 INFO L189 CegarLoopUtils]: For program point L-1(line -1) no Hoare annotation was computed. [2020-12-23 06:53:52,752 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 85) no Hoare annotation was computed. [2020-12-23 06:53:52,752 INFO L189 CegarLoopUtils]: For program point L214(line 214) no Hoare annotation was computed. [2020-12-23 06:53:52,752 INFO L189 CegarLoopUtils]: For program point L83(lines 83 414) no Hoare annotation was computed. [2020-12-23 06:53:52,752 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))) [2020-12-23 06:53:52,752 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 243) no Hoare annotation was computed. [2020-12-23 06:53:52,752 INFO L189 CegarLoopUtils]: For program point L282(lines 282 320) no Hoare annotation was computed. [2020-12-23 06:53:52,753 INFO L192 CegarLoopUtils]: At program point L431(lines 13 439) the Hoare annotation is: true [2020-12-23 06:53:52,753 INFO L189 CegarLoopUtils]: For program point L35(lines 35 436) no Hoare annotation was computed. [2020-12-23 06:53:52,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.12 06:53:52 BoogieIcfgContainer [2020-12-23 06:53:52,781 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-23 06:53:52,781 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-23 06:53:52,781 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-23 06:53:52,781 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-23 06:53:52,782 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 06:53:43" (3/4) ... [2020-12-23 06:53:52,785 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-12-23 06:53:52,800 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2020-12-23 06:53:52,801 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-12-23 06:53:52,802 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-23 06:53:52,802 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-23 06:53:52,902 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c-witness.graphml [2020-12-23 06:53:52,903 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-23 06:53:52,904 INFO L168 Benchmark]: Toolchain (without parser) took 10742.05 ms. Allocated memory was 154.1 MB in the beginning and 185.6 MB in the end (delta: 31.5 MB). Free memory was 129.1 MB in the beginning and 164.1 MB in the end (delta: -35.0 MB). Peak memory consumption was 104.6 MB. Max. memory is 8.0 GB. [2020-12-23 06:53:52,904 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 154.1 MB. Free memory is still 137.1 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-12-23 06:53:52,904 INFO L168 Benchmark]: CACSL2BoogieTranslator took 488.62 ms. Allocated memory is still 154.1 MB. Free memory was 129.0 MB in the beginning and 109.5 MB in the end (delta: 19.5 MB). Peak memory consumption was 19.9 MB. Max. memory is 8.0 GB. [2020-12-23 06:53:52,905 INFO L168 Benchmark]: Boogie Procedure Inliner took 113.41 ms. Allocated memory is still 154.1 MB. Free memory was 109.5 MB in the beginning and 107.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-12-23 06:53:52,905 INFO L168 Benchmark]: Boogie Preprocessor took 85.13 ms. Allocated memory is still 154.1 MB. Free memory was 107.4 MB in the beginning and 136.1 MB in the end (delta: -28.7 MB). Peak memory consumption was 4.0 MB. Max. memory is 8.0 GB. [2020-12-23 06:53:52,905 INFO L168 Benchmark]: RCFGBuilder took 735.68 ms. Allocated memory is still 154.1 MB. Free memory was 136.1 MB in the beginning and 108.9 MB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 8.0 GB. [2020-12-23 06:53:52,906 INFO L168 Benchmark]: TraceAbstraction took 9181.82 ms. Allocated memory was 154.1 MB in the beginning and 185.6 MB in the end (delta: 31.5 MB). Free memory was 108.5 MB in the beginning and 63.2 MB in the end (delta: 45.3 MB). Peak memory consumption was 83.8 MB. Max. memory is 8.0 GB. [2020-12-23 06:53:52,906 INFO L168 Benchmark]: Witness Printer took 121.60 ms. Allocated memory is still 185.6 MB. Free memory was 63.2 MB in the beginning and 164.1 MB in the end (delta: -100.9 MB). Peak memory consumption was 6.3 MB. Max. memory is 8.0 GB. [2020-12-23 06:53:52,908 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.21 ms. Allocated memory is still 154.1 MB. Free memory is still 137.1 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 488.62 ms. Allocated memory is still 154.1 MB. Free memory was 129.0 MB in the beginning and 109.5 MB in the end (delta: 19.5 MB). Peak memory consumption was 19.9 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 113.41 ms. Allocated memory is still 154.1 MB. Free memory was 109.5 MB in the beginning and 107.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 85.13 ms. Allocated memory is still 154.1 MB. Free memory was 107.4 MB in the beginning and 136.1 MB in the end (delta: -28.7 MB). Peak memory consumption was 4.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 735.68 ms. Allocated memory is still 154.1 MB. Free memory was 136.1 MB in the beginning and 108.9 MB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 8.0 GB. * TraceAbstraction took 9181.82 ms. Allocated memory was 154.1 MB in the beginning and 185.6 MB in the end (delta: 31.5 MB). Free memory was 108.5 MB in the beginning and 63.2 MB in the end (delta: 45.3 MB). Peak memory consumption was 83.8 MB. Max. memory is 8.0 GB. * Witness Printer took 121.60 ms. Allocated memory is still 185.6 MB. Free memory was 63.2 MB in the beginning and 164.1 MB in the end (delta: -100.9 MB). Peak memory consumption was 6.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: 7.2s, OverallIterations: 23, TraceHistogramMax: 2, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1245 SDtfs, 2415 SDslu, 1444 SDs, 0 SdLazy, 1187 SolverSat, 130 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 258 GetRequests, 128 SyntacticMatches, 7 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.8s 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.1s 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, 1.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s 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...